TSTP Solution File: DAT081_1 by SnakeForV---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : DAT081_1 : TPTP v8.1.0. Released v6.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 : n013.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 16:04:07 EDT 2022

% Result   : Theorem 0.20s 0.52s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   23
% Syntax   : Number of formulae    :   36 (   9 unt;  17 typ;   0 def)
%            Number of atoms       :   72 (  40 equ)
%            Maximal formula atoms :   10 (   3 avg)
%            Number of connectives :   81 (  28   ~;  24   |;  24   &)
%                                         (   2 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   5 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number arithmetic     :   36 (   0 atm;   0 fun;   0 num;  36 var)
%            Number of types       :    3 (   1 usr;   1 ari)
%            Number of type conns  :   25 (  14   >;  11   *;   0   +;   0  <<)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :   14 (  14 usr;   2 con; 0-2 aty)
%            Number of variables   :   67 (  41   !;  26   ?;  67   :)

% Comments : 
%------------------------------------------------------------------------------
tff(type_def_5,type,
    list: $tType ).

tff(func_def_0,type,
    nil: list ).

tff(func_def_1,type,
    cons: ( $int * list ) > list ).

tff(func_def_2,type,
    head: list > $int ).

tff(func_def_3,type,
    tail: list > list ).

tff(func_def_5,type,
    length: list > $int ).

tff(func_def_8,type,
    count: ( $int * list ) > $int ).

tff(func_def_9,type,
    append: ( list * list ) > list ).

tff(func_def_11,type,
    sK0: $int ).

tff(func_def_12,type,
    sK1: ( $int * list ) > list ).

tff(func_def_13,type,
    sK2: ( $int * list ) > $int ).

tff(func_def_14,type,
    sK3: ( list * $int ) > list ).

tff(func_def_15,type,
    sK4: ( list * $int ) > $int ).

tff(func_def_16,type,
    sK5: ( list * $int ) > $int ).

tff(func_def_17,type,
    sK6: ( list * $int ) > list ).

tff(pred_def_1,type,
    in: ( $int * list ) > $o ).

tff(pred_def_2,type,
    inRange: ( $int * list ) > $o ).

tff(f84,plain,
    $false,
    inference(unit_resulting_resolution,[],[f63,f63,f53,f66]) ).

tff(f66,plain,
    ! [X0: list,X1: $int] :
      ( ~ in(X1,X0)
      | ( cons(sK5(X0,X1),sK6(X0,X1)) = X0 )
      | ( cons(sK4(X0,X1),sK3(X0,X1)) = X0 ) ),
    inference(cnf_transformation,[],[f52]) ).

tff(f52,plain,
    ! [X0: list,X1: $int] :
      ( ( in(X1,X0)
        | ( ! [X2: list,X3: $int] :
              ( ( X1 != X3 )
              | ( cons(X3,X2) != X0 ) )
          & ! [X4: $int,X5: list] :
              ( ( cons(X4,X5) != X0 )
              | ~ in(X1,X5) ) ) )
      & ( ( ( sK4(X0,X1) = X1 )
          & ( cons(sK4(X0,X1),sK3(X0,X1)) = X0 ) )
        | ( ( cons(sK5(X0,X1),sK6(X0,X1)) = X0 )
          & in(X1,sK6(X0,X1)) )
        | ~ in(X1,X0) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4,sK5,sK6])],[f49,f51,f50]) ).

tff(f50,plain,
    ! [X0: list,X1: $int] :
      ( ? [X6: list,X7: $int] :
          ( ( X1 = X7 )
          & ( cons(X7,X6) = X0 ) )
     => ( ( sK4(X0,X1) = X1 )
        & ( cons(sK4(X0,X1),sK3(X0,X1)) = X0 ) ) ),
    introduced(choice_axiom,[]) ).

tff(f51,plain,
    ! [X0: list,X1: $int] :
      ( ? [X8: $int,X9: list] :
          ( ( cons(X8,X9) = X0 )
          & in(X1,X9) )
     => ( ( cons(sK5(X0,X1),sK6(X0,X1)) = X0 )
        & in(X1,sK6(X0,X1)) ) ),
    introduced(choice_axiom,[]) ).

tff(f49,plain,
    ! [X0: list,X1: $int] :
      ( ( in(X1,X0)
        | ( ! [X2: list,X3: $int] :
              ( ( X1 != X3 )
              | ( cons(X3,X2) != X0 ) )
          & ! [X4: $int,X5: list] :
              ( ( cons(X4,X5) != X0 )
              | ~ in(X1,X5) ) ) )
      & ( ? [X6: list,X7: $int] :
            ( ( X1 = X7 )
            & ( cons(X7,X6) = X0 ) )
        | ? [X8: $int,X9: list] :
            ( ( cons(X8,X9) = X0 )
            & in(X1,X9) )
        | ~ in(X1,X0) ) ),
    inference(rectify,[],[f48]) ).

tff(f48,plain,
    ! [X1: list,X0: $int] :
      ( ( in(X0,X1)
        | ( ! [X5: list,X4: $int] :
              ( ( X0 != X4 )
              | ( cons(X4,X5) != X1 ) )
          & ! [X2: $int,X3: list] :
              ( ( cons(X2,X3) != X1 )
              | ~ in(X0,X3) ) ) )
      & ( ? [X5: list,X4: $int] :
            ( ( X0 = X4 )
            & ( cons(X4,X5) = X1 ) )
        | ? [X2: $int,X3: list] :
            ( ( cons(X2,X3) = X1 )
            & in(X0,X3) )
        | ~ in(X0,X1) ) ),
    inference(flattening,[],[f47]) ).

tff(f47,plain,
    ! [X1: list,X0: $int] :
      ( ( in(X0,X1)
        | ( ! [X5: list,X4: $int] :
              ( ( X0 != X4 )
              | ( cons(X4,X5) != X1 ) )
          & ! [X2: $int,X3: list] :
              ( ( cons(X2,X3) != X1 )
              | ~ in(X0,X3) ) ) )
      & ( ? [X5: list,X4: $int] :
            ( ( X0 = X4 )
            & ( cons(X4,X5) = X1 ) )
        | ? [X2: $int,X3: list] :
            ( ( cons(X2,X3) = X1 )
            & in(X0,X3) )
        | ~ in(X0,X1) ) ),
    inference(nnf_transformation,[],[f33]) ).

tff(f33,plain,
    ! [X1: list,X0: $int] :
      ( in(X0,X1)
    <=> ( ? [X5: list,X4: $int] :
            ( ( X0 = X4 )
            & ( cons(X4,X5) = X1 ) )
        | ? [X2: $int,X3: list] :
            ( ( cons(X2,X3) = X1 )
            & in(X0,X3) ) ) ),
    inference(rectify,[],[f5]) ).

tff(f5,axiom,
    ! [X2: $int,X1: list] :
      ( in(X2,X1)
    <=> ( ? [X3: $int,X4: list] :
            ( in(X2,X4)
            & ( cons(X3,X4) = X1 ) )
        | ? [X3: $int,X4: list] :
            ( ( X2 = X3 )
            & ( cons(X3,X4) = X1 ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',in_conv) ).

tff(f53,plain,
    in(sK0,nil),
    inference(cnf_transformation,[],[f39]) ).

tff(f39,plain,
    in(sK0,nil),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f37,f38]) ).

tff(f38,plain,
    ( ? [X0: $int] : in(X0,nil)
   => in(sK0,nil) ),
    introduced(choice_axiom,[]) ).

tff(f37,plain,
    ? [X0: $int] : in(X0,nil),
    inference(ennf_transformation,[],[f31]) ).

tff(f31,plain,
    ~ ! [X0: $int] : ~ in(X0,nil),
    inference(rectify,[],[f16]) ).

tff(f16,negated_conjecture,
    ~ ! [X7: $int] : ~ in(X7,nil),
    inference(negated_conjecture,[],[f15]) ).

tff(f15,conjecture,
    ! [X7: $int] : ~ in(X7,nil),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c) ).

tff(f63,plain,
    ! [X0: $int,X1: list] : ( cons(X0,X1) != nil ),
    inference(cnf_transformation,[],[f4]) ).

tff(f4,axiom,
    ! [X0: $int,X1: list] : ( cons(X0,X1) != nil ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l4) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : DAT081=1 : TPTP v8.1.0. Released v6.1.0.
% 0.07/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.13/0.35  % Computer : n013.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   : Mon Aug 29 20:17:17 EDT 2022
% 0.13/0.35  % CPUTime    : 
% 0.20/0.50  % (32597)lrs+10_1:1_ss=axioms:st=5.0:tha=off:i=15:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/15Mi)
% 0.20/0.50  % (32602)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.20/0.50  % (32605)lrs+1_3:1_ep=RSTC:sos=on:urr=on:i=43:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/43Mi)
% 0.20/0.51  % (32582)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.20/0.51  % (32584)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)
% 0.20/0.51  % (32579)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.20/0.51  % (32584)First to succeed.
% 0.20/0.51  % (32592)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)
% 0.20/0.51  % (32578)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)
% 0.20/0.52  % (32593)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.20/0.52  % (32584)Refutation found. Thanks to Tanya!
% 0.20/0.52  % SZS status Theorem for theBenchmark
% 0.20/0.52  % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.52  % (32584)------------------------------
% 0.20/0.52  % (32584)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.52  % (32584)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.52  % (32584)Termination reason: Refutation
% 0.20/0.52  
% 0.20/0.52  % (32584)Memory used [KB]: 5500
% 0.20/0.52  % (32584)Time elapsed: 0.106 s
% 0.20/0.52  % (32584)Instructions burned: 3 (million)
% 0.20/0.52  % (32584)------------------------------
% 0.20/0.52  % (32584)------------------------------
% 0.20/0.52  % (32575)Success in time 0.161 s
%------------------------------------------------------------------------------