Anne is quiet. Bob is red. Charlie is blue. Gary is red. If something is blue and quiet then it is nice. Blue, nice things are round. If something is red then it is not quiet.
Anne is quiet.
("Anne" "is" "quiet" "+")
Bob is red.
("Bob" "is" "red" "+")
Charlie is blue.
("Charlie" "is" "blue" "+")
Gary is red.
("Gary" "is" "red" "+")
If something is blue and quiet then it is nice.
((("something" "is" "blue" "+") ("something" "is" "quiet" "+")) -> ("something" "is" "nice" "+"))
Blue, nice things are round.
((("something" "is" "blue" "+") ("something" "is" "nice" "+")) -> ("something" "is" "round" "+"))
If something is red then it is not quiet.
((("something" "is" "red" "+")) -> ("something" "is" "quiet" "-"))
Gary is red.
True
1
proof
[(triple4)]
("Gary" "is" "red" "+")
triple4
Charlie is not blue.
False
1
inv-proof
[(triple3)]
("Charlie" "is" "blue" "-")
triple3
Anne is not nice.
Unknown
inv-rconc
[@1: Anne is nice.[CWA. Example of deepest failure = (rule1 <- FAIL)]]
("Anne" "is" "nice" "-")
Anne is red.
Unknown
random
[@0: Anne is red.[CWA. Example of deepest failure = (FAIL)]]
("Anne" "is" "red" "+")
@0: Anne is quiet.[(triple1)] Bob is red.[(triple2)] Charlie is blue.[(triple3)] Gary is red.[(triple4)] @1: Bob is not quiet.[(((triple2) -> rule3))] Gary is not quiet.[(((triple4) -> rule3))]
Anne is quiet.
("Anne" "is" "quiet" "+")
triple1
Bob is red.
("Bob" "is" "red" "+")
triple2
Charlie is blue.
("Charlie" "is" "blue" "+")
triple3
Gary is red.
("Gary" "is" "red" "+")
triple4
Bob is not quiet.
("Bob" "is" "quiet" "-")
((triple2) -> (rule3 % int1))
Bob is not quiet.
("Bob" "is" "quiet" "-")
int1
Gary is not quiet.
("Gary" "is" "quiet" "-")
((triple4) -> (rule3 % int1))
Gary is not quiet.
("Gary" "is" "quiet" "-")
int1