↑ Up

CSE_E---1.7.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : KRS127+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 : n006.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:24 PM UTC 2026

% Result   : Unsatisfiable 1.25s 1.73s
% Output   : CNFRefutation 1.25s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   25 (   4 unt;   0 def)
%            Number of atoms       :   87 (   6 equ)
%            Maximal formula atoms :   30 (   3 avg)
%            Number of connectives :  109 (  47   ~;  43   |;  14   &)
%                                         (   3 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   20 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    8 (   6 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   1 con; 0-1 aty)
%            Number of variables   :   41 (   2 sgn  19   !;   4   ?)

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

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

fof(axiom_2,axiom,
    ! [X4] :
      ( cUnsatisfiable(X4)
    <=> ( ? [X5] :
            ( rr(X4,X5)
            & cc(X5) )
        & ? [X5] :
            ( rr(X4,X5)
            & cd(X5) )
        & ! [X6,X7] :
            ( ( rr(X4,X6)
              & rr(X4,X7) )
           => X6 = X7 ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2) ).

fof(axiom_3,axiom,
    ! [X4] :
      ( cc(X4)
     => cdxcomp(X4) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_3) ).

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

fof(c_0_5,plain,
    ! [X89,X90,X91] :
      ( ( ~ cd(X89)
        | ~ ra_Px1(X89,X90) )
      & ( ra_Px1(X91,esk5_1(X91))
        | cd(X91) ) ),
    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_6,plain,
    ! [X93,X95,X96] :
      ( ( ~ cdxcomp(X93)
        | ra_Px1(X93,esk6_1(X93)) )
      & ( ~ ra_Px1(X95,X96)
        | cdxcomp(X95) ) ),
    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])])])])]) ).

fof(c_0_7,plain,
    ! [X78,X81,X82,X83,X84,X85] :
      ( ( rr(X78,esk1_1(X78))
        | ~ cUnsatisfiable(X78) )
      & ( cc(esk1_1(X78))
        | ~ cUnsatisfiable(X78) )
      & ( rr(X78,esk2_1(X78))
        | ~ cUnsatisfiable(X78) )
      & ( cd(esk2_1(X78))
        | ~ cUnsatisfiable(X78) )
      & ( ~ rr(X78,X81)
        | ~ rr(X78,X82)
        | X81 = X82
        | ~ cUnsatisfiable(X78) )
      & ( rr(X83,esk3_1(X83))
        | ~ rr(X83,X84)
        | ~ cc(X84)
        | ~ rr(X83,X85)
        | ~ cd(X85)
        | cUnsatisfiable(X83) )
      & ( rr(X83,esk4_1(X83))
        | ~ rr(X83,X84)
        | ~ cc(X84)
        | ~ rr(X83,X85)
        | ~ cd(X85)
        | cUnsatisfiable(X83) )
      & ( esk3_1(X83) != esk4_1(X83)
        | ~ rr(X83,X84)
        | ~ cc(X84)
        | ~ rr(X83,X85)
        | ~ cd(X85)
        | cUnsatisfiable(X83) ) ),
    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,
    ( ~ cd(X1)
    | ~ ra_Px1(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

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

fof(c_0_10,plain,
    ! [X88] :
      ( ~ cc(X88)
      | cdxcomp(X88) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_3])]) ).

cnf(c_0_11,plain,
    ( X2 = X3
    | ~ rr(X1,X2)
    | ~ rr(X1,X3)
    | ~ cUnsatisfiable(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_12,plain,
    ( rr(X1,esk2_1(X1))
    | ~ cUnsatisfiable(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_13,plain,
    ( ~ cdxcomp(X1)
    | ~ cd(X1) ),
    inference(spm,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_14,plain,
    ( cdxcomp(X1)
    | ~ cc(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_15,plain,
    ( X1 = esk2_1(X2)
    | ~ rr(X2,X1)
    | ~ cUnsatisfiable(X2) ),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

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

cnf(c_0_17,plain,
    ( ~ cd(X1)
    | ~ cc(X1) ),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

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

cnf(c_0_19,plain,
    ( cd(esk2_1(X1))
    | ~ cUnsatisfiable(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_20,plain,
    ( esk2_1(X1) = esk1_1(X1)
    | ~ cUnsatisfiable(X1) ),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_21,plain,
    ( ~ cd(esk1_1(X1))
    | ~ cUnsatisfiable(X1) ),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_22,plain,
    cUnsatisfiable(i2003_11_14_17_22_27794),
    inference(split_conjunct,[status(thm)],[axiom_6]) ).

cnf(c_0_23,plain,
    ~ cUnsatisfiable(X1),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]) ).

cnf(c_0_24,plain,
    $false,
    inference(sr,[status(thm)],[c_0_22,c_0_23]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13  % Problem    : KRS127+1 : TPTP v9.2.1. Released v3.1.0.
% 0.11/0.13  % 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.34  % Computer : n006.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit   : 300
% 0.14/0.34  % WCLimit    : 300
% 0.14/0.34  % DateTime   : Mon May  4 20:37:46 EDT 2026
% 0.14/0.35  % CPUTime    : 
% 0.14/0.36  % start to proof: theBenchmark
% 1.25/1.73  % Version  : CSE_E---1.7
% 1.25/1.73  % Problem  : theBenchmark.p
% 1.25/1.73  % SZS status Unsatisfiable for theBenchmark.p
% 1.25/1.73  % SZS output start CNFRefutation
% See solution above
% 1.25/1.73  % Total time : 1.371s
%------------------------------------------------------------------------------