↑ Up

Vampire---5.0.1.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : GEO450+1 : TPTP v9.3.1. Released v7.0.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 09:52:41 AM UTC 2026

% Result   : Theorem 3.71s 2.29s
% Output   : Refutation 4.97s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   22 (  22 unt;   1 def)
%            Number of atoms       :   22 (  13 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    7 (   7   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Maximal term depth    :   15 (   3 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :   19 (  19 usr;  15 con; 0-2 aty)
%            Number of variables   :   31 (  28   !;   3   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f200,axiom,
    ! [X0] : s(num,i(s(fun(num,num),numeral),s(num,X0))) = s(num,X0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',aNUMERAL) ).

fof(f3104,axiom,
    ! [X0,X1,X2] : s(cart(cart(real,X0),X1),i(s(fun(cart(cart(real,X0),X1),cart(cart(real,X0),X1)),i(s(fun(cart(cart(real,X0),X1),fun(cart(cart(real,X0),X1),cart(cart(real,X0),X1))),matrixu_add),s(cart(cart(real,X0),X1),i(s(fun(num,cart(cart(real,X0),X1)),mat),s(num,i(s(fun(num,num),numeral),s(num,u_0))))))),s(cart(cart(real,X0),X1),X2))) = s(cart(cart(real,X0),X1),X2),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',aMATRIXu_ADDu_LID) ).

fof(f3108,axiom,
    ! [X0,X1,X2,X3] : s(cart(cart(real,X0),X1),i(s(fun(cart(cart(real,X0),X1),cart(cart(real,X0),X1)),i(s(fun(cart(cart(real,X0),X1),fun(cart(cart(real,X0),X1),cart(cart(real,X0),X1))),matrixu_sub),s(cart(cart(real,X0),X1),X2))),s(cart(cart(real,X0),X1),X3))) = s(cart(cart(real,X0),X1),i(s(fun(cart(cart(real,X0),X1),cart(cart(real,X0),X1)),i(s(fun(cart(cart(real,X0),X1),fun(cart(cart(real,X0),X1),cart(cart(real,X0),X1))),matrixu_add),s(cart(cart(real,X0),X1),X2))),s(cart(cart(real,X0),X1),i(s(fun(cart(cart(real,X0),X1),cart(cart(real,X0),X1)),matrixu_neg),s(cart(cart(real,X0),X1),X3))))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',aMATRIXu_SUB) ).

fof(f3127,axiom,
    ! [X0,X1,X2] : s(cart(cart(real,X0),X1),i(s(fun(cart(cart(real,X0),X1),cart(cart(real,X0),X1)),matrixu_neg),s(cart(cart(real,X0),X1),X2))) = s(cart(cart(real,X0),X1),i(s(fun(cart(cart(real,X0),X1),cart(cart(real,X0),X1)),i(s(fun(real,fun(cart(cart(real,X0),X1),cart(cart(real,X0),X1))),r_r_),s(real,i(s(fun(real,real),realu_neg),s(real,i(s(fun(num,real),realu_ofu_num),s(num,i(s(fun(num,num),numeral),s(num,i(s(fun(num,num),bit1),s(num,u_0))))))))))),s(cart(cart(real,X0),X1),X2))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',aMATRIXu_NEGu_MINUS1) ).

fof(f3135,conjecture,
    ! [X0,X1,X2] : s(cart(cart(real,X0),X1),i(s(fun(cart(cart(real,X0),X1),cart(cart(real,X0),X1)),i(s(fun(cart(cart(real,X0),X1),fun(cart(cart(real,X0),X1),cart(cart(real,X0),X1))),matrixu_sub),s(cart(cart(real,X0),X1),i(s(fun(num,cart(cart(real,X0),X1)),mat),s(num,i(s(fun(num,num),numeral),s(num,u_0))))))),s(cart(cart(real,X0),X1),X2))) = s(cart(cart(real,X0),X1),i(s(fun(cart(cart(real,X0),X1),cart(cart(real,X0),X1)),matrixu_neg),s(cart(cart(real,X0),X1),X2))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',aMATRIXu_SUBu_LZERO) ).

fof(f3136,negated_conjecture,
    ~ ! [X0,X1,X2] : s(cart(cart(real,X0),X1),i(s(fun(cart(cart(real,X0),X1),cart(cart(real,X0),X1)),i(s(fun(cart(cart(real,X0),X1),fun(cart(cart(real,X0),X1),cart(cart(real,X0),X1))),matrixu_sub),s(cart(cart(real,X0),X1),i(s(fun(num,cart(cart(real,X0),X1)),mat),s(num,i(s(fun(num,num),numeral),s(num,u_0))))))),s(cart(cart(real,X0),X1),X2))) = s(cart(cart(real,X0),X1),i(s(fun(cart(cart(real,X0),X1),cart(cart(real,X0),X1)),matrixu_neg),s(cart(cart(real,X0),X1),X2))),
    inference(negated_conjecture,[status(cth)],[f3135]) ).

fof(f3144,plain,
    ? [X0,X1,X2] : s(cart(cart(real,X0),X1),i(s(fun(cart(cart(real,X0),X1),cart(cart(real,X0),X1)),matrixu_neg),s(cart(cart(real,X0),X1),X2))) != s(cart(cart(real,X0),X1),i(s(fun(cart(cart(real,X0),X1),cart(cart(real,X0),X1)),i(s(fun(cart(cart(real,X0),X1),fun(cart(cart(real,X0),X1),cart(cart(real,X0),X1))),matrixu_sub),s(cart(cart(real,X0),X1),i(s(fun(num,cart(cart(real,X0),X1)),mat),s(num,i(s(fun(num,num),numeral),s(num,u_0))))))),s(cart(cart(real,X0),X1),X2))),
    inference(ennf_transformation,[],[f3136]) ).

fof(f3159,plain,
    s(cart(cart(real,sK0),sK1),i(s(fun(cart(cart(real,sK0),sK1),cart(cart(real,sK0),sK1)),matrixu_neg),s(cart(cart(real,sK0),sK1),sK2))) != s(cart(cart(real,sK0),sK1),i(s(fun(cart(cart(real,sK0),sK1),cart(cart(real,sK0),sK1)),i(s(fun(cart(cart(real,sK0),sK1),fun(cart(cart(real,sK0),sK1),cart(cart(real,sK0),sK1))),matrixu_sub),s(cart(cart(real,sK0),sK1),i(s(fun(num,cart(cart(real,sK0),sK1)),mat),s(num,i(s(fun(num,num),numeral),s(num,u_0))))))),s(cart(cart(real,sK0),sK1),sK2))),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f3144]) ).

fof(f3190,plain,
    s(cart(cart(real,sK0),sK1),i(s(fun(cart(cart(real,sK0),sK1),cart(cart(real,sK0),sK1)),matrixu_neg),s(cart(cart(real,sK0),sK1),sK2))) != s(cart(cart(real,sK0),sK1),i(s(fun(cart(cart(real,sK0),sK1),cart(cart(real,sK0),sK1)),i(s(fun(cart(cart(real,sK0),sK1),fun(cart(cart(real,sK0),sK1),cart(cart(real,sK0),sK1))),matrixu_sub),s(cart(cart(real,sK0),sK1),i(s(fun(num,cart(cart(real,sK0),sK1)),mat),s(num,i(s(fun(num,num),numeral),s(num,u_0))))))),s(cart(cart(real,sK0),sK1),sK2))),
    inference(cnf_transformation,[],[f3159]) ).

fof(f3226,plain,
    ! [X0] : s(num,X0) = s(num,i(s(fun(num,num),numeral),s(num,X0))),
    inference(cnf_transformation,[],[f200]) ).

fof(f3230,plain,
    ! [X2,X0,X1] : s(cart(cart(real,X0),X1),i(s(fun(cart(cart(real,X0),X1),cart(cart(real,X0),X1)),matrixu_neg),s(cart(cart(real,X0),X1),X2))) = s(cart(cart(real,X0),X1),i(s(fun(cart(cart(real,X0),X1),cart(cart(real,X0),X1)),i(s(fun(real,fun(cart(cart(real,X0),X1),cart(cart(real,X0),X1))),r_r_),s(real,i(s(fun(real,real),realu_neg),s(real,i(s(fun(num,real),realu_ofu_num),s(num,i(s(fun(num,num),numeral),s(num,i(s(fun(num,num),bit1),s(num,u_0))))))))))),s(cart(cart(real,X0),X1),X2))),
    inference(cnf_transformation,[],[f3127]) ).

fof(f3231,plain,
    ! [X2,X3,X0,X1] : s(cart(cart(real,X0),X1),i(s(fun(cart(cart(real,X0),X1),cart(cart(real,X0),X1)),i(s(fun(cart(cart(real,X0),X1),fun(cart(cart(real,X0),X1),cart(cart(real,X0),X1))),matrixu_sub),s(cart(cart(real,X0),X1),X2))),s(cart(cart(real,X0),X1),X3))) = s(cart(cart(real,X0),X1),i(s(fun(cart(cart(real,X0),X1),cart(cart(real,X0),X1)),i(s(fun(cart(cart(real,X0),X1),fun(cart(cart(real,X0),X1),cart(cart(real,X0),X1))),matrixu_add),s(cart(cart(real,X0),X1),X2))),s(cart(cart(real,X0),X1),i(s(fun(cart(cart(real,X0),X1),cart(cart(real,X0),X1)),matrixu_neg),s(cart(cart(real,X0),X1),X3))))),
    inference(cnf_transformation,[],[f3108]) ).

fof(f3245,plain,
    ! [X2,X0,X1] : s(cart(cart(real,X0),X1),X2) = s(cart(cart(real,X0),X1),i(s(fun(cart(cart(real,X0),X1),cart(cart(real,X0),X1)),i(s(fun(cart(cart(real,X0),X1),fun(cart(cart(real,X0),X1),cart(cart(real,X0),X1))),matrixu_add),s(cart(cart(real,X0),X1),i(s(fun(num,cart(cart(real,X0),X1)),mat),s(num,i(s(fun(num,num),numeral),s(num,u_0))))))),s(cart(cart(real,X0),X1),X2))),
    inference(cnf_transformation,[],[f3104]) ).

fof(f3251,definition,
    ~ sP42(s(cart(cart(real,sK0),sK1),i(s(fun(cart(cart(real,sK0),sK1),cart(cart(real,sK0),sK1)),matrixu_neg),s(cart(cart(real,sK0),sK1),sK2)))),
    introduced(definition,[new_symbols(definition,[sP42])],[inequality_splitting_name_introduction]) ).

fof(f3252,plain,
    sP42(s(cart(cart(real,sK0),sK1),i(s(fun(cart(cart(real,sK0),sK1),cart(cart(real,sK0),sK1)),i(s(fun(cart(cart(real,sK0),sK1),fun(cart(cart(real,sK0),sK1),cart(cart(real,sK0),sK1))),matrixu_sub),s(cart(cart(real,sK0),sK1),i(s(fun(num,cart(cart(real,sK0),sK1)),mat),s(num,i(s(fun(num,num),numeral),s(num,u_0))))))),s(cart(cart(real,sK0),sK1),sK2)))),
    inference(inequality_splitting,[],[f3190,f3251]) ).

fof(f3277,plain,
    ~ sP42(s(cart(cart(real,sK0),sK1),i(s(fun(cart(cart(real,sK0),sK1),cart(cart(real,sK0),sK1)),i(s(fun(real,fun(cart(cart(real,sK0),sK1),cart(cart(real,sK0),sK1))),r_r_),s(real,i(s(fun(real,real),realu_neg),s(real,i(s(fun(num,real),realu_ofu_num),s(num,i(s(fun(num,num),numeral),s(num,i(s(fun(num,num),bit1),s(num,u_0))))))))))),s(cart(cart(real,sK0),sK1),sK2)))),
    inference(forward_demodulation,[],[f3251,f3230]) ).

fof(f3278,plain,
    sP42(s(cart(cart(real,sK0),sK1),i(s(fun(cart(cart(real,sK0),sK1),cart(cart(real,sK0),sK1)),i(s(fun(cart(cart(real,sK0),sK1),fun(cart(cart(real,sK0),sK1),cart(cart(real,sK0),sK1))),matrixu_add),s(cart(cart(real,sK0),sK1),i(s(fun(num,cart(cart(real,sK0),sK1)),mat),s(num,i(s(fun(num,num),numeral),s(num,u_0))))))),s(cart(cart(real,sK0),sK1),i(s(fun(cart(cart(real,sK0),sK1),cart(cart(real,sK0),sK1)),matrixu_neg),s(cart(cart(real,sK0),sK1),sK2)))))),
    inference(forward_demodulation,[],[f3252,f3231]) ).

fof(f3279,plain,
    ~ sP42(s(cart(cart(real,sK0),sK1),i(s(fun(cart(cart(real,sK0),sK1),cart(cart(real,sK0),sK1)),i(s(fun(real,fun(cart(cart(real,sK0),sK1),cart(cart(real,sK0),sK1))),r_r_),s(real,i(s(fun(real,real),realu_neg),s(real,i(s(fun(num,real),realu_ofu_num),s(num,i(s(fun(num,num),bit1),s(num,u_0))))))))),s(cart(cart(real,sK0),sK1),sK2)))),
    inference(forward_demodulation,[],[f3277,f3226]) ).

fof(f3280,plain,
    sP42(s(cart(cart(real,sK0),sK1),i(s(fun(cart(cart(real,sK0),sK1),cart(cart(real,sK0),sK1)),matrixu_neg),s(cart(cart(real,sK0),sK1),sK2)))),
    inference(forward_demodulation,[],[f3278,f3245]) ).

fof(f3281,plain,
    sP42(s(cart(cart(real,sK0),sK1),i(s(fun(cart(cart(real,sK0),sK1),cart(cart(real,sK0),sK1)),i(s(fun(real,fun(cart(cart(real,sK0),sK1),cart(cart(real,sK0),sK1))),r_r_),s(real,i(s(fun(real,real),realu_neg),s(real,i(s(fun(num,real),realu_ofu_num),s(num,i(s(fun(num,num),numeral),s(num,i(s(fun(num,num),bit1),s(num,u_0))))))))))),s(cart(cart(real,sK0),sK1),sK2)))),
    inference(forward_demodulation,[],[f3280,f3230]) ).

fof(f3282,plain,
    sP42(s(cart(cart(real,sK0),sK1),i(s(fun(cart(cart(real,sK0),sK1),cart(cart(real,sK0),sK1)),i(s(fun(real,fun(cart(cart(real,sK0),sK1),cart(cart(real,sK0),sK1))),r_r_),s(real,i(s(fun(real,real),realu_neg),s(real,i(s(fun(num,real),realu_ofu_num),s(num,i(s(fun(num,num),bit1),s(num,u_0))))))))),s(cart(cart(real,sK0),sK1),sK2)))),
    inference(forward_demodulation,[],[f3281,f3226]) ).

fof(f3283,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f3282,f3279]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : GEO450+1 : TPTP v9.3.1. Released v7.0.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 08:14:30 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
% 3.71/2.29  % (1713555)Detected formulas, will run a generic FOF schedule.
% 3.71/2.29  % (1713560)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=1227601132:i=141193_2990 on theBenchmark for (2990ds/141193Mi)
% 3.71/2.29  % (1713563)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1049918489:i=109:sd=1:ins=1:gsp=on:ss=axioms_2990 on theBenchmark for (2990ds/109Mi)
% 3.71/2.29  % (1713561)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=523317500:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2990 on theBenchmark for (2990ds/134677Mi)
% 3.71/2.29  % (1713562)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=583278511:i=141695:sd=1:nm=32:gsp=on:ss=included_2990 on theBenchmark for (2990ds/141695Mi)
% 3.71/2.29  % (1713565)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3877382100:s2a=on:i=139:gtg=position_2990 on theBenchmark for (2990ds/139Mi)
% 3.71/2.29  % (1713566)dis-21_1_sil=8000:lcm=predicate:random_seed=2200181613:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2990 on theBenchmark for (2990ds/129Mi)
% 3.71/2.29  % (1713564)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=261335426:i=119:av=off:ss=axioms_2990 on theBenchmark for (2990ds/119Mi)
% 3.71/2.29  % (1713565)Instruction limit reached! 
% 3.71/2.29  % (1713565)------------------------------
% 3.71/2.29  % (1713565)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.71/2.29  % (1713565)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.71/2.29  % (1713565)CaDiCaL version: 2.1.3
% 3.71/2.29  % (1713565)Termination reason: Instruction limit
% 3.71/2.29  % (1713565)Termination phase: Property scanning
% 3.71/2.29  % (1713565)Time elapsed: 0.049 s
% 3.71/2.29  % (1713565)Peak memory usage: 90 MB
% 3.71/2.29  % (1713565)Instructions burned: 141 (million)
% 3.71/2.29  % (1713563)First to succeed.
% 3.71/2.29  % (1713563)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-1713555"
% 3.71/2.29  % (1713566)Instruction limit reached! 
% 3.71/2.29  % (1713566)------------------------------
% 3.71/2.29  % (1713566)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.71/2.29  % (1713566)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.71/2.29  % (1713566)CaDiCaL version: 2.1.3
% 3.71/2.29  % (1713566)Termination reason: Instruction limit
% 3.71/2.29  % (1713566)Termination phase: SInE selection
% 3.71/2.29  % (1713566)Time elapsed: 0.061 s
% 3.71/2.29  % (1713566)Peak memory usage: 89 MB
% 3.71/2.29  % (1713566)Instructions burned: 130 (million)
% 3.71/2.29  % (1713564)Instruction limit reached! 
% 3.71/2.29  % (1713564)------------------------------
% 3.71/2.29  % (1713564)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.71/2.29  % (1713564)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.71/2.29  % (1713564)CaDiCaL version: 2.1.3
% 3.71/2.29  % (1713564)Termination reason: Instruction limit
% 3.71/2.29  % (1713564)Termination phase: Preprocessing 1
% 3.71/2.29  % (1713564)Time elapsed: 0.062 s
% 3.71/2.29  % (1713564)Peak memory usage: 90 MB
% 3.71/2.29  % (1713564)Instructions burned: 120 (million)
% 3.71/2.29  % (1713574)lrs+10_1_sil=8000:sp=occurrence:random_seed=722637900:i=285:sd=3:ss=axioms:sgt=8_2988 on theBenchmark for (2988ds/285Mi)
% 3.71/2.29  % (1713576)lrs+1011_1_sil=32000:sp=occurrence:random_seed=2630789717:i=325:sd=1:ss=axioms:sgt=32_2988 on theBenchmark for (2988ds/325Mi)
% 3.71/2.29  % (1713575)lrs+10_1_sil=32000:urr=on:br=off:random_seed=4258321501:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2988 on theBenchmark for (2988ds/157Mi)
% 3.71/2.29  % (1713575)Instruction limit reached! 
% 3.71/2.29  % (1713575)------------------------------
% 3.71/2.29  % (1713575)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.71/2.29  % (1713575)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.71/2.29  % (1713575)CaDiCaL version: 2.1.3
% 3.71/2.29  % (1713575)Termination reason: Instruction limit
% 3.71/2.29  % (1713575)Termination phase: Property scanning
% 3.71/2.29  % (1713575)Time elapsed: 0.056 s
% 3.71/2.29  % (1713575)Peak memory usage: 90 MB
% 3.71/2.29  % (1713575)Instructions burned: 160 (million)
% 3.71/2.29  % (1713563)Refutation found. Thanks to Tanya!
% 3.71/2.29  % SZS status Theorem for theBenchmark
% 3.71/2.29  % SZS output start Proof for theBenchmark
% See solution above
% 4.97/2.49  % (1713563)------------------------------
% 4.97/2.49  % (1713563)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.97/2.49  % (1713563)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.97/2.49  % (1713563)CaDiCaL version: 2.1.3
% 4.97/2.49  % (1713563)Termination reason: Refutation
% 4.97/2.49  % (1713563)Time elapsed: 0.055 s
% 4.97/2.49  % (1713563)Peak memory usage: 94 MB
% 4.97/2.49  % (1713563)Instructions burned: 108 (million)
% 4.97/2.49  % (1713563)------------------------------
% 4.97/2.49  % (1713563)------------------------------
% 4.97/2.49  % (1713555)Success in time 1.435 s
% 4.97/2.49  % Vampire exiting
%------------------------------------------------------------------------------