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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : DAT098_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_sat --cores 0 -t %d %s

% Computer : n006.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:53 EDT 2022

% Result   : Theorem 0.18s 0.52s
% Output   : Refutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :   11
% Syntax   : Number of formulae    :   31 (   9 unt;   8 typ;   0 def)
%            Number of atoms       :  103 (  26 equ)
%            Maximal formula atoms :   12 (   4 avg)
%            Number of connectives :  126 (  46   ~;  41   |;  35   &)
%                                         (   3 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   6 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number arithmetic     :  116 (  36 atm;   0 fun;  55 num;  25 var)
%            Number of types       :    3 (   1 usr;   1 ari)
%            Number of type conns  :   10 (   6   >;   4   *;   0   +;   0  <<)
%            Number of predicates  :    5 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :   11 (   6 usr;   6 con; 0-2 aty)
%            Number of variables   :   48 (  34   !;  14   ?;  48   :)

% 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_11,type,
    sK0: ( list * $int ) > list ).

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

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

tff(f251,plain,
    $false,
    inference(subsumption_resolution,[],[f250,f43]) ).

tff(f43,plain,
    ! [X1: $int] : inRange(X1,nil),
    inference(equality_resolution,[],[f35]) ).

tff(f35,plain,
    ! [X0: list,X1: $int] :
      ( inRange(X1,X0)
      | ( nil != X0 ) ),
    inference(cnf_transformation,[],[f30]) ).

tff(f30,plain,
    ! [X0: list,X1: $int] :
      ( ( ( ( cons(sK1(X0,X1),sK0(X0,X1)) = X0 )
          & $less(sK1(X0,X1),X1)
          & inRange(X1,sK0(X0,X1))
          & ~ $less(sK1(X0,X1),0) )
        | ( nil = X0 )
        | ~ inRange(X1,X0) )
      & ( inRange(X1,X0)
        | ( ! [X4: list,X5: $int] :
              ( ( cons(X5,X4) != X0 )
              | ~ $less(X5,X1)
              | ~ inRange(X1,X4)
              | $less(X5,0) )
          & ( nil != X0 ) ) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f28,f29]) ).

tff(f29,plain,
    ! [X0: list,X1: $int] :
      ( ? [X2: list,X3: $int] :
          ( ( cons(X3,X2) = X0 )
          & $less(X3,X1)
          & inRange(X1,X2)
          & ~ $less(X3,0) )
     => ( ( cons(sK1(X0,X1),sK0(X0,X1)) = X0 )
        & $less(sK1(X0,X1),X1)
        & inRange(X1,sK0(X0,X1))
        & ~ $less(sK1(X0,X1),0) ) ),
    introduced(choice_axiom,[]) ).

tff(f28,plain,
    ! [X0: list,X1: $int] :
      ( ( ? [X2: list,X3: $int] :
            ( ( cons(X3,X2) = X0 )
            & $less(X3,X1)
            & inRange(X1,X2)
            & ~ $less(X3,0) )
        | ( nil = X0 )
        | ~ inRange(X1,X0) )
      & ( inRange(X1,X0)
        | ( ! [X4: list,X5: $int] :
              ( ( cons(X5,X4) != X0 )
              | ~ $less(X5,X1)
              | ~ inRange(X1,X4)
              | $less(X5,0) )
          & ( nil != X0 ) ) ) ),
    inference(rectify,[],[f27]) ).

tff(f27,plain,
    ! [X0: list,X1: $int] :
      ( ( ? [X3: list,X2: $int] :
            ( ( cons(X2,X3) = X0 )
            & $less(X2,X1)
            & inRange(X1,X3)
            & ~ $less(X2,0) )
        | ( nil = X0 )
        | ~ inRange(X1,X0) )
      & ( inRange(X1,X0)
        | ( ! [X3: list,X2: $int] :
              ( ( cons(X2,X3) != X0 )
              | ~ $less(X2,X1)
              | ~ inRange(X1,X3)
              | $less(X2,0) )
          & ( nil != X0 ) ) ) ),
    inference(flattening,[],[f26]) ).

tff(f26,plain,
    ! [X0: list,X1: $int] :
      ( ( ? [X3: list,X2: $int] :
            ( ( cons(X2,X3) = X0 )
            & $less(X2,X1)
            & inRange(X1,X3)
            & ~ $less(X2,0) )
        | ( nil = X0 )
        | ~ inRange(X1,X0) )
      & ( inRange(X1,X0)
        | ( ! [X3: list,X2: $int] :
              ( ( cons(X2,X3) != X0 )
              | ~ $less(X2,X1)
              | ~ inRange(X1,X3)
              | $less(X2,0) )
          & ( nil != X0 ) ) ) ),
    inference(nnf_transformation,[],[f22]) ).

tff(f22,plain,
    ! [X0: list,X1: $int] :
      ( ( ? [X3: list,X2: $int] :
            ( ( cons(X2,X3) = X0 )
            & $less(X2,X1)
            & inRange(X1,X3)
            & ~ $less(X2,0) )
        | ( nil = X0 ) )
    <=> inRange(X1,X0) ),
    inference(rectify,[],[f8]) ).

tff(f8,plain,
    ! [X1: list,X2: $int] :
      ( inRange(X2,X1)
    <=> ( ? [X0: $int,X3: list] :
            ( ~ $less(X0,0)
            & ( cons(X0,X3) = X1 )
            & inRange(X2,X3)
            & $less(X0,X2) )
        | ( nil = X1 ) ) ),
    inference(theory_normalization,[],[f5]) ).

tff(f5,axiom,
    ! [X1: list,X2: $int] :
      ( inRange(X2,X1)
    <=> ( ? [X0: $int,X3: list] :
            ( $lesseq(0,X0)
            & ( cons(X0,X3) = X1 )
            & inRange(X2,X3)
            & $less(X0,X2) )
        | ( nil = X1 ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',inRange) ).

tff(f250,plain,
    ~ inRange(4,nil),
    inference(evaluation,[],[f249]) ).

tff(f249,plain,
    ( ~ $less(2,4)
    | $less(2,0)
    | ~ inRange(4,nil) ),
    inference(resolution,[],[f175,f42]) ).

tff(f42,plain,
    ! [X1: $int,X4: list,X5: $int] :
      ( inRange(X1,cons(X5,X4))
      | $less(X5,0)
      | ~ inRange(X1,X4)
      | ~ $less(X5,X1) ),
    inference(equality_resolution,[],[f36]) ).

tff(f36,plain,
    ! [X0: list,X1: $int,X4: list,X5: $int] :
      ( inRange(X1,X0)
      | ( cons(X5,X4) != X0 )
      | ~ $less(X5,X1)
      | ~ inRange(X1,X4)
      | $less(X5,0) ),
    inference(cnf_transformation,[],[f30]) ).

tff(f175,plain,
    ~ inRange(4,cons(2,nil)),
    inference(evaluation,[],[f174]) ).

tff(f174,plain,
    ( ~ inRange(4,cons(2,nil))
    | ~ $less(3,4)
    | $less(3,0) ),
    inference(resolution,[],[f168,f42]) ).

tff(f168,plain,
    ~ inRange(4,cons(3,cons(2,nil))),
    inference(evaluation,[],[f165]) ).

tff(f165,plain,
    ( $less(1,0)
    | ~ $less(1,4)
    | ~ inRange(4,cons(3,cons(2,nil))) ),
    inference(resolution,[],[f42,f32]) ).

tff(f32,plain,
    ~ inRange(4,cons(1,cons(3,cons(2,nil)))),
    inference(cnf_transformation,[],[f21]) ).

tff(f21,plain,
    ~ inRange(4,cons(1,cons(3,cons(2,nil)))),
    inference(flattening,[],[f7]) ).

tff(f7,negated_conjecture,
    ~ inRange(4,cons(1,cons(3,cons(2,nil)))),
    inference(negated_conjecture,[],[f6]) ).

tff(f6,conjecture,
    inRange(4,cons(1,cons(3,cons(2,nil)))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',c) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : DAT098=1 : TPTP v8.1.0. Released v6.1.0.
% 0.07/0.12  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.12/0.33  % Computer : n006.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit   : 300
% 0.12/0.33  % WCLimit    : 300
% 0.12/0.33  % DateTime   : Mon Aug 29 20:20:55 EDT 2022
% 0.12/0.34  % CPUTime    : 
% 0.18/0.49  % (23058)ott+4_1:1_av=off:bd=off:nwc=5.0:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=37:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 0.18/0.49  % (23083)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=177:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/177Mi)
% 0.18/0.50  % (23075)ott+4_1:1_av=off:bd=off:nwc=5.0:rp=on:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.18/0.50  % (23067)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.18/0.50  % (23071)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 (2999ds/75Mi)
% 0.18/0.50  % (23060)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.18/0.50  % (23064)dis+2_1:64_add=large:bce=on:bd=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.18/0.50  % (23070)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/68Mi)
% 0.18/0.50  % (23078)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 (2999ds/498Mi)
% 0.18/0.50  % (23064)Instruction limit reached!
% 0.18/0.50  % (23064)------------------------------
% 0.18/0.50  % (23064)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.50  % (23064)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.50  % (23064)Termination reason: Unknown
% 0.18/0.50  % (23064)Termination phase: Saturation
% 0.18/0.50  
% 0.18/0.50  % (23064)Memory used [KB]: 5373
% 0.18/0.50  % (23064)Time elapsed: 0.107 s
% 0.18/0.50  % (23064)Instructions burned: 3 (million)
% 0.18/0.50  % (23064)------------------------------
% 0.18/0.50  % (23064)------------------------------
% 0.18/0.50  % (23063)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.18/0.51  % (23075)First to succeed.
% 0.18/0.51  % (23062)fmb+10_1:1_fmbsr=2.0:nm=4:skr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.18/0.51  % (23063)Instruction limit reached!
% 0.18/0.51  % (23063)------------------------------
% 0.18/0.51  % (23063)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.51  % (23063)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.51  % (23063)Termination reason: Unknown
% 0.18/0.51  % (23063)Termination phase: Saturation
% 0.18/0.51  
% 0.18/0.51  % (23063)Memory used [KB]: 5500
% 0.18/0.51  % (23063)Time elapsed: 0.109 s
% 0.18/0.51  % (23063)Instructions burned: 7 (million)
% 0.18/0.51  % (23063)------------------------------
% 0.18/0.51  % (23063)------------------------------
% 0.18/0.51  % (23062)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 0.18/0.51  % (23062)Terminated due to inappropriate strategy.
% 0.18/0.51  % (23062)------------------------------
% 0.18/0.51  % (23062)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.51  % (23062)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.51  % (23062)Termination reason: Inappropriate
% 0.18/0.51  
% 0.18/0.51  % (23062)Memory used [KB]: 895
% 0.18/0.51  % (23062)Time elapsed: 0.004 s
% 0.18/0.51  % (23062)Instructions burned: 2 (million)
% 0.18/0.51  % (23062)------------------------------
% 0.18/0.51  % (23062)------------------------------
% 0.18/0.51  % (23084)ott+33_1:4_s2a=on:tgt=ground:i=439:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/439Mi)
% 0.18/0.51  % (23076)ott+10_1:8_bsd=on:fsd=on:lcm=predicate:nwc=5.0:s2a=on:s2at=1.5:spb=goal_then_units:i=176:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/176Mi)
% 0.18/0.51  % (23079)ott+11_1:1_drc=off:nwc=5.0:slsq=on:slsqc=1:spb=goal_then_units:to=lpo:i=467:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/467Mi)
% 0.18/0.51  % (23061)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=48:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/48Mi)
% 0.18/0.52  % (23078)Also succeeded, but the first one will report.
% 0.18/0.52  % (23058)Also succeeded, but the first one will report.
% 0.18/0.52  % (23075)Refutation found. Thanks to Tanya!
% 0.18/0.52  % SZS status Theorem for theBenchmark
% 0.18/0.52  % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.52  % (23075)------------------------------
% 0.18/0.52  % (23075)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.52  % (23075)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.52  % (23075)Termination reason: Refutation
% 0.18/0.52  
% 0.18/0.52  % (23075)Memory used [KB]: 1151
% 0.18/0.52  % (23075)Time elapsed: 0.115 s
% 0.18/0.52  % (23075)Instructions burned: 11 (million)
% 0.18/0.52  % (23075)------------------------------
% 0.18/0.52  % (23075)------------------------------
% 0.18/0.52  % (23055)Success in time 0.171 s
%------------------------------------------------------------------------------