↑ Up

Vampire---5.0.1.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : NUM345+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 : n019.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 0.15s 1.50s
% Output   : Refutation 0.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :   12
% Syntax   : Number of formulae    :   49 (  19 unt;   0 def)
%            Number of atoms       :  123 (  11 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :  141 (  67   ~;  59   |;   9   &)
%                                         (   0 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   14 (   5 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    8 (   6 usr;   1 prp; 0-4 aty)
%            Number of functors    :    8 (   8 usr;   6 con; 0-1 aty)
%            Number of variables   :  107 ( 106   !;   1   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f3,axiom,
    rdn_translate(n2,rdn_pos(rdnn(n2))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rdn2) ).

fof(f4,axiom,
    rdn_translate(n3,rdn_pos(rdnn(n3))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rdn3) ).

fof(f6,axiom,
    rdn_translate(n5,rdn_pos(rdnn(n5))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rdn5) ).

fof(f7,axiom,
    rdn_translate(n6,rdn_pos(rdnn(n6))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rdn6) ).

fof(f271,axiom,
    rdn_positive_less(rdnn(n5),rdnn(n6)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rdn_positive_less56) ).

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(f293,axiom,
    ! [X0,X1,X2,X3] :
      ( ( sum(X0,X1,X2)
        & sum(X0,X1,X3) )
     => X2 = X3 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unique_sum) ).

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(f325,axiom,
    rdn_digit_add(rdnn(n2),rdnn(n3),rdnn(n5),rdnn(n0)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rdn_digit_add_n2_n3_n5_n0) ).

fof(f352,axiom,
    rdn_digit_add(rdnn(n5),rdnn(n0),rdnn(n5),rdnn(n0)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rdn_digit_add_n5_n0_n5_n0) ).

fof(f402,conjecture,
    ! [X0] :
      ( sum(n2,n3,X0)
     => less(X0,n6) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sum_n2_n3_less_n6) ).

fof(f403,negated_conjecture,
    ~ ! [X0] :
        ( sum(n2,n3,X0)
       => less(X0,n6) ),
    inference(negated_conjecture,[status(cth)],[f402]) ).

fof(f413,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(f414,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,[],[f413]) ).

fof(f423,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(f424,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,[],[f423]) ).

fof(f435,plain,
    ! [X0,X1,X2,X3] :
      ( X2 = X3
      | ~ sum(X0,X1,X2)
      | ~ sum(X0,X1,X3) ),
    inference(ennf_transformation,[],[f293]) ).

fof(f436,plain,
    ! [X0,X1,X2,X3] :
      ( X2 = X3
      | ~ sum(X0,X1,X2)
      | ~ sum(X0,X1,X3) ),
    inference(flattening,[],[f435]) ).

fof(f441,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(f442,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,[],[f441]) ).

fof(f450,plain,
    ? [X0] :
      ( ~ less(X0,n6)
      & sum(n2,n3,X0) ),
    inference(ennf_transformation,[],[f403]) ).

fof(f454,plain,
    ( ~ less(sK0,n6)
    & sum(n2,n3,sK0) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f450]) ).

fof(f457,plain,
    rdn_translate(n2,rdn_pos(rdnn(n2))),
    inference(cnf_transformation,[],[f3]) ).

fof(f458,plain,
    rdn_translate(n3,rdn_pos(rdnn(n3))),
    inference(cnf_transformation,[],[f4]) ).

fof(f460,plain,
    rdn_translate(n5,rdn_pos(rdnn(n5))),
    inference(cnf_transformation,[],[f6]) ).

fof(f461,plain,
    rdn_translate(n6,rdn_pos(rdnn(n6))),
    inference(cnf_transformation,[],[f7]) ).

fof(f725,plain,
    rdn_positive_less(rdnn(n5),rdnn(n6)),
    inference(cnf_transformation,[],[f271]) ).

fof(f735,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,[],[f414]) ).

fof(f743,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,[],[f424]) ).

fof(f749,plain,
    ! [X2,X3,X0,X1] :
      ( ~ sum(X0,X1,X2)
      | X2 = X3
      | ~ sum(X0,X1,X3) ),
    inference(cnf_transformation,[],[f436]) ).

fof(f754,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,[],[f442]) ).

fof(f782,plain,
    rdn_digit_add(rdnn(n2),rdnn(n3),rdnn(n5),rdnn(n0)),
    inference(cnf_transformation,[],[f325]) ).

fof(f809,plain,
    rdn_digit_add(rdnn(n5),rdnn(n0),rdnn(n5),rdnn(n0)),
    inference(cnf_transformation,[],[f352]) ).

fof(f859,plain,
    sum(n2,n3,sK0),
    inference(cnf_transformation,[],[f454]) ).

fof(f860,plain,
    ~ less(sK0,n6),
    inference(cnf_transformation,[],[f454]) ).

fof(f877,plain,
    ! [X0] :
      ( ~ sum(n2,n3,X0)
      | sK0 = X0 ),
    inference(resolution,[],[f749,f859]) ).

fof(f893,plain,
    ! [X0,X1] :
      ( ~ rdn_translate(sK0,rdn_pos(X0))
      | ~ rdn_translate(n6,rdn_pos(X1))
      | ~ rdn_positive_less(X0,X1) ),
    inference(resolution,[],[f735,f860]) ).

fof(f1001,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,[],[f754,f743]) ).

fof(f1703,plain,
    ! [X2,X3,X0,X1,X4] :
      ( ~ rdn_translate(n3,rdn_pos(rdnn(X3)))
      | ~ rdn_translate(n2,rdn_pos(rdnn(X2)))
      | ~ rdn_digit_add(rdnn(X0),rdnn(n0),rdnn(X1),rdnn(n0))
      | ~ rdn_digit_add(rdnn(X2),rdnn(X3),rdnn(X0),rdnn(n0))
      | ~ rdn_translate(X4,rdn_pos(rdnn(X1)))
      | sK0 = X4 ),
    inference(resolution,[],[f1001,f877]) ).

fof(f1855,plain,
    ! [X2,X3,X0,X1] :
      ( ~ rdn_translate(n2,rdn_pos(rdnn(X0)))
      | ~ rdn_digit_add(rdnn(X1),rdnn(n0),rdnn(X2),rdnn(n0))
      | ~ rdn_digit_add(rdnn(X0),rdnn(n3),rdnn(X1),rdnn(n0))
      | ~ rdn_translate(X3,rdn_pos(rdnn(X2)))
      | sK0 = X3 ),
    inference(resolution,[],[f1703,f458]) ).

fof(f2202,plain,
    ! [X2,X0,X1] :
      ( ~ rdn_digit_add(rdnn(n2),rdnn(n3),rdnn(X0),rdnn(n0))
      | ~ rdn_digit_add(rdnn(X0),rdnn(n0),rdnn(X1),rdnn(n0))
      | ~ rdn_translate(X2,rdn_pos(rdnn(X1)))
      | sK0 = X2 ),
    inference(resolution,[],[f1855,f457]) ).

fof(f2210,plain,
    ! [X0,X1] :
      ( ~ rdn_digit_add(rdnn(n5),rdnn(n0),rdnn(X0),rdnn(n0))
      | ~ rdn_translate(X1,rdn_pos(rdnn(X0)))
      | sK0 = X1 ),
    inference(resolution,[],[f2202,f782]) ).

fof(f2212,plain,
    ! [X0] :
      ( ~ rdn_translate(X0,rdn_pos(rdnn(n5)))
      | sK0 = X0 ),
    inference(resolution,[],[f2210,f809]) ).

fof(f2214,plain,
    n5 = sK0,
    inference(resolution,[],[f2212,f460]) ).

fof(f2224,plain,
    ! [X0,X1] :
      ( ~ rdn_translate(n6,rdn_pos(X1))
      | ~ rdn_translate(n5,rdn_pos(X0))
      | ~ rdn_positive_less(X0,X1) ),
    inference(superposition,[],[f893,f2214]) ).

fof(f2439,plain,
    ! [X0] :
      ( ~ rdn_translate(n5,rdn_pos(X0))
      | ~ rdn_positive_less(X0,rdnn(n6)) ),
    inference(resolution,[],[f2224,f461]) ).

fof(f2440,plain,
    ~ rdn_positive_less(rdnn(n5),rdnn(n6)),
    inference(resolution,[],[f2439,f460]) ).

fof(f2441,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f2440,f725]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : NUM345+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.11/0.37  % Computer : n019.cluster.edu
% 0.11/0.37  % Model    : x86_64 x86_64
% 0.11/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37  % Memory   : 8046.5625MB
% 0.11/0.37  % OS       : Linux 6.8.0-71-generic
% 0.11/0.37  % CPULimit : 300
% 0.11/0.37  % WCLimit  : 300
% 0.11/0.37  % DateTime : Sun Sep 27 19:35:19 UTC 2026
% 0.11/0.37  % CPUTime  : 
% 0.11/0.37  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.40  Running first-order theorem proving
% 0.14/0.40  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.10/1.31  % (3358491)Detected formulas, will run a generic FOF schedule.
% 2.10/1.31  % (3358499)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2267223639:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.10/1.31  % (3358499)Refutation not found, incomplete strategy
% 2.10/1.31  % (3358499)------------------------------
% 2.10/1.31  % (3358499)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.10/1.31  % (3358499)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.10/1.31  % (3358499)CaDiCaL version: 2.1.3
% 2.10/1.31  % (3358499)Termination reason: Refutation not found, incomplete strategy
% 2.10/1.31  % (3358499)Time elapsed: 0.001 s
% 2.10/1.31  % (3358499)Peak memory usage: 88 MB
% 2.10/1.31  % (3358499)Instructions burned: 2 (million)
% 2.10/1.31  % (3358502)dis-21_1_sil=8000:lcm=predicate:random_seed=3040279439: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.10/1.31  % (3358500)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2724058905:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.10/1.31  % (3358496)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=2711411245:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.10/1.31  % (3358498)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=1726211863:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.10/1.31  % (3358501)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2510255962:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.10/1.31  % (3358497)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=2616141195:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.10/1.31  % (3358502)Instruction limit reached! 
% 2.10/1.31  % (3358502)------------------------------
% 2.10/1.31  % (3358502)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.10/1.31  % (3358502)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.10/1.31  % (3358502)CaDiCaL version: 2.1.3
% 2.10/1.31  % (3358502)Termination reason: Instruction limit
% 2.10/1.31  % (3358502)Termination phase: Saturation
% 2.10/1.31  % (3358502)Time elapsed: 0.057 s
% 2.10/1.31  % (3358502)Peak memory usage: 88 MB
% 2.10/1.31  % (3358502)Instructions burned: 131 (million)
% 2.10/1.31  % (3358501)First to succeed.
% 2.10/1.31  % (3358500)Instruction limit reached! 
% 2.10/1.31  % (3358500)------------------------------
% 2.10/1.31  % (3358500)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.10/1.31  % (3358500)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.10/1.31  % (3358500)CaDiCaL version: 2.1.3
% 2.10/1.31  % (3358500)Termination reason: Instruction limit
% 2.10/1.31  % (3358500)Termination phase: Saturation
% 2.10/1.31  % (3358500)Time elapsed: 0.062 s
% 2.10/1.31  % (3358500)Peak memory usage: 88 MB
% 2.10/1.31  % (3358500)Instructions burned: 121 (million)
% 2.10/1.31  % (3358501)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3358491"
% 2.10/1.31  % (3358499)------------------------------
% 2.10/1.31  % (3358499)------------------------------
% 2.10/1.31  % (3358510)lrs+10_1_sil=8000:sp=occurrence:random_seed=2162768149:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 2.10/1.31  % (3358512)lrs+1011_1_sil=32000:sp=occurrence:random_seed=413047519:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 2.10/1.31  % (3358510)Refutation not found, incomplete strategy
% 2.10/1.31  % (3358510)------------------------------
% 2.10/1.31  % (3358510)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.10/1.31  % (3358510)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.10/1.31  % (3358510)CaDiCaL version: 2.1.3
% 2.10/1.31  % (3358510)Termination reason: Refutation not found, incomplete strategy
% 2.10/1.31  % (3358510)Time elapsed: 0.012 s
% 2.10/1.31  % (3358510)Peak memory usage: 88 MB
% 2.10/1.31  % (3358510)Instructions burned: 18 (million)
% 2.10/1.31  % (3358512)Refutation not found, incomplete strategy
% 2.10/1.31  % (3358512)------------------------------
% 2.10/1.31  % (3358512)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.15/1.50  % (3358512)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.15/1.50  % (3358512)CaDiCaL version: 2.1.3
% 0.15/1.50  % (3358512)Termination reason: Refutation not found, incomplete strategy
% 0.15/1.50  % (3358512)Time elapsed: 0.002 s
% 0.15/1.50  % (3358512)Peak memory usage: 89 MB
% 0.15/1.50  % (3358512)Instructions burned: 3 (million)
% 0.15/1.50  % (3358511)lrs+10_1_sil=32000:urr=on:br=off:random_seed=2447888554:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 0.15/1.50  % (3358511)Refutation not found, incomplete strategy
% 0.15/1.50  % (3358511)------------------------------
% 0.15/1.50  % (3358511)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.15/1.50  % (3358511)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.15/1.50  % (3358511)CaDiCaL version: 2.1.3
% 0.15/1.50  % (3358511)Termination reason: Refutation not found, incomplete strategy
% 0.15/1.50  % (3358511)Time elapsed: 0.004 s
% 0.15/1.50  % (3358511)Peak memory usage: 88 MB
% 0.15/1.50  % (3358511)Instructions burned: 6 (million)
% 0.15/1.50  % (3358501)Refutation found. Thanks to Tanya!
% 0.15/1.50  % SZS status Theorem for theBenchmark
% 0.15/1.50  % SZS output start Proof for theBenchmark
% See solution above
% 0.15/1.50  % (3358501)------------------------------
% 0.15/1.50  % (3358501)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.15/1.50  % (3358501)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.15/1.50  % (3358501)CaDiCaL version: 2.1.3
% 0.15/1.50  % (3358501)Termination reason: Refutation
% 0.15/1.50  % (3358501)Time elapsed: 0.063 s
% 0.15/1.50  % (3358501)Peak memory usage: 90 MB
% 0.15/1.50  % (3358501)Instructions burned: 103 (million)
% 0.15/1.50  % (3358501)------------------------------
% 0.15/1.50  % (3358501)------------------------------
% 0.15/1.50  % (3358491)Success in time 0.476 s
% 0.15/1.50  % Vampire exiting
%------------------------------------------------------------------------------