%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : KLE024+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n018.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:40 AM UTC 2026
% Result : Theorem 2.86s 0.95s
% Output : Refutation 2.86s
% Verified :
% SZS Type : Refutation
% Derivation depth : 27
% Number of leaves : 18
% Syntax : Number of formulae : 104 ( 70 unt; 7 def)
% Number of atoms : 183 ( 115 equ)
% Maximal formula atoms : 8 ( 1 avg)
% Number of connectives : 132 ( 53 ~; 47 |; 23 &)
% ( 4 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 16 ( 16 usr; 12 con; 0-2 aty)
% Number of variables : 89 ( 80 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/Axioms/KLE001+0.ax',additive_associativity) ).
fof(f3,axiom,
! [X0] : addition(X0,zero) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',additive_identity) ).
fof(f4,axiom,
! [X0] : addition(X0,X0) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',additive_idempotence) ).
fof(f5,axiom,
! [X0,X1,X2] : multiplication(X0,multiplication(X1,X2)) = multiplication(multiplication(X0,X1),X2),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',multiplicative_associativity) ).
fof(f8,axiom,
! [X0,X1,X2] : multiplication(X0,addition(X1,X2)) = addition(multiplication(X0,X1),multiplication(X0,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',right_distributivity) ).
fof(f11,axiom,
! [X0] : multiplication(zero,X0) = zero,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',left_annihilation) ).
fof(f13,axiom,
! [X0] :
( test(X0)
<=> ? [X1] : complement(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+1.ax',test_1) ).
fof(f14,axiom,
! [X0,X1] :
( complement(X1,X0)
<=> ( multiplication(X0,X1) = zero
& multiplication(X1,X0) = zero
& addition(X0,X1) = one ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+1.ax',test_2) ).
fof(f15,axiom,
! [X0,X1] :
( test(X0)
=> ( c(X0) = X1
<=> complement(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+1.ax',test_3) ).
fof(f17,conjecture,
! [X0,X1,X2] :
( ( test(X1)
& test(X2) )
=> ( addition(multiplication(X0,c(X2)),multiplication(c(X1),X0)) = multiplication(c(X1),X0)
=> multiplication(multiplication(X1,X0),c(X2)) = zero ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(f18,negated_conjecture,
~ ! [X0,X1,X2] :
( ( test(X1)
& test(X2) )
=> ( addition(multiplication(X0,c(X2)),multiplication(c(X1),X0)) = multiplication(c(X1),X0)
=> multiplication(multiplication(X1,X0),c(X2)) = zero ) ),
inference(negated_conjecture,[status(cth)],[f17]) ).
fof(f19,plain,
! [X0,X1] :
( ( c(X0) = X1
<=> complement(X0,X1) )
| ~ test(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f21,plain,
? [X0,X1,X2] :
( zero != multiplication(multiplication(X1,X0),c(X2))
& addition(multiplication(X0,c(X2)),multiplication(c(X1),X0)) = multiplication(c(X1),X0)
& test(X1)
& test(X2) ),
inference(ennf_transformation,[],[f18]) ).
fof(f22,plain,
? [X0,X1,X2] :
( zero != multiplication(multiplication(X1,X0),c(X2))
& addition(multiplication(X0,c(X2)),multiplication(c(X1),X0)) = multiplication(c(X1),X0)
& test(X1)
& test(X2) ),
inference(flattening,[],[f21]) ).
fof(f23,plain,
! [X0] :
( ( test(X0)
| ! [X1] : ~ complement(X1,X0) )
& ( ? [X1] : complement(X1,X0)
| ~ test(X0) ) ),
inference(nnf_transformation,[],[f13]) ).
fof(f24,plain,
! [X0] :
( ( test(X0)
| ! [X1] : ~ complement(X1,X0) )
& ( ? [X2] : complement(X2,X0)
| ~ test(X0) ) ),
inference(rectify,[],[f23]) ).
fof(f25,plain,
! [X0] :
( ( test(X0)
| ! [X1] : ~ complement(X1,X0) )
& ( complement(sK0(X0),X0)
| ~ test(X0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X2,sK0(X0))],[f24]) ).
fof(f26,plain,
! [X0,X1] :
( ( complement(X1,X0)
| zero != multiplication(X0,X1)
| zero != multiplication(X1,X0)
| addition(X0,X1) != one )
& ( ( multiplication(X0,X1) = zero
& multiplication(X1,X0) = zero
& addition(X0,X1) = one )
| ~ complement(X1,X0) ) ),
inference(nnf_transformation,[],[f14]) ).
fof(f27,plain,
! [X0,X1] :
( ( complement(X1,X0)
| zero != multiplication(X0,X1)
| zero != multiplication(X1,X0)
| addition(X0,X1) != one )
& ( ( multiplication(X0,X1) = zero
& multiplication(X1,X0) = zero
& addition(X0,X1) = one )
| ~ complement(X1,X0) ) ),
inference(flattening,[],[f26]) ).
fof(f28,plain,
! [X0,X1] :
( ( ( c(X0) = X1
| ~ complement(X0,X1) )
& ( complement(X0,X1)
| c(X0) != X1 ) )
| ~ test(X0) ),
inference(nnf_transformation,[],[f19]) ).
fof(f29,plain,
( zero != multiplication(multiplication(sK2,sK1),c(sK3))
& multiplication(c(sK2),sK1) = addition(multiplication(sK1,c(sK3)),multiplication(c(sK2),sK1))
& test(sK2)
& test(sK3) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2,sK3]),skolemize(X0,sK1),skolemize(X1,sK2),skolemize(X2,sK3)],[f22]) ).
fof(f30,plain,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f31,plain,
! [X2,X0,X1] : addition(X2,addition(X1,X0)) = addition(addition(X2,X1),X0),
inference(cnf_transformation,[],[f2]) ).
fof(f32,plain,
! [X0] : addition(X0,zero) = X0,
inference(cnf_transformation,[],[f3]) ).
fof(f33,plain,
! [X0] : addition(X0,X0) = X0,
inference(cnf_transformation,[],[f4]) ).
fof(f34,plain,
! [X2,X0,X1] : multiplication(X0,multiplication(X1,X2)) = multiplication(multiplication(X0,X1),X2),
inference(cnf_transformation,[],[f5]) ).
fof(f37,plain,
! [X2,X0,X1] : multiplication(X0,addition(X1,X2)) = addition(multiplication(X0,X1),multiplication(X0,X2)),
inference(cnf_transformation,[],[f8]) ).
fof(f40,plain,
! [X0] : zero = multiplication(zero,X0),
inference(cnf_transformation,[],[f11]) ).
fof(f41,plain,
! [X0] :
( ~ test(X0)
| complement(sK0(X0),X0) ),
inference(cnf_transformation,[],[f25]) ).
fof(f42,plain,
! [X0,X1] :
( ~ complement(X1,X0)
| test(X0) ),
inference(cnf_transformation,[],[f25]) ).
fof(f43,plain,
! [X0,X1] :
( ~ complement(X1,X0)
| addition(X0,X1) = one ),
inference(cnf_transformation,[],[f27]) ).
fof(f44,plain,
! [X0,X1] :
( ~ complement(X1,X0)
| zero = multiplication(X1,X0) ),
inference(cnf_transformation,[],[f27]) ).
fof(f45,plain,
! [X0,X1] :
( ~ complement(X1,X0)
| zero = multiplication(X0,X1) ),
inference(cnf_transformation,[],[f27]) ).
fof(f46,plain,
! [X0,X1] :
( zero != multiplication(X1,X0)
| zero != multiplication(X0,X1)
| complement(X1,X0)
| addition(X0,X1) != one ),
inference(cnf_transformation,[],[f27]) ).
fof(f47,plain,
! [X0,X1] :
( complement(X0,X1)
| c(X0) != X1
| ~ test(X0) ),
inference(cnf_transformation,[],[f28]) ).
fof(f48,plain,
! [X0,X1] :
( ~ complement(X0,X1)
| c(X0) = X1
| ~ test(X0) ),
inference(cnf_transformation,[],[f28]) ).
fof(f51,plain,
test(sK2),
inference(cnf_transformation,[],[f29]) ).
fof(f52,plain,
multiplication(c(sK2),sK1) = addition(multiplication(sK1,c(sK3)),multiplication(c(sK2),sK1)),
inference(cnf_transformation,[],[f29]) ).
fof(f53,plain,
zero != multiplication(multiplication(sK2,sK1),c(sK3)),
inference(cnf_transformation,[],[f29]) ).
fof(f54,plain,
! [X0] :
( ~ test(X0)
| complement(X0,c(X0)) ),
inference(equality_resolution,[],[f47]) ).
fof(f55,definition,
sF4 = multiplication(sK2,sK1),
introduced(definition,[new_symbols(definition,[sF4])],[function_definition]) ).
fof(f56,plain,
multiplication(sK2,sK1) = sF4,
inference(reorient_equations,[],[f55]) ).
fof(f57,definition,
sF5 = c(sK3),
introduced(definition,[new_symbols(definition,[sF5])],[function_definition]) ).
fof(f58,plain,
c(sK3) = sF5,
inference(reorient_equations,[],[f57]) ).
fof(f59,definition,
sF6 = multiplication(sF4,sF5),
introduced(definition,[new_symbols(definition,[sF6])],[function_definition]) ).
fof(f60,plain,
multiplication(sF4,sF5) = sF6,
inference(reorient_equations,[],[f59]) ).
fof(f61,plain,
zero != sF6,
inference(definition_folding,[],[f53,f60,f58,f56]) ).
fof(f62,definition,
sF7 = c(sK2),
introduced(definition,[new_symbols(definition,[sF7])],[function_definition]) ).
fof(f63,plain,
c(sK2) = sF7,
inference(reorient_equations,[],[f62]) ).
fof(f64,definition,
sF8 = multiplication(sF7,sK1),
introduced(definition,[new_symbols(definition,[sF8])],[function_definition]) ).
fof(f65,plain,
multiplication(sF7,sK1) = sF8,
inference(reorient_equations,[],[f64]) ).
fof(f66,definition,
sF9 = multiplication(sK1,sF5),
introduced(definition,[new_symbols(definition,[sF9])],[function_definition]) ).
fof(f67,plain,
multiplication(sK1,sF5) = sF9,
inference(reorient_equations,[],[f66]) ).
fof(f68,definition,
sF10 = addition(sF9,sF8),
introduced(definition,[new_symbols(definition,[sF10])],[function_definition]) ).
fof(f69,plain,
addition(sF9,sF8) = sF10,
inference(reorient_equations,[],[f68]) ).
fof(f70,plain,
sF8 = sF10,
inference(definition_folding,[],[f52,f69,f65,f63,f67,f58,f65,f63]) ).
fof(f71,plain,
sF8 = addition(sF9,sF8),
inference(forward_demodulation,[],[f69,f70]) ).
fof(f77,plain,
complement(sK2,c(sK2)),
inference(resolution,[],[f54,f51]) ).
fof(f79,plain,
complement(sK2,sF7),
inference(forward_demodulation,[],[f77,f63]) ).
fof(f81,plain,
test(sF7),
inference(resolution,[],[f79,f42]) ).
fof(f85,plain,
! [X0] : addition(zero,X0) = X0,
inference(superposition,[],[f32,f30]) ).
fof(f87,plain,
complement(sK0(sF7),sF7),
inference(resolution,[],[f81,f41]) ).
fof(f89,plain,
one = addition(sF7,sK2),
inference(resolution,[],[f43,f79]) ).
fof(f93,plain,
zero = multiplication(sK2,sF7),
inference(resolution,[],[f44,f79]) ).
fof(f98,plain,
zero = multiplication(sF7,sK2),
inference(resolution,[],[f45,f79]) ).
fof(f127,plain,
! [X0] : addition(sF8,X0) = addition(sF9,addition(sF8,X0)),
inference(superposition,[],[f31,f71]) ).
fof(f129,plain,
! [X0,X1] : addition(X0,X1) = addition(X0,addition(X0,X1)),
inference(superposition,[],[f31,f33]) ).
fof(f150,plain,
! [X0] : multiplication(sK2,multiplication(sK1,X0)) = multiplication(sF4,X0),
inference(superposition,[],[f34,f56]) ).
fof(f244,plain,
zero = multiplication(sF7,sK0(sF7)),
inference(resolution,[],[f87,f45]) ).
fof(f245,plain,
zero = multiplication(sK0(sF7),sF7),
inference(resolution,[],[f87,f44]) ).
fof(f246,plain,
one = addition(sF7,sK0(sF7)),
inference(resolution,[],[f87,f43]) ).
fof(f339,plain,
! [X0,X1] : multiplication(X1,addition(sF8,X0)) = addition(multiplication(X1,sF9),multiplication(X1,addition(sF8,X0))),
inference(superposition,[],[f37,f127]) ).
fof(f342,plain,
! [X0,X1] : addition(multiplication(X1,sF8),multiplication(X1,X0)) = addition(multiplication(X1,sF9),addition(multiplication(X1,sF8),multiplication(X1,X0))),
inference(forward_demodulation,[],[f339,f37]) ).
fof(f451,plain,
! [X0] : multiplication(zero,X0) = multiplication(sK2,multiplication(sF7,X0)),
inference(superposition,[],[f34,f93]) ).
fof(f453,plain,
! [X0] : zero = multiplication(sK2,multiplication(sF7,X0)),
inference(forward_demodulation,[],[f451,f40]) ).
fof(f460,plain,
( zero != zero
| zero != multiplication(sK2,sF7)
| complement(sF7,sK2)
| one != addition(sK2,sF7) ),
inference(superposition,[],[f46,f98]) ).
fof(f462,plain,
( zero != multiplication(sK2,sF7)
| complement(sF7,sK2)
| one != addition(sK2,sF7) ),
inference(trivial_inequality_removal,[],[f460]) ).
fof(f464,plain,
( complement(sF7,sK2)
| one != addition(sK2,sF7) ),
inference(forward_subsumption_resolution,[],[f462,f93]) ).
fof(f465,plain,
( one != addition(sF7,sK2)
| complement(sF7,sK2) ),
inference(forward_demodulation,[],[f464,f30]) ).
fof(f466,plain,
complement(sF7,sK2),
inference(forward_subsumption_resolution,[],[f465,f89]) ).
fof(f472,plain,
( sK2 = c(sF7)
| ~ test(sF7) ),
inference(resolution,[],[f466,f48]) ).
fof(f478,plain,
sK2 = c(sF7),
inference(forward_subsumption_resolution,[],[f472,f81]) ).
fof(f549,plain,
multiplication(sF4,sF5) = multiplication(sK2,sF9),
inference(superposition,[],[f150,f67]) ).
fof(f561,plain,
sF6 = multiplication(sK2,sF9),
inference(forward_demodulation,[],[f549,f60]) ).
fof(f2937,plain,
( zero != zero
| zero != multiplication(sK0(sF7),sF7)
| complement(sF7,sK0(sF7))
| one != addition(sK0(sF7),sF7) ),
inference(superposition,[],[f46,f244]) ).
fof(f2947,plain,
( zero != multiplication(sK0(sF7),sF7)
| complement(sF7,sK0(sF7))
| one != addition(sK0(sF7),sF7) ),
inference(trivial_inequality_removal,[],[f2937]) ).
fof(f2957,plain,
( complement(sF7,sK0(sF7))
| one != addition(sK0(sF7),sF7) ),
inference(forward_subsumption_resolution,[],[f2947,f245]) ).
fof(f2965,plain,
( one != addition(sF7,sK0(sF7))
| complement(sF7,sK0(sF7)) ),
inference(forward_demodulation,[],[f2957,f30]) ).
fof(f2970,plain,
complement(sF7,sK0(sF7)),
inference(forward_subsumption_resolution,[],[f2965,f246]) ).
fof(f3096,plain,
( c(sF7) = sK0(sF7)
| ~ test(sF7) ),
inference(resolution,[],[f2970,f48]) ).
fof(f3104,plain,
c(sF7) = sK0(sF7),
inference(forward_subsumption_resolution,[],[f3096,f81]) ).
fof(f3550,plain,
sK2 = sK0(sF7),
inference(superposition,[],[f478,f3104]) ).
fof(f5596,plain,
sF6 = multiplication(sK0(sF7),sF9),
inference(superposition,[],[f561,f3550]) ).
fof(f9609,plain,
zero = multiplication(sK2,sF8),
inference(superposition,[],[f453,f65]) ).
fof(f9650,plain,
zero = multiplication(sK0(sF7),sF8),
inference(forward_demodulation,[],[f9609,f3550]) ).
fof(f10662,plain,
addition(zero,zero) = addition(multiplication(sK0(sF7),sF9),addition(zero,zero)),
inference(superposition,[],[f342,f9650]) ).
fof(f10665,plain,
addition(zero,zero) = addition(addition(zero,zero),multiplication(sK0(sF7),sF9)),
inference(forward_demodulation,[],[f10662,f30]) ).
fof(f10681,plain,
addition(zero,zero) = addition(zero,addition(zero,multiplication(sK0(sF7),sF9))),
inference(forward_demodulation,[],[f10665,f31]) ).
fof(f10696,plain,
addition(zero,zero) = addition(zero,multiplication(sK0(sF7),sF9)),
inference(forward_demodulation,[],[f10681,f129]) ).
fof(f10719,plain,
addition(zero,zero) = multiplication(sK0(sF7),sF9),
inference(forward_demodulation,[],[f10696,f85]) ).
fof(f10728,plain,
sF6 = addition(zero,zero),
inference(forward_demodulation,[],[f10719,f5596]) ).
fof(f10731,plain,
zero = sF6,
inference(forward_demodulation,[],[f10728,f33]) ).
fof(f10732,plain,
$false,
inference(forward_subsumption_resolution,[],[f10731,f61]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : KLE024+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.36 % Computer : n018.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Sun Sep 27 13:05:53 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.40 Running first-order model finding
% 0.11/0.40 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
% 2.86/0.94 % (2336077)Will run a generic schedule for satisfiability detection.
% 2.86/0.94 % (2336086)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2731516939:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 2.86/0.94 % (2336083)% WARNING: option uhcvi not known.
% 2.86/0.94 % (2336082)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1284307775_2999 on theBenchmark for (2999ds/0Mi)
% 2.86/0.94 % (2336084)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1295989535:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 2.86/0.94 % (2336085)dis+10_1_sil=32000:sp=arity:random_seed=889762283:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 2.86/0.94 % (2336088)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1236658625:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 2.86/0.94 % (2336087)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=22911595:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 2.86/0.94 % (2336083)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3066878282:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 2.86/0.94 % TRYING [1]
% 2.86/0.94 % TRYING [2]
% 2.86/0.94 % TRYING [3]
% 2.86/0.94 % TRYING [4]
% 2.86/0.94 % TRYING [5]
% 2.86/0.94 % (2336086)Instruction limit reached!
% 2.86/0.94 % (2336086)------------------------------
% 2.86/0.94 % (2336086)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.86/0.94 % (2336086)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.86/0.94 % (2336086)CaDiCaL version: 2.1.3
% 2.86/0.94 % (2336086)Termination reason: Instruction limit
% 2.86/0.94 % (2336086)Termination phase: Saturation
% 2.86/0.94 % (2336086)Time elapsed: 0.038 s
% 2.86/0.94 % (2336086)Peak memory usage: 13 MB
% 2.86/0.94 % (2336086)Instructions burned: 119 (million)
% 2.86/0.94 % (2336096)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=3539754504:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 2.86/0.94 % TRYING [1]
% 2.86/0.94 % TRYING [2]
% 2.86/0.94 % TRYING [3]
% 2.86/0.94 % TRYING [4]
% 2.86/0.94 % TRYING [5]
% 2.86/0.94 % (2336085)Instruction limit reached!
% 2.86/0.94 % (2336085)------------------------------
% 2.86/0.94 % (2336085)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.86/0.94 % (2336085)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.86/0.94 % (2336085)CaDiCaL version: 2.1.3
% 2.86/0.94 % (2336085)Termination reason: Instruction limit
% 2.86/0.94 % (2336085)Termination phase: Saturation
% 2.86/0.94 % (2336085)Time elapsed: 0.059 s
% 2.86/0.94 % (2336085)Peak memory usage: 12 MB
% 2.86/0.94 % (2336085)Instructions burned: 103 (million)
% 2.86/0.94 % TRYING [6]
% 2.86/0.94 % (2336087)Instruction limit reached!
% 2.86/0.94 % (2336087)------------------------------
% 2.86/0.94 % (2336087)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.86/0.94 % (2336087)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.86/0.94 % (2336087)CaDiCaL version: 2.1.3
% 2.86/0.94 % (2336087)Termination reason: Instruction limit
% 2.86/0.94 % (2336087)Termination phase: Saturation
% 2.86/0.94 % (2336087)Time elapsed: 0.073 s
% 2.86/0.94 % (2336087)Peak memory usage: 12 MB
% 2.86/0.94 % (2336087)Instructions burned: 132 (million)
% 2.86/0.94 % (2336098)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=2113564895:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 2.86/0.94 % TRYING [6]
% 2.86/0.94 % (2336099)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=3743250165:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 2.86/0.94 % (2336088)Instruction limit reached!
% 2.86/0.94 % (2336088)------------------------------
% 2.86/0.94 % (2336088)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.86/0.94 % (2336088)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.86/0.94 % (2336088)CaDiCaL version: 2.1.3
% 2.86/0.94 % (2336088)Termination reason: Instruction limit
% 2.86/0.94 % (2336088)Termination phase: Saturation
% 2.86/0.94 % (2336088)Time elapsed: 0.103 s
% 2.86/0.94 % (2336088)Peak memory usage: 13 MB
% 2.86/0.94 % (2336088)Instructions burned: 159 (million)
% 2.86/0.94 % (2336102)ott-21_1_sil=16000:fs=off:random_seed=97118879:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 2.86/0.94 % (2336098)Instruction limit reached!
% 2.86/0.94 % (2336098)------------------------------
% 2.86/0.94 % (2336098)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.86/0.94 % (2336098)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.86/0.94 % (2336098)CaDiCaL version: 2.1.3
% 2.86/0.94 % (2336098)Termination reason: Instruction limit
% 2.86/0.94 % (2336098)Termination phase: Saturation
% 2.86/0.94 % (2336098)Time elapsed: 0.086 s
% 2.86/0.94 % (2336098)Peak memory usage: 13 MB
% 2.86/0.94 % (2336098)Instructions burned: 131 (million)
% 2.86/0.94 % TRYING [7]
% 2.86/0.94 % (2336104)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=2756476551:i=477:bd=all_2997 on theBenchmark for (2997ds/477Mi)
% 2.86/0.94 % (2336096)Instruction limit reached!
% 2.86/0.94 % (2336096)------------------------------
% 2.86/0.94 % (2336096)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.86/0.94 % (2336096)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.86/0.94 % (2336096)CaDiCaL version: 2.1.3
% 2.86/0.94 % (2336096)Termination reason: Instruction limit
% 2.86/0.94 % (2336096)Termination phase: Finite model building constraint generation
% 2.86/0.94 % (2336096)Time elapsed: 0.152 s
% 2.86/0.94 % (2336096)Peak memory usage: 30 MB
% 2.86/0.94 % (2336096)Instructions burned: 715 (million)
% 2.86/0.94 % (2336102)Instruction limit reached!
% 2.86/0.94 % (2336102)------------------------------
% 2.86/0.94 % (2336102)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.86/0.94 % (2336102)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.86/0.94 % (2336102)CaDiCaL version: 2.1.3
% 2.86/0.94 % (2336102)Termination reason: Instruction limit
% 2.86/0.94 % (2336102)Termination phase: Saturation
% 2.86/0.94 % (2336102)Time elapsed: 0.078 s
% 2.86/0.94 % (2336102)Peak memory usage: 12 MB
% 2.86/0.94 % (2336102)Instructions burned: 180 (million)
% 2.86/0.94 % TRYING [7]
% 2.86/0.94 % (2336106)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=3658641077:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 2.86/0.94 % TRYING [1]
% 2.86/0.94 % TRYING [2]
% 2.86/0.94 % TRYING [3]
% 2.86/0.94 % TRYING [4]
% 2.86/0.94 % (2336107)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=2734696084:i=1179_2997 on theBenchmark for (2997ds/1179Mi)
% 2.86/0.94 % TRYING [5]
% 2.86/0.94 % TRYING [6]
% 2.86/0.94 % (2336106)Instruction limit reached!
% 2.86/0.94 % (2336106)------------------------------
% 2.86/0.94 % (2336106)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.86/0.94 % (2336106)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.86/0.94 % (2336106)CaDiCaL version: 2.1.3
% 2.86/0.94 % (2336106)Termination reason: Instruction limit
% 2.86/0.94 % (2336106)Termination phase: Finite model building SAT solving
% 2.86/0.94 % (2336106)Time elapsed: 0.181 s
% 2.86/0.94 % (2336106)Peak memory usage: 24 MB
% 2.86/0.94 % (2336106)Instructions burned: 868 (million)
% 2.86/0.94 % (2336110)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=3215415305:i=889:ins=1_2995 on theBenchmark for (2995ds/889Mi)
% 2.86/0.94 % (2336099)Instruction limit reached!
% 2.86/0.94 % (2336099)------------------------------
% 2.86/0.94 % (2336099)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.86/0.94 % (2336099)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.86/0.94 % (2336099)CaDiCaL version: 2.1.3
% 2.86/0.94 % (2336099)Termination reason: Instruction limit
% 2.86/0.94 % (2336099)Termination phase: Saturation
% 2.86/0.94 % (2336099)Time elapsed: 0.363 s
% 2.86/0.95 % (2336099)Peak memory usage: 18 MB
% 2.86/0.95 % (2336099)Instructions burned: 686 (million)
% 2.86/0.95 % (2336104)Instruction limit reached!
% 2.86/0.95 % (2336104)------------------------------
% 2.86/0.95 % (2336104)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.86/0.95 % (2336104)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.86/0.95 % (2336104)CaDiCaL version: 2.1.3
% 2.86/0.95 % (2336104)Termination reason: Instruction limit
% 2.86/0.95 % (2336104)Termination phase: Saturation
% 2.86/0.95 % (2336104)Time elapsed: 0.272 s
% 2.86/0.95 % (2336104)Peak memory usage: 15 MB
% 2.86/0.95 % (2336104)Instructions burned: 477 (million)
% 2.86/0.95 % TRYING [14]
% 2.86/0.95 % (2336112)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=2034193270: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)
% 2.86/0.95 % (2336113)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=1058260453:i=879:kws=inv_precedence:fsr=off_2995 on theBenchmark for (2995ds/879Mi)
% 2.86/0.95 % (2336107) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2336077-2336107"...
% 2.86/0.95 % (2336107)...printing done.
% 2.86/0.95 % (2336107)Refutation found. Thanks to Tanya!
% 2.86/0.95 % SZS status Theorem for theBenchmark
% 2.86/0.95 % SZS output start Proof for theBenchmark
% See solution above
% 2.86/0.95 % (2336107)------------------------------
% 2.86/0.95 % (2336107)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.86/0.95 % (2336107)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.86/0.95 % (2336107)CaDiCaL version: 2.1.3
% 2.86/0.95 % (2336107)Termination reason: Refutation
% 2.86/0.95 % (2336107)Time elapsed: 0.269 s
% 2.86/0.95 % (2336107)Peak memory usage: 15 MB
% 2.86/0.95 % (2336107)Instructions burned: 488 (million)
% 2.86/0.95 % (2336077)Success in time 0.539 s
% 2.86/0.95 % Vampire exiting
%------------------------------------------------------------------------------