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: grow_limbs(15, Candidate Variable_1, Candidate Variable_2) |  | 4 | 2: Searching: grow_limbs(15, Candidate Variable_1, Candidate Variable_2)
n | 5 | 3: Searching: _14512 is 15/3*2 | n | 5 | 3: Fail: grow_limbs(15, Candidate Variable_1, Candidate Variable_2) | {'Result': 'Search Failed'}
| 6 | 4: Found: 10 is 15/3*2 |  | 6 | 4: Fail: query(Candidate Variable_0) | {'Result': 'Search Failed'}
| 7 | 5: Searching: _15736 is 15/5 |  |  |
| 8 | 6: Found: 3 is 15/5 |  |  |
| 9 | 7: Searching: _16962 is 10+3 |  |  |
| 10 | 8: Found: 13 is 10+3 |  |  |
| 11 | 9: Found: grow_limbs(15, 10, 3) |  |  |
| 12 | 10: Found: query(13) | {'Result': 'TotalLimbs = 13'} |  |  |
| 13 |  |  | 7 |
t | 14 |  | t |  |
| 15 | The code efficiently calculates the number of new limbs using Prolog's arithmetic capabilities, demonstrating its utility in handling mathematical problems with logical rules. |  |  |

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