Charlie is nice. Erin is red. Red things are smart.
Charlie is nice.
("Charlie" "is" "nice" "+")
Erin is red.
("Erin" "is" "red" "+")
Red things are smart.
((("something" "is" "red" "+")) -> ("something" "is" "smart" "+"))
Charlie is nice.
True
1
proof
[(triple1)]
("Charlie" "is" "nice" "+")
triple1
Erin is not red.
False
1
inv-proof
[(triple2)]
("Erin" "is" "red" "-")
triple2
Erin is smart.
True
2
proof
[(((triple2) -> rule1))]
("Erin" "is" "smart" "+")
((triple2) -> (rule1 % int1))
Erin is smart.
("Erin" "is" "smart" "+")
int1
Erin is not smart.
False
2
inv-proof
[(((triple2) -> rule1))]
("Erin" "is" "smart" "-")
((triple2) -> (rule1 % int1))
Erin is smart.
("Erin" "is" "smart" "+")
int1
Charlie is not smart.
Unknown
inv-rconc
[@1: Charlie is smart.[CWA. Example of deepest failure = (rule1 <- FAIL)]]
("Charlie" "is" "smart" "-")
Erin is green.
Unknown
random
[@0: Erin is green.[CWA. Example of deepest failure = (FAIL)]]
("Erin" "is" "green" "+")
Charlie is not green.
Unknown
inv-random
[@0: Charlie is green.[CWA. Example of deepest failure = (FAIL)]]
("Charlie" "is" "green" "-")
Erin is nice.
Unknown
random
[@0: Erin is nice.[CWA. Example of deepest failure = (FAIL)]]
("Erin" "is" "nice" "+")
@0: Charlie is nice.[(triple1)] Erin is red.[(triple2)] @1: Erin is smart.[(((triple2) -> rule1))]
Charlie is nice.
("Charlie" "is" "nice" "+")
triple1
Erin is red.
("Erin" "is" "red" "+")
triple2
Erin is smart.
("Erin" "is" "smart" "+")
((triple2) -> (rule1 % int1))
Erin is smart.
("Erin" "is" "smart" "+")
int1