%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : ALG367-1 : TPTP v9.3.1. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n012.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 11:55:59 AM UTC 2026
% Result : Unsatisfiable 11.11s 1.89s
% Output : CNFRefutation 11.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of clauses : 18 ( 7 unt; 0 nHn; 12 RR)
% Number of literals : 32 ( 17 equ; 20 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 2 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-3 aty)
% Number of variables : 27 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_conjecture_1,negated_conjecture,
( c_Polynomial_Odegree(X1,tc_Complex_Ocomplex) != c_Polynomial_Odegree(v_p,tc_Complex_Ocomplex)
| c_Polynomial_Opoly(X1,v_q(X1),tc_Complex_Ocomplex) != c_Polynomial_Opoly(v_p,c_HOL_Oplus__class_Oplus(v_z,v_q(X1),tc_Complex_Ocomplex),tc_Complex_Ocomplex)
| v_thesis____ ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_1) ).
cnf(cls_conjecture_0,negated_conjecture,
~ v_thesis____,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).
cnf(cls_poly__offset__poly_0,axiom,
( ~ class_Ring__and__Field_Ocomm__semiring__0(X1)
| c_Polynomial_Opoly(c_Fundamental__Theorem__Algebra__Mirabelle_Ooffset__poly(X2,X3,X1),X4,X1) = c_Polynomial_Opoly(X2,c_HOL_Oplus__class_Oplus(X3,X4,X1),X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_poly__offset__poly_0) ).
cnf(clsarity_Complex__Ocomplex__Ring__and__Field_Ocomm__semiring__0,axiom,
class_Ring__and__Field_Ocomm__semiring__0(tc_Complex_Ocomplex),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clsarity_Complex__Ocomplex__Ring__and__Field_Ocomm__semiring__0) ).
cnf(cls_degree__offset__poly_0,axiom,
( ~ class_Ring__and__Field_Ocomm__semiring__0(X1)
| c_Polynomial_Odegree(c_Fundamental__Theorem__Algebra__Mirabelle_Ooffset__poly(X2,X3,X1),X1) = c_Polynomial_Odegree(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_degree__offset__poly_0) ).
cnf(c_0_5,negated_conjecture,
( c_Polynomial_Odegree(X1,tc_Complex_Ocomplex) != c_Polynomial_Odegree(v_p,tc_Complex_Ocomplex)
| c_Polynomial_Opoly(X1,v_q(X1),tc_Complex_Ocomplex) != c_Polynomial_Opoly(v_p,c_HOL_Oplus__class_Oplus(v_z,v_q(X1),tc_Complex_Ocomplex),tc_Complex_Ocomplex)
| v_thesis____ ),
inference(fof_simplification,[status(thm)],[cls_conjecture_1]) ).
cnf(c_0_6,negated_conjecture,
~ v_thesis____,
inference(fof_simplification,[status(thm)],[cls_conjecture_0]) ).
cnf(c_0_7,negated_conjecture,
( c_Polynomial_Odegree(X1,tc_Complex_Ocomplex) != c_Polynomial_Odegree(v_p,tc_Complex_Ocomplex)
| c_Polynomial_Opoly(X1,v_q(X1),tc_Complex_Ocomplex) != c_Polynomial_Opoly(v_p,c_HOL_Oplus__class_Oplus(v_z,v_q(X1),tc_Complex_Ocomplex),tc_Complex_Ocomplex)
| v_thesis____ ),
c_0_5 ).
cnf(c_0_8,negated_conjecture,
~ v_thesis____,
c_0_6 ).
cnf(c_0_9,plain,
( ~ class_Ring__and__Field_Ocomm__semiring__0(X1)
| c_Polynomial_Opoly(c_Fundamental__Theorem__Algebra__Mirabelle_Ooffset__poly(X2,X3,X1),X4,X1) = c_Polynomial_Opoly(X2,c_HOL_Oplus__class_Oplus(X3,X4,X1),X1) ),
inference(fof_simplification,[status(thm)],[cls_poly__offset__poly_0]) ).
cnf(c_0_10,negated_conjecture,
( c_Polynomial_Odegree(X1,tc_Complex_Ocomplex) != c_Polynomial_Odegree(v_p,tc_Complex_Ocomplex)
| c_Polynomial_Opoly(X1,v_q(X1),tc_Complex_Ocomplex) != c_Polynomial_Opoly(v_p,c_HOL_Oplus__class_Oplus(v_z,v_q(X1),tc_Complex_Ocomplex),tc_Complex_Ocomplex) ),
inference(sr,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,plain,
( ~ class_Ring__and__Field_Ocomm__semiring__0(X1)
| c_Polynomial_Opoly(c_Fundamental__Theorem__Algebra__Mirabelle_Ooffset__poly(X2,X3,X1),X4,X1) = c_Polynomial_Opoly(X2,c_HOL_Oplus__class_Oplus(X3,X4,X1),X1) ),
c_0_9 ).
cnf(c_0_12,axiom,
class_Ring__and__Field_Ocomm__semiring__0(tc_Complex_Ocomplex),
clsarity_Complex__Ocomplex__Ring__and__Field_Ocomm__semiring__0 ).
cnf(c_0_13,negated_conjecture,
( c_Polynomial_Odegree(c_Fundamental__Theorem__Algebra__Mirabelle_Ooffset__poly(X1,X2,tc_Complex_Ocomplex),tc_Complex_Ocomplex) != c_Polynomial_Odegree(v_p,tc_Complex_Ocomplex)
| c_Polynomial_Opoly(X1,c_HOL_Oplus__class_Oplus(X2,v_q(c_Fundamental__Theorem__Algebra__Mirabelle_Ooffset__poly(X1,X2,tc_Complex_Ocomplex)),tc_Complex_Ocomplex),tc_Complex_Ocomplex) != c_Polynomial_Opoly(v_p,c_HOL_Oplus__class_Oplus(v_z,v_q(c_Fundamental__Theorem__Algebra__Mirabelle_Ooffset__poly(X1,X2,tc_Complex_Ocomplex)),tc_Complex_Ocomplex),tc_Complex_Ocomplex) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12])]) ).
cnf(c_0_14,plain,
( ~ class_Ring__and__Field_Ocomm__semiring__0(X1)
| c_Polynomial_Odegree(c_Fundamental__Theorem__Algebra__Mirabelle_Ooffset__poly(X2,X3,X1),X1) = c_Polynomial_Odegree(X2,X1) ),
inference(fof_simplification,[status(thm)],[cls_degree__offset__poly_0]) ).
cnf(c_0_15,negated_conjecture,
c_Polynomial_Odegree(c_Fundamental__Theorem__Algebra__Mirabelle_Ooffset__poly(v_p,v_z,tc_Complex_Ocomplex),tc_Complex_Ocomplex) != c_Polynomial_Odegree(v_p,tc_Complex_Ocomplex),
inference(er,[status(thm)],[c_0_13]) ).
cnf(c_0_16,plain,
( ~ class_Ring__and__Field_Ocomm__semiring__0(X1)
| c_Polynomial_Odegree(c_Fundamental__Theorem__Algebra__Mirabelle_Ooffset__poly(X2,X3,X1),X1) = c_Polynomial_Odegree(X2,X1) ),
c_0_14 ).
cnf(c_0_17,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_12])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : ALG367-1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.02 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.04/0.32 % Computer : n012.cluster.edu
% 0.04/0.32 % Model : x86_64 x86_64
% 0.04/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.04/0.32 % Memory : 8046.5625MB
% 0.04/0.32 % OS : Linux 6.8.0-71-generic
% 0.04/0.32 % CPULimit : 300
% 0.04/0.32 % WCLimit : 300
% 0.04/0.32 % DateTime : Mon Sep 21 13:17:37 UTC 2026
% 0.04/0.32 % CPUTime :
% 0.04/0.32 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 Running first-order theorem proving
% 0.10/0.36 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
% 11.11/1.89 % Version: 3.5.1
% 11.11/1.89 % Preprocessing class: FSLMSMSSSSSNFFN.
% 11.11/1.89 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 11.11/1.89 % Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 11.11/1.89 % Starting new_bool_3 with 600s (2) cores
% 11.11/1.89 % Starting new_bool_1 with 600s (2) cores
% 11.11/1.89 % Starting sh5l with 300s (1) cores
% 11.11/1.89 % G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with pid 2443597 completed with status 0
% 11.11/1.89 % Result found by G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y
% 11.11/1.89 % Preprocessing class: FSLMSMSSSSSNFFN.
% 11.11/1.89 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 11.11/1.89 % Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 11.11/1.89 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 11.11/1.89 % No SInE strategy applied
% 11.11/1.89 % Search class: FGHSS-FSLM32-MFFFFFNN
% 11.11/1.89 % Scheduled 5 strats onto 3 cores with 900 seconds (900 total)
% 11.11/1.89 % Starting SubtermCWHack with 91s (1) cores
% 11.11/1.89 % Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 541s (1) cores
% 11.11/1.89 % Starting G-E--_208_B07_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 91s (1) cores
% 11.11/1.89 % G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with pid 2443606 completed with status 0
% 11.11/1.89 % Result found by G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y
% 11.11/1.89 % Preprocessing class: FSLMSMSSSSSNFFN.
% 11.11/1.89 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 11.11/1.89 % Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 11.11/1.89 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 11.11/1.89 % No SInE strategy applied
% 11.11/1.89 % Search class: FGHSS-FSLM32-MFFFFFNN
% 11.11/1.89 % Scheduled 5 strats onto 3 cores with 900 seconds (900 total)
% 11.11/1.89 % Starting SubtermCWHack with 91s (1) cores
% 11.11/1.89 % Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 541s (1) cores
% 11.11/1.89 % Preprocessing time : 0.010 s
% 11.11/1.89 % Presaturation interreduction done
% 11.11/1.89
% 11.11/1.89 % Proof found!
% 11.11/1.89 % SZS status Unsatisfiable
% 11.11/1.89 % SZS output start CNFRefutation
% See solution above
% 11.11/1.89 % Parsed axioms : 965
% 11.11/1.89 % Removed by relevancy pruning/SinE : 0
% 11.11/1.89 % Initial clauses : 965
% 11.11/1.89 % Removed in clause preprocessing : 0
% 11.11/1.89 % Initial clauses in saturation : 965
% 11.11/1.89 % Processed clauses : 15738
% 11.11/1.89 % ...of these trivial : 319
% 11.11/1.89 % ...subsumed : 11779
% 11.11/1.89 % ...remaining for further processing : 3640
% 11.11/1.89 % Other redundant clauses eliminated : 4335
% 11.11/1.89 % Clauses deleted for lack of memory : 0
% 11.11/1.89 % Backward-subsumed : 16
% 11.11/1.89 % Backward-rewritten : 156
% 11.11/1.89 % Generated clauses : 69536
% 11.11/1.89 % ...of the previous two non-redundant : 57387
% 11.11/1.89 % ...aggressively subsumed : 0
% 11.11/1.89 % Contextual simplify-reflections : 1
% 11.11/1.89 % Paramodulations : 65112
% 11.11/1.89 % Factorizations : 38
% 11.11/1.89 % NegExts : 0
% 11.11/1.89 % Equation resolutions : 4386
% 11.11/1.89 % Disequality decompositions : 0
% 11.11/1.89 % Total rewrite steps : 45851
% 11.11/1.89 % ...of those cached : 44239
% 11.11/1.89 % Propositional unsat checks : 0
% 11.11/1.89 % Propositional check models : 0
% 11.11/1.89 % Propositional check unsatisfiable : 0
% 11.11/1.89 % Propositional clauses : 0
% 11.11/1.89 % Propositional clauses after purity: 0
% 11.11/1.89 % Propositional unsat core size : 0
% 11.11/1.89 % Propositional preprocessing time : 0.000
% 11.11/1.89 % Propositional encoding time : 0.000
% 11.11/1.89 % Propositional solver time : 0.000
% 11.11/1.89 % Success case prop preproc time : 0.000
% 11.11/1.89 % Success case prop encoding time : 0.000
% 11.11/1.89 % Success case prop solver time : 0.000
% 11.11/1.89 % Current number of processed clauses : 2615
% 11.11/1.89 % Positive orientable unit clauses : 446
% 11.11/1.89 % Positive unorientable unit clauses: 23
% 11.11/1.89 % Negative unit clauses : 170
% 11.11/1.89 % Non-unit-clauses : 1976
% 11.11/1.89 % Current number of unprocessed clauses: 42924
% 11.11/1.89 % ...number of literals in the above : 116979
% 11.11/1.89 % Current number of archived formulas : 0
% 11.11/1.89 % Current number of archived clauses : 1023
% 11.11/1.89 % Clause-clause subsumption calls (NU) : 1025853
% 11.11/1.89 % Rec. Clause-clause subsumption calls : 572967
% 11.11/1.89 % Non-unit clause-clause subsumptions : 8596
% 11.11/1.89 % Unit Clause-clause subsumption calls : 133743
% 11.11/1.89 % Rewrite failures with RHS unbound : 0
% 11.11/1.89 % BW rewrite match attempts : 6335
% 11.11/1.89 % BW rewrite match successes : 507
% 11.11/1.89 % Condensation attempts : 0
% 11.11/1.89 % Condensation successes : 0
% 11.11/1.89 % Termbank termtop insertions : 1019698
% 11.11/1.89 % Search garbage collected termcells : 1789
% 11.11/1.89
% 11.11/1.89 % -------------------------------------------------
% 11.11/1.89 % User time : 1.420 s
% 11.11/1.89 % System time : 0.047 s
% 11.11/1.89 % Total time : 1.467 s
% 11.11/1.89 % Maximum resident set size: 5304 pages
% 11.11/1.89
% 11.11/1.89 % -------------------------------------------------
% 11.11/1.89 % User time : 4.265 s
% 11.11/1.89 % System time : 0.144 s
% 11.11/1.89 % Total time : 4.408 s
% 11.11/1.89 % Maximum resident set size: 5120 pages
% 11.11/1.89 % E exiting
%------------------------------------------------------------------------------