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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : KRS097+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 : n027.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:14 EDT 2023

% Result   : Unsatisfiable 0.20s 0.59s
% Output   : CNFRefutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   26
% Syntax   : Number of formulae    :   40 (   4 unt;  23 typ;   0 def)
%            Number of atoms       :   73 (   6 equ)
%            Maximal formula atoms :   35 (   4 avg)
%            Number of connectives :  100 (  44   ~;  39   |;  16   &)
%                                         (   1 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   23 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   30 (  22   >;   8   *;   0   +;   0  <<)
%            Number of predicates  :   19 (  17 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   1 con; 0-1 aty)
%            Number of variables   :   28 (   1 sgn;  10   !;   5   ?;   0   :)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

tff(decl_36,type,
    rtt: ( $i * $i ) > $o ).

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

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

tff(decl_39,type,
    i2003_11_14_17_20_21603: $i ).

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

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

tff(decl_42,type,
    esk3_1: $i > $i ).

tff(decl_43,type,
    esk4_1: $i > $i ).

tff(decl_44,type,
    esk5_1: $i > $i ).

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

fof(axiom_6,axiom,
    ! [X4] :
      ~ ( cd(X4)
        & cc(X4) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_6) ).

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

fof(c_0_3,plain,
    ! [X76,X79,X80,X82,X83,X84,X87] :
      ( ( rr(X76,esk1_1(X76))
        | ~ cUnsatisfiable(X76) )
      & ( rr(X76,esk2_1(X76))
        | ~ cUnsatisfiable(X76) )
      & ( cd(esk2_1(X76))
        | ~ cUnsatisfiable(X76) )
      & ( ~ rr(X76,X79)
        | ~ rr(X76,X80)
        | X79 = X80
        | ~ cUnsatisfiable(X76) )
      & ( rr(X76,esk3_1(X76))
        | ~ cUnsatisfiable(X76) )
      & ( cc(esk3_1(X76))
        | ~ cUnsatisfiable(X76) )
      & ( rr(X82,esk4_1(X82))
        | ~ rr(X82,X83)
        | ~ rr(X82,X84)
        | ~ cd(X84)
        | ~ rr(X82,X87)
        | ~ cc(X87)
        | cUnsatisfiable(X82) )
      & ( rr(X82,esk5_1(X82))
        | ~ rr(X82,X83)
        | ~ rr(X82,X84)
        | ~ cd(X84)
        | ~ rr(X82,X87)
        | ~ cc(X87)
        | cUnsatisfiable(X82) )
      & ( esk4_1(X82) != esk5_1(X82)
        | ~ rr(X82,X83)
        | ~ rr(X82,X84)
        | ~ cd(X84)
        | ~ rr(X82,X87)
        | ~ cc(X87)
        | cUnsatisfiable(X82) ) ),
    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_4,plain,
    ! [X90] :
      ( ~ cd(X90)
      | ~ cc(X90) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_6])]) ).

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

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

cnf(c_0_7,plain,
    ( ~ cd(X1)
    | ~ cc(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

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

cnf(c_0_9,plain,
    ( X1 = esk3_1(X2)
    | ~ rr(X2,X1)
    | ~ cUnsatisfiable(X2) ),
    inference(spm,[status(thm)],[c_0_5,c_0_6]) ).

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

cnf(c_0_11,plain,
    ( ~ cc(esk2_1(X1))
    | ~ cUnsatisfiable(X1) ),
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_12,plain,
    ( esk2_1(X1) = esk3_1(X1)
    | ~ cUnsatisfiable(X1) ),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_13,plain,
    ( cc(esk3_1(X1))
    | ~ cUnsatisfiable(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_14,plain,
    cUnsatisfiable(i2003_11_14_17_20_21603),
    inference(split_conjunct,[status(thm)],[axiom_4]) ).

cnf(c_0_15,plain,
    ~ cUnsatisfiable(X1),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]) ).

cnf(c_0_16,plain,
    $false,
    inference(sr,[status(thm)],[c_0_14,c_0_15]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : KRS097+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.12/0.34  % Computer : n027.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit   : 300
% 0.12/0.34  % WCLimit    : 300
% 0.12/0.34  % DateTime   : Mon Aug 28 02:53:51 EDT 2023
% 0.12/0.35  % CPUTime  : 
% 0.20/0.57  start to proof: theBenchmark
% 0.20/0.59  % Version  : CSE_E---1.5
% 0.20/0.59  % Problem  : theBenchmark.p
% 0.20/0.59  % Proof found
% 0.20/0.59  % SZS status Theorem for theBenchmark.p
% 0.20/0.59  % SZS output start Proof
% See solution above
% 0.20/0.60  % Total time : 0.009000 s
% 0.20/0.60  % SZS output end Proof
% 0.20/0.60  % Total time : 0.012000 s
%------------------------------------------------------------------------------