Charlie is quiet. Charlie is red. Charlie is white. Dave is cold. Dave is white. Erin is nice. Fiona is red. If Charlie is green and Charlie is red then Charlie is white. If Fiona is nice and Fiona is quiet then Fiona is green.
Charlie is quiet.
("Charlie" "is" "quiet" "+")
Charlie is red.
("Charlie" "is" "red" "+")
Charlie is white.
("Charlie" "is" "white" "+")
Dave is cold.
("Dave" "is" "cold" "+")
Dave is white.
("Dave" "is" "white" "+")
Erin is nice.
("Erin" "is" "nice" "+")
Fiona is red.
("Fiona" "is" "red" "+")
If Charlie is green and Charlie is red then Charlie is white.
((("Charlie" "is" "green" "+") ("Charlie" "is" "red" "+")) -> ("Charlie" "is" "white" "+"))
If Fiona is nice and Fiona is quiet then Fiona is green.
((("Fiona" "is" "nice" "+") ("Fiona" "is" "quiet" "+")) -> ("Fiona" "is" "green" "+"))
Charlie is red.
True
1
proof
[(triple2)]
("Charlie" "is" "red" "+")
triple2
Dave is not cold.
False
1
inv-proof
[(triple4)]
("Dave" "is" "cold" "-")
triple4
Fiona is not green.
Unknown
inv-rconc
[@1: Fiona is green.[CWA. Example of deepest failure = (rule2 <- FAIL)]]
("Fiona" "is" "green" "-")
Charlie is cold.
Unknown
random
[@0: Charlie is cold.[CWA. Example of deepest failure = (FAIL)]]
("Charlie" "is" "cold" "+")
@0: Charlie is quiet.[(triple1)] Charlie is red.[(triple2)] Charlie is white.[(triple3)] Dave is cold.[(triple4)] Dave is white.[(triple5)] Erin is nice.[(triple6)] Fiona is red.[(triple7)]
Charlie is quiet.
("Charlie" "is" "quiet" "+")
triple1
Charlie is red.
("Charlie" "is" "red" "+")
triple2
Charlie is white.
("Charlie" "is" "white" "+")
triple3
Dave is cold.
("Dave" "is" "cold" "+")
triple4
Dave is white.
("Dave" "is" "white" "+")
triple5
Erin is nice.
("Erin" "is" "nice" "+")
triple6
Fiona is red.
("Fiona" "is" "red" "+")
triple7