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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : KRS092+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 : n017.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:13 EDT 2023

% Result   : Unsatisfiable 0.22s 0.61s
% Output   : CNFRefutation 0.22s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :   18
% Syntax   : Number of formulae    :   30 (   4 unt;  15 typ;   0 def)
%            Number of atoms       :   49 (   0 equ)
%            Maximal formula atoms :   19 (   3 avg)
%            Number of connectives :   60 (  26   ~;  22   |;   8   &)
%                                         (   1 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   15 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   15 (  14   >;   1   *;   0   +;   0  <<)
%            Number of predicates  :   13 (  12 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   1 con; 0-1 aty)
%            Number of variables   :   19 (   1 sgn;   9   !;   1   ?;   0   :)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

fof(c_0_3,plain,
    ! [X1] :
      ( cc(X1)
     => ~ cd(X1) ),
    inference(fof_simplification,[status(thm)],[axiom_3]) ).

fof(c_0_4,plain,
    ! [X5,X7,X8,X9] :
      ( ( rr(X5,esk1_1(X5))
        | ~ cUnsatisfiable(X5) )
      & ( cowlThing(esk1_1(X5))
        | ~ cUnsatisfiable(X5) )
      & ( cd(X7)
        | ~ rr(X5,X7)
        | ~ cUnsatisfiable(X5) )
      & ( cc(X7)
        | ~ rr(X5,X7)
        | ~ cUnsatisfiable(X5) )
      & ( rr(X8,esk2_1(X8))
        | ~ rr(X8,X9)
        | ~ cowlThing(X9)
        | cUnsatisfiable(X8) )
      & ( ~ cd(esk2_1(X8))
        | ~ cc(esk2_1(X8))
        | ~ rr(X8,X9)
        | ~ cowlThing(X9)
        | cUnsatisfiable(X8) ) ),
    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_5,plain,
    ! [X11] :
      ( ~ cc(X11)
      | ~ cd(X11) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])]) ).

cnf(c_0_6,plain,
    ( cc(X1)
    | ~ rr(X2,X1)
    | ~ cUnsatisfiable(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

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

cnf(c_0_8,plain,
    ( cd(X1)
    | ~ rr(X2,X1)
    | ~ cUnsatisfiable(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

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

cnf(c_0_10,plain,
    ( cc(esk1_1(X1))
    | ~ cUnsatisfiable(X1) ),
    inference(spm,[status(thm)],[c_0_6,c_0_7]) ).

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

cnf(c_0_12,plain,
    cUnsatisfiable(i2003_11_14_17_20_04172),
    inference(split_conjunct,[status(thm)],[axiom_8]) ).

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem    : KRS092+1 : TPTP v8.1.2. Released v3.1.0.
% 0.07/0.14  % Command    : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.13/0.36  % Computer : n017.cluster.edu
% 0.13/0.36  % Model    : x86_64 x86_64
% 0.13/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.36  % Memory   : 8042.1875MB
% 0.13/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.36  % CPULimit   : 300
% 0.13/0.36  % WCLimit    : 300
% 0.13/0.36  % DateTime   : Mon Aug 28 01:10:12 EDT 2023
% 0.13/0.36  % CPUTime  : 
% 0.22/0.59  start to proof: theBenchmark
% 0.22/0.61  % Version  : CSE_E---1.5
% 0.22/0.61  % Problem  : theBenchmark.p
% 0.22/0.61  % Proof found
% 0.22/0.61  % SZS status Theorem for theBenchmark.p
% 0.22/0.61  % SZS output start Proof
% See solution above
% 0.22/0.61  % Total time : 0.005000 s
% 0.22/0.61  % SZS output end Proof
% 0.22/0.61  % Total time : 0.008000 s
%------------------------------------------------------------------------------