%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : ALG367-1 : TPTP v9.3.1. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n007.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 08:12:43 AM UTC 2026
% Result : Unsatisfiable 30.95s 31.24s
% Output : Proof 30.95s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 5
% Syntax : Number of clauses : 16 ( 10 unt; 0 nHn; 14 RR)
% Number of literals : 24 ( 8 equ; 10 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 : 8 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_poly__offset__poly_0,axiom,
( c_Polynomial_Opoly(c_Fundamental__Theorem__Algebra__Mirabelle_Ooffset__poly(V_p,V_h,T_a),V_x,T_a) = c_Polynomial_Opoly(V_p,c_HOL_Oplus__class_Oplus(V_h,V_x,T_a),T_a)
| ~ class_Ring__and__Field_Ocomm__semiring__0(T_a) ),
file('theBenchmark.p',cls_poly__offset__poly_0) ).
cnf(cls_degree__offset__poly_0,axiom,
( c_Polynomial_Odegree(c_Fundamental__Theorem__Algebra__Mirabelle_Ooffset__poly(V_p,V_h,T_a),T_a) = c_Polynomial_Odegree(V_p,T_a)
| ~ class_Ring__and__Field_Ocomm__semiring__0(T_a) ),
file('theBenchmark.p',cls_degree__offset__poly_0) ).
cnf(cls_conjecture_0,negated_conjecture,
~ v_thesis____,
file('theBenchmark.p',cls_conjecture_0) ).
cnf(cls_conjecture_1,negated_conjecture,
( v_thesis____
| c_Polynomial_Odegree(V_qa,tc_Complex_Ocomplex) != c_Polynomial_Odegree(v_p,tc_Complex_Ocomplex)
| c_Polynomial_Opoly(V_qa,v_q(V_qa),tc_Complex_Ocomplex) != c_Polynomial_Opoly(v_p,c_HOL_Oplus__class_Oplus(v_z,v_q(V_qa),tc_Complex_Ocomplex),tc_Complex_Ocomplex) ),
file('theBenchmark.p',cls_conjecture_1) ).
cnf(clsarity_Complex__Ocomplex__Ring__and__Field_Ocomm__semiring__0,axiom,
class_Ring__and__Field_Ocomm__semiring__0(tc_Complex_Ocomplex),
file('theBenchmark.p',clsarity_Complex__Ocomplex__Ring__and__Field_Ocomm__semiring__0) ).
cnf(t1,plain,
( 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)
| v_thesis____
| c_Polynomial_Opoly(c_Fundamental__Theorem__Algebra__Mirabelle_Ooffset__poly(v_p,v_z,tc_Complex_Ocomplex),v_q(c_Fundamental__Theorem__Algebra__Mirabelle_Ooffset__poly(v_p,v_z,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(v_p,v_z,tc_Complex_Ocomplex)),tc_Complex_Ocomplex),tc_Complex_Ocomplex) ),
inference(start,[status(thm),parent(0:0)],[cls_conjecture_1]) ).
cnf(t2,plain,
( ~ class_Ring__and__Field_Ocomm__semiring__0(tc_Complex_Ocomplex)
| c_Polynomial_Opoly(c_Fundamental__Theorem__Algebra__Mirabelle_Ooffset__poly(v_p,v_z,tc_Complex_Ocomplex),v_q(c_Fundamental__Theorem__Algebra__Mirabelle_Ooffset__poly(v_p,v_z,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(v_p,v_z,tc_Complex_Ocomplex)),tc_Complex_Ocomplex),tc_Complex_Ocomplex) ),
inference(extension,[status(thm),parent(t1:1)],[cls_poly__offset__poly_0]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
cnf(t4,plain,
class_Ring__and__Field_Ocomm__semiring__0(tc_Complex_Ocomplex),
inference(extension,[status(thm),parent(t2:2)],[clsarity_Complex__Ocomplex__Ring__and__Field_Ocomm__semiring__0]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).
cnf(t6,plain,
~ v_thesis____,
inference(extension,[status(thm),parent(t1:2)],[cls_conjecture_0]) ).
cnf(t7,plain,
$false,
inference(connection,[status(thm),parent(t6:1)],[t6:1,t1:2]) ).
cnf(t8,plain,
( ~ class_Ring__and__Field_Ocomm__semiring__0(tc_Complex_Ocomplex)
| 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(extension,[status(thm),parent(t1:3)],[cls_degree__offset__poly_0]) ).
cnf(t9,plain,
$false,
inference(connection,[status(thm),parent(t8:1)],[t8:1,t1:3]) ).
cnf(t10,plain,
class_Ring__and__Field_Ocomm__semiring__0(tc_Complex_Ocomplex),
inference(extension,[status(thm),parent(t8:2)],[clsarity_Complex__Ocomplex__Ring__and__Field_Ocomm__semiring__0]) ).
cnf(t11,plain,
$false,
inference(connection,[status(thm),parent(t10:1)],[t10:1,t8:2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : ALG367-1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.03 This is a CNF_UNS_RFO_SEQ_NHN problem
% 0.00/0.03 % Command : /export/starexec/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.34 % Computer : n007.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.08/0.34 % CPULimit : 300
% 0.08/0.34 % WCLimit : 300
% 0.08/0.34 % DateTime : Sun Sep 20 11:08:34 UTC 2026
% 0.08/0.35 % CPUTime :
% 30.95/31.24 % SZS status Unsatisfiable for theBenchmark
% 30.95/31.24 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------