The bear is green. Red people are round. If the bear is green then the bear is red. All big, round people are young.
The bear is green.
("bear" "is" "green" "+")
Red people are round.
((("someone" "is" "red" "+")) -> ("someone" "is" "round" "+"))
If the bear is green then the bear is red.
((("bear" "is" "green" "+")) -> ("bear" "is" "red" "+"))
All big, round people are young.
((("someone" "is" "big" "+") ("someone" "is" "round" "+")) -> ("someone" "is" "young" "+"))
The bear is green.
True
1
proof
[(triple1)]
("bear" "is" "green" "+")
triple1
The bear is not green.
False
1
inv-proof
[(triple1)]
("bear" "is" "green" "-")
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 young.
Unknown
inv-rconc
[@1: The bear is young.[CWA. Example of deepest failure = (rule3 <- FAIL)]]
("bear" "is" "young" "-")
The bear likes the bear.
Unknown
random
[@0: The bear likes the bear.[CWA. Example of deepest failure = (FAIL)]]
("bear" "likes" "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 green.[(triple1)] @1: The bear is red.[(((triple1) -> rule2))] @2: The bear is round.[(((((triple1) -> rule2)) -> rule1))]
The bear is green.
("bear" "is" "green" "+")
triple1
The bear is red.
("bear" "is" "red" "+")
((triple1) -> (rule2 % int1))
The bear is red.
("bear" "is" "red" "+")
int1
The bear is round.
("bear" "is" "round" "+")
((((triple1) -> (rule2 % int2))) -> (rule1 % int1))
The bear is round.
("bear" "is" "round" "+")
int1
The bear is red.
("bear" "is" "red" "+")
int2