Anne is blue. Charlie is not kind. Dave is not kind. Erin is young. If Anne is blue and Anne is white then Anne is red.
Anne is blue.
("Anne" "is" "blue" "+")
Charlie is not kind.
("Charlie" "is" "kind" "-")
Dave is not kind.
("Dave" "is" "kind" "-")
Erin is young.
("Erin" "is" "young" "+")
If Anne is blue and Anne is white then Anne is red.
((("Anne" "is" "blue" "+") ("Anne" "is" "white" "+")) -> ("Anne" "is" "red" "+"))
Erin is young.
True
1
proof
[(triple4)]
("Erin" "is" "young" "+")
triple4
Charlie is kind.
False
1
inv-proof
[(triple2)]
("Charlie" "is" "kind" "+")
triple2
Anne is not red.
Unknown
inv-rconc
[@1: Anne is red.[CWA. Example of deepest failure = (rule1 <- FAIL)]]
("Anne" "is" "red" "-")
Erin is blue.
Unknown
random
[@0: Erin is blue.[CWA. Example of deepest failure = (FAIL)]]
("Erin" "is" "blue" "+")
@0: Anne is blue.[(triple1)] Charlie is not kind.[(triple2)] Dave is not kind.[(triple3)] Erin is young.[(triple4)]
Anne is blue.
("Anne" "is" "blue" "+")
triple1
Charlie is not kind.
("Charlie" "is" "kind" "-")
triple2
Dave is not kind.
("Dave" "is" "kind" "-")
triple3
Erin is young.
("Erin" "is" "young" "+")
triple4