↑ Up

CSE_E---1.7.UNS-CRf.s

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

% Result   : Unsatisfiable 1.26s 1.72s
% Output   : CNFRefutation 1.26s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   21 (   4 unt;   0 def)
%            Number of atoms       :   69 (   0 equ)
%            Maximal formula atoms :   15 (   3 avg)
%            Number of connectives :   82 (  34   ~;  30   |;  13   &)
%                                         (   4 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   13 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    8 (   7 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   1 con; 0-1 aty)
%            Number of variables   :   34 (   2 sgn  18   !;   4   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(axiom_3,axiom,
    ! [X4] :
      ( cp(X4)
    <=> ~ ? [X5] : ra_Px1(X4,X5) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_3) ).

fof(axiom_4,axiom,
    ! [X4] :
      ( cpxcomp(X4)
    <=> ? [X6] : ra_Px1(X4,X6) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_4) ).

fof(axiom_2,axiom,
    ! [X4] :
      ( cUnsatisfiable(X4)
    <=> ( ? [X5] :
            ( rs(X4,X5)
            & ca_Ax2(X5) )
        & ! [X5] :
            ( rs(X4,X5)
           => cpxcomp(X5) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2) ).

fof(axiom_5,axiom,
    ! [X4] :
      ( ca_Ax2(X4)
    <=> ( cp(X4)
        & ? [X5] :
            ( rinvS(X4,X5)
            & cp(X5) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_5) ).

fof(axiom_12,axiom,
    cUnsatisfiable(i2003_11_14_17_21_12565),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_12) ).

fof(c_0_5,plain,
    ! [X162,X163,X164] :
      ( ( ~ cp(X162)
        | ~ ra_Px1(X162,X163) )
      & ( ra_Px1(X164,esk3_1(X164))
        | cp(X164) ) ),
    inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_3])])])])]) ).

fof(c_0_6,plain,
    ! [X166,X168,X169] :
      ( ( ~ cpxcomp(X166)
        | ra_Px1(X166,esk4_1(X166)) )
      & ( ~ ra_Px1(X168,X169)
        | cpxcomp(X168) ) ),
    inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_4])])])])]) ).

fof(c_0_7,plain,
    ! [X156,X158,X159,X160] :
      ( ( rs(X156,esk1_1(X156))
        | ~ cUnsatisfiable(X156) )
      & ( ca_Ax2(esk1_1(X156))
        | ~ cUnsatisfiable(X156) )
      & ( ~ rs(X156,X158)
        | cpxcomp(X158)
        | ~ cUnsatisfiable(X156) )
      & ( rs(X159,esk2_1(X159))
        | ~ rs(X159,X160)
        | ~ ca_Ax2(X160)
        | cUnsatisfiable(X159) )
      & ( ~ cpxcomp(esk2_1(X159))
        | ~ rs(X159,X160)
        | ~ ca_Ax2(X160)
        | cUnsatisfiable(X159) ) ),
    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)],[axiom_2])])])])])]) ).

cnf(c_0_8,plain,
    ( ~ cp(X1)
    | ~ ra_Px1(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_9,plain,
    ( ra_Px1(X1,esk4_1(X1))
    | ~ cpxcomp(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_10,plain,
    ( cpxcomp(X2)
    | ~ rs(X1,X2)
    | ~ cUnsatisfiable(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

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

cnf(c_0_12,plain,
    ( ~ cpxcomp(X1)
    | ~ cp(X1) ),
    inference(spm,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_13,plain,
    ( cpxcomp(esk1_1(X1))
    | ~ cUnsatisfiable(X1) ),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

fof(c_0_14,plain,
    ! [X170,X172,X173] :
      ( ( cp(X170)
        | ~ ca_Ax2(X170) )
      & ( rinvS(X170,esk5_1(X170))
        | ~ ca_Ax2(X170) )
      & ( cp(esk5_1(X170))
        | ~ ca_Ax2(X170) )
      & ( ~ cp(X172)
        | ~ rinvS(X172,X173)
        | ~ cp(X173)
        | ca_Ax2(X172) ) ),
    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)],[axiom_5])])])])])]) ).

cnf(c_0_15,plain,
    ( ~ cp(esk1_1(X1))
    | ~ cUnsatisfiable(X1) ),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_16,plain,
    ( cp(X1)
    | ~ ca_Ax2(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_17,plain,
    ( ca_Ax2(esk1_1(X1))
    | ~ cUnsatisfiable(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_18,plain,
    cUnsatisfiable(i2003_11_14_17_21_12565),
    inference(split_conjunct,[status(thm)],[axiom_12]) ).

cnf(c_0_19,plain,
    ~ cUnsatisfiable(X1),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]) ).

cnf(c_0_20,plain,
    $false,
    inference(sr,[status(thm)],[c_0_18,c_0_19]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : KRS110+1 : TPTP v9.2.1. Released v3.1.0.
% 0.00/0.12  % 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.16/0.33  % Computer : n026.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   : Mon May  4 20:38:23 EDT 2026
% 0.16/0.33  % CPUTime    : 
% 0.16/0.34  % start to proof: theBenchmark
% 1.26/1.72  % Version  : CSE_E---1.7
% 1.26/1.72  % Problem  : theBenchmark.p
% 1.26/1.72  % SZS status Unsatisfiable for theBenchmark.p
% 1.26/1.72  % SZS output start CNFRefutation
% See solution above
% 1.26/1.72  % Total time : 1.373s
%------------------------------------------------------------------------------