The bear is kind. If the bear is kind then the bear is green.
The bear is kind.
("bear" "is" "kind" "+")
If the bear is kind then the bear is green.
((("bear" "is" "kind" "+")) -> ("bear" "is" "green" "+"))
The bear is kind.
True
1
proof
[(triple1)]
("bear" "is" "kind" "+")
triple1
The bear is not kind.
False
1
inv-proof
[(triple1)]
("bear" "is" "kind" "-")
triple1
The bear is green.
True
2
proof
[(((triple1) -> rule1))]
("bear" "is" "green" "+")
((triple1) -> (rule1 % int1))
The bear is green.
("bear" "is" "green" "+")
int1
The bear is not green.
False
2
inv-proof
[(((triple1) -> rule1))]
("bear" "is" "green" "-")
((triple1) -> (rule1 % int1))
The bear is green.
("bear" "is" "green" "+")
int1
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 chases the bear.
Unknown
random
[@0: The bear chases the bear.[CWA. Example of deepest failure = (FAIL)]]
("bear" "chases" "bear" "+")
The bear does not visit the bear.
Unknown
inv-random
[@0: The bear visits the bear.[CWA. Example of deepest failure = (FAIL)]]
("bear" "visits" "bear" "-")
The bear is red.
Unknown
random
[@0: The bear is red.[CWA. Example of deepest failure = (FAIL)]]
("bear" "is" "red" "+")
@0: The bear is kind.[(triple1)] @1: The bear is green.[(((triple1) -> rule1))]
The bear is kind.
("bear" "is" "kind" "+")
triple1
The bear is green.
("bear" "is" "green" "+")
((triple1) -> (rule1 % int1))
The bear is green.
("bear" "is" "green" "+")
int1