f | 1 | [Path 1]: | f | 1 | [Path 1]:
| 2 | 0: Start of execution: Beginning Search |  | 2 | 0: Start of execution: Beginning Search
| 3 | 1: Searching: query(Candidate Variable_0) |  | 3 | 1: Searching: query(Candidate Variable_0)
| 4 | 2: Searching: price_difference(78, 113, 115, Candidate Variable_0) |  | 4 | 2: Searching: price_difference(78, 113, 115, Candidate Variable_0)
n | 5 | 3: Searching: _13904 is 78*115 | n | 5 | 3: Fail: price_difference(78, 113, 115, Candidate Variable_0) | {'Result': 'Search Failed'}
| 6 | 4: Found: 9190 is 78*115 |  | 6 | 4: Fail: query(Candidate Variable_0) | {'Result': 'Search Failed'}
| 7 | 5: Searching: _15130 is 113*25 |  |  |
| 8 | 6: Found: 2825 is 113*25 |  |  |
| 9 | 7: Searching: _5834 is 9190-2825 |  |  |
| 10 | 8: Found: 6365 is 9190-2825 |  |  |
| 11 | 9: Found: price_difference(78, 113, 115, 6365) |  |  |
| 12 | 10: Found: query(6365) | {'Result': 'PriceDifference = 6365'} |  |  |
| 13 |  |  | 7 |
t | 14 | The code efficiently computes the result using SWI-Prolog's arithmetic capabilities without any backtracking. | t |  |

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