%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWW213+1 : TPTP v9.3.1. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n001.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:10:05 PM UTC 2026
% Result : Timeout 289.39s 38.86s
% Output : None
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of formulae : 20 ( 9 unt; 0 def)
% Number of atoms : 34 ( 17 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 31 ( 17 ~; 10 |; 0 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 2 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-3 aty)
% Number of variables : 28 ( 1 sgn 17 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(conj_1,conjecture,
v_thesis____,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_1) ).
fof(conj_0,hypothesis,
! [X19] :
( c_Polynomial_Odegree(tc_Complex_Ocomplex,X19) = c_Polynomial_Odegree(tc_Complex_Ocomplex,v_p)
=> ( ! [X3] : hAPP(c_Polynomial_Opoly(tc_Complex_Ocomplex,X19),X3) = hAPP(c_Polynomial_Opoly(tc_Complex_Ocomplex,v_p),c_Groups_Oplus__class_Oplus(tc_Complex_Ocomplex,v_z,X3))
=> v_thesis____ ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0) ).
fof(fact_poly__offset__poly,axiom,
! [X4,X8,X6,X7] :
( class_Rings_Ocomm__semiring__0(X7)
=> hAPP(c_Polynomial_Opoly(X7,c_Fundamental__Theorem__Algebra__Mirabelle_Ooffset__poly(X7,X6,X8)),X4) = hAPP(c_Polynomial_Opoly(X7,X6),c_Groups_Oplus__class_Oplus(X7,X8,X4)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_poly__offset__poly) ).
fof(arity_Complex__Ocomplex__Rings_Ocomm__semiring__0,axiom,
class_Rings_Ocomm__semiring__0(tc_Complex_Ocomplex),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',arity_Complex__Ocomplex__Rings_Ocomm__semiring__0) ).
fof(fact_degree__offset__poly,axiom,
! [X8,X6,X7] :
( class_Rings_Ocomm__semiring__0(X7)
=> c_Polynomial_Odegree(X7,c_Fundamental__Theorem__Algebra__Mirabelle_Ooffset__poly(X7,X6,X8)) = c_Polynomial_Odegree(X7,X6) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_degree__offset__poly) ).
fof(c_0_5,negated_conjecture,
~ v_thesis____,
inference(assume_negation,[status(cth)],[conj_1]) ).
fof(c_0_6,negated_conjecture,
~ v_thesis____,
inference(fof_simplification,[status(thm)],[c_0_5]) ).
fof(c_0_7,hypothesis,
! [X2925] :
( v_thesis____
| hAPP(c_Polynomial_Opoly(tc_Complex_Ocomplex,X2925),esk24_1(X2925)) != hAPP(c_Polynomial_Opoly(tc_Complex_Ocomplex,v_p),c_Groups_Oplus__class_Oplus(tc_Complex_Ocomplex,v_z,esk24_1(X2925)))
| c_Polynomial_Odegree(tc_Complex_Ocomplex,X2925) != c_Polynomial_Odegree(tc_Complex_Ocomplex,v_p) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[conj_0])])])]) ).
fof(c_0_8,negated_conjecture,
~ v_thesis____,
inference(fof_nnf,[status(thm)],[c_0_6]) ).
cnf(c_0_9,hypothesis,
( hAPP(c_Polynomial_Opoly(tc_Complex_Ocomplex,X1),esk24_1(X1)) != hAPP(c_Polynomial_Opoly(tc_Complex_Ocomplex,v_p),c_Groups_Oplus__class_Oplus(tc_Complex_Ocomplex,v_z,esk24_1(X1)))
| c_Polynomial_Odegree(tc_Complex_Ocomplex,X1) != c_Polynomial_Odegree(tc_Complex_Ocomplex,v_p)
| v_thesis____ ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,negated_conjecture,
~ v_thesis____,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_11,plain,
! [X97,X98,X99,X100] :
( hAPP(c_Polynomial_Opoly(X100,c_Fundamental__Theorem__Algebra__Mirabelle_Ooffset__poly(X100,X99,X98)),X97) = hAPP(c_Polynomial_Opoly(X100,X99),c_Groups_Oplus__class_Oplus(X100,X98,X97))
| ~ class_Rings_Ocomm__semiring__0(X100) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_poly__offset__poly])])]) ).
cnf(c_0_12,hypothesis,
( c_Polynomial_Odegree(tc_Complex_Ocomplex,X1) != c_Polynomial_Odegree(tc_Complex_Ocomplex,v_p)
| hAPP(c_Polynomial_Opoly(tc_Complex_Ocomplex,X1),esk24_1(X1)) != hAPP(c_Polynomial_Opoly(tc_Complex_Ocomplex,v_p),c_Groups_Oplus__class_Oplus(tc_Complex_Ocomplex,v_z,esk24_1(X1))) ),
inference(sr,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,plain,
( ~ class_Rings_Ocomm__semiring__0(X1)
| hAPP(c_Polynomial_Opoly(X1,c_Fundamental__Theorem__Algebra__Mirabelle_Ooffset__poly(X1,X2,X3)),X4) = hAPP(c_Polynomial_Opoly(X1,X2),c_Groups_Oplus__class_Oplus(X1,X3,X4)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_14,plain,
class_Rings_Ocomm__semiring__0(tc_Complex_Ocomplex),
inference(split_conjunct,[status(thm)],[arity_Complex__Ocomplex__Rings_Ocomm__semiring__0]) ).
cnf(c_0_15,hypothesis,
( c_Polynomial_Odegree(tc_Complex_Ocomplex,c_Fundamental__Theorem__Algebra__Mirabelle_Ooffset__poly(tc_Complex_Ocomplex,X1,X2)) != c_Polynomial_Odegree(tc_Complex_Ocomplex,v_p)
| hAPP(c_Polynomial_Opoly(tc_Complex_Ocomplex,X1),c_Groups_Oplus__class_Oplus(tc_Complex_Ocomplex,X2,esk24_1(c_Fundamental__Theorem__Algebra__Mirabelle_Ooffset__poly(tc_Complex_Ocomplex,X1,X2)))) != hAPP(c_Polynomial_Opoly(tc_Complex_Ocomplex,v_p),c_Groups_Oplus__class_Oplus(tc_Complex_Ocomplex,v_z,esk24_1(c_Fundamental__Theorem__Algebra__Mirabelle_Ooffset__poly(tc_Complex_Ocomplex,X1,X2)))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])]) ).
fof(c_0_16,plain,
! [X140,X141,X142] :
( c_Polynomial_Odegree(X142,c_Fundamental__Theorem__Algebra__Mirabelle_Ooffset__poly(X142,X141,X140)) = c_Polynomial_Odegree(X142,X141)
| ~ class_Rings_Ocomm__semiring__0(X142) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_degree__offset__poly])])]) ).
cnf(c_0_17,hypothesis,
c_Polynomial_Odegree(tc_Complex_Ocomplex,c_Fundamental__Theorem__Algebra__Mirabelle_Ooffset__poly(tc_Complex_Ocomplex,v_p,v_z)) != c_Polynomial_Odegree(tc_Complex_Ocomplex,v_p),
inference(er,[status(thm)],[c_0_15]) ).
cnf(c_0_18,plain,
( ~ class_Rings_Ocomm__semiring__0(X1)
| c_Polynomial_Odegree(X1,c_Fundamental__Theorem__Algebra__Mirabelle_Ooffset__poly(X1,X2,X3)) = c_Polynomial_Odegree(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_19,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_14])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWW213+1 : TPTP v9.3.1. Released v5.2.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.22/0.47 % Computer : n001.cluster.edu
% 0.22/0.47 % Model : x86_64 x86_64
% 0.22/0.47 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.22/0.47 % Memory : 8046.5625MB
% 0.22/0.47 % OS : Linux 6.8.0-71-generic
% 0.22/0.47 % CPULimit : 300
% 0.22/0.47 % WCLimit : 300
% 0.22/0.47 % DateTime : Mon Sep 21 09:46:30 UTC 2026
% 0.22/0.48 % CPUTime :
% 0.22/0.48 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.26/0.56 Running first-order theorem proving
% 0.26/0.56 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
% 289.39/38.86 % Version: 3.5.1
% 289.39/38.86 % Preprocessing class: FMLMSMSMSSSNFFN.
% 289.39/38.86 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 289.39/38.86 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 289.39/38.86 % Starting new_bool_3 with 300s (1) cores
% 289.39/38.86 % Starting new_bool_1 with 300s (1) cores
% 289.39/38.86 % Starting sh5l with 300s (1) cores
% 289.39/38.86 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2815217 completed with status 0
% 289.39/38.86 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 289.39/38.86 % Preprocessing class: FMLMSMSMSSSNFFN.
% 289.39/38.86 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 289.39/38.86 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 289.39/38.86 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 289.39/38.86 % No SInE strategy applied
% 289.39/38.86 % Search class: FGHSM-SMLM32-DFFFFFNN
% 289.39/38.86 % Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 289.39/38.86 % Starting SubtermCWHack with 136s (1) cores
% 289.39/38.86 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 289.39/38.86 % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 113s (1) cores
% 289.39/38.86 % Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 113s (1) cores
% 289.39/38.86 % Starting G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 113s (1) cores
% 289.39/38.86 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2815225 completed with status 0
% 289.39/38.86 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 289.39/38.86 % Preprocessing class: FMLMSMSMSSSNFFN.
% 289.39/38.86 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 289.39/38.86 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 289.39/38.86 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 289.39/38.86 % No SInE strategy applied
% 289.39/38.86 % Search class: FGHSM-SMLM32-DFFFFFNN
% 289.39/38.86 % Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 289.39/38.86 % Starting SubtermCWHack with 136s (1) cores
% 289.39/38.86 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 289.39/38.86 % Preprocessing time : 0.046 s
% 289.39/38.86 % Presaturation interreduction done
% 289.39/38.86
% 289.39/38.86 % Proof found!
% 289.39/38.86 % SZS status Theorem
% 289.39/38.86 % SZS output start CNFRefutation
% See solution above
% 289.39/38.86 % Parsed axioms : 1264
% 289.39/38.86 % Removed by relevancy pruning/SinE : 0
% 289.39/38.86 % Initial clauses : 1671
% 289.39/38.86 % Removed in clause preprocessing : 81
% 289.39/38.86 % Initial clauses in saturation : 1590
% 289.39/38.86 % Processed clauses : 91594
% 289.39/38.86 % ...of these trivial : 1095
% 289.39/38.86 % ...subsumed : 77567
% 289.39/38.86 % ...remaining for further processing : 12932
% 289.39/38.86 % Other redundant clauses eliminated : 10128
% 289.39/38.86 % Clauses deleted for lack of memory : 0
% 289.39/38.86 % Backward-subsumed : 252
% 289.39/38.86 % Backward-rewritten : 151
% 289.39/38.86 % Generated clauses : 1173907
% 289.39/38.86 % ...of the previous two non-redundant : 1079845
% 289.39/38.86 % ...aggressively subsumed : 0
% 289.39/38.86 % Contextual simplify-reflections : 125
% 289.39/38.86 % Paramodulations : 1163645
% 289.39/38.86 % Factorizations : 37
% 289.39/38.86 % NegExts : 0
% 289.39/38.86 % Equation resolutions : 10254
% 289.39/38.86 % Disequality decompositions : 0
% 289.39/38.86 % Total rewrite steps : 710047
% 289.39/38.86 % ...of those cached : 680980
% 289.39/38.86 % Propositional unsat checks : 2
% 289.39/38.86 % Propositional check models : 0
% 289.39/38.86 % Propositional check unsatisfiable : 0
% 289.39/38.86 % Propositional clauses : 0
% 289.39/38.86 % Propositional clauses after purity: 0
% 289.39/38.86 % Propositional unsat core size : 0
% 289.39/38.86 % Propositional preprocessing time : 0.000
% 289.39/38.86 % Propositional encoding time : 2.595
% 289.39/38.86 % Propositional solver time : 1.685
% 289.39/38.86 % Success case prop preproc time : 0.000
% 289.39/38.86 % Success case prop encoding time : 0.000
% 289.39/38.86 % Success case prop solver time : 0.000
% 289.39/38.86 % Current number of processed clauses : 11087
% 289.39/38.86 % Positive orientable unit clauses : 999
% 289.39/38.86 % Positive unorientable unit clauses: 84
% 289.39/38.86 % Negative unit clauses : 607
% 289.39/38.86 % Non-unit-clauses : 9397
% 289.39/38.86 % Current number of unprocessed clauses: 989576
% 289.39/38.86 % ...number of literals in the above : 2852878
% 289.39/38.86 % Current number of archived formulas : 0
% 289.39/38.86 % Current number of archived clauses : 1697
% 289.39/38.86 % Clause-clause subsumption calls (NU) : 5194902
% 289.39/38.86 % Rec. Clause-clause subsumption calls : 3409707
% 289.39/38.86 % Non-unit clause-clause subsumptions : 39431
% 289.39/38.86 % Unit Clause-clause subsumption calls : 144987
% 289.39/38.86 % Rewrite failures with RHS unbound : 0
% 289.39/38.86 % BW rewrite match attempts : 28387
% 289.39/38.86 % BW rewrite match successes : 720
% 289.39/38.86 % Condensation attempts : 0
% 289.39/38.86 % Condensation successes : 0
% 289.39/38.86 % Termbank termtop insertions : 31343786
% 289.39/38.86 % Search garbage collected termcells : 20545
% 289.39/38.86
% 289.39/38.86 % -------------------------------------------------
% 289.39/38.86 % User time : 34.921 s
% 289.39/38.86 % System time : 1.015 s
% 289.39/38.86 % Total time : 35.937 s
% 289.39/38.86 % Maximum resident set size: 9644 pages
% 289.39/38.86
% 289.39/38.86 % -------------------------------------------------
% 289.39/38.86 % User time : 181.347 s
% 289.39/38.86 % System time : 5.132 s
% 289.39/38.86 % Total time : 186.480 s
% 289.39/38.86 % Maximum resident set size: 5888 pages
% 289.39/38.86 % E exiting
%------------------------------------------------------------------------------