f | [Path 1]: | f | [Path 1]: |
n | 0: Start of execution: Begining Search | n | 0: Start of execution: Beginning Search |
| 1: Searching: query(Candidate Variable_0) | | 1: Searching: query(Candidate Variable_0) |
| 2: Searching: bobby_s_games(20, Candidate Variable_0) | | 2: Searching: bobby_s_games(20, Candidate Variable_0) |
| 3: Searching: _14512 is 3*20 | | 3: Searching: _14512 is 3*20 |
| 4: Found: 60 is 3*20 | | 4: Found: 60 is 3*20 |
n | 5: Searching: _15748 is 60-5 | n | 5: Searching: _5830 is 60-5 |
| 6: Found: 55 is 60-5 | | 6: Found: 55 is 60-5 |
| 7: Found: bobby_s_games(20, 55) | | 7: Found: bobby_s_games(20, 55) |
| 8: Found: query(55) | {'Result': 'BobbyGames = 55'} | | 8: Found: query(55) | {'Result': 'BobbyGames = 55'} |
| | | |
t | | t | |
| The search paths clearly show how SWI-Prolog infers the relationship between Brian's and Bobby's video game counts to reach the correct conclusion. | | |