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

View Problem - Process Solution

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

% Computer : n001.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:11 EDT 2023

% Result   : Unsatisfiable 0.19s 0.59s
% Output   : CNFRefutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   18
% Syntax   : Number of formulae    :   37 (   4 unt;  14 typ;   0 def)
%            Number of atoms       :   80 (   5 equ)
%            Maximal formula atoms :   19 (   3 avg)
%            Number of connectives :  100 (  43   ~;  38   |;  13   &)
%                                         (   3 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   16 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   19 (  13   >;   6   *;   0   +;   0  <<)
%            Number of predicates  :   12 (  10 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   1 con; 0-2 aty)
%            Number of variables   :   47 (   1 sgn;  19   !;   4   ?;   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,
    rf: ( $i * $i ) > $o ).

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

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

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

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

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

tff(decl_32,type,
    i2003_11_14_17_19_49673: $i ).

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

tff(decl_34,type,
    esk2_2: ( $i * $i ) > $i ).

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

fof(axiom_2,axiom,
    ! [X4] :
      ( cUnsatisfiable(X4)
    <=> ? [X5] :
          ( rf(X4,X5)
          & ! [X6] :
              ( rinvF(X5,X6)
             => ? [X7] :
                  ( rf(X6,X7)
                  & ~ cp1(X7) ) )
          & cp1(X5) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).

fof(axiom_3,axiom,
    ! [X4,X5,X6] :
      ( ( rf(X4,X5)
        & rf(X4,X6) )
     => X5 = X6 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_3) ).

fof(axiom_4,axiom,
    ! [X4,X5] :
      ( rinvF(X4,X5)
    <=> rf(X5,X4) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_4) ).

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

fof(c_0_4,plain,
    ! [X4] :
      ( cUnsatisfiable(X4)
    <=> ? [X5] :
          ( rf(X4,X5)
          & ! [X6] :
              ( rinvF(X5,X6)
             => ? [X7] :
                  ( rf(X6,X7)
                  & ~ cp1(X7) ) )
          & cp1(X5) ) ),
    inference(fof_simplification,[status(thm)],[axiom_2]) ).

fof(c_0_5,plain,
    ! [X54,X55,X56] :
      ( ~ rf(X54,X55)
      | ~ rf(X54,X56)
      | X55 = X56 ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_3])]) ).

fof(c_0_6,plain,
    ! [X46,X48,X50,X51,X53] :
      ( ( rf(X46,esk1_1(X46))
        | ~ cUnsatisfiable(X46) )
      & ( rf(X48,esk2_2(X46,X48))
        | ~ rinvF(esk1_1(X46),X48)
        | ~ cUnsatisfiable(X46) )
      & ( ~ cp1(esk2_2(X46,X48))
        | ~ rinvF(esk1_1(X46),X48)
        | ~ cUnsatisfiable(X46) )
      & ( cp1(esk1_1(X46))
        | ~ cUnsatisfiable(X46) )
      & ( rinvF(X51,esk3_2(X50,X51))
        | ~ rf(X50,X51)
        | ~ cp1(X51)
        | cUnsatisfiable(X50) )
      & ( ~ rf(esk3_2(X50,X51),X53)
        | cp1(X53)
        | ~ rf(X50,X51)
        | ~ cp1(X51)
        | cUnsatisfiable(X50) ) ),
    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_4])])])])])]) ).

fof(c_0_7,plain,
    ! [X57,X58] :
      ( ( ~ rinvF(X57,X58)
        | rf(X58,X57) )
      & ( ~ rf(X58,X57)
        | rinvF(X57,X58) ) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_4])]) ).

cnf(c_0_8,plain,
    ( X2 = X3
    | ~ rf(X1,X2)
    | ~ rf(X1,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

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

cnf(c_0_10,plain,
    ( rf(X1,esk2_2(X2,X1))
    | ~ rinvF(esk1_1(X2),X1)
    | ~ cUnsatisfiable(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_11,plain,
    ( rinvF(X2,X1)
    | ~ rf(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_12,plain,
    ( X1 = esk1_1(X2)
    | ~ rf(X2,X1)
    | ~ cUnsatisfiable(X2) ),
    inference(spm,[status(thm)],[c_0_8,c_0_9]) ).

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

cnf(c_0_14,plain,
    ( ~ cp1(esk2_2(X1,X2))
    | ~ rinvF(esk1_1(X1),X2)
    | ~ cUnsatisfiable(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

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

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

cnf(c_0_17,plain,
    ( rf(X2,X1)
    | ~ rinvF(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_18,plain,
    ( ~ rinvF(esk1_1(X1),X2)
    | ~ cUnsatisfiable(X1)
    | ~ cUnsatisfiable(X2) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]),c_0_17]) ).

cnf(c_0_19,plain,
    ( ~ rf(X1,esk1_1(X2))
    | ~ cUnsatisfiable(X2)
    | ~ cUnsatisfiable(X1) ),
    inference(spm,[status(thm)],[c_0_18,c_0_11]) ).

cnf(c_0_20,plain,
    cUnsatisfiable(i2003_11_14_17_19_49673),
    inference(split_conjunct,[status(thm)],[axiom_7]) ).

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : KRS088+1 : TPTP v8.1.2. Released v3.1.0.
% 0.00/0.13  % Command    : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.13/0.34  % Computer : n001.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit   : 300
% 0.13/0.34  % WCLimit    : 300
% 0.13/0.34  % DateTime   : Mon Aug 28 02:56:49 EDT 2023
% 0.13/0.34  % CPUTime  : 
% 0.19/0.57  start to proof: theBenchmark
% 0.19/0.59  % Version  : CSE_E---1.5
% 0.19/0.59  % Problem  : theBenchmark.p
% 0.19/0.59  % Proof found
% 0.19/0.59  % SZS status Theorem for theBenchmark.p
% 0.19/0.59  % SZS output start Proof
% See solution above
% 0.19/0.59  % Total time : 0.009000 s
% 0.19/0.59  % SZS output end Proof
% 0.19/0.59  % Total time : 0.012000 s
%------------------------------------------------------------------------------