%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : KLE079+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 : n004.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:49 AM UTC 2026
% Result : Theorem 2.53s 1.21s
% Output : Refutation 2.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 30
% Number of leaves : 18
% Syntax : Number of formulae : 101 ( 97 unt; 5 def)
% Number of atoms : 109 ( 108 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 : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 6 con; 0-2 aty)
% Number of variables : 91 ( 90 !; 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),domain(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),domain(X0)) = zero ),
inference(negated_conjecture,[status(cth)],[f18]) ).
fof(f20,plain,
? [X0] :
( zero != multiplication(antidomain(X0),domain(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),domain(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),domain(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 = domain(sK0),
introduced(definition,[new_symbols(definition,[sF2])],[function_definition]) ).
fof(f44,plain,
domain(sK0) = sF2,
inference(reorient_equations,[],[f43]) ).
fof(f45,definition,
sF3 = multiplication(sF1,sF2),
introduced(definition,[new_symbols(definition,[sF3])],[function_definition]) ).
fof(f46,plain,
multiplication(sF1,sF2) = sF3,
inference(reorient_equations,[],[f45]) ).
fof(f47,plain,
zero != 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(domain(sK0),sF1),
inference(superposition,[],[f55,f42]) ).
fof(f59,plain,
one = addition(domain(sK0),sF1),
inference(superposition,[],[f54,f42]) ).
fof(f60,plain,
one = addition(sF1,domain(sK0)),
inference(forward_demodulation,[],[f59,f22]) ).
fof(f61,plain,
zero = multiplication(sF2,sF1),
inference(forward_demodulation,[],[f58,f44]) ).
fof(f62,plain,
one = addition(sF1,sF2),
inference(forward_demodulation,[],[f60,f44]) ).
fof(f76,plain,
! [X0] : addition(zero,X0) = X0,
inference(superposition,[],[f24,f22]) ).
fof(f81,plain,
! [X0] : domain(multiplication(one,X0)) = domain(domain(X0)),
inference(superposition,[],[f34,f28]) ).
fof(f83,plain,
! [X0,X1] : zero = multiplication(domain(multiplication(X0,X1)),antidomain(multiplication(X0,domain(X1)))),
inference(superposition,[],[f55,f34]) ).
fof(f84,plain,
! [X0,X1] : one = addition(domain(multiplication(X0,X1)),antidomain(multiplication(X0,domain(X1)))),
inference(superposition,[],[f54,f34]) ).
fof(f85,plain,
! [X0] : domain(X0) = domain(domain(X0)),
inference(forward_demodulation,[],[f81,f28]) ).
fof(f100,plain,
! [X0] : zero = multiplication(domain(multiplication(one,X0)),antidomain(domain(X0))),
inference(superposition,[],[f83,f28]) ).
fof(f101,plain,
! [X0] : zero = multiplication(domain(X0),antidomain(domain(X0))),
inference(forward_demodulation,[],[f100,f28]) ).
fof(f203,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(f207,plain,
! [X0,X1] : addition(multiplication(domain(X0),X0),X1) = addition(X0,addition(multiplication(domain(X0),X0),X1)),
inference(superposition,[],[f23,f33]) ).
fof(f223,plain,
! [X0,X1] : multiplication(X0,one) = addition(multiplication(X0,domain(X1)),multiplication(X0,one)),
inference(superposition,[],[f29,f35]) ).
fof(f226,plain,
! [X0,X1] : multiplication(X0,one) = addition(multiplication(X0,domain(X1)),multiplication(X0,antidomain(X1))),
inference(superposition,[],[f29,f54]) ).
fof(f228,plain,
! [X0] : multiplication(X0,one) = addition(multiplication(X0,sF1),multiplication(X0,sF2)),
inference(superposition,[],[f29,f62]) ).
fof(f248,plain,
! [X0] : addition(multiplication(X0,sF1),multiplication(X0,sF2)) = X0,
inference(forward_demodulation,[],[f228,f27]) ).
fof(f250,plain,
! [X0,X1] : addition(multiplication(X0,domain(X1)),multiplication(X0,antidomain(X1))) = X0,
inference(forward_demodulation,[],[f226,f27]) ).
fof(f252,plain,
! [X0,X1] : multiplication(X0,one) = addition(multiplication(X0,one),multiplication(X0,domain(X1))),
inference(forward_demodulation,[],[f223,f22]) ).
fof(f263,plain,
! [X0,X1] : addition(X0,multiplication(X0,domain(X1))) = X0,
inference(forward_demodulation,[],[f252,f27]) ).
fof(f295,plain,
! [X0,X1] : multiplication(one,X1) = addition(multiplication(domain(X0),X1),multiplication(one,X1)),
inference(superposition,[],[f30,f35]) ).
fof(f300,plain,
! [X0] : multiplication(one,X0) = addition(multiplication(sF1,X0),multiplication(sF2,X0)),
inference(superposition,[],[f30,f62]) ).
fof(f325,plain,
! [X0] : addition(multiplication(sF1,X0),multiplication(sF2,X0)) = X0,
inference(forward_demodulation,[],[f300,f28]) ).
fof(f329,plain,
! [X0,X1] : multiplication(one,X1) = addition(multiplication(one,X1),multiplication(domain(X0),X1)),
inference(forward_demodulation,[],[f295,f22]) ).
fof(f343,plain,
! [X0,X1] : addition(X1,multiplication(domain(X0),X1)) = X1,
inference(forward_demodulation,[],[f329,f28]) ).
fof(f547,plain,
! [X0] : one = addition(domain(zero),antidomain(multiplication(domain(X0),domain(antidomain(X0))))),
inference(superposition,[],[f84,f55]) ).
fof(f588,plain,
! [X0] : one = addition(zero,antidomain(multiplication(domain(X0),domain(antidomain(X0))))),
inference(forward_demodulation,[],[f547,f36]) ).
fof(f612,plain,
! [X0] : one = antidomain(multiplication(domain(X0),domain(antidomain(X0)))),
inference(forward_demodulation,[],[f588,f76]) ).
fof(f965,plain,
sF2 = domain(sF2),
inference(superposition,[],[f85,f44]) ).
fof(f6525,plain,
multiplication(domain(zero),multiplication(sF2,domain(sF1))) = addition(multiplication(sF2,domain(sF1)),multiplication(domain(zero),multiplication(sF2,domain(sF1)))),
inference(superposition,[],[f203,f61]) ).
fof(f6624,plain,
multiplication(sF2,domain(sF1)) = multiplication(domain(zero),multiplication(sF2,domain(sF1))),
inference(forward_demodulation,[],[f6525,f343]) ).
fof(f6684,plain,
multiplication(sF2,domain(sF1)) = multiplication(zero,multiplication(sF2,domain(sF1))),
inference(forward_demodulation,[],[f6624,f36]) ).
fof(f6726,plain,
zero = multiplication(sF2,domain(sF1)),
inference(forward_demodulation,[],[f6684,f32]) ).
fof(f6901,plain,
sF2 = addition(zero,multiplication(sF2,antidomain(sF1))),
inference(superposition,[],[f250,f6726]) ).
fof(f6913,plain,
sF2 = multiplication(sF2,antidomain(sF1)),
inference(forward_demodulation,[],[f6901,f76]) ).
fof(f10059,plain,
domain(sF1) = addition(sF1,domain(sF1)),
inference(superposition,[],[f207,f248]) ).
fof(f10179,plain,
domain(sF1) = addition(multiplication(sF1,domain(sF1)),zero),
inference(superposition,[],[f325,f6726]) ).
fof(f10236,plain,
domain(sF1) = multiplication(sF1,domain(sF1)),
inference(forward_demodulation,[],[f10179,f24]) ).
fof(f10773,plain,
sF1 = addition(sF1,domain(sF1)),
inference(superposition,[],[f263,f10236]) ).
fof(f11091,plain,
sF1 = domain(sF1),
inference(superposition,[],[f10059,f10773]) ).
fof(f11318,plain,
zero = multiplication(sF1,antidomain(sF1)),
inference(superposition,[],[f101,f11091]) ).
fof(f11394,plain,
antidomain(sF1) = addition(zero,multiplication(sF2,antidomain(sF1))),
inference(superposition,[],[f325,f11318]) ).
fof(f11418,plain,
antidomain(sF1) = multiplication(sF2,antidomain(sF1)),
inference(forward_demodulation,[],[f11394,f76]) ).
fof(f11422,plain,
sF2 = antidomain(sF1),
inference(forward_demodulation,[],[f11418,f6913]) ).
fof(f11713,plain,
one = antidomain(multiplication(domain(sF1),domain(sF2))),
inference(superposition,[],[f612,f11422]) ).
fof(f11724,plain,
one = antidomain(multiplication(domain(sF1),sF2)),
inference(forward_demodulation,[],[f11713,f965]) ).
fof(f11732,plain,
one = antidomain(multiplication(sF1,sF2)),
inference(forward_demodulation,[],[f11724,f11091]) ).
fof(f11734,plain,
one = antidomain(sF3),
inference(forward_demodulation,[],[f11732,f46]) ).
fof(f11808,plain,
zero = multiplication(domain(sF3),one),
inference(superposition,[],[f55,f11734]) ).
fof(f11830,plain,
zero = domain(sF3),
inference(forward_demodulation,[],[f11808,f27]) ).
fof(f12026,plain,
multiplication(zero,sF3) = addition(sF3,multiplication(zero,sF3)),
inference(superposition,[],[f33,f11830]) ).
fof(f12083,plain,
zero = addition(sF3,zero),
inference(forward_demodulation,[],[f12026,f32]) ).
fof(f12099,plain,
zero = sF3,
inference(forward_demodulation,[],[f12083,f24]) ).
fof(f12107,plain,
$false,
inference(forward_subsumption_resolution,[],[f12099,f47]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KLE079+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 : n004.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:09:07 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.42 Running first-order model finding
% 0.10/0.42 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.53/1.21 % (3506855)Will run a generic schedule for satisfiability detection.
% 2.53/1.21 % (3506874)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3705469513_2999 on theBenchmark for (2999ds/0Mi)
% 2.53/1.21 % TRYING [1]
% 2.53/1.21 % TRYING [2]
% 2.53/1.21 % TRYING [3]
% 2.53/1.21 % (3506875)% WARNING: option uhcvi not known.
% 2.53/1.21 % TRYING [4]
% 2.53/1.21 % (3506877)dis+10_1_sil=32000:sp=arity:random_seed=394948345:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 2.53/1.21 % (3506876)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2511217893:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 2.53/1.21 % (3506875)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1507823391:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 2.53/1.21 % (3506878)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1899711543:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 2.53/1.21 % (3506879)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1179439582:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 2.53/1.21 % (3506880)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3654169917:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 2.53/1.21 % TRYING [5]
% 2.53/1.21 % TRYING [6]
% 2.53/1.21 % (3506877)Instruction limit reached!
% 2.53/1.21 % (3506877)------------------------------
% 2.53/1.21 % (3506877)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.53/1.21 % (3506877)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.53/1.21 % (3506877)CaDiCaL version: 2.1.3
% 2.53/1.21 % (3506877)Termination reason: Instruction limit
% 2.53/1.21 % (3506877)Termination phase: Saturation
% 2.53/1.21 % (3506877)Time elapsed: 0.063 s
% 2.53/1.21 % (3506877)Peak memory usage: 12 MB
% 2.53/1.21 % (3506877)Instructions burned: 112 (million)
% 2.53/1.21 % (3506878)Instruction limit reached!
% 2.53/1.21 % (3506878)------------------------------
% 2.53/1.21 % (3506878)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.53/1.21 % (3506878)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.53/1.21 % (3506878)CaDiCaL version: 2.1.3
% 2.53/1.21 % (3506878)Termination reason: Instruction limit
% 2.53/1.21 % (3506878)Termination phase: Saturation
% 2.53/1.21 % (3506878)Time elapsed: 0.069 s
% 2.53/1.21 % (3506878)Peak memory usage: 13 MB
% 2.53/1.21 % (3506878)Instructions burned: 118 (million)
% 2.53/1.21 % (3506914)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=945567620:i=714:nm=2_2998 on theBenchmark for (2998ds/714Mi)
% 2.53/1.21 % (3506879)Instruction limit reached!
% 2.53/1.21 % (3506879)------------------------------
% 2.53/1.21 % (3506879)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.53/1.21 % (3506879)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.53/1.21 % (3506879)CaDiCaL version: 2.1.3
% 2.53/1.21 % (3506879)Termination reason: Instruction limit
% 2.53/1.21 % (3506879)Termination phase: Saturation
% 2.53/1.21 % (3506879)Time elapsed: 0.091 s
% 2.53/1.21 % (3506879)Peak memory usage: 13 MB
% 2.53/1.21 % (3506879)Instructions burned: 133 (million)
% 2.53/1.21 % TRYING [1]
% 2.53/1.21 % TRYING [2]
% 2.53/1.21 % TRYING [3]
% 2.53/1.21 % (3506917)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=2437087906:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 2.53/1.21 % TRYING [7]
% 2.53/1.21 % TRYING [4]
% 2.53/1.21 % (3506880)Instruction limit reached!
% 2.53/1.21 % (3506880)------------------------------
% 2.53/1.21 % (3506880)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.53/1.21 % (3506880)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.53/1.21 % (3506880)CaDiCaL version: 2.1.3
% 2.53/1.21 % (3506880)Termination reason: Instruction limit
% 2.53/1.21 % (3506880)Termination phase: Saturation
% 2.53/1.21 % (3506880)Time elapsed: 0.101 s
% 2.53/1.21 % (3506880)Peak memory usage: 13 MB
% 2.53/1.21 % (3506880)Instructions burned: 160 (million)
% 2.53/1.21 % (3506923)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=1005299995:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 2.53/1.21 % TRYING [5]
% 2.53/1.21 % (3506928)ott-21_1_sil=16000:fs=off:random_seed=2845189638:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 2.53/1.21 % (3506917)Instruction limit reached!
% 2.53/1.21 % (3506917)------------------------------
% 2.53/1.21 % (3506917)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.53/1.21 % (3506917)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.53/1.21 % (3506917)CaDiCaL version: 2.1.3
% 2.53/1.21 % (3506917)Termination reason: Instruction limit
% 2.53/1.21 % (3506917)Termination phase: Saturation
% 2.53/1.21 % (3506917)Time elapsed: 0.085 s
% 2.53/1.21 % (3506917)Peak memory usage: 13 MB
% 2.53/1.21 % (3506917)Instructions burned: 131 (million)
% 2.53/1.21 % TRYING [6]
% 2.53/1.21 % (3506941)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=2144222352:i=477:bd=all_2997 on theBenchmark for (2997ds/477Mi)
% 2.53/1.21 % (3506928)Instruction limit reached!
% 2.53/1.21 % (3506928)------------------------------
% 2.53/1.21 % (3506928)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.53/1.21 % (3506928)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.53/1.21 % (3506928)CaDiCaL version: 2.1.3
% 2.53/1.21 % (3506928)Termination reason: Instruction limit
% 2.53/1.21 % (3506928)Termination phase: Saturation
% 2.53/1.21 % (3506928)Time elapsed: 0.085 s
% 2.53/1.21 % (3506928)Peak memory usage: 12 MB
% 2.53/1.21 % (3506928)Instructions burned: 180 (million)
% 2.53/1.21 % TRYING [8]
% 2.53/1.21 % (3506947)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=1033999193:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 2.53/1.21 % TRYING [1]
% 2.53/1.21 % TRYING [2]
% 2.53/1.21 % TRYING [3]
% 2.53/1.21 % TRYING [4]
% 2.53/1.21 % TRYING [5]
% 2.53/1.21 % TRYING [6]
% 2.53/1.21 % TRYING [7]
% 2.53/1.21 % (3506914)Instruction limit reached!
% 2.53/1.21 % (3506914)------------------------------
% 2.53/1.21 % (3506914)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.53/1.21 % (3506914)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.53/1.21 % (3506914)CaDiCaL version: 2.1.3
% 2.53/1.21 % (3506914)Termination reason: Instruction limit
% 2.53/1.21 % (3506914)Termination phase: Finite model building constraint generation
% 2.53/1.21 % (3506914)Time elapsed: 0.312 s
% 2.53/1.21 % (3506914)Peak memory usage: 31 MB
% 2.53/1.21 % (3506914)Instructions burned: 718 (million)
% 2.53/1.21 % (3506959)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=3765571889:i=1179_2995 on theBenchmark for (2995ds/1179Mi)
% 2.53/1.21 % (3506941)Instruction limit reached!
% 2.53/1.21 % (3506941)------------------------------
% 2.53/1.21 % (3506941)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.53/1.21 % (3506941)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.53/1.21 % (3506941)CaDiCaL version: 2.1.3
% 2.53/1.21 % (3506941)Termination reason: Instruction limit
% 2.53/1.21 % (3506941)Termination phase: Saturation
% 2.53/1.21 % (3506941)Time elapsed: 0.258 s
% 2.53/1.21 % (3506941)Peak memory usage: 16 MB
% 2.53/1.21 % (3506941)Instructions burned: 478 (million)
% 2.53/1.21 % (3506923)Instruction limit reached!
% 2.53/1.21 % (3506923)------------------------------
% 2.53/1.21 % (3506923)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.53/1.21 % (3506923)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.53/1.21 % (3506923)CaDiCaL version: 2.1.3
% 2.53/1.21 % (3506923)Termination reason: Instruction limit
% 2.53/1.21 % (3506923)Termination phase: Saturation
% 2.53/1.21 % (3506923)Time elapsed: 0.369 s
% 2.53/1.21 % (3506923)Peak memory usage: 19 MB
% 2.53/1.21 % (3506923)Instructions burned: 686 (million)
% 2.53/1.21 % (3506961)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=1133209143:i=889:ins=1_2994 on theBenchmark for (2994ds/889Mi)
% 2.53/1.21 % TRYING [9]
% 2.53/1.21 % (3506966)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=1867729187:avsq=on:s2a=on:i=692:avsqr=8,1:kws=arity_squared:bs=unit_only:nm=2:rawr=on_2994 on theBenchmark for (2994ds/692Mi)
% 2.53/1.21 % (3506947)Instruction limit reached!
% 2.53/1.21 % (3506947)------------------------------
% 2.53/1.21 % (3506947)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.53/1.21 % (3506947)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.53/1.21 % (3506947)CaDiCaL version: 2.1.3
% 2.53/1.21 % (3506947)Termination reason: Instruction limit
% 2.53/1.21 % (3506947)Termination phase: Finite model building SAT solving
% 2.53/1.21 % (3506947)Time elapsed: 0.337 s
% 2.53/1.21 % (3506947)Peak memory usage: 25 MB
% 2.53/1.21 % (3506947)Instructions burned: 867 (million)
% 2.53/1.21 % (3506978)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=3408389174:i=879:kws=inv_precedence:fsr=off_2993 on theBenchmark for (2993ds/879Mi)
% 2.53/1.21 % TRYING [14]
% 2.53/1.21 % (3506959) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3506855-3506959"...
% 2.53/1.21 % (3506959)...printing done.
% 2.53/1.21 % (3506959)Refutation found. Thanks to Tanya!
% 2.53/1.21 % SZS status Theorem for theBenchmark
% 2.53/1.21 % SZS output start Proof for theBenchmark
% See solution above
% 2.53/1.21 % (3506959)------------------------------
% 2.53/1.21 % (3506959)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.53/1.21 % (3506959)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.53/1.21 % (3506959)CaDiCaL version: 2.1.3
% 2.53/1.21 % (3506959)Termination reason: Refutation
% 2.53/1.21 % (3506959)Time elapsed: 0.303 s
% 2.53/1.21 % (3506959)Peak memory usage: 16 MB
% 2.53/1.21 % (3506959)Instructions burned: 554 (million)
% 2.53/1.21 % (3506855)Success in time 0.785 s
% 2.53/1.21 % Vampire exiting
%------------------------------------------------------------------------------