TSTP Solution File: ARI612_1 by SnakeForV---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : ARI612_1 : TPTP v8.1.0. Released v5.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 : 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 : Wed Aug 31 15:46:36 EDT 2022

% Result   : Theorem 0.19s 0.52s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :   11
% Syntax   : Number of formulae    :   46 (   8 unt;   3 typ;   0 def)
%            Number of atoms       :  163 (   4 equ)
%            Maximal formula atoms :   14 (   3 avg)
%            Number of connectives :  178 (  58   ~;  50   |;  49   &)
%                                         (  14 <=>;   7  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number arithmetic     :  194 (  79 atm;   0 fun;  78 num;  37 var)
%            Number of types       :    2 (   0 usr;   1 ari)
%            Number of type conns  :    2 (   2   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    9 (   6 usr;   5 prp; 0-2 aty)
%            Number of functors    :    5 (   1 usr;   5 con; 0-0 aty)
%            Number of variables   :   37 (  31   !;   6   ?;  37   :)

% Comments : 
%------------------------------------------------------------------------------
tff(func_def_8,type,
    sK0: $int ).

tff(pred_def_1,type,
    p: $int > $o ).

tff(pred_def_2,type,
    q: $int > $o ).

tff(f125,plain,
    $false,
    inference(avatar_sat_refutation,[],[f42,f85,f96,f112,f124]) ).

tff(f124,plain,
    ~ spl1_6,
    inference(avatar_contradiction_clause,[],[f123]) ).

tff(f123,plain,
    ( $false
    | ~ spl1_6 ),
    inference(evaluation,[],[f116]) ).

tff(f116,plain,
    ( $less(15,12)
    | ~ spl1_6 ),
    inference(backward_demodulation,[],[f32,f94]) ).

tff(f94,plain,
    ( ( 15 = sK0 )
    | ~ spl1_6 ),
    inference(avatar_component_clause,[],[f93]) ).

tff(f93,plain,
    ( spl1_6
  <=> ( 15 = sK0 ) ),
    introduced(avatar_definition,[new_symbols(naming,[spl1_6])]) ).

tff(f32,plain,
    $less(sK0,12),
    inference(resolution,[],[f30,f26]) ).

tff(f26,plain,
    q(sK0),
    inference(cnf_transformation,[],[f22]) ).

tff(f22,plain,
    ( ! [X0: $int] :
        ( ( ( $less(X0,12)
            & $less(8,X0) )
          | ~ q(X0) )
        & ( q(X0)
          | ~ $less(X0,12)
          | ~ $less(8,X0) ) )
    & ~ p(sK0)
    & q(sK0)
    & ! [X2: $int] :
        ( ( ( $less(5,X2)
            & $less(X2,15) )
          | ~ p(X2) )
        & ( p(X2)
          | ~ $less(5,X2)
          | ~ $less(X2,15) ) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f20,f21]) ).

tff(f21,plain,
    ( ? [X1: $int] :
        ( ~ p(X1)
        & q(X1) )
   => ( ~ p(sK0)
      & q(sK0) ) ),
    introduced(choice_axiom,[]) ).

tff(f20,plain,
    ( ! [X0: $int] :
        ( ( ( $less(X0,12)
            & $less(8,X0) )
          | ~ q(X0) )
        & ( q(X0)
          | ~ $less(X0,12)
          | ~ $less(8,X0) ) )
    & ? [X1: $int] :
        ( ~ p(X1)
        & q(X1) )
    & ! [X2: $int] :
        ( ( ( $less(5,X2)
            & $less(X2,15) )
          | ~ p(X2) )
        & ( p(X2)
          | ~ $less(5,X2)
          | ~ $less(X2,15) ) ) ),
    inference(rectify,[],[f19]) ).

tff(f19,plain,
    ( ! [X1: $int] :
        ( ( ( $less(X1,12)
            & $less(8,X1) )
          | ~ q(X1) )
        & ( q(X1)
          | ~ $less(X1,12)
          | ~ $less(8,X1) ) )
    & ? [X2: $int] :
        ( ~ p(X2)
        & q(X2) )
    & ! [X0: $int] :
        ( ( ( $less(5,X0)
            & $less(X0,15) )
          | ~ p(X0) )
        & ( p(X0)
          | ~ $less(5,X0)
          | ~ $less(X0,15) ) ) ),
    inference(flattening,[],[f18]) ).

tff(f18,plain,
    ( ! [X1: $int] :
        ( ( ( $less(X1,12)
            & $less(8,X1) )
          | ~ q(X1) )
        & ( q(X1)
          | ~ $less(X1,12)
          | ~ $less(8,X1) ) )
    & ? [X2: $int] :
        ( ~ p(X2)
        & q(X2) )
    & ! [X0: $int] :
        ( ( ( $less(5,X0)
            & $less(X0,15) )
          | ~ p(X0) )
        & ( p(X0)
          | ~ $less(5,X0)
          | ~ $less(X0,15) ) ) ),
    inference(nnf_transformation,[],[f17]) ).

tff(f17,plain,
    ( ! [X1: $int] :
        ( ( $less(X1,12)
          & $less(8,X1) )
      <=> q(X1) )
    & ? [X2: $int] :
        ( ~ p(X2)
        & q(X2) )
    & ! [X0: $int] :
        ( ( $less(5,X0)
          & $less(X0,15) )
      <=> p(X0) ) ),
    inference(flattening,[],[f16]) ).

tff(f16,plain,
    ( ? [X2: $int] :
        ( ~ p(X2)
        & q(X2) )
    & ! [X1: $int] :
        ( ( $less(X1,12)
          & $less(8,X1) )
      <=> q(X1) )
    & ! [X0: $int] :
        ( ( $less(5,X0)
          & $less(X0,15) )
      <=> p(X0) ) ),
    inference(ennf_transformation,[],[f15]) ).

tff(f15,plain,
    ~ ( ( ! [X1: $int] :
            ( ( $less(X1,12)
              & $less(8,X1) )
          <=> q(X1) )
        & ! [X0: $int] :
            ( ( $less(5,X0)
              & $less(X0,15) )
          <=> p(X0) ) )
     => ! [X2: $int] :
          ( q(X2)
         => p(X2) ) ),
    inference(rectify,[],[f2]) ).

tff(f2,negated_conjecture,
    ~ ( ( ! [X0: $int] :
            ( ( $less(5,X0)
              & $less(X0,15) )
          <=> p(X0) )
        & ! [X0: $int] :
            ( q(X0)
          <=> ( $less(8,X0)
              & $less(X0,12) ) ) )
     => ! [X0: $int] :
          ( q(X0)
         => p(X0) ) ),
    inference(negated_conjecture,[],[f1]) ).

tff(f1,conjecture,
    ( ( ! [X0: $int] :
          ( ( $less(5,X0)
            & $less(X0,15) )
        <=> p(X0) )
      & ! [X0: $int] :
          ( q(X0)
        <=> ( $less(8,X0)
            & $less(X0,12) ) ) )
   => ! [X0: $int] :
        ( q(X0)
       => p(X0) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',interv_8_12_subset_5_15) ).

tff(f30,plain,
    ! [X0: $int] :
      ( ~ q(X0)
      | $less(X0,12) ),
    inference(cnf_transformation,[],[f22]) ).

tff(f112,plain,
    ~ spl1_5,
    inference(avatar_contradiction_clause,[],[f111]) ).

tff(f111,plain,
    ( $false
    | ~ spl1_5 ),
    inference(evaluation,[],[f109]) ).

tff(f109,plain,
    ( $less(15,12)
    | ~ spl1_5 ),
    inference(resolution,[],[f52,f91]) ).

tff(f91,plain,
    ( $less(15,sK0)
    | ~ spl1_5 ),
    inference(avatar_component_clause,[],[f90]) ).

tff(f90,plain,
    ( spl1_5
  <=> $less(15,sK0) ),
    introduced(avatar_definition,[new_symbols(naming,[spl1_5])]) ).

tff(f52,plain,
    ! [X1: $int] :
      ( ~ $less(X1,sK0)
      | $less(X1,12) ),
    inference(resolution,[],[f9,f32]) ).

tff(f9,plain,
    ! [X2: $int,X0: $int,X1: $int] :
      ( ~ $less(X1,X2)
      | ~ $less(X0,X1)
      | $less(X0,X2) ),
    introduced(theory_axiom_148,[]) ).

tff(f96,plain,
    ( spl1_5
    | spl1_6
    | spl1_2 ),
    inference(avatar_split_clause,[],[f87,f40,f93,f90]) ).

tff(f40,plain,
    ( spl1_2
  <=> $less(sK0,15) ),
    introduced(avatar_definition,[new_symbols(naming,[spl1_2])]) ).

tff(f87,plain,
    ( ( 15 = sK0 )
    | $less(15,sK0)
    | spl1_2 ),
    inference(resolution,[],[f41,f10]) ).

tff(f10,plain,
    ! [X0: $int,X1: $int] :
      ( $less(X0,X1)
      | $less(X1,X0)
      | ( X0 = X1 ) ),
    introduced(theory_axiom_149,[]) ).

tff(f41,plain,
    ( ~ $less(sK0,15)
    | spl1_2 ),
    inference(avatar_component_clause,[],[f40]) ).

tff(f85,plain,
    spl1_1,
    inference(avatar_contradiction_clause,[],[f84]) ).

tff(f84,plain,
    ( $false
    | spl1_1 ),
    inference(evaluation,[],[f81]) ).

tff(f81,plain,
    ( ~ $less(5,8)
    | spl1_1 ),
    inference(resolution,[],[f51,f38]) ).

tff(f38,plain,
    ( ~ $less(5,sK0)
    | spl1_1 ),
    inference(avatar_component_clause,[],[f37]) ).

tff(f37,plain,
    ( spl1_1
  <=> $less(5,sK0) ),
    introduced(avatar_definition,[new_symbols(naming,[spl1_1])]) ).

tff(f51,plain,
    ! [X0: $int] :
      ( $less(X0,sK0)
      | ~ $less(X0,8) ),
    inference(resolution,[],[f9,f31]) ).

tff(f31,plain,
    $less(8,sK0),
    inference(resolution,[],[f29,f26]) ).

tff(f29,plain,
    ! [X0: $int] :
      ( ~ q(X0)
      | $less(8,X0) ),
    inference(cnf_transformation,[],[f22]) ).

tff(f42,plain,
    ( ~ spl1_1
    | ~ spl1_2 ),
    inference(avatar_split_clause,[],[f33,f40,f37]) ).

tff(f33,plain,
    ( ~ $less(sK0,15)
    | ~ $less(5,sK0) ),
    inference(resolution,[],[f23,f27]) ).

tff(f27,plain,
    ~ p(sK0),
    inference(cnf_transformation,[],[f22]) ).

tff(f23,plain,
    ! [X2: $int] :
      ( p(X2)
      | ~ $less(5,X2)
      | ~ $less(X2,15) ),
    inference(cnf_transformation,[],[f22]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : ARI612=1 : TPTP v8.1.0. Released v5.1.0.
% 0.03/0.13  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.12/0.34  % Computer : n017.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 29 15:15:34 EDT 2022
% 0.12/0.34  % CPUTime    : 
% 0.19/0.50  % (21646)lrs+1010_1:1_aac=none:bce=on:nicw=on:nm=0:plsq=on:plsql=on:sac=on:sos=on:sp=frequency:spb=units:to=lpo:i=34:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/34Mi)
% 0.19/0.50  % (21668)dis+32_1:1_bd=off:nm=4:sos=on:ss=included:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.19/0.50  % (21662)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=49:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/49Mi)
% 0.19/0.51  % (21660)dis+20_1:12_aac=none:acc=model:awrs=converge:fd=preordered:fsr=off:nicw=on:nwc=3.0:s2a=on:s2agt=16:spb=goal:to=lpo:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.19/0.51  % (21652)lrs+1010_1:1_bd=off:fd=off:fde=none:ins=3:sac=on:sos=on:spb=goal:to=lpo:i=36:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/36Mi)
% 0.19/0.51  % (21649)ott+1011_1:2_br=off:bs=unit_only:bsr=unit_only:nwc=5.0:s2a=on:s2agt=32:urr=on:i=37:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 0.19/0.51  % (21654)lrs+10_1:8_ep=R:erd=off:fs=off:fsr=off:gve=force:nwc=2.0:uwa=one_side_interpreted:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.19/0.51  % (21662)First to succeed.
% 0.19/0.52  % (21654)Instruction limit reached!
% 0.19/0.52  % (21654)------------------------------
% 0.19/0.52  % (21654)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.52  % (21654)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.52  % (21654)Termination reason: Unknown
% 0.19/0.52  % (21654)Termination phase: Saturation
% 0.19/0.52  
% 0.19/0.52  % (21654)Memory used [KB]: 5500
% 0.19/0.52  % (21654)Time elapsed: 0.120 s
% 0.19/0.52  % (21654)Instructions burned: 3 (million)
% 0.19/0.52  % (21654)------------------------------
% 0.19/0.52  % (21654)------------------------------
% 0.19/0.52  % (21662)Refutation found. Thanks to Tanya!
% 0.19/0.52  % SZS status Theorem for theBenchmark
% 0.19/0.52  % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.52  % (21662)------------------------------
% 0.19/0.52  % (21662)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.52  % (21662)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.52  % (21662)Termination reason: Refutation
% 0.19/0.52  
% 0.19/0.52  % (21662)Memory used [KB]: 5500
% 0.19/0.52  % (21662)Time elapsed: 0.113 s
% 0.19/0.52  % (21662)Instructions burned: 4 (million)
% 0.19/0.52  % (21662)------------------------------
% 0.19/0.52  % (21662)------------------------------
% 0.19/0.52  % (21644)Success in time 0.166 s
%------------------------------------------------------------------------------