Anne is blue. Anne is kind. Anne is young. If Anne is green then Anne is white. If Anne is young then Anne is smart.
Anne is blue.
("Anne" "is" "blue" "+")
Anne is kind.
("Anne" "is" "kind" "+")
Anne is young.
("Anne" "is" "young" "+")
If Anne is green then Anne is white.
((("Anne" "is" "green" "+")) -> ("Anne" "is" "white" "+"))
If Anne is young then Anne is smart.
((("Anne" "is" "young" "+")) -> ("Anne" "is" "smart" "+"))
Anne is young.
True
1
proof
[(triple3)]
("Anne" "is" "young" "+")
triple3
Anne is not young.
False
1
inv-proof
[(triple3)]
("Anne" "is" "young" "-")
triple3
Anne is smart.
True
2
proof
[(((triple3) -> rule2))]
("Anne" "is" "smart" "+")
((triple3) -> (rule2 % int1))
Anne is smart.
("Anne" "is" "smart" "+")
int1
Anne is not smart.
False
2
inv-proof
[(((triple3) -> rule2))]
("Anne" "is" "smart" "-")
((triple3) -> (rule2 % int1))
Anne is smart.
("Anne" "is" "smart" "+")
int1
Anne is not white.
Unknown
inv-rconc
[@1: Anne is white.[CWA. Example of deepest failure = (rule1 <- FAIL)]]
("Anne" "is" "white" "-")
Anne is green.
Unknown
random
[@0: Anne is green.[CWA. Example of deepest failure = (FAIL)]]
("Anne" "is" "green" "+")
@0: Anne is blue.[(triple1)] Anne is kind.[(triple2)] Anne is young.[(triple3)] @1: Anne is smart.[(((triple3) -> rule2))]
Anne is blue.
("Anne" "is" "blue" "+")
triple1
Anne is kind.
("Anne" "is" "kind" "+")
triple2
Anne is young.
("Anne" "is" "young" "+")
triple3
Anne is smart.
("Anne" "is" "smart" "+")
((triple3) -> (rule2 % int1))
Anne is smart.
("Anne" "is" "smart" "+")
int1