%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SYN266-1 : TPTP v9.3.1. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/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 03:23:31 PM UTC 2026
% Result : Unsatisfiable 0.15s 0.47s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 14
% Syntax : Number of clauses : 47 ( 21 unt; 0 nHn; 43 RR)
% Number of literals : 85 ( 0 equ; 41 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 13 ( 12 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 57 ( 19 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_090,axiom,
( ~ k0(e)
| ~ r0(e)
| p1(e,e,e) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_090) ).
cnf(rule_029,axiom,
( ~ s0(X1)
| ~ p0(X1,X2)
| m1(X1,X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_029) ).
cnf(rule_137,axiom,
( ~ p1(X2,X3,X1)
| n2(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_137) ).
cnf(axiom_13,axiom,
r0(e),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_13) ).
cnf(axiom_28,axiom,
k0(e),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_28) ).
cnf(rule_176,axiom,
( ~ m1(X2,X1,X2)
| p2(X1,X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_176) ).
cnf(axiom_14,axiom,
p0(b,X1),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_14) ).
cnf(axiom_5,axiom,
s0(b),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_5) ).
cnf(rule_236,axiom,
( ~ n2(X1)
| m3(X1,X1,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_236) ).
cnf(rule_155,axiom,
( ~ p2(e,X1,X2)
| ~ k1(X3)
| p2(X1,X2,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_155) ).
cnf(rule_001,axiom,
( ~ n0(X2,X1)
| k1(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_001) ).
cnf(rule_251,axiom,
( ~ p2(X1,X2,X4)
| ~ m3(X2,X3,X4)
| p3(X1,X2,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_251) ).
cnf(axiom_26,axiom,
n0(d,c),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_26) ).
cnf(prove_this,negated_conjecture,
~ p3(b,e,e),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
cnf(c_0_14,plain,
( ~ k0(e)
| ~ r0(e)
| p1(e,e,e) ),
inference(fof_simplification,[status(thm)],[rule_090]) ).
cnf(c_0_15,plain,
( ~ s0(X1)
| ~ p0(X1,X2)
| m1(X1,X2,X1) ),
inference(fof_simplification,[status(thm)],[rule_029]) ).
cnf(c_0_16,plain,
( ~ p1(X2,X3,X1)
| n2(X1) ),
inference(fof_simplification,[status(thm)],[rule_137]) ).
cnf(c_0_17,plain,
( ~ k0(e)
| ~ r0(e)
| p1(e,e,e) ),
c_0_14 ).
cnf(c_0_18,axiom,
r0(e),
axiom_13 ).
cnf(c_0_19,axiom,
k0(e),
axiom_28 ).
cnf(c_0_20,plain,
( ~ m1(X2,X1,X2)
| p2(X1,X2,X1) ),
inference(fof_simplification,[status(thm)],[rule_176]) ).
cnf(c_0_21,plain,
( ~ s0(X1)
| ~ p0(X1,X2)
| m1(X1,X2,X1) ),
c_0_15 ).
cnf(c_0_22,axiom,
p0(b,X1),
axiom_14 ).
cnf(c_0_23,axiom,
s0(b),
axiom_5 ).
cnf(c_0_24,plain,
( ~ n2(X1)
| m3(X1,X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_236]) ).
cnf(c_0_25,plain,
( ~ p1(X2,X3,X1)
| n2(X1) ),
c_0_16 ).
cnf(c_0_26,plain,
p1(e,e,e),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18]),c_0_19])]) ).
cnf(c_0_27,plain,
( ~ p2(e,X1,X2)
| ~ k1(X3)
| p2(X1,X2,X2) ),
inference(fof_simplification,[status(thm)],[rule_155]) ).
cnf(c_0_28,plain,
( ~ m1(X2,X1,X2)
| p2(X1,X2,X1) ),
c_0_20 ).
cnf(c_0_29,plain,
m1(b,X1,b),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23])]) ).
cnf(c_0_30,plain,
( ~ n0(X2,X1)
| k1(X1) ),
inference(fof_simplification,[status(thm)],[rule_001]) ).
cnf(c_0_31,plain,
( ~ p2(X1,X2,X4)
| ~ m3(X2,X3,X4)
| p3(X1,X2,X2) ),
inference(fof_simplification,[status(thm)],[rule_251]) ).
cnf(c_0_32,plain,
( ~ n2(X1)
| m3(X1,X1,X1) ),
c_0_24 ).
cnf(c_0_33,plain,
n2(e),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_34,plain,
( ~ p2(e,X1,X2)
| ~ k1(X3)
| p2(X1,X2,X2) ),
c_0_27 ).
cnf(c_0_35,plain,
p2(X1,b,X1),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_36,plain,
( ~ n0(X2,X1)
| k1(X1) ),
c_0_30 ).
cnf(c_0_37,axiom,
n0(d,c),
axiom_26 ).
cnf(c_0_38,negated_conjecture,
~ p3(b,e,e),
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_39,plain,
( ~ p2(X1,X2,X4)
| ~ m3(X2,X3,X4)
| p3(X1,X2,X2) ),
c_0_31 ).
cnf(c_0_40,plain,
m3(e,e,e),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_41,plain,
( ~ k1(X1)
| p2(b,e,e) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_42,plain,
k1(c),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_43,negated_conjecture,
~ p3(b,e,e),
c_0_38 ).
cnf(c_0_44,plain,
( ~ p2(X1,e,e)
| p3(X1,e,e) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_45,plain,
p2(b,e,e),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_46,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN266-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.36 % Computer : n019.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 21 10:47:35 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.40 Running first-order theorem proving
% 0.15/0.40 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.15/0.47 % Version: 3.5.1
% 0.15/0.47 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.47 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.47 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.47 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.47 % Starting sh5l with 300s (1) cores
% 0.15/0.47 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 2371363 completed with status 0
% 0.15/0.47 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.15/0.47 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.47 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.47 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.47 % No SInE strategy applied
% 0.15/0.47 % Search class: FHUNM-FSLM00-SFFFFFNN
% 0.15/0.47 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.47 % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.47 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.15/0.47 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.15/0.47 % Starting new_bool_3 with 136s (1) cores
% 0.15/0.47 % Starting new_bool_1 with 136s (1) cores
% 0.15/0.47 % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with pid 2371372 completed with status 0
% 0.15/0.47 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y
% 0.15/0.47 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.47 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.47 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.47 % No SInE strategy applied
% 0.15/0.47 % Search class: FHUNM-FSLM00-SFFFFFNN
% 0.15/0.47 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.47 % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.47 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.15/0.47 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.15/0.47 % Preprocessing time : 0.003 s
% 0.15/0.47 % Presaturation interreduction done
% 0.15/0.47
% 0.15/0.47 % Proof found!
% 0.15/0.47 % SZS status Unsatisfiable
% 0.15/0.47 % SZS output start CNFRefutation
% See solution above
% 0.15/0.47 % Parsed axioms : 369
% 0.15/0.47 % Removed by relevancy pruning/SinE : 0
% 0.15/0.47 % Initial clauses : 369
% 0.15/0.47 % Removed in clause preprocessing : 7
% 0.15/0.47 % Initial clauses in saturation : 362
% 0.15/0.47 % Processed clauses : 795
% 0.15/0.47 % ...of these trivial : 21
% 0.15/0.47 % ...subsumed : 26
% 0.15/0.47 % ...remaining for further processing : 748
% 0.15/0.47 % Other redundant clauses eliminated : 0
% 0.15/0.47 % Clauses deleted for lack of memory : 0
% 0.15/0.47 % Backward-subsumed : 8
% 0.15/0.47 % Backward-rewritten : 56
% 0.15/0.47 % Generated clauses : 649
% 0.15/0.47 % ...of the previous two non-redundant : 447
% 0.15/0.47 % ...aggressively subsumed : 0
% 0.15/0.47 % Contextual simplify-reflections : 2
% 0.15/0.47 % Paramodulations : 649
% 0.15/0.47 % Factorizations : 0
% 0.15/0.47 % NegExts : 0
% 0.15/0.47 % Equation resolutions : 0
% 0.15/0.47 % Disequality decompositions : 0
% 0.15/0.47 % Total rewrite steps : 442
% 0.15/0.47 % ...of those cached : 300
% 0.15/0.47 % Propositional unsat checks : 0
% 0.15/0.47 % Propositional check models : 0
% 0.15/0.47 % Propositional check unsatisfiable : 0
% 0.15/0.47 % Propositional clauses : 0
% 0.15/0.47 % Propositional clauses after purity: 0
% 0.15/0.47 % Propositional unsat core size : 0
% 0.15/0.47 % Propositional preprocessing time : 0.000
% 0.15/0.47 % Propositional encoding time : 0.000
% 0.15/0.47 % Propositional solver time : 0.000
% 0.15/0.47 % Success case prop preproc time : 0.000
% 0.15/0.47 % Success case prop encoding time : 0.000
% 0.15/0.47 % Success case prop solver time : 0.000
% 0.15/0.47 % Current number of processed clauses : 356
% 0.15/0.47 % Positive orientable unit clauses : 133
% 0.15/0.47 % Positive unorientable unit clauses: 0
% 0.15/0.47 % Negative unit clauses : 1
% 0.15/0.47 % Non-unit-clauses : 222
% 0.15/0.47 % Current number of unprocessed clauses: 322
% 0.15/0.47 % ...number of literals in the above : 797
% 0.15/0.47 % Current number of archived formulas : 0
% 0.15/0.47 % Current number of archived clauses : 392
% 0.15/0.47 % Clause-clause subsumption calls (NU) : 37297
% 0.15/0.47 % Rec. Clause-clause subsumption calls : 26664
% 0.15/0.47 % Non-unit clause-clause subsumptions : 34
% 0.15/0.47 % Unit Clause-clause subsumption calls : 602
% 0.15/0.47 % Rewrite failures with RHS unbound : 0
% 0.15/0.47 % BW rewrite match attempts : 81
% 0.15/0.47 % BW rewrite match successes : 46
% 0.15/0.47 % Condensation attempts : 0
% 0.15/0.47 % Condensation successes : 0
% 0.15/0.47 % Termbank termtop insertions : 21611
% 0.15/0.47 % Search garbage collected termcells : 1461
% 0.15/0.47
% 0.15/0.47 % -------------------------------------------------
% 0.15/0.47 % User time : 0.041 s
% 0.15/0.47 % System time : 0.004 s
% 0.15/0.47 % Total time : 0.045 s
% 0.15/0.47 % Maximum resident set size: 4420 pages
% 0.15/0.47
% 0.15/0.47 % -------------------------------------------------
% 0.15/0.47 % User time : 0.155 s
% 0.15/0.47 % System time : 0.024 s
% 0.15/0.47 % Total time : 0.179 s
% 0.15/0.47 % Maximum resident set size: 4864 pages
% 0.15/0.47 % E exiting
%------------------------------------------------------------------------------