%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SYN214-10 : TPTP v9.3.1. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n005.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:24 PM UTC 2026
% Result : Unsatisfiable 0.37s 0.48s
% Output : CNFRefutation 0.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 16
% Syntax : Number of clauses : 48 ( 48 unt; 0 nHn; 10 RR)
% Number of literals : 48 ( 47 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 19 ( 19 usr; 5 con; 0-4 aty)
% Number of variables : 79 ( 41 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_014,axiom,
ifeq(m0(X1,X2,X3),true,m1(X3,X3,X3),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_014) ).
cnf(axiom_19,axiom,
m0(X1,d,X2) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_19) ).
cnf(ifeq_axiom,axiom,
ifeq(X1,X1,X2,X3) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ifeq_axiom) ).
cnf(rule_176,axiom,
ifeq(m1(X1,X2,X1),true,p2(X2,X1,X2),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_176) ).
cnf(rule_085,axiom,
ifeq(p0(X1,X2),true,p1(X2,X2,X2),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_085) ).
cnf(axiom_14,axiom,
p0(b,X1) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_14) ).
cnf(rule_240,axiom,
ifeq(p2(X1,X2,X3),true,n3(X3),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_240) ).
cnf(rule_181,axiom,
ifeq(p1(X1,X1,X1),true,q2(X1,X1,X1),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_181) ).
cnf(rule_298,axiom,
ifeq(q3(X1,X2),true,ifeq(n3(X3),true,ifeq(p0(X4,X3),true,r4(X3),true),true),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_298) ).
cnf(rule_255,axiom,
ifeq(q2(X1,X2,X3),true,ifeq(n0(X1,X2),true,q3(X2,X3),true),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_255) ).
cnf(rule_248,axiom,
ifeq(n3(X1),true,ifeq(p2(X2,X1,X1),true,p3(X1,X1,X1),true),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_248) ).
cnf(axiom_18,axiom,
p0(c,b) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_18) ).
cnf(axiom_30,axiom,
n0(e,e) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_30) ).
cnf(rule_277,axiom,
ifeq(p3(X1,X2,X3),true,l4(X3),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_277) ).
cnf(prove_this,negated_conjecture,
s5(c) != true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
cnf(rule_329,axiom,
ifeq(r4(X1),true,ifeq(l4(X2),true,s5(X2),true),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_329) ).
cnf(c_0_16,axiom,
ifeq(m0(X1,X2,X3),true,m1(X3,X3,X3),true) = true,
rule_014 ).
cnf(c_0_17,axiom,
m0(X1,d,X2) = true,
axiom_19 ).
cnf(c_0_18,axiom,
ifeq(X1,X1,X2,X3) = X2,
ifeq_axiom ).
cnf(c_0_19,axiom,
ifeq(m1(X1,X2,X1),true,p2(X2,X1,X2),true) = true,
rule_176 ).
cnf(c_0_20,plain,
m1(X1,X1,X1) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).
cnf(c_0_21,axiom,
ifeq(p0(X1,X2),true,p1(X2,X2,X2),true) = true,
rule_085 ).
cnf(c_0_22,axiom,
p0(b,X1) = true,
axiom_14 ).
cnf(c_0_23,axiom,
ifeq(p2(X1,X2,X3),true,n3(X3),true) = true,
rule_240 ).
cnf(c_0_24,plain,
p2(X1,X1,X1) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_18]) ).
cnf(c_0_25,axiom,
ifeq(p1(X1,X1,X1),true,q2(X1,X1,X1),true) = true,
rule_181 ).
cnf(c_0_26,plain,
p1(X1,X1,X1) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_18]) ).
cnf(c_0_27,axiom,
ifeq(q3(X1,X2),true,ifeq(n3(X3),true,ifeq(p0(X4,X3),true,r4(X3),true),true),true) = true,
rule_298 ).
cnf(c_0_28,plain,
n3(X1) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_18]) ).
cnf(c_0_29,axiom,
ifeq(q2(X1,X2,X3),true,ifeq(n0(X1,X2),true,q3(X2,X3),true),true) = true,
rule_255 ).
cnf(c_0_30,plain,
q2(X1,X1,X1) = true,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_26]),c_0_18]) ).
cnf(c_0_31,axiom,
ifeq(n3(X1),true,ifeq(p2(X2,X1,X1),true,p3(X1,X1,X1),true),true) = true,
rule_248 ).
cnf(c_0_32,plain,
ifeq(q3(X1,X2),true,ifeq(p0(X3,X4),true,r4(X4),true),true) = true,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_28]),c_0_18]) ).
cnf(c_0_33,axiom,
p0(c,b) = true,
axiom_18 ).
cnf(c_0_34,plain,
ifeq(n0(X1,X1),true,q3(X1,X1),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_18]) ).
cnf(c_0_35,axiom,
n0(e,e) = true,
axiom_30 ).
cnf(c_0_36,plain,
ifeq(p2(X1,X2,X2),true,p3(X2,X2,X2),true) = true,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_28]),c_0_18]) ).
cnf(c_0_37,plain,
ifeq(q3(X1,X2),true,r4(b),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_18]) ).
cnf(c_0_38,plain,
q3(e,e) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_18]) ).
cnf(c_0_39,axiom,
ifeq(p3(X1,X2,X3),true,l4(X3),true) = true,
rule_277 ).
cnf(c_0_40,plain,
p3(X1,X1,X1) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_24]),c_0_18]) ).
cnf(c_0_41,negated_conjecture,
s5(c) != true,
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_42,axiom,
ifeq(r4(X1),true,ifeq(l4(X2),true,s5(X2),true),true) = true,
rule_329 ).
cnf(c_0_43,plain,
r4(b) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_18]) ).
cnf(c_0_44,plain,
l4(X1) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_18]) ).
cnf(c_0_45,negated_conjecture,
s5(c) != true,
c_0_41 ).
cnf(c_0_46,plain,
s5(X1) = true,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44]),c_0_18]),c_0_18]) ).
cnf(c_0_47,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_46])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN214-10 : TPTP v9.3.1. Released v7.5.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.36 % Computer : n005.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:46:04 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.41 Running first-order theorem proving
% 0.09/0.41 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.37/0.48 % Version: 3.5.1
% 0.37/0.48 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.37/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.37/0.48 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.37/0.48 % Starting new_bool_3 with 300s (1) cores
% 0.37/0.48 % Starting new_bool_1 with 300s (1) cores
% 0.37/0.48 % Starting sh5l with 300s (1) cores
% 0.37/0.48 % new_bool_3 with pid 3268366 completed with status 0
% 0.37/0.48 % Result found by new_bool_3
% 0.37/0.48 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.37/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.37/0.48 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.37/0.48 % Starting new_bool_3 with 300s (1) cores
% 0.37/0.48 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.37/0.48 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.37/0.48 % Search class: FUUPM-FFLM31-MFFFFFNN
% 0.37/0.48 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.37/0.48 % Starting SubtermCWHack with 31s (1) cores
% 0.37/0.48 % SubtermCWHack with pid 3268372 completed with status 0
% 0.37/0.48 % Result found by SubtermCWHack
% 0.37/0.48 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.37/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.37/0.48 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.37/0.48 % Starting new_bool_3 with 300s (1) cores
% 0.37/0.48 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.37/0.48 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.37/0.48 % Search class: FUUPM-FFLM31-MFFFFFNN
% 0.37/0.48 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.37/0.48 % Starting SubtermCWHack with 31s (1) cores
% 0.37/0.48 % Preprocessing time : 0.004 s
% 0.37/0.48
% 0.37/0.48 % Proof found!
% 0.37/0.48 % SZS status Unsatisfiable
% 0.37/0.48 % SZS output start CNFRefutation
% See solution above
% 0.37/0.48 % Parsed axioms : 363
% 0.37/0.48 % Removed by relevancy pruning/SinE : 53
% 0.37/0.48 % Initial clauses : 310
% 0.37/0.48 % Removed in clause preprocessing : 0
% 0.37/0.48 % Initial clauses in saturation : 310
% 0.37/0.48 % Processed clauses : 749
% 0.37/0.48 % ...of these trivial : 97
% 0.37/0.48 % ...subsumed : 0
% 0.37/0.48 % ...remaining for further processing : 652
% 0.37/0.48 % Other redundant clauses eliminated : 0
% 0.37/0.48 % Clauses deleted for lack of memory : 0
% 0.37/0.48 % Backward-subsumed : 0
% 0.37/0.48 % Backward-rewritten : 322
% 0.37/0.48 % Generated clauses : 1788
% 0.37/0.48 % ...of the previous two non-redundant : 608
% 0.37/0.48 % ...aggressively subsumed : 0
% 0.37/0.48 % Contextual simplify-reflections : 0
% 0.37/0.48 % Paramodulations : 1788
% 0.37/0.48 % Factorizations : 0
% 0.37/0.48 % NegExts : 0
% 0.37/0.48 % Equation resolutions : 0
% 0.37/0.48 % Disequality decompositions : 0
% 0.37/0.48 % Total rewrite steps : 3302
% 0.37/0.48 % ...of those cached : 2184
% 0.37/0.48 % Propositional unsat checks : 0
% 0.37/0.48 % Propositional check models : 0
% 0.37/0.48 % Propositional check unsatisfiable : 0
% 0.37/0.48 % Propositional clauses : 0
% 0.37/0.48 % Propositional clauses after purity: 0
% 0.37/0.48 % Propositional unsat core size : 0
% 0.37/0.48 % Propositional preprocessing time : 0.000
% 0.37/0.48 % Propositional encoding time : 0.000
% 0.37/0.48 % Propositional solver time : 0.000
% 0.37/0.48 % Success case prop preproc time : 0.000
% 0.37/0.48 % Success case prop encoding time : 0.000
% 0.37/0.48 % Success case prop solver time : 0.000
% 0.37/0.48 % Current number of processed clauses : 330
% 0.37/0.48 % Positive orientable unit clauses : 330
% 0.37/0.48 % Positive unorientable unit clauses: 0
% 0.37/0.48 % Negative unit clauses : 0
% 0.37/0.48 % Non-unit-clauses : 0
% 0.37/0.48 % Current number of unprocessed clauses: 94
% 0.37/0.48 % ...number of literals in the above : 94
% 0.37/0.48 % Current number of archived formulas : 0
% 0.37/0.48 % Current number of archived clauses : 322
% 0.37/0.48 % Clause-clause subsumption calls (NU) : 0
% 0.37/0.48 % Rec. Clause-clause subsumption calls : 0
% 0.37/0.48 % Non-unit clause-clause subsumptions : 0
% 0.37/0.48 % Unit Clause-clause subsumption calls : 0
% 0.37/0.48 % Rewrite failures with RHS unbound : 0
% 0.37/0.48 % BW rewrite match attempts : 1497
% 0.37/0.48 % BW rewrite match successes : 297
% 0.37/0.48 % Condensation attempts : 0
% 0.37/0.48 % Condensation successes : 0
% 0.37/0.48 % Termbank termtop insertions : 31126
% 0.37/0.48 % Search garbage collected termcells : 224
% 0.37/0.48
% 0.37/0.48 % -------------------------------------------------
% 0.37/0.48 % User time : 0.045 s
% 0.37/0.48 % System time : 0.007 s
% 0.37/0.48 % Total time : 0.051 s
% 0.37/0.48 % Maximum resident set size: 4188 pages
% 0.37/0.48
% 0.37/0.48 % -------------------------------------------------
% 0.37/0.48 % User time : 0.048 s
% 0.37/0.48 % System time : 0.010 s
% 0.37/0.48 % Total time : 0.058 s
% 0.37/0.48 % Maximum resident set size: 5120 pages
% 0.37/0.48 % E exiting
%------------------------------------------------------------------------------