The lion needs the tiger. The squirrel is nice. The tiger needs the lion. If something needs the tiger then the tiger needs the squirrel. If something likes the squirrel then the squirrel is green. If something likes the squirrel and it chases the squirrel then it needs the squirrel.
The lion needs the tiger.
("lion" "needs" "tiger" "+")
The squirrel is nice.
("squirrel" "is" "nice" "+")
The tiger needs the lion.
("tiger" "needs" "lion" "+")
If something needs the tiger then the tiger needs the squirrel.
((("something" "needs" "tiger" "+")) -> ("tiger" "needs" "squirrel" "+"))
If something likes the squirrel then the squirrel is green.
((("something" "likes" "squirrel" "+")) -> ("squirrel" "is" "green" "+"))
If something likes the squirrel and it chases the squirrel then it needs the squirrel.
((("something" "likes" "squirrel" "+") ("something" "chases" "squirrel" "+")) -> ("something" "needs" "squirrel" "+"))
The lion needs the tiger.
True
1
proof
[(triple1)]
("lion" "needs" "tiger" "+")
triple1
The squirrel is not nice.
False
1
inv-proof
[(triple2)]
("squirrel" "is" "nice" "-")
triple2
The squirrel is not green.
Unknown
inv-rconc
[@1: The squirrel is green.[CWA. Example of deepest failure = (rule2 <- FAIL)]]
("squirrel" "is" "green" "-")
The lion likes the squirrel.
Unknown
random
[@0: The lion likes the squirrel.[CWA. Example of deepest failure = (FAIL)]]
("lion" "likes" "squirrel" "+")
@0: The lion needs the tiger.[(triple1)] The squirrel is nice.[(triple2)] The tiger needs the lion.[(triple3)] @1: The tiger needs the squirrel.[(((triple1) -> rule1))]
The lion needs the tiger.
("lion" "needs" "tiger" "+")
triple1
The squirrel is nice.
("squirrel" "is" "nice" "+")
triple2
The tiger needs the lion.
("tiger" "needs" "lion" "+")
triple3
The tiger needs the squirrel.
("tiger" "needs" "squirrel" "+")
((triple1) -> (rule1 % int1))
The tiger needs the squirrel.
("tiger" "needs" "squirrel" "+")
int1