%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : PUZ021-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n019.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 02:01:35 PM UTC 2026
% Result : Unsatisfiable 0.12s 0.43s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 10
% Syntax : Number of clauses : 55 ( 7 unt; 19 nHn; 31 RR)
% Number of literals : 119 ( 0 equ; 56 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 : 5 ( 5 usr; 1 con; 0-2 aty)
% Number of variables : 111 ( 25 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(conjunction1,axiom,
( ~ a_truth(and(X1,X2),X3)
| a_truth(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conjunction1) ).
cnf(knaves_lie2,axiom,
( ~ a_truth(knave(X1),X2)
| a_truth(X3,X2)
| says(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',knaves_lie2) ).
cnf(prove_statement_exists2,negated_conjecture,
( a_truth(and(knave(me),rich(me)),X1)
| says(me,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_statement_exists2) ).
cnf(not_knight_and_knave,axiom,
( ~ a_truth(knave(X1),X2)
| ~ a_truth(knight(X1),X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_knight_and_knave) ).
cnf(knaves_lie1,axiom,
( ~ a_truth(X3,X2)
| ~ says(X1,X3)
| ~ a_truth(knave(X1),X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',knaves_lie1) ).
cnf(knights_tell_truth1,axiom,
( ~ says(X1,X3)
| ~ a_truth(knight(X1),X2)
| a_truth(X3,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',knights_tell_truth1) ).
cnf(knight_or_knave,axiom,
( a_truth(knave(X1),X2)
| a_truth(knight(X1),X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',knight_or_knave) ).
cnf(conjunction2,axiom,
( ~ a_truth(and(X1,X2),X3)
| a_truth(X2,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conjunction2) ).
cnf(prove_statement_exists1,negated_conjecture,
( ~ a_truth(and(knave(me),rich(me)),X1)
| ~ says(me,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_statement_exists1) ).
cnf(conjunction3,axiom,
( ~ a_truth(X2,X3)
| ~ a_truth(X1,X3)
| a_truth(and(X1,X2),X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conjunction3) ).
cnf(c_0_10,plain,
( ~ a_truth(and(X1,X2),X3)
| a_truth(X1,X3) ),
inference(fof_simplification,[status(thm)],[conjunction1]) ).
cnf(c_0_11,plain,
( ~ a_truth(knave(X1),X2)
| a_truth(X3,X2)
| says(X1,X3) ),
inference(fof_simplification,[status(thm)],[knaves_lie2]) ).
cnf(c_0_12,plain,
( ~ a_truth(and(X1,X2),X3)
| a_truth(X1,X3) ),
c_0_10 ).
cnf(c_0_13,negated_conjecture,
( a_truth(and(knave(me),rich(me)),X1)
| says(me,X1) ),
prove_statement_exists2 ).
cnf(c_0_14,plain,
( ~ a_truth(knave(X1),X2)
| a_truth(X3,X2)
| says(X1,X3) ),
c_0_11 ).
cnf(c_0_15,negated_conjecture,
( a_truth(knave(me),X1)
| says(me,X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,plain,
( ~ a_truth(knave(X1),X2)
| ~ a_truth(knight(X1),X2) ),
inference(fof_simplification,[status(thm)],[not_knight_and_knave]) ).
cnf(c_0_17,negated_conjecture,
( a_truth(X2,X1)
| says(me,X2)
| says(me,X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,plain,
( ~ a_truth(X3,X2)
| ~ says(X1,X3)
| ~ a_truth(knave(X1),X2) ),
inference(fof_simplification,[status(thm)],[knaves_lie1]) ).
cnf(c_0_19,plain,
( ~ a_truth(knave(X1),X2)
| ~ a_truth(knight(X1),X2) ),
c_0_16 ).
cnf(c_0_20,negated_conjecture,
( a_truth(X1,X1)
| says(me,X1) ),
inference(ef,[status(thm)],[c_0_17]) ).
cnf(c_0_21,plain,
( ~ a_truth(X3,X2)
| ~ says(X1,X3)
| ~ a_truth(knave(X1),X2) ),
c_0_18 ).
cnf(c_0_22,negated_conjecture,
( ~ a_truth(knave(X1),knight(X1))
| says(me,knight(X1)) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,plain,
( ~ says(X1,X3)
| ~ a_truth(knight(X1),X2)
| a_truth(X3,X2) ),
inference(fof_simplification,[status(thm)],[knights_tell_truth1]) ).
cnf(c_0_24,negated_conjecture,
( ~ a_truth(X2,X1)
| ~ says(me,X2)
| says(me,X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_15]) ).
cnf(c_0_25,negated_conjecture,
says(me,knight(me)),
inference(spm,[status(thm)],[c_0_22,c_0_15]) ).
cnf(c_0_26,plain,
( ~ says(X1,X3)
| ~ a_truth(knight(X1),X2)
| a_truth(X3,X2) ),
c_0_23 ).
cnf(c_0_27,axiom,
( a_truth(knave(X1),X2)
| a_truth(knight(X1),X2) ),
knight_or_knave ).
cnf(c_0_28,negated_conjecture,
( ~ a_truth(knight(me),X1)
| says(me,X1) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_29,negated_conjecture,
( a_truth(X1,and(X1,X2))
| says(me,and(X1,X2)) ),
inference(spm,[status(thm)],[c_0_12,c_0_20]) ).
cnf(c_0_30,plain,
( ~ a_truth(and(X1,X2),X3)
| a_truth(X2,X3) ),
inference(fof_simplification,[status(thm)],[conjunction2]) ).
cnf(c_0_31,plain,
( ~ says(X1,X3)
| a_truth(X3,X2)
| a_truth(knave(X1),X2) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_32,negated_conjecture,
says(me,and(knight(me),X1)),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_33,plain,
( ~ a_truth(and(X1,X2),X3)
| a_truth(X2,X3) ),
c_0_30 ).
cnf(c_0_34,negated_conjecture,
( a_truth(knave(me),X2)
| a_truth(and(knight(me),X1),X2) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_35,negated_conjecture,
( a_truth(X2,X1)
| a_truth(knave(me),X1) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_36,negated_conjecture,
a_truth(knave(me),X1),
inference(ef,[status(thm)],[c_0_35]) ).
cnf(c_0_37,negated_conjecture,
( ~ a_truth(and(knave(me),rich(me)),X1)
| ~ says(me,X1) ),
inference(fof_simplification,[status(thm)],[prove_statement_exists1]) ).
cnf(c_0_38,plain,
( ~ a_truth(X2,X3)
| ~ a_truth(X1,X3)
| a_truth(and(X1,X2),X3) ),
inference(fof_simplification,[status(thm)],[conjunction3]) ).
cnf(c_0_39,negated_conjecture,
( ~ a_truth(X1,X2)
| ~ says(me,X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_36]) ).
cnf(c_0_40,negated_conjecture,
( a_truth(X1,X2)
| says(me,X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_36]) ).
cnf(c_0_41,negated_conjecture,
( ~ a_truth(X2,X1)
| a_truth(X2,X2)
| says(me,X1) ),
inference(spm,[status(thm)],[c_0_24,c_0_20]) ).
cnf(c_0_42,negated_conjecture,
( a_truth(rich(me),X1)
| says(me,X1) ),
inference(spm,[status(thm)],[c_0_33,c_0_13]) ).
cnf(c_0_43,negated_conjecture,
( ~ a_truth(and(knave(me),rich(me)),X1)
| ~ says(me,X1) ),
c_0_37 ).
cnf(c_0_44,plain,
( ~ a_truth(X2,X3)
| ~ a_truth(X1,X3)
| a_truth(and(X1,X2),X3) ),
c_0_38 ).
cnf(c_0_45,negated_conjecture,
( ~ a_truth(X1,X3)
| a_truth(X1,X2) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_46,negated_conjecture,
( a_truth(rich(me),rich(me))
| says(me,X1) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_47,negated_conjecture,
( ~ a_truth(rich(me),X1)
| ~ says(me,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_36])]) ).
cnf(c_0_48,negated_conjecture,
( a_truth(rich(me),X2)
| says(me,X1) ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_49,negated_conjecture,
( ~ a_truth(and(knight(me),X2),X1)
| says(me,X1) ),
inference(spm,[status(thm)],[c_0_24,c_0_32]) ).
cnf(c_0_50,negated_conjecture,
( ~ says(me,X2)
| says(me,X1) ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_51,negated_conjecture,
says(me,and(and(knight(me),X1),X2)),
inference(spm,[status(thm)],[c_0_49,c_0_29]) ).
cnf(c_0_52,negated_conjecture,
says(me,X1),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_53,negated_conjecture,
~ a_truth(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_52])]) ).
cnf(c_0_54,plain,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_27,c_0_53]),c_0_53]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : PUZ021-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.36 % Computer : n019.cluster.edu
% 0.08/0.36 % Model : x86_64 x86_64
% 0.08/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36 % Memory : 8046.5625MB
% 0.08/0.36 % OS : Linux 6.8.0-71-generic
% 0.08/0.36 % CPULimit : 300
% 0.08/0.36 % WCLimit : 300
% 0.08/0.36 % DateTime : Mon Sep 21 03:45:21 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.08/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.40 Running first-order theorem proving
% 0.12/0.40 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.43 % Version: 3.5.1
% 0.12/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.12/0.43 % Starting sh5l with 300s (1) cores
% 0.12/0.43 % new_bool_3 with pid 1616150 completed with status 0
% 0.12/0.43 % Result found by new_bool_3
% 0.12/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.12/0.43 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.12/0.43 % Search class: FGHNF-FFSF21-SFFFFFNN
% 0.12/0.43 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.43 % Starting SubtermCWHack with 31s (1) cores
% 0.12/0.43 % SubtermCWHack with pid 1616159 completed with status 0
% 0.12/0.43 % Result found by SubtermCWHack
% 0.12/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.12/0.43 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.12/0.43 % Search class: FGHNF-FFSF21-SFFFFFNN
% 0.12/0.43 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.43 % Starting SubtermCWHack with 31s (1) cores
% 0.12/0.43 % Preprocessing time : 0.001 s
% 0.12/0.43
% 0.12/0.43 % Proof found!
% 0.12/0.43 % SZS status Unsatisfiable
% 0.12/0.43 % SZS output start CNFRefutation
% See solution above
% 0.12/0.43 % Parsed axioms : 13
% 0.12/0.43 % Removed by relevancy pruning/SinE : 2
% 0.12/0.43 % Initial clauses : 11
% 0.12/0.43 % Removed in clause preprocessing : 0
% 0.12/0.43 % Initial clauses in saturation : 11
% 0.12/0.43 % Processed clauses : 70
% 0.12/0.43 % ...of these trivial : 0
% 0.12/0.43 % ...subsumed : 13
% 0.12/0.43 % ...remaining for further processing : 57
% 0.12/0.43 % Other redundant clauses eliminated : 0
% 0.12/0.43 % Clauses deleted for lack of memory : 0
% 0.12/0.43 % Backward-subsumed : 29
% 0.12/0.43 % Backward-rewritten : 23
% 0.12/0.43 % Generated clauses : 389
% 0.12/0.43 % ...of the previous two non-redundant : 320
% 0.12/0.43 % ...aggressively subsumed : 0
% 0.12/0.43 % Contextual simplify-reflections : 0
% 0.12/0.43 % Paramodulations : 373
% 0.12/0.43 % Factorizations : 14
% 0.12/0.43 % NegExts : 0
% 0.12/0.43 % Equation resolutions : 0
% 0.12/0.43 % Disequality decompositions : 0
% 0.12/0.43 % Total rewrite steps : 80
% 0.12/0.43 % ...of those cached : 48
% 0.12/0.43 % Propositional unsat checks : 0
% 0.12/0.43 % Propositional check models : 0
% 0.12/0.43 % Propositional check unsatisfiable : 0
% 0.12/0.43 % Propositional clauses : 0
% 0.12/0.43 % Propositional clauses after purity: 0
% 0.12/0.43 % Propositional unsat core size : 0
% 0.12/0.43 % Propositional preprocessing time : 0.000
% 0.12/0.43 % Propositional encoding time : 0.000
% 0.12/0.43 % Propositional solver time : 0.000
% 0.12/0.43 % Success case prop preproc time : 0.000
% 0.12/0.43 % Success case prop encoding time : 0.000
% 0.12/0.43 % Success case prop solver time : 0.000
% 0.12/0.43 % Current number of processed clauses : 3
% 0.12/0.43 % Positive orientable unit clauses : 1
% 0.12/0.43 % Positive unorientable unit clauses: 0
% 0.12/0.43 % Negative unit clauses : 1
% 0.12/0.43 % Non-unit-clauses : 1
% 0.12/0.43 % Current number of unprocessed clauses: 228
% 0.12/0.43 % ...number of literals in the above : 675
% 0.12/0.43 % Current number of archived formulas : 0
% 0.12/0.43 % Current number of archived clauses : 54
% 0.12/0.43 % Clause-clause subsumption calls (NU) : 133
% 0.12/0.43 % Rec. Clause-clause subsumption calls : 118
% 0.12/0.43 % Non-unit clause-clause subsumptions : 20
% 0.12/0.43 % Unit Clause-clause subsumption calls : 27
% 0.12/0.43 % Rewrite failures with RHS unbound : 0
% 0.12/0.43 % BW rewrite match attempts : 18
% 0.12/0.43 % BW rewrite match successes : 16
% 0.12/0.43 % Condensation attempts : 0
% 0.12/0.43 % Condensation successes : 0
% 0.12/0.43 % Termbank termtop insertions : 4186
% 0.12/0.43 % Search garbage collected termcells : 32
% 0.12/0.43
% 0.12/0.43 % -------------------------------------------------
% 0.12/0.43 % User time : 0.006 s
% 0.12/0.43 % System time : 0.005 s
% 0.12/0.43 % Total time : 0.011 s
% 0.12/0.43 % Maximum resident set size: 3636 pages
% 0.12/0.43
% 0.12/0.43 % -------------------------------------------------
% 0.12/0.43 % User time : 0.007 s
% 0.12/0.43 % System time : 0.011 s
% 0.12/0.43 % Total time : 0.018 s
% 0.12/0.43 % Maximum resident set size: 4608 pages
% 0.12/0.43 % E exiting
%------------------------------------------------------------------------------