TSTP Solution File: ARI620_1 by SnakeForV-SAT---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : ARI620_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_sat --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:48:44 EDT 2022

% Result   : Theorem 0.19s 0.52s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   16
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   23 (   6 unt;   2 typ;   0 def)
%            Number of atoms       :   93 (  28 equ)
%            Maximal formula atoms :   11 (   4 avg)
%            Number of connectives :  106 (  34   ~;  33   |;  31   &)
%                                         (   4 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   5 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number arithmetic     :  137 (  17 atm;  23 fun;  72 num;  25 var)
%            Number of types       :    2 (   0 usr;   1 ari)
%            Number of type conns  :    2 (   2   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    5 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   1 usr;   4 con; 0-2 aty)
%            Number of variables   :   25 (  17   !;   8   ?;  25   :)

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

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

tff(f54,plain,
    $false,
    inference(subsumption_resolution,[],[f51,f28]) ).

tff(f28,plain,
    ~ pow2(8),
    inference(cnf_transformation,[],[f27]) ).

tff(f27,plain,
    ( ! [X0: $int] :
        ( ( pow2(X0)
          | ( ( 1 != X0 )
            & ( ! [X1: $int] :
                  ( ( $product(2,X1) != X0 )
                  | ~ pow2(X1) )
              | $less(X0,2) ) ) )
        & ( ( 1 = X0 )
          | ( ( $product(2,sK0(X0)) = X0 )
            & pow2(sK0(X0))
            & ~ $less(X0,2) )
          | ~ pow2(X0) ) )
    & ~ pow2(8) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f25,f26]) ).

tff(f26,plain,
    ! [X0: $int] :
      ( ? [X2: $int] :
          ( ( $product(2,X2) = X0 )
          & pow2(X2) )
     => ( ( $product(2,sK0(X0)) = X0 )
        & pow2(sK0(X0)) ) ),
    introduced(choice_axiom,[]) ).

tff(f25,plain,
    ( ! [X0: $int] :
        ( ( pow2(X0)
          | ( ( 1 != X0 )
            & ( ! [X1: $int] :
                  ( ( $product(2,X1) != X0 )
                  | ~ pow2(X1) )
              | $less(X0,2) ) ) )
        & ( ( 1 = X0 )
          | ( ? [X2: $int] :
                ( ( $product(2,X2) = X0 )
                & pow2(X2) )
            & ~ $less(X0,2) )
          | ~ pow2(X0) ) )
    & ~ pow2(8) ),
    inference(rectify,[],[f24]) ).

tff(f24,plain,
    ( ! [X0: $int] :
        ( ( pow2(X0)
          | ( ( 1 != X0 )
            & ( ! [X1: $int] :
                  ( ( $product(2,X1) != X0 )
                  | ~ pow2(X1) )
              | $less(X0,2) ) ) )
        & ( ( 1 = X0 )
          | ( ? [X1: $int] :
                ( ( $product(2,X1) = X0 )
                & pow2(X1) )
            & ~ $less(X0,2) )
          | ~ pow2(X0) ) )
    & ~ pow2(8) ),
    inference(flattening,[],[f23]) ).

tff(f23,plain,
    ( ! [X0: $int] :
        ( ( pow2(X0)
          | ( ( 1 != X0 )
            & ( ! [X1: $int] :
                  ( ( $product(2,X1) != X0 )
                  | ~ pow2(X1) )
              | $less(X0,2) ) ) )
        & ( ( 1 = X0 )
          | ( ? [X1: $int] :
                ( ( $product(2,X1) = X0 )
                & pow2(X1) )
            & ~ $less(X0,2) )
          | ~ pow2(X0) ) )
    & ~ pow2(8) ),
    inference(nnf_transformation,[],[f22]) ).

tff(f22,plain,
    ( ! [X0: $int] :
        ( pow2(X0)
      <=> ( ( 1 = X0 )
          | ( ? [X1: $int] :
                ( ( $product(2,X1) = X0 )
                & pow2(X1) )
            & ~ $less(X0,2) ) ) )
    & ~ pow2(8) ),
    inference(ennf_transformation,[],[f3]) ).

tff(f3,plain,
    ~ ( ! [X0: $int] :
          ( pow2(X0)
        <=> ( ( 1 = X0 )
            | ( ? [X1: $int] :
                  ( ( $product(2,X1) = X0 )
                  & pow2(X1) )
              & ~ $less(X0,2) ) ) )
     => pow2(8) ),
    inference(theory_normalization,[],[f2]) ).

tff(f2,negated_conjecture,
    ~ ( ! [X0: $int] :
          ( ( ( ? [X1: $int] :
                  ( ( $product(2,X1) = X0 )
                  & pow2(X1) )
              & $lesseq(2,X0) )
            | ( 1 = X0 ) )
        <=> pow2(X0) )
     => pow2(8) ),
    inference(negated_conjecture,[],[f1]) ).

tff(f1,conjecture,
    ( ! [X0: $int] :
        ( ( ( ? [X1: $int] :
                ( ( $product(2,X1) = X0 )
                & pow2(X1) )
            & $lesseq(2,X0) )
          | ( 1 = X0 ) )
      <=> pow2(X0) )
   => pow2(8) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',pow_of_2_8) ).

tff(f51,plain,
    pow2(8),
    inference(evaluation,[],[f48]) ).

tff(f48,plain,
    ( $less($product(2,4),2)
    | pow2($product(2,4)) ),
    inference(resolution,[],[f47,f35]) ).

tff(f35,plain,
    ! [X1: $int] :
      ( ~ pow2(X1)
      | $less($product(2,X1),2)
      | pow2($product(2,X1)) ),
    inference(equality_resolution,[],[f32]) ).

tff(f32,plain,
    ! [X0: $int,X1: $int] :
      ( pow2(X0)
      | ( $product(2,X1) != X0 )
      | ~ pow2(X1)
      | $less(X0,2) ),
    inference(cnf_transformation,[],[f27]) ).

tff(f47,plain,
    pow2(4),
    inference(evaluation,[],[f42]) ).

tff(f42,plain,
    ( pow2($product(2,2))
    | $less($product(2,2),2) ),
    inference(resolution,[],[f41,f35]) ).

tff(f41,plain,
    pow2(2),
    inference(evaluation,[],[f40]) ).

tff(f40,plain,
    ( $less($product(2,1),2)
    | pow2($product(2,1)) ),
    inference(resolution,[],[f35,f34]) ).

tff(f34,plain,
    pow2(1),
    inference(equality_resolution,[],[f33]) ).

tff(f33,plain,
    ! [X0: $int] :
      ( pow2(X0)
      | ( 1 != X0 ) ),
    inference(cnf_transformation,[],[f27]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : ARI620=1 : TPTP v8.1.0. Released v5.1.0.
% 0.07/0.13  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.13/0.34  % Computer : n017.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit   : 300
% 0.13/0.34  % WCLimit    : 300
% 0.13/0.34  % DateTime   : Mon Aug 29 21:19:35 EDT 2022
% 0.13/0.34  % CPUTime    : 
% 0.19/0.50  % (28718)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/51Mi)
% 0.19/0.51  % (28717)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/51Mi)
% 0.19/0.51  % (28738)ott+10_1:1_kws=precedence:tgt=ground:i=482:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/482Mi)
% 0.19/0.51  % (28736)dis+21_1:1_av=off:er=filter:slsq=on:slsqc=0:slsqr=1,1:sp=frequency:to=lpo:i=498:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/498Mi)
% 0.19/0.52  % (28721)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/7Mi)
% 0.19/0.52  % (28729)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=75:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/75Mi)
% 0.19/0.52  % (28718)First to succeed.
% 0.19/0.52  % (28715)ott+10_1:32_abs=on:br=off:urr=ec_only:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/50Mi)
% 0.19/0.52  % (28718)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  % (28718)------------------------------
% 0.19/0.52  % (28718)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.52  % (28718)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.52  % (28718)Termination reason: Refutation
% 0.19/0.52  
% 0.19/0.52  % (28718)Memory used [KB]: 5373
% 0.19/0.52  % (28718)Time elapsed: 0.113 s
% 0.19/0.52  % (28718)Instructions burned: 3 (million)
% 0.19/0.52  % (28718)------------------------------
% 0.19/0.52  % (28718)------------------------------
% 0.19/0.52  % (28713)Success in time 0.178 s
%------------------------------------------------------------------------------