↑ Up

Vampire---5.0.1.UNS-Ref.s

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

% Computer : n010.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:14:06 AM UTC 2026

% Result   : Unsatisfiable 8.34s 2.13s
% Output   : Refutation 9.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   27
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   68 (  68 unt;   4 def)
%            Number of atoms       :   68 (  67 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    4 (   4   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :   10 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   6 con; 0-2 aty)
%            Number of variables   :  106 ( 106   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,negated_conjecture,
    ! [X2,X3,X0,X1] : divide(inverse(divide(divide(divide(X0,X0),X1),divide(X2,divide(X1,X3)))),X3) = X2,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_axiom) ).

fof(f2,negated_conjecture,
    ! [X0,X1] : multiply(X0,X1) = divide(X0,inverse(X1)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiply) ).

fof(f3,negated_conjecture,
    multiply(multiply(inverse(b2),b2),a2) != a2,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_2) ).

fof(f4,plain,
    a2 != multiply(multiply(inverse(b2),b2),a2),
    inference(reorient_equations,[],[f3]) ).

fof(f5,plain,
    a2 != divide(divide(inverse(b2),inverse(b2)),inverse(a2)),
    inference(definition_unfolding,[],[f4,f2,f2]) ).

fof(f6,definition,
    sF0 = inverse(b2),
    introduced(definition,[new_symbols(definition,[sF0])],[function_definition]) ).

fof(f7,plain,
    inverse(b2) = sF0,
    inference(reorient_equations,[],[f6]) ).

fof(f8,definition,
    sF1 = divide(sF0,sF0),
    introduced(definition,[new_symbols(definition,[sF1])],[function_definition]) ).

fof(f9,plain,
    divide(sF0,sF0) = sF1,
    inference(reorient_equations,[],[f8]) ).

fof(f10,definition,
    sF2 = inverse(a2),
    introduced(definition,[new_symbols(definition,[sF2])],[function_definition]) ).

fof(f11,plain,
    inverse(a2) = sF2,
    inference(reorient_equations,[],[f10]) ).

fof(f12,definition,
    sF3 = divide(sF1,sF2),
    introduced(definition,[new_symbols(definition,[sF3])],[function_definition]) ).

fof(f13,plain,
    divide(sF1,sF2) = sF3,
    inference(reorient_equations,[],[f12]) ).

fof(f14,plain,
    a2 != sF3,
    inference(definition_folding,[],[f5,f13,f11,f9,f7,f7]) ).

fof(f17,plain,
    ! [X2,X0,X1] : divide(inverse(divide(divide(sF1,X0),divide(X1,divide(X0,X2)))),X2) = X1,
    inference(superposition,[],[f1,f9]) ).

fof(f20,plain,
    ! [X0,X1] : divide(inverse(divide(sF3,divide(X0,divide(sF2,X1)))),X1) = X0,
    inference(superposition,[],[f17,f13]) ).

fof(f24,plain,
    ! [X0] : divide(inverse(divide(divide(sF1,sF1),divide(X0,sF3))),sF2) = X0,
    inference(superposition,[],[f17,f13]) ).

fof(f26,plain,
    ! [X2,X3,X0,X1] : inverse(divide(divide(sF1,X2),divide(X0,divide(X2,divide(X1,X3))))) = divide(inverse(divide(divide(sF1,X1),X0)),X3),
    inference(superposition,[],[f17,f17]) ).

fof(f28,plain,
    ! [X2,X3,X0,X1,X4] : inverse(divide(divide(sF1,X3),divide(X0,divide(X3,divide(X2,X4))))) = divide(inverse(divide(divide(divide(X1,X1),X2),X0)),X4),
    inference(superposition,[],[f1,f17]) ).

fof(f29,plain,
    ! [X2,X0,X1,X4] : divide(inverse(divide(divide(divide(X1,X1),X2),X0)),X4) = divide(inverse(divide(divide(sF1,X2),X0)),X4),
    inference(backward_demodulation,[],[f28,f26]) ).

fof(f37,plain,
    ! [X2,X3,X0,X1,X4] : inverse(divide(divide(divide(X4,X4),X0),X1)) = divide(inverse(divide(divide(sF1,X2),divide(inverse(divide(divide(sF1,X0),X1)),divide(X2,X3)))),X3),
    inference(superposition,[],[f17,f29]) ).

fof(f39,plain,
    ! [X0,X1,X4] : inverse(divide(divide(sF1,X0),X1)) = inverse(divide(divide(divide(X4,X4),X0),X1)),
    inference(forward_demodulation,[],[f37,f17]) ).

fof(f67,plain,
    ! [X2,X0,X1] : divide(divide(inverse(divide(divide(sF1,X0),X1)),X2),divide(X0,X2)) = X1,
    inference(superposition,[],[f17,f26]) ).

fof(f81,plain,
    ! [X0] : divide(divide(inverse(divide(divide(sF1,sF0),X0)),sF0),sF1) = X0,
    inference(superposition,[],[f67,f9]) ).

fof(f82,plain,
    ! [X0] : divide(divide(inverse(divide(divide(sF1,sF1),X0)),sF2),sF3) = X0,
    inference(superposition,[],[f67,f13]) ).

fof(f83,plain,
    ! [X2,X0,X1] : inverse(divide(divide(sF1,divide(X1,inverse(divide(divide(sF1,X1),X0)))),X2)) = inverse(divide(X0,X2)),
    inference(superposition,[],[f39,f67]) ).

fof(f100,plain,
    ! [X2,X3,X0,X1] : divide(divide(inverse(divide(X0,X1)),X3),divide(divide(X2,inverse(divide(divide(sF1,X2),X0))),X3)) = X1,
    inference(superposition,[],[f67,f83]) ).

fof(f119,plain,
    ! [X2,X3,X0,X1,X4] : divide(X1,X2) = divide(divide(inverse(X0),X3),divide(divide(X4,inverse(divide(divide(sF1,X4),divide(inverse(divide(divide(sF1,X1),X0)),X2)))),X3)),
    inference(superposition,[],[f100,f67]) ).

fof(f133,plain,
    ! [X2,X3,X0,X1] : divide(X0,divide(X1,X2)) = divide(X0,divide(divide(X3,inverse(divide(divide(sF1,X3),divide(sF1,X1)))),X2)),
    inference(superposition,[],[f100,f17]) ).

fof(f144,plain,
    ! [X2,X3,X0,X1,X4] : divide(inverse(divide(divide(sF1,divide(X4,inverse(divide(divide(sF1,X4),X1)))),X3)),X2) = inverse(divide(divide(sF1,divide(inverse(divide(X1,X0)),X2)),divide(X3,X0))),
    inference(superposition,[],[f26,f100]) ).

fof(f151,plain,
    ! [X2,X3,X0,X1] : inverse(divide(divide(sF1,divide(inverse(divide(X1,X0)),X2)),divide(X3,X0))) = divide(inverse(divide(X1,X3)),X2),
    inference(forward_demodulation,[],[f144,f83]) ).

fof(f209,plain,
    ! [X2,X0,X1] : divide(inverse(divide(sF3,divide(X0,divide(sF2,X1)))),X1) = divide(X2,inverse(divide(divide(sF1,X2),divide(sF1,X0)))),
    inference(superposition,[],[f20,f133]) ).

fof(f212,plain,
    ! [X2,X0] : divide(X2,inverse(divide(divide(sF1,X2),divide(sF1,X0)))) = X0,
    inference(forward_demodulation,[],[f209,f20]) ).

fof(f261,plain,
    ! [X0,X1] : divide(X1,inverse(divide(divide(sF1,X1),X0))) = inverse(divide(divide(sF1,sF1),divide(sF1,X0))),
    inference(superposition,[],[f212,f212]) ).

fof(f265,plain,
    ! [X2,X3,X0,X1] : inverse(divide(divide(sF1,X1),divide(sF1,X0))) = divide(divide(inverse(X0),X2),divide(divide(X3,inverse(divide(divide(sF1,X3),X1))),X2)),
    inference(superposition,[],[f100,f212]) ).

fof(f277,plain,
    ! [X0] : inverse(divide(divide(sF1,divide(sF1,sF1)),divide(sF1,X0))) = divide(divide(inverse(X0),sF2),sF3),
    inference(superposition,[],[f82,f212]) ).

fof(f299,plain,
    ! [X2,X0,X1] : divide(X1,X2) = inverse(divide(divide(sF1,divide(inverse(divide(divide(sF1,X1),X0)),X2)),divide(sF1,X0))),
    inference(backward_demodulation,[],[f119,f265]) ).

fof(f304,plain,
    ! [X2,X1] : divide(X1,X2) = divide(inverse(divide(divide(sF1,X1),sF1)),X2),
    inference(forward_demodulation,[],[f299,f151]) ).

fof(f354,plain,
    sF1 = divide(divide(sF0,sF0),sF1),
    inference(superposition,[],[f81,f304]) ).

fof(f356,plain,
    ! [X0,X1] : sF1 = divide(divide(X0,X1),divide(X0,X1)),
    inference(superposition,[],[f67,f304]) ).

fof(f368,plain,
    ! [X0] : divide(inverse(divide(divide(sF1,sF1),divide(X0,sF3))),sF2) = inverse(divide(divide(sF1,X0),sF1)),
    inference(superposition,[],[f24,f304]) ).

fof(f369,plain,
    ! [X0] : inverse(divide(divide(sF1,X0),sF1)) = X0,
    inference(forward_demodulation,[],[f368,f24]) ).

fof(f377,plain,
    sF1 = divide(sF1,sF1),
    inference(forward_demodulation,[],[f354,f9]) ).

fof(f392,plain,
    ! [X0] : divide(divide(inverse(divide(sF1,X0)),sF2),sF3) = X0,
    inference(backward_demodulation,[],[f82,f377]) ).

fof(f395,plain,
    ! [X0,X1] : divide(X1,inverse(divide(divide(sF1,X1),X0))) = inverse(divide(sF1,divide(sF1,X0))),
    inference(backward_demodulation,[],[f261,f377]) ).

fof(f396,plain,
    ! [X0] : inverse(divide(divide(sF1,sF1),divide(sF1,X0))) = divide(divide(inverse(X0),sF2),sF3),
    inference(backward_demodulation,[],[f277,f377]) ).

fof(f402,plain,
    ! [X0] : divide(divide(inverse(X0),sF2),sF3) = inverse(divide(sF1,divide(sF1,X0))),
    inference(forward_demodulation,[],[f396,f377]) ).

fof(f408,plain,
    ! [X0,X1] : divide(X1,inverse(divide(divide(sF1,X1),X0))) = divide(divide(inverse(X0),sF2),sF3),
    inference(backward_demodulation,[],[f395,f402]) ).

fof(f438,plain,
    sF1 = inverse(divide(sF1,sF1)),
    inference(superposition,[],[f369,f377]) ).

fof(f440,plain,
    sF1 = inverse(sF1),
    inference(forward_demodulation,[],[f438,f377]) ).

fof(f446,plain,
    ! [X0] : divide(X0,X0) = sF1,
    inference(superposition,[],[f356,f20]) ).

fof(f452,plain,
    ! [X0,X1] : divide(sF1,X0) = divide(divide(inverse(sF1),X1),divide(X0,X1)),
    inference(superposition,[],[f67,f356]) ).

fof(f465,plain,
    ! [X0,X1] : divide(sF1,X0) = divide(divide(sF1,X1),divide(X0,X1)),
    inference(forward_demodulation,[],[f452,f440]) ).

fof(f486,plain,
    ! [X0,X1] : divide(sF1,divide(X0,inverse(divide(divide(sF1,X0),X1)))) = X1,
    inference(superposition,[],[f67,f446]) ).

fof(f496,plain,
    ! [X1] : divide(sF1,divide(divide(inverse(X1),sF2),sF3)) = X1,
    inference(forward_demodulation,[],[f486,f408]) ).

fof(f505,plain,
    divide(divide(inverse(sF2),sF2),sF3) = inverse(divide(sF1,sF3)),
    inference(superposition,[],[f402,f13]) ).

fof(f531,plain,
    ! [X0] : divide(sF1,X0) = divide(divide(sF1,X0),sF1),
    inference(superposition,[],[f465,f446]) ).

fof(f567,plain,
    ! [X0] : inverse(divide(sF1,X0)) = X0,
    inference(backward_demodulation,[],[f369,f531]) ).

fof(f604,plain,
    ! [X0] : divide(sF1,X0) = divide(divide(inverse(X0),sF2),sF3),
    inference(backward_demodulation,[],[f402,f567]) ).

fof(f610,plain,
    ! [X0] : divide(divide(X0,sF2),sF3) = X0,
    inference(backward_demodulation,[],[f392,f567]) ).

fof(f614,plain,
    sF3 = divide(divide(inverse(sF2),sF2),sF3),
    inference(backward_demodulation,[],[f505,f567]) ).

fof(f653,plain,
    ! [X1] : divide(sF1,inverse(X1)) = X1,
    inference(backward_demodulation,[],[f496,f610]) ).

fof(f655,plain,
    sF3 = inverse(sF2),
    inference(backward_demodulation,[],[f614,f610]) ).

fof(f665,plain,
    ! [X0] : divide(sF1,X0) = inverse(X0),
    inference(forward_demodulation,[],[f604,f610]) ).

fof(f728,plain,
    ! [X1] : inverse(inverse(X1)) = X1,
    inference(backward_demodulation,[],[f653,f665]) ).

fof(f959,plain,
    a2 = inverse(sF2),
    inference(superposition,[],[f728,f11]) ).

fof(f961,plain,
    a2 = sF3,
    inference(backward_demodulation,[],[f655,f959]) ).

fof(f962,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f961,f14]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GRP479-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.37  % Computer : n010.cluster.edu
% 0.10/0.37  % Model    : x86_64 x86_64
% 0.10/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37  % Memory   : 8046.5625MB
% 0.10/0.37  % OS       : Linux 6.8.0-71-generic
% 0.10/0.37  % CPULimit : 300
% 0.10/0.37  % WCLimit  : 300
% 0.10/0.37  % DateTime : Sun Sep 27 10:06:02 UTC 2026
% 0.10/0.38  % CPUTime  : 
% 0.10/0.38  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.42  Running first-order theorem proving
% 0.10/0.42  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
% 8.34/2.13  % (722314)Detected a unit-equality problem, will run specialized UEQ schedule.
% 8.34/2.13  % (722324)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=3556147268:i=138329:kws=inv_arity_squared:fgj=on:bd=preordered_2999 on theBenchmark for (2999ds/138329Mi)
% 8.34/2.13  % (722327)ott-1010_1_sfv=off:to=lpo:sil=8000:fdtod=off:sp=reverse_frequency:spb=goal_then_units:fd=preordered:random_seed=2806981796:i=136:bd=preordered:ins=2:av=off_2999 on theBenchmark for (2999ds/136Mi)
% 8.34/2.13  % (722328)dis+10_14_to=lpo:sil=8000:tgt=full:drc=off:sp=const_frequency:sos=all:random_seed=2082373107:i=181:gtgl=5:bs=unit_only:fsr=off:gtg=exists_all_2999 on theBenchmark for (2999ds/181Mi)
% 8.34/2.13  % (722325)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=1562181417:i=130792:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/130792Mi)
% 8.34/2.13  % (722329)lrs+10_3_to=lpo:sil=64000:drc=off:fde=unused:sp=reverse_frequency:acc=on:bsr=on:fd=preordered:nwc=1:random_seed=659841612:avsq=on:i=257:avsqr=16,3:bd=preordered:fsr=off_2999 on theBenchmark for (2999ds/257Mi)
% 8.34/2.13  % (722330)dis-1010_7_sil=8000:fde=unused:flr=on:random_seed=2968623221:i=1187:sd=4:av=off:ss=axioms:sgt=32_2999 on theBenchmark for (2999ds/1187Mi)
% 8.34/2.13  % (722326)lrs+10_1_ncem=casc2026/models/loop5.pt:sil=128000:tgt=ground:npcc=on:spb=goal_then_units:urr=ec_only:random_seed=218048888:i=130716:gtgl=4:add=on:doe=on:bd=all:gtg=exists_sym_2999 on theBenchmark for (2999ds/130716Mi)
% 8.34/2.13  % (722327)Instruction limit reached! 
% 8.34/2.13  % (722327)------------------------------
% 8.34/2.13  % (722327)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.34/2.13  % (722327)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.34/2.13  % (722327)CaDiCaL version: 2.1.3
% 8.34/2.13  % (722327)Termination reason: Instruction limit
% 8.34/2.13  % (722327)Termination phase: Saturation
% 8.34/2.13  % (722327)Time elapsed: 0.079 s
% 8.34/2.13  % (722327)Peak memory usage: 89 MB
% 8.34/2.13  % (722327)Instructions burned: 136 (million)
% 8.34/2.13  % (722328)Instruction limit reached! 
% 8.34/2.13  % (722328)------------------------------
% 8.34/2.13  % (722328)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.34/2.13  % (722328)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.34/2.13  % (722328)CaDiCaL version: 2.1.3
% 8.34/2.13  % (722328)Termination reason: Instruction limit
% 8.34/2.13  % (722328)Termination phase: Saturation
% 8.34/2.13  % (722328)Time elapsed: 0.103 s
% 8.34/2.13  % (722328)Peak memory usage: 90 MB
% 8.34/2.13  % (722328)Instructions burned: 181 (million)
% 8.34/2.13  % (722329)Instruction limit reached! 
% 8.34/2.13  % (722329)------------------------------
% 8.34/2.13  % (722329)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.34/2.13  % (722329)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.34/2.13  % (722329)CaDiCaL version: 2.1.3
% 8.34/2.13  % (722329)Termination reason: Instruction limit
% 8.34/2.13  % (722329)Termination phase: Saturation
% 8.34/2.13  % (722329)Time elapsed: 0.159 s
% 8.34/2.13  % (722329)Peak memory usage: 91 MB
% 8.34/2.13  % (722329)Instructions burned: 259 (million)
% 8.34/2.13  % (722340)lrs-1011_1_ncem=casc2026/models/loop8.pt:sil=32000:npcc=on:prc=on:fde=unused:lcm=predicate:bsr=on:flr=on:random_seed=3490689805:i=2051:gtgl=2:fgj=on:bd=all:gtg=exists_top_2997 on theBenchmark for (2997ds/2051Mi)
% 8.34/2.13  % (722341)lrs-1002_1_ncem=casc2026/models/all5champsBiggishL14.pt:sil=16000:npcc=on:random_seed=1878553332:i=4948:ss=axioms:sgt=16_2997 on theBenchmark for (2997ds/4948Mi)
% 8.34/2.13  % (722363)lrs+10_5:1_sil=8000:sos=all:urr=on:br=off:flr=on:random_seed=2444488973:i=215:ep=RSTC_2996 on theBenchmark for (2996ds/215Mi)
% 8.34/2.13  % (722363)Instruction limit reached! 
% 8.34/2.13  % (722363)------------------------------
% 8.34/2.13  % (722363)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.34/2.13  % (722363)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.34/2.13  % (722363)CaDiCaL version: 2.1.3
% 8.34/2.13  % (722363)Termination reason: Instruction limit
% 8.34/2.13  % (722363)Termination phase: Saturation
% 8.34/2.13  % (722363)Time elapsed: 0.126 s
% 8.34/2.13  % (722363)Peak memory usage: 91 MB
% 8.34/2.13  % (722363)Instructions burned: 216 (million)
% 8.34/2.13  % (722473)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=65604119:avsq=on:i=317:avsqr=1,16:kws=arity_squared:add=off:fgj=on:ins=10:fsr=off:gtg=exists_sym_2993 on theBenchmark for (2993ds/317Mi)
% 8.34/2.13  % (722330)Instruction limit reached! 
% 8.34/2.13  % (722330)------------------------------
% 8.34/2.13  % (722330)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.34/2.13  % (722330)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.34/2.13  % (722330)CaDiCaL version: 2.1.3
% 8.34/2.13  % (722330)Termination reason: Instruction limit
% 8.34/2.13  % (722330)Termination phase: Saturation
% 8.34/2.13  % (722330)Time elapsed: 0.620 s
% 8.34/2.13  % (722330)Peak memory usage: 98 MB
% 8.34/2.13  % (722330)Instructions burned: 1187 (million)
% 8.34/2.13  % (722473)Instruction limit reached! 
% 8.34/2.13  % (722473)------------------------------
% 8.34/2.13  % (722473)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.34/2.13  % (722473)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.34/2.13  % (722473)CaDiCaL version: 2.1.3
% 8.34/2.13  % (722473)Termination reason: Instruction limit
% 8.34/2.13  % (722473)Termination phase: Saturation
% 8.34/2.13  % (722473)Time elapsed: 0.182 s
% 8.34/2.13  % (722473)Peak memory usage: 93 MB
% 8.34/2.13  % (722473)Instructions burned: 318 (million)
% 8.34/2.13  % (722326)First to succeed.
% 8.34/2.13  % (722326)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-722314"
% 8.34/2.13  % (722500)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=1797367733:i=12125:sd=2:fgj=on:ss=axioms:sgt=64_2991 on theBenchmark for (2991ds/12125Mi)
% 8.34/2.13  % (722325)Also succeeded, but the first one will report.
% 8.34/2.13  % (722501)lrs+10_32_sil=8000:tgt=ground:prc=on:sp=reverse_arity:spb=non_intro:random_seed=1135943665:i=2836:kws=inv_precedence:fgj=on:bd=preordered:ins=10_2990 on theBenchmark for (2990ds/2836Mi)
% 8.34/2.13  % (722326)Refutation found. Thanks to Tanya!
% 8.34/2.13  % SZS status Unsatisfiable for theBenchmark
% 8.34/2.13  % SZS output start Proof for theBenchmark
% See solution above
% 9.21/2.33  % (722326)------------------------------
% 9.21/2.33  % (722326)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.21/2.33  % (722326)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.21/2.33  % (722326)CaDiCaL version: 2.1.3
% 9.21/2.33  % (722326)Termination reason: Refutation
% 9.21/2.33  % (722326)Time elapsed: 0.739 s
% 9.21/2.33  % (722326)Peak memory usage: 130 MB
% 9.21/2.33  % (722326)Instructions burned: 1133 (million)
% 9.21/2.33  % (722326)------------------------------
% 9.21/2.33  % (722326)------------------------------
% 9.21/2.33  % (722314)Success in time 1.221 s
% 9.21/2.33  % Vampire exiting
%------------------------------------------------------------------------------