f | [Path 1]: | f | [Path 1]: |
n | 0: Start of execution | n | 0: Start of execution: Beginning Search |
| 1: Searching: query | | 1: Searching: query |
| 2: Searching: brother_in_law(william, dorothy) | | 2: Searching: brother_in_law(william, dorothy) |
| 3: Searching: uncle(william, dorothy) | | 3: Searching: uncle(william, dorothy) |
n | 4: Searching: parent(Candidate Variable_0, rachel) | n | 4: Searching: parent(Candidate Variable_0, dorothy) |
| 5: Found: parent(frank, rachel) | | 5: Fail: parent(Candidate Variable_0, dorothy) | {'Result': 'Search Failed'} |
| 6: Searching: married(Candidate Variable_0, william) | | 6: Fail: uncle(william, dorothy) | {'Result': 'Search Failed'} |
| 7: Found: married(frank, dorothy) | | 7: Fail: brother_in_law(william, dorothy) | {'Result': 'Search Failed'} |
| 8: Found: uncle(william, dorothy) | | 8: Fail: query | {'Result': 'Search Failed'} |
| 9: Found: brother_in_law(william, dorothy) | | |
| 10: Comment: William is Dorothy's brother-in-law. | | |
| 11: Found: query | {'Result': 'truth = True'} | | |
| | | |
t | The code successfully proves the relationship. | t | |