%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : RNG008-7 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n008.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:35:06 PM UTC 2026
% Result : Unsatisfiable 1.99s 2.04s
% Output : Refutation 6.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 35
% Number of leaves : 16
% Syntax : Number of formulae : 103 ( 103 unt; 5 def)
% Number of atoms : 103 ( 102 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 4 ( 4 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 6 con; 0-2 aty)
% Number of variables : 103 ( 103 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,negated_conjecture,
! [X0] : add(additive_identity,X0) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',left_additive_identity) ).
fof(f2,negated_conjecture,
! [X0] : add(X0,additive_identity) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',right_additive_identity) ).
fof(f5,axiom,
! [X0] : add(X0,additive_inverse(X0)) = additive_identity,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',right_additive_inverse) ).
fof(f6,plain,
! [X0] : additive_identity = add(X0,additive_inverse(X0)),
inference(reorient_equations,[],[f5]) ).
fof(f7,axiom,
! [X2,X0,X1] : add(X0,add(X1,X2)) = add(add(X0,X1),X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',associativity_for_addition) ).
fof(f8,axiom,
! [X0,X1] : add(X0,X1) = add(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_for_addition) ).
fof(f9,axiom,
! [X2,X0,X1] : multiply(X0,multiply(X1,X2)) = multiply(multiply(X0,X1),X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',associativity_for_multiplication) ).
fof(f10,axiom,
! [X2,X0,X1] : multiply(X0,add(X1,X2)) = add(multiply(X0,X1),multiply(X0,X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',distribute1) ).
fof(f11,axiom,
! [X2,X0,X1] : multiply(add(X0,X1),X2) = add(multiply(X0,X2),multiply(X1,X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',distribute2) ).
fof(f12,axiom,
! [X0] : multiply(X0,X0) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',boolean_ring) ).
fof(f13,negated_conjecture,
multiply(a,b) = c,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_times_b_is_c) ).
fof(f14,negated_conjecture,
multiply(b,a) != c,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_commutativity) ).
fof(f15,plain,
c != multiply(b,a),
inference(reorient_equations,[],[f14]) ).
fof(f16,definition,
! [X0] : sF0(X0) = add(additive_identity,X0),
introduced(definition,[new_symbols(definition,[sF0])],[function_definition]) ).
fof(f17,plain,
! [X0] : add(additive_identity,X0) = sF0(X0),
inference(reorient_equations,[],[f16]) ).
fof(f18,plain,
! [X0] : sF0(X0) = X0,
inference(definition_folding,[],[f1,f17]) ).
fof(f19,definition,
! [X0] : sF1(X0) = add(X0,additive_identity),
introduced(definition,[new_symbols(definition,[sF1])],[function_definition]) ).
fof(f20,plain,
! [X0] : add(X0,additive_identity) = sF1(X0),
inference(reorient_equations,[],[f19]) ).
fof(f21,plain,
! [X0] : sF1(X0) = X0,
inference(definition_folding,[],[f2,f20]) ).
fof(f25,definition,
! [X0] : sF3(X0) = add(X0,additive_inverse(X0)),
introduced(definition,[new_symbols(definition,[sF3])],[function_definition]) ).
fof(f26,plain,
! [X0] : add(X0,additive_inverse(X0)) = sF3(X0),
inference(reorient_equations,[],[f25]) ).
fof(f27,plain,
! [X0] : additive_identity = sF3(X0),
inference(definition_folding,[],[f6,f26]) ).
fof(f28,definition,
sF4 = multiply(a,b),
introduced(definition,[new_symbols(definition,[sF4])],[function_definition]) ).
fof(f29,plain,
multiply(a,b) = sF4,
inference(reorient_equations,[],[f28]) ).
fof(f30,plain,
c = sF4,
inference(definition_folding,[],[f13,f29]) ).
fof(f31,definition,
sF5 = multiply(b,a),
introduced(definition,[new_symbols(definition,[sF5])],[function_definition]) ).
fof(f32,plain,
multiply(b,a) = sF5,
inference(reorient_equations,[],[f31]) ).
fof(f33,plain,
c != sF5,
inference(definition_folding,[],[f15,f32]) ).
fof(f34,plain,
! [X0] : additive_identity = add(X0,additive_inverse(X0)),
inference(forward_demodulation,[],[f27,f26]) ).
fof(f36,plain,
! [X0] : add(X0,additive_identity) = X0,
inference(forward_demodulation,[],[f21,f20]) ).
fof(f37,plain,
! [X0] : add(additive_identity,X0) = X0,
inference(forward_demodulation,[],[f18,f17]) ).
fof(f42,plain,
! [X0,X1] : multiply(X0,X1) = add(multiply(X0,X1),multiply(additive_identity,X1)),
inference(superposition,[],[f11,f36]) ).
fof(f43,plain,
! [X0,X1] : multiply(X1,X0) = add(multiply(X1,X0),multiply(X1,additive_identity)),
inference(superposition,[],[f10,f36]) ).
fof(f57,plain,
! [X0,X1] : multiply(additive_identity,X1) = add(multiply(X0,X1),multiply(additive_inverse(X0),X1)),
inference(superposition,[],[f11,f34]) ).
fof(f58,plain,
! [X0,X1] : add(multiply(X0,X1),multiply(X0,additive_inverse(X1))) = multiply(X0,additive_identity),
inference(superposition,[],[f10,f34]) ).
fof(f59,plain,
! [X0,X1] : add(additive_identity,X1) = add(X0,add(additive_inverse(X0),X1)),
inference(superposition,[],[f7,f34]) ).
fof(f62,plain,
! [X0,X1] : add(X0,add(additive_inverse(X0),X1)) = X1,
inference(forward_demodulation,[],[f59,f37]) ).
fof(f65,plain,
! [X0,X1] : add(X1,add(X0,additive_inverse(X1))) = X0,
inference(superposition,[],[f62,f8]) ).
fof(f69,plain,
! [X0] : add(X0,additive_identity) = additive_inverse(additive_inverse(X0)),
inference(superposition,[],[f62,f34]) ).
fof(f82,plain,
! [X0] : additive_inverse(additive_inverse(X0)) = X0,
inference(forward_demodulation,[],[f69,f36]) ).
fof(f85,plain,
! [X0,X1] : add(additive_inverse(X0),add(X0,X1)) = X1,
inference(superposition,[],[f62,f82]) ).
fof(f89,plain,
! [X0,X1] : add(additive_inverse(X0),add(X1,X0)) = X1,
inference(superposition,[],[f65,f82]) ).
fof(f113,plain,
! [X0,X1] : multiply(X0,X1) = multiply(X0,multiply(X0,X1)),
inference(superposition,[],[f9,f12]) ).
fof(f115,plain,
! [X0,X1] : add(X0,X1) = add(multiply(X0,add(X0,X1)),multiply(X1,add(X0,X1))),
inference(superposition,[],[f11,f12]) ).
fof(f117,plain,
! [X0,X1] : add(X0,X1) = add(multiply(X0,add(X0,X1)),add(multiply(X1,X0),multiply(X1,X1))),
inference(forward_demodulation,[],[f115,f10]) ).
fof(f121,plain,
! [X0,X1] : add(X0,X1) = add(multiply(X0,add(X0,X1)),add(multiply(X1,X0),X1)),
inference(forward_demodulation,[],[f117,f12]) ).
fof(f125,plain,
! [X0,X1] : add(X0,X1) = add(multiply(X0,add(X0,X1)),add(X1,multiply(X1,X0))),
inference(forward_demodulation,[],[f121,f8]) ).
fof(f129,plain,
! [X0,X1] : add(X0,X1) = add(add(multiply(X0,X0),multiply(X0,X1)),add(X1,multiply(X1,X0))),
inference(forward_demodulation,[],[f125,f10]) ).
fof(f133,plain,
! [X0,X1] : add(X0,X1) = add(multiply(X0,X0),add(multiply(X0,X1),add(X1,multiply(X1,X0)))),
inference(forward_demodulation,[],[f129,f7]) ).
fof(f137,plain,
! [X0,X1] : add(X0,X1) = add(X0,add(multiply(X0,X1),add(X1,multiply(X1,X0)))),
inference(forward_demodulation,[],[f133,f12]) ).
fof(f309,plain,
! [X0,X1] : multiply(additive_identity,X1) = add(additive_inverse(multiply(X0,X1)),multiply(X0,X1)),
inference(superposition,[],[f85,f42]) ).
fof(f314,plain,
! [X0,X1] : multiply(additive_identity,X1) = add(multiply(X0,X1),additive_inverse(multiply(X0,X1))),
inference(forward_demodulation,[],[f309,f8]) ).
fof(f320,plain,
! [X1] : additive_identity = multiply(additive_identity,X1),
inference(forward_demodulation,[],[f314,f34]) ).
fof(f516,plain,
! [X0,X1] : multiply(X0,additive_identity) = add(additive_inverse(multiply(X0,X1)),multiply(X0,X1)),
inference(superposition,[],[f85,f43]) ).
fof(f522,plain,
! [X0,X1] : multiply(X0,additive_identity) = add(multiply(X0,X1),additive_inverse(multiply(X0,X1))),
inference(forward_demodulation,[],[f516,f8]) ).
fof(f531,plain,
! [X0] : additive_identity = multiply(X0,additive_identity),
inference(forward_demodulation,[],[f522,f34]) ).
fof(f569,plain,
! [X0,X1] : additive_identity = add(multiply(X0,X1),multiply(additive_inverse(X0),X1)),
inference(forward_demodulation,[],[f57,f320]) ).
fof(f571,plain,
! [X0] : additive_identity = add(X0,multiply(additive_inverse(X0),X0)),
inference(superposition,[],[f569,f12]) ).
fof(f576,plain,
additive_identity = add(sF4,multiply(additive_inverse(a),b)),
inference(superposition,[],[f569,f29]) ).
fof(f577,plain,
additive_identity = add(sF5,multiply(additive_inverse(b),a)),
inference(superposition,[],[f569,f32]) ).
fof(f590,plain,
! [X0,X1] : multiply(X0,X1) = add(additive_inverse(multiply(additive_inverse(X0),X1)),additive_identity),
inference(superposition,[],[f89,f569]) ).
fof(f597,plain,
! [X0,X1] : multiply(X0,X1) = add(additive_identity,additive_inverse(multiply(additive_inverse(X0),X1))),
inference(forward_demodulation,[],[f590,f8]) ).
fof(f610,plain,
additive_identity = add(c,multiply(additive_inverse(a),b)),
inference(forward_demodulation,[],[f576,f30]) ).
fof(f617,plain,
! [X0,X1] : multiply(X0,X1) = additive_inverse(multiply(additive_inverse(X0),X1)),
inference(forward_demodulation,[],[f597,f37]) ).
fof(f655,plain,
! [X0] : add(X0,additive_identity) = multiply(additive_inverse(additive_inverse(X0)),additive_inverse(X0)),
inference(superposition,[],[f62,f571]) ).
fof(f656,plain,
! [X0] : add(X0,additive_identity) = multiply(X0,additive_inverse(X0)),
inference(forward_demodulation,[],[f655,f82]) ).
fof(f673,plain,
! [X0] : multiply(X0,additive_inverse(X0)) = X0,
inference(forward_demodulation,[],[f656,f36]) ).
fof(f894,plain,
multiply(additive_inverse(b),a) = add(additive_inverse(sF5),additive_identity),
inference(superposition,[],[f85,f577]) ).
fof(f903,plain,
multiply(additive_inverse(b),a) = add(additive_identity,additive_inverse(sF5)),
inference(forward_demodulation,[],[f894,f8]) ).
fof(f910,plain,
multiply(additive_inverse(b),a) = additive_inverse(sF5),
inference(forward_demodulation,[],[f903,f37]) ).
fof(f953,plain,
! [X0,X1] : additive_identity = add(multiply(X0,X1),multiply(X0,additive_inverse(X1))),
inference(forward_demodulation,[],[f58,f531]) ).
fof(f957,plain,
multiply(additive_inverse(a),b) = add(additive_inverse(c),additive_identity),
inference(superposition,[],[f85,f610]) ).
fof(f966,plain,
multiply(additive_inverse(a),b) = add(additive_identity,additive_inverse(c)),
inference(forward_demodulation,[],[f957,f8]) ).
fof(f973,plain,
multiply(additive_inverse(a),b) = additive_inverse(c),
inference(forward_demodulation,[],[f966,f37]) ).
fof(f1047,plain,
! [X0] : multiply(c,X0) = additive_inverse(multiply(multiply(additive_inverse(a),b),X0)),
inference(superposition,[],[f617,f973]) ).
fof(f1048,plain,
! [X0] : multiply(sF5,X0) = additive_inverse(multiply(multiply(additive_inverse(b),a),X0)),
inference(superposition,[],[f617,f910]) ).
fof(f1088,plain,
! [X0] : multiply(sF5,X0) = additive_inverse(multiply(additive_inverse(b),multiply(a,X0))),
inference(forward_demodulation,[],[f1048,f9]) ).
fof(f1089,plain,
! [X0] : multiply(c,X0) = additive_inverse(multiply(additive_inverse(a),multiply(b,X0))),
inference(forward_demodulation,[],[f1047,f9]) ).
fof(f1100,plain,
! [X0] : multiply(sF5,X0) = multiply(b,multiply(a,X0)),
inference(forward_demodulation,[],[f1088,f617]) ).
fof(f1101,plain,
! [X0] : multiply(c,X0) = multiply(a,multiply(b,X0)),
inference(forward_demodulation,[],[f1089,f617]) ).
fof(f1114,plain,
! [X0] : additive_identity = add(X0,multiply(X0,additive_inverse(X0))),
inference(superposition,[],[f953,f12]) ).
fof(f1184,plain,
! [X0] : additive_identity = add(X0,X0),
inference(forward_demodulation,[],[f1114,f673]) ).
fof(f1219,plain,
! [X0,X1] : add(additive_identity,X1) = add(X0,add(X0,X1)),
inference(superposition,[],[f7,f1184]) ).
fof(f1245,plain,
! [X0,X1] : add(X0,add(X0,X1)) = X1,
inference(forward_demodulation,[],[f1219,f37]) ).
fof(f1419,plain,
sF4 = multiply(a,sF4),
inference(superposition,[],[f113,f29]) ).
fof(f1448,plain,
c = multiply(a,c),
inference(forward_demodulation,[],[f1419,f30]) ).
fof(f1956,plain,
add(a,c) = add(a,add(c,add(c,multiply(c,a)))),
inference(superposition,[],[f137,f1448]) ).
fof(f2051,plain,
add(a,c) = add(a,multiply(c,a)),
inference(forward_demodulation,[],[f1956,f1245]) ).
fof(f2101,plain,
add(a,c) = add(a,multiply(a,multiply(b,a))),
inference(forward_demodulation,[],[f2051,f1101]) ).
fof(f2149,plain,
add(a,c) = add(a,multiply(a,sF5)),
inference(forward_demodulation,[],[f2101,f32]) ).
fof(f2267,plain,
multiply(a,sF5) = add(a,add(a,c)),
inference(superposition,[],[f1245,f2149]) ).
fof(f2270,plain,
c = multiply(a,sF5),
inference(forward_demodulation,[],[f2267,f1245]) ).
fof(f2318,plain,
add(a,sF5) = add(a,add(c,add(sF5,multiply(sF5,a)))),
inference(superposition,[],[f137,f2270]) ).
fof(f2325,plain,
add(a,sF5) = add(a,add(c,add(sF5,multiply(b,multiply(a,a))))),
inference(forward_demodulation,[],[f2318,f1100]) ).
fof(f2333,plain,
add(a,sF5) = add(a,add(c,add(sF5,multiply(b,a)))),
inference(forward_demodulation,[],[f2325,f12]) ).
fof(f2338,plain,
add(a,sF5) = add(a,add(c,add(sF5,sF5))),
inference(forward_demodulation,[],[f2333,f32]) ).
fof(f2341,plain,
add(a,sF5) = add(a,add(c,additive_identity)),
inference(forward_demodulation,[],[f2338,f1184]) ).
fof(f2343,plain,
add(a,sF5) = add(a,add(additive_identity,c)),
inference(forward_demodulation,[],[f2341,f8]) ).
fof(f2345,plain,
add(a,c) = add(a,sF5),
inference(forward_demodulation,[],[f2343,f37]) ).
fof(f2392,plain,
sF5 = add(a,add(a,c)),
inference(superposition,[],[f1245,f2345]) ).
fof(f2394,plain,
c = sF5,
inference(forward_demodulation,[],[f2392,f1245]) ).
fof(f2426,plain,
c != c,
inference(superposition,[],[f33,f2394]) ).
fof(f2435,plain,
$false,
inference(trivial_inequality_removal,[],[f2426]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : RNG008-7 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.10 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.21/0.46 % Computer : n008.cluster.edu
% 0.21/0.46 % Model : x86_64 x86_64
% 0.21/0.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.21/0.46 % Memory : 8046.5625MB
% 0.21/0.46 % OS : Linux 6.8.0-71-generic
% 0.21/0.46 % CPULimit : 300
% 0.21/0.46 % WCLimit : 300
% 0.21/0.46 % DateTime : Sun Sep 27 22:59:09 UTC 2026
% 0.21/0.46 % CPUTime :
% 0.21/0.46 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.24/0.52 Running first-order theorem proving
% 0.24/0.52 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
% 1.99/2.04 % (1706636)Detected a unit-equality problem, will run specialized UEQ schedule.
% 1.99/2.04 % (1706647)dis-1010_7_sil=8000:fde=unused:flr=on:random_seed=2810584873:i=1187:sd=4:av=off:ss=axioms:sgt=32_2999 on theBenchmark for (2999ds/1187Mi)
% 1.99/2.04 % (1706642)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=1150131616:i=130792:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/130792Mi)
% 1.99/2.04 % (1706641)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=1530988988:i=138329:kws=inv_arity_squared:fgj=on:bd=preordered_2999 on theBenchmark for (2999ds/138329Mi)
% 1.99/2.04 % (1706645)dis+10_14_to=lpo:sil=8000:tgt=full:drc=off:sp=const_frequency:sos=all:random_seed=3575023291:i=181:gtgl=5:bs=unit_only:fsr=off:gtg=exists_all_2999 on theBenchmark for (2999ds/181Mi)
% 1.99/2.04 % (1706643)lrs+10_1_ncem=casc2026/models/loop5.pt:sil=128000:tgt=ground:npcc=on:spb=goal_then_units:urr=ec_only:random_seed=1495907820:i=130716:gtgl=4:add=on:doe=on:bd=all:gtg=exists_sym_2999 on theBenchmark for (2999ds/130716Mi)
% 1.99/2.04 % (1706646)lrs+10_3_to=lpo:sil=64000:drc=off:fde=unused:sp=reverse_frequency:acc=on:bsr=on:fd=preordered:nwc=1:random_seed=849558068:avsq=on:i=257:avsqr=16,3:bd=preordered:fsr=off_2999 on theBenchmark for (2999ds/257Mi)
% 1.99/2.04 % (1706644)ott-1010_1_sfv=off:to=lpo:sil=8000:fdtod=off:sp=reverse_frequency:spb=goal_then_units:fd=preordered:random_seed=1332250637:i=136:bd=preordered:ins=2:av=off_2999 on theBenchmark for (2999ds/136Mi)
% 1.99/2.04 % (1706645)First to succeed.
% 1.99/2.04 % (1706645)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-1706636"
% 1.99/2.04 % (1706644)Instruction limit reached!
% 1.99/2.04 % (1706644)------------------------------
% 1.99/2.04 % (1706644)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 1.99/2.04 % (1706644)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.99/2.04 % (1706644)CaDiCaL version: 2.1.3
% 1.99/2.04 % (1706644)Termination reason: Instruction limit
% 1.99/2.04 % (1706644)Termination phase: Saturation
% 1.99/2.04 % (1706644)Time elapsed: 0.127 s
% 1.99/2.04 % (1706644)Peak memory usage: 89 MB
% 1.99/2.04 % (1706644)Instructions burned: 136 (million)
% 1.99/2.04 % (1706646)Instruction limit reached!
% 1.99/2.04 % (1706646)------------------------------
% 1.99/2.04 % (1706646)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 1.99/2.04 % (1706646)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.99/2.04 % (1706646)CaDiCaL version: 2.1.3
% 1.99/2.04 % (1706646)Termination reason: Instruction limit
% 1.99/2.04 % (1706646)Termination phase: Saturation
% 1.99/2.04 % (1706646)Time elapsed: 0.278 s
% 1.99/2.04 % (1706646)Peak memory usage: 89 MB
% 1.99/2.04 % (1706646)Instructions burned: 257 (million)
% 1.99/2.04 % (1706655)lrs-1011_1_ncem=casc2026/models/loop8.pt:sil=32000:npcc=on:prc=on:fde=unused:lcm=predicate:bsr=on:flr=on:random_seed=1897673800:i=2051:gtgl=2:fgj=on:bd=all:gtg=exists_top_2995 on theBenchmark for (2995ds/2051Mi)
% 1.99/2.04 % (1706645)Refutation found. Thanks to Tanya!
% 1.99/2.04 % SZS status Unsatisfiable for theBenchmark
% 1.99/2.04 % SZS output start Proof for theBenchmark
% See solution above
% 6.57/2.38 % (1706645)------------------------------
% 6.57/2.38 % (1706645)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.57/2.38 % (1706645)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.57/2.38 % (1706645)CaDiCaL version: 2.1.3
% 6.57/2.38 % (1706645)Termination reason: Refutation
% 6.57/2.38 % (1706645)Time elapsed: 0.063 s
% 6.57/2.38 % (1706645)Peak memory usage: 88 MB
% 6.57/2.38 % (1706645)Instructions burned: 62 (million)
% 6.57/2.38 % (1706645)------------------------------
% 6.57/2.38 % (1706645)------------------------------
% 6.57/2.38 % (1706636)Success in time 0.774 s
% 6.57/2.38 % Vampire exiting
%------------------------------------------------------------------------------