%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : PUZ024-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n001.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.13s 5.44s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of clauses : 17 ( 10 unt; 3 nHn; 17 RR)
% Number of literals : 36 ( 0 equ; 16 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 23 ( 7 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(truths_are_told_by_truthtellers,axiom,
( ~ a_truth(says(X2,X1))
| ~ a_truth(X1)
| a_truth(truthteller(X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/PUZ002-0.ax',truths_are_told_by_truthtellers) ).
cnf(prove_there_is_a_truthteller,negated_conjecture,
~ a_truth(truthteller(X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_there_is_a_truthteller) ).
cnf(all_truthtellers,axiom,
( ~ people(X1,X2,X3)
| a_truth(truthteller(X3))
| a_truth(truthteller(X2))
| a_truth(truthteller(X1))
| a_truth(all_are_liars) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',all_truthtellers) ).
cnf(a_says_all_are_liars,hypothesis,
a_truth(says(a,all_are_liars)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_says_all_are_liars) ).
cnf(b_c_a_people,hypothesis,
people(b,c,a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',b_c_a_people) ).
cnf(c_0_5,plain,
( ~ a_truth(says(X2,X1))
| ~ a_truth(X1)
| a_truth(truthteller(X2)) ),
inference(fof_simplification,[status(thm)],[truths_are_told_by_truthtellers]) ).
cnf(c_0_6,negated_conjecture,
~ a_truth(truthteller(X1)),
inference(fof_simplification,[status(thm)],[prove_there_is_a_truthteller]) ).
cnf(c_0_7,plain,
( ~ a_truth(says(X2,X1))
| ~ a_truth(X1)
| a_truth(truthteller(X2)) ),
c_0_5 ).
cnf(c_0_8,negated_conjecture,
~ a_truth(truthteller(X1)),
c_0_6 ).
cnf(c_0_9,plain,
( ~ people(X1,X2,X3)
| a_truth(truthteller(X3))
| a_truth(truthteller(X2))
| a_truth(truthteller(X1))
| a_truth(all_are_liars) ),
inference(fof_simplification,[status(thm)],[all_truthtellers]) ).
cnf(c_0_10,plain,
( ~ a_truth(X2)
| ~ a_truth(says(X1,X2)) ),
inference(sr,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,hypothesis,
a_truth(says(a,all_are_liars)),
a_says_all_are_liars ).
cnf(c_0_12,plain,
( ~ people(X1,X2,X3)
| a_truth(truthteller(X3))
| a_truth(truthteller(X2))
| a_truth(truthteller(X1))
| a_truth(all_are_liars) ),
c_0_9 ).
cnf(c_0_13,hypothesis,
~ a_truth(all_are_liars),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,hypothesis,
people(b,c,a),
b_c_a_people ).
cnf(c_0_15,plain,
~ people(X1,X2,X3),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_12,c_0_13]),c_0_8]),c_0_8]),c_0_8]) ).
cnf(c_0_16,hypothesis,
$false,
inference(sr,[status(thm)],[c_0_14,c_0_15]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : PUZ024-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/5.37 % Computer : n001.cluster.edu
% 0.10/5.37 % Model : x86_64 x86_64
% 0.10/5.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.37 % Memory : 8046.5625MB
% 0.10/5.37 % OS : Linux 6.8.0-71-generic
% 0.10/5.37 % CPULimit : 300
% 0.10/5.37 % WCLimit : 300
% 0.10/5.37 % DateTime : Mon Sep 21 03:51:33 UTC 2026
% 0.10/5.38 % CPUTime :
% 0.10/5.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/5.42 Running first-order theorem proving
% 0.13/5.42 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.13/5.44 % Version: 3.5.1
% 0.13/5.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/5.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/5.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/5.44 % Starting new_bool_3 with 300s (1) cores
% 0.13/5.44 % Starting new_bool_1 with 300s (1) cores
% 0.13/5.44 % Starting sh5l with 300s (1) cores
% 0.13/5.44 % new_bool_3 with pid 2124347 completed with status 0
% 0.13/5.44 % Result found by new_bool_3
% 0.13/5.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/5.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/5.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/5.44 % Starting new_bool_3 with 300s (1) cores
% 0.13/5.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.13/5.44 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/5.44 % Search class: FGHNF-FFSS21-SFFFFFNN
% 0.13/5.44 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/5.44 % Starting SubtermCWHack with 31s (1) cores
% 0.13/5.44 % SubtermCWHack with pid 2124350 completed with status 0
% 0.13/5.44 % Result found by SubtermCWHack
% 0.13/5.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/5.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/5.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/5.44 % Starting new_bool_3 with 300s (1) cores
% 0.13/5.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.13/5.44 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/5.44 % Search class: FGHNF-FFSS21-SFFFFFNN
% 0.13/5.44 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/5.44 % Starting SubtermCWHack with 31s (1) cores
% 0.13/5.44 % Preprocessing time : 0.001 s
% 0.13/5.44
% 0.13/5.44 % Proof found!
% 0.13/5.44 % SZS status Unsatisfiable
% 0.13/5.44 % SZS output start CNFRefutation
% See solution above
% 0.13/5.44 % Parsed axioms : 20
% 0.13/5.44 % Removed by relevancy pruning/SinE : 0
% 0.13/5.44 % Initial clauses : 20
% 0.13/5.44 % Removed in clause preprocessing : 0
% 0.13/5.44 % Initial clauses in saturation : 20
% 0.13/5.44 % Processed clauses : 16
% 0.13/5.44 % ...of these trivial : 1
% 0.13/5.44 % ...subsumed : 4
% 0.13/5.44 % ...remaining for further processing : 11
% 0.13/5.44 % Other redundant clauses eliminated : 0
% 0.13/5.44 % Clauses deleted for lack of memory : 0
% 0.13/5.44 % Backward-subsumed : 0
% 0.13/5.44 % Backward-rewritten : 0
% 0.13/5.44 % Generated clauses : 5
% 0.13/5.44 % ...of the previous two non-redundant : 2
% 0.13/5.44 % ...aggressively subsumed : 0
% 0.13/5.44 % Contextual simplify-reflections : 0
% 0.13/5.44 % Paramodulations : 2
% 0.13/5.44 % Factorizations : 0
% 0.13/5.44 % NegExts : 0
% 0.13/5.44 % Equation resolutions : 0
% 0.13/5.44 % Disequality decompositions : 0
% 0.13/5.44 % Total rewrite steps : 3
% 0.13/5.44 % ...of those cached : 1
% 0.13/5.44 % Propositional unsat checks : 0
% 0.13/5.44 % Propositional check models : 0
% 0.13/5.44 % Propositional check unsatisfiable : 0
% 0.13/5.44 % Propositional clauses : 0
% 0.13/5.44 % Propositional clauses after purity: 0
% 0.13/5.44 % Propositional unsat core size : 0
% 0.13/5.44 % Propositional preprocessing time : 0.000
% 0.13/5.44 % Propositional encoding time : 0.000
% 0.13/5.44 % Propositional solver time : 0.000
% 0.13/5.44 % Success case prop preproc time : 0.000
% 0.13/5.44 % Success case prop encoding time : 0.000
% 0.13/5.44 % Success case prop solver time : 0.000
% 0.13/5.44 % Current number of processed clauses : 8
% 0.13/5.44 % Positive orientable unit clauses : 3
% 0.13/5.44 % Positive unorientable unit clauses: 0
% 0.13/5.44 % Negative unit clauses : 4
% 0.13/5.44 % Non-unit-clauses : 1
% 0.13/5.44 % Current number of unprocessed clauses: 6
% 0.13/5.44 % ...number of literals in the above : 30
% 0.13/5.44 % Current number of archived formulas : 0
% 0.13/5.44 % Current number of archived clauses : 3
% 0.13/5.44 % Clause-clause subsumption calls (NU) : 1
% 0.13/5.44 % Rec. Clause-clause subsumption calls : 1
% 0.13/5.44 % Non-unit clause-clause subsumptions : 1
% 0.13/5.44 % Unit Clause-clause subsumption calls : 2
% 0.13/5.44 % Rewrite failures with RHS unbound : 0
% 0.13/5.44 % BW rewrite match attempts : 0
% 0.13/5.44 % BW rewrite match successes : 0
% 0.13/5.44 % Condensation attempts : 0
% 0.13/5.44 % Condensation successes : 0
% 0.13/5.44 % Termbank termtop insertions : 746
% 0.13/5.44 % Search garbage collected termcells : 49
% 0.13/5.44
% 0.13/5.44 % -------------------------------------------------
% 0.13/5.44 % User time : 0.003 s
% 0.13/5.44 % System time : 0.001 s
% 0.13/5.44 % Total time : 0.004 s
% 0.13/5.44 % Maximum resident set size: 3644 pages
% 0.13/5.44
% 0.13/5.44 % -------------------------------------------------
% 0.13/5.44 % User time : 0.004 s
% 0.13/5.44 % System time : 0.007 s
% 0.13/5.44 % Total time : 0.011 s
% 0.13/5.44 % Maximum resident set size: 4864 pages
% 0.13/5.44 % E exiting
%------------------------------------------------------------------------------