%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : ALG391-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 : n003.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.59s 1.88s
% Output : CNFRefutation 1.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 2
% Syntax : Number of clauses : 5 ( 3 unt; 0 nHn; 5 RR)
% Number of literals : 9 ( 8 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_2,negated_conjecture,
( X1 = c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(t_a))
| c_Polynomial_Opoly(v_cs____,hAPP(v_x,X1),t_a) != c_Polynomial_Opoly(X1,hAPP(v_x,X1),t_a)
| c_Polynomial_Odegree(X1,t_a) != c_Polynomial_Odegree(v_cs____,t_a) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_2) ).
cnf(cls_conjecture_0,negated_conjecture,
v_cs____ != c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(t_a)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_0) ).
cnf(c_0_2,negated_conjecture,
( X1 = c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(t_a))
| c_Polynomial_Opoly(v_cs____,hAPP(v_x,X1),t_a) != c_Polynomial_Opoly(X1,hAPP(v_x,X1),t_a)
| c_Polynomial_Odegree(X1,t_a) != c_Polynomial_Odegree(v_cs____,t_a) ),
cls_conjecture_2 ).
cnf(c_0_3,negated_conjecture,
v_cs____ != c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(t_a)),
cls_conjecture_0 ).
cnf(c_0_4,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(er,[status(thm)],[c_0_2]),c_0_3]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : ALG391-1 : TPTP v9.2.1. Released v4.1.0.
% 0.00/0.12 % 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.16/0.33 % Computer : n003.cluster.edu
% 0.16/0.33 % Model : x86_64 x86_64
% 0.16/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33 % Memory : 8042.1875MB
% 0.16/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.33 % CPULimit : 300
% 0.16/0.33 % WCLimit : 300
% 0.16/0.33 % DateTime : Tue May 5 10:36:56 EDT 2026
% 0.16/0.33 % CPUTime :
% 0.16/0.35 % start to proof: theBenchmark
% 1.59/1.88 % Version : CSE_E---1.7
% 1.59/1.88 % Problem : theBenchmark.p
% 1.59/1.88 % SZS status Unsatisfiable for theBenchmark.p
% 1.59/1.88 % SZS output start CNFRefutation
% See solution above
% 1.59/1.88 % Total time : 1.490s
%------------------------------------------------------------------------------