%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : ALG395-1 : TPTP v9.3.1. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p 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 : Fri Sep 25 12:54:10 PM UTC 2026
% Result : Unsatisfiable 7.92s 1.74s
% Output : CNFRefutation 7.92s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 3
% Syntax : Number of formulae : 8 ( 6 unt; 0 def)
% Number of atoms : 10 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 7 ( 5 ~; 2 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 3 ( 2 usr; 2 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-3 aty)
% Number of variables : 7 ( 0 sgn 7 !; 0 ?; 4 :)
% Comments :
%------------------------------------------------------------------------------
fof(f900,axiom,
! [X0,X1] : c_lessequals(c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(X0,v_sko__Fundamental__Theorem__Algebra__Mirabelle__Xpoly__minimum__modulus__1(X0),tc_Complex_Ocomplex),tc_Complex_Ocomplex),c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(X0,X1,tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_RealDef_Oreal),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_poly__minimum__modulus_0) ).
fof(f915,negated_conjecture,
~ v_thesis____,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).
fof(f916,negated_conjecture,
! [X0] :
( ~ c_lessequals(c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(v_pa____,X0,tc_Complex_Ocomplex),tc_Complex_Ocomplex),c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(v_pa____,hAPP(v_x,X0),tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_RealDef_Oreal)
| v_thesis____ ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_1) ).
tcf(c_1654,plain,
! [X0: $i,X1: $i] : c_lessequals(c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(X0,v_sko__Fundamental__Theorem__Algebra__Mirabelle__Xpoly__minimum__modulus__1(X0),tc_Complex_Ocomplex),tc_Complex_Ocomplex),c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(X0,X1,tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_RealDef_Oreal),
inference(cnf_transformation,[],[f900]) ).
tcf(c_1669,negated_conjecture,
~ v_thesis____,
inference(cnf_transformation,[],[f915]) ).
tcf(c_1670,negated_conjecture,
! [X0: $i] :
( v_thesis____
| ~ c_lessequals(c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(v_pa____,X0,tc_Complex_Ocomplex),tc_Complex_Ocomplex),c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(v_pa____,hAPP(v_x,X0),tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_RealDef_Oreal) ),
inference(cnf_transformation,[],[f916]) ).
tcf(c_1981,negated_conjecture,
! [X0: $i] : ~ c_lessequals(c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(v_pa____,X0,tc_Complex_Ocomplex),tc_Complex_Ocomplex),c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(v_pa____,hAPP(v_x,X0),tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_RealDef_Oreal),
inference(global_subsumption_just,[status(thm)],[c_1670,c_1669,c_1670]) ).
tcf(c_1986,plain,
$false,
inference(superposition,[status(thm)],[c_1654,c_1981]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : ALG395-1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p 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.03/0.36 % CPULimit : 300
% 0.03/0.36 % WCLimit : 300
% 0.03/0.36 % DateTime : Fri Sep 25 05:35:08 UTC 2026
% 0.03/0.36 % CPUTime :
% 0.03/0.36 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.03/0.39 Running first-order theorem proving
% 0.03/0.39 Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.03/0.40
% 0.03/0.40 % ======== iProver multi-core TPTP/SMT =========
% 0.03/0.40
% 0.03/0.40 % Detected problem language: tptp
% 0.03/0.42 % Proving...
% 7.92/1.74 % SZS status Started for theBenchmark.p
% 7.92/1.74 % SZS status Unsatisfiable for theBenchmark.p
% 7.92/1.74
% 7.92/1.74 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 7.92/1.74
% 7.92/1.74 % ------ iProver source info
% 7.92/1.74
% 7.92/1.74 % git: date: 2026-07-19 20:42:38 +0200
% 7.92/1.74 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 7.92/1.74 % git: non_committed_changes: false
% 7.92/1.74
% 7.92/1.74 % ------ Parsing...% successful
% 7.92/1.74
% 7.92/1.74
% 7.92/1.74 % ------ Clausification by vclausify_rel & Parsing by iProver...
% 7.92/1.74 % ------ Proving...
% 7.92/1.74 % ------ Problem Properties
% 7.92/1.74
% 7.92/1.74 %
% 7.92/1.74 % clauses 871
% 7.92/1.74 % conjectures 2
% 7.92/1.74 % EPR 151
% 7.92/1.74 % Horn 808
% 7.92/1.74 % unary 144
% 7.92/1.74 % binary 342
% 7.92/1.74 % lits 2173
% 7.92/1.74 % lits eq 403
% 7.92/1.74 % fd_pure 0
% 7.92/1.74 % fd_pseudo 0
% 7.92/1.74 % fd_cond 11
% 7.92/1.74 % fd_pseudo_cond 78
% 7.92/1.74 % AC symbols 0
% 7.92/1.74
% 7.92/1.74 % ------ Input Options Time Limit: Unbounded
% 7.92/1.74
% 7.92/1.74
% 7.92/1.74 % ------
% 7.92/1.74 % Current options:
% 7.92/1.74 % ------
% 7.92/1.74
% 7.92/1.74
% 7.92/1.74 %
% 7.92/1.74
% 7.92/1.74 % ------ Proving...
% 7.92/1.74 %
% 7.92/1.74
% 7.92/1.74 % SZS status Unsatisfiable for theBenchmark.p
% 7.92/1.74
% 7.92/1.74 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 7.92/1.74
% 7.92/1.74
%------------------------------------------------------------------------------