%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : PUZ027-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 : n013.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:19 PM UTC 2026
% Result : Unsatisfiable 0.26s 0.53s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 13
% Syntax : Number of clauses : 47 ( 14 unt; 4 nHn; 43 RR)
% Number of literals : 100 ( 0 equ; 69 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-1 aty)
% Number of functors : 12 ( 12 usr; 6 con; 0-2 aty)
% Number of variables : 33 ( 9 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(liars_lie,axiom,
( ~ a_truth(X2)
| ~ a_truth(says(X1,X2))
| ~ a_truth(liar(X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/PUZ003-0.ax',liars_lie) ).
cnf(a_and_b_normal,hypothesis,
( ~ a_truth(normal(b))
| ~ a_truth(normal(a))
| answer(a_and_b_normal) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_and_b_normal) ).
cnf(prove_there_is_an_answer,negated_conjecture,
~ answer(X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_there_is_an_answer) ).
cnf(b_says_a_not_lower_than_b,hypothesis,
a_truth(says(b,not_lower(a,b))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_says_a_not_lower_than_b) ).
cnf(no_one_lower_than_liars,axiom,
( ~ a_truth(liar(X2))
| ~ a_truth(lower(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',no_one_lower_than_liars) ).
cnf(a_normal_b_truthteller,hypothesis,
( ~ a_truth(truthteller(b))
| ~ a_truth(normal(a))
| answer(a_normal_b_truthteller) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_normal_b_truthteller) ).
cnf(not_lower_or_lower,axiom,
( a_truth(lower(X1,X2))
| a_truth(not_lower(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_lower_or_lower) ).
cnf(truthtellers_tell_truth,axiom,
( ~ a_truth(says(X1,X2))
| ~ a_truth(truthteller(X1))
| a_truth(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/PUZ003-0.ax',truthtellers_tell_truth) ).
cnf(truthtellers_lower_than_no_one,axiom,
( ~ a_truth(truthteller(X1))
| ~ a_truth(lower(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',truthtellers_lower_than_no_one) ).
cnf(a_liar_b_normal,hypothesis,
( ~ a_truth(normal(b))
| ~ a_truth(liar(a))
| answer(a_liar_b_normal) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_liar_b_normal) ).
cnf(person_is_one_type,axiom,
( a_truth(normal(X1))
| a_truth(liar(X1))
| a_truth(truthteller(X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/PUZ003-0.ax',person_is_one_type) ).
cnf(a_says_a_lower_than_b,hypothesis,
a_truth(says(a,lower(a,b))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_says_a_lower_than_b) ).
cnf(a_liar_b_truthteller,hypothesis,
( ~ a_truth(truthteller(b))
| ~ a_truth(liar(a))
| answer(a_liar_b_truthteller) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_liar_b_truthteller) ).
cnf(c_0_13,plain,
( ~ a_truth(X2)
| ~ a_truth(says(X1,X2))
| ~ a_truth(liar(X1)) ),
inference(fof_simplification,[status(thm)],[liars_lie]) ).
cnf(c_0_14,hypothesis,
( ~ a_truth(normal(b))
| ~ a_truth(normal(a))
| answer(a_and_b_normal) ),
inference(fof_simplification,[status(thm)],[a_and_b_normal]) ).
cnf(c_0_15,negated_conjecture,
~ answer(X1),
inference(fof_simplification,[status(thm)],[prove_there_is_an_answer]) ).
cnf(c_0_16,plain,
( ~ a_truth(X2)
| ~ a_truth(says(X1,X2))
| ~ a_truth(liar(X1)) ),
c_0_13 ).
cnf(c_0_17,hypothesis,
a_truth(says(b,not_lower(a,b))),
b_says_a_not_lower_than_b ).
cnf(c_0_18,plain,
( ~ a_truth(liar(X2))
| ~ a_truth(lower(X1,X2)) ),
inference(fof_simplification,[status(thm)],[no_one_lower_than_liars]) ).
cnf(c_0_19,hypothesis,
( ~ a_truth(truthteller(b))
| ~ a_truth(normal(a))
| answer(a_normal_b_truthteller) ),
inference(fof_simplification,[status(thm)],[a_normal_b_truthteller]) ).
cnf(c_0_20,hypothesis,
( ~ a_truth(normal(b))
| ~ a_truth(normal(a))
| answer(a_and_b_normal) ),
c_0_14 ).
cnf(c_0_21,negated_conjecture,
~ answer(X1),
c_0_15 ).
cnf(c_0_22,hypothesis,
( ~ a_truth(liar(b))
| ~ a_truth(not_lower(a,b)) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_23,axiom,
( a_truth(lower(X1,X2))
| a_truth(not_lower(X1,X2)) ),
not_lower_or_lower ).
cnf(c_0_24,plain,
( ~ a_truth(liar(X2))
| ~ a_truth(lower(X1,X2)) ),
c_0_18 ).
cnf(c_0_25,hypothesis,
( ~ a_truth(truthteller(b))
| ~ a_truth(normal(a))
| answer(a_normal_b_truthteller) ),
c_0_19 ).
cnf(c_0_26,plain,
( ~ a_truth(says(X1,X2))
| ~ a_truth(truthteller(X1))
| a_truth(X2) ),
inference(fof_simplification,[status(thm)],[truthtellers_tell_truth]) ).
cnf(c_0_27,plain,
( ~ a_truth(truthteller(X1))
| ~ a_truth(lower(X1,X2)) ),
inference(fof_simplification,[status(thm)],[truthtellers_lower_than_no_one]) ).
cnf(c_0_28,hypothesis,
( ~ a_truth(normal(b))
| ~ a_truth(liar(a))
| answer(a_liar_b_normal) ),
inference(fof_simplification,[status(thm)],[a_liar_b_normal]) ).
cnf(c_0_29,hypothesis,
( ~ a_truth(normal(b))
| ~ a_truth(normal(a)) ),
inference(sr,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_30,axiom,
( a_truth(normal(X1))
| a_truth(liar(X1))
| a_truth(truthteller(X1)) ),
person_is_one_type ).
cnf(c_0_31,hypothesis,
~ a_truth(liar(b)),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]) ).
cnf(c_0_32,hypothesis,
( ~ a_truth(normal(a))
| ~ a_truth(truthteller(b)) ),
inference(sr,[status(thm)],[c_0_25,c_0_21]) ).
cnf(c_0_33,plain,
( ~ a_truth(says(X1,X2))
| ~ a_truth(truthteller(X1))
| a_truth(X2) ),
c_0_26 ).
cnf(c_0_34,hypothesis,
a_truth(says(a,lower(a,b))),
a_says_a_lower_than_b ).
cnf(c_0_35,plain,
( ~ a_truth(truthteller(X1))
| ~ a_truth(lower(X1,X2)) ),
c_0_27 ).
cnf(c_0_36,hypothesis,
( ~ a_truth(truthteller(b))
| ~ a_truth(liar(a))
| answer(a_liar_b_truthteller) ),
inference(fof_simplification,[status(thm)],[a_liar_b_truthteller]) ).
cnf(c_0_37,hypothesis,
( ~ a_truth(normal(b))
| ~ a_truth(liar(a))
| answer(a_liar_b_normal) ),
c_0_28 ).
cnf(c_0_38,hypothesis,
~ a_truth(normal(a)),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]),c_0_32]) ).
cnf(c_0_39,hypothesis,
~ a_truth(truthteller(a)),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]) ).
cnf(c_0_40,hypothesis,
( ~ a_truth(truthteller(b))
| ~ a_truth(liar(a))
| answer(a_liar_b_truthteller) ),
c_0_36 ).
cnf(c_0_41,hypothesis,
( ~ a_truth(normal(b))
| ~ a_truth(liar(a)) ),
inference(sr,[status(thm)],[c_0_37,c_0_21]) ).
cnf(c_0_42,hypothesis,
a_truth(liar(a)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_30]),c_0_39]) ).
cnf(c_0_43,hypothesis,
( ~ a_truth(liar(a))
| ~ a_truth(truthteller(b)) ),
inference(sr,[status(thm)],[c_0_40,c_0_21]) ).
cnf(c_0_44,hypothesis,
~ a_truth(normal(b)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_41,c_0_42])]) ).
cnf(c_0_45,hypothesis,
~ a_truth(truthteller(b)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_43,c_0_42])]) ).
cnf(c_0_46,hypothesis,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_30]),c_0_31]),c_0_45]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : PUZ027-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.16/0.43 % Computer : n013.cluster.edu
% 0.16/0.43 % Model : x86_64 x86_64
% 0.16/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.43 % Memory : 8046.5625MB
% 0.16/0.43 % OS : Linux 6.8.0-71-generic
% 0.16/0.43 % CPULimit : 300
% 0.16/0.43 % WCLimit : 300
% 0.16/0.43 % DateTime : Mon Sep 21 03:45:07 UTC 2026
% 0.16/0.44 % CPUTime :
% 0.16/0.44 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/0.50 Running first-order theorem proving
% 0.16/0.50 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.26/0.53 % Version: 3.5.1
% 0.26/0.53 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.26/0.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.53 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.26/0.53 % Starting new_bool_3 with 300s (1) cores
% 0.26/0.53 % Starting new_bool_1 with 300s (1) cores
% 0.26/0.53 % Starting sh5l with 300s (1) cores
% 0.26/0.53 % new_bool_3 with pid 4071126 completed with status 0
% 0.26/0.53 % Result found by new_bool_3
% 0.26/0.53 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.26/0.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.53 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.26/0.53 % Starting new_bool_3 with 300s (1) cores
% 0.26/0.53 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.26/0.53 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.26/0.53 % Search class: FGHNF-FFMF21-SFFFFFNN
% 0.26/0.53 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.26/0.53 % Starting SubtermCWHack with 31s (1) cores
% 0.26/0.53 % SubtermCWHack with pid 4071129 completed with status 0
% 0.26/0.53 % Result found by SubtermCWHack
% 0.26/0.53 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.26/0.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.53 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.26/0.53 % Starting new_bool_3 with 300s (1) cores
% 0.26/0.53 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.26/0.53 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.26/0.53 % Search class: FGHNF-FFMF21-SFFFFFNN
% 0.26/0.53 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.26/0.53 % Starting SubtermCWHack with 31s (1) cores
% 0.26/0.53 % Preprocessing time : 0.002 s
% 0.26/0.53
% 0.26/0.53 % Proof found!
% 0.26/0.53 % SZS status Unsatisfiable
% 0.26/0.53 % SZS output start CNFRefutation
% See solution above
% 0.26/0.53 % Parsed axioms : 32
% 0.26/0.53 % Removed by relevancy pruning/SinE : 0
% 0.26/0.53 % Initial clauses : 32
% 0.26/0.53 % Removed in clause preprocessing : 0
% 0.26/0.53 % Initial clauses in saturation : 32
% 0.26/0.53 % Processed clauses : 38
% 0.26/0.53 % ...of these trivial : 0
% 0.26/0.53 % ...subsumed : 2
% 0.26/0.53 % ...remaining for further processing : 35
% 0.26/0.53 % Other redundant clauses eliminated : 0
% 0.26/0.53 % Clauses deleted for lack of memory : 0
% 0.26/0.53 % Backward-subsumed : 10
% 0.26/0.53 % Backward-rewritten : 3
% 0.26/0.53 % Generated clauses : 21
% 0.26/0.53 % ...of the previous two non-redundant : 21
% 0.26/0.53 % ...aggressively subsumed : 0
% 0.26/0.53 % Contextual simplify-reflections : 3
% 0.26/0.53 % Paramodulations : 21
% 0.26/0.53 % Factorizations : 0
% 0.26/0.53 % NegExts : 0
% 0.26/0.53 % Equation resolutions : 0
% 0.26/0.53 % Disequality decompositions : 0
% 0.26/0.53 % Total rewrite steps : 3
% 0.26/0.53 % ...of those cached : 2
% 0.26/0.53 % Propositional unsat checks : 0
% 0.26/0.53 % Propositional check models : 0
% 0.26/0.53 % Propositional check unsatisfiable : 0
% 0.26/0.53 % Propositional clauses : 0
% 0.26/0.53 % Propositional clauses after purity: 0
% 0.26/0.53 % Propositional unsat core size : 0
% 0.26/0.53 % Propositional preprocessing time : 0.000
% 0.26/0.53 % Propositional encoding time : 0.000
% 0.26/0.53 % Propositional solver time : 0.000
% 0.26/0.53 % Success case prop preproc time : 0.000
% 0.26/0.53 % Success case prop encoding time : 0.000
% 0.26/0.53 % Success case prop solver time : 0.000
% 0.26/0.53 % Current number of processed clauses : 22
% 0.26/0.53 % Positive orientable unit clauses : 4
% 0.26/0.53 % Positive unorientable unit clauses: 0
% 0.26/0.53 % Negative unit clauses : 7
% 0.26/0.53 % Non-unit-clauses : 11
% 0.26/0.53 % Current number of unprocessed clauses: 14
% 0.26/0.53 % ...number of literals in the above : 44
% 0.26/0.53 % Current number of archived formulas : 0
% 0.26/0.53 % Current number of archived clauses : 13
% 0.26/0.53 % Clause-clause subsumption calls (NU) : 42
% 0.26/0.53 % Rec. Clause-clause subsumption calls : 37
% 0.26/0.53 % Non-unit clause-clause subsumptions : 4
% 0.26/0.53 % Unit Clause-clause subsumption calls : 20
% 0.26/0.53 % Rewrite failures with RHS unbound : 0
% 0.26/0.53 % BW rewrite match attempts : 1
% 0.26/0.53 % BW rewrite match successes : 1
% 0.26/0.53 % Condensation attempts : 0
% 0.26/0.53 % Condensation successes : 0
% 0.26/0.53 % Termbank termtop insertions : 1412
% 0.26/0.53 % Search garbage collected termcells : 73
% 0.26/0.53
% 0.26/0.53 % -------------------------------------------------
% 0.26/0.53 % User time : 0.006 s
% 0.26/0.53 % System time : 0.002 s
% 0.26/0.53 % Total time : 0.008 s
% 0.26/0.53 % Maximum resident set size: 3608 pages
% 0.26/0.53
% 0.26/0.53 % -------------------------------------------------
% 0.26/0.53 % User time : 0.009 s
% 0.26/0.53 % System time : 0.009 s
% 0.26/0.53 % Total time : 0.017 s
% 0.26/0.53 % Maximum resident set size: 4864 pages
% 0.26/0.53 % E exiting
%------------------------------------------------------------------------------