The bear is nice. If something is kind then it is nice. If something is nice then it is red. If something is red and not nice then it is green.
The bear is nice.
("bear" "is" "nice" "+")
If something is kind then it is nice.
((("something" "is" "kind" "+")) -> ("something" "is" "nice" "+"))
If something is nice then it is red.
((("something" "is" "nice" "+")) -> ("something" "is" "red" "+"))
If something is red and not nice then it is green.
((("something" "is" "red" "+") ("something" "is" "nice" "~")) -> ("something" "is" "green" "+"))
The bear is nice.
True
1
proof
[(triple1)]
("bear" "is" "nice" "+")
triple1
The bear is not nice.
False
1
inv-proof
[(triple1)]
("bear" "is" "nice" "-")
triple1
The bear is red.
True
2
proof
[(((triple1) -> rule2))]
("bear" "is" "red" "+")
((triple1) -> (rule2 % int1))
The bear is red.
("bear" "is" "red" "+")
int1
The bear is not red.
False
2
inv-proof
[(((triple1) -> rule2))]
("bear" "is" "red" "-")
((triple1) -> (rule2 % int1))
The bear is red.
("bear" "is" "red" "+")
int1
The bear is not green.
Unknown
inv-rconc
[@1: The bear is green.[CWA. Example of deepest failure = (rule3 <- FAIL)]]
("bear" "is" "green" "-")
The bear sees the bear.
Unknown
random
[@0: The bear sees the bear.[CWA. Example of deepest failure = (FAIL)]]
("bear" "sees" "bear" "+")
The bear does not need the bear.
Unknown
inv-random
[@0: The bear needs the bear.[CWA. Example of deepest failure = (FAIL)]]
("bear" "needs" "bear" "-")
The bear is big.
Unknown
random
[@0: The bear is big.[CWA. Example of deepest failure = (FAIL)]]
("bear" "is" "big" "+")
@0: The bear is nice.[(triple1)] @1: The bear is red.[(((triple1) -> rule2))]
The bear is nice.
("bear" "is" "nice" "+")
triple1
The bear is red.
("bear" "is" "red" "+")
((triple1) -> (rule2 % int1))
The bear is red.
("bear" "is" "red" "+")
int1