%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : ALG391-1 : TPTP v9.3.1. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n015.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:46 AM UTC 2026
% Result : Unsatisfiable 76.01s 76.58s
% Output : Proof 76.01s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 3
% Syntax : Number of clauses : 10 ( 8 unt; 0 nHn; 9 RR)
% Number of literals : 14 ( 11 equ; 6 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-3 aty)
% Number of variables : 2 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_conjecture_0,negated_conjecture,
v_cs____ != c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(t_a)),
file('theBenchmark.p',cls_conjecture_0) ).
cnf(cls_conjecture_2,negated_conjecture,
( V_xa = c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(t_a))
| c_Polynomial_Odegree(V_xa,t_a) != c_Polynomial_Odegree(v_cs____,t_a)
| c_Polynomial_Opoly(v_cs____,hAPP(v_x,V_xa),t_a) != c_Polynomial_Opoly(V_xa,hAPP(v_x,V_xa),t_a) ),
file('theBenchmark.p',cls_conjecture_2) ).
cnf(equality_1,axiom,
Eq_x_0 = Eq_x_0,
theory(equality,[reflexivity]) ).
cnf(t1,plain,
v_cs____ != c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(t_a)),
inference(start,[status(thm),parent(0:0)],[cls_conjecture_0]) ).
cnf(t2,plain,
( c_Polynomial_Odegree(v_cs____,t_a) != c_Polynomial_Odegree(v_cs____,t_a)
| c_Polynomial_Opoly(v_cs____,hAPP(v_x,v_cs____),t_a) != c_Polynomial_Opoly(v_cs____,hAPP(v_x,v_cs____),t_a)
| v_cs____ = c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(t_a)) ),
inference(extension,[status(thm),parent(t1:1)],[cls_conjecture_2]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
cnf(t4,plain,
c_Polynomial_Opoly(v_cs____,hAPP(v_x,v_cs____),t_a) = c_Polynomial_Opoly(v_cs____,hAPP(v_x,v_cs____),t_a),
inference(extension,[status(thm),parent(t2:2)],[equality_1]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).
cnf(t6,plain,
c_Polynomial_Odegree(v_cs____,t_a) = c_Polynomial_Odegree(v_cs____,t_a),
inference(extension,[status(thm),parent(t2:3)],[equality_1]) ).
cnf(t7,plain,
$false,
inference(connection,[status(thm),parent(t6:1)],[t6:1,t2:3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : ALG391-1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.06 This is a CNF_UNS_RFO_SEQ_NHN problem
% 0.00/0.07 % Command : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.69 % Computer : n015.cluster.edu
% 0.19/0.69 % Model : x86_64 x86_64
% 0.19/0.69 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.69 % Memory : 8046.5625MB
% 0.19/0.69 % OS : Linux 6.8.0-71-generic
% 0.19/0.69 % CPULimit : 300
% 0.19/0.69 % WCLimit : 300
% 0.19/0.69 % DateTime : Sun Sep 20 11:19:52 UTC 2026
% 0.19/0.69 % CPUTime :
% 76.01/76.58 % SZS status Unsatisfiable for theBenchmark
% 76.01/76.58 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------