%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : KLE081+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n014.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 11:40:50 AM UTC 2026
% Result : Theorem 4.29s 1.11s
% Output : Refutation 4.29s
% Verified :
% SZS Type : Refutation
% Derivation depth : 28
% Number of leaves : 17
% Syntax : Number of formulae : 91 ( 87 unt; 4 def)
% Number of atoms : 99 ( 98 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 13 ( 5 ~; 0 |; 6 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 5 con; 0-2 aty)
% Number of variables : 88 ( 87 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',additive_commutativity) ).
fof(f2,axiom,
! [X0,X1,X2] : addition(X2,addition(X1,X0)) = addition(addition(X2,X1),X0),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',additive_associativity) ).
fof(f3,axiom,
! [X0] : addition(X0,zero) = X0,
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',additive_identity) ).
fof(f6,axiom,
! [X0] : multiplication(X0,one) = X0,
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',multiplicative_right_identity) ).
fof(f7,axiom,
! [X0] : multiplication(one,X0) = X0,
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',multiplicative_left_identity) ).
fof(f8,axiom,
! [X0,X1,X2] : multiplication(X0,addition(X1,X2)) = addition(multiplication(X0,X1),multiplication(X0,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',right_distributivity) ).
fof(f9,axiom,
! [X0,X1,X2] : multiplication(addition(X0,X1),X2) = addition(multiplication(X0,X2),multiplication(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',left_distributivity) ).
fof(f11,axiom,
! [X0] : multiplication(zero,X0) = zero,
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',left_annihilation) ).
fof(f13,axiom,
! [X0] : addition(X0,multiplication(domain(X0),X0)) = multiplication(domain(X0),X0),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+5.ax',domain1) ).
fof(f14,axiom,
! [X0,X1] : domain(multiplication(X0,X1)) = domain(multiplication(X0,domain(X1))),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+5.ax',domain2) ).
fof(f15,axiom,
! [X0] : addition(domain(X0),one) = one,
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+5.ax',domain3) ).
fof(f16,axiom,
domain(zero) = zero,
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+5.ax',domain4) ).
fof(f18,conjecture,
! [X0] :
( ! [X1] :
( addition(domain(X1),antidomain(X1)) = one
& multiplication(domain(X1),antidomain(X1)) = zero )
=> multiplication(antidomain(X0),X0) = zero ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(f19,negated_conjecture,
~ ! [X0] :
( ! [X1] :
( addition(domain(X1),antidomain(X1)) = one
& multiplication(domain(X1),antidomain(X1)) = zero )
=> multiplication(antidomain(X0),X0) = zero ),
inference(negated_conjecture,[status(cth)],[f18]) ).
fof(f20,plain,
? [X0] :
( zero != multiplication(antidomain(X0),X0)
& ! [X1] :
( addition(domain(X1),antidomain(X1)) = one
& multiplication(domain(X1),antidomain(X1)) = zero ) ),
inference(ennf_transformation,[],[f19]) ).
fof(f21,plain,
( zero != multiplication(antidomain(sK0),sK0)
& ! [X1] :
( addition(domain(X1),antidomain(X1)) = one
& multiplication(domain(X1),antidomain(X1)) = zero ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f20]) ).
fof(f22,plain,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f23,plain,
! [X2,X0,X1] : addition(X2,addition(X1,X0)) = addition(addition(X2,X1),X0),
inference(cnf_transformation,[],[f2]) ).
fof(f24,plain,
! [X0] : addition(X0,zero) = X0,
inference(cnf_transformation,[],[f3]) ).
fof(f27,plain,
! [X0] : multiplication(X0,one) = X0,
inference(cnf_transformation,[],[f6]) ).
fof(f28,plain,
! [X0] : multiplication(one,X0) = X0,
inference(cnf_transformation,[],[f7]) ).
fof(f29,plain,
! [X2,X0,X1] : multiplication(X0,addition(X1,X2)) = addition(multiplication(X0,X1),multiplication(X0,X2)),
inference(cnf_transformation,[],[f8]) ).
fof(f30,plain,
! [X2,X0,X1] : multiplication(addition(X0,X1),X2) = addition(multiplication(X0,X2),multiplication(X1,X2)),
inference(cnf_transformation,[],[f9]) ).
fof(f32,plain,
! [X0] : zero = multiplication(zero,X0),
inference(cnf_transformation,[],[f11]) ).
fof(f33,plain,
! [X0] : multiplication(domain(X0),X0) = addition(X0,multiplication(domain(X0),X0)),
inference(cnf_transformation,[],[f13]) ).
fof(f34,plain,
! [X0,X1] : domain(multiplication(X0,X1)) = domain(multiplication(X0,domain(X1))),
inference(cnf_transformation,[],[f14]) ).
fof(f35,plain,
! [X0] : one = addition(domain(X0),one),
inference(cnf_transformation,[],[f15]) ).
fof(f36,plain,
zero = domain(zero),
inference(cnf_transformation,[],[f16]) ).
fof(f38,plain,
! [X1] : zero = multiplication(domain(X1),antidomain(X1)),
inference(cnf_transformation,[],[f21]) ).
fof(f39,plain,
! [X1] : one = addition(domain(X1),antidomain(X1)),
inference(cnf_transformation,[],[f21]) ).
fof(f40,plain,
zero != multiplication(antidomain(sK0),sK0),
inference(cnf_transformation,[],[f21]) ).
fof(f41,definition,
sF1 = antidomain(sK0),
introduced(definition,[new_symbols(definition,[sF1])],[function_definition]) ).
fof(f42,plain,
antidomain(sK0) = sF1,
inference(reorient_equations,[],[f41]) ).
fof(f43,definition,
sF2 = multiplication(sF1,sK0),
introduced(definition,[new_symbols(definition,[sF2])],[function_definition]) ).
fof(f44,plain,
multiplication(sF1,sK0) = sF2,
inference(reorient_equations,[],[f43]) ).
fof(f45,plain,
zero != sF2,
inference(definition_folding,[],[f40,f44,f42]) ).
fof(f46,definition,
! [X1] : sF3(X1) = addition(domain(X1),antidomain(X1)),
introduced(definition,[new_symbols(definition,[sF3])],[function_definition]) ).
fof(f47,plain,
! [X1] : addition(domain(X1),antidomain(X1)) = sF3(X1),
inference(reorient_equations,[],[f46]) ).
fof(f48,plain,
! [X1] : one = sF3(X1),
inference(definition_folding,[],[f39,f47]) ).
fof(f49,definition,
! [X1] : sF4(X1) = multiplication(domain(X1),antidomain(X1)),
introduced(definition,[new_symbols(definition,[sF4])],[function_definition]) ).
fof(f50,plain,
! [X1] : multiplication(domain(X1),antidomain(X1)) = sF4(X1),
inference(reorient_equations,[],[f49]) ).
fof(f51,plain,
! [X1] : zero = sF4(X1),
inference(definition_folding,[],[f38,f50]) ).
fof(f52,plain,
! [X1] : one = addition(domain(X1),antidomain(X1)),
inference(forward_demodulation,[],[f47,f48]) ).
fof(f53,plain,
! [X1] : zero = multiplication(domain(X1),antidomain(X1)),
inference(forward_demodulation,[],[f50,f51]) ).
fof(f56,plain,
zero = multiplication(domain(sK0),sF1),
inference(superposition,[],[f53,f42]) ).
fof(f57,plain,
one = addition(domain(sK0),sF1),
inference(superposition,[],[f52,f42]) ).
fof(f58,plain,
one = addition(sF1,domain(sK0)),
inference(forward_demodulation,[],[f57,f22]) ).
fof(f66,plain,
! [X0] : addition(zero,X0) = X0,
inference(superposition,[],[f24,f22]) ).
fof(f78,plain,
! [X0,X1] : zero = multiplication(domain(multiplication(X0,X1)),antidomain(multiplication(X0,domain(X1)))),
inference(superposition,[],[f53,f34]) ).
fof(f112,plain,
! [X0] : zero = multiplication(domain(multiplication(one,X0)),antidomain(domain(X0))),
inference(superposition,[],[f78,f28]) ).
fof(f113,plain,
! [X0] : zero = multiplication(domain(X0),antidomain(domain(X0))),
inference(forward_demodulation,[],[f112,f28]) ).
fof(f191,plain,
! [X0,X1] : multiplication(domain(multiplication(X0,X1)),multiplication(X0,domain(X1))) = addition(multiplication(X0,domain(X1)),multiplication(domain(multiplication(X0,X1)),multiplication(X0,domain(X1)))),
inference(superposition,[],[f33,f34]) ).
fof(f195,plain,
! [X0,X1] : addition(multiplication(domain(X0),X0),X1) = addition(X0,addition(multiplication(domain(X0),X0),X1)),
inference(superposition,[],[f23,f33]) ).
fof(f212,plain,
! [X0,X1] : multiplication(X0,one) = addition(multiplication(X0,domain(X1)),multiplication(X0,one)),
inference(superposition,[],[f29,f35]) ).
fof(f214,plain,
! [X0] : multiplication(X0,one) = addition(multiplication(X0,sF1),multiplication(X0,domain(sK0))),
inference(superposition,[],[f29,f58]) ).
fof(f216,plain,
! [X0,X1] : multiplication(X0,one) = addition(multiplication(X0,domain(X1)),multiplication(X0,antidomain(X1))),
inference(superposition,[],[f29,f52]) ).
fof(f238,plain,
! [X0,X1] : addition(multiplication(X0,domain(X1)),multiplication(X0,antidomain(X1))) = X0,
inference(forward_demodulation,[],[f216,f27]) ).
fof(f239,plain,
! [X0] : addition(multiplication(X0,sF1),multiplication(X0,domain(sK0))) = X0,
inference(forward_demodulation,[],[f214,f27]) ).
fof(f241,plain,
! [X0,X1] : multiplication(X0,one) = addition(multiplication(X0,one),multiplication(X0,domain(X1))),
inference(forward_demodulation,[],[f212,f22]) ).
fof(f253,plain,
! [X0,X1] : addition(X0,multiplication(X0,domain(X1))) = X0,
inference(forward_demodulation,[],[f241,f27]) ).
fof(f288,plain,
! [X0,X1] : multiplication(one,X1) = addition(multiplication(domain(X0),X1),multiplication(one,X1)),
inference(superposition,[],[f30,f35]) ).
fof(f290,plain,
! [X0] : multiplication(one,X0) = addition(multiplication(sF1,X0),multiplication(domain(sK0),X0)),
inference(superposition,[],[f30,f58]) ).
fof(f292,plain,
! [X0,X1] : multiplication(one,X1) = addition(multiplication(domain(X0),X1),multiplication(antidomain(X0),X1)),
inference(superposition,[],[f30,f52]) ).
fof(f315,plain,
! [X0,X1] : addition(multiplication(domain(X0),X1),multiplication(antidomain(X0),X1)) = X1,
inference(forward_demodulation,[],[f292,f28]) ).
fof(f316,plain,
! [X0] : addition(multiplication(sF1,X0),multiplication(domain(sK0),X0)) = X0,
inference(forward_demodulation,[],[f290,f28]) ).
fof(f318,plain,
! [X0,X1] : multiplication(one,X1) = addition(multiplication(one,X1),multiplication(domain(X0),X1)),
inference(forward_demodulation,[],[f288,f22]) ).
fof(f333,plain,
! [X0,X1] : addition(X1,multiplication(domain(X0),X1)) = X1,
inference(forward_demodulation,[],[f318,f28]) ).
fof(f4678,plain,
multiplication(domain(zero),multiplication(domain(sK0),domain(sF1))) = addition(multiplication(domain(sK0),domain(sF1)),multiplication(domain(zero),multiplication(domain(sK0),domain(sF1)))),
inference(superposition,[],[f191,f56]) ).
fof(f4763,plain,
multiplication(domain(sK0),domain(sF1)) = multiplication(domain(zero),multiplication(domain(sK0),domain(sF1))),
inference(forward_demodulation,[],[f4678,f333]) ).
fof(f4809,plain,
multiplication(domain(sK0),domain(sF1)) = multiplication(zero,multiplication(domain(sK0),domain(sF1))),
inference(forward_demodulation,[],[f4763,f36]) ).
fof(f4841,plain,
zero = multiplication(domain(sK0),domain(sF1)),
inference(forward_demodulation,[],[f4809,f32]) ).
fof(f4978,plain,
domain(sF1) = addition(zero,multiplication(antidomain(sK0),domain(sF1))),
inference(superposition,[],[f315,f4841]) ).
fof(f4986,plain,
domain(sK0) = addition(zero,multiplication(domain(sK0),antidomain(sF1))),
inference(superposition,[],[f238,f4841]) ).
fof(f4998,plain,
domain(sK0) = multiplication(domain(sK0),antidomain(sF1)),
inference(forward_demodulation,[],[f4986,f66]) ).
fof(f5001,plain,
domain(sF1) = multiplication(antidomain(sK0),domain(sF1)),
inference(forward_demodulation,[],[f4978,f66]) ).
fof(f5007,plain,
domain(sF1) = multiplication(sF1,domain(sF1)),
inference(forward_demodulation,[],[f5001,f42]) ).
fof(f7598,plain,
sF1 = addition(sF1,domain(sF1)),
inference(superposition,[],[f253,f5007]) ).
fof(f7861,plain,
domain(sF1) = addition(sF1,domain(sF1)),
inference(superposition,[],[f195,f239]) ).
fof(f7887,plain,
sF1 = domain(sF1),
inference(forward_demodulation,[],[f7861,f7598]) ).
fof(f7966,plain,
zero = multiplication(sF1,antidomain(sF1)),
inference(superposition,[],[f113,f7887]) ).
fof(f8108,plain,
antidomain(sF1) = addition(zero,multiplication(domain(sK0),antidomain(sF1))),
inference(superposition,[],[f316,f7966]) ).
fof(f8133,plain,
antidomain(sF1) = multiplication(domain(sK0),antidomain(sF1)),
inference(forward_demodulation,[],[f8108,f66]) ).
fof(f8137,plain,
domain(sK0) = antidomain(sF1),
inference(forward_demodulation,[],[f8133,f4998]) ).
fof(f8339,plain,
zero = multiplication(sF1,domain(sK0)),
inference(superposition,[],[f7966,f8137]) ).
fof(f8708,plain,
domain(zero) = domain(multiplication(sF1,sK0)),
inference(superposition,[],[f34,f8339]) ).
fof(f8741,plain,
domain(zero) = domain(sF2),
inference(forward_demodulation,[],[f8708,f44]) ).
fof(f8756,plain,
zero = domain(sF2),
inference(forward_demodulation,[],[f8741,f36]) ).
fof(f8884,plain,
multiplication(zero,sF2) = addition(sF2,multiplication(zero,sF2)),
inference(superposition,[],[f33,f8756]) ).
fof(f8947,plain,
zero = addition(sF2,zero),
inference(forward_demodulation,[],[f8884,f32]) ).
fof(f8962,plain,
zero = sF2,
inference(forward_demodulation,[],[f8947,f24]) ).
fof(f8971,plain,
$false,
inference(forward_subsumption_resolution,[],[f8962,f45]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KLE081+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.38 % Computer : n014.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Sun Sep 27 13:09:16 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.41 Running first-order model finding
% 0.12/0.41 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.29/1.11 % (801375)Will run a generic schedule for satisfiability detection.
% 4.29/1.11 % (801380)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1523430611_2999 on theBenchmark for (2999ds/0Mi)
% 4.29/1.11 % TRYING [1]
% 4.29/1.11 % TRYING [2]
% 4.29/1.11 % TRYING [3]
% 4.29/1.11 % TRYING [4]
% 4.29/1.11 % (801382)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=502783300:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 4.29/1.11 % (801383)dis+10_1_sil=32000:sp=arity:random_seed=3394241446:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 4.29/1.11 % (801384)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3117575945:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 4.29/1.11 % (801385)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=662578378:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 4.29/1.11 % (801386)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3970591993:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 4.29/1.11 % (801381)% WARNING: option uhcvi not known.
% 4.29/1.11 % TRYING [5]
% 4.29/1.11 % (801381)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2538518200:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 4.29/1.11 % TRYING [6]
% 4.29/1.11 % (801383)Instruction limit reached!
% 4.29/1.11 % (801383)------------------------------
% 4.29/1.11 % (801383)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.29/1.11 % (801383)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.29/1.11 % (801383)CaDiCaL version: 2.1.3
% 4.29/1.11 % (801383)Termination reason: Instruction limit
% 4.29/1.11 % (801383)Termination phase: Saturation
% 4.29/1.11 % (801383)Time elapsed: 0.060 s
% 4.29/1.11 % (801383)Peak memory usage: 12 MB
% 4.29/1.11 % (801383)Instructions burned: 103 (million)
% 4.29/1.11 % (801384)Instruction limit reached!
% 4.29/1.11 % (801384)------------------------------
% 4.29/1.11 % (801384)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.29/1.11 % (801384)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.29/1.11 % (801384)CaDiCaL version: 2.1.3
% 4.29/1.11 % (801384)Termination reason: Instruction limit
% 4.29/1.11 % (801384)Termination phase: Saturation
% 4.29/1.11 % (801384)Time elapsed: 0.069 s
% 4.29/1.11 % (801384)Peak memory usage: 13 MB
% 4.29/1.11 % (801384)Instructions burned: 118 (million)
% 4.29/1.11 % (801385)Instruction limit reached!
% 4.29/1.11 % (801385)------------------------------
% 4.29/1.11 % (801385)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.29/1.11 % (801385)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.29/1.11 % (801385)CaDiCaL version: 2.1.3
% 4.29/1.11 % (801385)Termination reason: Instruction limit
% 4.29/1.11 % (801385)Termination phase: Saturation
% 4.29/1.11 % (801385)Time elapsed: 0.077 s
% 4.29/1.11 % (801385)Peak memory usage: 13 MB
% 4.29/1.11 % (801385)Instructions burned: 132 (million)
% 4.29/1.11 % (801394)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=579268567:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 4.29/1.11 % TRYING [1]
% 4.29/1.11 % TRYING [2]
% 4.29/1.11 % TRYING [3]
% 4.29/1.11 % (801395)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=2144659181:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 4.29/1.11 % TRYING [4]
% 4.29/1.11 % (801396)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=4270966180:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 4.29/1.11 % (801386)Instruction limit reached!
% 4.29/1.11 % (801386)------------------------------
% 4.29/1.11 % (801386)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.29/1.11 % (801386)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.29/1.11 % (801386)CaDiCaL version: 2.1.3
% 4.29/1.11 % (801386)Termination reason: Instruction limit
% 4.29/1.11 % (801386)Termination phase: Saturation
% 4.29/1.11 % (801386)Time elapsed: 0.098 s
% 4.29/1.11 % (801386)Peak memory usage: 13 MB
% 4.29/1.11 % (801386)Instructions burned: 160 (million)
% 4.29/1.11 % TRYING [7]
% 4.29/1.11 % TRYING [5]
% 4.29/1.11 % (801400)ott-21_1_sil=16000:fs=off:random_seed=1387864252:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 4.29/1.11 % TRYING [6]
% 4.29/1.11 % (801395)Instruction limit reached!
% 4.29/1.11 % (801395)------------------------------
% 4.29/1.11 % (801395)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.29/1.11 % (801395)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.29/1.11 % (801395)CaDiCaL version: 2.1.3
% 4.29/1.11 % (801395)Termination reason: Instruction limit
% 4.29/1.11 % (801395)Termination phase: Saturation
% 4.29/1.11 % (801395)Time elapsed: 0.085 s
% 4.29/1.11 % (801395)Peak memory usage: 13 MB
% 4.29/1.11 % (801395)Instructions burned: 132 (million)
% 4.29/1.11 % (801402)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=1744357652:i=477:bd=all_2997 on theBenchmark for (2997ds/477Mi)
% 4.29/1.11 % (801400)Instruction limit reached!
% 4.29/1.11 % (801400)------------------------------
% 4.29/1.11 % (801400)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.29/1.11 % (801400)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.29/1.11 % (801400)CaDiCaL version: 2.1.3
% 4.29/1.11 % (801400)Termination reason: Instruction limit
% 4.29/1.11 % (801400)Termination phase: Saturation
% 4.29/1.11 % (801400)Time elapsed: 0.083 s
% 4.29/1.11 % (801400)Peak memory usage: 12 MB
% 4.29/1.11 % (801400)Instructions burned: 182 (million)
% 4.29/1.11 % (801404)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=3312869913:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 4.29/1.11 % TRYING [1]
% 4.29/1.11 % TRYING [2]
% 4.29/1.11 % TRYING [3]
% 4.29/1.11 % TRYING [4]
% 4.29/1.11 % TRYING [8]
% 4.29/1.11 % TRYING [5]
% 4.29/1.11 % TRYING [7]
% 4.29/1.11 % TRYING [6]
% 4.29/1.11 % (801394)Instruction limit reached!
% 4.29/1.11 % (801394)------------------------------
% 4.29/1.11 % (801394)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.29/1.11 % (801394)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.29/1.11 % (801394)CaDiCaL version: 2.1.3
% 4.29/1.11 % (801394)Termination reason: Instruction limit
% 4.29/1.11 % (801394)Termination phase: Finite model building constraint generation
% 4.29/1.11 % (801394)Time elapsed: 0.305 s
% 4.29/1.11 % (801394)Peak memory usage: 31 MB
% 4.29/1.11 % (801394)Instructions burned: 714 (million)
% 4.29/1.11 % (801406)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=953145571:i=1179_2995 on theBenchmark for (2995ds/1179Mi)
% 4.29/1.11 % (801396)Instruction limit reached!
% 4.29/1.11 % (801396)------------------------------
% 4.29/1.11 % (801396)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.29/1.11 % (801396)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.29/1.11 % (801396)CaDiCaL version: 2.1.3
% 4.29/1.11 % (801396)Termination reason: Instruction limit
% 4.29/1.11 % (801396)Termination phase: Saturation
% 4.29/1.11 % (801396)Time elapsed: 0.343 s
% 4.29/1.11 % (801396)Peak memory usage: 19 MB
% 4.29/1.11 % (801396)Instructions burned: 684 (million)
% 4.29/1.11 % (801402)Instruction limit reached!
% 4.29/1.11 % (801402)------------------------------
% 4.29/1.11 % (801402)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.29/1.11 % (801402)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.29/1.11 % (801402)CaDiCaL version: 2.1.3
% 4.29/1.11 % (801402)Termination reason: Instruction limit
% 4.29/1.11 % (801402)Termination phase: Saturation
% 4.29/1.11 % (801402)Time elapsed: 0.259 s
% 4.29/1.11 % (801402)Peak memory usage: 16 MB
% 4.29/1.11 % (801402)Instructions burned: 477 (million)
% 4.29/1.11 % (801408)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=698391776:i=889:ins=1_2995 on theBenchmark for (2995ds/889Mi)
% 4.29/1.11 % (801409)ott+1_16_sil=32000:plsq=on:plsqc=2:sas=cadical:avsql=on:sp=reverse_frequency:plsqr=128,1:bsr=unit_only:rp=on:newcnf=on:random_seed=955993457:avsq=on:s2a=on:i=692:avsqr=8,1:kws=arity_squared:bs=unit_only:nm=2:rawr=on_2995 on theBenchmark for (2995ds/692Mi)
% 4.29/1.11 % (801404)Instruction limit reached!
% 4.29/1.11 % (801404)------------------------------
% 4.29/1.11 % (801404)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.29/1.11 % (801404)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.29/1.11 % (801404)CaDiCaL version: 2.1.3
% 4.29/1.11 % (801404)Termination reason: Instruction limit
% 4.29/1.11 % (801404)Termination phase: Finite model building SAT solving
% 4.29/1.11 % (801404)Time elapsed: 0.337 s
% 4.29/1.11 % (801404)Peak memory usage: 25 MB
% 4.29/1.11 % (801404)Instructions burned: 867 (million)
% 4.29/1.11 % (801412)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=2422008567:i=879:kws=inv_precedence:fsr=off_2994 on theBenchmark for (2994ds/879Mi)
% 4.29/1.11 % TRYING [14]
% 4.29/1.11 % (801406) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-801375-801406"...
% 4.29/1.11 % (801406)...printing done.
% 4.29/1.11 % (801406)Refutation found. Thanks to Tanya!
% 4.29/1.11 % SZS status Theorem for theBenchmark
% 4.29/1.11 % SZS output start Proof for theBenchmark
% See solution above
% 4.29/1.12 % (801406)------------------------------
% 4.29/1.12 % (801406)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.29/1.12 % (801406)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.29/1.12 % (801406)CaDiCaL version: 2.1.3
% 4.29/1.12 % (801406)Termination reason: Refutation
% 4.29/1.12 % (801406)Time elapsed: 0.236 s
% 4.29/1.12 % (801406)Peak memory usage: 16 MB
% 4.29/1.12 % (801406)Instructions burned: 438 (million)
% 4.29/1.12 % (801375)Success in time 0.694 s
% 4.29/1.12 % Vampire exiting
%------------------------------------------------------------------------------