TSTP Solution File: KRS085+1 by Vampire-SAT---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire-SAT---4.8
% Problem  : KRS085+1 : TPTP v8.2.0. Released v3.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s

% Computer : n007.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 : Mon May 20 23:21:55 EDT 2024

% Result   : Unsatisfiable 0.25s 0.42s
% Output   : Refutation 0.25s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   41 (   4 unt;   0 def)
%            Number of atoms       :  164 (   0 equ)
%            Maximal formula atoms :   12 (   4 avg)
%            Number of connectives :  195 (  72   ~;  59   |;  50   &)
%                                         (   7 <=>;   7  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   6 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    6 (   5 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   1 con; 0-1 aty)
%            Number of variables   :   93 (  74   !;  19   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f162,plain,
    $false,
    inference(resolution,[],[f161,f76]) ).

fof(f76,plain,
    cUnsatisfiable(i2003_11_14_17_19_39537),
    inference(cnf_transformation,[],[f22]) ).

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

fof(f161,plain,
    ! [X0] : ~ cUnsatisfiable(X0),
    inference(subsumption_resolution,[],[f160,f89]) ).

fof(f89,plain,
    ! [X0] :
      ( cp1(X0)
      | ~ cUnsatisfiable(X0) ),
    inference(cnf_transformation,[],[f73]) ).

fof(f73,plain,
    ! [X0] :
      ( ( cUnsatisfiable(X0)
        | ~ cp1(X0)
        | ~ sP0(X0) )
      & ( ( cp1(X0)
          & sP0(X0) )
        | ~ cUnsatisfiable(X0) ) ),
    inference(flattening,[],[f72]) ).

fof(f72,plain,
    ! [X0] :
      ( ( cUnsatisfiable(X0)
        | ~ cp1(X0)
        | ~ sP0(X0) )
      & ( ( cp1(X0)
          & sP0(X0) )
        | ~ cUnsatisfiable(X0) ) ),
    inference(nnf_transformation,[],[f64]) ).

fof(f64,plain,
    ! [X0] :
      ( cUnsatisfiable(X0)
    <=> ( cp1(X0)
        & sP0(X0) ) ),
    inference(definition_folding,[],[f32,f63]) ).

fof(f63,plain,
    ! [X0] :
      ( sP0(X0)
    <=> ? [X1] :
          ( ? [X2] :
              ( ! [X3] :
                  ( ~ cp1(X3)
                  | ~ rinvR(X2,X3) )
              & cp1(X2)
              & rr(X1,X2) )
          & rr(X0,X1) ) ),
    introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).

fof(f32,plain,
    ! [X0] :
      ( cUnsatisfiable(X0)
    <=> ( cp1(X0)
        & ? [X1] :
            ( ? [X2] :
                ( ! [X3] :
                    ( ~ cp1(X3)
                    | ~ rinvR(X2,X3) )
                & cp1(X2)
                & rr(X1,X2) )
            & rr(X0,X1) ) ) ),
    inference(ennf_transformation,[],[f26]) ).

fof(f26,plain,
    ! [X0] :
      ( cUnsatisfiable(X0)
    <=> ( cp1(X0)
        & ? [X1] :
            ( ? [X2] :
                ( ! [X3] :
                    ( rinvR(X2,X3)
                   => ~ cp1(X3) )
                & cp1(X2)
                & rr(X1,X2) )
            & rr(X0,X1) ) ) ),
    inference(rectify,[],[f17]) ).

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

fof(f160,plain,
    ! [X0] :
      ( ~ cp1(X0)
      | ~ cUnsatisfiable(X0) ),
    inference(resolution,[],[f159,f88]) ).

fof(f88,plain,
    ! [X0] :
      ( sP0(X0)
      | ~ cUnsatisfiable(X0) ),
    inference(cnf_transformation,[],[f73]) ).

fof(f159,plain,
    ! [X0] :
      ( ~ sP0(X0)
      | ~ cp1(X0) ),
    inference(duplicate_literal_removal,[],[f157]) ).

fof(f157,plain,
    ! [X0] :
      ( ~ sP0(X0)
      | ~ cp1(X0)
      | ~ sP0(X0) ),
    inference(resolution,[],[f155,f85]) ).

fof(f85,plain,
    ! [X0,X6] :
      ( ~ rinvR(sK3(X0),X6)
      | ~ cp1(X6)
      | ~ sP0(X0) ),
    inference(cnf_transformation,[],[f71]) ).

fof(f71,plain,
    ! [X0] :
      ( ( sP0(X0)
        | ! [X1] :
            ( ! [X2] :
                ( ( cp1(sK1(X2))
                  & rinvR(X2,sK1(X2)) )
                | ~ cp1(X2)
                | ~ rr(X1,X2) )
            | ~ rr(X0,X1) ) )
      & ( ( ! [X6] :
              ( ~ cp1(X6)
              | ~ rinvR(sK3(X0),X6) )
          & cp1(sK3(X0))
          & rr(sK2(X0),sK3(X0))
          & rr(X0,sK2(X0)) )
        | ~ sP0(X0) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2,sK3])],[f67,f70,f69,f68]) ).

fof(f68,plain,
    ! [X2] :
      ( ? [X3] :
          ( cp1(X3)
          & rinvR(X2,X3) )
     => ( cp1(sK1(X2))
        & rinvR(X2,sK1(X2)) ) ),
    introduced(choice_axiom,[]) ).

fof(f69,plain,
    ! [X0] :
      ( ? [X4] :
          ( ? [X5] :
              ( ! [X6] :
                  ( ~ cp1(X6)
                  | ~ rinvR(X5,X6) )
              & cp1(X5)
              & rr(X4,X5) )
          & rr(X0,X4) )
     => ( ? [X5] :
            ( ! [X6] :
                ( ~ cp1(X6)
                | ~ rinvR(X5,X6) )
            & cp1(X5)
            & rr(sK2(X0),X5) )
        & rr(X0,sK2(X0)) ) ),
    introduced(choice_axiom,[]) ).

fof(f70,plain,
    ! [X0] :
      ( ? [X5] :
          ( ! [X6] :
              ( ~ cp1(X6)
              | ~ rinvR(X5,X6) )
          & cp1(X5)
          & rr(sK2(X0),X5) )
     => ( ! [X6] :
            ( ~ cp1(X6)
            | ~ rinvR(sK3(X0),X6) )
        & cp1(sK3(X0))
        & rr(sK2(X0),sK3(X0)) ) ),
    introduced(choice_axiom,[]) ).

fof(f67,plain,
    ! [X0] :
      ( ( sP0(X0)
        | ! [X1] :
            ( ! [X2] :
                ( ? [X3] :
                    ( cp1(X3)
                    & rinvR(X2,X3) )
                | ~ cp1(X2)
                | ~ rr(X1,X2) )
            | ~ rr(X0,X1) ) )
      & ( ? [X4] :
            ( ? [X5] :
                ( ! [X6] :
                    ( ~ cp1(X6)
                    | ~ rinvR(X5,X6) )
                & cp1(X5)
                & rr(X4,X5) )
            & rr(X0,X4) )
        | ~ sP0(X0) ) ),
    inference(rectify,[],[f66]) ).

fof(f66,plain,
    ! [X0] :
      ( ( sP0(X0)
        | ! [X1] :
            ( ! [X2] :
                ( ? [X3] :
                    ( cp1(X3)
                    & rinvR(X2,X3) )
                | ~ cp1(X2)
                | ~ rr(X1,X2) )
            | ~ rr(X0,X1) ) )
      & ( ? [X1] :
            ( ? [X2] :
                ( ! [X3] :
                    ( ~ cp1(X3)
                    | ~ rinvR(X2,X3) )
                & cp1(X2)
                & rr(X1,X2) )
            & rr(X0,X1) )
        | ~ sP0(X0) ) ),
    inference(nnf_transformation,[],[f63]) ).

fof(f155,plain,
    ! [X0] :
      ( rinvR(sK3(X0),X0)
      | ~ sP0(X0) ),
    inference(resolution,[],[f146,f100]) ).

fof(f100,plain,
    ! [X0,X1] :
      ( ~ rr(X1,X0)
      | rinvR(X0,X1) ),
    inference(cnf_transformation,[],[f75]) ).

fof(f75,plain,
    ! [X0,X1] :
      ( ( rinvR(X0,X1)
        | ~ rr(X1,X0) )
      & ( rr(X1,X0)
        | ~ rinvR(X0,X1) ) ),
    inference(nnf_transformation,[],[f28]) ).

fof(f28,plain,
    ! [X0,X1] :
      ( rinvR(X0,X1)
    <=> rr(X1,X0) ),
    inference(rectify,[],[f20]) ).

fof(f20,axiom,
    ! [X3,X4] :
      ( rinvR(X3,X4)
    <=> rr(X4,X3) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_5) ).

fof(f146,plain,
    ! [X0] :
      ( rr(X0,sK3(X0))
      | ~ sP0(X0) ),
    inference(duplicate_literal_removal,[],[f145]) ).

fof(f145,plain,
    ! [X0] :
      ( rr(X0,sK3(X0))
      | ~ sP0(X0)
      | ~ sP0(X0) ),
    inference(resolution,[],[f139,f130]) ).

fof(f130,plain,
    ! [X0] :
      ( rinvR(sK3(X0),sK2(X0))
      | ~ sP0(X0) ),
    inference(resolution,[],[f83,f100]) ).

fof(f83,plain,
    ! [X0] :
      ( rr(sK2(X0),sK3(X0))
      | ~ sP0(X0) ),
    inference(cnf_transformation,[],[f71]) ).

fof(f139,plain,
    ! [X0,X1] :
      ( ~ rinvR(X1,sK2(X0))
      | rr(X0,X1)
      | ~ sP0(X0) ),
    inference(resolution,[],[f135,f82]) ).

fof(f82,plain,
    ! [X0] :
      ( rr(X0,sK2(X0))
      | ~ sP0(X0) ),
    inference(cnf_transformation,[],[f71]) ).

fof(f135,plain,
    ! [X2,X0,X1] :
      ( ~ rr(X0,X2)
      | rr(X0,X1)
      | ~ rinvR(X1,X2) ),
    inference(resolution,[],[f109,f99]) ).

fof(f99,plain,
    ! [X0,X1] :
      ( rr(X1,X0)
      | ~ rinvR(X0,X1) ),
    inference(cnf_transformation,[],[f75]) ).

fof(f109,plain,
    ! [X2,X0,X1] :
      ( ~ rr(X1,X2)
      | rr(X0,X2)
      | ~ rr(X0,X1) ),
    inference(cnf_transformation,[],[f62]) ).

fof(f62,plain,
    ! [X0,X1,X2] :
      ( rr(X0,X2)
      | ~ rr(X1,X2)
      | ~ rr(X0,X1) ),
    inference(flattening,[],[f61]) ).

fof(f61,plain,
    ! [X0,X1,X2] :
      ( rr(X0,X2)
      | ~ rr(X1,X2)
      | ~ rr(X0,X1) ),
    inference(ennf_transformation,[],[f29]) ).

fof(f29,plain,
    ! [X0,X1,X2] :
      ( ( rr(X1,X2)
        & rr(X0,X1) )
     => rr(X0,X2) ),
    inference(rectify,[],[f21]) ).

fof(f21,axiom,
    ! [X3,X4,X5] :
      ( ( rr(X4,X5)
        & rr(X3,X4) )
     => rr(X3,X5) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_6) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.15  % Problem    : KRS085+1 : TPTP v8.2.0. Released v3.1.0.
% 0.09/0.17  % Command    : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.16/0.38  % Computer : n007.cluster.edu
% 0.16/0.38  % Model    : x86_64 x86_64
% 0.16/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.38  % Memory   : 8042.1875MB
% 0.16/0.38  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.39  % CPULimit   : 300
% 0.16/0.39  % WCLimit    : 300
% 0.16/0.39  % DateTime   : Sat May 18 22:05:38 EDT 2024
% 0.16/0.39  % CPUTime    : 
% 0.16/0.39  % (29779)Running in auto input_syntax mode. Trying TPTP
% 0.25/0.41  % (29782)WARNING: value z3 for option sas not known
% 0.25/0.41  % (29780)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.25/0.41  % (29782)dis+2_11_add=large:afr=on:amm=off:bd=off:bce=on:fsd=off:fde=none:gs=on:gsaa=full_model:gsem=off:irw=on:msp=off:nm=4:nwc=1.3:sas=z3:sims=off:sac=on:sp=reverse_arity_569 on theBenchmark for (569ds/0Mi)
% 0.25/0.41  % (29784)ott+10_10:1_add=off:afr=on:amm=off:anc=all:bd=off:bs=on:fsr=off:irw=on:lma=on:msp=off:nm=4:nwc=4.0:sac=on:sp=reverse_frequency_531 on theBenchmark for (531ds/0Mi)
% 0.25/0.41  % (29781)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.25/0.41  TRYING [1]
% 0.25/0.41  TRYING [2]
% 0.25/0.41  TRYING [3]
% 0.25/0.41  TRYING [4]
% 0.25/0.41  TRYING [1]
% 0.25/0.41  TRYING [2]
% 0.25/0.41  TRYING [3]
% 0.25/0.41  TRYING [5]
% 0.25/0.41  % (29782)First to succeed.
% 0.25/0.41  % (29783)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.25/0.41  TRYING [4]
% 0.25/0.41  % (29782)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-29779"
% 0.25/0.42  TRYING [6]
% 0.25/0.42  TRYING [1]
% 0.25/0.42  % (29782)Refutation found. Thanks to Tanya!
% 0.25/0.42  % SZS status Unsatisfiable for theBenchmark
% 0.25/0.42  % SZS output start Proof for theBenchmark
% See solution above
% 0.25/0.42  % (29782)------------------------------
% 0.25/0.42  % (29782)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.25/0.42  % (29782)Termination reason: Refutation
% 0.25/0.42  
% 0.25/0.42  % (29782)Memory used [KB]: 845
% 0.25/0.42  % (29782)Time elapsed: 0.009 s
% 0.25/0.42  % (29782)Instructions burned: 7 (million)
% 0.25/0.42  % (29779)Success in time 0.004 s
%------------------------------------------------------------------------------