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 |  | 3 | 1: Searching: query
| 4 | 2: Searching: related(thomas, davis) |  | 4 | 2: Searching: related(thomas, davis)
| 5 | 3: Searching: parent(thomas, Candidate Variable_0) |  | 5 | 3: Searching: parent(thomas, Candidate Variable_0)
| 6 | 4: Found: parent(thomas, phillip) |  | 6 | 4: Found: parent(thomas, phillip)
n | 7 | 5: Searching: uncle(Candidate Variable_0, matthew) | n | 7 | 5: Searching: uncle(phillip, Candidate Variable_1)
| 8 | 6: Found: uncle(phillip, matthew) |  | 8 | 6: Fail: uncle(phillip, Candidate Variable_1) | {'Result': 'Search Failed'}
| 9 | 7: Searching: grandparent(matthew, davis) |  | 9 | 7: Fail: related(thomas, davis) | {'Result': 'Search Failed'}
| 10 | 8: Fail: grandparent(matthew, davis) |  | 10 | 8: Fail: query | {'Result': 'Search Failed'}
| 11 | 9: Redo from parent(thomas, Candidate Variable_0) |  |  |
| 12 | 10: Found: parent(thomas, phillip) |  |  |
| 13 | 11: Searching: uncle(phillip, matthew) |  |  |
| 14 | 12: Fail: uncle(phillip, matthew) |  |  |
| 15 | 13: Redo from parent(thomas, Candidate Variable_0) |  |  |
| 16 | 14: No more solutions, backtracking |  |  |
| 17 | 15: Fail: related(thomas, davis) |  |  |
| 18 | 16: Fail: query. |  |  |
| 19 |  |  | 11 |
t | 20 | [Path 2]: | t |  |
| 21 | 0: Start of execution: Beginning Search |  |  |
| 22 | 1: Searching: query |  |  |
| 23 | 2: Searching: related(thomas, davis) |  |  |
| 24 | 3: Searching: parent(thomas, Candidate Variable_0) |  |  |
| 25 | 4: Found: parent(thomas, phillip) |  |  |
| 26 | 5: Searching: uncle(Candidate Variable_0, matthew) |  |  |
| 27 | 6: Found: uncle(phillip, matthew) |  |  |
| 28 | 7: Searching: grandparent(matthew, davis) |  |  |
| 29 | 8: Fail: grandparent(matthew, davis) |  |  |
| 30 | 9: Redo from parent(thomas, Candidate Variable_1) |  |  |
| 31 | 10: No more solutions, backtracking |  |  |
| 32 | 11: Fail: related(thomas, davis) |  |  |
| 33 | 12: Fail: query. |  |  |
| 34 |  |  |  |
| 35 | [Path 3]: |  |  |
| 36 | 0: Start of execution: Beginning Search |  |  |
| 37 | 1: Searching: query |  |  |
| 38 | 2: Searching: related(thomas, davis) |  |  |
| 39 | 3: Searching: parent(thomas, phillip) |  |  |
| 40 | 4: Found: parent(thomas, phillip) |  |  |
| 41 | 5: Searching: uncle(phillip, matthew) |  |  |
| 42 | 6: Fail: uncle(phillip, matthew) |  |  |
| 43 | 7: Redo from parent(thomas, Candidate Variable_0) |  |  |
| 44 | 8: No more solutions, backtracking |  |  |
| 45 | 9: Fail: related(thomas, davis) |  |  |
| 46 | 10: Fail: query. |  |  |
| 47 |  |  |  |
| 48 | There was an error in the code where the grandparent relationship was incorrectly placed as grandparent(Matthew, Davis). Since Matthew is the nephew of Kent (who is Davis's grandfather), the correct relationship should be grandparent(Kent, Davis). This error causes the program to fail in finding the solution. |  |  |

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