The bear is rough. The bear needs the tiger. The cat is nice. The cat likes the cow. The cat visits the bear. The cat visits the tiger. The cow is green. The tiger is green. The tiger needs the bear. The tiger does not visit the cow. If something is nice then it visits the cow. If something needs the tiger then it does not like the bear.
The bear is rough.
("bear" "is" "rough" "+")
The bear needs the tiger.
("bear" "needs" "tiger" "+")
The cat is nice.
("cat" "is" "nice" "+")
The cat likes the cow.
("cat" "likes" "cow" "+")
The cat visits the bear.
("cat" "visits" "bear" "+")
The cat visits the tiger.
("cat" "visits" "tiger" "+")
The cow is green.
("cow" "is" "green" "+")
The tiger is green.
("tiger" "is" "green" "+")
The tiger needs the bear.
("tiger" "needs" "bear" "+")
The tiger does not visit the cow.
("tiger" "visits" "cow" "-")
If something is nice then it visits the cow.
((("something" "is" "nice" "+")) -> ("something" "visits" "cow" "+"))
If something needs the tiger then it does not like the bear.
((("something" "needs" "tiger" "+")) -> ("something" "likes" "bear" "-"))
The bear needs the tiger.
True
1
proof
[(triple2)]
("bear" "needs" "tiger" "+")
triple2
The tiger visits the cow.
False
1
inv-proof
[(triple10)]
("tiger" "visits" "cow" "+")
triple10
The cat visits the cow.
True
2
proof
[(((triple3) -> rule1))]
("cat" "visits" "cow" "+")
((triple3) -> (rule1 % int1))
The cat visits the cow.
("cat" "visits" "cow" "+")
int1
The bear likes the bear.
False
2
inv-proof
[(((triple2) -> rule2))]
("bear" "likes" "bear" "+")
((triple2) -> (rule2 % int1))
The bear does not like the bear.
("bear" "likes" "bear" "-")
int1
The bear does not visit the cow.
Unknown
inv-rconc
[@1: The bear visits the cow.[CWA. Example of deepest failure = (rule1 <- FAIL)]]
("bear" "visits" "cow" "-")
The cow visits the cow.
Unknown
rconc
[@1: The cow visits the cow.[CWA. Example of deepest failure = (rule1 <- FAIL)]]
("cow" "visits" "cow" "+")
The cow does not need the cow.
Unknown
inv-random
[@0: The cow needs the cow.[CWA. Example of deepest failure = (FAIL)]]
("cow" "needs" "cow" "-")
The cat is green.
Unknown
random
[@0: The cat is green.[CWA. Example of deepest failure = (FAIL)]]
("cat" "is" "green" "+")
@0: The bear is rough.[(triple1)] The bear needs the tiger.[(triple2)] The cat is nice.[(triple3)] The cat likes the cow.[(triple4)] The cat visits the bear.[(triple5)] The cat visits the tiger.[(triple6)] The cow is green.[(triple7)] The tiger does not visit the cow.[(triple10)] The tiger is green.[(triple8)] The tiger needs the bear.[(triple9)] @1: The bear does not like the bear.[(((triple2) -> rule2))] The cat visits the cow.[(((triple3) -> rule1))]
The bear is rough.
("bear" "is" "rough" "+")
triple1
The bear needs the tiger.
("bear" "needs" "tiger" "+")
triple2
The cat is nice.
("cat" "is" "nice" "+")
triple3
The cat likes the cow.
("cat" "likes" "cow" "+")
triple4
The cat visits the bear.
("cat" "visits" "bear" "+")
triple5
The cat visits the tiger.
("cat" "visits" "tiger" "+")
triple6
The cow is green.
("cow" "is" "green" "+")
triple7
The tiger does not visit the cow.
("tiger" "visits" "cow" "-")
triple10
The tiger is green.
("tiger" "is" "green" "+")
triple8
The tiger needs the bear.
("tiger" "needs" "bear" "+")
triple9
The bear does not like the bear.
("bear" "likes" "bear" "-")
((triple2) -> (rule2 % int1))
The bear does not like the bear.
("bear" "likes" "bear" "-")
int1
The cat visits the cow.
("cat" "visits" "cow" "+")
((triple3) -> (rule1 % int1))
The cat visits the cow.
("cat" "visits" "cow" "+")
int1