TSTP Solution File: DAT078_1 by SnakeForV---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : DAT078_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 : n012.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:06 EDT 2022

% Result   : Theorem 0.19s 0.50s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   23
%            Number of leaves      :   23
% Syntax   : Number of formulae    :   62 (   7 unt;  14 typ;   0 def)
%            Number of atoms       :  218 (  32 equ)
%            Maximal formula atoms :   10 (   4 avg)
%            Number of connectives :  256 (  86   ~;  93   |;  52   &)
%                                         (   6 <=>;  19  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   13 (   8 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number arithmetic     :  348 ( 152 atm;   7 fun;  84 num; 105 var)
%            Number of types       :    3 (   1 usr;   1 ari)
%            Number of type conns  :   29 (  13   >;  16   *;   0   +;   0  <<)
%            Number of predicates  :    9 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :   14 (  10 usr;   3 con; 0-3 aty)
%            Number of variables   :  130 ( 122   !;   8   ?; 130   :)

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

tff(func_def_0,type,
    read: ( array * $int ) > $int ).

tff(func_def_1,type,
    write: ( array * $int * $int ) > array ).

tff(func_def_2,type,
    init: $int > array ).

tff(func_def_3,type,
    max: ( array * $int ) > $int ).

tff(func_def_5,type,
    rev: ( array * $int ) > array ).

tff(func_def_10,type,
    sK0: ( array * $int * array ) > $int ).

tff(func_def_11,type,
    sK1: ( array * array ) > $int ).

tff(func_def_12,type,
    sK2: ( array * $int ) > $int ).

tff(func_def_13,type,
    sK3: ( array * $int ) > $int ).

tff(func_def_14,type,
    sK4: ( $int * $int * array ) > $int ).

tff(pred_def_4,type,
    sorted: ( array * $int ) > $o ).

tff(pred_def_6,type,
    inRange: ( array * $int * $int ) > $o ).

tff(pred_def_7,type,
    distinct: ( array * $int ) > $o ).

tff(f193,plain,
    $false,
    inference(evaluation,[],[f190]) ).

tff(f190,plain,
    ~ $less(0,2),
    inference(resolution,[],[f180,f23]) ).

tff(f23,plain,
    ! [X0: $int] : ~ $less(X0,X0),
    introduced(theory_axiom_147,[]) ).

tff(f180,plain,
    ! [X5: $int] :
      ( $less(X5,2)
      | ~ $less(0,X5) ),
    inference(evaluation,[],[f172]) ).

tff(f172,plain,
    ! [X5: $int] :
      ( ~ $less(0,X5)
      | $less(X5,$sum(1,1)) ),
    inference(resolution,[],[f166,f27]) ).

tff(f27,plain,
    ! [X0: $int,X1: $int] :
      ( $less(X1,$sum(X0,1))
      | $less(X0,X1) ),
    introduced(theory_axiom_152,[]) ).

tff(f166,plain,
    ! [X0: $int] :
      ( ~ $less(1,X0)
      | ~ $less(0,X0) ),
    inference(evaluation,[],[f157]) ).

tff(f157,plain,
    ! [X0: $int] :
      ( ( 0 = 1 )
      | ~ $less(0,X0)
      | $less(1,0)
      | ~ $less(1,X0) ),
    inference(resolution,[],[f153,f27]) ).

tff(f153,plain,
    ! [X0: $int,X1: $int] :
      ( ~ $less(0,$sum(1,X0))
      | ~ $less(X0,X1)
      | ~ $less(0,X1)
      | ( 0 = X0 ) ),
    inference(superposition,[],[f136,f18]) ).

tff(f18,plain,
    ! [X0: $int,X1: $int] : ( $sum(X0,X1) = $sum(X1,X0) ),
    introduced(theory_axiom_140,[]) ).

tff(f136,plain,
    ! [X10: $int,X9: $int] :
      ( ~ $less(0,$sum(X10,1))
      | ( 0 = X10 )
      | ~ $less(X10,X9)
      | ~ $less(0,X9) ),
    inference(resolution,[],[f131,f29]) ).

tff(f29,plain,
    ! [X0: $int,X1: $int] :
      ( ~ $less(X0,X1)
      | ~ $less(X1,$sum(X0,1)) ),
    introduced(theory_axiom_166,[]) ).

tff(f131,plain,
    ! [X38: $int,X37: $int] :
      ( $less(X38,0)
      | ~ $less(0,X37)
      | ~ $less(X38,X37)
      | ( 0 = X38 ) ),
    inference(duplicate_literal_removal,[],[f125]) ).

tff(f125,plain,
    ! [X38: $int,X37: $int] :
      ( ~ $less(X38,X37)
      | ~ $less(0,X37)
      | ~ $less(0,X37)
      | ( 0 = X38 )
      | $less(X38,0) ),
    inference(resolution,[],[f115,f23]) ).

tff(f115,plain,
    ! [X14: $int,X12: $int,X13: $int] :
      ( $less(X13,0)
      | ~ $less(0,X14)
      | ~ $less(X13,X14)
      | ~ $less(X12,X14)
      | $less(X12,0)
      | ( X12 = X13 ) ),
    inference(subsumption_resolution,[],[f114,f23]) ).

tff(f114,plain,
    ! [X14: $int,X15: $int,X12: $int,X13: $int] :
      ( ( X12 = X13 )
      | ~ $less(0,X14)
      | $less(X12,0)
      | $less(X15,X15)
      | ~ $less(X12,X14)
      | ~ $less(X13,X14)
      | $less(X13,0) ),
    inference(forward_demodulation,[],[f113,f68]) ).

tff(f68,plain,
    ! [X0: $int,X1: $int] : ( read(init(X0),X1) = X0 ),
    inference(cnf_transformation,[],[f35]) ).

tff(f35,plain,
    ! [X0: $int,X1: $int] : ( read(init(X0),X1) = X0 ),
    inference(rectify,[],[f4]) ).

tff(f4,axiom,
    ! [X2: $int,X1: $int] : ( read(init(X2),X1) = X2 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax3) ).

tff(f113,plain,
    ! [X14: $int,X15: $int,X12: $int,X13: $int] :
      ( ( X12 = X13 )
      | $less(read(init(X15),sK2(init(X15),X14)),X15)
      | ~ $less(X13,X14)
      | ~ $less(0,X14)
      | ~ $less(X12,X14)
      | $less(X13,0)
      | $less(X12,0) ),
    inference(forward_demodulation,[],[f111,f68]) ).

tff(f111,plain,
    ! [X14: $int,X15: $int,X12: $int,X13: $int] :
      ( ( X12 = X13 )
      | ~ $less(X12,X14)
      | ~ $less(X13,X14)
      | ~ $less(0,X14)
      | $less(read(init(X15),sK2(init(X15),X14)),read(init(X15),sK3(init(X15),X14)))
      | $less(X12,0)
      | $less(X13,0) ),
    inference(resolution,[],[f106,f75]) ).

tff(f75,plain,
    ! [X0: array,X1: $int] :
      ( sorted(X0,X1)
      | $less(read(X0,sK2(X0,X1)),read(X0,sK3(X0,X1))) ),
    inference(cnf_transformation,[],[f60]) ).

tff(f60,plain,
    ! [X0: array,X1: $int] :
      ( ( $less(sK3(X0,X1),X1)
        & ~ $less(sK3(X0,X1),0)
        & $less(read(X0,sK2(X0,X1)),read(X0,sK3(X0,X1)))
        & $less(sK3(X0,X1),sK2(X0,X1))
        & $less(sK2(X0,X1),X1) )
      | sorted(X0,X1) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3])],[f58,f59]) ).

tff(f59,plain,
    ! [X0: array,X1: $int] :
      ( ? [X2: $int,X3: $int] :
          ( $less(X3,X1)
          & ~ $less(X3,0)
          & $less(read(X0,X2),read(X0,X3))
          & $less(X3,X2)
          & $less(X2,X1) )
     => ( $less(sK3(X0,X1),X1)
        & ~ $less(sK3(X0,X1),0)
        & $less(read(X0,sK2(X0,X1)),read(X0,sK3(X0,X1)))
        & $less(sK3(X0,X1),sK2(X0,X1))
        & $less(sK2(X0,X1),X1) ) ),
    introduced(choice_axiom,[]) ).

tff(f58,plain,
    ! [X0: array,X1: $int] :
      ( ? [X2: $int,X3: $int] :
          ( $less(X3,X1)
          & ~ $less(X3,0)
          & $less(read(X0,X2),read(X0,X3))
          & $less(X3,X2)
          & $less(X2,X1) )
      | sorted(X0,X1) ),
    inference(rectify,[],[f48]) ).

tff(f48,plain,
    ! [X0: array,X1: $int] :
      ( ? [X3: $int,X2: $int] :
          ( $less(X2,X1)
          & ~ $less(X2,0)
          & $less(read(X0,X3),read(X0,X2))
          & $less(X2,X3)
          & $less(X3,X1) )
      | sorted(X0,X1) ),
    inference(flattening,[],[f47]) ).

tff(f47,plain,
    ! [X0: array,X1: $int] :
      ( sorted(X0,X1)
      | ? [X2: $int,X3: $int] :
          ( $less(read(X0,X3),read(X0,X2))
          & $less(X2,X1)
          & $less(X3,X1)
          & ~ $less(X2,0)
          & $less(X2,X3) ) ),
    inference(ennf_transformation,[],[f41]) ).

tff(f41,plain,
    ! [X0: array,X1: $int] :
      ( ! [X2: $int,X3: $int] :
          ( ( $less(X2,X1)
            & $less(X3,X1)
            & ~ $less(X2,0)
            & $less(X2,X3) )
         => ~ $less(read(X0,X3),read(X0,X2)) )
     => sorted(X0,X1) ),
    inference(unused_predicate_definition_removal,[],[f36]) ).

tff(f36,plain,
    ! [X0: array,X1: $int] :
      ( ! [X2: $int,X3: $int] :
          ( ( $less(X2,X1)
            & $less(X3,X1)
            & ~ $less(X2,0)
            & $less(X2,X3) )
         => ~ $less(read(X0,X3),read(X0,X2)) )
    <=> sorted(X0,X1) ),
    inference(rectify,[],[f15]) ).

tff(f15,plain,
    ! [X0: array,X5: $int] :
      ( ! [X1: $int,X3: $int] :
          ( ( ~ $less(X1,0)
            & $less(X1,X5)
            & $less(X3,X5)
            & $less(X1,X3) )
         => ~ $less(read(X0,X3),read(X0,X1)) )
    <=> sorted(X0,X5) ),
    inference(theory_normalization,[],[f6]) ).

tff(f6,axiom,
    ! [X0: array,X5: $int] :
      ( ! [X1: $int,X3: $int] :
          ( ( $lesseq(0,X1)
            & $less(X1,X5)
            & $less(X3,X5)
            & $less(X1,X3) )
         => $lesseq(read(X0,X1),read(X0,X3)) )
    <=> sorted(X0,X5) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sorted1) ).

tff(f106,plain,
    ! [X2: $int,X3: $int,X0: $int,X1: $int] :
      ( ~ sorted(init(X0),X3)
      | $less(X2,0)
      | ( X1 = X2 )
      | $less(X1,0)
      | ~ $less(0,X3)
      | ~ $less(X1,X3)
      | ~ $less(X2,X3) ),
    inference(subsumption_resolution,[],[f92,f68]) ).

tff(f92,plain,
    ! [X2: $int,X3: $int,X0: $int,X1: $int] :
      ( ( read(init(X0),X2) != X0 )
      | $less(X2,0)
      | $less(X1,0)
      | ~ $less(0,X3)
      | ~ sorted(init(X0),X3)
      | ~ $less(X2,X3)
      | ~ $less(X1,X3)
      | ( X1 = X2 ) ),
    inference(superposition,[],[f85,f68]) ).

tff(f85,plain,
    ! [X2: $int,X3: $int,X0: $int,X1: array] :
      ( ( read(X1,X3) != read(X1,X2) )
      | $less(X2,0)
      | ( X2 = X3 )
      | $less(X3,0)
      | ~ $less(X3,X0)
      | ~ $less(0,X0)
      | ~ $less(X2,X0)
      | ~ sorted(X1,X0) ),
    inference(resolution,[],[f71,f70]) ).

tff(f70,plain,
    ! [X2: $int,X3: $int,X0: array,X1: $int] :
      ( $less(X2,0)
      | ~ $less(X3,X1)
      | ( X2 = X3 )
      | ~ distinct(X0,X1)
      | $less(X3,0)
      | ( read(X0,X3) != read(X0,X2) )
      | ~ $less(X2,X1) ),
    inference(cnf_transformation,[],[f50]) ).

tff(f50,plain,
    ! [X0: array,X1: $int] :
      ( ~ distinct(X0,X1)
      | ! [X2: $int,X3: $int] :
          ( ( X2 = X3 )
          | ( read(X0,X3) != read(X0,X2) )
          | ~ $less(X2,X1)
          | $less(X2,0)
          | ~ $less(X3,X1)
          | $less(X3,0) ) ),
    inference(flattening,[],[f49]) ).

tff(f49,plain,
    ! [X0: array,X1: $int] :
      ( ! [X3: $int,X2: $int] :
          ( ( X2 = X3 )
          | ( read(X0,X3) != read(X0,X2) )
          | ~ $less(X3,X1)
          | ~ $less(X2,X1)
          | $less(X3,0)
          | $less(X2,0) )
      | ~ distinct(X0,X1) ),
    inference(ennf_transformation,[],[f40]) ).

tff(f40,plain,
    ! [X0: array,X1: $int] :
      ( distinct(X0,X1)
     => ! [X3: $int,X2: $int] :
          ( ( $less(X3,X1)
            & $less(X2,X1)
            & ~ $less(X3,0)
            & ~ $less(X2,0) )
         => ( ( read(X0,X3) = read(X0,X2) )
           => ( X2 = X3 ) ) ) ),
    inference(unused_predicate_definition_removal,[],[f30]) ).

tff(f30,plain,
    ! [X0: array,X1: $int] :
      ( distinct(X0,X1)
    <=> ! [X3: $int,X2: $int] :
          ( ( $less(X3,X1)
            & $less(X2,X1)
            & ~ $less(X3,0)
            & ~ $less(X2,0) )
         => ( ( read(X0,X3) = read(X0,X2) )
           => ( X2 = X3 ) ) ) ),
    inference(rectify,[],[f12]) ).

tff(f12,plain,
    ! [X0: array,X5: $int] :
      ( distinct(X0,X5)
    <=> ! [X1: $int,X3: $int] :
          ( ( $less(X3,X5)
            & ~ $less(X3,0)
            & $less(X1,X5)
            & ~ $less(X1,0) )
         => ( ( read(X0,X3) = read(X0,X1) )
           => ( X1 = X3 ) ) ) ),
    inference(theory_normalization,[],[f8]) ).

tff(f8,axiom,
    ! [X0: array,X5: $int] :
      ( distinct(X0,X5)
    <=> ! [X1: $int,X3: $int] :
          ( ( $greater(X5,X3)
            & $greatereq(X3,0)
            & $greater(X5,X1)
            & $greatereq(X1,0) )
         => ( ( read(X0,X3) = read(X0,X1) )
           => ( X1 = X3 ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',distinct) ).

tff(f71,plain,
    ! [X0: array,X1: $int] :
      ( distinct(X0,X1)
      | ~ $less(0,X1)
      | ~ sorted(X0,X1) ),
    inference(cnf_transformation,[],[f43]) ).

tff(f43,plain,
    ! [X0: array,X1: $int] :
      ( ~ $less(0,X1)
      | distinct(X0,X1)
      | ~ sorted(X0,X1) ),
    inference(flattening,[],[f42]) ).

tff(f42,plain,
    ! [X0: array,X1: $int] :
      ( distinct(X0,X1)
      | ~ $less(0,X1)
      | ~ sorted(X0,X1) ),
    inference(ennf_transformation,[],[f38]) ).

tff(f38,plain,
    ! [X0: array,X1: $int] :
      ( ( $less(0,X1)
        & sorted(X0,X1) )
     => distinct(X0,X1) ),
    inference(rectify,[],[f16]) ).

tff(f16,plain,
    ! [X0: array,X5: $int] :
      ( ( $less(0,X5)
        & sorted(X0,X5) )
     => distinct(X0,X5) ),
    inference(theory_normalization,[],[f11]) ).

tff(f11,negated_conjecture,
    ~ ~ ! [X0: array,X5: $int] :
          ( ( $greater(X5,0)
            & sorted(X0,X5) )
         => distinct(X0,X5) ),
    inference(negated_conjecture,[],[f10]) ).

tff(f10,conjecture,
    ~ ! [X0: array,X5: $int] :
        ( ( $greater(X5,0)
          & sorted(X0,X5) )
       => distinct(X0,X5) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c6) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem    : DAT078=1 : TPTP v8.1.0. Released v6.1.0.
% 0.12/0.12  % 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.33  % Computer : n012.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:06 EDT 2022
% 0.12/0.33  % CPUTime    : 
% 0.19/0.47  % (8692)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.48  % (8697)lrs+10_1:1_ep=R:gve=force:plsq=on:plsqr=32,1:uwa=one_side_interpreted:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.19/0.48  % (8689)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.19/0.49  % (8693)lrs+1010_1:1_ep=RST:s2a=on:s2at=5.0:sos=all:i=26:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/26Mi)
% 0.19/0.49  % (8707)dis+1002_1:5_av=off:nwc=2.0:sos=all:i=15:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/15Mi)
% 0.19/0.49  % (8690)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)
% 0.19/0.49  % (8697)Instruction limit reached!
% 0.19/0.49  % (8697)------------------------------
% 0.19/0.49  % (8697)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.49  % (8697)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.49  % (8697)Termination reason: Unknown
% 0.19/0.49  % (8697)Termination phase: Saturation
% 0.19/0.49  
% 0.19/0.49  % (8697)Memory used [KB]: 1023
% 0.19/0.49  % (8697)Time elapsed: 0.005 s
% 0.19/0.49  % (8697)Instructions burned: 4 (million)
% 0.19/0.49  % (8697)------------------------------
% 0.19/0.49  % (8697)------------------------------
% 0.19/0.49  % (8685)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.19/0.49  % (8688)ott+21_1:1_erd=off:s2a=on:sac=on:sd=1:sgt=64:sos=on:ss=included:st=3.0:to=lpo:urr=on:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.19/0.49  % (8712)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)
% 0.19/0.49  % (8688)Instruction limit reached!
% 0.19/0.49  % (8688)------------------------------
% 0.19/0.49  % (8688)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.49  % (8688)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.49  % (8688)Termination reason: Unknown
% 0.19/0.49  % (8688)Termination phase: Including theory axioms
% 0.19/0.49  
% 0.19/0.49  % (8688)Memory used [KB]: 895
% 0.19/0.49  % (8688)Time elapsed: 0.003 s
% 0.19/0.49  % (8688)Instructions burned: 2 (million)
% 0.19/0.49  % (8688)------------------------------
% 0.19/0.49  % (8688)------------------------------
% 0.19/0.49  % (8696)dis+32_1:1_bd=off:nm=4:sos=on:ss=included:i=4:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/4Mi)
% 0.19/0.50  % (8712)Refutation not found, incomplete strategy% (8712)------------------------------
% 0.19/0.50  % (8712)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.50  % (8712)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.50  % (8712)Termination reason: Refutation not found, incomplete strategy
% 0.19/0.50  
% 0.19/0.50  % (8712)Memory used [KB]: 5628
% 0.19/0.50  % (8712)Time elapsed: 0.080 s
% 0.19/0.50  % (8712)Instructions burned: 5 (million)
% 0.19/0.50  % (8712)------------------------------
% 0.19/0.50  % (8712)------------------------------
% 0.19/0.50  % (8696)Refutation not found, incomplete strategy% (8696)------------------------------
% 0.19/0.50  % (8696)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.50  % (8696)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.50  % (8696)Termination reason: Refutation not found, incomplete strategy
% 0.19/0.50  
% 0.19/0.50  % (8706)lrs+10_1:1_sd=10:sos=all:ss=axioms:st=5.0:tha=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.19/0.50  % (8696)Memory used [KB]: 5500
% 0.19/0.50  % (8696)Time elapsed: 0.117 s
% 0.19/0.50  % (8696)Instructions burned: 3 (million)
% 0.19/0.50  % (8696)------------------------------
% 0.19/0.50  % (8696)------------------------------
% 0.19/0.50  % (8707)First to succeed.
% 0.19/0.50  % (8707)Refutation found. Thanks to Tanya!
% 0.19/0.50  % SZS status Theorem for theBenchmark
% 0.19/0.50  % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.50  % (8707)------------------------------
% 0.19/0.50  % (8707)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.50  % (8707)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.50  % (8707)Termination reason: Refutation
% 0.19/0.50  
% 0.19/0.50  % (8707)Memory used [KB]: 1151
% 0.19/0.50  % (8707)Time elapsed: 0.115 s
% 0.19/0.50  % (8707)Instructions burned: 13 (million)
% 0.19/0.50  % (8707)------------------------------
% 0.19/0.50  % (8707)------------------------------
% 0.19/0.50  % (8684)Success in time 0.155 s
%------------------------------------------------------------------------------