f1[Path 1]:f1[Path 1]:
n2 0: Start of executionn2 0: Start of execution: Beginning Search
3 1: Searching: query3 1: Searching: query
4 2: Searching: brother_in_law(william, dorothy)4 2: Searching: brother_in_law(william, dorothy)
5 3: Searching: uncle(william, dorothy)5 3: Searching: uncle(william, dorothy)
n6 4: Searching: parent(Candidate Variable_0, rachel)n6 4: Searching: parent(Candidate Variable_0, dorothy)
7 5: Found: parent(frank, rachel)7 5: Fail: parent(Candidate Variable_0, dorothy) | {'Result': 'Search Failed'}
8 6: Searching: married(Candidate Variable_0, william)8 6: Fail: uncle(william, dorothy) | {'Result': 'Search Failed'}
9 7: Found: married(frank, dorothy)9 7: Fail: brother_in_law(william, dorothy) | {'Result': 'Search Failed'}
10 8: Found: uncle(william, dorothy)10 8: Fail: query | {'Result': 'Search Failed'}
11 9: Found: brother_in_law(william, dorothy)
12 10: Comment: William is Dorothy's brother-in-law.
13 11: Found: query | {'Result': 'truth = True'}
1411
t15The code successfully proves the relationship.t
Legends
Colors
 Added 
Changed
Deleted
Links
(f)irst change
(n)ext change
(t)op