The bear needs the cow. The cow needs the dog. The dog sees the cow. If someone sees the cow and the cow needs the dog then they are red.
The bear needs the cow.
("bear" "needs" "cow" "+")
The cow needs the dog.
("cow" "needs" "dog" "+")
The dog sees the cow.
("dog" "sees" "cow" "+")
If someone sees the cow and the cow needs the dog then they are red.
((("someone" "sees" "cow" "+") ("cow" "needs" "dog" "+")) -> ("someone" "is" "red" "+"))
The bear needs the cow.
True
1
proof
[(triple1)]
("bear" "needs" "cow" "+")
triple1
The dog does not see the cow.
False
1
inv-proof
[(triple3)]
("dog" "sees" "cow" "-")
triple3
The dog is red.
True
3
proof
[(((triple3 triple2) -> rule1))]
("dog" "is" "red" "+")
((triple3 triple2) -> (rule1 % int1))
The dog is red.
("dog" "is" "red" "+")
int1
The dog is not red.
False
3
inv-proof
[(((triple3 triple2) -> rule1))]
("dog" "is" "red" "-")
((triple3 triple2) -> (rule1 % int1))
The dog is red.
("dog" "is" "red" "+")
int1
The bear is not red.
Unknown
inv-rconc
[@1: The bear is red.[CWA. Example of deepest failure = (rule1 <- FAIL)]]
("bear" "is" "red" "-")
The cow is red.
Unknown
rconc
[@1: The cow is red.[CWA. Example of deepest failure = (rule1 <- FAIL)]]
("cow" "is" "red" "+")
The cow is not blue.
Unknown
inv-random
[@0: The cow is blue.[CWA. Example of deepest failure = (FAIL)]]
("cow" "is" "blue" "-")
The dog likes the bear.
Unknown
random
[@0: The dog likes the bear.[CWA. Example of deepest failure = (FAIL)]]
("dog" "likes" "bear" "+")
@0: The bear needs the cow.[(triple1)] The cow needs the dog.[(triple2)] The dog sees the cow.[(triple3)] @1: The dog is red.[(((triple3 triple2) -> rule1))]
The bear needs the cow.
("bear" "needs" "cow" "+")
triple1
The cow needs the dog.
("cow" "needs" "dog" "+")
triple2
The dog sees the cow.
("dog" "sees" "cow" "+")
triple3
The dog is red.
("dog" "is" "red" "+")
((triple3 triple2) -> (rule1 % int1))
The dog is red.
("dog" "is" "red" "+")
int1