↑ Up

CSE_E---1.7.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : ALG347-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 : n028.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:30 PM UTC 2026

% Result   : Unsatisfiable 16.33s 10.99s
% Output   : CNFRefutation 16.45s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   18 (  10 unt;   4 nHn;  14 RR)
%            Number of literals    :   31 (  19 equ;  13 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   4 con; 0-3 aty)
%            Number of variables   :   19 (   6 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(cls_degree__pCons__eq_0,axiom,
    ( c_Polynomial_Odegree(c_Polynomial_OpCons(X2,X3,X1),X1) = c_Suc(c_Polynomial_Odegree(X3,X1))
    | X3 = c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(X1))
    | ~ class_HOL_Ozero(X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_degree__pCons__eq_0) ).

cnf(clsrel_Ring__and__Field_Ocomm__semiring__0_HOL_Ozero,axiom,
    ( class_HOL_Ozero(X1)
    | ~ class_Ring__and__Field_Ocomm__semiring__0(X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clsrel_Ring__and__Field_Ocomm__semiring__0_HOL_Ozero) ).

cnf(tfree_tcs,negated_conjecture,
    class_Ring__and__Field_Ocomm__semiring__0(t_a),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',tfree_tcs) ).

cnf(cls_conjecture_2,negated_conjecture,
    c_Polynomial_Odegree(c_Polynomial_OpCons(v_a,c_Fundamental__Theorem__Algebra__Mirabelle_Ooffset__poly(v_pa,v_h,t_a),t_a),t_a) != c_Suc(c_Polynomial_Odegree(v_pa,t_a)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_2) ).

cnf(cls_conjecture_0,negated_conjecture,
    c_Polynomial_Odegree(c_Fundamental__Theorem__Algebra__Mirabelle_Ooffset__poly(v_pa,v_h,t_a),t_a) = c_Polynomial_Odegree(v_pa,t_a),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_0) ).

cnf(cls_offset__poly__eq__0__iff_0,axiom,
    ( X2 = c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(X1))
    | ~ class_Ring__and__Field_Ocomm__semiring__0(X1)
    | c_Fundamental__Theorem__Algebra__Mirabelle_Ooffset__poly(X2,X3,X1) != c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(X1)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_offset__poly__eq__0__iff_0) ).

cnf(cls_conjecture_1,negated_conjecture,
    v_pa != c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(t_a)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_1) ).

cnf(c_0_7,axiom,
    ( c_Polynomial_Odegree(c_Polynomial_OpCons(X2,X3,X1),X1) = c_Suc(c_Polynomial_Odegree(X3,X1))
    | X3 = c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(X1))
    | ~ class_HOL_Ozero(X1) ),
    cls_degree__pCons__eq_0 ).

cnf(c_0_8,axiom,
    ( class_HOL_Ozero(X1)
    | ~ class_Ring__and__Field_Ocomm__semiring__0(X1) ),
    clsrel_Ring__and__Field_Ocomm__semiring__0_HOL_Ozero ).

cnf(c_0_9,plain,
    ( c_Polynomial_Odegree(c_Polynomial_OpCons(X1,X2,X3),X3) = c_Suc(c_Polynomial_Odegree(X2,X3))
    | X2 = c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(X3))
    | ~ class_Ring__and__Field_Ocomm__semiring__0(X3) ),
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_10,negated_conjecture,
    class_Ring__and__Field_Ocomm__semiring__0(t_a),
    tfree_tcs ).

cnf(c_0_11,negated_conjecture,
    c_Polynomial_Odegree(c_Polynomial_OpCons(v_a,c_Fundamental__Theorem__Algebra__Mirabelle_Ooffset__poly(v_pa,v_h,t_a),t_a),t_a) != c_Suc(c_Polynomial_Odegree(v_pa,t_a)),
    cls_conjecture_2 ).

cnf(c_0_12,negated_conjecture,
    ( c_Polynomial_Odegree(c_Polynomial_OpCons(X1,X2,t_a),t_a) = c_Suc(c_Polynomial_Odegree(X2,t_a))
    | X2 = c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(t_a)) ),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_13,negated_conjecture,
    c_Polynomial_Odegree(c_Fundamental__Theorem__Algebra__Mirabelle_Ooffset__poly(v_pa,v_h,t_a),t_a) = c_Polynomial_Odegree(v_pa,t_a),
    cls_conjecture_0 ).

cnf(c_0_14,axiom,
    ( X2 = c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(X1))
    | ~ class_Ring__and__Field_Ocomm__semiring__0(X1)
    | c_Fundamental__Theorem__Algebra__Mirabelle_Ooffset__poly(X2,X3,X1) != c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(X1)) ),
    cls_offset__poly__eq__0__iff_0 ).

cnf(c_0_15,negated_conjecture,
    c_Fundamental__Theorem__Algebra__Mirabelle_Ooffset__poly(v_pa,v_h,t_a) = c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(t_a)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13])]) ).

cnf(c_0_16,negated_conjecture,
    v_pa != c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(t_a)),
    cls_conjecture_1 ).

cnf(c_0_17,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_10])]),c_0_16]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : ALG347-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.14/0.32  % Computer : n028.cluster.edu
% 0.14/0.32  % Model    : x86_64 x86_64
% 0.14/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.32  % Memory   : 8042.1875MB
% 0.14/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.32  % CPULimit   : 300
% 0.14/0.32  % WCLimit    : 300
% 0.14/0.32  % DateTime   : Tue May  5 10:32:45 EDT 2026
% 0.14/0.32  % CPUTime    : 
% 0.14/0.33  % start to proof: theBenchmark
% 16.33/10.99  % Version  : CSE_E---1.7
% 16.33/10.99  % Problem  : theBenchmark.p
% 16.33/10.99  % SZS status Unsatisfiable for theBenchmark.p
% 16.33/10.99  % SZS output start CNFRefutation
% See solution above
% 16.45/11.05  % Total time : 8.446s
%------------------------------------------------------------------------------