↑ Up

Vampire---5.0.1.UNS-Ref.s

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

% Computer : n006.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:19:33 AM UTC 2026

% Result   : Unsatisfiable 15.62s 3.25s
% Output   : Refutation 15.62s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   23
%            Number of leaves      :   15
% Syntax   : Number of formulae    :   80 (  80 unt;   9 def)
%            Number of atoms       :   80 (  74 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    4 (   4   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   1 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :   13 (  13 usr;  12 con; 0-2 aty)
%            Number of variables   :   35 (  35   !;   0   ?)

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

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

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

fof(f4,plain,
    ! [X2,X3,X0,X1] : mult(mult(X0,X2),mult(X1,X3)) = mult(mult(mult(X0,X1),mult(X2,X3)),mult(mult(mult(X0,X1),mult(X2,X3)),mult(mult(X0,X2),mult(X1,X3)))),
    inference(reorient_equations,[],[f3]) ).

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

fof(f6,plain,
    ! [X2,X3,X0,X1] : mult(mult(X0,X1),mult(X2,X3)) = mult(mult(mult(mult(X0,X1),mult(X2,X3)),mult(mult(X0,X2),mult(X1,X3))),mult(mult(X0,X2),mult(X1,X3))),
    inference(reorient_equations,[],[f5]) ).

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

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

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

fof(f10,plain,
    sP0(mult(mult(mult(a,c),mult(b,d)),mult(mult(a,b),mult(c,d)))),
    inference(inequality_splitting,[],[f8,f9]) ).

fof(f11,definition,
    sF1 = mult(a,b),
    introduced(definition,[new_symbols(definition,[sF1])],[function_definition]) ).

fof(f12,plain,
    mult(a,b) = sF1,
    inference(reorient_equations,[],[f11]) ).

fof(f13,definition,
    sF2 = mult(c,d),
    introduced(definition,[new_symbols(definition,[sF2])],[function_definition]) ).

fof(f14,plain,
    mult(c,d) = sF2,
    inference(reorient_equations,[],[f13]) ).

fof(f15,definition,
    sF3 = mult(sF1,sF2),
    introduced(definition,[new_symbols(definition,[sF3])],[function_definition]) ).

fof(f16,plain,
    mult(sF1,sF2) = sF3,
    inference(reorient_equations,[],[f15]) ).

fof(f17,definition,
    sF4 = mult(a,c),
    introduced(definition,[new_symbols(definition,[sF4])],[function_definition]) ).

fof(f18,plain,
    mult(a,c) = sF4,
    inference(reorient_equations,[],[f17]) ).

fof(f19,definition,
    sF5 = mult(b,d),
    introduced(definition,[new_symbols(definition,[sF5])],[function_definition]) ).

fof(f20,plain,
    mult(b,d) = sF5,
    inference(reorient_equations,[],[f19]) ).

fof(f21,definition,
    sF6 = mult(sF4,sF5),
    introduced(definition,[new_symbols(definition,[sF6])],[function_definition]) ).

fof(f22,plain,
    mult(sF4,sF5) = sF6,
    inference(reorient_equations,[],[f21]) ).

fof(f23,definition,
    sF7 = mult(sF3,sF6),
    introduced(definition,[new_symbols(definition,[sF7])],[function_definition]) ).

fof(f24,plain,
    mult(sF3,sF6) = sF7,
    inference(reorient_equations,[],[f23]) ).

fof(f25,plain,
    ~ sP0(sF7),
    inference(definition_folding,[],[f9,f24,f22,f20,f18,f16,f14,f12]) ).

fof(f26,definition,
    sF8 = mult(sF6,sF3),
    introduced(definition,[new_symbols(definition,[sF8])],[function_definition]) ).

fof(f27,plain,
    mult(sF6,sF3) = sF8,
    inference(reorient_equations,[],[f26]) ).

fof(f28,plain,
    sP0(sF8),
    inference(definition_folding,[],[f10,f27,f16,f14,f12,f22,f20,f18]) ).

fof(f29,plain,
    sF3 = mult(sF1,mult(c,d)),
    inference(forward_demodulation,[],[f16,f14]) ).

fof(f30,plain,
    mult(mult(a,b),mult(c,d)) = sF3,
    inference(forward_demodulation,[],[f29,f12]) ).

fof(f35,plain,
    ! [X0] : mult(sF3,mult(sF6,X0)) = mult(sF7,mult(sF3,X0)),
    inference(superposition,[],[f1,f24]) ).

fof(f37,plain,
    ! [X0] : mult(sF6,mult(sF3,X0)) = mult(sF8,mult(sF6,X0)),
    inference(superposition,[],[f1,f27]) ).

fof(f38,plain,
    ! [X0,X1] : mult(X0,mult(X1,X0)) = mult(mult(X0,X1),X0),
    inference(superposition,[],[f1,f7]) ).

fof(f43,plain,
    ! [X0] : mult(sF3,mult(X0,sF6)) = mult(mult(sF3,X0),sF7),
    inference(superposition,[],[f1,f24]) ).

fof(f66,plain,
    mult(sF7,mult(sF3,sF3)) = mult(sF3,sF8),
    inference(superposition,[],[f35,f27]) ).

fof(f71,plain,
    mult(sF3,sF8) = mult(sF7,sF3),
    inference(forward_demodulation,[],[f66,f7]) ).

fof(f80,plain,
    mult(sF8,mult(sF6,sF6)) = mult(sF6,sF7),
    inference(superposition,[],[f37,f24]) ).

fof(f87,plain,
    mult(sF6,sF7) = mult(sF8,sF6),
    inference(forward_demodulation,[],[f80,f7]) ).

fof(f107,plain,
    mult(sF6,mult(sF7,sF6)) = mult(mult(sF8,sF6),sF6),
    inference(superposition,[],[f38,f87]) ).

fof(f163,plain,
    ! [X0] : mult(sF8,mult(sF6,mult(X0,sF6))) = mult(sF6,mult(mult(sF3,X0),sF7)),
    inference(superposition,[],[f37,f43]) ).

fof(f225,plain,
    ! [X0] : mult(mult(sF3,X0),sF6) = mult(sF7,mult(X0,sF6)),
    inference(superposition,[],[f2,f24]) ).

fof(f399,plain,
    mult(mult(a,c),mult(b,d)) = mult(sF3,mult(sF3,mult(mult(a,c),mult(b,d)))),
    inference(superposition,[],[f4,f30]) ).

fof(f476,plain,
    mult(mult(a,c),sF5) = mult(sF3,mult(sF3,mult(mult(a,c),sF5))),
    inference(forward_demodulation,[],[f399,f20]) ).

fof(f482,plain,
    mult(sF4,sF5) = mult(sF3,mult(sF3,mult(sF4,sF5))),
    inference(forward_demodulation,[],[f476,f18]) ).

fof(f487,plain,
    sF6 = mult(sF3,mult(sF3,sF6)),
    inference(forward_demodulation,[],[f482,f22]) ).

fof(f492,plain,
    sF6 = mult(mult(sF3,sF3),sF7),
    inference(forward_demodulation,[],[f487,f43]) ).

fof(f493,plain,
    sF6 = mult(sF3,sF7),
    inference(forward_demodulation,[],[f492,f7]) ).

fof(f516,plain,
    mult(sF6,sF6) = mult(sF7,mult(sF7,sF6)),
    inference(superposition,[],[f225,f493]) ).

fof(f517,plain,
    mult(sF6,sF6) = mult(sF8,mult(sF6,sF7)),
    inference(superposition,[],[f37,f493]) ).

fof(f518,plain,
    ! [X0] : mult(sF6,mult(sF3,X0)) = mult(sF3,mult(sF7,X0)),
    inference(superposition,[],[f1,f493]) ).

fof(f521,plain,
    ! [X0] : mult(mult(sF3,X0),sF7) = mult(sF6,mult(X0,sF7)),
    inference(superposition,[],[f2,f493]) ).

fof(f526,plain,
    mult(sF6,sF3) = mult(sF3,mult(sF7,sF3)),
    inference(superposition,[],[f38,f493]) ).

fof(f527,plain,
    mult(sF6,sF3) = mult(sF3,mult(sF3,sF8)),
    inference(forward_demodulation,[],[f526,f71]) ).

fof(f529,plain,
    ! [X0] : mult(sF8,mult(sF6,mult(X0,sF6))) = mult(sF6,mult(sF6,mult(X0,sF7))),
    inference(backward_demodulation,[],[f163,f521]) ).

fof(f544,plain,
    ! [X0] : mult(sF8,mult(sF6,X0)) = mult(sF3,mult(sF7,X0)),
    inference(forward_demodulation,[],[f518,f37]) ).

fof(f545,plain,
    mult(sF6,sF6) = mult(sF8,mult(sF8,sF6)),
    inference(forward_demodulation,[],[f517,f87]) ).

fof(f546,plain,
    sF6 = mult(sF7,mult(sF7,sF6)),
    inference(forward_demodulation,[],[f516,f7]) ).

fof(f547,plain,
    sF8 = mult(sF3,mult(sF3,sF8)),
    inference(forward_demodulation,[],[f527,f27]) ).

fof(f551,plain,
    sF6 = mult(sF8,mult(sF8,sF6)),
    inference(forward_demodulation,[],[f545,f7]) ).

fof(f583,plain,
    ! [X0] : mult(sF8,mult(X0,mult(sF8,sF6))) = mult(mult(sF8,X0),sF6),
    inference(superposition,[],[f1,f551]) ).

fof(f844,plain,
    mult(sF8,sF7) = mult(sF6,mult(mult(sF3,sF8),sF7)),
    inference(superposition,[],[f521,f547]) ).

fof(f860,plain,
    mult(sF8,sF7) = mult(sF6,mult(sF6,mult(sF8,sF7))),
    inference(forward_demodulation,[],[f844,f521]) ).

fof(f866,plain,
    mult(sF8,sF7) = mult(sF8,mult(sF6,mult(sF8,sF6))),
    inference(forward_demodulation,[],[f860,f529]) ).

fof(f870,plain,
    mult(mult(sF8,sF6),sF6) = mult(sF8,sF7),
    inference(forward_demodulation,[],[f866,f583]) ).

fof(f872,plain,
    mult(sF6,mult(sF7,sF6)) = mult(sF8,sF7),
    inference(backward_demodulation,[],[f107,f870]) ).

fof(f932,plain,
    mult(sF3,sF6) = mult(sF8,mult(sF6,mult(sF7,sF6))),
    inference(superposition,[],[f544,f546]) ).

fof(f953,plain,
    mult(sF3,sF6) = mult(sF8,mult(sF8,sF7)),
    inference(forward_demodulation,[],[f932,f872]) ).

fof(f958,plain,
    sF7 = mult(sF8,mult(sF8,sF7)),
    inference(forward_demodulation,[],[f953,f24]) ).

fof(f1279,plain,
    sF3 = mult(mult(sF3,mult(mult(a,c),mult(b,d))),mult(mult(a,c),mult(b,d))),
    inference(superposition,[],[f6,f30]) ).

fof(f1430,plain,
    sF3 = mult(mult(sF3,mult(mult(a,c),sF5)),mult(mult(a,c),sF5)),
    inference(forward_demodulation,[],[f1279,f20]) ).

fof(f1438,plain,
    sF3 = mult(mult(sF3,mult(sF4,sF5)),mult(sF4,sF5)),
    inference(forward_demodulation,[],[f1430,f18]) ).

fof(f1446,plain,
    sF3 = mult(mult(sF3,sF6),sF6),
    inference(forward_demodulation,[],[f1438,f22]) ).

fof(f1454,plain,
    sF3 = mult(sF7,mult(sF6,sF6)),
    inference(forward_demodulation,[],[f1446,f225]) ).

fof(f1458,plain,
    sF3 = mult(sF7,sF6),
    inference(forward_demodulation,[],[f1454,f7]) ).

fof(f1478,plain,
    mult(sF6,sF3) = mult(sF8,sF7),
    inference(backward_demodulation,[],[f872,f1458]) ).

fof(f1519,plain,
    sF8 = mult(sF8,sF7),
    inference(forward_demodulation,[],[f1478,f27]) ).

fof(f1571,plain,
    sF7 = mult(sF8,sF8),
    inference(backward_demodulation,[],[f958,f1519]) ).

fof(f1787,plain,
    sF7 = sF8,
    inference(forward_demodulation,[],[f1571,f7]) ).

fof(f1871,plain,
    ~ sP0(sF8),
    inference(backward_demodulation,[],[f25,f1787]) ).

fof(f2258,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f1871,f28]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : ALG245-1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.07  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.26  % Computer : n006.cluster.edu
% 0.10/0.26  % Model    : x86_64 x86_64
% 0.10/0.26  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.26  % Memory   : 8046.5625MB
% 0.10/0.26  % OS       : Linux 6.8.0-71-generic
% 0.10/0.26  % CPULimit : 300
% 0.10/0.27  % WCLimit  : 300
% 0.10/0.27  % DateTime : Mon Sep 28 19:58:25 UTC 2026
% 0.10/0.27  % CPUTime  : 
% 0.10/0.27  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.25/0.32  Running first-order theorem proving
% 0.25/0.32  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
% 13.53/2.99  % (117991)Detected a unit-equality problem, will run specialized UEQ schedule.
% 13.53/2.99  % (117997)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=4004430:i=130792:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/130792Mi)
% 13.53/2.99  % (117996)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=402825676:i=138329:kws=inv_arity_squared:fgj=on:bd=preordered_2999 on theBenchmark for (2999ds/138329Mi)
% 13.53/2.99  % (118001)lrs+10_3_to=lpo:sil=64000:drc=off:fde=unused:sp=reverse_frequency:acc=on:bsr=on:fd=preordered:nwc=1:random_seed=2254192176:avsq=on:i=257:avsqr=16,3:bd=preordered:fsr=off_2999 on theBenchmark for (2999ds/257Mi)
% 13.53/2.99  % (117999)ott-1010_1_sfv=off:to=lpo:sil=8000:fdtod=off:sp=reverse_frequency:spb=goal_then_units:fd=preordered:random_seed=4240974777:i=136:bd=preordered:ins=2:av=off_2999 on theBenchmark for (2999ds/136Mi)
% 13.53/2.99  % (117998)lrs+10_1_ncem=casc2026/models/loop5.pt:sil=128000:tgt=ground:npcc=on:spb=goal_then_units:urr=ec_only:random_seed=2019933565:i=130716:gtgl=4:add=on:doe=on:bd=all:gtg=exists_sym_2999 on theBenchmark for (2999ds/130716Mi)
% 13.53/2.99  % (118002)dis-1010_7_sil=8000:fde=unused:flr=on:random_seed=3735233440:i=1187:sd=4:av=off:ss=axioms:sgt=32_2999 on theBenchmark for (2999ds/1187Mi)
% 13.53/2.99  % (118000)dis+10_14_to=lpo:sil=8000:tgt=full:drc=off:sp=const_frequency:sos=all:random_seed=4053525282:i=181:gtgl=5:bs=unit_only:fsr=off:gtg=exists_all_2999 on theBenchmark for (2999ds/181Mi)
% 13.53/2.99  % (118000)Refutation not found, incomplete strategy
% 13.53/2.99  % (118000)------------------------------
% 13.53/2.99  % (118000)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 13.53/2.99  % (118000)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.53/2.99  % (118000)CaDiCaL version: 2.1.3
% 13.53/2.99  % (118000)Termination reason: Refutation not found, incomplete strategy
% 13.53/2.99  % (118000)Time elapsed: 0.002 s
% 13.53/2.99  % (118000)Peak memory usage: 87 MB
% 13.53/2.99  % (118000)Instructions burned: 1 (million)
% 13.53/2.99  % (117999)Instruction limit reached! 
% 13.53/2.99  % (117999)------------------------------
% 13.53/2.99  % (117999)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 13.53/2.99  % (117999)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.53/2.99  % (117999)CaDiCaL version: 2.1.3
% 13.53/2.99  % (117999)Termination reason: Instruction limit
% 13.53/2.99  % (117999)Termination phase: Saturation
% 13.53/2.99  % (117999)Time elapsed: 0.132 s
% 13.53/2.99  % (117999)Peak memory usage: 88 MB
% 13.53/2.99  % (117999)Instructions burned: 136 (million)
% 13.53/2.99  % (118001)Instruction limit reached! 
% 13.53/2.99  % (118001)------------------------------
% 13.53/2.99  % (118001)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 13.53/2.99  % (118001)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.53/2.99  % (118001)CaDiCaL version: 2.1.3
% 13.53/2.99  % (118001)Termination reason: Instruction limit
% 13.53/2.99  % (118001)Termination phase: Saturation
% 13.53/2.99  % (118001)Time elapsed: 0.247 s
% 13.53/2.99  % (118001)Peak memory usage: 90 MB
% 13.53/2.99  % (118001)Instructions burned: 257 (million)
% 13.53/2.99  % (118000)------------------------------
% 13.53/2.99  % (118000)------------------------------
% 13.53/2.99  % (118011)lrs-1011_1_ncem=casc2026/models/loop8.pt:sil=32000:npcc=on:prc=on:fde=unused:lcm=predicate:bsr=on:flr=on:random_seed=752213226:i=2051:gtgl=2:fgj=on:bd=all:gtg=exists_top_2995 on theBenchmark for (2995ds/2051Mi)
% 13.53/2.99  % (118013)lrs-1002_1_ncem=casc2026/models/all5champsBiggishL14.pt:sil=16000:npcc=on:random_seed=381902897:i=4948:ss=axioms:sgt=16_2994 on theBenchmark for (2994ds/4948Mi)
% 13.53/2.99  % (118014)lrs+10_5:1_sil=8000:sos=all:urr=on:br=off:flr=on:random_seed=4253958237:i=215:ep=RSTC_2993 on theBenchmark for (2993ds/215Mi)
% 13.53/2.99  % (118014)Instruction limit reached! 
% 13.53/2.99  % (118014)------------------------------
% 13.53/2.99  % (118014)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 13.53/2.99  % (118014)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.53/2.99  % (118014)CaDiCaL version: 2.1.3
% 13.53/2.99  % (118014)Termination reason: Instruction limit
% 13.53/2.99  % (118014)Termination phase: Saturation
% 15.62/3.25  % (118014)Time elapsed: 0.092 s
% 15.62/3.25  % (118014)Peak memory usage: 89 MB
% 15.62/3.25  % (118014)Instructions burned: 216 (million)
% 15.62/3.25  % (118018)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=1112025280:avsq=on:i=317:avsqr=1,16:kws=arity_squared:add=off:fgj=on:ins=10:fsr=off:gtg=exists_sym_2989 on theBenchmark for (2989ds/317Mi)
% 15.62/3.25  % (118002)Instruction limit reached! 
% 15.62/3.25  % (118002)------------------------------
% 15.62/3.25  % (118002)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 15.62/3.25  % (118002)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 15.62/3.25  % (118002)CaDiCaL version: 2.1.3
% 15.62/3.25  % (118002)Termination reason: Instruction limit
% 15.62/3.25  % (118002)Termination phase: Saturation
% 15.62/3.25  % (118002)Time elapsed: 1.059 s
% 15.62/3.25  % (118002)Peak memory usage: 97 MB
% 15.62/3.25  % (118002)Instructions burned: 1187 (million)
% 15.62/3.25  % (118018)Instruction limit reached! 
% 15.62/3.25  % (118018)------------------------------
% 15.62/3.25  % (118018)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 15.62/3.25  % (118018)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 15.62/3.25  % (118018)CaDiCaL version: 2.1.3
% 15.62/3.25  % (118018)Termination reason: Instruction limit
% 15.62/3.25  % (118018)Termination phase: Saturation
% 15.62/3.25  % (118018)Time elapsed: 0.171 s
% 15.62/3.25  % (118018)Peak memory usage: 96 MB
% 15.62/3.25  % (118018)Instructions burned: 319 (million)
% 15.62/3.25  % (118022)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=247818058:i=12125:sd=2:fgj=on:ss=axioms:sgt=64_2986 on theBenchmark for (2986ds/12125Mi)
% 15.62/3.25  % (118023)lrs+10_32_sil=8000:tgt=ground:prc=on:sp=reverse_arity:spb=non_intro:random_seed=1971267964:i=2836:kws=inv_precedence:fgj=on:bd=preordered:ins=10_2985 on theBenchmark for (2985ds/2836Mi)
% 15.62/3.25  % (118023)First to succeed.
% 15.62/3.25  % (118023)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-117991"
% 15.62/3.25  % (117996)Also succeeded, but the first one will report.
% 15.62/3.25  % (118023)Refutation found. Thanks to Tanya!
% 15.62/3.25  % SZS status Unsatisfiable for theBenchmark
% 15.62/3.25  % SZS output start Proof for theBenchmark
% See solution above
% 15.62/3.25  % (118023)------------------------------
% 15.62/3.25  % (118023)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 15.62/3.25  % (118023)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 15.62/3.25  % (118023)CaDiCaL version: 2.1.3
% 15.62/3.25  % (118023)Termination reason: Refutation
% 15.62/3.25  % (118023)Time elapsed: 0.164 s
% 15.62/3.25  % (118023)Peak memory usage: 92 MB
% 15.62/3.25  % (118023)Instructions burned: 304 (million)
% 15.62/3.25  % (118023)------------------------------
% 15.62/3.25  % (118023)------------------------------
% 15.62/3.25  % (117991)Success in time 2.072 s
% 15.62/3.25  % Vampire exiting
%------------------------------------------------------------------------------