%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : BOO014-2 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 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:36:10 AM UTC 2026
% Result : Unsatisfiable 3.60s 0.92s
% Output : Refutation 3.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 27
% Number of leaves : 15
% Syntax : Number of formulae : 101 ( 101 unt; 0 def)
% Number of atoms : 101 ( 100 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 4 ( 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 : 83 ( 83 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] : add(X0,X1) = add(X1,X0),
file('/export/starexec/sandbox2/benchmark/Axioms/BOO003-0.ax',commutativity_of_add) ).
fof(f2,axiom,
! [X0,X1] : multiply(X0,X1) = multiply(X1,X0),
file('/export/starexec/sandbox2/benchmark/Axioms/BOO003-0.ax',commutativity_of_multiply) ).
fof(f3,axiom,
! [X2,X0,X1] : add(multiply(X0,X1),X2) = multiply(add(X0,X2),add(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/BOO003-0.ax',distributivity1) ).
fof(f4,axiom,
! [X2,X0,X1] : add(X0,multiply(X1,X2)) = multiply(add(X0,X1),add(X0,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/BOO003-0.ax',distributivity2) ).
fof(f5,axiom,
! [X2,X0,X1] : multiply(add(X0,X1),X2) = add(multiply(X0,X2),multiply(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/BOO003-0.ax',distributivity3) ).
fof(f6,axiom,
! [X2,X0,X1] : multiply(X0,add(X1,X2)) = add(multiply(X0,X1),multiply(X0,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/BOO003-0.ax',distributivity4) ).
fof(f7,axiom,
! [X0] : add(X0,inverse(X0)) = multiplicative_identity,
file('/export/starexec/sandbox2/benchmark/Axioms/BOO003-0.ax',additive_inverse1) ).
fof(f10,axiom,
! [X0] : multiply(X0,inverse(X0)) = additive_identity,
file('/export/starexec/sandbox2/benchmark/Axioms/BOO003-0.ax',multiplicative_inverse1) ).
fof(f13,axiom,
! [X0] : multiply(X0,multiplicative_identity) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/BOO003-0.ax',multiplicative_id1) ).
fof(f14,axiom,
! [X0] : multiply(multiplicative_identity,X0) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/BOO003-0.ax',multiplicative_id2) ).
fof(f15,axiom,
! [X0] : add(X0,additive_identity) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/BOO003-0.ax',additive_id1) ).
fof(f16,axiom,
! [X0] : add(additive_identity,X0) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/BOO003-0.ax',additive_id2) ).
fof(f17,axiom,
add(a,b) = c,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_plus_b_is_c) ).
fof(f18,axiom,
multiply(inverse(a),inverse(b)) = d,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_inverse_times_b_inverse_is_d) ).
fof(f19,negated_conjecture,
inverse(c) != d,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_c_inverse_is_d) ).
fof(f20,plain,
d != inverse(c),
inference(reorient_equations,[],[f19]) ).
fof(f56,plain,
! [X0,X1] : add(multiply(X0,X1),inverse(X0)) = multiply(multiplicative_identity,add(X1,inverse(X0))),
inference(superposition,[],[f3,f7]) ).
fof(f60,plain,
! [X0] : add(multiply(a,X0),b) = multiply(c,add(X0,b)),
inference(superposition,[],[f3,f17]) ).
fof(f62,plain,
! [X0,X1] : add(multiply(X0,X1),inverse(X1)) = multiply(add(X0,inverse(X1)),multiplicative_identity),
inference(superposition,[],[f3,f7]) ).
fof(f73,plain,
! [X0,X1] : add(multiply(X0,X1),inverse(X1)) = add(X0,inverse(X1)),
inference(forward_demodulation,[],[f62,f13]) ).
fof(f75,plain,
! [X0] : multiply(c,add(X0,b)) = add(b,multiply(a,X0)),
inference(forward_demodulation,[],[f60,f1]) ).
fof(f76,plain,
! [X0,X1] : add(multiply(X0,X1),inverse(X0)) = add(X1,inverse(X0)),
inference(forward_demodulation,[],[f56,f14]) ).
fof(f79,plain,
! [X0,X1] : add(X0,inverse(X1)) = add(inverse(X1),multiply(X0,X1)),
inference(forward_demodulation,[],[f73,f1]) ).
fof(f80,plain,
! [X0,X1] : add(X1,inverse(X0)) = add(inverse(X0),multiply(X0,X1)),
inference(forward_demodulation,[],[f76,f1]) ).
fof(f83,plain,
add(b,multiply(a,additive_identity)) = multiply(c,b),
inference(superposition,[],[f75,f16]) ).
fof(f85,plain,
add(b,multiply(a,additive_identity)) = multiply(b,c),
inference(forward_demodulation,[],[f83,f2]) ).
fof(f86,plain,
multiply(b,c) = add(b,multiply(additive_identity,a)),
inference(forward_demodulation,[],[f85,f2]) ).
fof(f92,plain,
! [X0] : add(a,multiply(b,X0)) = multiply(c,add(a,X0)),
inference(superposition,[],[f4,f17]) ).
fof(f94,plain,
! [X0,X1] : add(X0,multiply(X1,inverse(X0))) = multiply(add(X0,X1),multiplicative_identity),
inference(superposition,[],[f4,f7]) ).
fof(f107,plain,
! [X0,X1] : add(X0,X1) = add(X0,multiply(X1,inverse(X0))),
inference(forward_demodulation,[],[f94,f13]) ).
fof(f129,plain,
! [X0] : add(X0,inverse(X0)) = add(X0,multiplicative_identity),
inference(superposition,[],[f107,f14]) ).
fof(f141,plain,
! [X0] : multiplicative_identity = add(X0,multiplicative_identity),
inference(forward_demodulation,[],[f129,f7]) ).
fof(f147,plain,
! [X0] : multiplicative_identity = add(multiplicative_identity,X0),
inference(superposition,[],[f141,f1]) ).
fof(f163,plain,
! [X0,X1] : multiply(add(X0,X1),inverse(X0)) = add(additive_identity,multiply(X1,inverse(X0))),
inference(superposition,[],[f5,f10]) ).
fof(f168,plain,
! [X0] : multiply(add(inverse(a),X0),inverse(b)) = add(d,multiply(X0,inverse(b))),
inference(superposition,[],[f5,f18]) ).
fof(f172,plain,
! [X0,X1] : multiply(add(X0,X1),inverse(X1)) = add(multiply(X0,inverse(X1)),additive_identity),
inference(superposition,[],[f5,f10]) ).
fof(f178,plain,
! [X0,X1] : multiply(add(X1,multiplicative_identity),X0) = add(multiply(X1,X0),X0),
inference(superposition,[],[f5,f14]) ).
fof(f189,plain,
! [X0,X1] : add(X0,multiply(X1,X0)) = multiply(add(X1,multiplicative_identity),X0),
inference(forward_demodulation,[],[f178,f1]) ).
fof(f191,plain,
! [X0,X1] : multiply(X0,inverse(X1)) = multiply(add(X0,X1),inverse(X1)),
inference(forward_demodulation,[],[f172,f15]) ).
fof(f193,plain,
! [X0] : add(d,multiply(X0,inverse(b))) = multiply(inverse(b),add(inverse(a),X0)),
inference(forward_demodulation,[],[f168,f2]) ).
fof(f194,plain,
! [X0,X1] : multiply(X1,inverse(X0)) = multiply(add(X0,X1),inverse(X0)),
inference(forward_demodulation,[],[f163,f16]) ).
fof(f196,plain,
! [X0,X1] : multiply(multiplicative_identity,X0) = add(X0,multiply(X1,X0)),
inference(forward_demodulation,[],[f189,f141]) ).
fof(f198,plain,
! [X0,X1] : multiply(X0,inverse(X1)) = multiply(inverse(X1),add(X0,X1)),
inference(forward_demodulation,[],[f191,f2]) ).
fof(f199,plain,
! [X0,X1] : multiply(X1,inverse(X0)) = multiply(inverse(X0),add(X0,X1)),
inference(forward_demodulation,[],[f194,f2]) ).
fof(f200,plain,
! [X0,X1] : add(X0,multiply(X1,X0)) = X0,
inference(forward_demodulation,[],[f196,f14]) ).
fof(f233,plain,
! [X0,X1] : add(X0,multiply(X0,X1)) = multiply(X0,add(multiplicative_identity,X1)),
inference(superposition,[],[f6,f13]) ).
fof(f243,plain,
! [X0,X1] : add(multiply(X0,X1),additive_identity) = multiply(X0,add(X1,inverse(X0))),
inference(superposition,[],[f6,f10]) ).
fof(f271,plain,
! [X0,X1] : multiply(X0,X1) = multiply(X0,add(X1,inverse(X0))),
inference(forward_demodulation,[],[f243,f15]) ).
fof(f275,plain,
! [X0,X1] : multiply(X0,multiplicative_identity) = add(X0,multiply(X0,X1)),
inference(forward_demodulation,[],[f233,f147]) ).
fof(f277,plain,
! [X0,X1] : add(X0,multiply(X0,X1)) = X0,
inference(forward_demodulation,[],[f275,f13]) ).
fof(f285,plain,
inverse(b) = add(inverse(b),d),
inference(superposition,[],[f200,f18]) ).
fof(f298,plain,
inverse(b) = add(d,inverse(b)),
inference(forward_demodulation,[],[f285,f1]) ).
fof(f322,plain,
inverse(a) = add(inverse(a),d),
inference(superposition,[],[f277,f18]) ).
fof(f327,plain,
! [X0] : additive_identity = multiply(additive_identity,X0),
inference(superposition,[],[f277,f16]) ).
fof(f340,plain,
inverse(a) = add(d,inverse(a)),
inference(forward_demodulation,[],[f322,f1]) ).
fof(f343,plain,
multiply(b,c) = add(b,additive_identity),
inference(backward_demodulation,[],[f86,f327]) ).
fof(f358,plain,
b = multiply(b,c),
inference(forward_demodulation,[],[f343,f15]) ).
fof(f436,plain,
! [X0] : multiply(X0,multiplicative_identity) = multiply(X0,X0),
inference(superposition,[],[f271,f7]) ).
fof(f440,plain,
multiply(b,d) = multiply(b,inverse(b)),
inference(superposition,[],[f271,f298]) ).
fof(f441,plain,
multiply(a,d) = multiply(a,inverse(a)),
inference(superposition,[],[f271,f340]) ).
fof(f464,plain,
additive_identity = multiply(a,d),
inference(forward_demodulation,[],[f441,f10]) ).
fof(f465,plain,
additive_identity = multiply(b,d),
inference(forward_demodulation,[],[f440,f10]) ).
fof(f467,plain,
! [X0] : multiply(X0,X0) = X0,
inference(forward_demodulation,[],[f436,f13]) ).
fof(f478,plain,
! [X0,X1] : multiply(X0,add(X0,X1)) = add(X0,multiply(X0,X1)),
inference(superposition,[],[f6,f467]) ).
fof(f485,plain,
! [X0,X1] : multiply(X0,add(X0,X1)) = X0,
inference(forward_demodulation,[],[f478,f277]) ).
fof(f707,plain,
a = multiply(a,c),
inference(superposition,[],[f485,f17]) ).
fof(f745,plain,
c = add(c,a),
inference(superposition,[],[f200,f707]) ).
fof(f747,plain,
c = add(a,c),
inference(forward_demodulation,[],[f745,f1]) ).
fof(f1039,plain,
add(a,inverse(d)) = add(inverse(d),additive_identity),
inference(superposition,[],[f79,f464]) ).
fof(f1044,plain,
add(inverse(d),additive_identity) = add(b,inverse(d)),
inference(superposition,[],[f79,f465]) ).
fof(f1068,plain,
inverse(d) = add(b,inverse(d)),
inference(forward_demodulation,[],[f1044,f15]) ).
fof(f1069,plain,
inverse(d) = add(a,inverse(d)),
inference(forward_demodulation,[],[f1039,f15]) ).
fof(f1094,plain,
b = multiply(b,inverse(d)),
inference(superposition,[],[f485,f1068]) ).
fof(f1119,plain,
multiply(c,inverse(d)) = add(a,multiply(b,inverse(d))),
inference(superposition,[],[f92,f1069]) ).
fof(f1131,plain,
add(a,b) = multiply(c,inverse(d)),
inference(forward_demodulation,[],[f1119,f1094]) ).
fof(f1136,plain,
c = multiply(c,inverse(d)),
inference(forward_demodulation,[],[f1131,f17]) ).
fof(f1180,plain,
add(c,inverse(b)) = add(inverse(b),b),
inference(superposition,[],[f80,f358]) ).
fof(f1210,plain,
add(c,inverse(b)) = add(b,inverse(b)),
inference(forward_demodulation,[],[f1180,f1]) ).
fof(f1233,plain,
multiplicative_identity = add(c,inverse(b)),
inference(forward_demodulation,[],[f1210,f7]) ).
fof(f1281,plain,
inverse(d) = add(inverse(d),c),
inference(superposition,[],[f200,f1136]) ).
fof(f1283,plain,
inverse(d) = add(c,inverse(d)),
inference(forward_demodulation,[],[f1281,f1]) ).
fof(f1346,plain,
multiply(d,inverse(d)) = multiply(d,c),
inference(superposition,[],[f271,f1283]) ).
fof(f1356,plain,
multiply(d,inverse(d)) = multiply(c,d),
inference(forward_demodulation,[],[f1346,f2]) ).
fof(f1359,plain,
additive_identity = multiply(c,d),
inference(forward_demodulation,[],[f1356,f10]) ).
fof(f1366,plain,
add(d,inverse(c)) = add(inverse(c),additive_identity),
inference(superposition,[],[f80,f1359]) ).
fof(f1369,plain,
inverse(c) = add(d,inverse(c)),
inference(forward_demodulation,[],[f1366,f15]) ).
fof(f1516,plain,
multiply(a,inverse(c)) = multiply(inverse(c),c),
inference(superposition,[],[f198,f747]) ).
fof(f1555,plain,
multiply(a,inverse(c)) = multiply(c,inverse(c)),
inference(forward_demodulation,[],[f1516,f2]) ).
fof(f1583,plain,
additive_identity = multiply(a,inverse(c)),
inference(forward_demodulation,[],[f1555,f10]) ).
fof(f1640,plain,
add(inverse(a),additive_identity) = add(inverse(c),inverse(a)),
inference(superposition,[],[f80,f1583]) ).
fof(f1643,plain,
add(inverse(a),additive_identity) = add(inverse(a),inverse(c)),
inference(forward_demodulation,[],[f1640,f1]) ).
fof(f1650,plain,
inverse(a) = add(inverse(a),inverse(c)),
inference(forward_demodulation,[],[f1643,f15]) ).
fof(f1686,plain,
multiply(inverse(c),multiplicative_identity) = multiply(inverse(b),inverse(c)),
inference(superposition,[],[f199,f1233]) ).
fof(f1712,plain,
inverse(c) = multiply(inverse(b),inverse(c)),
inference(forward_demodulation,[],[f1686,f13]) ).
fof(f8710,plain,
multiply(inverse(b),inverse(a)) = add(d,multiply(inverse(c),inverse(b))),
inference(superposition,[],[f193,f1650]) ).
fof(f8791,plain,
multiply(inverse(b),inverse(a)) = add(d,multiply(inverse(b),inverse(c))),
inference(forward_demodulation,[],[f8710,f2]) ).
fof(f8816,plain,
multiply(inverse(b),inverse(a)) = add(d,inverse(c)),
inference(forward_demodulation,[],[f8791,f1712]) ).
fof(f8829,plain,
inverse(c) = multiply(inverse(b),inverse(a)),
inference(forward_demodulation,[],[f8816,f1369]) ).
fof(f8833,plain,
multiply(inverse(a),inverse(b)) = inverse(c),
inference(forward_demodulation,[],[f8829,f2]) ).
fof(f8834,plain,
d = inverse(c),
inference(forward_demodulation,[],[f8833,f18]) ).
fof(f8835,plain,
$false,
inference(forward_subsumption_resolution,[],[f8834,f20]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : BOO014-2 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.08 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.27 % Computer : n006.cluster.edu
% 0.10/0.27 % Model : x86_64 x86_64
% 0.10/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.27 % Memory : 8046.5625MB
% 0.10/0.27 % OS : Linux 6.8.0-71-generic
% 0.10/0.27 % CPULimit : 300
% 0.10/0.27 % WCLimit : 300
% 0.10/0.27 % DateTime : Mon Sep 28 21:03:55 UTC 2026
% 0.10/0.28 % CPUTime :
% 0.10/0.28 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.27/0.33 Running first-order model finding
% 0.27/0.33 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.60/0.92 % (200806)Will run a generic schedule for satisfiability detection.
% 3.60/0.92 % (200814)dis+10_1_sil=32000:sp=arity:random_seed=2960766756:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 3.60/0.92 % (200812)% WARNING: option uhcvi not known.
% 3.60/0.92 % (200816)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2943364817:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 3.60/0.92 % (200811)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3829254809_2999 on theBenchmark for (2999ds/0Mi)
% 3.60/0.92 % (200812)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2893975743:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 3.60/0.92 % (200815)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=586589645:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 3.60/0.92 % (200813)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2284313089:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 3.60/0.92 % (200817)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=851526131:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 3.60/0.92 % TRYING [1]
% 3.60/0.92 % TRYING [2]
% 3.60/0.92 % TRYING [3]
% 3.60/0.92 % TRYING [4]
% 3.60/0.92 % (200814)Instruction limit reached!
% 3.60/0.92 % (200814)------------------------------
% 3.60/0.92 % (200814)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.60/0.92 % (200814)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.60/0.92 % (200814)CaDiCaL version: 2.1.3
% 3.60/0.92 % (200814)Termination reason: Instruction limit
% 3.60/0.92 % (200814)Termination phase: Saturation
% 3.60/0.92 % (200814)Time elapsed: 0.050 s
% 3.60/0.92 % (200814)Peak memory usage: 12 MB
% 3.60/0.92 % (200814)Instructions burned: 104 (million)
% 3.60/0.92 % TRYING [5]
% 3.60/0.92 % (200827)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=1326285517:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 3.60/0.92 % TRYING [1]
% 3.60/0.92 % TRYING [2]
% 3.60/0.92 % TRYING [3]
% 3.60/0.92 % TRYING [4]
% 3.60/0.92 % TRYING [5]
% 3.60/0.92 % (200815)Instruction limit reached!
% 3.60/0.92 % (200815)------------------------------
% 3.60/0.92 % (200815)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.60/0.92 % (200815)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.60/0.92 % (200815)CaDiCaL version: 2.1.3
% 3.60/0.92 % (200815)Termination reason: Instruction limit
% 3.60/0.92 % (200815)Termination phase: Saturation
% 3.60/0.92 % (200815)Time elapsed: 0.113 s
% 3.60/0.92 % (200815)Peak memory usage: 12 MB
% 3.60/0.92 % (200815)Instructions burned: 116 (million)
% 3.60/0.92 % (200816)Instruction limit reached!
% 3.60/0.92 % (200816)------------------------------
% 3.60/0.92 % (200816)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.60/0.92 % (200816)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.60/0.92 % (200816)CaDiCaL version: 2.1.3
% 3.60/0.92 % (200816)Termination reason: Instruction limit
% 3.60/0.92 % (200816)Termination phase: Saturation
% 3.60/0.92 % (200816)Time elapsed: 0.120 s
% 3.60/0.92 % (200816)Peak memory usage: 12 MB
% 3.60/0.92 % (200816)Instructions burned: 131 (million)
% 3.60/0.92 % (200830)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=2825413385:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 3.60/0.92 % TRYING [6]
% 3.60/0.92 % TRYING [6]
% 3.60/0.92 % (200831)dis+11_32_anc=none:slsqr=2,1:sil=64000:sas=cadical:lma=off:lsd=50:s2agt=8:slsqc=1:kmz=on:newcnf=on:slsq=on:random_seed=777668564:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 3.60/0.92 % (200817)Instruction limit reached!
% 3.60/0.92 % (200817)------------------------------
% 3.60/0.92 % (200817)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.60/0.92 % (200817)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.60/0.92 % (200817)CaDiCaL version: 2.1.3
% 3.60/0.92 % (200817)Termination reason: Instruction limit
% 3.60/0.92 % (200817)Termination phase: Saturation
% 3.60/0.92 % (200817)Time elapsed: 0.164 s
% 3.60/0.92 % (200817)Peak memory usage: 13 MB
% 3.60/0.92 % (200817)Instructions burned: 160 (million)
% 3.60/0.92 % (200835)ott-21_1_sil=16000:fs=off:random_seed=380741778:i=180:av=off:fsr=off_2997 on theBenchmark for (2997ds/180Mi)
% 3.60/0.92 % (200830)Instruction limit reached!
% 3.60/0.92 % (200830)------------------------------
% 3.60/0.92 % (200830)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.60/0.92 % (200830)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.60/0.92 % (200830)CaDiCaL version: 2.1.3
% 3.60/0.92 % (200830)Termination reason: Instruction limit
% 3.60/0.92 % (200830)Termination phase: Saturation
% 3.60/0.92 % (200830)Time elapsed: 0.132 s
% 3.60/0.92 % (200830)Peak memory usage: 13 MB
% 3.60/0.92 % (200830)Instructions burned: 131 (million)
% 3.60/0.92 % (200837)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=13884245:i=477:bd=all_2996 on theBenchmark for (2996ds/477Mi)
% 3.60/0.92 % TRYING [7]
% 3.60/0.92 % (200827)Instruction limit reached!
% 3.60/0.92 % (200827)------------------------------
% 3.60/0.92 % (200827)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.60/0.92 % (200827)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.60/0.92 % (200827)CaDiCaL version: 2.1.3
% 3.60/0.92 % (200827)Termination reason: Instruction limit
% 3.60/0.92 % (200827)Termination phase: Finite model building constraint generation
% 3.60/0.92 % (200827)Time elapsed: 0.288 s
% 3.60/0.92 % (200827)Peak memory usage: 32 MB
% 3.60/0.92 % (200827)Instructions burned: 715 (million)
% 3.60/0.92 % (200835)Instruction limit reached!
% 3.60/0.92 % (200835)------------------------------
% 3.60/0.92 % (200835)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.60/0.92 % (200835)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.60/0.92 % (200835)CaDiCaL version: 2.1.3
% 3.60/0.92 % (200835)Termination reason: Instruction limit
% 3.60/0.92 % (200835)Termination phase: Saturation
% 3.60/0.92 % (200835)Time elapsed: 0.148 s
% 3.60/0.92 % (200835)Peak memory usage: 12 MB
% 3.60/0.92 % (200835)Instructions burned: 180 (million)
% 3.60/0.92 % (200840)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=1253572977:fmbsr=1.3:i=865:ins=25_2996 on theBenchmark for (2996ds/865Mi)
% 3.60/0.92 % TRYING [1]
% 3.60/0.92 % TRYING [2]
% 3.60/0.92 % TRYING [3]
% 3.60/0.92 % (200841)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=2456330300:i=1179_2996 on theBenchmark for (2996ds/1179Mi)
% 3.60/0.92 % TRYING [4]
% 3.60/0.92 % TRYING [7]
% 3.60/0.92 % TRYING [5]
% 3.60/0.92 % (200837) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-200806-200837"...
% 3.60/0.92 % (200837)...printing done.
% 3.60/0.92 % (200837)Refutation found. Thanks to Tanya!
% 3.60/0.92 % SZS status Unsatisfiable for theBenchmark
% 3.60/0.92 % SZS output start Proof for theBenchmark
% See solution above
% 3.60/0.93 % (200837)------------------------------
% 3.60/0.93 % (200837)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.60/0.93 % (200837)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.60/0.93 % (200837)CaDiCaL version: 2.1.3
% 3.60/0.93 % (200837)Termination reason: Refutation
% 3.60/0.93 % (200837)Time elapsed: 0.253 s
% 3.60/0.93 % (200837)Peak memory usage: 14 MB
% 3.60/0.93 % (200837)Instructions burned: 293 (million)
% 3.60/0.93 % (200806)Success in time 0.589 s
% 3.60/0.93 % Vampire exiting
%------------------------------------------------------------------------------