TSTP Solution File: KRS072+1 by SnakeForV---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : KRS072+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %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 : Wed Aug 31 17:29:36 EDT 2022

% Result   : Unsatisfiable 0.20s 0.51s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   16
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   42 (   9 unt;   0 def)
%            Number of atoms       :  185 (  20 equ)
%            Maximal formula atoms :   16 (   4 avg)
%            Number of connectives :  217 (  74   ~;  67   |;  62   &)
%                                         (   7 <=>;   7  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :   11 (   9 usr;   2 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   1 con; 0-1 aty)
%            Number of variables   :   90 (  64   !;  26   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f180,plain,
    $false,
    inference(avatar_sat_refutation,[],[f170,f179]) ).

fof(f179,plain,
    spl4_2,
    inference(avatar_contradiction_clause,[],[f177]) ).

fof(f177,plain,
    ( $false
    | spl4_2 ),
    inference(resolution,[],[f168,f106]) ).

fof(f106,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(f168,plain,
    ( ~ cUnsatisfiable(i2003_11_14_17_18_50190)
    | spl4_2 ),
    inference(avatar_component_clause,[],[f167]) ).

fof(f167,plain,
    ( spl4_2
  <=> cUnsatisfiable(i2003_11_14_17_18_50190) ),
    introduced(avatar_definition,[new_symbols(naming,[spl4_2])]) ).

fof(f170,plain,
    ~ spl4_2,
    inference(avatar_split_clause,[],[f162,f167]) ).

fof(f162,plain,
    ~ cUnsatisfiable(i2003_11_14_17_18_50190),
    inference(duplicate_literal_removal,[],[f160]) ).

fof(f160,plain,
    ( ~ cUnsatisfiable(i2003_11_14_17_18_50190)
    | ~ cUnsatisfiable(i2003_11_14_17_18_50190) ),
    inference(superposition,[],[f147,f155]) ).

fof(f155,plain,
    i2003_11_14_17_18_50190 = sK1(i2003_11_14_17_18_50190),
    inference(resolution,[],[f154,f150]) ).

fof(f150,plain,
    rr(sK0(i2003_11_14_17_18_50190),sK1(i2003_11_14_17_18_50190)),
    inference(resolution,[],[f120,f106]) ).

fof(f120,plain,
    ! [X0] :
      ( ~ cUnsatisfiable(X0)
      | rr(sK0(X0),sK1(X0)) ),
    inference(cnf_transformation,[],[f87]) ).

fof(f87,plain,
    ! [X0] :
      ( ( ( ! [X2,X3] :
              ( ~ rr(sK0(X0),X2)
              | X2 = X3
              | ~ rr(sK0(X0),X3) )
          & rr(sK0(X0),sK1(X0))
          & cp1(sK1(X0))
          & rinvR(X0,sK0(X0))
          & cp2(X0) )
        | ~ cUnsatisfiable(X0) )
      & ( cUnsatisfiable(X0)
        | ! [X5] :
            ( ( rr(X5,sK2(X5))
              & sK3(X5) != sK2(X5)
              & rr(X5,sK3(X5)) )
            | ! [X8] :
                ( ~ rr(X5,X8)
                | ~ cp1(X8) )
            | ~ rinvR(X0,X5) )
        | ~ cp2(X0) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f83,f86,f85,f84]) ).

fof(f84,plain,
    ! [X0] :
      ( ? [X1] :
          ( ! [X2,X3] :
              ( ~ rr(X1,X2)
              | X2 = X3
              | ~ rr(X1,X3) )
          & ? [X4] :
              ( rr(X1,X4)
              & cp1(X4) )
          & rinvR(X0,X1) )
     => ( ! [X3,X2] :
            ( ~ rr(sK0(X0),X2)
            | X2 = X3
            | ~ rr(sK0(X0),X3) )
        & ? [X4] :
            ( rr(sK0(X0),X4)
            & cp1(X4) )
        & rinvR(X0,sK0(X0)) ) ),
    introduced(choice_axiom,[]) ).

fof(f85,plain,
    ! [X0] :
      ( ? [X4] :
          ( rr(sK0(X0),X4)
          & cp1(X4) )
     => ( rr(sK0(X0),sK1(X0))
        & cp1(sK1(X0)) ) ),
    introduced(choice_axiom,[]) ).

fof(f86,plain,
    ! [X5] :
      ( ? [X6,X7] :
          ( rr(X5,X6)
          & X6 != X7
          & rr(X5,X7) )
     => ( rr(X5,sK2(X5))
        & sK3(X5) != sK2(X5)
        & rr(X5,sK3(X5)) ) ),
    introduced(choice_axiom,[]) ).

fof(f83,plain,
    ! [X0] :
      ( ( ( ? [X1] :
              ( ! [X2,X3] :
                  ( ~ rr(X1,X2)
                  | X2 = X3
                  | ~ rr(X1,X3) )
              & ? [X4] :
                  ( rr(X1,X4)
                  & cp1(X4) )
              & rinvR(X0,X1) )
          & cp2(X0) )
        | ~ cUnsatisfiable(X0) )
      & ( cUnsatisfiable(X0)
        | ! [X5] :
            ( ? [X6,X7] :
                ( rr(X5,X6)
                & X6 != X7
                & rr(X5,X7) )
            | ! [X8] :
                ( ~ rr(X5,X8)
                | ~ cp1(X8) )
            | ~ rinvR(X0,X5) )
        | ~ cp2(X0) ) ),
    inference(rectify,[],[f82]) ).

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

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

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

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

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

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

fof(f154,plain,
    ! [X1] :
      ( ~ rr(sK0(i2003_11_14_17_18_50190),X1)
      | i2003_11_14_17_18_50190 = X1 ),
    inference(resolution,[],[f151,f152]) ).

fof(f152,plain,
    rr(sK0(i2003_11_14_17_18_50190),i2003_11_14_17_18_50190),
    inference(resolution,[],[f149,f106]) ).

fof(f149,plain,
    ! [X0] :
      ( ~ cUnsatisfiable(X0)
      | rr(sK0(X0),X0) ),
    inference(resolution,[],[f118,f108]) ).

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

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

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

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

fof(f118,plain,
    ! [X0] :
      ( rinvR(X0,sK0(X0))
      | ~ cUnsatisfiable(X0) ),
    inference(cnf_transformation,[],[f87]) ).

fof(f151,plain,
    ! [X0,X1] :
      ( ~ rr(sK0(i2003_11_14_17_18_50190),X0)
      | ~ rr(sK0(i2003_11_14_17_18_50190),X1)
      | X0 = X1 ),
    inference(resolution,[],[f121,f106]) ).

fof(f121,plain,
    ! [X2,X3,X0] :
      ( ~ cUnsatisfiable(X0)
      | ~ rr(sK0(X0),X3)
      | X2 = X3
      | ~ rr(sK0(X0),X2) ),
    inference(cnf_transformation,[],[f87]) ).

fof(f147,plain,
    ! [X0] :
      ( ~ cUnsatisfiable(sK1(X0))
      | ~ cUnsatisfiable(X0) ),
    inference(resolution,[],[f119,f146]) ).

fof(f146,plain,
    ! [X0] :
      ( ~ cp1(X0)
      | ~ cUnsatisfiable(X0) ),
    inference(resolution,[],[f117,f102]) ).

fof(f102,plain,
    ! [X0] :
      ( ~ cp2(X0)
      | ~ cp1(X0) ),
    inference(cnf_transformation,[],[f45]) ).

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

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

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

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

fof(f119,plain,
    ! [X0] :
      ( cp1(sK1(X0))
      | ~ cUnsatisfiable(X0) ),
    inference(cnf_transformation,[],[f87]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13  % Problem    : KRS072+1 : TPTP v8.1.0. Released v3.1.0.
% 0.08/0.14  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.13/0.35  % Computer : n027.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit   : 300
% 0.13/0.35  % WCLimit    : 300
% 0.13/0.35  % DateTime   : Tue Aug 30 00:47:00 EDT 2022
% 0.13/0.35  % CPUTime    : 
% 0.20/0.50  % (13742)lrs+10_1:1024_nm=0:nwc=5.0:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.20/0.50  % (13758)dis-10_3:2_amm=sco:ep=RS:fsr=off:nm=10:sd=2:sos=on:ss=axioms:st=3.0:i=11:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/11Mi)
% 0.20/0.50  % (13742)Refutation not found, incomplete strategy% (13742)------------------------------
% 0.20/0.50  % (13742)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.50  % (13742)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.50  % (13742)Termination reason: Refutation not found, incomplete strategy
% 0.20/0.50  
% 0.20/0.50  % (13742)Memory used [KB]: 5884
% 0.20/0.50  % (13742)Time elapsed: 0.004 s
% 0.20/0.50  % (13742)Instructions burned: 1 (million)
% 0.20/0.50  % (13742)------------------------------
% 0.20/0.50  % (13742)------------------------------
% 0.20/0.51  % (13758)Refutation not found, incomplete strategy% (13758)------------------------------
% 0.20/0.51  % (13758)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.51  % (13758)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.51  % (13758)Termination reason: Refutation not found, incomplete strategy
% 0.20/0.51  
% 0.20/0.51  % (13758)Memory used [KB]: 5884
% 0.20/0.51  % (13758)Time elapsed: 0.002 s
% 0.20/0.51  % (13758)Instructions burned: 1 (million)
% 0.20/0.51  % (13758)------------------------------
% 0.20/0.51  % (13758)------------------------------
% 0.20/0.51  % (13766)dis+21_1:1_aac=none:abs=on:er=known:fde=none:fsr=off:nwc=5.0:s2a=on:s2at=4.0:sp=const_frequency:to=lpo:urr=ec_only:i=25:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/25Mi)
% 0.20/0.51  % (13748)lrs+10_1:1_ep=R:lcm=predicate:lma=on:sos=all:spb=goal:ss=included:i=12:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/12Mi)
% 0.20/0.51  % (13766)First to succeed.
% 0.20/0.51  % (13766)Refutation found. Thanks to Tanya!
% 0.20/0.51  % SZS status Unsatisfiable for theBenchmark
% 0.20/0.51  % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.51  % (13766)------------------------------
% 0.20/0.51  % (13766)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.51  % (13766)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.51  % (13766)Termination reason: Refutation
% 0.20/0.51  
% 0.20/0.51  % (13766)Memory used [KB]: 6012
% 0.20/0.51  % (13766)Time elapsed: 0.113 s
% 0.20/0.51  % (13766)Instructions burned: 3 (million)
% 0.20/0.51  % (13766)------------------------------
% 0.20/0.51  % (13766)------------------------------
% 0.20/0.51  % (13736)Success in time 0.154 s
%------------------------------------------------------------------------------