%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : PUZ021-1 : TPTP v9.2.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n019.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 5 05:02:40 PM UTC 2026
% Result : Unsatisfiable 1.65s 1.84s
% Output : CNFRefutation 1.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 11
% Syntax : Number of clauses : 51 ( 9 unt; 20 nHn; 27 RR)
% Number of literals : 108 ( 0 equ; 44 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 1 con; 0-2 aty)
% Number of variables : 89 ( 10 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(conjunction1,axiom,
( a_truth(X1,X3)
| ~ a_truth(and(X1,X2),X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conjunction1) ).
cnf(prove_statement_exists2,negated_conjecture,
( says(me,X1)
| a_truth(and(knave(me),rich(me)),X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_statement_exists2) ).
cnf(knaves_lie2,axiom,
( says(X1,X3)
| a_truth(X3,X2)
| ~ a_truth(knave(X1),X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',knaves_lie2) ).
cnf(knights_tell_truth1,axiom,
( a_truth(X3,X2)
| ~ a_truth(knight(X1),X2)
| ~ says(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',knights_tell_truth1) ).
cnf(knight_or_knave,axiom,
( a_truth(knight(X1),X2)
| a_truth(knave(X1),X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',knight_or_knave) ).
cnf(not_rich_and_poor,axiom,
( ~ a_truth(rich(X1),X2)
| ~ a_truth(poor(X1),X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_rich_and_poor) ).
cnf(conjunction2,axiom,
( a_truth(X2,X3)
| ~ a_truth(and(X1,X2),X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conjunction2) ).
cnf(knaves_lie1,axiom,
( ~ a_truth(knave(X1),X2)
| ~ says(X1,X3)
| ~ a_truth(X3,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',knaves_lie1) ).
cnf(prove_statement_exists1,negated_conjecture,
( ~ says(me,X1)
| ~ a_truth(and(knave(me),rich(me)),X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_statement_exists1) ).
cnf(conjunction3,axiom,
( a_truth(and(X1,X2),X3)
| ~ a_truth(X1,X3)
| ~ a_truth(X2,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conjunction3) ).
cnf(rich_or_poor,axiom,
( a_truth(rich(X1),X2)
| a_truth(poor(X1),X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rich_or_poor) ).
cnf(c_0_11,axiom,
( a_truth(X1,X3)
| ~ a_truth(and(X1,X2),X3) ),
conjunction1 ).
cnf(c_0_12,negated_conjecture,
( says(me,X1)
| a_truth(and(knave(me),rich(me)),X1) ),
prove_statement_exists2 ).
cnf(c_0_13,axiom,
( says(X1,X3)
| a_truth(X3,X2)
| ~ a_truth(knave(X1),X2) ),
knaves_lie2 ).
cnf(c_0_14,negated_conjecture,
( says(me,X1)
| a_truth(knave(me),X1) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,negated_conjecture,
( says(me,X1)
| says(me,X2)
| a_truth(X2,X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_16,axiom,
( a_truth(X3,X2)
| ~ a_truth(knight(X1),X2)
| ~ says(X1,X3) ),
knights_tell_truth1 ).
cnf(c_0_17,axiom,
( a_truth(knight(X1),X2)
| a_truth(knave(X1),X2) ),
knight_or_knave ).
cnf(c_0_18,axiom,
( ~ a_truth(rich(X1),X2)
| ~ a_truth(poor(X1),X2) ),
not_rich_and_poor ).
cnf(c_0_19,negated_conjecture,
( says(me,X1)
| a_truth(X1,X1) ),
inference(ef,[status(thm)],[c_0_15]) ).
cnf(c_0_20,axiom,
( a_truth(X2,X3)
| ~ a_truth(and(X1,X2),X3) ),
conjunction2 ).
cnf(c_0_21,plain,
( a_truth(knave(X1),X2)
| a_truth(X3,X2)
| ~ says(X1,X3) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,axiom,
( ~ a_truth(knave(X1),X2)
| ~ says(X1,X3)
| ~ a_truth(X3,X2) ),
knaves_lie1 ).
cnf(c_0_23,negated_conjecture,
( says(me,poor(X1))
| ~ a_truth(rich(X1),poor(X1)) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,negated_conjecture,
( says(me,X1)
| a_truth(rich(me),X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_12]) ).
cnf(c_0_25,negated_conjecture,
( a_truth(knave(me),X1)
| a_truth(X2,X2)
| a_truth(X2,X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_19]) ).
cnf(c_0_26,negated_conjecture,
( says(me,X1)
| ~ says(me,X2)
| ~ a_truth(X2,X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_14]) ).
cnf(c_0_27,negated_conjecture,
says(me,poor(me)),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_28,negated_conjecture,
a_truth(knave(me),knave(me)),
inference(ef,[status(thm)],[c_0_25]) ).
cnf(c_0_29,negated_conjecture,
( a_truth(knave(me),X1)
| a_truth(X1,X1) ),
inference(ef,[status(thm)],[c_0_25]) ).
cnf(c_0_30,negated_conjecture,
( says(me,X1)
| ~ a_truth(poor(me),X1) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_31,negated_conjecture,
( says(me,knave(X1))
| says(X1,X2)
| a_truth(X2,knave(X1)) ),
inference(spm,[status(thm)],[c_0_13,c_0_19]) ).
cnf(c_0_32,negated_conjecture,
( ~ says(me,X1)
| ~ a_truth(X1,knave(me)) ),
inference(spm,[status(thm)],[c_0_22,c_0_28]) ).
cnf(c_0_33,negated_conjecture,
( a_truth(X1,X1)
| ~ says(me,X2)
| ~ a_truth(X2,X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_29]) ).
cnf(c_0_34,negated_conjecture,
( says(X1,poor(me))
| says(me,knave(X1)) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_35,negated_conjecture,
~ says(me,knave(me)),
inference(spm,[status(thm)],[c_0_32,c_0_28]) ).
cnf(c_0_36,negated_conjecture,
( ~ says(me,X1)
| ~ a_truth(and(knave(me),rich(me)),X1) ),
prove_statement_exists1 ).
cnf(c_0_37,axiom,
( a_truth(and(X1,X2),X3)
| ~ a_truth(X1,X3)
| ~ a_truth(X2,X3) ),
conjunction3 ).
cnf(c_0_38,negated_conjecture,
( a_truth(X1,X1)
| ~ a_truth(poor(me),X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]) ).
cnf(c_0_39,axiom,
( a_truth(rich(X1),X2)
| a_truth(poor(X1),X2) ),
rich_or_poor ).
cnf(c_0_40,negated_conjecture,
( ~ says(me,X1)
| ~ a_truth(rich(me),X1)
| ~ a_truth(knave(me),X1) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_41,negated_conjecture,
( a_truth(rich(me),X1)
| a_truth(X1,X1) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_42,negated_conjecture,
( says(me,and(X1,X2))
| a_truth(X2,and(X1,X2)) ),
inference(spm,[status(thm)],[c_0_20,c_0_19]) ).
cnf(c_0_43,negated_conjecture,
a_truth(X1,X1),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_29]),c_0_19]) ).
cnf(c_0_44,negated_conjecture,
says(me,and(X1,poor(me))),
inference(spm,[status(thm)],[c_0_30,c_0_42]) ).
cnf(c_0_45,negated_conjecture,
a_truth(X1,and(X2,X1)),
inference(spm,[status(thm)],[c_0_20,c_0_43]) ).
cnf(c_0_46,negated_conjecture,
( says(me,X1)
| ~ a_truth(and(X2,poor(me)),X1) ),
inference(spm,[status(thm)],[c_0_26,c_0_44]) ).
cnf(c_0_47,negated_conjecture,
( says(me,and(X1,X2))
| a_truth(X1,and(X1,X2)) ),
inference(spm,[status(thm)],[c_0_11,c_0_19]) ).
cnf(c_0_48,negated_conjecture,
~ says(me,and(X1,and(knave(me),rich(me)))),
inference(spm,[status(thm)],[c_0_36,c_0_45]) ).
cnf(c_0_49,negated_conjecture,
says(me,and(and(X1,poor(me)),X2)),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_50,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_48,c_0_49]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : PUZ021-1 : TPTP v9.2.1. Released v1.0.0.
% 0.00/0.12 % Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.14/0.33 % Computer : n019.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33 % CPULimit : 300
% 0.14/0.33 % WCLimit : 300
% 0.14/0.33 % DateTime : Tue May 5 01:33:30 EDT 2026
% 0.14/0.33 % CPUTime :
% 0.14/0.34 % start to proof: theBenchmark
% 1.65/1.84 % Version : CSE_E---1.7
% 1.65/1.84 % Problem : theBenchmark.p
% 1.65/1.84 % SZS status Unsatisfiable for theBenchmark.p
% 1.65/1.84 % SZS output start CNFRefutation
% See solution above
% 1.65/1.85 % Total time : 1.371s
%------------------------------------------------------------------------------