TSTP Solution File: KRS072+1 by CSE_E---1.5

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : KRS072+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s

% Computer : n025.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 : Thu Aug 31 05:40:08 EDT 2023

% Result   : Unsatisfiable 0.20s 0.58s
% Output   : CNFRefutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   21
% Syntax   : Number of formulae    :   39 (   4 unt;  17 typ;   0 def)
%            Number of atoms       :   88 (   6 equ)
%            Maximal formula atoms :   30 (   4 avg)
%            Number of connectives :  116 (  50   ~;  46   |;  16   &)
%                                         (   2 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   20 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   20 (  16   >;   4   *;   0   +;   0  <<)
%            Number of predicates  :   14 (  12 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   1 con; 0-2 aty)
%            Number of variables   :   34 (   1 sgn;  15   !;   2   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
tff(decl_22,type,
    cUnsatisfiable: $i > $o ).

tff(decl_23,type,
    cowlNothing: $i > $o ).

tff(decl_24,type,
    cowlThing: $i > $o ).

tff(decl_25,type,
    cp1: $i > $o ).

tff(decl_26,type,
    cp2: $i > $o ).

tff(decl_27,type,
    cp3: $i > $o ).

tff(decl_28,type,
    cp4: $i > $o ).

tff(decl_29,type,
    cp5: $i > $o ).

tff(decl_30,type,
    rinvR: ( $i * $i ) > $o ).

tff(decl_31,type,
    rr: ( $i * $i ) > $o ).

tff(decl_32,type,
    xsd_integer: $i > $o ).

tff(decl_33,type,
    xsd_string: $i > $o ).

tff(decl_34,type,
    i2003_11_14_17_18_50190: $i ).

tff(decl_35,type,
    esk1_1: $i > $i ).

tff(decl_36,type,
    esk2_1: $i > $i ).

tff(decl_37,type,
    esk3_2: ( $i * $i ) > $i ).

tff(decl_38,type,
    esk4_2: ( $i * $i ) > $i ).

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

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

fof(axiom_3,axiom,
    ! [X4] :
      ( cp1(X4)
     => ~ ( cp3(X4)
          | cp2(X4)
          | cp4(X4)
          | cp5(X4) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_3) ).

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

fof(c_0_4,plain,
    ! [X57,X58] :
      ( ( ~ rinvR(X57,X58)
        | rr(X58,X57) )
      & ( ~ rr(X58,X57)
        | rinvR(X57,X58) ) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_7])]) ).

fof(c_0_5,plain,
    ! [X43,X45,X46,X48,X49,X52] :
      ( ( rinvR(X43,esk1_1(X43))
        | ~ cUnsatisfiable(X43) )
      & ( ~ rr(esk1_1(X43),X45)
        | ~ rr(esk1_1(X43),X46)
        | X45 = X46
        | ~ cUnsatisfiable(X43) )
      & ( rr(esk1_1(X43),esk2_1(X43))
        | ~ cUnsatisfiable(X43) )
      & ( cp1(esk2_1(X43))
        | ~ cUnsatisfiable(X43) )
      & ( cp2(X43)
        | ~ cUnsatisfiable(X43) )
      & ( rr(X49,esk3_2(X48,X49))
        | ~ rinvR(X48,X49)
        | ~ rr(X49,X52)
        | ~ cp1(X52)
        | ~ cp2(X48)
        | cUnsatisfiable(X48) )
      & ( rr(X49,esk4_2(X48,X49))
        | ~ rinvR(X48,X49)
        | ~ rr(X49,X52)
        | ~ cp1(X52)
        | ~ cp2(X48)
        | cUnsatisfiable(X48) )
      & ( esk3_2(X48,X49) != esk4_2(X48,X49)
        | ~ rinvR(X48,X49)
        | ~ rr(X49,X52)
        | ~ cp1(X52)
        | ~ cp2(X48)
        | cUnsatisfiable(X48) ) ),
    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_6,plain,
    ! [X53] :
      ( ( ~ cp3(X53)
        | ~ cp1(X53) )
      & ( ~ cp2(X53)
        | ~ cp1(X53) )
      & ( ~ cp4(X53)
        | ~ cp1(X53) )
      & ( ~ cp5(X53)
        | ~ cp1(X53) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_3])])]) ).

cnf(c_0_7,plain,
    ( rr(X2,X1)
    | ~ rinvR(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

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

cnf(c_0_9,plain,
    ( ~ cp2(X1)
    | ~ cp1(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

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

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

cnf(c_0_12,plain,
    ( rr(esk1_1(X1),X1)
    | ~ cUnsatisfiable(X1) ),
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_13,plain,
    ( ~ cp2(esk2_1(X1))
    | ~ cUnsatisfiable(X1) ),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

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

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

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

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

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

cnf(c_0_19,plain,
    cUnsatisfiable(i2003_11_14_17_18_50190),
    inference(split_conjunct,[status(thm)],[axiom_8]) ).

cnf(c_0_20,plain,
    ~ cUnsatisfiable(X1),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : KRS072+1 : TPTP v8.1.2. Released v3.1.0.
% 0.00/0.13  % Command    : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.14/0.34  % Computer : n025.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 Aug 28 02:40:09 EDT 2023
% 0.14/0.34  % CPUTime  : 
% 0.20/0.56  start to proof: theBenchmark
% 0.20/0.58  % Version  : CSE_E---1.5
% 0.20/0.58  % Problem  : theBenchmark.p
% 0.20/0.58  % Proof found
% 0.20/0.58  % SZS status Theorem for theBenchmark.p
% 0.20/0.58  % SZS output start Proof
% See solution above
% 0.20/0.58  % Total time : 0.007000 s
% 0.20/0.58  % SZS output end Proof
% 0.20/0.58  % Total time : 0.010000 s
%------------------------------------------------------------------------------