%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : ALG395-1 : TPTP v9.3.1. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n018.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:56:02 AM UTC 2026
% Result : Unsatisfiable 0.18s 0.57s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 3
% Syntax : Number of clauses : 10 ( 7 unt; 0 nHn; 8 RR)
% Number of literals : 13 ( 0 equ; 7 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 2 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-3 aty)
% Number of variables : 8 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_that_0,axiom,
( ~ c_lessequals(c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(v_pa____,X1,tc_Complex_Ocomplex),tc_Complex_Ocomplex),c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(v_pa____,v_sko__local__Xthat__1(X1,v_pa____),tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_RealDef_Oreal)
| v_thesis____ ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_that_0) ).
cnf(cls_conjecture_0,negated_conjecture,
~ v_thesis____,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_0) ).
cnf(cls_poly__minimum__modulus_0,axiom,
c_lessequals(c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(X1,v_sko__Fundamental__Theorem__Algebra__Mirabelle__Xpoly__minimum__modulus__1(X1),tc_Complex_Ocomplex),tc_Complex_Ocomplex),c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(X1,X2,tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_RealDef_Oreal),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_poly__minimum__modulus_0) ).
cnf(c_0_3,plain,
( ~ c_lessequals(c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(v_pa____,X1,tc_Complex_Ocomplex),tc_Complex_Ocomplex),c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(v_pa____,v_sko__local__Xthat__1(X1,v_pa____),tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_RealDef_Oreal)
| v_thesis____ ),
inference(fof_simplification,[status(thm)],[cls_that_0]) ).
cnf(c_0_4,negated_conjecture,
~ v_thesis____,
inference(fof_simplification,[status(thm)],[cls_conjecture_0]) ).
cnf(c_0_5,plain,
( ~ c_lessequals(c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(v_pa____,X1,tc_Complex_Ocomplex),tc_Complex_Ocomplex),c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(v_pa____,v_sko__local__Xthat__1(X1,v_pa____),tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_RealDef_Oreal)
| v_thesis____ ),
c_0_3 ).
cnf(c_0_6,negated_conjecture,
~ v_thesis____,
c_0_4 ).
cnf(c_0_7,plain,
~ c_lessequals(c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(v_pa____,X1,tc_Complex_Ocomplex),tc_Complex_Ocomplex),c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(v_pa____,v_sko__local__Xthat__1(X1,v_pa____),tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_RealDef_Oreal),
inference(sr,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_8,axiom,
c_lessequals(c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(X1,v_sko__Fundamental__Theorem__Algebra__Mirabelle__Xpoly__minimum__modulus__1(X1),tc_Complex_Ocomplex),tc_Complex_Ocomplex),c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(X1,X2,tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_RealDef_Oreal),
cls_poly__minimum__modulus_0 ).
cnf(c_0_9,plain,
$false,
inference(spm,[status(thm)],[c_0_7,c_0_8]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : ALG395-1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.36 % Computer : n018.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 13:21:00 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.41 Running first-order theorem proving
% 0.09/0.41 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.18/0.57 % Version: 3.5.1
% 0.18/0.57 % Preprocessing class: FSLMSMSSSSSNFFN.
% 0.18/0.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.57 % Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 0.18/0.57 % Starting new_bool_3 with 600s (2) cores
% 0.18/0.57 % Starting new_bool_1 with 600s (2) cores
% 0.18/0.57 % Starting sh5l with 300s (1) cores
% 0.18/0.57 % G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with pid 1982452 completed with status 0
% 0.18/0.57 % Result found by G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y
% 0.18/0.57 % Preprocessing class: FSLMSMSSSSSNFFN.
% 0.18/0.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.57 % Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 0.18/0.57 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.18/0.57 % No SInE strategy applied
% 0.18/0.57 % Search class: FGHSM-FSLM32-MFFFFFNN
% 0.18/0.57 % Scheduled 12 strats onto 3 cores with 900 seconds (900 total)
% 0.18/0.57 % Starting SubtermCWHack with 82s (1) cores
% 0.18/0.57 % Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 91s (1) cores
% 0.18/0.57 % Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y with 74s (1) cores
% 0.18/0.57 % G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with pid 1982466 completed with status 0
% 0.18/0.57 % Result found by G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y
% 0.18/0.57 % Preprocessing class: FSLMSMSSSSSNFFN.
% 0.18/0.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.57 % Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 0.18/0.57 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.18/0.57 % No SInE strategy applied
% 0.18/0.57 % Search class: FGHSM-FSLM32-MFFFFFNN
% 0.18/0.57 % Scheduled 12 strats onto 3 cores with 900 seconds (900 total)
% 0.18/0.57 % Starting SubtermCWHack with 82s (1) cores
% 0.18/0.57 % Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 91s (1) cores
% 0.18/0.57 % Preprocessing time : 0.011 s
% 0.18/0.57 % Presaturation interreduction done
% 0.18/0.57
% 0.18/0.57 % Proof found!
% 0.18/0.57 % SZS status Unsatisfiable
% 0.18/0.57 % SZS output start CNFRefutation
% See solution above
% 0.18/0.57 % Parsed axioms : 899
% 0.18/0.57 % Removed by relevancy pruning/SinE : 0
% 0.18/0.57 % Initial clauses : 899
% 0.18/0.57 % Removed in clause preprocessing : 2
% 0.18/0.57 % Initial clauses in saturation : 897
% 0.18/0.57 % Processed clauses : 1172
% 0.18/0.57 % ...of these trivial : 0
% 0.18/0.57 % ...subsumed : 117
% 0.18/0.57 % ...remaining for further processing : 1055
% 0.18/0.57 % Other redundant clauses eliminated : 2
% 0.18/0.57 % Clauses deleted for lack of memory : 0
% 0.18/0.57 % Backward-subsumed : 0
% 0.18/0.57 % Backward-rewritten : 7
% 0.18/0.57 % Generated clauses : 125
% 0.18/0.57 % ...of the previous two non-redundant : 98
% 0.18/0.57 % ...aggressively subsumed : 0
% 0.18/0.57 % Contextual simplify-reflections : 0
% 0.18/0.57 % Paramodulations : 120
% 0.18/0.57 % Factorizations : 0
% 0.18/0.57 % NegExts : 0
% 0.18/0.57 % Equation resolutions : 5
% 0.18/0.57 % Disequality decompositions : 0
% 0.18/0.57 % Total rewrite steps : 70
% 0.18/0.57 % ...of those cached : 41
% 0.18/0.57 % Propositional unsat checks : 0
% 0.18/0.57 % Propositional check models : 0
% 0.18/0.57 % Propositional check unsatisfiable : 0
% 0.18/0.57 % Propositional clauses : 0
% 0.18/0.57 % Propositional clauses after purity: 0
% 0.18/0.57 % Propositional unsat core size : 0
% 0.18/0.57 % Propositional preprocessing time : 0.000
% 0.18/0.57 % Propositional encoding time : 0.000
% 0.18/0.57 % Propositional solver time : 0.000
% 0.18/0.57 % Success case prop preproc time : 0.000
% 0.18/0.57 % Success case prop encoding time : 0.000
% 0.18/0.57 % Success case prop solver time : 0.000
% 0.18/0.57 % Current number of processed clauses : 245
% 0.18/0.57 % Positive orientable unit clauses : 147
% 0.18/0.57 % Positive unorientable unit clauses: 0
% 0.18/0.57 % Negative unit clauses : 10
% 0.18/0.57 % Non-unit-clauses : 88
% 0.18/0.57 % Current number of unprocessed clauses: 626
% 0.18/0.57 % ...number of literals in the above : 1697
% 0.18/0.57 % Current number of archived formulas : 0
% 0.18/0.57 % Current number of archived clauses : 811
% 0.18/0.57 % Clause-clause subsumption calls (NU) : 54653
% 0.18/0.57 % Rec. Clause-clause subsumption calls : 29571
% 0.18/0.57 % Non-unit clause-clause subsumptions : 99
% 0.18/0.57 % Unit Clause-clause subsumption calls : 32
% 0.18/0.57 % Rewrite failures with RHS unbound : 0
% 0.18/0.57 % BW rewrite match attempts : 65
% 0.18/0.57 % BW rewrite match successes : 11
% 0.18/0.57 % Condensation attempts : 0
% 0.18/0.57 % Condensation successes : 0
% 0.18/0.57 % Termbank termtop insertions : 37168
% 0.18/0.57 % Search garbage collected termcells : 1555
% 0.18/0.57
% 0.18/0.57 % -------------------------------------------------
% 0.18/0.57 % User time : 0.101 s
% 0.18/0.57 % System time : 0.013 s
% 0.18/0.57 % Total time : 0.114 s
% 0.18/0.57 % Maximum resident set size: 5256 pages
% 0.18/0.57
% 0.18/0.57 % -------------------------------------------------
% 0.18/0.57 % User time : 0.268 s
% 0.18/0.57 % System time : 0.032 s
% 0.18/0.57 % Total time : 0.300 s
% 0.18/0.57 % Maximum resident set size: 5120 pages
% 0.18/0.57 % E exiting
%------------------------------------------------------------------------------