%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : ALG396-1 : TPTP v9.2.1. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n023.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:38 PM UTC 2026
% Result : Unsatisfiable 1.35s 1.79s
% Output : CNFRefutation 1.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 2
% Syntax : Number of clauses : 5 ( 5 unt; 0 nHn; 3 RR)
% Number of literals : 5 ( 4 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-3 aty)
% Number of variables : 2 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_conjecture_0,negated_conjecture,
c_Polynomial_Opoly(v_pa____,v_x____,tc_Complex_Ocomplex) != c_Polynomial_Opoly(v_q____,c_HOL_Ominus__class_Ominus(v_x____,v_c____,tc_Complex_Ocomplex),tc_Complex_Ocomplex),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_0) ).
cnf(cls_th_0,axiom,
c_Polynomial_Opoly(v_q____,c_HOL_Ominus__class_Ominus(X1,v_c____,tc_Complex_Ocomplex),tc_Complex_Ocomplex) = c_Polynomial_Opoly(v_pa____,X1,tc_Complex_Ocomplex),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_th_0) ).
cnf(c_0_2,negated_conjecture,
c_Polynomial_Opoly(v_pa____,v_x____,tc_Complex_Ocomplex) != c_Polynomial_Opoly(v_q____,c_HOL_Ominus__class_Ominus(v_x____,v_c____,tc_Complex_Ocomplex),tc_Complex_Ocomplex),
cls_conjecture_0 ).
cnf(c_0_3,axiom,
c_Polynomial_Opoly(v_q____,c_HOL_Ominus__class_Ominus(X1,v_c____,tc_Complex_Ocomplex),tc_Complex_Ocomplex) = c_Polynomial_Opoly(v_pa____,X1,tc_Complex_Ocomplex),
cls_th_0 ).
cnf(c_0_4,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_2,c_0_3])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : ALG396-1 : TPTP v9.2.1. Released v4.1.0.
% 0.00/0.11 % Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.15/0.32 % Computer : n023.cluster.edu
% 0.15/0.32 % Model : x86_64 x86_64
% 0.15/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.32 % Memory : 8042.1875MB
% 0.15/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.32 % CPULimit : 300
% 0.15/0.32 % WCLimit : 300
% 0.15/0.32 % DateTime : Tue May 5 10:36:38 EDT 2026
% 0.15/0.32 % CPUTime :
% 0.15/0.33 % start to proof: theBenchmark
% 1.35/1.79 % Version : CSE_E---1.7
% 1.35/1.79 % Problem : theBenchmark.p
% 1.35/1.79 % SZS status Unsatisfiable for theBenchmark.p
% 1.35/1.79 % SZS output start CNFRefutation
% See solution above
% 1.35/1.79 % Total time : 1.428s
%------------------------------------------------------------------------------