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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire-SAT---4.8
% Problem  : KRS072+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 : n022.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:52 EDT 2024

% Result   : Unsatisfiable 0.14s 0.31s
% Output   : Refutation 0.14s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   47 (  13 unt;   0 def)
%            Number of atoms       :  200 (  15 equ)
%            Maximal formula atoms :   12 (   4 avg)
%            Number of connectives :  231 (  78   ~;  65   |;  73   &)
%                                         (   8 <=>;   7  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :   12 (  10 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   1 con; 0-1 aty)
%            Number of variables   :   90 (  64   !;  26   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f197,plain,
    $false,
    inference(subsumption_resolution,[],[f191,f149]) ).

fof(f149,plain,
    ~ cp1(i2003_11_14_17_18_50190),
    inference(unit_resulting_resolution,[],[f148,f93]) ).

fof(f93,plain,
    ! [X0] :
      ( ~ cp1(X0)
      | sP0(X0) ),
    inference(cnf_transformation,[],[f67]) ).

fof(f67,plain,
    ! [X0] :
      ( sP0(X0)
      | ~ cp1(X0) ),
    inference(definition_folding,[],[f32,f66]) ).

fof(f66,plain,
    ! [X0] :
      ( ( ~ cp5(X0)
        & ~ cp4(X0)
        & ~ cp2(X0)
        & ~ cp3(X0) )
      | ~ sP0(X0) ),
    introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).

fof(f32,plain,
    ! [X0] :
      ( ( ~ cp5(X0)
        & ~ cp4(X0)
        & ~ cp2(X0)
        & ~ cp3(X0) )
      | ~ cp1(X0) ),
    inference(ennf_transformation,[],[f25]) ).

fof(f25,plain,
    ! [X0] :
      ( cp1(X0)
     => ~ ( cp5(X0)
          | cp4(X0)
          | cp2(X0)
          | cp3(X0) ) ),
    inference(rectify,[],[f18]) ).

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

fof(f148,plain,
    ~ sP0(i2003_11_14_17_18_50190),
    inference(unit_resulting_resolution,[],[f146,f90]) ).

fof(f90,plain,
    ! [X0] :
      ( ~ sP0(X0)
      | ~ cp2(X0) ),
    inference(cnf_transformation,[],[f72]) ).

fof(f72,plain,
    ! [X0] :
      ( ( ~ cp5(X0)
        & ~ cp4(X0)
        & ~ cp2(X0)
        & ~ cp3(X0) )
      | ~ sP0(X0) ),
    inference(nnf_transformation,[],[f66]) ).

fof(f146,plain,
    cp2(i2003_11_14_17_18_50190),
    inference(unit_resulting_resolution,[],[f86,f111]) ).

fof(f111,plain,
    ! [X0] :
      ( ~ cUnsatisfiable(X0)
      | cp2(X0) ),
    inference(cnf_transformation,[],[f84]) ).

fof(f84,plain,
    ! [X0] :
      ( ( cUnsatisfiable(X0)
        | ~ cp2(X0)
        | ! [X1] :
            ( ! [X2] :
                ( ~ cp1(X2)
                | ~ rr(X1,X2) )
            | ~ sP2(X1)
            | ~ rinvR(X0,X1) ) )
      & ( ( cp2(X0)
          & cp1(sK6(X0))
          & rr(sK5(X0),sK6(X0))
          & sP2(sK5(X0))
          & rinvR(X0,sK5(X0)) )
        | ~ cUnsatisfiable(X0) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK5,sK6])],[f81,f83,f82]) ).

fof(f82,plain,
    ! [X0] :
      ( ? [X3] :
          ( ? [X4] :
              ( cp1(X4)
              & rr(X3,X4) )
          & sP2(X3)
          & rinvR(X0,X3) )
     => ( ? [X4] :
            ( cp1(X4)
            & rr(sK5(X0),X4) )
        & sP2(sK5(X0))
        & rinvR(X0,sK5(X0)) ) ),
    introduced(choice_axiom,[]) ).

fof(f83,plain,
    ! [X0] :
      ( ? [X4] :
          ( cp1(X4)
          & rr(sK5(X0),X4) )
     => ( cp1(sK6(X0))
        & rr(sK5(X0),sK6(X0)) ) ),
    introduced(choice_axiom,[]) ).

fof(f81,plain,
    ! [X0] :
      ( ( cUnsatisfiable(X0)
        | ~ cp2(X0)
        | ! [X1] :
            ( ! [X2] :
                ( ~ cp1(X2)
                | ~ rr(X1,X2) )
            | ~ sP2(X1)
            | ~ rinvR(X0,X1) ) )
      & ( ( cp2(X0)
          & ? [X3] :
              ( ? [X4] :
                  ( cp1(X4)
                  & rr(X3,X4) )
              & sP2(X3)
              & rinvR(X0,X3) ) )
        | ~ cUnsatisfiable(X0) ) ),
    inference(rectify,[],[f80]) ).

fof(f80,plain,
    ! [X0] :
      ( ( cUnsatisfiable(X0)
        | ~ cp2(X0)
        | ! [X1] :
            ( ! [X2] :
                ( ~ cp1(X2)
                | ~ rr(X1,X2) )
            | ~ sP2(X1)
            | ~ rinvR(X0,X1) ) )
      & ( ( cp2(X0)
          & ? [X1] :
              ( ? [X2] :
                  ( cp1(X2)
                  & rr(X1,X2) )
              & sP2(X1)
              & rinvR(X0,X1) ) )
        | ~ cUnsatisfiable(X0) ) ),
    inference(flattening,[],[f79]) ).

fof(f79,plain,
    ! [X0] :
      ( ( cUnsatisfiable(X0)
        | ~ cp2(X0)
        | ! [X1] :
            ( ! [X2] :
                ( ~ cp1(X2)
                | ~ rr(X1,X2) )
            | ~ sP2(X1)
            | ~ rinvR(X0,X1) ) )
      & ( ( cp2(X0)
          & ? [X1] :
              ( ? [X2] :
                  ( cp1(X2)
                  & rr(X1,X2) )
              & sP2(X1)
              & rinvR(X0,X1) ) )
        | ~ cUnsatisfiable(X0) ) ),
    inference(nnf_transformation,[],[f71]) ).

fof(f71,plain,
    ! [X0] :
      ( cUnsatisfiable(X0)
    <=> ( cp2(X0)
        & ? [X1] :
            ( ? [X2] :
                ( cp1(X2)
                & rr(X1,X2) )
            & sP2(X1)
            & rinvR(X0,X1) ) ) ),
    inference(definition_folding,[],[f37,f70]) ).

fof(f70,plain,
    ! [X1] :
      ( sP2(X1)
    <=> ! [X3,X4] :
          ( X3 = X4
          | ~ rr(X1,X4)
          | ~ rr(X1,X3) ) ),
    introduced(predicate_definition_introduction,[new_symbols(naming,[sP2])]) ).

fof(f37,plain,
    ! [X0] :
      ( cUnsatisfiable(X0)
    <=> ( cp2(X0)
        & ? [X1] :
            ( ? [X2] :
                ( cp1(X2)
                & rr(X1,X2) )
            & ! [X3,X4] :
                ( X3 = X4
                | ~ rr(X1,X4)
                | ~ rr(X1,X3) )
            & rinvR(X0,X1) ) ) ),
    inference(flattening,[],[f36]) ).

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

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

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

fof(f86,plain,
    cUnsatisfiable(i2003_11_14_17_18_50190),
    inference(cnf_transformation,[],[f23]) ).

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

fof(f191,plain,
    cp1(i2003_11_14_17_18_50190),
    inference(superposition,[],[f152,f182]) ).

fof(f182,plain,
    i2003_11_14_17_18_50190 = sK6(i2003_11_14_17_18_50190),
    inference(unit_resulting_resolution,[],[f150,f161,f169,f103]) ).

fof(f103,plain,
    ! [X3,X0,X4] :
      ( ~ rr(X0,X4)
      | X3 = X4
      | ~ rr(X0,X3)
      | ~ sP2(X0) ),
    inference(cnf_transformation,[],[f78]) ).

fof(f78,plain,
    ! [X0] :
      ( ( sP2(X0)
        | ( sK3(X0) != sK4(X0)
          & rr(X0,sK4(X0))
          & rr(X0,sK3(X0)) ) )
      & ( ! [X3,X4] :
            ( X3 = X4
            | ~ rr(X0,X4)
            | ~ rr(X0,X3) )
        | ~ sP2(X0) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4])],[f76,f77]) ).

fof(f77,plain,
    ! [X0] :
      ( ? [X1,X2] :
          ( X1 != X2
          & rr(X0,X2)
          & rr(X0,X1) )
     => ( sK3(X0) != sK4(X0)
        & rr(X0,sK4(X0))
        & rr(X0,sK3(X0)) ) ),
    introduced(choice_axiom,[]) ).

fof(f76,plain,
    ! [X0] :
      ( ( sP2(X0)
        | ? [X1,X2] :
            ( X1 != X2
            & rr(X0,X2)
            & rr(X0,X1) ) )
      & ( ! [X3,X4] :
            ( X3 = X4
            | ~ rr(X0,X4)
            | ~ rr(X0,X3) )
        | ~ sP2(X0) ) ),
    inference(rectify,[],[f75]) ).

fof(f75,plain,
    ! [X1] :
      ( ( sP2(X1)
        | ? [X3,X4] :
            ( X3 != X4
            & rr(X1,X4)
            & rr(X1,X3) ) )
      & ( ! [X3,X4] :
            ( X3 = X4
            | ~ rr(X1,X4)
            | ~ rr(X1,X3) )
        | ~ sP2(X1) ) ),
    inference(nnf_transformation,[],[f70]) ).

fof(f169,plain,
    rr(sK5(i2003_11_14_17_18_50190),sK6(i2003_11_14_17_18_50190)),
    inference(unit_resulting_resolution,[],[f86,f109]) ).

fof(f109,plain,
    ! [X0] :
      ( ~ cUnsatisfiable(X0)
      | rr(sK5(X0),sK6(X0)) ),
    inference(cnf_transformation,[],[f84]) ).

fof(f161,plain,
    rr(sK5(i2003_11_14_17_18_50190),i2003_11_14_17_18_50190),
    inference(unit_resulting_resolution,[],[f159,f123]) ).

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

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

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

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

fof(f159,plain,
    rinvR(i2003_11_14_17_18_50190,sK5(i2003_11_14_17_18_50190)),
    inference(unit_resulting_resolution,[],[f86,f107]) ).

fof(f107,plain,
    ! [X0] :
      ( ~ cUnsatisfiable(X0)
      | rinvR(X0,sK5(X0)) ),
    inference(cnf_transformation,[],[f84]) ).

fof(f150,plain,
    sP2(sK5(i2003_11_14_17_18_50190)),
    inference(unit_resulting_resolution,[],[f86,f108]) ).

fof(f108,plain,
    ! [X0] :
      ( ~ cUnsatisfiable(X0)
      | sP2(sK5(X0)) ),
    inference(cnf_transformation,[],[f84]) ).

fof(f152,plain,
    cp1(sK6(i2003_11_14_17_18_50190)),
    inference(unit_resulting_resolution,[],[f86,f110]) ).

fof(f110,plain,
    ! [X0] :
      ( ~ cUnsatisfiable(X0)
      | cp1(sK6(X0)) ),
    inference(cnf_transformation,[],[f84]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.08  % Problem    : KRS072+1 : TPTP v8.2.0. Released v3.1.0.
% 0.00/0.10  % Command    : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.09/0.29  % Computer : n022.cluster.edu
% 0.09/0.29  % Model    : x86_64 x86_64
% 0.09/0.29  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29  % Memory   : 8042.1875MB
% 0.09/0.29  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29  % CPULimit   : 300
% 0.09/0.29  % WCLimit    : 300
% 0.09/0.29  % DateTime   : Sat May 18 22:34:07 EDT 2024
% 0.09/0.29  % CPUTime    : 
% 0.14/0.30  % (4678)Running in auto input_syntax mode. Trying TPTP
% 0.14/0.31  % (4681)WARNING: value z3 for option sas not known
% 0.14/0.31  % (4685)ott+1_64_av=off:bd=off:bce=on:fsd=off:fde=unused:gsp=on:irw=on:lcm=predicate:lma=on:nm=2:nwc=1.1:sims=off:urr=on_497 on theBenchmark for (497ds/0Mi)
% 0.14/0.31  % (4680)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.14/0.31  % (4683)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.14/0.31  % (4679)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.14/0.31  % (4681)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.14/0.31  % (4682)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.14/0.31  % (4684)ott-10_8_av=off:bd=preordered:bs=on:fsd=off:fsr=off:fde=unused:irw=on:lcm=predicate:lma=on:nm=4:nwc=1.7:sp=frequency_522 on theBenchmark for (522ds/0Mi)
% 0.14/0.31  TRYING [1]
% 0.14/0.31  TRYING [1]
% 0.14/0.31  TRYING [2]
% 0.14/0.31  TRYING [2]
% 0.14/0.31  TRYING [3]
% 0.14/0.31  TRYING [3]
% 0.14/0.31  % (4685)First to succeed.
% 0.14/0.31  % (4681)Also succeeded, but the first one will report.
% 0.14/0.31  TRYING [4]
% 0.14/0.31  % (4685)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-4678"
% 0.14/0.31  TRYING [1]
% 0.14/0.31  TRYING [2]
% 0.14/0.31  % (4684)Also succeeded, but the first one will report.
% 0.14/0.31  TRYING [4]
% 0.14/0.31  TRYING [3]
% 0.14/0.31  % (4685)Refutation found. Thanks to Tanya!
% 0.14/0.31  % SZS status Unsatisfiable for theBenchmark
% 0.14/0.31  % SZS output start Proof for theBenchmark
% See solution above
% 0.14/0.32  % (4685)------------------------------
% 0.14/0.32  % (4685)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.14/0.32  % (4685)Termination reason: Refutation
% 0.14/0.32  
% 0.14/0.32  % (4685)Memory used [KB]: 839
% 0.14/0.32  % (4685)Time elapsed: 0.004 s
% 0.14/0.32  % (4685)Instructions burned: 6 (million)
% 0.14/0.32  % (4678)Success in time 0.018 s
%------------------------------------------------------------------------------