↑ Up

CSE_E---1.7.UNS-CRf.s

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

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

% Comments : 
%------------------------------------------------------------------------------
cnf(cls_kpn_0,axiom,
    v_s____ = c_Polynomial_OpCons(v_k____,c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(tc_Complex_Ocomplex)),tc_Complex_Ocomplex),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_kpn_0) ).

cnf(cls_conjecture_0,negated_conjecture,
    v_k____ = c_HOL_Ozero__class_Ozero(tc_Complex_Ocomplex),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).

cnf(cls_pCons__0__0_0,axiom,
    ( c_Polynomial_OpCons(c_HOL_Ozero__class_Ozero(X1),c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(X1)),X1) = c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(X1))
    | ~ class_HOL_Ozero(X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_pCons__0__0_0) ).

cnf(clsarity_Complex__Ocomplex__HOL_Ozero,axiom,
    class_HOL_Ozero(tc_Complex_Ocomplex),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clsarity_Complex__Ocomplex__HOL_Ozero) ).

cnf(cls_sne_0,axiom,
    v_s____ != c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(tc_Complex_Ocomplex)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_sne_0) ).

cnf(c_0_5,axiom,
    v_s____ = c_Polynomial_OpCons(v_k____,c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(tc_Complex_Ocomplex)),tc_Complex_Ocomplex),
    cls_kpn_0 ).

cnf(c_0_6,negated_conjecture,
    v_k____ = c_HOL_Ozero__class_Ozero(tc_Complex_Ocomplex),
    cls_conjecture_0 ).

cnf(c_0_7,plain,
    c_Polynomial_OpCons(c_HOL_Ozero__class_Ozero(tc_Complex_Ocomplex),c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(tc_Complex_Ocomplex)),tc_Complex_Ocomplex) = v_s____,
    inference(rw,[status(thm)],[c_0_5,c_0_6]) ).

cnf(c_0_8,axiom,
    ( c_Polynomial_OpCons(c_HOL_Ozero__class_Ozero(X1),c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(X1)),X1) = c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(X1))
    | ~ class_HOL_Ozero(X1) ),
    cls_pCons__0__0_0 ).

cnf(c_0_9,axiom,
    class_HOL_Ozero(tc_Complex_Ocomplex),
    clsarity_Complex__Ocomplex__HOL_Ozero ).

cnf(c_0_10,axiom,
    v_s____ != c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(tc_Complex_Ocomplex)),
    cls_sne_0 ).

cnf(c_0_11,plain,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9])]),c_0_10]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem    : ALG417-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.14/0.32  % Computer : n025.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:33:58 EDT 2026
% 0.14/0.32  % CPUTime    : 
% 0.14/0.33  % start to proof: theBenchmark
% 1.34/1.79  % Version  : CSE_E---1.7
% 1.34/1.79  % Problem  : theBenchmark.p
% 1.34/1.79  % SZS status Unsatisfiable for theBenchmark.p
% 1.34/1.79  % SZS output start CNFRefutation
% See solution above
% 1.34/1.79  % Total time : 1.425s
%------------------------------------------------------------------------------