The bear does not need the cow. The cow needs the bear. If something needs the bear then it likes the cow.
The bear does not need the cow.
("bear" "needs" "cow" "-")
The cow needs the bear.
("cow" "needs" "bear" "+")
If something needs the bear then it likes the cow.
((("something" "needs" "bear" "+")) -> ("something" "likes" "cow" "+"))
The bear does not need the cow.
True
1
proof
[(triple1)]
("bear" "needs" "cow" "-")
triple1
The bear needs the cow.
False
1
inv-proof
[(triple1)]
("bear" "needs" "cow" "+")
triple1
The cow likes the cow.
True
2
proof
[(((triple2) -> rule1))]
("cow" "likes" "cow" "+")
((triple2) -> (rule1 % int1))
The cow likes the cow.
("cow" "likes" "cow" "+")
int1
The cow does not like the cow.
False
2
inv-proof
[(((triple2) -> rule1))]
("cow" "likes" "cow" "-")
((triple2) -> (rule1 % int1))
The cow likes the cow.
("cow" "likes" "cow" "+")
int1
The bear does not like the cow.
Unknown
inv-rconc
[@1: The bear likes the cow.[CWA. Example of deepest failure = (rule1 <- FAIL)]]
("bear" "likes" "cow" "-")
The bear is cold.
Unknown
random
[@0: The bear is cold.[CWA. Example of deepest failure = (FAIL)]]
("bear" "is" "cold" "+")
The bear does not see the cow.
Unknown
inv-random
[@0: The bear sees the cow.[CWA. Example of deepest failure = (FAIL)]]
("bear" "sees" "cow" "-")
The cow is round.
Unknown
random
[@0: The cow is round.[CWA. Example of deepest failure = (FAIL)]]
("cow" "is" "round" "+")
@0: The bear does not need the cow.[(triple1)] The cow needs the bear.[(triple2)] @1: The cow likes the cow.[(((triple2) -> rule1))]
The bear does not need the cow.
("bear" "needs" "cow" "-")
triple1
The cow needs the bear.
("cow" "needs" "bear" "+")
triple2
The cow likes the cow.
("cow" "likes" "cow" "+")
((triple2) -> (rule1 % int1))
The cow likes the cow.
("cow" "likes" "cow" "+")
int1