↑ Up

CSE_E---1.7.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : KRS115+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 : n029.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.27s 1.72s
% Output   : CNFRefutation 1.27s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   48 (   5 unt;   0 def)
%            Number of atoms       :  133 (  12 equ)
%            Maximal formula atoms :   19 (   2 avg)
%            Number of connectives :  151 (  66   ~;  57   |;  18   &)
%                                         (   3 <=>;   7  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   19 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :   12 (  10 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   1 con; 0-1 aty)
%            Number of variables   :   83 (   3 sgn  39   !;   5   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(axiom_0,axiom,
    ! [X4] :
      ( cowlThing(X4)
      & ~ cowlNothing(X4) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_0) ).

fof(axiom_6,axiom,
    ! [X4] :
      ( cowlThing(X4)
     => ! [X6,X7] :
          ( ( rf1(X4,X6)
            & rf1(X4,X7) )
         => X6 = X7 ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_6) ).

fof(axiom_10,axiom,
    ! [X4,X5] :
      ( rr(X4,X5)
     => rf1(X4,X5) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_10) ).

fof(axiom_2,axiom,
    ! [X4] :
      ( cUnsatisfiable(X4)
    <=> ( ? [X5] :
            ( rf2(X4,X5)
            & cp2(X5) )
        & ? [X5] :
            ( rf1(X4,X5)
            & cp1(X5) )
        & ? [X5] :
            ( rr(X4,X5)
            & cowlThing(X5) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2) ).

fof(axiom_7,axiom,
    ! [X4] :
      ( cowlThing(X4)
     => ! [X6,X7] :
          ( ( rf2(X4,X6)
            & rf2(X4,X7) )
         => X6 = X7 ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_7) ).

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

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

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

fof(axiom_9,axiom,
    ! [X4,X5] :
      ( rr(X4,X5)
     => rf2(X4,X5) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_9) ).

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

fof(c_0_10,plain,
    ! [X4] :
      ( cowlThing(X4)
      & ~ cowlNothing(X4) ),
    inference(fof_simplification,[status(thm)],[axiom_0]) ).

fof(c_0_11,plain,
    ! [X128,X129,X130] :
      ( ~ cowlThing(X128)
      | ~ rf1(X128,X129)
      | ~ rf1(X128,X130)
      | X129 = X130 ),
    inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_6])])]) ).

fof(c_0_12,plain,
    ! [X109] :
      ( cowlThing(X109)
      & ~ cowlNothing(X109) ),
    inference(variable_rename,[status(thm)],[c_0_10]) ).

fof(c_0_13,plain,
    ! [X136,X137] :
      ( ~ rr(X136,X137)
      | rf1(X136,X137) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_10])]) ).

fof(c_0_14,plain,
    ! [X111,X115,X116,X117,X118] :
      ( ( rf2(X111,esk1_1(X111))
        | ~ cUnsatisfiable(X111) )
      & ( cp2(esk1_1(X111))
        | ~ cUnsatisfiable(X111) )
      & ( rf1(X111,esk2_1(X111))
        | ~ cUnsatisfiable(X111) )
      & ( cp1(esk2_1(X111))
        | ~ cUnsatisfiable(X111) )
      & ( rr(X111,esk3_1(X111))
        | ~ cUnsatisfiable(X111) )
      & ( cowlThing(esk3_1(X111))
        | ~ cUnsatisfiable(X111) )
      & ( ~ rf2(X115,X116)
        | ~ cp2(X116)
        | ~ rf1(X115,X117)
        | ~ cp1(X117)
        | ~ rr(X115,X118)
        | ~ cowlThing(X118)
        | cUnsatisfiable(X115) ) ),
    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])])])])])]) ).

fof(c_0_15,plain,
    ! [X131,X132,X133] :
      ( ~ cowlThing(X131)
      | ~ rf2(X131,X132)
      | ~ rf2(X131,X133)
      | X132 = X133 ),
    inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_7])])]) ).

fof(c_0_16,plain,
    ! [X120,X121,X122] :
      ( ( ~ cp2(X120)
        | ~ ra_Px1(X120,X121) )
      & ( ra_Px1(X122,esk4_1(X122))
        | cp2(X122) ) ),
    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_17,plain,
    ! [X124,X126,X127] :
      ( ( ~ cp2xcomp(X124)
        | ra_Px1(X124,esk5_1(X124)) )
      & ( ~ ra_Px1(X126,X127)
        | cp2xcomp(X126) ) ),
    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_18,plain,
    ! [X119] :
      ( ~ cp1(X119)
      | cp2xcomp(X119) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_3])]) ).

cnf(c_0_19,plain,
    ( X2 = X3
    | ~ cowlThing(X1)
    | ~ rf1(X1,X2)
    | ~ rf1(X1,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_20,plain,
    cowlThing(X1),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_21,plain,
    ( rf1(X1,X2)
    | ~ rr(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_22,plain,
    ( rr(X1,esk3_1(X1))
    | ~ cUnsatisfiable(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_23,plain,
    ( X2 = X3
    | ~ cowlThing(X1)
    | ~ rf2(X1,X2)
    | ~ rf2(X1,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

fof(c_0_24,plain,
    ! [X134,X135] :
      ( ~ rr(X134,X135)
      | rf2(X134,X135) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_9])]) ).

cnf(c_0_25,plain,
    ( ~ cp2(X1)
    | ~ ra_Px1(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

cnf(c_0_26,plain,
    ( ra_Px1(X1,esk5_1(X1))
    | ~ cp2xcomp(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

cnf(c_0_27,plain,
    ( cp2xcomp(X1)
    | ~ cp1(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

cnf(c_0_28,plain,
    ( cp1(esk2_1(X1))
    | ~ cUnsatisfiable(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_29,plain,
    ( X2 = X3
    | ~ rf1(X1,X3)
    | ~ rf1(X1,X2) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20])]) ).

cnf(c_0_30,plain,
    ( rf1(X1,esk3_1(X1))
    | ~ cUnsatisfiable(X1) ),
    inference(spm,[status(thm)],[c_0_21,c_0_22]) ).

cnf(c_0_31,plain,
    ( X2 = X3
    | ~ rf2(X1,X3)
    | ~ rf2(X1,X2) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_20])]) ).

cnf(c_0_32,plain,
    ( rf2(X1,esk1_1(X1))
    | ~ cUnsatisfiable(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_33,plain,
    ( rf2(X1,X2)
    | ~ rr(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_24]) ).

cnf(c_0_34,plain,
    ( ~ cp2xcomp(X1)
    | ~ cp2(X1) ),
    inference(spm,[status(thm)],[c_0_25,c_0_26]) ).

cnf(c_0_35,plain,
    ( cp2xcomp(esk2_1(X1))
    | ~ cUnsatisfiable(X1) ),
    inference(spm,[status(thm)],[c_0_27,c_0_28]) ).

cnf(c_0_36,plain,
    ( X1 = esk3_1(X2)
    | ~ rf1(X2,X1)
    | ~ cUnsatisfiable(X2) ),
    inference(spm,[status(thm)],[c_0_29,c_0_30]) ).

cnf(c_0_37,plain,
    ( rf1(X1,esk2_1(X1))
    | ~ cUnsatisfiable(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_38,plain,
    ( X1 = esk1_1(X2)
    | ~ rf2(X2,X1)
    | ~ cUnsatisfiable(X2) ),
    inference(spm,[status(thm)],[c_0_31,c_0_32]) ).

cnf(c_0_39,plain,
    ( rf2(X1,esk3_1(X1))
    | ~ cUnsatisfiable(X1) ),
    inference(spm,[status(thm)],[c_0_33,c_0_22]) ).

cnf(c_0_40,plain,
    ( ~ cp2(esk2_1(X1))
    | ~ cUnsatisfiable(X1) ),
    inference(spm,[status(thm)],[c_0_34,c_0_35]) ).

cnf(c_0_41,plain,
    ( esk2_1(X1) = esk3_1(X1)
    | ~ cUnsatisfiable(X1) ),
    inference(spm,[status(thm)],[c_0_36,c_0_37]) ).

cnf(c_0_42,plain,
    ( cp2(esk1_1(X1))
    | ~ cUnsatisfiable(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_43,plain,
    ( esk1_1(X1) = esk3_1(X1)
    | ~ cUnsatisfiable(X1) ),
    inference(spm,[status(thm)],[c_0_38,c_0_39]) ).

cnf(c_0_44,plain,
    ( ~ cp2(esk3_1(X1))
    | ~ cUnsatisfiable(X1) ),
    inference(spm,[status(thm)],[c_0_40,c_0_41]) ).

cnf(c_0_45,plain,
    cUnsatisfiable(i2003_11_14_17_21_30578),
    inference(split_conjunct,[status(thm)],[axiom_8]) ).

cnf(c_0_46,plain,
    ~ cUnsatisfiable(X1),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44]) ).

cnf(c_0_47,plain,
    $false,
    inference(sr,[status(thm)],[c_0_45,c_0_46]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : KRS115+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.14/0.33  % Computer : n029.cluster.edu
% 0.14/0.33  % Model    : x86_64 x86_64
% 0.14/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33  % Memory   : 8042.1875MB
% 0.14/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33  % CPULimit   : 300
% 0.14/0.33  % WCLimit    : 300
% 0.14/0.33  % DateTime   : Mon May  4 20:38:14 EDT 2026
% 0.14/0.33  % CPUTime    : 
% 0.14/0.34  % 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
%------------------------------------------------------------------------------