TSTP Solution File: ARI620_1 by SnakeForV---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV---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_uns --cores 0 -t %d %s

% Computer : n021.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:38 EDT 2022

% Result   : Theorem 1.46s 0.55s
% Output   : Refutation 1.46s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   17
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   32 (  10 unt;   3 typ;   0 def)
%            Number of atoms       :  108 (  30 equ)
%            Maximal formula atoms :   10 (   3 avg)
%            Number of connectives :  115 (  36   ~;  37   |;  32   &)
%                                         (   6 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number arithmetic     :  149 (  18 atm;  24 fun;  77 num;  30 var)
%            Number of types       :    2 (   0 usr;   1 ari)
%            Number of type conns  :    3 (   3   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    6 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   1 usr;   4 con; 0-2 aty)
%            Number of variables   :   30 (  21   !;   9   ?;  30   :)

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

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

tff(pred_def_4,type,
    sP0: $int > $o ).

tff(f124,plain,
    $false,
    inference(subsumption_resolution,[],[f118,f36]) ).

tff(f36,plain,
    ~ pow2(8),
    inference(cnf_transformation,[],[f30]) ).

tff(f30,plain,
    ( ! [X0: $int] :
        ( ( sP0(X0)
          | ~ pow2(X0) )
        & ( pow2(X0)
          | ~ sP0(X0) ) )
    & ~ pow2(8) ),
    inference(nnf_transformation,[],[f24]) ).

tff(f24,plain,
    ( ! [X0: $int] :
        ( sP0(X0)
      <=> pow2(X0) )
    & ~ pow2(8) ),
    inference(definition_folding,[],[f22,f23]) ).

tff(f23,plain,
    ! [X0: $int] :
      ( sP0(X0)
    <=> ( ( 1 = X0 )
        | ( ~ $less(X0,2)
          & ? [X1: $int] :
              ( pow2(X1)
              & ( $product(2,X1) = X0 ) ) ) ) ),
    introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).

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

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

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

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

tff(f118,plain,
    pow2(8),
    inference(resolution,[],[f117,f37]) ).

tff(f37,plain,
    ! [X0: $int] :
      ( ~ sP0(X0)
      | pow2(X0) ),
    inference(cnf_transformation,[],[f30]) ).

tff(f117,plain,
    sP0(8),
    inference(evaluation,[],[f116]) ).

tff(f116,plain,
    ( sP0($product(2,4))
    | $less($product(2,4),2) ),
    inference(resolution,[],[f53,f41]) ).

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

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

tff(f29,plain,
    ! [X0: $int] :
      ( ( sP0(X0)
        | ( ( 1 != X0 )
          & ( $less(X0,2)
            | ! [X1: $int] :
                ( ~ pow2(X1)
                | ( $product(2,X1) != X0 ) ) ) ) )
      & ( ( 1 = X0 )
        | ( ~ $less(X0,2)
          & pow2(sK1(X0))
          & ( $product(2,sK1(X0)) = X0 ) )
        | ~ sP0(X0) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f27,f28]) ).

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

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

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

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

tff(f53,plain,
    pow2(4),
    inference(resolution,[],[f52,f37]) ).

tff(f52,plain,
    sP0(4),
    inference(evaluation,[],[f51]) ).

tff(f51,plain,
    ( $less($product(2,2),2)
    | sP0($product(2,2)) ),
    inference(resolution,[],[f45,f41]) ).

tff(f45,plain,
    pow2(2),
    inference(resolution,[],[f44,f37]) ).

tff(f44,plain,
    sP0(2),
    inference(evaluation,[],[f43]) ).

tff(f43,plain,
    ( sP0($product(2,1))
    | $less($product(2,1),2) ),
    inference(resolution,[],[f42,f41]) ).

tff(f42,plain,
    pow2(1),
    inference(resolution,[],[f37,f40]) ).

tff(f40,plain,
    sP0(1),
    inference(equality_resolution,[],[f35]) ).

tff(f35,plain,
    ! [X0: $int] :
      ( sP0(X0)
      | ( 1 != X0 ) ),
    inference(cnf_transformation,[],[f29]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem    : ARI620=1 : TPTP v8.1.0. Released v5.1.0.
% 0.04/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 : n021.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   : Tue Aug 30 02:20:40 EDT 2022
% 0.12/0.34  % CPUTime    : 
% 0.19/0.54  % (3561)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.54  % (3568)lrs+22_1:1_amm=sco:fsr=off:gve=force:sos=on:uwa=all:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 1.46/0.54  % (3560)lrs+10_5:1_br=off:fde=none:nwc=3.0:sd=1:sgt=10:sos=on:ss=axioms:urr=on:i=32:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/32Mi)
% 1.46/0.54  % (3577)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)
% 1.46/0.55  % (3571)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)
% 1.46/0.55  % (3579)lrs+1002_1:1_br=off:canc=force:drc=off:s2a=on:sos=on:sp=reverse_frequency:urr=on:i=42:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/42Mi)
% 1.46/0.55  % (3576)dis+2_1:1_av=off:bsr=on:erd=off:s2pl=on:sgt=16:sos=on:sp=frequency:ss=axioms:i=46:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/46Mi)
% 1.46/0.55  % (3569)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)
% 1.46/0.55  % (3559)lrs+10_1:32_s2a=on:s2agt=10:sgt=8:ss=axioms:i=15:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/15Mi)
% 1.46/0.55  % (3569)Instruction limit reached!
% 1.46/0.55  % (3569)------------------------------
% 1.46/0.55  % (3569)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.46/0.55  % (3569)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.46/0.55  % (3569)Termination reason: Unknown
% 1.46/0.55  % (3569)Termination phase: Property scanning
% 1.46/0.55  
% 1.46/0.55  % (3569)Memory used [KB]: 895
% 1.46/0.55  % (3569)Time elapsed: 0.003 s
% 1.46/0.55  % (3569)Instructions burned: 2 (million)
% 1.46/0.55  % (3569)------------------------------
% 1.46/0.55  % (3569)------------------------------
% 1.46/0.55  % (3577)First to succeed.
% 1.46/0.55  % (3554)dis+1010_1:4_aac=none:abs=on:atotf=0.5:avsq=on:avsqc=2:avsqr=215,247:awrs=converge:awrsf=128:bsd=on:erd=off:fde=none:gve=cautious:newcnf=on:nwc=5.0:rnwc=on:sac=on:sas=z3:sp=const_min:tgt=ground:thsq=on:thsqc=64:thsqr=1,4:i=59848:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/59848Mi)
% 1.46/0.55  % (3577)Refutation found. Thanks to Tanya!
% 1.46/0.55  % SZS status Theorem for theBenchmark
% 1.46/0.55  % SZS output start Proof for theBenchmark
% See solution above
% 1.46/0.55  % (3577)------------------------------
% 1.46/0.55  % (3577)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.46/0.55  % (3577)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.46/0.55  % (3577)Termination reason: Refutation
% 1.46/0.55  
% 1.46/0.55  % (3577)Memory used [KB]: 5500
% 1.46/0.55  % (3577)Time elapsed: 0.135 s
% 1.46/0.55  % (3577)Instructions burned: 3 (million)
% 1.46/0.55  % (3577)------------------------------
% 1.46/0.55  % (3577)------------------------------
% 1.46/0.55  % (3553)Success in time 0.205 s
%------------------------------------------------------------------------------