Bob is young. Charlie is not big. Gary is not red. If Charlie is not red then Charlie is big. If Bob is red then Bob is not white. All quiet, red things are white. All nice things are quiet. If Gary is quiet then Gary is red. If something is nice and not red then it is big.
Bob is young.
("Bob" "is" "young" "+")
Charlie is not big.
("Charlie" "is" "big" "-")
Gary is not red.
("Gary" "is" "red" "-")
If Charlie is not red then Charlie is big.
((("Charlie" "is" "red" "~")) -> ("Charlie" "is" "big" "+"))
If Bob is red then Bob is not white.
((("Bob" "is" "red" "+")) -> ("Bob" "is" "white" "-"))
All quiet, red things are white.
((("something" "is" "quiet" "+") ("something" "is" "red" "+")) -> ("something" "is" "white" "+"))
All nice things are quiet.
((("something" "is" "nice" "+")) -> ("something" "is" "quiet" "+"))
If Gary is quiet then Gary is red.
((("Gary" "is" "quiet" "+")) -> ("Gary" "is" "red" "+"))
If something is nice and not red then it is big.
((("something" "is" "nice" "+") ("something" "is" "red" "~")) -> ("something" "is" "big" "+"))
Charlie is not big.
True
1
proof
[(triple2)]
("Charlie" "is" "big" "-")
triple2
Bob is not young.
False
1
inv-proof
[(triple1)]
("Bob" "is" "young" "-")
triple1
Bob is not quiet.
Unknown
inv-rconc
[@1: Bob is quiet.[CWA. Example of deepest failure = (rule4 <- FAIL)]]
("Bob" "is" "quiet" "-")
Charlie is red.
Unknown
random
[@0: Charlie is red.[CWA. Example of deepest failure = (FAIL)]]
("Charlie" "is" "red" "+")
@0: Bob is young.[(triple1)] Charlie is not big.[(triple2)] Gary is not red.[(triple3)]
Bob is young.
("Bob" "is" "young" "+")
triple1
Charlie is not big.
("Charlie" "is" "big" "-")
triple2
Gary is not red.
("Gary" "is" "red" "-")
triple3