f | 1 | [Path 1]: | f | 1 | [Path 1]:
n | 2 | 0: Start of execution: Begining Search | n | 2 | 0: Start of execution: Beginning Search
| 3 | 1: Searching: query(Candidate Variable_0) |  | 3 | 1: Searching: query(Candidate Variable_0)
| 4 | 2: Searching: bobby_s_games(20, Candidate Variable_0) |  | 4 | 2: Searching: bobby_s_games(20, Candidate Variable_0)
| 5 | 3: Searching: _14512 is 3*20 |  | 5 | 3: Searching: _14512 is 3*20
| 6 | 4: Found: 60 is 3*20 |  | 6 | 4: Found: 60 is 3*20
n | 7 | 5: Searching: _15748 is 60-5 | n | 7 | 5: Searching: _5830 is 60-5
| 8 | 6: Found: 55 is 60-5 |  | 8 | 6: Found: 55 is 60-5
| 9 | 7: Found: bobby_s_games(20, 55) |  | 9 | 7: Found: bobby_s_games(20, 55)
| 10 | 8: Found: query(55) | {'Result': 'BobbyGames = 55'} |  | 10 | 8: Found: query(55) | {'Result': 'BobbyGames = 55'}
| 11 |  |  | 11 |
t | 12 |  | t |  |
| 13 | 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. |  |  |

Legends
Colors
Added
Changed
Deleted
Links
(f)irst change
(n)ext change
(t)op