%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : KLE080+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 : n013.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 2.27s 0.89s
% Output : Refutation 2.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 18
% Syntax : Number of formulae : 84 ( 80 unt; 5 def)
% Number of atoms : 92 ( 91 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 : 12 ( 12 usr; 6 con; 0-2 aty)
% Number of variables : 80 ( 79 !; 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 )
=> antidomain(antidomain(X0)) = domain(X0) ),
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 )
=> antidomain(antidomain(X0)) = domain(X0) ),
inference(negated_conjecture,[status(cth)],[f18]) ).
fof(f20,plain,
? [X0] :
( domain(X0) != antidomain(antidomain(X0))
& ! [X1] :
( addition(domain(X1),antidomain(X1)) = one
& multiplication(domain(X1),antidomain(X1)) = zero ) ),
inference(ennf_transformation,[],[f19]) ).
fof(f21,plain,
( domain(sK0) != antidomain(antidomain(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,
domain(sK0) != antidomain(antidomain(sK0)),
inference(cnf_transformation,[],[f21]) ).
fof(f41,definition,
sF1 = domain(sK0),
introduced(definition,[new_symbols(definition,[sF1])],[function_definition]) ).
fof(f42,plain,
domain(sK0) = sF1,
inference(reorient_equations,[],[f41]) ).
fof(f43,definition,
sF2 = antidomain(sK0),
introduced(definition,[new_symbols(definition,[sF2])],[function_definition]) ).
fof(f44,plain,
antidomain(sK0) = sF2,
inference(reorient_equations,[],[f43]) ).
fof(f45,definition,
sF3 = antidomain(sF2),
introduced(definition,[new_symbols(definition,[sF3])],[function_definition]) ).
fof(f46,plain,
antidomain(sF2) = sF3,
inference(reorient_equations,[],[f45]) ).
fof(f47,plain,
sF1 != sF3,
inference(definition_folding,[],[f40,f46,f44,f42]) ).
fof(f48,definition,
! [X1] : sF4(X1) = addition(domain(X1),antidomain(X1)),
introduced(definition,[new_symbols(definition,[sF4])],[function_definition]) ).
fof(f49,plain,
! [X1] : addition(domain(X1),antidomain(X1)) = sF4(X1),
inference(reorient_equations,[],[f48]) ).
fof(f50,plain,
! [X1] : one = sF4(X1),
inference(definition_folding,[],[f39,f49]) ).
fof(f51,definition,
! [X1] : sF5(X1) = multiplication(domain(X1),antidomain(X1)),
introduced(definition,[new_symbols(definition,[sF5])],[function_definition]) ).
fof(f52,plain,
! [X1] : multiplication(domain(X1),antidomain(X1)) = sF5(X1),
inference(reorient_equations,[],[f51]) ).
fof(f53,plain,
! [X1] : zero = sF5(X1),
inference(definition_folding,[],[f38,f52]) ).
fof(f54,plain,
! [X1] : one = addition(domain(X1),antidomain(X1)),
inference(forward_demodulation,[],[f49,f50]) ).
fof(f55,plain,
! [X1] : zero = multiplication(domain(X1),antidomain(X1)),
inference(forward_demodulation,[],[f52,f53]) ).
fof(f58,plain,
zero = multiplication(sF1,antidomain(sK0)),
inference(superposition,[],[f55,f42]) ).
fof(f59,plain,
one = addition(sF1,antidomain(sK0)),
inference(superposition,[],[f54,f42]) ).
fof(f60,plain,
one = addition(sF1,sF2),
inference(forward_demodulation,[],[f59,f44]) ).
fof(f61,plain,
zero = multiplication(sF1,sF2),
inference(forward_demodulation,[],[f58,f44]) ).
fof(f62,plain,
one = addition(sF2,sF1),
inference(forward_demodulation,[],[f60,f22]) ).
fof(f68,plain,
zero = multiplication(domain(sF2),sF3),
inference(superposition,[],[f55,f46]) ).
fof(f80,plain,
! [X0] : addition(zero,X0) = X0,
inference(superposition,[],[f24,f22]) ).
fof(f205,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(f209,plain,
! [X0,X1] : addition(multiplication(domain(X0),X0),X1) = addition(X0,addition(multiplication(domain(X0),X0),X1)),
inference(superposition,[],[f23,f33]) ).
fof(f239,plain,
! [X0,X1] : multiplication(X0,one) = addition(multiplication(X0,domain(X1)),multiplication(X0,one)),
inference(superposition,[],[f29,f35]) ).
fof(f243,plain,
! [X0,X1] : multiplication(X0,one) = addition(multiplication(X0,domain(X1)),multiplication(X0,antidomain(X1))),
inference(superposition,[],[f29,f54]) ).
fof(f245,plain,
! [X0] : multiplication(X0,one) = addition(multiplication(X0,sF2),multiplication(X0,sF1)),
inference(superposition,[],[f29,f62]) ).
fof(f265,plain,
! [X0] : addition(multiplication(X0,sF2),multiplication(X0,sF1)) = X0,
inference(forward_demodulation,[],[f245,f27]) ).
fof(f267,plain,
! [X0,X1] : addition(multiplication(X0,domain(X1)),multiplication(X0,antidomain(X1))) = X0,
inference(forward_demodulation,[],[f243,f27]) ).
fof(f270,plain,
! [X0,X1] : multiplication(X0,one) = addition(multiplication(X0,one),multiplication(X0,domain(X1))),
inference(forward_demodulation,[],[f239,f22]) ).
fof(f282,plain,
! [X0,X1] : addition(X0,multiplication(X0,domain(X1))) = X0,
inference(forward_demodulation,[],[f270,f27]) ).
fof(f306,plain,
! [X0,X1] : multiplication(one,X1) = addition(multiplication(domain(X0),X1),multiplication(one,X1)),
inference(superposition,[],[f30,f35]) ).
fof(f312,plain,
! [X0] : multiplication(one,X0) = addition(multiplication(sF2,X0),multiplication(sF1,X0)),
inference(superposition,[],[f30,f62]) ).
fof(f333,plain,
! [X0] : addition(multiplication(sF2,X0),multiplication(sF1,X0)) = X0,
inference(forward_demodulation,[],[f312,f28]) ).
fof(f338,plain,
! [X0,X1] : multiplication(one,X1) = addition(multiplication(one,X1),multiplication(domain(X0),X1)),
inference(forward_demodulation,[],[f306,f22]) ).
fof(f353,plain,
! [X0,X1] : addition(X1,multiplication(domain(X0),X1)) = X1,
inference(forward_demodulation,[],[f338,f28]) ).
fof(f5425,plain,
multiplication(domain(zero),multiplication(sF1,domain(sF2))) = addition(multiplication(sF1,domain(sF2)),multiplication(domain(zero),multiplication(sF1,domain(sF2)))),
inference(superposition,[],[f205,f61]) ).
fof(f5507,plain,
multiplication(sF1,domain(sF2)) = multiplication(domain(zero),multiplication(sF1,domain(sF2))),
inference(forward_demodulation,[],[f5425,f353]) ).
fof(f5560,plain,
multiplication(sF1,domain(sF2)) = multiplication(zero,multiplication(sF1,domain(sF2))),
inference(forward_demodulation,[],[f5507,f36]) ).
fof(f5600,plain,
zero = multiplication(sF1,domain(sF2)),
inference(forward_demodulation,[],[f5560,f32]) ).
fof(f5757,plain,
sF1 = addition(zero,multiplication(sF1,antidomain(sF2))),
inference(superposition,[],[f267,f5600]) ).
fof(f5769,plain,
sF1 = multiplication(sF1,antidomain(sF2)),
inference(forward_demodulation,[],[f5757,f80]) ).
fof(f5775,plain,
sF1 = multiplication(sF1,sF3),
inference(forward_demodulation,[],[f5769,f46]) ).
fof(f8803,plain,
domain(sF2) = addition(sF2,domain(sF2)),
inference(superposition,[],[f209,f265]) ).
fof(f8948,plain,
domain(sF2) = addition(multiplication(sF2,domain(sF2)),zero),
inference(superposition,[],[f333,f5600]) ).
fof(f8997,plain,
domain(sF2) = multiplication(sF2,domain(sF2)),
inference(forward_demodulation,[],[f8948,f24]) ).
fof(f9739,plain,
sF2 = addition(sF2,domain(sF2)),
inference(superposition,[],[f282,f8997]) ).
fof(f10002,plain,
sF2 = domain(sF2),
inference(superposition,[],[f8803,f9739]) ).
fof(f10201,plain,
zero = multiplication(sF2,sF3),
inference(superposition,[],[f68,f10002]) ).
fof(f10494,plain,
sF3 = addition(zero,multiplication(sF1,sF3)),
inference(superposition,[],[f333,f10201]) ).
fof(f10516,plain,
sF3 = multiplication(sF1,sF3),
inference(forward_demodulation,[],[f10494,f80]) ).
fof(f10519,plain,
sF1 = sF3,
inference(forward_demodulation,[],[f10516,f5775]) ).
fof(f10520,plain,
$false,
inference(forward_subsumption_resolution,[],[f10519,f47]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : KLE080+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.10/0.38 % Computer : n013.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Sun Sep 27 13:08:36 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.41 Running first-order model finding
% 0.10/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
% 2.27/0.89 % (214244)Will run a generic schedule for satisfiability detection.
% 2.27/0.89 % (214263)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2557830250:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 2.27/0.89 % (214258)% WARNING: option uhcvi not known.
% 2.27/0.89 % (214258)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1941096384:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 2.27/0.89 % (214257)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=503842758_2999 on theBenchmark for (2999ds/0Mi)
% 2.27/0.89 % (214259)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2974865071:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 2.27/0.89 % (214261)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2110023616:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 2.27/0.89 % (214260)dis+10_1_sil=32000:sp=arity:random_seed=2011257175:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 2.27/0.89 % (214262)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1425634337:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 2.27/0.89 % TRYING [1]
% 2.27/0.89 % TRYING [2]
% 2.27/0.89 % TRYING [3]
% 2.27/0.89 % TRYING [4]
% 2.27/0.89 % TRYING [5]
% 2.27/0.89 % (214263)Instruction limit reached!
% 2.27/0.89 % (214263)------------------------------
% 2.27/0.89 % (214263)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.27/0.89 % (214263)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.27/0.89 % (214263)CaDiCaL version: 2.1.3
% 2.27/0.89 % (214263)Termination reason: Instruction limit
% 2.27/0.89 % (214263)Termination phase: Saturation
% 2.27/0.89 % (214263)Time elapsed: 0.054 s
% 2.27/0.89 % (214263)Peak memory usage: 13 MB
% 2.27/0.89 % (214263)Instructions burned: 162 (million)
% 2.27/0.89 % (214260)Instruction limit reached!
% 2.27/0.89 % (214260)------------------------------
% 2.27/0.89 % (214260)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.27/0.89 % (214260)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.27/0.89 % (214260)CaDiCaL version: 2.1.3
% 2.27/0.89 % (214260)Termination reason: Instruction limit
% 2.27/0.89 % (214260)Termination phase: Saturation
% 2.27/0.89 % (214260)Time elapsed: 0.058 s
% 2.27/0.89 % (214260)Peak memory usage: 12 MB
% 2.27/0.89 % (214260)Instructions burned: 103 (million)
% 2.27/0.89 % (214291)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=3451833852:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 2.27/0.89 % (214261)Instruction limit reached!
% 2.27/0.89 % (214261)------------------------------
% 2.27/0.89 % (214261)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.27/0.89 % (214261)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.27/0.89 % (214261)CaDiCaL version: 2.1.3
% 2.27/0.89 % (214261)Termination reason: Instruction limit
% 2.27/0.89 % (214261)Termination phase: Saturation
% 2.27/0.89 % (214261)Time elapsed: 0.068 s
% 2.27/0.89 % (214261)Peak memory usage: 13 MB
% 2.27/0.89 % (214261)Instructions burned: 117 (million)
% 2.27/0.89 % TRYING [1]
% 2.27/0.89 % TRYING [2]
% 2.27/0.89 % TRYING [3]
% 2.27/0.89 % TRYING [6]
% 2.27/0.89 % (214262)Instruction limit reached!
% 2.27/0.89 % (214262)------------------------------
% 2.27/0.89 % (214262)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.27/0.89 % (214262)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.27/0.89 % (214262)CaDiCaL version: 2.1.3
% 2.27/0.89 % (214262)Termination reason: Instruction limit
% 2.27/0.89 % (214262)Termination phase: Saturation
% 2.27/0.89 % (214262)Time elapsed: 0.076 s
% 2.27/0.89 % (214262)Peak memory usage: 13 MB
% 2.27/0.89 % (214262)Instructions burned: 132 (million)
% 2.27/0.89 % TRYING [4]
% 2.27/0.89 % (214296)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=1430750419:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 2.27/0.89 % (214302)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=1504690696:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 2.27/0.89 % (214307)ott-21_1_sil=16000:fs=off:random_seed=2626406543:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 2.27/0.89 % TRYING [5]
% 2.27/0.89 % TRYING [6]
% 2.27/0.89 % (214296)Instruction limit reached!
% 2.27/0.89 % (214296)------------------------------
% 2.27/0.89 % (214296)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.27/0.89 % (214296)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.27/0.89 % (214296)CaDiCaL version: 2.1.3
% 2.27/0.89 % (214296)Termination reason: Instruction limit
% 2.27/0.89 % (214296)Termination phase: Saturation
% 2.27/0.89 % (214296)Time elapsed: 0.085 s
% 2.27/0.89 % (214296)Peak memory usage: 13 MB
% 2.27/0.89 % (214296)Instructions burned: 132 (million)
% 2.27/0.89 % (214307)Instruction limit reached!
% 2.27/0.89 % (214307)------------------------------
% 2.27/0.89 % (214307)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.27/0.89 % (214307)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.27/0.89 % (214307)CaDiCaL version: 2.1.3
% 2.27/0.89 % (214307)Termination reason: Instruction limit
% 2.27/0.89 % (214307)Termination phase: Saturation
% 2.27/0.89 % (214307)Time elapsed: 0.083 s
% 2.27/0.89 % (214307)Peak memory usage: 12 MB
% 2.27/0.89 % (214307)Instructions burned: 182 (million)
% 2.27/0.89 % (214342)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=3647698321:i=477:bd=all_2997 on theBenchmark for (2997ds/477Mi)
% 2.27/0.89 % TRYING [7]
% 2.27/0.89 % (214348)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=2653834832:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 2.27/0.89 % TRYING [1]
% 2.27/0.89 % TRYING [2]
% 2.27/0.89 % TRYING [3]
% 2.27/0.89 % TRYING [4]
% 2.27/0.89 % TRYING [5]
% 2.27/0.89 % (214302)Instruction limit reached!
% 2.27/0.89 % (214302)------------------------------
% 2.27/0.89 % (214302)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.27/0.89 % (214302)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.27/0.89 % (214302)CaDiCaL version: 2.1.3
% 2.27/0.89 % (214302)Termination reason: Instruction limit
% 2.27/0.89 % (214302)Termination phase: Saturation
% 2.27/0.89 % (214302)Time elapsed: 0.188 s
% 2.27/0.89 % (214302)Peak memory usage: 19 MB
% 2.27/0.89 % (214302)Instructions burned: 688 (million)
% 2.27/0.89 % (214365)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=2188341958:i=1179_2996 on theBenchmark for (2996ds/1179Mi)
% 2.27/0.89 % TRYING [7]
% 2.27/0.89 % TRYING [6]
% 2.27/0.89 % (214291)Instruction limit reached!
% 2.27/0.89 % (214291)------------------------------
% 2.27/0.89 % (214291)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.27/0.89 % (214291)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.27/0.89 % (214291)CaDiCaL version: 2.1.3
% 2.27/0.89 % (214291)Termination reason: Instruction limit
% 2.27/0.89 % (214291)Termination phase: Finite model building constraint generation
% 2.27/0.89 % (214291)Time elapsed: 0.298 s
% 2.27/0.89 % (214291)Peak memory usage: 31 MB
% 2.27/0.89 % (214291)Instructions burned: 718 (million)
% 2.27/0.89 % (214377)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=3271805319:i=889:ins=1_2995 on theBenchmark for (2995ds/889Mi)
% 2.27/0.89 % (214365) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-214244-214365"...
% 2.27/0.89 % (214365)...printing done.
% 2.27/0.89 % (214365)Refutation found. Thanks to Tanya!
% 2.27/0.89 % SZS status Theorem for theBenchmark
% 2.27/0.89 % SZS output start Proof for theBenchmark
% See solution above
% 2.27/0.89 % (214365)------------------------------
% 2.27/0.89 % (214365)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.27/0.89 % (214365)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.27/0.89 % (214365)CaDiCaL version: 2.1.3
% 2.27/0.89 % (214365)Termination reason: Refutation
% 2.27/0.89 % (214365)Time elapsed: 0.147 s
% 2.27/0.89 % (214365)Peak memory usage: 16 MB
% 2.27/0.89 % (214365)Instructions burned: 509 (million)
% 2.27/0.89 % (214244)Success in time 0.471 s
% 2.27/0.89 % Vampire exiting
%------------------------------------------------------------------------------