TSTP Solution File: ARI734_1 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : ARI734_1 : TPTP v8.2.0. Released v6.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s

% Computer : n008.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 : Mon May 20 18:49:01 EDT 2024

% Result   : Theorem 0.56s 0.68s
% Output   : Refutation 0.56s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :   22
% Syntax   : Number of formulae    :   60 (  14 unt;   9 typ;   0 def)
%            Number of atoms       :  156 (  78 equ)
%            Maximal formula atoms :   16 (   3 avg)
%            Number of connectives :  191 (  86   ~;  67   |;  24   &)
%                                         (   4 <=>;  10  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   4 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number arithmetic     :  268 (   7 atm;  87 fun; 117 num;  57 var)
%            Number of types       :    2 (   0 usr;   1 ari)
%            Number of type conns  :    8 (   8   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :   16 (  12 usr;   5 prp; 0-2 aty)
%            Number of functors    :    9 (   1 usr;   5 con; 0-2 aty)
%            Number of variables   :   57 (  46   !;  11   ?;  57   :)

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

tff(pred_def_3,type,
    sP1: $int > $o ).

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

tff(pred_def_5,type,
    sP3: $int > $o ).

tff(pred_def_6,type,
    sP4: $int > $o ).

tff(pred_def_7,type,
    sP5: $int > $o ).

tff(pred_def_8,type,
    sP6: $int > $o ).

tff(pred_def_9,type,
    sP7: $int > $o ).

tff(pred_def_10,type,
    sP8: $int > $o ).

tff(f1160,plain,
    $false,
    inference(avatar_sat_refutation,[],[f64,f72,f144,f906,f1159]) ).

tff(f1159,plain,
    ( ~ spl9_1
    | ~ spl9_3 ),
    inference(avatar_contradiction_clause,[],[f1158]) ).

tff(f1158,plain,
    ( $false
    | ~ spl9_1
    | ~ spl9_3 ),
    inference(subsumption_resolution,[],[f1152,f67]) ).

tff(f67,plain,
    ( ! [X3: $int] : sP6(X3)
    | ~ spl9_3 ),
    inference(avatar_component_clause,[],[f66]) ).

tff(f66,plain,
    ( spl9_3
  <=> ! [X3: $int] : sP6(X3) ),
    introduced(avatar_definition,[new_symbols(naming,[spl9_3])]) ).

tff(f1152,plain,
    ( ~ sP6(-1)
    | ~ spl9_1 ),
    inference(evaluation,[],[f946]) ).

tff(f946,plain,
    ( ~ sP6($sum(-1,0))
    | ~ spl9_1 ),
    inference(backward_demodulation,[],[f74,f60]) ).

tff(f60,plain,
    ( ( 0 = sK0 )
    | ~ spl9_1 ),
    inference(avatar_component_clause,[],[f58]) ).

tff(f58,plain,
    ( spl9_1
  <=> ( 0 = sK0 ) ),
    introduced(avatar_definition,[new_symbols(naming,[spl9_1])]) ).

tff(f74,plain,
    ~ sP6($sum(-1,sK0)),
    inference(forward_demodulation,[],[f52,f4]) ).

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

tff(f52,plain,
    ~ sP6($sum(sK0,-1)),
    inference(evaluation,[],[f37]) ).

tff(f37,plain,
    ~ sP6($sum(sK0,$uminus(1))),
    introduced(inequality_splitting_name_introduction,[new_symbols(naming,[sP6])]) ).

tff(f906,plain,
    ~ spl9_2,
    inference(avatar_contradiction_clause,[],[f905]) ).

tff(f905,plain,
    ( $false
    | ~ spl9_2 ),
    inference(subsumption_resolution,[],[f903,f33]) ).

tff(f33,plain,
    ~ sP3($product(2,sK0)),
    introduced(inequality_splitting_name_introduction,[new_symbols(naming,[sP3])]) ).

tff(f903,plain,
    ( sP3($product(2,sK0))
    | ~ spl9_2 ),
    inference(evaluation,[],[f902]) ).

tff(f902,plain,
    ( sP3($product(2,$sum(1,$sum(-1,sK0))))
    | ~ spl9_2 ),
    inference(backward_demodulation,[],[f145,f879]) ).

tff(f879,plain,
    ! [X0: $int,X1: $int] : ( $product(X0,$sum(1,X1)) = $sum(X0,$product(X0,X1)) ),
    inference(superposition,[],[f19,f17]) ).

tff(f17,plain,
    ! [X0: $int] : ( $product(X0,1) = X0 ),
    introduced(theory_axiom_137,[]) ).

tff(f19,plain,
    ! [X2: $int,X0: $int,X1: $int] : ( $product(X0,$sum(X1,X2)) = $sum($product(X0,X1),$product(X0,X2)) ),
    introduced(theory_axiom_150,[]) ).

tff(f145,plain,
    ( sP3($sum(2,$product(2,$sum(-1,sK0))))
    | ~ spl9_2 ),
    inference(unit_resulting_resolution,[],[f75,f63]) ).

tff(f63,plain,
    ( ! [X3: $int] :
        ( sP3($sum(2,$product(2,X3)))
        | sP4(X3) )
    | ~ spl9_2 ),
    inference(avatar_component_clause,[],[f62]) ).

tff(f62,plain,
    ( spl9_2
  <=> ! [X3: $int] :
        ( sP3($sum(2,$product(2,X3)))
        | sP4(X3) ) ),
    introduced(avatar_definition,[new_symbols(naming,[spl9_2])]) ).

tff(f75,plain,
    ~ sP4($sum(-1,sK0)),
    inference(forward_demodulation,[],[f51,f4]) ).

tff(f51,plain,
    ~ sP4($sum(sK0,-1)),
    inference(evaluation,[],[f34]) ).

tff(f34,plain,
    ~ sP4($sum(sK0,$uminus(1))),
    introduced(inequality_splitting_name_introduction,[new_symbols(naming,[sP4])]) ).

tff(f144,plain,
    ( ~ spl9_1
    | ~ spl9_4 ),
    inference(avatar_contradiction_clause,[],[f143]) ).

tff(f143,plain,
    ( $false
    | ~ spl9_1
    | ~ spl9_4 ),
    inference(subsumption_resolution,[],[f140,f71]) ).

tff(f71,plain,
    ( sP5(0)
    | ~ spl9_4 ),
    inference(avatar_component_clause,[],[f69]) ).

tff(f69,plain,
    ( spl9_4
  <=> sP5(0) ),
    introduced(avatar_definition,[new_symbols(naming,[spl9_4])]) ).

tff(f140,plain,
    ( ~ sP5(0)
    | ~ spl9_1 ),
    inference(evaluation,[],[f129]) ).

tff(f129,plain,
    ( ~ sP5($product(2,0))
    | ~ spl9_1 ),
    inference(backward_demodulation,[],[f36,f60]) ).

tff(f36,plain,
    ~ sP5($product(2,sK0)),
    introduced(inequality_splitting_name_introduction,[new_symbols(naming,[sP5])]) ).

tff(f72,plain,
    ( spl9_3
    | ~ spl9_1
    | spl9_4 ),
    inference(avatar_split_clause,[],[f48,f69,f58,f66]) ).

tff(f48,plain,
    ! [X3: $int] :
      ( sP5(0)
      | ( 0 != sK0 )
      | sP6(X3) ),
    inference(equality_resolution,[],[f47]) ).

tff(f47,plain,
    ! [X2: $int,X3: $int] :
      ( sP5(0)
      | ( 0 != sK0 )
      | ( $product(2,X3) != X2 )
      | sP6(X3) ),
    inference(equality_resolution,[],[f38]) ).

tff(f38,plain,
    ! [X2: $int,X3: $int,X1: $int] :
      ( sP5(X1)
      | ( 0 != sK0 )
      | ( 0 != X1 )
      | ( $product(2,X3) != X2 )
      | sP6(X3) ),
    inference(inequality_splitting,[],[f27,f37,f36]) ).

tff(f27,plain,
    ! [X2: $int,X3: $int,X1: $int] :
      ( ( $product(2,sK0) != X1 )
      | ( 0 != sK0 )
      | ( 0 != X1 )
      | ( $product(2,X3) != X2 )
      | ( $sum(sK0,$uminus(1)) != X3 ) ),
    inference(cnf_transformation,[],[f24]) ).

tff(f24,plain,
    ( ! [X1: $int] :
        ( ( $product(2,sK0) != X1 )
        | ! [X2: $int] :
            ( ( ( $sum(X2,2) != X1 )
              & ( 0 != sK0 ) )
            | ( ( 0 != X1 )
              & ( 0 = sK0 ) )
            | ! [X3: $int] :
                ( ( $product(2,X3) != X2 )
                | ( $sum(sK0,$uminus(1)) != X3 ) ) ) )
    & ~ $less(sK0,0) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f22,f23]) ).

tff(f23,plain,
    ( ? [X0: $int] :
        ( ! [X1: $int] :
            ( ( $product(2,X0) != X1 )
            | ! [X2: $int] :
                ( ( ( $sum(X2,2) != X1 )
                  & ( 0 != X0 ) )
                | ( ( 0 != X1 )
                  & ( 0 = X0 ) )
                | ! [X3: $int] :
                    ( ( $product(2,X3) != X2 )
                    | ( $sum(X0,$uminus(1)) != X3 ) ) ) )
        & ~ $less(X0,0) )
   => ( ! [X1: $int] :
          ( ( $product(2,sK0) != X1 )
          | ! [X2: $int] :
              ( ( ( $sum(X2,2) != X1 )
                & ( 0 != sK0 ) )
              | ( ( 0 != X1 )
                & ( 0 = sK0 ) )
              | ! [X3: $int] :
                  ( ( $product(2,X3) != X2 )
                  | ( $sum(sK0,$uminus(1)) != X3 ) ) ) )
      & ~ $less(sK0,0) ) ),
    introduced(choice_axiom,[]) ).

tff(f22,plain,
    ? [X0: $int] :
      ( ! [X1: $int] :
          ( ( $product(2,X0) != X1 )
          | ! [X2: $int] :
              ( ( ( $sum(X2,2) != X1 )
                & ( 0 != X0 ) )
              | ( ( 0 != X1 )
                & ( 0 = X0 ) )
              | ! [X3: $int] :
                  ( ( $product(2,X3) != X2 )
                  | ( $sum(X0,$uminus(1)) != X3 ) ) ) )
      & ~ $less(X0,0) ),
    inference(ennf_transformation,[],[f3]) ).

tff(f3,plain,
    ~ ! [X0: $int] :
        ( ~ $less(X0,0)
       => ? [X1: $int] :
            ( ( $product(2,X0) = X1 )
            & ? [X2: $int] :
                ( ( ( 0 != X0 )
                 => ( $sum(X2,2) = X1 ) )
                & ( ( 0 = X0 )
                 => ( 0 = X1 ) )
                & ? [X3: $int] :
                    ( ( $product(2,X3) = X2 )
                    & ( $sum(X0,$uminus(1)) = X3 ) ) ) ) ),
    inference(theory_normalization,[],[f2]) ).

tff(f2,negated_conjecture,
    ~ ! [X0: $int] :
        ( $greatereq(X0,0)
       => ? [X1: $int] :
            ( ( $product(2,X0) = X1 )
            & ? [X2: $int] :
                ( ( ( 0 != X0 )
                 => ( $sum(X2,2) = X1 ) )
                & ( ( 0 = X0 )
                 => ( 0 = X1 ) )
                & ? [X3: $int] :
                    ( ( $product(2,X3) = X2 )
                    & ( $difference(X0,1) = X3 ) ) ) ) ),
    inference(negated_conjecture,[],[f1]) ).

tff(f1,conjecture,
    ! [X0: $int] :
      ( $greatereq(X0,0)
     => ? [X1: $int] :
          ( ( $product(2,X0) = X1 )
          & ? [X2: $int] :
              ( ( ( 0 != X0 )
               => ( $sum(X2,2) = X1 ) )
              & ( ( 0 = X0 )
               => ( 0 = X1 ) )
              & ? [X3: $int] :
                  ( ( $product(2,X3) = X2 )
                  & ( $difference(X0,1) = X3 ) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',formula) ).

tff(f64,plain,
    ( spl9_1
    | spl9_2 ),
    inference(avatar_split_clause,[],[f56,f62,f58]) ).

tff(f56,plain,
    ! [X3: $int] :
      ( sP3($sum(2,$product(2,X3)))
      | ( 0 = sK0 )
      | sP4(X3) ),
    inference(forward_demodulation,[],[f46,f4]) ).

tff(f46,plain,
    ! [X3: $int] :
      ( sP3($sum($product(2,X3),2))
      | ( 0 = sK0 )
      | sP4(X3) ),
    inference(equality_resolution,[],[f45]) ).

tff(f45,plain,
    ! [X2: $int,X3: $int] :
      ( sP3($sum(X2,2))
      | ( 0 = sK0 )
      | ( $product(2,X3) != X2 )
      | sP4(X3) ),
    inference(equality_resolution,[],[f35]) ).

tff(f35,plain,
    ! [X2: $int,X3: $int,X1: $int] :
      ( sP3(X1)
      | ( $sum(X2,2) != X1 )
      | ( 0 = sK0 )
      | ( $product(2,X3) != X2 )
      | sP4(X3) ),
    inference(inequality_splitting,[],[f28,f34,f33]) ).

tff(f28,plain,
    ! [X2: $int,X3: $int,X1: $int] :
      ( ( $product(2,sK0) != X1 )
      | ( $sum(X2,2) != X1 )
      | ( 0 = sK0 )
      | ( $product(2,X3) != X2 )
      | ( $sum(sK0,$uminus(1)) != X3 ) ),
    inference(cnf_transformation,[],[f24]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem    : ARI734_1 : TPTP v8.2.0. Released v6.4.0.
% 0.03/0.12  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.12/0.33  % Computer : n008.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   : Sun May 19 13:21:23 EDT 2024
% 0.12/0.33  % CPUTime    : 
% 0.12/0.33  This is a TF0_THM_EQU_ARI problem
% 0.12/0.34  Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.48/0.64  % (15992)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on theBenchmark for (2997ds/56Mi)
% 0.48/0.64  % (15985)dis-1011_2:1_sil=2000:lsd=20:nwc=5.0:flr=on:mep=off:st=3.0:i=34:sd=1:ep=RS:ss=axioms_0 on theBenchmark for (2997ds/34Mi)
% 0.48/0.64  % (15987)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2997ds/78Mi)
% 0.48/0.64  % (15986)lrs+1011_461:32768_sil=16000:irw=on:sp=frequency:lsd=20:fd=preordered:nwc=10.0:s2agt=32:alpa=false:cond=fast:s2a=on:i=51:s2at=3.0:awrs=decay:awrsf=691:bd=off:nm=20:fsr=off:amm=sco:uhcvi=on:rawr=on_0 on theBenchmark for (2997ds/51Mi)
% 0.48/0.64  % (15989)lrs+2_1:1_sil=16000:fde=none:sos=all:nwc=5.0:i=34:ep=RS:s2pl=on:lma=on:afp=100000_0 on theBenchmark for (2997ds/34Mi)
% 0.48/0.64  % (15988)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2997ds/33Mi)
% 0.48/0.64  % (15990)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2997ds/45Mi)
% 0.48/0.64  % (15991)lrs+21_1:5_sil=2000:sos=on:urr=on:newcnf=on:slsq=on:i=83:slsql=off:bd=off:nm=2:ss=axioms:st=1.5:sp=const_min:gsp=on:rawr=on_0 on theBenchmark for (2997ds/83Mi)
% 0.48/0.65  % (15992)Instruction limit reached!
% 0.48/0.65  % (15992)------------------------------
% 0.48/0.65  % (15992)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.48/0.65  % (15992)Termination reason: Unknown
% 0.48/0.65  % (15992)Termination phase: Saturation
% 0.48/0.65  
% 0.48/0.65  % (15992)Memory used [KB]: 1183
% 0.48/0.65  % (15992)Time elapsed: 0.018 s
% 0.48/0.65  % (15992)Instructions burned: 57 (million)
% 0.48/0.65  % (15992)------------------------------
% 0.48/0.65  % (15992)------------------------------
% 0.48/0.66  % (15993)lrs+21_1:16_sil=2000:sp=occurrence:urr=on:flr=on:i=55:sd=1:nm=0:ins=3:ss=included:rawr=on:br=off_0 on theBenchmark for (2996ds/55Mi)
% 0.48/0.66  % (15988)Instruction limit reached!
% 0.48/0.66  % (15988)------------------------------
% 0.48/0.66  % (15988)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.48/0.66  % (15988)Termination reason: Unknown
% 0.48/0.66  % (15988)Termination phase: Saturation
% 0.48/0.66  
% 0.48/0.66  % (15988)Memory used [KB]: 1306
% 0.48/0.66  % (15988)Time elapsed: 0.020 s
% 0.48/0.66  % (15988)Instructions burned: 33 (million)
% 0.48/0.66  % (15988)------------------------------
% 0.48/0.66  % (15988)------------------------------
% 0.48/0.66  % (15985)Instruction limit reached!
% 0.48/0.66  % (15985)------------------------------
% 0.48/0.66  % (15985)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.48/0.66  % (15985)Termination reason: Unknown
% 0.48/0.66  % (15985)Termination phase: Saturation
% 0.48/0.66  
% 0.48/0.66  % (15985)Memory used [KB]: 1166
% 0.48/0.66  % (15985)Time elapsed: 0.021 s
% 0.48/0.66  % (15985)Instructions burned: 34 (million)
% 0.48/0.66  % (15985)------------------------------
% 0.48/0.66  % (15985)------------------------------
% 0.48/0.66  % (15989)Instruction limit reached!
% 0.48/0.66  % (15989)------------------------------
% 0.48/0.66  % (15989)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.48/0.66  % (15989)Termination reason: Unknown
% 0.48/0.66  % (15989)Termination phase: Saturation
% 0.48/0.66  
% 0.48/0.66  % (15989)Memory used [KB]: 1197
% 0.48/0.66  % (15989)Time elapsed: 0.021 s
% 0.48/0.66  % (15989)Instructions burned: 34 (million)
% 0.48/0.66  % (15989)------------------------------
% 0.48/0.66  % (15989)------------------------------
% 0.48/0.66  % (15994)dis+3_25:4_sil=16000:sos=all:erd=off:i=50:s2at=4.0:bd=off:nm=60:sup=off:cond=on:av=off:ins=2:nwc=10.0:etr=on:to=lpo:s2agt=20:fd=off:bsr=unit_only:slsq=on:slsqr=28,19:awrs=converge:awrsf=500:tgt=ground:bs=unit_only_0 on theBenchmark for (2996ds/50Mi)
% 0.48/0.66  % (15995)lrs+1010_1:2_sil=4000:tgt=ground:nwc=10.0:st=2.0:i=208:sd=1:bd=off:ss=axioms_0 on theBenchmark for (2996ds/208Mi)
% 0.48/0.66  % (15996)lrs-1011_1:1_sil=4000:plsq=on:plsqr=32,1:sp=frequency:plsql=on:nwc=10.0:i=52:aac=none:afr=on:ss=axioms:er=filter:sgt=16:rawr=on:etr=on:lma=on_0 on theBenchmark for (2996ds/52Mi)
% 0.56/0.66  % (15990)Instruction limit reached!
% 0.56/0.66  % (15990)------------------------------
% 0.56/0.66  % (15990)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.56/0.66  % (15990)Termination reason: Unknown
% 0.56/0.66  % (15990)Termination phase: Saturation
% 0.56/0.66  
% 0.56/0.66  % (15990)Memory used [KB]: 1221
% 0.56/0.66  % (15990)Time elapsed: 0.028 s
% 0.56/0.66  % (15990)Instructions burned: 46 (million)
% 0.56/0.66  % (15990)------------------------------
% 0.56/0.66  % (15990)------------------------------
% 0.56/0.67  % (15986)Instruction limit reached!
% 0.56/0.67  % (15986)------------------------------
% 0.56/0.67  % (15986)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.56/0.67  % (15986)Termination reason: Unknown
% 0.56/0.67  % (15986)Termination phase: Saturation
% 0.56/0.67  
% 0.56/0.67  % (15986)Memory used [KB]: 1425
% 0.56/0.67  % (15986)Time elapsed: 0.032 s
% 0.56/0.67  % (15986)Instructions burned: 52 (million)
% 0.56/0.67  % (15986)------------------------------
% 0.56/0.67  % (15986)------------------------------
% 0.56/0.67  % (15997)lrs-1010_1:1_to=lpo:sil=2000:sp=reverse_arity:sos=on:urr=ec_only:i=518:sd=2:bd=off:ss=axioms:sgt=16_0 on theBenchmark for (2996ds/518Mi)
% 0.56/0.67  % (15998)lrs+1011_87677:1048576_sil=8000:sos=on:spb=non_intro:nwc=10.0:kmz=on:i=42:ep=RS:nm=0:ins=1:uhcvi=on:rawr=on:fde=unused:afp=2000:afq=1.444:plsq=on:nicw=on_0 on theBenchmark for (2996ds/42Mi)
% 0.56/0.67  % (15993)First to succeed.
% 0.56/0.67  % (15993)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-15984"
% 0.56/0.68  % (15993)Refutation found. Thanks to Tanya!
% 0.56/0.68  % SZS status Theorem for theBenchmark
% 0.56/0.68  % SZS output start Proof for theBenchmark
% See solution above
% 0.56/0.68  % (15993)------------------------------
% 0.56/0.68  % (15993)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.56/0.68  % (15993)Termination reason: Refutation
% 0.56/0.68  
% 0.56/0.68  % (15993)Memory used [KB]: 1371
% 0.56/0.68  % (15993)Time elapsed: 0.019 s
% 0.56/0.68  % (15993)Instructions burned: 58 (million)
% 0.56/0.68  % (15984)Success in time 0.321 s
% 0.56/0.68  % Vampire---4.8 exiting
%------------------------------------------------------------------------------