%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : PUZ023-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 : n011.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:02:18 PM UTC 2026
% Result : Unsatisfiable 0.24s 0.53s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 6
% Syntax : Number of clauses : 24 ( 8 unt; 2 nHn; 22 RR)
% Number of literals : 52 ( 0 equ; 32 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-1 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-1 aty)
% Number of variables : 5 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(b_and_c_liars,hypothesis,
( ~ a_truth(liar(c))
| ~ a_truth(liar(b))
| an_answer(b_and_c_liars) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_and_c_liars) ).
cnf(prove_there_is_an_answer,negated_conjecture,
~ an_answer(X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_there_is_an_answer) ).
cnf(b_liar_and_c_truthteller,hypothesis,
( ~ a_truth(truthteller(c))
| ~ a_truth(liar(b))
| an_answer(b_liar_and_c_truthteller) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_liar_and_c_truthteller) ).
cnf(truthteller_or_liar,axiom,
( a_truth(liar(X1))
| a_truth(truthteller(X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/PUZ002-0.ax',truthteller_or_liar) ).
cnf(b_truthteller_and_c_liar,hypothesis,
( ~ a_truth(liar(c))
| ~ a_truth(truthteller(b))
| an_answer(b_truthteller_and_c_liar) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_truthteller_and_c_liar) ).
cnf(b_and_c_truthtellers,hypothesis,
( ~ a_truth(truthteller(c))
| ~ a_truth(truthteller(b))
| an_answer(b_and_c_truthtellers) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_and_c_truthtellers) ).
cnf(c_0_6,hypothesis,
( ~ a_truth(liar(c))
| ~ a_truth(liar(b))
| an_answer(b_and_c_liars) ),
inference(fof_simplification,[status(thm)],[b_and_c_liars]) ).
cnf(c_0_7,negated_conjecture,
~ an_answer(X1),
inference(fof_simplification,[status(thm)],[prove_there_is_an_answer]) ).
cnf(c_0_8,hypothesis,
( ~ a_truth(liar(c))
| ~ a_truth(liar(b))
| an_answer(b_and_c_liars) ),
c_0_6 ).
cnf(c_0_9,negated_conjecture,
~ an_answer(X1),
c_0_7 ).
cnf(c_0_10,hypothesis,
( ~ a_truth(truthteller(c))
| ~ a_truth(liar(b))
| an_answer(b_liar_and_c_truthteller) ),
inference(fof_simplification,[status(thm)],[b_liar_and_c_truthteller]) ).
cnf(c_0_11,hypothesis,
( ~ a_truth(liar(c))
| ~ a_truth(liar(b)) ),
inference(sr,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,axiom,
( a_truth(liar(X1))
| a_truth(truthteller(X1)) ),
truthteller_or_liar ).
cnf(c_0_13,hypothesis,
( ~ a_truth(truthteller(c))
| ~ a_truth(liar(b))
| an_answer(b_liar_and_c_truthteller) ),
c_0_10 ).
cnf(c_0_14,hypothesis,
( ~ a_truth(liar(b))
| a_truth(truthteller(c)) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,hypothesis,
( ~ a_truth(liar(c))
| ~ a_truth(truthteller(b))
| an_answer(b_truthteller_and_c_liar) ),
inference(fof_simplification,[status(thm)],[b_truthteller_and_c_liar]) ).
cnf(c_0_16,hypothesis,
~ a_truth(liar(b)),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[c_0_13,c_0_9]),c_0_14]) ).
cnf(c_0_17,hypothesis,
( ~ a_truth(liar(c))
| ~ a_truth(truthteller(b))
| an_answer(b_truthteller_and_c_liar) ),
c_0_15 ).
cnf(c_0_18,hypothesis,
a_truth(truthteller(b)),
inference(spm,[status(thm)],[c_0_16,c_0_12]) ).
cnf(c_0_19,hypothesis,
( ~ a_truth(truthteller(c))
| ~ a_truth(truthteller(b))
| an_answer(b_and_c_truthtellers) ),
inference(fof_simplification,[status(thm)],[b_and_c_truthtellers]) ).
cnf(c_0_20,hypothesis,
~ a_truth(liar(c)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18])]),c_0_9]) ).
cnf(c_0_21,hypothesis,
( ~ a_truth(truthteller(c))
| ~ a_truth(truthteller(b))
| an_answer(b_and_c_truthtellers) ),
c_0_19 ).
cnf(c_0_22,hypothesis,
a_truth(truthteller(c)),
inference(spm,[status(thm)],[c_0_20,c_0_12]) ).
cnf(c_0_23,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_18]),c_0_22])]),c_0_9]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : PUZ023-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.17/0.43 % Computer : n011.cluster.edu
% 0.17/0.43 % Model : x86_64 x86_64
% 0.17/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.43 % Memory : 8046.5625MB
% 0.17/0.43 % OS : Linux 6.8.0-71-generic
% 0.17/0.44 % CPULimit : 300
% 0.17/0.44 % WCLimit : 300
% 0.17/0.44 % DateTime : Mon Sep 21 03:45:56 UTC 2026
% 0.17/0.44 % CPUTime :
% 0.17/0.44 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.24/0.50 Running first-order theorem proving
% 0.24/0.51 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.24/0.53 % Version: 3.5.1
% 0.24/0.53 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.24/0.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.53 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.24/0.53 % Starting new_bool_3 with 300s (1) cores
% 0.24/0.53 % Starting new_bool_1 with 300s (1) cores
% 0.24/0.53 % Starting sh5l with 300s (1) cores
% 0.24/0.53 % sh5l with pid 900163 completed with status 0
% 0.24/0.53 % Result found by sh5l
% 0.24/0.53 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.24/0.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.53 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.24/0.53 % Starting new_bool_3 with 300s (1) cores
% 0.24/0.53 % Starting new_bool_1 with 300s (1) cores
% 0.24/0.53 % Starting sh5l with 300s (1) cores
% 0.24/0.53 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.24/0.53 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.24/0.53 % Search class: FGHNF-FFSS21-SFFFFFNN
% 0.24/0.53 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.53 % Starting SubtermCWHack with 31s (1) cores
% 0.24/0.53 % SubtermCWHack with pid 900165 completed with status 0
% 0.24/0.53 % Result found by SubtermCWHack
% 0.24/0.53 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.24/0.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.53 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.24/0.53 % Starting new_bool_3 with 300s (1) cores
% 0.24/0.53 % Starting new_bool_1 with 300s (1) cores
% 0.24/0.53 % Starting sh5l with 300s (1) cores
% 0.24/0.53 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.24/0.53 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.24/0.53 % Search class: FGHNF-FFSS21-SFFFFFNN
% 0.24/0.53 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.53 % Starting SubtermCWHack with 31s (1) cores
% 0.24/0.53 % Preprocessing time : 0.002 s
% 0.24/0.53
% 0.24/0.53 % Proof found!
% 0.24/0.53 % SZS status Unsatisfiable
% 0.24/0.53 % SZS output start CNFRefutation
% See solution above
% 0.24/0.53 % Parsed axioms : 22
% 0.24/0.53 % Removed by relevancy pruning/SinE : 0
% 0.24/0.53 % Initial clauses : 22
% 0.24/0.53 % Removed in clause preprocessing : 0
% 0.24/0.53 % Initial clauses in saturation : 22
% 0.24/0.53 % Processed clauses : 15
% 0.24/0.53 % ...of these trivial : 0
% 0.24/0.53 % ...subsumed : 0
% 0.24/0.53 % ...remaining for further processing : 14
% 0.24/0.53 % Other redundant clauses eliminated : 0
% 0.24/0.53 % Clauses deleted for lack of memory : 0
% 0.24/0.53 % Backward-subsumed : 2
% 0.24/0.53 % Backward-rewritten : 1
% 0.24/0.53 % Generated clauses : 5
% 0.24/0.53 % ...of the previous two non-redundant : 4
% 0.24/0.53 % ...aggressively subsumed : 0
% 0.24/0.53 % Contextual simplify-reflections : 1
% 0.24/0.53 % Paramodulations : 5
% 0.24/0.53 % Factorizations : 0
% 0.24/0.53 % NegExts : 0
% 0.24/0.53 % Equation resolutions : 0
% 0.24/0.53 % Disequality decompositions : 0
% 0.24/0.53 % Total rewrite steps : 4
% 0.24/0.53 % ...of those cached : 2
% 0.24/0.53 % Propositional unsat checks : 0
% 0.24/0.53 % Propositional check models : 0
% 0.24/0.53 % Propositional check unsatisfiable : 0
% 0.24/0.53 % Propositional clauses : 0
% 0.24/0.53 % Propositional clauses after purity: 0
% 0.24/0.53 % Propositional unsat core size : 0
% 0.24/0.53 % Propositional preprocessing time : 0.000
% 0.24/0.53 % Propositional encoding time : 0.000
% 0.24/0.53 % Propositional solver time : 0.000
% 0.24/0.53 % Success case prop preproc time : 0.000
% 0.24/0.53 % Success case prop encoding time : 0.000
% 0.24/0.53 % Success case prop solver time : 0.000
% 0.24/0.53 % Current number of processed clauses : 11
% 0.24/0.53 % Positive orientable unit clauses : 6
% 0.24/0.53 % Positive unorientable unit clauses: 0
% 0.24/0.53 % Negative unit clauses : 3
% 0.24/0.53 % Non-unit-clauses : 2
% 0.24/0.53 % Current number of unprocessed clauses: 11
% 0.24/0.53 % ...number of literals in the above : 44
% 0.24/0.53 % Current number of archived formulas : 0
% 0.24/0.53 % Current number of archived clauses : 3
% 0.24/0.53 % Clause-clause subsumption calls (NU) : 5
% 0.24/0.53 % Rec. Clause-clause subsumption calls : 5
% 0.24/0.53 % Non-unit clause-clause subsumptions : 1
% 0.24/0.53 % Unit Clause-clause subsumption calls : 4
% 0.24/0.53 % Rewrite failures with RHS unbound : 0
% 0.24/0.53 % BW rewrite match attempts : 1
% 0.24/0.53 % BW rewrite match successes : 1
% 0.24/0.53 % Condensation attempts : 0
% 0.24/0.53 % Condensation successes : 0
% 0.24/0.53 % Termbank termtop insertions : 837
% 0.24/0.53 % Search garbage collected termcells : 55
% 0.24/0.53
% 0.24/0.53 % -------------------------------------------------
% 0.24/0.53 % User time : 0.004 s
% 0.24/0.53 % System time : 0.001 s
% 0.24/0.53 % Total time : 0.005 s
% 0.24/0.53 % Maximum resident set size: 3648 pages
% 0.24/0.53
% 0.24/0.53 % -------------------------------------------------
% 0.24/0.53 % User time : 0.009 s
% 0.24/0.53 % System time : 0.005 s
% 0.24/0.53 % Total time : 0.014 s
% 0.24/0.53 % Maximum resident set size: 4608 pages
% 0.24/0.53 % E exiting
%------------------------------------------------------------------------------