f | [Path 1]: | f | [Path 1]: |
n | 0: Start of execution: Beginning Search | n | 0: Start of execution: Beginning Search |
| 1: Searching: query(Candidate Variable_0) | | 1: Searching: query(Candidate Variable_0) |
| | | 2: Searching: _13900=171 |
| | | 3: Found: 171=171 |
| | | 4: Searching: _15126=134 |
| | | 5: Found: 134=134 |
| | | 6: Searching: _16352=30 |
| | | 7: Found: 30=30 |
| 2: Searching: remaining_tomatoes(171, 134, 30, Candidate Variable_0) | | 8: Searching: remaining_tomatoes(171, 134, 30, Candidate Variable_0) |
| 3: Searching: _14524 is 134+30 | | 9: Searching: _18198 is 134+30 |
| 4: Found: 164 is 134+30 | | 10: Found: 164 is 134+30 |
| 5: Searching: _5834 is 171-164 | | 11: Searching: _5830 is 171-164 |
| 6: Found: 7 is 171-164 | | 12: Found: 7 is 171-164 |
| 7: Found: remaining_tomatoes(171, 134, 30, 7) | | 13: Found: remaining_tomatoes(171, 134, 30, 7) |
| 8: Found: query(7) | {'Result': 'RemainingTomatoes = 7'} | | 14: Found: query(7) | {'Result': 'RemainingTomatoes = 7'} |
| | | |
t | The Prolog code successfully determines that the farmer will have 7 tomatoes left after yesterday's and today's tomato-picking sessions. | t | |