The bear is red. The rabbit chases the bear. The rabbit does not like the bear. If someone likes the bear and they do not chase the bear then the bear is blue. If the rabbit is nice and the bear does not chase the rabbit then the rabbit does not like the bear. If the rabbit is nice and the rabbit is big then the rabbit does not see the bear.
The bear is red.
("bear" "is" "red" "+")
The rabbit chases the bear.
("rabbit" "chases" "bear" "+")
The rabbit does not like the bear.
("rabbit" "likes" "bear" "-")
If someone likes the bear and they do not chase the bear then the bear is blue.
((("someone" "likes" "bear" "+") ("someone" "chases" "bear" "~")) -> ("bear" "is" "blue" "+"))
If the rabbit is nice and the bear does not chase the rabbit then the rabbit does not like the bear.
((("rabbit" "is" "nice" "+") ("bear" "chases" "rabbit" "~")) -> ("rabbit" "likes" "bear" "-"))
If the rabbit is nice and the rabbit is big then the rabbit does not see the bear.
((("rabbit" "is" "nice" "+") ("rabbit" "is" "big" "+")) -> ("rabbit" "sees" "bear" "-"))
The bear is red.
True
1
proof
[(triple1)]
("bear" "is" "red" "+")
triple1
The rabbit likes the bear.
False
1
inv-proof
[(triple3)]
("rabbit" "likes" "bear" "+")
triple3
The bear is not blue.
Unknown
inv-rconc
[@1: The bear is blue.[CWA. Example of deepest failure = (rule1 <- FAIL)]]
("bear" "is" "blue" "-")
The bear chases the bear.
Unknown
random
[@0: The bear chases the bear.[CWA. Example of deepest failure = (FAIL)]]
("bear" "chases" "bear" "+")
@0: The bear is red.[(triple1)] The rabbit chases the bear.[(triple2)] The rabbit does not like the bear.[(triple3)]
The bear is red.
("bear" "is" "red" "+")
triple1
The rabbit chases the bear.
("rabbit" "chases" "bear" "+")
triple2
The rabbit does not like the bear.
("rabbit" "likes" "bear" "-")
triple3