%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : ALG439-1 : TPTP v9.2.1. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n027.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 5 04:08:43 PM UTC 2026
% Result : Unsatisfiable 1.94s 1.96s
% Output : CNFRefutation 1.94s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 3
% Syntax : Number of clauses : 8 ( 4 unt; 2 nHn; 6 RR)
% Number of literals : 12 ( 11 equ; 4 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-3 aty)
% Number of variables : 4 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_conjecture_1,negated_conjecture,
( c_Polynomial_Opoly(c_Polynomial_OpCons(v_c,c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(tc_Complex_Ocomplex)),tc_Complex_Ocomplex),v_x,tc_Complex_Ocomplex) = v_y
| v_c = v_y ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_1) ).
cnf(cls_mpoly__base__conv_I2_J_0,axiom,
X1 = c_Polynomial_Opoly(c_Polynomial_OpCons(X1,c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(tc_Complex_Ocomplex)),tc_Complex_Ocomplex),X2,tc_Complex_Ocomplex),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_mpoly__base__conv_I2_J_0) ).
cnf(cls_conjecture_0,negated_conjecture,
( v_c != v_y
| c_Polynomial_Opoly(c_Polynomial_OpCons(v_c,c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(tc_Complex_Ocomplex)),tc_Complex_Ocomplex),v_x,tc_Complex_Ocomplex) != v_y ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).
cnf(c_0_3,negated_conjecture,
( c_Polynomial_Opoly(c_Polynomial_OpCons(v_c,c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(tc_Complex_Ocomplex)),tc_Complex_Ocomplex),v_x,tc_Complex_Ocomplex) = v_y
| v_c = v_y ),
cls_conjecture_1 ).
cnf(c_0_4,axiom,
X1 = c_Polynomial_Opoly(c_Polynomial_OpCons(X1,c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(tc_Complex_Ocomplex)),tc_Complex_Ocomplex),X2,tc_Complex_Ocomplex),
cls_mpoly__base__conv_I2_J_0 ).
cnf(c_0_5,negated_conjecture,
( v_c != v_y
| c_Polynomial_Opoly(c_Polynomial_OpCons(v_c,c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(tc_Complex_Ocomplex)),tc_Complex_Ocomplex),v_x,tc_Complex_Ocomplex) != v_y ),
cls_conjecture_0 ).
cnf(c_0_6,negated_conjecture,
v_c = v_y,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_3,c_0_4])]) ).
cnf(c_0_7,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_5,c_0_4])]),c_0_6])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : ALG439-1 : TPTP v9.2.1. Released v4.1.0.
% 0.00/0.11 % Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.16/0.32 % Computer : n027.cluster.edu
% 0.16/0.32 % Model : x86_64 x86_64
% 0.16/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.32 % Memory : 8042.1875MB
% 0.16/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.32 % CPULimit : 300
% 0.16/0.32 % WCLimit : 300
% 0.16/0.32 % DateTime : Tue May 5 10:35:05 EDT 2026
% 0.16/0.32 % CPUTime :
% 0.16/0.33 % start to proof: theBenchmark
% 1.94/1.96 % Version : CSE_E---1.7
% 1.94/1.96 % Problem : theBenchmark.p
% 1.94/1.96 % SZS status Unsatisfiable for theBenchmark.p
% 1.94/1.96 % SZS output start CNFRefutation
% See solution above
% 1.94/1.96 % Total time : 1.429s
%------------------------------------------------------------------------------