↑ Up

CSE_E---1.7.UNS-CRf.s

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

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

% Comments : 
%------------------------------------------------------------------------------
cnf(cls_that_0,axiom,
    ( v_thesis____
    | c_Polynomial_Odegree(v_p,tc_Complex_Ocomplex) != c_Suc(X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_that_0) ).

cnf(cls_conjecture_0,negated_conjecture,
    ~ v_thesis____,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).

cnf(cls_Suc__pred_0,axiom,
    ( c_Suc(c_HOL_Ominus__class_Ominus(X1,c_Suc(c_HOL_Ozero__class_Ozero(tc_nat)),tc_nat)) = X1
    | ~ c_HOL_Oord__class_Oless(c_HOL_Ozero__class_Ozero(tc_nat),X1,tc_nat) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Suc__pred_0) ).

cnf(cls_le__neq__implies__less_0,axiom,
    ( c_HOL_Oord__class_Oless(X1,X2,tc_nat)
    | X1 = X2
    | ~ c_lessequals(X1,X2,tc_nat) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_le__neq__implies__less_0) ).

cnf(cls_le0_0,axiom,
    c_lessequals(c_HOL_Ozero__class_Ozero(tc_nat),X1,tc_nat),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_le0_0) ).

cnf(cls_dp_0,axiom,
    c_Polynomial_Odegree(v_p,tc_Complex_Ocomplex) != c_HOL_Ozero__class_Ozero(tc_nat),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_dp_0) ).

cnf(c_0_6,axiom,
    ( v_thesis____
    | c_Polynomial_Odegree(v_p,tc_Complex_Ocomplex) != c_Suc(X1) ),
    cls_that_0 ).

cnf(c_0_7,negated_conjecture,
    ~ v_thesis____,
    cls_conjecture_0 ).

cnf(c_0_8,plain,
    c_Polynomial_Odegree(v_p,tc_Complex_Ocomplex) != c_Suc(X1),
    inference(sr,[status(thm)],[c_0_6,c_0_7]) ).

cnf(c_0_9,axiom,
    ( c_Suc(c_HOL_Ominus__class_Ominus(X1,c_Suc(c_HOL_Ozero__class_Ozero(tc_nat)),tc_nat)) = X1
    | ~ c_HOL_Oord__class_Oless(c_HOL_Ozero__class_Ozero(tc_nat),X1,tc_nat) ),
    cls_Suc__pred_0 ).

cnf(c_0_10,plain,
    ~ c_HOL_Oord__class_Oless(c_HOL_Ozero__class_Ozero(tc_nat),c_Polynomial_Odegree(v_p,tc_Complex_Ocomplex),tc_nat),
    inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9])]) ).

cnf(c_0_11,axiom,
    ( c_HOL_Oord__class_Oless(X1,X2,tc_nat)
    | X1 = X2
    | ~ c_lessequals(X1,X2,tc_nat) ),
    cls_le__neq__implies__less_0 ).

cnf(c_0_12,axiom,
    c_lessequals(c_HOL_Ozero__class_Ozero(tc_nat),X1,tc_nat),
    cls_le0_0 ).

cnf(c_0_13,axiom,
    c_Polynomial_Odegree(v_p,tc_Complex_Ocomplex) != c_HOL_Ozero__class_Ozero(tc_nat),
    cls_dp_0 ).

cnf(c_0_14,plain,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12])]),c_0_13]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem    : ALG428-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.15/0.31  % Computer : n009.cluster.edu
% 0.15/0.31  % Model    : x86_64 x86_64
% 0.15/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.31  % Memory   : 8042.1875MB
% 0.15/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.31  % CPULimit   : 300
% 0.15/0.32  % WCLimit    : 300
% 0.15/0.32  % DateTime   : Tue May  5 10:33:26 EDT 2026
% 0.15/0.32  % CPUTime    : 
% 0.15/0.33  % start to proof: theBenchmark
% 2.30/2.11  % Version  : CSE_E---1.7
% 2.30/2.11  % Problem  : theBenchmark.p
% 2.30/2.11  % SZS status Unsatisfiable for theBenchmark.p
% 2.30/2.11  % SZS output start CNFRefutation
% See solution above
% 2.30/2.12  % Total time : 1.429s
%------------------------------------------------------------------------------