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