↑ Up

Vampire---5.0.1.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : NUM344+1 : TPTP v9.3.1. Released v3.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% Computer : n009.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Tue Sep 29 12:12:13 PM UTC 2026

% Result   : Theorem 3.66s 1.51s
% Output   : Refutation 3.66s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :   13
% Syntax   : Number of formulae    :   60 (  20 unt;   4 def)
%            Number of atoms       :  160 (   0 equ)
%            Maximal formula atoms :    8 (   2 avg)
%            Number of connectives :  206 ( 106   ~;  85   |;   8   &)
%                                         (   4 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   17 (   5 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :   11 (  10 usr;   5 prp; 0-4 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-1 aty)
%            Number of variables   :  116 (   0 sgn 112   !;   4   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    rdn_translate(n0,rdn_pos(rdnn(n0))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rdn0) ).

fof(f2,axiom,
    rdn_translate(n1,rdn_pos(rdnn(n1))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rdn1) ).

fof(f266,axiom,
    rdn_positive_less(rdnn(n0),rdnn(n1)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rdn_positive_less01) ).

fof(f281,axiom,
    ! [X0,X1,X2,X3] :
      ( ( rdn_translate(X0,rdn_pos(X2))
        & rdn_translate(X1,rdn_pos(X3))
        & rdn_positive_less(X2,X3) )
     => less(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_entry_point_pos_pos) ).

fof(f287,axiom,
    ! [X0,X1,X2,X3,X4,X5] :
      ( ( rdn_translate(X0,rdn_pos(X3))
        & rdn_translate(X1,rdn_pos(X4))
        & rdn_add_with_carry(rdnn(n0),X3,X4,X5)
        & rdn_translate(X2,rdn_pos(X5)) )
     => sum(X0,X1,X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sum_entry_point_pos_pos) ).

fof(f297,axiom,
    ! [X0,X1,X2,X3,X4] :
      ( ( rdn_digit_add(rdnn(X1),rdnn(X2),rdnn(X4),rdnn(n0))
        & rdn_digit_add(rdnn(X4),rdnn(X0),rdnn(X3),rdnn(n0)) )
     => rdn_add_with_carry(rdnn(X0),rdnn(X1),rdnn(X2),rdnn(X3)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',add_digit_digit_digit) ).

fof(f303,axiom,
    rdn_digit_add(rdnn(n0),rdnn(n1),rdnn(n1),rdnn(n0)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rdn_digit_add_n0_n1_n1_n0) ).

fof(f312,axiom,
    rdn_digit_add(rdnn(n1),rdnn(n0),rdnn(n1),rdnn(n0)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rdn_digit_add_n1_n0_n1_n0) ).

fof(f402,conjecture,
    ? [X0,X1] :
      ( sum(X0,n1,X1)
      & less(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',exist_bigger_plus_one) ).

fof(f403,negated_conjecture,
    ~ ? [X0,X1] :
        ( sum(X0,n1,X1)
        & less(X0,X1) ),
    inference(negated_conjecture,[status(cth)],[f402]) ).

fof(f406,plain,
    ! [X0,X1] :
      ( ~ sum(X0,n1,X1)
      | ~ less(X0,X1) ),
    inference(ennf_transformation,[],[f403]) ).

fof(f415,plain,
    ! [X0,X1,X2,X3] :
      ( less(X0,X1)
      | ~ rdn_translate(X0,rdn_pos(X2))
      | ~ rdn_translate(X1,rdn_pos(X3))
      | ~ rdn_positive_less(X2,X3) ),
    inference(ennf_transformation,[],[f281]) ).

fof(f416,plain,
    ! [X0,X1,X2,X3] :
      ( less(X0,X1)
      | ~ rdn_translate(X0,rdn_pos(X2))
      | ~ rdn_translate(X1,rdn_pos(X3))
      | ~ rdn_positive_less(X2,X3) ),
    inference(flattening,[],[f415]) ).

fof(f433,plain,
    ! [X0,X1,X2,X3,X4,X5] :
      ( sum(X0,X1,X2)
      | ~ rdn_translate(X0,rdn_pos(X3))
      | ~ rdn_translate(X1,rdn_pos(X4))
      | ~ rdn_add_with_carry(rdnn(n0),X3,X4,X5)
      | ~ rdn_translate(X2,rdn_pos(X5)) ),
    inference(ennf_transformation,[],[f287]) ).

fof(f434,plain,
    ! [X0,X1,X2,X3,X4,X5] :
      ( sum(X0,X1,X2)
      | ~ rdn_translate(X0,rdn_pos(X3))
      | ~ rdn_translate(X1,rdn_pos(X4))
      | ~ rdn_add_with_carry(rdnn(n0),X3,X4,X5)
      | ~ rdn_translate(X2,rdn_pos(X5)) ),
    inference(flattening,[],[f433]) ).

fof(f448,plain,
    ! [X0,X1,X2,X3,X4] :
      ( rdn_add_with_carry(rdnn(X0),rdnn(X1),rdnn(X2),rdnn(X3))
      | ~ rdn_digit_add(rdnn(X1),rdnn(X2),rdnn(X4),rdnn(n0))
      | ~ rdn_digit_add(rdnn(X4),rdnn(X0),rdnn(X3),rdnn(n0)) ),
    inference(ennf_transformation,[],[f297]) ).

fof(f449,plain,
    ! [X0,X1,X2,X3,X4] :
      ( rdn_add_with_carry(rdnn(X0),rdnn(X1),rdnn(X2),rdnn(X3))
      | ~ rdn_digit_add(rdnn(X1),rdnn(X2),rdnn(X4),rdnn(n0))
      | ~ rdn_digit_add(rdnn(X4),rdnn(X0),rdnn(X3),rdnn(n0)) ),
    inference(flattening,[],[f448]) ).

fof(f453,plain,
    ! [X0,X1] :
      ( ~ less(X0,X1)
      | ~ sum(X0,n1,X1) ),
    inference(cnf_transformation,[],[f406]) ).

fof(f514,plain,
    rdn_digit_add(rdnn(n1),rdnn(n0),rdnn(n1),rdnn(n0)),
    inference(cnf_transformation,[],[f312]) ).

fof(f515,plain,
    rdn_digit_add(rdnn(n0),rdnn(n1),rdnn(n1),rdnn(n0)),
    inference(cnf_transformation,[],[f303]) ).

fof(f516,plain,
    rdn_translate(n1,rdn_pos(rdnn(n1))),
    inference(cnf_transformation,[],[f2]) ).

fof(f524,plain,
    ! [X2,X3,X0,X1] :
      ( less(X0,X1)
      | ~ rdn_translate(X0,rdn_pos(X2))
      | ~ rdn_translate(X1,rdn_pos(X3))
      | ~ rdn_positive_less(X2,X3) ),
    inference(cnf_transformation,[],[f416]) ).

fof(f533,plain,
    ! [X2,X3,X0,X1,X4,X5] :
      ( ~ rdn_add_with_carry(rdnn(n0),X3,X4,X5)
      | ~ rdn_translate(X0,rdn_pos(X3))
      | ~ rdn_translate(X1,rdn_pos(X4))
      | sum(X0,X1,X2)
      | ~ rdn_translate(X2,rdn_pos(X5)) ),
    inference(cnf_transformation,[],[f434]) ).

fof(f538,plain,
    rdn_translate(n0,rdn_pos(rdnn(n0))),
    inference(cnf_transformation,[],[f1]) ).

fof(f593,plain,
    rdn_positive_less(rdnn(n0),rdnn(n1)),
    inference(cnf_transformation,[],[f266]) ).

fof(f598,plain,
    ! [X2,X3,X0,X1,X4] :
      ( rdn_add_with_carry(rdnn(X0),rdnn(X1),rdnn(X2),rdnn(X3))
      | ~ rdn_digit_add(rdnn(X1),rdnn(X2),rdnn(X4),rdnn(n0))
      | ~ rdn_digit_add(rdnn(X4),rdnn(X0),rdnn(X3),rdnn(n0)) ),
    inference(cnf_transformation,[],[f449]) ).

fof(f633,plain,
    ! [X2,X3,X0,X1] :
      ( ~ sum(X0,n1,X2)
      | ~ rdn_translate(X2,rdn_pos(X3))
      | ~ rdn_positive_less(X1,X3)
      | ~ rdn_translate(X0,rdn_pos(X1)) ),
    inference(resolution,[],[f524,f453]) ).

fof(f683,plain,
    ! [X2,X3,X0,X1,X6,X4,X5] :
      ( sum(X4,X5,X6)
      | ~ rdn_digit_add(rdnn(X2),rdnn(n0),rdnn(X3),rdnn(n0))
      | ~ rdn_translate(X4,rdn_pos(rdnn(X0)))
      | ~ rdn_translate(X5,rdn_pos(rdnn(X1)))
      | ~ rdn_digit_add(rdnn(X0),rdnn(X1),rdnn(X2),rdnn(n0))
      | ~ rdn_translate(X6,rdn_pos(rdnn(X3))) ),
    inference(resolution,[],[f598,f533]) ).

fof(f732,plain,
    ! [X2,X3,X0,X1,X6,X7,X4,X5] :
      ( ~ rdn_positive_less(X7,X6)
      | ~ rdn_translate(X2,rdn_pos(rdnn(X3)))
      | ~ rdn_translate(n1,rdn_pos(rdnn(X4)))
      | ~ rdn_digit_add(rdnn(X3),rdnn(X4),rdnn(X0),rdnn(n0))
      | ~ rdn_translate(X5,rdn_pos(rdnn(X1)))
      | ~ rdn_translate(X5,rdn_pos(X6))
      | ~ rdn_digit_add(rdnn(X0),rdnn(n0),rdnn(X1),rdnn(n0))
      | ~ rdn_translate(X2,rdn_pos(X7)) ),
    inference(resolution,[],[f683,f633]) ).

fof(f738,plain,
    ! [X2,X3,X0,X1,X4,X5] :
      ( ~ rdn_translate(X0,rdn_pos(rdnn(X1)))
      | ~ rdn_translate(n1,rdn_pos(rdnn(X2)))
      | ~ rdn_translate(X4,rdn_pos(rdnn(X5)))
      | ~ rdn_translate(X4,rdn_pos(rdnn(n1)))
      | ~ rdn_translate(X0,rdn_pos(rdnn(n0)))
      | ~ rdn_digit_add(rdnn(X3),rdnn(n0),rdnn(X5),rdnn(n0))
      | ~ rdn_digit_add(rdnn(X1),rdnn(X2),rdnn(X3),rdnn(n0)) ),
    inference(resolution,[],[f732,f593]) ).

fof(f762,plain,
    ! [X2,X3,X0,X1,X4] :
      ( ~ rdn_translate(X0,rdn_pos(rdnn(X1)))
      | ~ rdn_translate(X2,rdn_pos(rdnn(X3)))
      | ~ rdn_translate(X2,rdn_pos(rdnn(n1)))
      | ~ rdn_translate(X0,rdn_pos(rdnn(n0)))
      | ~ rdn_digit_add(rdnn(X4),rdnn(n0),rdnn(X3),rdnn(n0))
      | ~ rdn_digit_add(rdnn(X1),rdnn(n1),rdnn(X4),rdnn(n0)) ),
    inference(resolution,[],[f738,f516]) ).

fof(f781,definition,
    ( spl1_6
  <=> ! [X0] : ~ rdn_translate(X0,rdn_pos(rdnn(n1))) ),
    introduced(definition,[new_symbols(definition,[spl1_6])],[avatar_definition]) ).

fof(f782,plain,
    ( ! [X0] : ~ rdn_translate(X0,rdn_pos(rdnn(n1)))
    | ~ spl1_6 ),
    inference(avatar_component_clause,[],[f781]) ).

fof(f802,definition,
    ( spl1_12
  <=> ! [X0] : ~ rdn_translate(X0,rdn_pos(rdnn(n0))) ),
    introduced(definition,[new_symbols(definition,[spl1_12])],[avatar_definition]) ).

fof(f803,plain,
    ( ! [X0] : ~ rdn_translate(X0,rdn_pos(rdnn(n0)))
    | ~ spl1_12 ),
    inference(avatar_component_clause,[],[f802]) ).

fof(f910,plain,
    ( $false
    | ~ spl1_6 ),
    inference(resolution,[],[f782,f516]) ).

fof(f911,plain,
    ~ spl1_6,
    inference(avatar_contradiction_clause,[],[f910]) ).

fof(f1017,plain,
    ! [X2,X3,X0,X1] :
      ( ~ rdn_translate(X1,rdn_pos(rdnn(X2)))
      | ~ rdn_translate(X0,rdn_pos(rdnn(n1)))
      | ~ rdn_translate(X1,rdn_pos(rdnn(n0)))
      | ~ rdn_digit_add(rdnn(X3),rdnn(n0),rdnn(n1),rdnn(n0))
      | ~ rdn_digit_add(rdnn(X2),rdnn(n1),rdnn(X3),rdnn(n0)) ),
    inference(factoring,[],[f762]) ).

fof(f1019,definition,
    ( spl1_58
  <=> ! [X2,X1,X3] :
        ( ~ rdn_translate(X1,rdn_pos(rdnn(X2)))
        | ~ rdn_digit_add(rdnn(X2),rdnn(n1),rdnn(X3),rdnn(n0))
        | ~ rdn_digit_add(rdnn(X3),rdnn(n0),rdnn(n1),rdnn(n0))
        | ~ rdn_translate(X1,rdn_pos(rdnn(n0))) ) ),
    introduced(definition,[new_symbols(definition,[spl1_58])],[avatar_definition]) ).

fof(f1020,plain,
    ( ! [X2,X3,X1] :
        ( ~ rdn_translate(X1,rdn_pos(rdnn(X2)))
        | ~ rdn_translate(X1,rdn_pos(rdnn(n0)))
        | ~ rdn_digit_add(rdnn(X3),rdnn(n0),rdnn(n1),rdnn(n0))
        | ~ rdn_digit_add(rdnn(X2),rdnn(n1),rdnn(X3),rdnn(n0)) )
    | ~ spl1_58 ),
    inference(avatar_component_clause,[],[f1019]) ).

fof(f1021,plain,
    ( spl1_6
    | spl1_58 ),
    inference(avatar_split_clause,[],[f1017,f1019,f781]) ).

fof(f1031,plain,
    ( $false
    | ~ spl1_12 ),
    inference(resolution,[],[f803,f538]) ).

fof(f1032,plain,
    ~ spl1_12,
    inference(avatar_contradiction_clause,[],[f1031]) ).

fof(f1043,plain,
    ( ! [X0,X1] :
        ( ~ rdn_translate(X0,rdn_pos(rdnn(n0)))
        | ~ rdn_digit_add(rdnn(X1),rdnn(n0),rdnn(n1),rdnn(n0))
        | ~ rdn_digit_add(rdnn(n0),rdnn(n1),rdnn(X1),rdnn(n0)) )
    | ~ spl1_58 ),
    inference(factoring,[],[f1020]) ).

fof(f1045,definition,
    ( spl1_61
  <=> ! [X1] :
        ( ~ rdn_digit_add(rdnn(X1),rdnn(n0),rdnn(n1),rdnn(n0))
        | ~ rdn_digit_add(rdnn(n0),rdnn(n1),rdnn(X1),rdnn(n0)) ) ),
    introduced(definition,[new_symbols(definition,[spl1_61])],[avatar_definition]) ).

fof(f1046,plain,
    ( ! [X1] :
        ( ~ rdn_digit_add(rdnn(X1),rdnn(n0),rdnn(n1),rdnn(n0))
        | ~ rdn_digit_add(rdnn(n0),rdnn(n1),rdnn(X1),rdnn(n0)) )
    | ~ spl1_61 ),
    inference(avatar_component_clause,[],[f1045]) ).

fof(f1047,plain,
    ( spl1_61
    | spl1_12
    | ~ spl1_58 ),
    inference(avatar_split_clause,[],[f1043,f1019,f802,f1045]) ).

fof(f1065,plain,
    ( ~ rdn_digit_add(rdnn(n0),rdnn(n1),rdnn(n1),rdnn(n0))
    | ~ spl1_61 ),
    inference(resolution,[],[f1046,f514]) ).

fof(f1083,plain,
    ( $false
    | ~ spl1_61 ),
    inference(resolution,[],[f1065,f515]) ).

fof(f1084,plain,
    ~ spl1_61,
    inference(avatar_contradiction_clause,[],[f1083]) ).

cnf(s25,plain,
    ~ spl1_6,
    inference(sat_conversion,[],[f911]) ).

cnf(s35,plain,
    ( spl1_6
    | spl1_58 ),
    inference(sat_conversion,[],[f1021]) ).

cnf(s39,plain,
    ~ spl1_12,
    inference(sat_conversion,[],[f1032]) ).

cnf(s40,plain,
    ( spl1_12
    | ~ spl1_58
    | spl1_61 ),
    inference(sat_conversion,[],[f1047]) ).

cnf(s43,plain,
    ~ spl1_61,
    inference(sat_conversion,[],[f1084]) ).

cnf(s44,plain,
    ( spl1_12
    | ~ spl1_58 ),
    inference(rat,[],[s40,s43]) ).

cnf(s45,plain,
    ~ spl1_58,
    inference(rat,[],[s44,s39]) ).

cnf(s48,plain,
    spl1_6,
    inference(rat,[],[s35,s45]) ).

cnf(s50,plain,
    $false,
    inference(rat,[],[s25,s48]) ).

fof(f1085,plain,
    $false,
    inference(avatar_sat_refutation,[],[s50]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NUM344+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.38  % Computer : n009.cluster.edu
% 0.10/0.38  % Model    : x86_64 x86_64
% 0.10/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38  % Memory   : 8046.5625MB
% 0.10/0.38  % OS       : Linux 6.8.0-71-generic
% 0.10/0.38  % CPULimit : 300
% 0.10/0.38  % WCLimit  : 300
% 0.10/0.38  % DateTime : Sun Sep 27 19:35:31 UTC 2026
% 0.10/0.38  % CPUTime  : 
% 0.10/0.38  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.42  Running first-order theorem proving
% 0.10/0.42  Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.74/1.32  % (2351819)Detected formulas, will run a generic FOF schedule.
% 2.74/1.32  % (2351828)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3858208760:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.74/1.32  % (2351828)Instruction limit reached! 
% 2.74/1.32  % (2351828)------------------------------
% 2.74/1.32  % (2351828)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.74/1.32  % (2351828)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.74/1.32  % (2351828)CaDiCaL version: 2.1.3
% 2.74/1.32  % (2351828)Termination reason: Instruction limit
% 2.74/1.32  % (2351828)Termination phase: Saturation
% 2.74/1.32  % (2351828)Time elapsed: 0.034 s
% 2.74/1.32  % (2351828)Peak memory usage: 88 MB
% 2.74/1.32  % (2351828)Instructions burned: 123 (million)
% 2.74/1.32  % (2351827)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=3549767201:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.74/1.32  % (2351830)dis-21_1_sil=8000:lcm=predicate:random_seed=1955702337:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 2.74/1.32  % (2351826)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=775866026:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.74/1.32  % (2351825)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=3998638709:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.74/1.32  % (2351824)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=2074767108:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.74/1.32  % (2351829)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2222819421:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.74/1.32  % (2351827)Refutation not found, incomplete strategy
% 2.74/1.32  % (2351827)------------------------------
% 2.74/1.32  % (2351827)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.74/1.32  % (2351827)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.74/1.32  % (2351827)CaDiCaL version: 2.1.3
% 2.74/1.32  % (2351827)Termination reason: Refutation not found, incomplete strategy
% 2.74/1.32  % (2351827)Time elapsed: 0.002 s
% 2.74/1.32  % (2351827)Peak memory usage: 87 MB
% 2.74/1.32  % (2351827)Instructions burned: 1 (million)
% 2.74/1.32  % (2351830)First to succeed.
% 2.74/1.32  % (2351830)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-2351819"
% 2.74/1.32  % (2351832)lrs+10_1_sil=8000:sp=occurrence:random_seed=2090729703:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 2.74/1.32  % (2351832)Refutation not found, incomplete strategy
% 2.74/1.32  % (2351832)------------------------------
% 2.74/1.32  % (2351832)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.74/1.32  % (2351832)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.74/1.32  % (2351832)CaDiCaL version: 2.1.3
% 2.74/1.32  % (2351832)Termination reason: Refutation not found, incomplete strategy
% 2.74/1.32  % (2351832)Time elapsed: 0.006 s
% 2.74/1.32  % (2351832)Peak memory usage: 88 MB
% 2.74/1.32  % (2351832)Instructions burned: 17 (million)
% 2.74/1.32  % (2351829)Instruction limit reached! 
% 2.74/1.32  % (2351829)------------------------------
% 2.74/1.32  % (2351829)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.74/1.32  % (2351829)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.74/1.32  % (2351829)CaDiCaL version: 2.1.3
% 2.74/1.32  % (2351829)Termination reason: Instruction limit
% 2.74/1.32  % (2351829)Termination phase: Saturation
% 2.74/1.32  % (2351829)Time elapsed: 0.092 s
% 2.74/1.32  % (2351829)Peak memory usage: 90 MB
% 2.74/1.32  % (2351829)Instructions burned: 140 (million)
% 2.74/1.32  % (2351840)lrs+10_1_sil=32000:urr=on:br=off:random_seed=849454884:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 2.74/1.32  % (2351840)Refutation not found, incomplete strategy
% 2.74/1.32  % (2351840)------------------------------
% 2.74/1.32  % (2351840)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.74/1.32  % (2351840)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.66/1.51  % (2351840)CaDiCaL version: 2.1.3
% 3.66/1.51  % (2351840)Termination reason: Refutation not found, incomplete strategy
% 3.66/1.51  % (2351840)Time elapsed: 0.003 s
% 3.66/1.51  % (2351840)Peak memory usage: 88 MB
% 3.66/1.51  % (2351840)Instructions burned: 5 (million)
% 3.66/1.51  % (2351832)------------------------------
% 3.66/1.51  % (2351832)------------------------------
% 3.66/1.51  % (2351827)------------------------------
% 3.66/1.51  % (2351827)------------------------------
% 3.66/1.51  % (2351830)Refutation found. Thanks to Tanya!
% 3.66/1.51  % SZS status Theorem for theBenchmark
% 3.66/1.51  % SZS output start Proof for theBenchmark
% See solution above
% 3.66/1.51  % (2351830)------------------------------
% 3.66/1.51  % (2351830)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.66/1.51  % (2351830)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.66/1.51  % (2351830)CaDiCaL version: 2.1.3
% 3.66/1.51  % (2351830)Termination reason: Refutation
% 3.66/1.51  % (2351830)Time elapsed: 0.017 s
% 3.66/1.51  % (2351830)Peak memory usage: 90 MB
% 3.66/1.51  % (2351830)Instructions burned: 28 (million)
% 3.66/1.51  % (2351830)------------------------------
% 3.66/1.51  % (2351830)------------------------------
% 3.66/1.51  % (2351819)Success in time 0.435 s
% 3.66/1.51  % Vampire exiting
%------------------------------------------------------------------------------