↑ Up

Vampire---5.0.1.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : GRP667-10 : TPTP v9.3.1. Released v7.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM

% Computer : n003.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 10:15:32 AM UTC 2026

% Result   : Unsatisfiable 28.55s 4.99s
% Output   : Refutation 29.40s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   28
%            Number of leaves      :   13
% Syntax   : Number of formulae    :   73 (  73 unt;   1 def)
%            Number of atoms       :   73 (  68 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    2 (   2   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   3 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   4 con; 0-4 aty)
%            Number of variables   :  155 ( 155   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X2,X0,X1] : ifeq(X0,X0,X1,X2) = X1,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ifeq_axiom) ).

fof(f2,axiom,
    ! [X0,X1] : mult(X0,ld(X0,X1)) = X1,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',f01) ).

fof(f3,axiom,
    ! [X0,X1] : ld(X0,mult(X0,X1)) = X1,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',f02) ).

fof(f4,axiom,
    ! [X0,X1] : mult(rd(X0,X1),X1) = X0,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',f03) ).

fof(f5,axiom,
    ! [X0,X1] : rd(mult(X0,X1),X1) = X0,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',f04) ).

fof(f6,axiom,
    ! [X0] : mult(X0,unit) = X0,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',f05) ).

fof(f7,axiom,
    ! [X0] : mult(unit,X0) = X0,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',f06) ).

fof(f8,axiom,
    ! [X2,X0,X1] : mult(mult(X0,X1),mult(mult(X2,X1),X2)) = mult(mult(X0,mult(mult(X1,X2),X1)),X2),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',f07) ).

fof(f9,axiom,
    ! [X0,X1] : mult(mult(X0,X1),X0) = mult(X0,mult(X1,X0)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',f08) ).

fof(f10,axiom,
    ! [X0] : mult(f(X0),f(X0)) = X0,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',f09) ).

fof(f11,axiom,
    ! [X2,X0,X1] : ifeq(mult(X0,mult(X1,mult(X2,X1))),mult(mult(mult(X0,X1),X2),X1),mult(X1,mult(X0,mult(X1,X2))),mult(mult(mult(X1,X0),X1),X2)) = mult(mult(mult(X1,X0),X1),X2),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',f10) ).

fof(f12,plain,
    ! [X2,X0,X1] : mult(mult(mult(X1,X0),X1),X2) = ifeq(mult(X0,mult(X1,mult(X2,X1))),mult(mult(mult(X0,X1),X2),X1),mult(X1,mult(X0,mult(X1,X2))),mult(mult(mult(X1,X0),X1),X2)),
    inference(reorient_equations,[],[f11]) ).

fof(f17,negated_conjecture,
    mult(a,mult(b,mult(a,c))) != mult(mult(mult(a,b),a),c),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).

fof(f18,definition,
    ~ sP0(mult(a,mult(b,mult(a,c)))),
    introduced(definition,[new_symbols(definition,[sP0])],[inequality_splitting_name_introduction]) ).

fof(f19,plain,
    sP0(mult(mult(mult(a,b),a),c)),
    inference(inequality_splitting,[],[f17,f18]) ).

fof(f20,plain,
    ! [X2,X0,X1] : mult(mult(X0,mult(mult(X1,X2),X1)),X2) = mult(mult(X0,X1),mult(X2,mult(X1,X2))),
    inference(backward_demodulation,[],[f8,f9]) ).

fof(f21,plain,
    ! [X2,X0,X1] : mult(mult(X1,mult(X0,X1)),X2) = ifeq(mult(X0,mult(X1,mult(X2,X1))),mult(mult(mult(X0,X1),X2),X1),mult(X1,mult(X0,mult(X1,X2))),mult(mult(X1,mult(X0,X1)),X2)),
    inference(forward_demodulation,[],[f12,f9]) ).

fof(f24,plain,
    sP0(mult(mult(a,mult(b,a)),c)),
    inference(forward_demodulation,[],[f19,f9]) ).

fof(f25,plain,
    ! [X2,X0,X1] : mult(mult(X0,X1),mult(X2,mult(X1,X2))) = mult(mult(X0,mult(X1,mult(X2,X1))),X2),
    inference(forward_demodulation,[],[f20,f9]) ).

fof(f81,plain,
    ! [X0,X1] : mult(mult(X1,unit),mult(X0,mult(unit,X0))) = mult(mult(X1,mult(X0,unit)),X0),
    inference(superposition,[],[f25,f7]) ).

fof(f89,plain,
    ! [X0,X1] : mult(mult(X0,mult(unit,X0)),X1) = ifeq(mult(unit,mult(X0,mult(X1,X0))),mult(mult(mult(unit,X0),X1),X0),mult(X0,mult(X0,X1)),mult(mult(X0,mult(unit,X0)),X1)),
    inference(superposition,[],[f21,f7]) ).

fof(f92,plain,
    ! [X0,X1] : mult(mult(X0,X0),X1) = ifeq(mult(unit,mult(X0,mult(X1,X0))),mult(mult(X0,X1),X0),mult(X0,mult(X0,X1)),mult(mult(X0,X0),X1)),
    inference(forward_demodulation,[],[f89,f7]) ).

fof(f100,plain,
    ! [X0,X1] : mult(mult(X1,X0),X0) = mult(mult(X1,unit),mult(X0,mult(unit,X0))),
    inference(forward_demodulation,[],[f81,f6]) ).

fof(f112,plain,
    ! [X0,X1] : mult(mult(X0,X0),X1) = ifeq(mult(unit,mult(X0,mult(X1,X0))),mult(X0,mult(X1,X0)),mult(X0,mult(X0,X1)),mult(mult(X0,X0),X1)),
    inference(forward_demodulation,[],[f92,f9]) ).

fof(f125,plain,
    ! [X0,X1] : mult(mult(X1,X0),X0) = mult(mult(X1,unit),mult(X0,X0)),
    inference(forward_demodulation,[],[f100,f7]) ).

fof(f137,plain,
    ! [X0,X1] : mult(mult(X0,X0),X1) = ifeq(mult(X0,mult(X1,X0)),mult(X0,mult(X1,X0)),mult(X0,mult(X0,X1)),mult(mult(X0,X0),X1)),
    inference(forward_demodulation,[],[f112,f7]) ).

fof(f145,plain,
    ! [X0,X1] : mult(mult(X1,X0),X0) = mult(X1,mult(X0,X0)),
    inference(forward_demodulation,[],[f125,f6]) ).

fof(f157,plain,
    ! [X0,X1] : mult(X0,mult(X0,X1)) = mult(mult(X0,X0),X1),
    inference(forward_demodulation,[],[f137,f1]) ).

fof(f315,plain,
    ! [X0,X1] : mult(X0,X1) = mult(X1,mult(ld(X1,X0),X1)),
    inference(superposition,[],[f9,f2]) ).

fof(f318,plain,
    ! [X2,X0,X1] : mult(mult(X1,mult(X2,X1)),ld(X1,X0)) = ifeq(mult(X2,mult(X1,mult(ld(X1,X0),X1))),mult(mult(mult(X2,X1),ld(X1,X0)),X1),mult(X1,mult(X2,X0)),mult(mult(X1,mult(X2,X1)),ld(X1,X0))),
    inference(superposition,[],[f21,f2]) ).

fof(f324,plain,
    ! [X2,X0,X1] : mult(mult(X1,ld(X2,X0)),mult(X2,mult(ld(X2,X0),X2))) = mult(mult(X1,mult(ld(X2,X0),X0)),X2),
    inference(superposition,[],[f25,f2]) ).

fof(f331,plain,
    ! [X2,X0,X1] : mult(mult(X1,mult(X2,X1)),ld(X1,X0)) = ifeq(mult(X2,mult(X0,X1)),mult(mult(mult(X2,X1),ld(X1,X0)),X1),mult(X1,mult(X2,X0)),mult(mult(X1,mult(X2,X1)),ld(X1,X0))),
    inference(backward_demodulation,[],[f318,f315]) ).

fof(f333,plain,
    ! [X2,X0,X1] : mult(mult(X1,mult(ld(X2,X0),X0)),X2) = mult(mult(X1,ld(X2,X0)),mult(X0,X2)),
    inference(backward_demodulation,[],[f324,f315]) ).

fof(f373,plain,
    ! [X2,X0,X1] : mult(mult(X2,X1),mult(ld(X1,X0),mult(X1,ld(X1,X0)))) = mult(mult(X2,mult(X0,X1)),ld(X1,X0)),
    inference(superposition,[],[f25,f315]) ).

fof(f406,plain,
    ! [X2,X0,X1] : mult(mult(X2,mult(X0,X1)),ld(X1,X0)) = mult(mult(X2,X1),mult(ld(X1,X0),X0)),
    inference(forward_demodulation,[],[f373,f2]) ).

fof(f620,plain,
    ! [X0,X1] : mult(X0,X1) = mult(f(X0),mult(f(X0),X1)),
    inference(superposition,[],[f157,f10]) ).

fof(f1154,plain,
    ! [X0,X1] : mult(mult(unit,X1),mult(ld(X1,X0),X0)) = mult(mult(X0,X1),ld(X1,X0)),
    inference(superposition,[],[f406,f7]) ).

fof(f1191,plain,
    ! [X0,X1] : mult(X1,mult(ld(X1,X0),X0)) = mult(mult(X0,X1),ld(X1,X0)),
    inference(forward_demodulation,[],[f1154,f7]) ).

fof(f1226,plain,
    ! [X0,X1] : mult(X0,X1) = rd(mult(X0,mult(X1,X0)),X0),
    inference(superposition,[],[f5,f9]) ).

fof(f1231,plain,
    ! [X2,X0,X1] : mult(X0,mult(X1,mult(X2,X1))) = rd(mult(mult(X0,X1),mult(X2,mult(X1,X2))),X2),
    inference(superposition,[],[f5,f25]) ).

fof(f1256,plain,
    ! [X2,X0,X1] : mult(rd(X0,X1),mult(X1,mult(X2,X1))) = rd(mult(X0,mult(X2,mult(X1,X2))),X2),
    inference(superposition,[],[f1231,f4]) ).

fof(f1362,plain,
    ! [X0,X1] : rd(mult(X0,mult(X1,X0)),X0) = mult(rd(unit,X1),mult(X1,mult(X0,X1))),
    inference(superposition,[],[f1256,f7]) ).

fof(f1398,plain,
    ! [X0,X1] : mult(X0,X1) = mult(rd(unit,X1),mult(X1,mult(X0,X1))),
    inference(forward_demodulation,[],[f1362,f1226]) ).

fof(f2321,plain,
    ! [X0,X1] : mult(rd(unit,X1),mult(X1,X0)) = X0,
    inference(superposition,[],[f1398,f4]) ).

fof(f2671,plain,
    ! [X0,X1] : ld(X1,X0) = mult(rd(unit,X1),X0),
    inference(superposition,[],[f2321,f2]) ).

fof(f2952,plain,
    ! [X0,X1] : rd(unit,X0) = rd(ld(X0,X1),X1),
    inference(superposition,[],[f5,f2671]) ).

fof(f2966,plain,
    ! [X0,X1] : mult(ld(X0,X1),X1) = mult(rd(unit,X0),mult(X1,X1)),
    inference(superposition,[],[f145,f2671]) ).

fof(f3007,plain,
    ! [X0] : rd(unit,X0) = ld(X0,unit),
    inference(superposition,[],[f6,f2671]) ).

fof(f3023,plain,
    ! [X0,X1] : ld(X1,X0) = mult(ld(X1,unit),X0),
    inference(backward_demodulation,[],[f2671,f3007]) ).

fof(f3093,plain,
    ! [X0,X1] : mult(ld(X0,X1),X1) = mult(ld(X0,unit),mult(X1,X1)),
    inference(forward_demodulation,[],[f2966,f3007]) ).

fof(f3107,plain,
    ! [X0,X1] : ld(X0,unit) = rd(ld(X0,X1),X1),
    inference(forward_demodulation,[],[f2952,f3007]) ).

fof(f3156,plain,
    ! [X0,X1] : mult(ld(X0,X1),X1) = ld(X0,mult(X1,X1)),
    inference(forward_demodulation,[],[f3093,f3023]) ).

fof(f3475,plain,
    ! [X0,X1] : ld(X1,X0) = mult(ld(X1,f(X0)),f(X0)),
    inference(superposition,[],[f3156,f10]) ).

fof(f3483,plain,
    ! [X0,X1] : mult(X1,X1) = mult(X0,mult(ld(X0,X1),X1)),
    inference(superposition,[],[f2,f3156]) ).

fof(f3488,plain,
    ! [X0,X1] : mult(X0,X0) = mult(mult(X0,X1),ld(X1,X0)),
    inference(backward_demodulation,[],[f1191,f3483]) ).

fof(f3561,plain,
    ! [X0,X1] : ld(X1,X0) = ld(mult(X0,X1),mult(X0,X0)),
    inference(superposition,[],[f3,f3488]) ).

fof(f3601,plain,
    ! [X0,X1] : ld(X1,X0) = mult(ld(mult(X0,X1),X0),X0),
    inference(forward_demodulation,[],[f3561,f3156]) ).

fof(f3706,plain,
    ! [X2,X0,X1] : mult(mult(X2,ld(mult(X1,X0),X1)),mult(X1,mult(X1,X0))) = mult(mult(X2,ld(X0,X1)),mult(X1,X0)),
    inference(superposition,[],[f333,f3601]) ).

fof(f3709,plain,
    ! [X0,X1] : rd(ld(X0,X1),X1) = ld(mult(X1,X0),X1),
    inference(superposition,[],[f5,f3601]) ).

fof(f3762,plain,
    ! [X0,X1] : ld(X0,unit) = ld(mult(X1,X0),X1),
    inference(forward_demodulation,[],[f3709,f3107]) ).

fof(f3789,plain,
    ! [X2,X0,X1] : mult(mult(X2,ld(X0,X1)),mult(X1,X0)) = mult(mult(X2,ld(X0,unit)),mult(X1,mult(X1,X0))),
    inference(backward_demodulation,[],[f3706,f3762]) ).

fof(f3951,plain,
    ! [X0,X1] : ld(X1,unit) = ld(X0,rd(X0,X1)),
    inference(superposition,[],[f3762,f4]) ).

fof(f4033,plain,
    ! [X2,X0,X1] : mult(mult(X2,ld(X0,f(X1))),mult(f(X1),X0)) = mult(mult(X2,ld(X0,X1)),X0),
    inference(superposition,[],[f333,f3475]) ).

fof(f4093,plain,
    ! [X0,X1] : rd(X1,X0) = mult(X1,ld(X0,unit)),
    inference(superposition,[],[f2,f3951]) ).

fof(f4127,plain,
    ! [X2,X0,X1] : mult(mult(X2,ld(X0,X1)),mult(X1,X0)) = mult(rd(X2,X0),mult(X1,mult(X1,X0))),
    inference(backward_demodulation,[],[f3789,f4093]) ).

fof(f4233,plain,
    ! [X2,X0,X1] : mult(mult(X2,ld(X0,X1)),X0) = mult(rd(X2,X0),mult(f(X1),mult(f(X1),X0))),
    inference(backward_demodulation,[],[f4033,f4127]) ).

fof(f4278,plain,
    ! [X2,X0,X1] : mult(mult(X2,ld(X0,X1)),X0) = mult(rd(X2,X0),mult(X1,X0)),
    inference(forward_demodulation,[],[f4233,f620]) ).

fof(f4323,plain,
    ! [X2,X0,X1] : mult(mult(X1,mult(X2,X1)),ld(X1,X0)) = ifeq(mult(X2,mult(X0,X1)),mult(rd(mult(X2,X1),X1),mult(X0,X1)),mult(X1,mult(X2,X0)),mult(mult(X1,mult(X2,X1)),ld(X1,X0))),
    inference(backward_demodulation,[],[f331,f4278]) ).

fof(f4346,plain,
    ! [X2,X0,X1] : mult(mult(X1,mult(X2,X1)),ld(X1,X0)) = ifeq(mult(X2,mult(X0,X1)),mult(X2,mult(X0,X1)),mult(X1,mult(X2,X0)),mult(mult(X1,mult(X2,X1)),ld(X1,X0))),
    inference(forward_demodulation,[],[f4323,f5]) ).

fof(f4366,plain,
    ! [X2,X0,X1] : mult(X1,mult(X2,X0)) = mult(mult(X1,mult(X2,X1)),ld(X1,X0)),
    inference(forward_demodulation,[],[f4346,f1]) ).

fof(f4463,plain,
    ! [X2,X0,X1] : mult(mult(X1,mult(X2,X1)),X0) = mult(X1,mult(X2,mult(X1,X0))),
    inference(superposition,[],[f4366,f3]) ).

fof(f4771,plain,
    sP0(mult(a,mult(b,mult(a,c)))),
    inference(backward_demodulation,[],[f24,f4463]) ).

fof(f4829,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f4771,f18]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : GRP667-10 : TPTP v9.3.1. Released v7.5.0.
% 0.00/0.07  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.41  % Computer : n003.cluster.edu
% 0.15/0.41  % Model    : x86_64 x86_64
% 0.15/0.41  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.41  % Memory   : 8046.5625MB
% 0.15/0.41  % OS       : Linux 6.8.0-71-generic
% 0.15/0.42  % CPULimit : 300
% 0.15/0.42  % WCLimit  : 300
% 0.15/0.42  % DateTime : Sun Sep 27 10:35:40 UTC 2026
% 0.15/0.42  % CPUTime  : 
% 0.15/0.42  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.23/0.48  Running first-order theorem proving
% 0.23/0.48  Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 28.55/4.99  % (320521)Detected a unit-equality problem, will run specialized UEQ schedule.
% 28.55/4.99  % (320529)ott-1010_1_sfv=off:to=lpo:sil=8000:fdtod=off:sp=reverse_frequency:spb=goal_then_units:fd=preordered:random_seed=1373659233:i=136:bd=preordered:ins=2:av=off_2999 on theBenchmark for (2999ds/136Mi)
% 28.55/4.99  % (320532)dis-1010_7_sil=8000:fde=unused:flr=on:random_seed=2688570711:i=1187:sd=4:av=off:ss=axioms:sgt=32_2999 on theBenchmark for (2999ds/1187Mi)
% 28.55/4.99  % (320529)Instruction limit reached! 
% 28.55/4.99  % (320529)------------------------------
% 28.55/4.99  % (320529)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 28.55/4.99  % (320529)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 28.55/4.99  % (320529)CaDiCaL version: 2.1.3
% 28.55/4.99  % (320529)Termination reason: Instruction limit
% 28.55/4.99  % (320529)Termination phase: Saturation
% 28.55/4.99  % (320529)Time elapsed: 0.068 s
% 28.55/4.99  % (320529)Peak memory usage: 89 MB
% 28.55/4.99  % (320529)Instructions burned: 137 (million)
% 28.55/4.99  % (320526)lrs+1002_1_ncem=casc2026/models/loop7.pt:sil=128000:tgt=ground:npcc=on:drc=off:sp=reverse_frequency:spb=goal:acc=on:s2agt=16:kmz=on:sac=on:random_seed=1253754103:i=138329:kws=inv_arity_squared:fgj=on:bd=preordered_2999 on theBenchmark for (2999ds/138329Mi)
% 28.55/4.99  % (320528)lrs+10_1_ncem=casc2026/models/loop5.pt:sil=128000:tgt=ground:npcc=on:spb=goal_then_units:urr=ec_only:random_seed=710141435:i=130716:gtgl=4:add=on:doe=on:bd=all:gtg=exists_sym_2999 on theBenchmark for (2999ds/130716Mi)
% 28.55/4.99  % (320530)dis+10_14_to=lpo:sil=8000:tgt=full:drc=off:sp=const_frequency:sos=all:random_seed=1007316973:i=181:gtgl=5:bs=unit_only:fsr=off:gtg=exists_all_2999 on theBenchmark for (2999ds/181Mi)
% 28.55/4.99  % (320527)lrs+11_1_ncem=casc2026/models/loop6.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=622141590:i=130792:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/130792Mi)
% 28.55/4.99  % (320531)lrs+10_3_to=lpo:sil=64000:drc=off:fde=unused:sp=reverse_frequency:acc=on:bsr=on:fd=preordered:nwc=1:random_seed=2281382331:avsq=on:i=257:avsqr=16,3:bd=preordered:fsr=off_2999 on theBenchmark for (2999ds/257Mi)
% 28.55/4.99  % (320530)Instruction limit reached! 
% 28.55/4.99  % (320530)------------------------------
% 28.55/4.99  % (320530)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 28.55/4.99  % (320530)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 28.55/4.99  % (320530)CaDiCaL version: 2.1.3
% 28.55/4.99  % (320530)Termination reason: Instruction limit
% 28.55/4.99  % (320530)Termination phase: Saturation
% 28.55/4.99  % (320530)Time elapsed: 0.179 s
% 28.55/4.99  % (320530)Peak memory usage: 89 MB
% 28.55/4.99  % (320530)Instructions burned: 181 (million)
% 28.55/4.99  % (320535)lrs-1011_1_ncem=casc2026/models/loop8.pt:sil=32000:npcc=on:prc=on:fde=unused:lcm=predicate:bsr=on:flr=on:random_seed=3759191896:i=2051:gtgl=2:fgj=on:bd=all:gtg=exists_top_2997 on theBenchmark for (2997ds/2051Mi)
% 28.55/4.99  % (320531)Instruction limit reached! 
% 28.55/4.99  % (320531)------------------------------
% 28.55/4.99  % (320531)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 28.55/4.99  % (320531)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 28.55/4.99  % (320531)CaDiCaL version: 2.1.3
% 28.55/4.99  % (320531)Termination reason: Instruction limit
% 28.55/4.99  % (320531)Termination phase: Saturation
% 28.55/4.99  % (320531)Time elapsed: 0.264 s
% 28.55/4.99  % (320531)Peak memory usage: 90 MB
% 28.55/4.99  % (320531)Instructions burned: 257 (million)
% 28.55/4.99  % (320543)lrs+10_5:1_sil=8000:sos=all:urr=on:br=off:flr=on:random_seed=1136090722:i=215:ep=RSTC_2994 on theBenchmark for (2994ds/215Mi)
% 28.55/4.99  % (320541)lrs-1002_1_ncem=casc2026/models/all5champsBiggishL14.pt:sil=16000:npcc=on:random_seed=3425718323:i=4948:ss=axioms:sgt=16_2995 on theBenchmark for (2995ds/4948Mi)
% 28.55/4.99  % (320543)Instruction limit reached! 
% 28.55/4.99  % (320543)------------------------------
% 28.55/4.99  % (320543)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 28.55/4.99  % (320543)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 28.55/4.99  % (320543)CaDiCaL version: 2.1.3
% 28.55/4.99  % (320543)Termination reason: Instruction limit
% 28.55/4.99  % (320543)Termination phase: Saturation
% 28.55/4.99  % (320543)Time elapsed: 0.203 s
% 28.55/4.99  % (320543)Peak memory usage: 90 MB
% 28.55/4.99  % (320543)Instructions burned: 216 (million)
% 28.55/4.99  % (320532)Instruction limit reached! 
% 28.55/4.99  % (320532)------------------------------
% 28.55/4.99  % (320532)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 28.55/4.99  % (320532)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 28.55/4.99  % (320532)CaDiCaL version: 2.1.3
% 28.55/4.99  % (320532)Termination reason: Instruction limit
% 28.55/4.99  % (320532)Termination phase: Saturation
% 28.55/4.99  % (320532)Time elapsed: 0.968 s
% 28.55/4.99  % (320532)Peak memory usage: 99 MB
% 28.55/4.99  % (320532)Instructions burned: 1187 (million)
% 28.55/4.99  % (320546)lrs+11_1_sil=16000:tgt=full:fde=none:sp=reverse_frequency:lma=off:fs=off:acc=on:bsr=unit_only:rp=on:random_seed=2941209705:avsq=on:i=317:avsqr=1,16:kws=arity_squared:add=off:fgj=on:ins=10:fsr=off:gtg=exists_sym_2990 on theBenchmark for (2990ds/317Mi)
% 28.55/4.99  % (320548)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=64000:tgt=full:npcc=on:sp=arity:lcm=predicate:urr=on:s2agt=16:br=off:random_seed=655406847:i=12125:sd=2:fgj=on:ss=axioms:sgt=64_2987 on theBenchmark for (2987ds/12125Mi)
% 28.55/4.99  % (320546)Instruction limit reached! 
% 28.55/4.99  % (320546)------------------------------
% 28.55/4.99  % (320546)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 28.55/4.99  % (320546)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 28.55/4.99  % (320546)CaDiCaL version: 2.1.3
% 28.55/4.99  % (320546)Termination reason: Instruction limit
% 28.55/4.99  % (320546)Termination phase: Saturation
% 28.55/4.99  % (320546)Time elapsed: 0.316 s
% 28.55/4.99  % (320546)Peak memory usage: 95 MB
% 28.55/4.99  % (320546)Instructions burned: 317 (million)
% 28.55/4.99  % (320535)Instruction limit reached! 
% 28.55/4.99  % (320535)------------------------------
% 28.55/4.99  % (320535)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 28.55/4.99  % (320535)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 28.55/4.99  % (320535)CaDiCaL version: 2.1.3
% 28.55/4.99  % (320535)Termination reason: Instruction limit
% 28.55/4.99  % (320535)Termination phase: Saturation
% 28.55/4.99  % (320535)Time elapsed: 1.106 s
% 28.55/4.99  % (320535)Peak memory usage: 141 MB
% 28.55/4.99  % (320535)Instructions burned: 2052 (million)
% 28.55/4.99  % (320550)lrs+10_32_sil=8000:tgt=ground:prc=on:sp=reverse_arity:spb=non_intro:random_seed=1009141558:i=2836:kws=inv_precedence:fgj=on:bd=preordered:ins=10_2984 on theBenchmark for (2984ds/2836Mi)
% 28.55/4.99  % (320551)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=32000:npcc=on:lma=off:kmz=on:random_seed=1508391171:i=14534:kws=arity:fgj=on:bd=preordered:ins=6:ss=axioms:sgt=30_2983 on theBenchmark for (2983ds/14534Mi)
% 28.55/4.99  % (320551)First to succeed.
% 28.55/4.99  % (320551)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-320521"
% 28.55/4.99  % (320551)Refutation found. Thanks to Tanya!
% 28.55/4.99  % SZS status Unsatisfiable for theBenchmark
% 28.55/4.99  % SZS output start Proof for theBenchmark
% See solution above
% 29.40/5.24  % (320551)------------------------------
% 29.40/5.24  % (320551)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 29.40/5.24  % (320551)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 29.40/5.24  % (320551)CaDiCaL version: 2.1.3
% 29.40/5.24  % (320551)Termination reason: Refutation
% 29.40/5.24  % (320551)Time elapsed: 1.758 s
% 29.40/5.24  % (320551)Peak memory usage: 140 MB
% 29.40/5.24  % (320551)Instructions burned: 2175 (million)
% 29.40/5.24  % (320551)------------------------------
% 29.40/5.24  % (320551)------------------------------
% 29.40/5.24  % (320521)Success in time 4.033 s
% 29.40/5.24  % Vampire exiting
%------------------------------------------------------------------------------