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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : DAT100_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 : n011.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 1.71s 0.64s
% Output   : Refutation 1.71s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   18
%            Number of leaves      :   22
% Syntax   : Number of formulae    :   70 (  26 unt;  11 typ;   0 def)
%            Number of atoms       :  155 (  62 equ)
%            Maximal formula atoms :   12 (   2 avg)
%            Number of connectives :  147 (  51   ~;  55   |;  35   &)
%                                         (   5 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   4 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number arithmetic     :  140 (  32 atm;   0 fun;  78 num;  30 var)
%            Number of types       :    3 (   1 usr;   1 ari)
%            Number of type conns  :   10 (   6   >;   4   *;   0   +;   0  <<)
%            Number of predicates  :    7 (   3 usr;   3 prp; 0-2 aty)
%            Number of functors    :   14 (   9 usr;   9 con; 0-2 aty)
%            Number of variables   :   60 (  46   !;  14   ?;  60   :)

% 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 ) > $int ).

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

tff(func_def_13,type,
    sF2: list ).

tff(func_def_14,type,
    sF3: list ).

tff(func_def_15,type,
    sF4: list ).

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

tff(f837,plain,
    $false,
    inference(avatar_sat_refutation,[],[f161,f350,f834]) ).

tff(f834,plain,
    ( spl5_2
    | ~ spl5_3 ),
    inference(avatar_contradiction_clause,[],[f833]) ).

tff(f833,plain,
    ( $false
    | spl5_2
    | ~ spl5_3 ),
    inference(evaluation,[],[f815]) ).

tff(f815,plain,
    ( $less(5,4)
    | spl5_2
    | ~ spl5_3 ),
    inference(backward_demodulation,[],[f387,f814]) ).

tff(f814,plain,
    ( ( 5 = sK0(sF3,4) )
    | spl5_2 ),
    inference(forward_demodulation,[],[f804,f72]) ).

tff(f72,plain,
    5 = head(sF3),
    inference(superposition,[],[f41,f45]) ).

tff(f45,plain,
    cons(5,sF2) = sF3,
    introduced(function_definition,[]) ).

tff(f41,plain,
    ! [X0: list,X1: $int] : ( head(cons(X1,X0)) = X1 ),
    inference(cnf_transformation,[],[f30]) ).

tff(f30,plain,
    ! [X0: list,X1: $int] : ( head(cons(X1,X0)) = X1 ),
    inference(rectify,[],[f1]) ).

tff(f1,axiom,
    ! [X1: list,X0: $int] : ( head(cons(X0,X1)) = X0 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',l1) ).

tff(f804,plain,
    ( ( head(sF3) = sK0(sF3,4) )
    | spl5_2 ),
    inference(superposition,[],[f41,f383]) ).

tff(f383,plain,
    ( ( cons(sK0(sF3,4),sK1(sF3,4)) = sF3 )
    | spl5_2 ),
    inference(backward_demodulation,[],[f378,f382]) ).

tff(f382,plain,
    sF3 = sK1(sF4,4),
    inference(forward_demodulation,[],[f380,f63]) ).

tff(f63,plain,
    tail(sF4) = sF3,
    inference(superposition,[],[f38,f46]) ).

tff(f46,plain,
    sF4 = cons(1,sF3),
    introduced(function_definition,[]) ).

tff(f38,plain,
    ! [X0: $int,X1: list] : ( tail(cons(X0,X1)) = X1 ),
    inference(cnf_transformation,[],[f2]) ).

tff(f2,axiom,
    ! [X0: $int,X1: list] : ( tail(cons(X0,X1)) = X1 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',l2) ).

tff(f380,plain,
    tail(sF4) = sK1(sF4,4),
    inference(superposition,[],[f38,f262]) ).

tff(f262,plain,
    sF4 = cons(sK0(sF4,4),sK1(sF4,4)),
    inference(subsumption_resolution,[],[f260,f50]) ).

tff(f50,plain,
    nil != sF4,
    inference(superposition,[],[f39,f46]) ).

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

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

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

tff(f260,plain,
    ( ( nil = sF4 )
    | ( sF4 = cons(sK0(sF4,4),sK1(sF4,4)) ) ),
    inference(resolution,[],[f33,f47]) ).

tff(f47,plain,
    inRange(4,sF4),
    inference(definition_folding,[],[f37,f46,f45,f44]) ).

tff(f44,plain,
    cons(2,nil) = sF2,
    introduced(function_definition,[]) ).

tff(f37,plain,
    inRange(4,cons(1,cons(5,cons(2,nil)))),
    inference(cnf_transformation,[],[f23]) ).

tff(f23,plain,
    inRange(4,cons(1,cons(5,cons(2,nil)))),
    inference(flattening,[],[f7]) ).

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

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

tff(f33,plain,
    ! [X0: list,X1: $int] :
      ( ~ inRange(X1,X0)
      | ( cons(sK0(X0,X1),sK1(X0,X1)) = X0 )
      | ( nil = X0 ) ),
    inference(cnf_transformation,[],[f28]) ).

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

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

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

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

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

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

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

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

tff(f378,plain,
    ( ( cons(sK0(sK1(sF4,4),4),sK1(sK1(sF4,4),4)) = sK1(sF4,4) )
    | spl5_2 ),
    inference(subsumption_resolution,[],[f375,f154]) ).

tff(f154,plain,
    ( ( nil != sK1(sF4,4) )
    | spl5_2 ),
    inference(avatar_component_clause,[],[f153]) ).

tff(f153,plain,
    ( spl5_2
  <=> ( nil = sK1(sF4,4) ) ),
    introduced(avatar_definition,[new_symbols(naming,[spl5_2])]) ).

tff(f375,plain,
    ( ( cons(sK0(sK1(sF4,4),4),sK1(sK1(sF4,4),4)) = sK1(sF4,4) )
    | ( nil = sK1(sF4,4) ) ),
    inference(resolution,[],[f145,f33]) ).

tff(f145,plain,
    inRange(4,sK1(sF4,4)),
    inference(subsumption_resolution,[],[f143,f50]) ).

tff(f143,plain,
    ( inRange(4,sK1(sF4,4))
    | ( nil = sF4 ) ),
    inference(resolution,[],[f36,f47]) ).

tff(f36,plain,
    ! [X0: list,X1: $int] :
      ( ~ inRange(X1,X0)
      | inRange(X1,sK1(X0,X1))
      | ( nil = X0 ) ),
    inference(cnf_transformation,[],[f28]) ).

tff(f387,plain,
    ( $less(sK0(sF3,4),4)
    | ~ spl5_3 ),
    inference(backward_demodulation,[],[f160,f382]) ).

tff(f160,plain,
    ( $less(sK0(sK1(sF4,4),4),4)
    | ~ spl5_3 ),
    inference(avatar_component_clause,[],[f158]) ).

tff(f158,plain,
    ( spl5_3
  <=> $less(sK0(sK1(sF4,4),4),4) ),
    introduced(avatar_definition,[new_symbols(naming,[spl5_3])]) ).

tff(f350,plain,
    ~ spl5_2,
    inference(avatar_contradiction_clause,[],[f349]) ).

tff(f349,plain,
    ( $false
    | ~ spl5_2 ),
    inference(subsumption_resolution,[],[f348,f49]) ).

tff(f49,plain,
    nil != sF3,
    inference(superposition,[],[f39,f45]) ).

tff(f348,plain,
    ( ( nil = sF3 )
    | ~ spl5_2 ),
    inference(backward_demodulation,[],[f63,f346]) ).

tff(f346,plain,
    ( ( nil = tail(sF4) )
    | ~ spl5_2 ),
    inference(superposition,[],[f38,f263]) ).

tff(f263,plain,
    ( ( sF4 = cons(sK0(sF4,4),nil) )
    | ~ spl5_2 ),
    inference(forward_demodulation,[],[f262,f155]) ).

tff(f155,plain,
    ( ( nil = sK1(sF4,4) )
    | ~ spl5_2 ),
    inference(avatar_component_clause,[],[f153]) ).

tff(f161,plain,
    ( spl5_3
    | spl5_2 ),
    inference(avatar_split_clause,[],[f147,f153,f158]) ).

tff(f147,plain,
    ( ( nil = sK1(sF4,4) )
    | $less(sK0(sK1(sF4,4),4),4) ),
    inference(resolution,[],[f145,f35]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : DAT100=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_sat --cores 0 -t %d %s
% 0.13/0.34  % Computer : n011.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 20:19:25 EDT 2022
% 0.13/0.35  % CPUTime    : 
% 1.37/0.55  % (18060)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)
% 1.37/0.55  % (18037)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 1.37/0.56  % (18052)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)
% 1.37/0.57  % (18044)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)
% 1.37/0.57  % (18053)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)
% 1.71/0.57  % (18039)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)
% 1.71/0.57  % (18039)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 1.71/0.57  % (18039)Terminated due to inappropriate strategy.
% 1.71/0.57  % (18039)------------------------------
% 1.71/0.57  % (18039)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.71/0.57  % (18039)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.71/0.57  % (18039)Termination reason: Inappropriate
% 1.71/0.57  
% 1.71/0.57  % (18039)Memory used [KB]: 895
% 1.71/0.57  % (18039)Time elapsed: 0.004 s
% 1.71/0.57  % (18039)Instructions burned: 2 (million)
% 1.71/0.57  % (18039)------------------------------
% 1.71/0.57  % (18039)------------------------------
% 1.71/0.58  % (18041)dis+2_1:64_add=large:bce=on:bd=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 1.71/0.58  % (18048)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)
% 1.71/0.58  % (18041)Instruction limit reached!
% 1.71/0.58  % (18041)------------------------------
% 1.71/0.58  % (18041)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.71/0.58  % (18041)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.71/0.58  % (18041)Termination reason: Unknown
% 1.71/0.58  % (18041)Termination phase: Clausification
% 1.71/0.58  
% 1.71/0.58  % (18041)Memory used [KB]: 895
% 1.71/0.58  % (18041)Time elapsed: 0.005 s
% 1.71/0.58  % (18041)Instructions burned: 2 (million)
% 1.71/0.58  % (18041)------------------------------
% 1.71/0.58  % (18041)------------------------------
% 1.71/0.58  % (18036)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 1.71/0.58  % (18035)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)
% 1.71/0.59  % (18056)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)
% 1.71/0.59  % (18042)ott-1_1:6_av=off:cond=on:fsr=off:nwc=3.0:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 1.71/0.59  % (18038)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)
% 1.71/0.59  % (18045)ott+10_1:28_bd=off:bs=on:tgt=ground:i=101:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/101Mi)
% 1.71/0.59  % (18055)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)
% 1.71/0.60  % (18047)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)
% 1.71/0.60  % (18034)ott+10_1:32_abs=on:br=off:urr=ec_only:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 1.71/0.60  % (18033)fmb+10_1:1_bce=on:fmbsr=1.5:nm=4:skr=on:i=191324:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/191324Mi)
% 1.71/0.60  % (18033)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 1.71/0.60  % (18033)Terminated due to inappropriate strategy.
% 1.71/0.60  % (18033)------------------------------
% 1.71/0.60  % (18033)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.71/0.60  % (18033)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.71/0.60  % (18033)Termination reason: Inappropriate
% 1.71/0.60  
% 1.71/0.60  % (18033)Memory used [KB]: 895
% 1.71/0.60  % (18033)Time elapsed: 0.002 s
% 1.71/0.60  % (18033)Instructions burned: 1 (million)
% 1.71/0.60  % (18033)------------------------------
% 1.71/0.60  % (18033)------------------------------
% 1.71/0.61  % (18062)ott+10_7:2_awrs=decay:awrsf=8:bd=preordered:drc=off:fd=preordered:fde=unused:fsr=off:slsq=on:slsqc=2:slsqr=5,8:sp=const_min:spb=units:to=lpo:i=355:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/355Mi)
% 1.71/0.61  % (18037)First to succeed.
% 1.71/0.61  % (18040)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 1.71/0.62  % (18051)ott+10_1:1_tgt=ground:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 1.71/0.62  % (18054)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/138Mi)
% 1.71/0.62  % (18059)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)
% 1.71/0.62  % (18058)ott+10_1:5_bd=off:tgt=full:i=500:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/500Mi)
% 1.71/0.62  % (18046)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 1.71/0.63  % (18057)ott+10_1:1_kws=precedence:tgt=ground:i=482:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/482Mi)
% 1.71/0.63  % (18049)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 1.71/0.64  % (18037)Refutation found. Thanks to Tanya!
% 1.71/0.64  % SZS status Theorem for theBenchmark
% 1.71/0.64  % SZS output start Proof for theBenchmark
% See solution above
% 1.71/0.64  % (18037)------------------------------
% 1.71/0.64  % (18037)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.71/0.64  % (18037)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.71/0.64  % (18037)Termination reason: Refutation
% 1.71/0.64  
% 1.71/0.64  % (18037)Memory used [KB]: 5884
% 1.71/0.64  % (18037)Time elapsed: 0.178 s
% 1.71/0.64  % (18037)Instructions burned: 33 (million)
% 1.71/0.64  % (18037)------------------------------
% 1.71/0.64  % (18037)------------------------------
% 1.71/0.64  % (18032)Success in time 0.279 s
%------------------------------------------------------------------------------