%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SYN193-10 : TPTP v9.3.1. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n003.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:20 PM UTC 2026
% Result : Unsatisfiable 0.19s 0.52s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 13
% Syntax : Number of clauses : 37 ( 37 unt; 0 nHn; 9 RR)
% Number of literals : 37 ( 36 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 : 16 ( 16 usr; 5 con; 0-4 aty)
% Number of variables : 60 ( 30 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_014,axiom,
ifeq(m0(X1,X2,X3),true,m1(X3,X3,X3),true) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_014) ).
cnf(axiom_19,axiom,
m0(X1,d,X2) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_19) ).
cnf(ifeq_axiom,axiom,
ifeq(X1,X1,X2,X3) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ifeq_axiom) ).
cnf(rule_176,axiom,
ifeq(m1(X1,X2,X1),true,p2(X2,X1,X2),true) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_176) ).
cnf(rule_085,axiom,
ifeq(p0(X1,X2),true,p1(X2,X2,X2),true) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_085) ).
cnf(axiom_14,axiom,
p0(b,X1) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_14) ).
cnf(rule_240,axiom,
ifeq(p2(X1,X2,X3),true,n3(X3),true) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_240) ).
cnf(rule_181,axiom,
ifeq(p1(X1,X1,X1),true,q2(X1,X1,X1),true) = true,
file('/export/starexec/sandbox/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/sandbox/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/sandbox/benchmark/theBenchmark.p',rule_255) ).
cnf(axiom_18,axiom,
p0(c,b) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_18) ).
cnf(axiom_30,axiom,
n0(e,e) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_30) ).
cnf(prove_this,negated_conjecture,
r4(b) != true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
cnf(c_0_13,axiom,
ifeq(m0(X1,X2,X3),true,m1(X3,X3,X3),true) = true,
rule_014 ).
cnf(c_0_14,axiom,
m0(X1,d,X2) = true,
axiom_19 ).
cnf(c_0_15,axiom,
ifeq(X1,X1,X2,X3) = X2,
ifeq_axiom ).
cnf(c_0_16,axiom,
ifeq(m1(X1,X2,X1),true,p2(X2,X1,X2),true) = true,
rule_176 ).
cnf(c_0_17,plain,
m1(X1,X1,X1) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]) ).
cnf(c_0_18,axiom,
ifeq(p0(X1,X2),true,p1(X2,X2,X2),true) = true,
rule_085 ).
cnf(c_0_19,axiom,
p0(b,X1) = true,
axiom_14 ).
cnf(c_0_20,axiom,
ifeq(p2(X1,X2,X3),true,n3(X3),true) = true,
rule_240 ).
cnf(c_0_21,plain,
p2(X1,X1,X1) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_15]) ).
cnf(c_0_22,axiom,
ifeq(p1(X1,X1,X1),true,q2(X1,X1,X1),true) = true,
rule_181 ).
cnf(c_0_23,plain,
p1(X1,X1,X1) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_15]) ).
cnf(c_0_24,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_25,plain,
n3(X1) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_15]) ).
cnf(c_0_26,axiom,
ifeq(q2(X1,X2,X3),true,ifeq(n0(X1,X2),true,q3(X2,X3),true),true) = true,
rule_255 ).
cnf(c_0_27,plain,
q2(X1,X1,X1) = true,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23]),c_0_15]) ).
cnf(c_0_28,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_24,c_0_25]),c_0_15]) ).
cnf(c_0_29,axiom,
p0(c,b) = true,
axiom_18 ).
cnf(c_0_30,plain,
ifeq(n0(X1,X1),true,q3(X1,X1),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_15]) ).
cnf(c_0_31,axiom,
n0(e,e) = true,
axiom_30 ).
cnf(c_0_32,negated_conjecture,
r4(b) != true,
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_33,plain,
ifeq(q3(X1,X2),true,r4(b),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_15]) ).
cnf(c_0_34,plain,
q3(e,e) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_15]) ).
cnf(c_0_35,negated_conjecture,
r4(b) != true,
c_0_32 ).
cnf(c_0_36,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_15]),c_0_35]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN193-10 : TPTP v9.3.1. Released v7.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n003.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 21 10:47:01 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.43 Running first-order theorem proving
% 0.14/0.43 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.19/0.52 % Version: 3.5.1
% 0.19/0.52 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.52 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.52 % Starting new_bool_3 with 300s (1) cores
% 0.19/0.52 % Starting new_bool_1 with 300s (1) cores
% 0.19/0.52 % Starting sh5l with 300s (1) cores
% 0.19/0.52 % new_bool_3 with pid 4092122 completed with status 0
% 0.19/0.52 % Result found by new_bool_3
% 0.19/0.52 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.52 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.52 % Starting new_bool_3 with 300s (1) cores
% 0.19/0.52 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.19/0.52 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.52 % Search class: FUUPM-FFLM31-MFFFFFNN
% 0.19/0.52 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.52 % Starting SubtermCWHack with 31s (1) cores
% 0.19/0.52 % SubtermCWHack with pid 4092130 completed with status 0
% 0.19/0.52 % Result found by SubtermCWHack
% 0.19/0.52 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.52 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.52 % Starting new_bool_3 with 300s (1) cores
% 0.19/0.52 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.19/0.52 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.52 % Search class: FUUPM-FFLM31-MFFFFFNN
% 0.19/0.52 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.52 % Starting SubtermCWHack with 31s (1) cores
% 0.19/0.52 % Preprocessing time : 0.004 s
% 0.19/0.52
% 0.19/0.52 % Proof found!
% 0.19/0.52 % SZS status Unsatisfiable
% 0.19/0.52 % SZS output start CNFRefutation
% See solution above
% 0.19/0.52 % Parsed axioms : 363
% 0.19/0.52 % Removed by relevancy pruning/SinE : 43
% 0.19/0.52 % Initial clauses : 320
% 0.19/0.52 % Removed in clause preprocessing : 0
% 0.19/0.52 % Initial clauses in saturation : 320
% 0.19/0.52 % Processed clauses : 839
% 0.19/0.52 % ...of these trivial : 125
% 0.19/0.52 % ...subsumed : 0
% 0.19/0.52 % ...remaining for further processing : 714
% 0.19/0.52 % Other redundant clauses eliminated : 0
% 0.19/0.52 % Clauses deleted for lack of memory : 0
% 0.19/0.52 % Backward-subsumed : 0
% 0.19/0.52 % Backward-rewritten : 346
% 0.19/0.52 % Generated clauses : 2110
% 0.19/0.52 % ...of the previous two non-redundant : 680
% 0.19/0.52 % ...aggressively subsumed : 0
% 0.19/0.52 % Contextual simplify-reflections : 0
% 0.19/0.52 % Paramodulations : 2110
% 0.19/0.52 % Factorizations : 0
% 0.19/0.52 % NegExts : 0
% 0.19/0.52 % Equation resolutions : 0
% 0.19/0.52 % Disequality decompositions : 0
% 0.19/0.52 % Total rewrite steps : 3931
% 0.19/0.52 % ...of those cached : 2667
% 0.19/0.52 % Propositional unsat checks : 0
% 0.19/0.52 % Propositional check models : 0
% 0.19/0.52 % Propositional check unsatisfiable : 0
% 0.19/0.52 % Propositional clauses : 0
% 0.19/0.52 % Propositional clauses after purity: 0
% 0.19/0.52 % Propositional unsat core size : 0
% 0.19/0.52 % Propositional preprocessing time : 0.000
% 0.19/0.52 % Propositional encoding time : 0.000
% 0.19/0.52 % Propositional solver time : 0.000
% 0.19/0.52 % Success case prop preproc time : 0.000
% 0.19/0.52 % Success case prop encoding time : 0.000
% 0.19/0.52 % Success case prop solver time : 0.000
% 0.19/0.52 % Current number of processed clauses : 368
% 0.19/0.52 % Positive orientable unit clauses : 367
% 0.19/0.52 % Positive unorientable unit clauses: 0
% 0.19/0.52 % Negative unit clauses : 1
% 0.19/0.52 % Non-unit-clauses : 0
% 0.19/0.52 % Current number of unprocessed clauses: 84
% 0.19/0.52 % ...number of literals in the above : 84
% 0.19/0.52 % Current number of archived formulas : 0
% 0.19/0.52 % Current number of archived clauses : 346
% 0.19/0.52 % Clause-clause subsumption calls (NU) : 0
% 0.19/0.52 % Rec. Clause-clause subsumption calls : 0
% 0.19/0.52 % Non-unit clause-clause subsumptions : 0
% 0.19/0.52 % Unit Clause-clause subsumption calls : 0
% 0.19/0.52 % Rewrite failures with RHS unbound : 0
% 0.19/0.52 % BW rewrite match attempts : 1641
% 0.19/0.52 % BW rewrite match successes : 315
% 0.19/0.52 % Condensation attempts : 0
% 0.19/0.52 % Condensation successes : 0
% 0.19/0.52 % Termbank termtop insertions : 34431
% 0.19/0.52 % Search garbage collected termcells : 205
% 0.19/0.52
% 0.19/0.52 % -------------------------------------------------
% 0.19/0.52 % User time : 0.046 s
% 0.19/0.52 % System time : 0.006 s
% 0.19/0.52 % Total time : 0.052 s
% 0.19/0.52 % Maximum resident set size: 4188 pages
% 0.19/0.52
% 0.19/0.52 % -------------------------------------------------
% 0.19/0.52 % User time : 0.054 s
% 0.19/0.52 % System time : 0.011 s
% 0.19/0.52 % Total time : 0.065 s
% 0.19/0.52 % Maximum resident set size: 4864 pages
% 0.19/0.52 % E exiting
%------------------------------------------------------------------------------