↑ Up

CSE_E---1.7.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : KRS074+1 : TPTP v9.2.1. Released v3.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 : n020.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:36:17 PM UTC 2026

% Result   : Unsatisfiable 1.27s 1.72s
% Output   : CNFRefutation 1.27s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   10 (   4 unt;   0 def)
%            Number of atoms       :   48 (   0 equ)
%            Maximal formula atoms :   23 (   4 avg)
%            Number of connectives :   61 (  23   ~;  20   |;  14   &)
%                                         (   2 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   18 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   1 con; 0-1 aty)
%            Number of variables   :   18 (   1 sgn   9   !;   4   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(axiom_2,axiom,
    ! [X4] :
      ( cUnsatisfiable(X4)
    <=> ( ? [X5] :
            ( rs(X4,X5)
            & cp(X5)
            & ? [X6] :
                ( rinvS(X5,X6)
                & cp(X6) ) )
        & ! [X5] :
            ( rs(X4,X5)
           => ~ cp(X5) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).

fof(axiom_9,axiom,
    cUnsatisfiable(i2003_11_14_17_18_59896),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_9) ).

fof(c_0_2,plain,
    ! [X4] :
      ( cUnsatisfiable(X4)
    <=> ( ? [X5] :
            ( rs(X4,X5)
            & cp(X5)
            & ? [X6] :
                ( rinvS(X5,X6)
                & cp(X6) ) )
        & ! [X5] :
            ( rs(X4,X5)
           => ~ cp(X5) ) ) ),
    inference(fof_simplification,[status(thm)],[axiom_2]) ).

fof(c_0_3,plain,
    ! [X130,X133,X134,X135,X136] :
      ( ( rs(X130,esk1_1(X130))
        | ~ cUnsatisfiable(X130) )
      & ( cp(esk1_1(X130))
        | ~ cUnsatisfiable(X130) )
      & ( rinvS(esk1_1(X130),esk2_1(X130))
        | ~ cUnsatisfiable(X130) )
      & ( cp(esk2_1(X130))
        | ~ cUnsatisfiable(X130) )
      & ( ~ rs(X130,X133)
        | ~ cp(X133)
        | ~ cUnsatisfiable(X130) )
      & ( rs(X134,esk3_1(X134))
        | ~ rs(X134,X135)
        | ~ cp(X135)
        | ~ rinvS(X135,X136)
        | ~ cp(X136)
        | cUnsatisfiable(X134) )
      & ( cp(esk3_1(X134))
        | ~ rs(X134,X135)
        | ~ cp(X135)
        | ~ rinvS(X135,X136)
        | ~ cp(X136)
        | cUnsatisfiable(X134) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])])])]) ).

cnf(c_0_4,plain,
    ( ~ rs(X1,X2)
    | ~ cp(X2)
    | ~ cUnsatisfiable(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_5,plain,
    ( rs(X1,esk1_1(X1))
    | ~ cUnsatisfiable(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_6,plain,
    ( cp(esk1_1(X1))
    | ~ cUnsatisfiable(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_7,plain,
    cUnsatisfiable(i2003_11_14_17_18_59896),
    inference(split_conjunct,[status(thm)],[axiom_9]) ).

cnf(c_0_8,plain,
    ~ cUnsatisfiable(X1),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_5]),c_0_6]) ).

cnf(c_0_9,plain,
    $false,
    inference(sr,[status(thm)],[c_0_7,c_0_8]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : KRS074+1 : TPTP v9.2.1. Released v3.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.17/0.33  % Computer : n020.cluster.edu
% 0.17/0.33  % Model    : x86_64 x86_64
% 0.17/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.33  % Memory   : 8042.1875MB
% 0.17/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.17/0.33  % CPULimit   : 300
% 0.17/0.33  % WCLimit    : 300
% 0.17/0.33  % DateTime   : Mon May  4 20:36:34 EDT 2026
% 0.17/0.33  % CPUTime    : 
% 0.17/0.35  % start to proof: theBenchmark
% 1.27/1.72  % Version  : CSE_E---1.7
% 1.27/1.72  % Problem  : theBenchmark.p
% 1.27/1.72  % SZS status Unsatisfiable for theBenchmark.p
% 1.27/1.72  % SZS output start CNFRefutation
% See solution above
% 1.27/1.72  % Total time : 1.372s
%------------------------------------------------------------------------------