The bear likes the rabbit. The dog does not like the rabbit. The rabbit likes the dog. If the dog likes the bear then the bear visits the dog.
The bear likes the rabbit.
("bear" "likes" "rabbit" "+")
The dog does not like the rabbit.
("dog" "likes" "rabbit" "-")
The rabbit likes the dog.
("rabbit" "likes" "dog" "+")
If the dog likes the bear then the bear visits the dog.
((("dog" "likes" "bear" "+")) -> ("bear" "visits" "dog" "+"))
The rabbit likes the dog.
True
1
proof
[(triple3)]
("rabbit" "likes" "dog" "+")
triple3
The bear does not like the rabbit.
False
1
inv-proof
[(triple1)]
("bear" "likes" "rabbit" "-")
triple1
The bear does not visit the dog.
Unknown
inv-rconc
[@1: The bear visits the dog.[CWA. Example of deepest failure = (rule1 <- FAIL)]]
("bear" "visits" "dog" "-")
The rabbit likes the rabbit.
Unknown
random
[@0: The rabbit likes the rabbit.[CWA. Example of deepest failure = (FAIL)]]
("rabbit" "likes" "rabbit" "+")
@0: The bear likes the rabbit.[(triple1)] The dog does not like the rabbit.[(triple2)] The rabbit likes the dog.[(triple3)]
The bear likes the rabbit.
("bear" "likes" "rabbit" "+")
triple1
The dog does not like the rabbit.
("dog" "likes" "rabbit" "-")
triple2
The rabbit likes the dog.
("rabbit" "likes" "dog" "+")
triple3