%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : ALG347-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 : n011.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:56 AM UTC 2026
% Result : Unsatisfiable 0.36s 20.73s
% Output : CNFRefutation 0.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of clauses : 22 ( 12 unt; 3 nHn; 19 RR)
% Number of literals : 38 ( 21 equ; 20 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 4 con; 0-3 aty)
% Number of variables : 21 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_conjecture_2,negated_conjecture,
c_Polynomial_Odegree(c_Polynomial_OpCons(v_a,c_Fundamental__Theorem__Algebra__Mirabelle_Ooffset__poly(v_pa,v_h,t_a),t_a),t_a) != c_Suc(c_Polynomial_Odegree(v_pa,t_a)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_2) ).
cnf(cls_degree__pCons__eq_0,axiom,
( ~ class_HOL_Ozero(X1)
| X3 = c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(X1))
| c_Polynomial_Odegree(c_Polynomial_OpCons(X2,X3,X1),X1) = c_Suc(c_Polynomial_Odegree(X3,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_degree__pCons__eq_0) ).
cnf(cls_offset__poly__eq__0__iff_0,axiom,
( c_Fundamental__Theorem__Algebra__Mirabelle_Ooffset__poly(X2,X3,X1) != c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(X1))
| ~ class_Ring__and__Field_Ocomm__semiring__0(X1)
| X2 = c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_offset__poly__eq__0__iff_0) ).
cnf(cls_conjecture_0,negated_conjecture,
c_Polynomial_Odegree(c_Fundamental__Theorem__Algebra__Mirabelle_Ooffset__poly(v_pa,v_h,t_a),t_a) = c_Polynomial_Odegree(v_pa,t_a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).
cnf(cls_conjecture_1,negated_conjecture,
v_pa != c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(t_a)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_1) ).
cnf(tfree_tcs,negated_conjecture,
class_Ring__and__Field_Ocomm__semiring__0(t_a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',tfree_tcs) ).
cnf(clsrel_Ring__and__Field_Ocomm__semiring__0_HOL_Ozero,axiom,
( ~ class_Ring__and__Field_Ocomm__semiring__0(X1)
| class_HOL_Ozero(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clsrel_Ring__and__Field_Ocomm__semiring__0_HOL_Ozero) ).
cnf(c_0_7,negated_conjecture,
c_Polynomial_Odegree(c_Polynomial_OpCons(v_a,c_Fundamental__Theorem__Algebra__Mirabelle_Ooffset__poly(v_pa,v_h,t_a),t_a),t_a) != c_Suc(c_Polynomial_Odegree(v_pa,t_a)),
inference(fof_simplification,[status(thm)],[cls_conjecture_2]) ).
cnf(c_0_8,plain,
( ~ class_HOL_Ozero(X1)
| X3 = c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(X1))
| c_Polynomial_Odegree(c_Polynomial_OpCons(X2,X3,X1),X1) = c_Suc(c_Polynomial_Odegree(X3,X1)) ),
inference(fof_simplification,[status(thm)],[cls_degree__pCons__eq_0]) ).
cnf(c_0_9,plain,
( c_Fundamental__Theorem__Algebra__Mirabelle_Ooffset__poly(X2,X3,X1) != c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(X1))
| ~ class_Ring__and__Field_Ocomm__semiring__0(X1)
| X2 = c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(X1)) ),
inference(fof_simplification,[status(thm)],[cls_offset__poly__eq__0__iff_0]) ).
cnf(c_0_10,negated_conjecture,
c_Polynomial_Odegree(c_Polynomial_OpCons(v_a,c_Fundamental__Theorem__Algebra__Mirabelle_Ooffset__poly(v_pa,v_h,t_a),t_a),t_a) != c_Suc(c_Polynomial_Odegree(v_pa,t_a)),
c_0_7 ).
cnf(c_0_11,plain,
( ~ class_HOL_Ozero(X1)
| X3 = c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(X1))
| c_Polynomial_Odegree(c_Polynomial_OpCons(X2,X3,X1),X1) = c_Suc(c_Polynomial_Odegree(X3,X1)) ),
c_0_8 ).
cnf(c_0_12,negated_conjecture,
c_Polynomial_Odegree(c_Fundamental__Theorem__Algebra__Mirabelle_Ooffset__poly(v_pa,v_h,t_a),t_a) = c_Polynomial_Odegree(v_pa,t_a),
cls_conjecture_0 ).
cnf(c_0_13,negated_conjecture,
v_pa != c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(t_a)),
inference(fof_simplification,[status(thm)],[cls_conjecture_1]) ).
cnf(c_0_14,plain,
( c_Fundamental__Theorem__Algebra__Mirabelle_Ooffset__poly(X2,X3,X1) != c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(X1))
| ~ class_Ring__and__Field_Ocomm__semiring__0(X1)
| X2 = c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(X1)) ),
c_0_9 ).
cnf(c_0_15,negated_conjecture,
( ~ class_HOL_Ozero(t_a)
| c_Fundamental__Theorem__Algebra__Mirabelle_Ooffset__poly(v_pa,v_h,t_a) = c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(t_a)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12])]) ).
cnf(c_0_16,negated_conjecture,
class_Ring__and__Field_Ocomm__semiring__0(t_a),
tfree_tcs ).
cnf(c_0_17,negated_conjecture,
v_pa != c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(t_a)),
c_0_13 ).
cnf(c_0_18,plain,
( ~ class_Ring__and__Field_Ocomm__semiring__0(X1)
| class_HOL_Ozero(X1) ),
inference(fof_simplification,[status(thm)],[clsrel_Ring__and__Field_Ocomm__semiring__0_HOL_Ozero]) ).
cnf(c_0_19,negated_conjecture,
~ class_HOL_Ozero(t_a),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]),c_0_17]) ).
cnf(c_0_20,plain,
( ~ class_Ring__and__Field_Ocomm__semiring__0(X1)
| class_HOL_Ozero(X1) ),
c_0_18 ).
cnf(c_0_21,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_16])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : ALG347-1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.34 % Computer : n011.cluster.edu
% 0.08/0.34 % Model : x86_64 x86_64
% 0.08/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.34 % Memory : 8046.5625MB
% 0.08/0.34 % OS : Linux 6.8.0-71-generic
% 0.10/20.45 % CPULimit : 300
% 0.10/20.45 % WCLimit : 300
% 0.10/20.45 % DateTime : Mon Sep 21 13:15:44 UTC 2026
% 0.10/20.45 % CPUTime :
% 0.10/20.45 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.36/20.50 Running first-order theorem proving
% 0.36/20.50 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.36/20.73 % Version: 3.5.1
% 0.36/20.73 % Preprocessing class: FMLMSMSSSSSNFFN.
% 0.36/20.73 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.36/20.73 % Starting G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4c with 1500s (5) cores
% 0.36/20.73 % Starting new_bool_3 with 300s (1) cores
% 0.36/20.73 % Starting new_bool_1 with 300s (1) cores
% 0.36/20.73 % Starting sh5l with 300s (1) cores
% 0.36/20.73 % new_bool_1 with pid 845269 completed with status 0
% 0.36/20.73 % Result found by new_bool_1
% 0.36/20.73 % Preprocessing class: FMLMSMSSSSSNFFN.
% 0.36/20.73 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.36/20.73 % Starting G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4c with 1500s (5) cores
% 0.36/20.73 % Starting new_bool_3 with 300s (1) cores
% 0.36/20.73 % Starting new_bool_1 with 300s (1) cores
% 0.36/20.73 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.36/20.73 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.36/20.73 % Search class: FGHSM-FSLM32-DFFFFFNN
% 0.36/20.73 % Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.36/20.73 % Starting SubtermCWHack with 28s (1) cores
% 0.36/20.73 % SubtermCWHack with pid 845271 completed with status 0
% 0.36/20.73 % Result found by SubtermCWHack
% 0.36/20.73 % Preprocessing class: FMLMSMSSSSSNFFN.
% 0.36/20.73 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.36/20.73 % Starting G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4c with 1500s (5) cores
% 0.36/20.73 % Starting new_bool_3 with 300s (1) cores
% 0.36/20.73 % Starting new_bool_1 with 300s (1) cores
% 0.36/20.73 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.36/20.73 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.36/20.73 % Search class: FGHSM-FSLM32-DFFFFFNN
% 0.36/20.73 % Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.36/20.73 % Starting SubtermCWHack with 28s (1) cores
% 0.36/20.73 % Preprocessing time : 0.005 s
% 0.36/20.73
% 0.36/20.73 % Proof found!
% 0.36/20.73 % SZS status Unsatisfiable
% 0.36/20.73 % SZS output start CNFRefutation
% See solution above
% 0.36/20.73 % Parsed axioms : 1130
% 0.36/20.73 % Removed by relevancy pruning/SinE : 761
% 0.36/20.73 % Initial clauses : 369
% 0.36/20.73 % Removed in clause preprocessing : 0
% 0.36/20.73 % Initial clauses in saturation : 369
% 0.36/20.73 % Processed clauses : 2665
% 0.36/20.73 % ...of these trivial : 286
% 0.36/20.73 % ...subsumed : 1751
% 0.36/20.73 % ...remaining for further processing : 628
% 0.36/20.73 % Other redundant clauses eliminated : 27
% 0.36/20.73 % Clauses deleted for lack of memory : 0
% 0.36/20.73 % Backward-subsumed : 5
% 0.36/20.73 % Backward-rewritten : 59
% 0.36/20.73 % Generated clauses : 12452
% 0.36/20.73 % ...of the previous two non-redundant : 10177
% 0.36/20.73 % ...aggressively subsumed : 0
% 0.36/20.73 % Contextual simplify-reflections : 0
% 0.36/20.73 % Paramodulations : 12412
% 0.36/20.73 % Factorizations : 8
% 0.36/20.73 % NegExts : 0
% 0.36/20.73 % Equation resolutions : 32
% 0.36/20.73 % Disequality decompositions : 0
% 0.36/20.73 % Total rewrite steps : 8734
% 0.36/20.73 % ...of those cached : 8012
% 0.36/20.73 % Propositional unsat checks : 0
% 0.36/20.73 % Propositional check models : 0
% 0.36/20.73 % Propositional check unsatisfiable : 0
% 0.36/20.73 % Propositional clauses : 0
% 0.36/20.73 % Propositional clauses after purity: 0
% 0.36/20.73 % Propositional unsat core size : 0
% 0.36/20.73 % Propositional preprocessing time : 0.000
% 0.36/20.73 % Propositional encoding time : 0.000
% 0.36/20.73 % Propositional solver time : 0.000
% 0.36/20.73 % Success case prop preproc time : 0.000
% 0.36/20.73 % Success case prop encoding time : 0.000
% 0.36/20.73 % Success case prop solver time : 0.000
% 0.36/20.73 % Current number of processed clauses : 564
% 0.36/20.73 % Positive orientable unit clauses : 128
% 0.36/20.73 % Positive unorientable unit clauses: 4
% 0.36/20.73 % Negative unit clauses : 107
% 0.36/20.73 % Non-unit-clauses : 325
% 0.36/20.73 % Current number of unprocessed clauses: 7719
% 0.36/20.73 % ...number of literals in the above : 16943
% 0.36/20.73 % Current number of archived formulas : 0
% 0.36/20.73 % Current number of archived clauses : 64
% 0.36/20.73 % Clause-clause subsumption calls (NU) : 13870
% 0.36/20.73 % Rec. Clause-clause subsumption calls : 12269
% 0.36/20.73 % Non-unit clause-clause subsumptions : 494
% 0.36/20.73 % Unit Clause-clause subsumption calls : 5147
% 0.36/20.73 % Rewrite failures with RHS unbound : 3
% 0.36/20.73 % BW rewrite match attempts : 277
% 0.36/20.73 % BW rewrite match successes : 67
% 0.36/20.73 % Condensation attempts : 0
% 0.36/20.73 % Condensation successes : 0
% 0.36/20.73 % Termbank termtop insertions : 161836
% 0.36/20.73 % Search garbage collected termcells : 3169
% 0.36/20.73
% 0.36/20.73 % -------------------------------------------------
% 0.36/20.73 % User time : 0.154 s
% 0.36/20.73 % System time : 0.007 s
% 0.36/20.73 % Total time : 0.162 s
% 0.36/20.73 % Maximum resident set size: 4668 pages
% 0.36/20.73
% 0.36/20.73 % -------------------------------------------------
% 0.36/20.73 % User time : 0.185 s
% 0.36/20.73 % System time : 0.011 s
% 0.36/20.73 % Total time : 0.196 s
% 0.36/20.73 % Maximum resident set size: 5632 pages
% 0.36/20.73 % E exiting
%------------------------------------------------------------------------------