The bear sees the mouse. The mouse needs the bear. If something sees the mouse and the mouse does not see the bear then it eats the bear. If something sees the bear then it does not eat the mouse. If something is red then it eats the mouse. If the bear needs the mouse and the bear is not green then the bear is round. If something eats the bear and it does not need the mouse then it needs the bear. If something sees the mouse then it is red.
The bear sees the mouse.
("bear" "sees" "mouse" "+")
The mouse needs the bear.
("mouse" "needs" "bear" "+")
If something sees the mouse and the mouse does not see the bear then it eats the bear.
((("something" "sees" "mouse" "+") ("mouse" "sees" "bear" "~")) -> ("something" "eats" "bear" "+"))
If something sees the bear then it does not eat the mouse.
((("something" "sees" "bear" "+")) -> ("something" "eats" "mouse" "-"))
If something is red then it eats the mouse.
((("something" "is" "red" "+")) -> ("something" "eats" "mouse" "+"))
If the bear needs the mouse and the bear is not green then the bear is round.
((("bear" "needs" "mouse" "+") ("bear" "is" "green" "~")) -> ("bear" "is" "round" "+"))
If something eats the bear and it does not need the mouse then it needs the bear.
((("something" "eats" "bear" "+") ("something" "needs" "mouse" "~")) -> ("something" "needs" "bear" "+"))
If something sees the mouse then it is red.
((("something" "sees" "mouse" "+")) -> ("something" "is" "red" "+"))
The bear sees the mouse.
True
1
proof
[(triple1)]
("bear" "sees" "mouse" "+")
triple1
The bear does not see the mouse.
False
1
inv-proof
[(triple1)]
("bear" "sees" "mouse" "-")
triple1
The bear is red.
True
2
proof
[(((triple1) -> rule6))]
("bear" "is" "red" "+")
((triple1) -> (rule6 % int1))
The bear is red.
("bear" "is" "red" "+")
int1
The bear is not red.
False
2
inv-proof
[(((triple1) -> rule6))]
("bear" "is" "red" "-")
((triple1) -> (rule6 % int1))
The bear is red.
("bear" "is" "red" "+")
int1
The bear eats the mouse.
True
3
proof
[(((((triple1) -> rule6)) -> rule3))]
("bear" "eats" "mouse" "+")
((((triple1) -> (rule6 % int2))) -> (rule3 % int1))
The bear eats the mouse.
("bear" "eats" "mouse" "+")
int1
The bear is red.
("bear" "is" "red" "+")
int2
The bear does not eat the mouse.
False
3
inv-proof
[(((((triple1) -> rule6)) -> rule3))]
("bear" "eats" "mouse" "-")
((((triple1) -> (rule6 % int2))) -> (rule3 % int1))
The bear eats the mouse.
("bear" "eats" "mouse" "+")
int1
The bear is red.
("bear" "is" "red" "+")
int2
The bear is not round.
Unknown
inv-rconc
[@1: The bear is round.[CWA. Example of deepest failure = (rule4 <- FAIL)]]
("bear" "is" "round" "-")
The mouse eats the bear.
Unknown
rconc
[@1: The mouse eats the bear.[CWA. Example of deepest failure = (rule1 <- FAIL)]]
("mouse" "eats" "bear" "+")
The mouse does not eat the mouse.
Unknown
inv-rconc
[@2: The mouse eats the mouse.[CWA. Example of deepest failure = (rule3 <- rule6 <- FAIL)]]
("mouse" "eats" "mouse" "-")
The mouse sees the bear.
Unknown
random
[@0: The mouse sees the bear.[CWA. Example of deepest failure = (FAIL)]]
("mouse" "sees" "bear" "+")
The bear does not see the bear.
Unknown
inv-random
[@0: The bear sees the bear.[CWA. Example of deepest failure = (FAIL)]]
("bear" "sees" "bear" "-")
The bear needs the mouse.
Unknown
random
[@0: The bear needs the mouse.[CWA. Example of deepest failure = (FAIL)]]
("bear" "needs" "mouse" "+")
@0: The bear sees the mouse.[(triple1)] The mouse needs the bear.[(triple2)] @1: The bear is red.[(((triple1) -> rule6))] @2: The bear eats the mouse.[(((((triple1) -> rule6)) -> rule3))]
The bear sees the mouse.
("bear" "sees" "mouse" "+")
triple1
The mouse needs the bear.
("mouse" "needs" "bear" "+")
triple2
The bear is red.
("bear" "is" "red" "+")
((triple1) -> (rule6 % int1))
The bear is red.
("bear" "is" "red" "+")
int1
The bear eats the mouse.
("bear" "eats" "mouse" "+")
((((triple1) -> (rule6 % int2))) -> (rule3 % int1))
The bear eats the mouse.
("bear" "eats" "mouse" "+")
int1
The bear is red.
("bear" "is" "red" "+")
int2