%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : KLE040+2 : 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 : n026.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:44 AM UTC 2026
% Result : Theorem 1.76s 0.86s
% Output : Refutation 1.76s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 15
% Syntax : Number of formulae : 93 ( 56 unt; 4 def)
% Number of atoms : 135 ( 56 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 82 ( 40 ~; 35 |; 3 &)
% ( 3 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 3 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 98 ( 0 sgn 97 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE002+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/KLE002+0.ax',additive_associativity) ).
fof(f4,axiom,
! [X0] : addition(X0,X0) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE002+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/KLE002+0.ax',multiplicative_associativity) ).
fof(f6,axiom,
! [X0] : multiplication(X0,one) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE002+0.ax',multiplicative_right_identity) ).
fof(f7,axiom,
! [X0] : multiplication(one,X0) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE002+0.ax',multiplicative_left_identity) ).
fof(f9,axiom,
! [X0,X1,X2] : multiplication(addition(X0,X1),X2) = addition(multiplication(X0,X2),multiplication(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE002+0.ax',left_distributivity) ).
fof(f12,axiom,
! [X0,X1] :
( leq(X0,X1)
<=> addition(X0,X1) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE002+0.ax',order) ).
fof(f13,axiom,
! [X0] : leq(addition(one,multiplication(X0,star(X0))),star(X0)),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE002+0.ax',star_unfold_right) ).
fof(f15,axiom,
! [X0,X1,X2] :
( leq(addition(multiplication(X0,X1),X2),X1)
=> leq(multiplication(star(X0),X2),X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE002+0.ax',star_induction_left) ).
fof(f17,conjecture,
! [X0] :
( leq(multiplication(star(X0),star(X0)),star(X0))
& leq(star(X0),multiplication(star(X0),star(X0))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(f18,negated_conjecture,
~ ! [X0] :
( leq(multiplication(star(X0),star(X0)),star(X0))
& leq(star(X0),multiplication(star(X0),star(X0))) ),
inference(negated_conjecture,[status(cth)],[f17]) ).
fof(f19,plain,
! [X0,X1,X2] :
( leq(multiplication(star(X0),X2),X1)
| ~ leq(addition(multiplication(X0,X1),X2),X1) ),
inference(ennf_transformation,[],[f15]) ).
fof(f21,plain,
? [X0] :
( ~ leq(multiplication(star(X0),star(X0)),star(X0))
| ~ leq(star(X0),multiplication(star(X0),star(X0))) ),
inference(ennf_transformation,[],[f18]) ).
fof(f22,plain,
! [X0,X1] :
( ( leq(X0,X1)
| addition(X0,X1) != X1 )
& ( addition(X0,X1) = X1
| ~ leq(X0,X1) ) ),
inference(nnf_transformation,[],[f12]) ).
fof(f23,plain,
( ~ leq(multiplication(star(sK0),star(sK0)),star(sK0))
| ~ leq(star(sK0),multiplication(star(sK0),star(sK0))) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f21]) ).
fof(f24,plain,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f25,plain,
! [X2,X0,X1] : addition(X2,addition(X1,X0)) = addition(addition(X2,X1),X0),
inference(cnf_transformation,[],[f2]) ).
fof(f27,plain,
! [X0] : addition(X0,X0) = X0,
inference(cnf_transformation,[],[f4]) ).
fof(f28,plain,
! [X2,X0,X1] : multiplication(X0,multiplication(X1,X2)) = multiplication(multiplication(X0,X1),X2),
inference(cnf_transformation,[],[f5]) ).
fof(f29,plain,
! [X0] : multiplication(X0,one) = X0,
inference(cnf_transformation,[],[f6]) ).
fof(f30,plain,
! [X0] : multiplication(one,X0) = X0,
inference(cnf_transformation,[],[f7]) ).
fof(f32,plain,
! [X2,X0,X1] : multiplication(addition(X0,X1),X2) = addition(multiplication(X0,X2),multiplication(X1,X2)),
inference(cnf_transformation,[],[f9]) ).
fof(f35,plain,
! [X0,X1] :
( ~ leq(X0,X1)
| addition(X0,X1) = X1 ),
inference(cnf_transformation,[],[f22]) ).
fof(f36,plain,
! [X0,X1] :
( addition(X0,X1) != X1
| leq(X0,X1) ),
inference(cnf_transformation,[],[f22]) ).
fof(f37,plain,
! [X0] : leq(addition(one,multiplication(X0,star(X0))),star(X0)),
inference(cnf_transformation,[],[f13]) ).
fof(f39,plain,
! [X2,X0,X1] :
( ~ leq(addition(multiplication(X0,X1),X2),X1)
| leq(multiplication(star(X0),X2),X1) ),
inference(cnf_transformation,[],[f19]) ).
fof(f41,plain,
( ~ leq(multiplication(star(sK0),star(sK0)),star(sK0))
| ~ leq(star(sK0),multiplication(star(sK0),star(sK0))) ),
inference(cnf_transformation,[],[f23]) ).
fof(f42,definition,
sF1 = star(sK0),
introduced(definition,[new_symbols(definition,[sF1])],[function_definition]) ).
fof(f43,plain,
star(sK0) = sF1,
inference(reorient_equations,[],[f42]) ).
fof(f44,definition,
sF2 = multiplication(sF1,sF1),
introduced(definition,[new_symbols(definition,[sF2])],[function_definition]) ).
fof(f45,plain,
multiplication(sF1,sF1) = sF2,
inference(reorient_equations,[],[f44]) ).
fof(f46,plain,
( ~ leq(sF2,sF1)
| ~ leq(sF1,sF2) ),
inference(definition_folding,[],[f41,f45,f43,f43,f43,f43,f45,f43,f43]) ).
fof(f48,definition,
( spl3_1
<=> leq(sF1,sF2) ),
introduced(definition,[new_symbols(definition,[spl3_1])],[avatar_definition]) ).
fof(f50,plain,
( ~ leq(sF1,sF2)
| spl3_1 ),
inference(avatar_component_clause,[],[f48]) ).
fof(f52,definition,
( spl3_2
<=> leq(sF2,sF1) ),
introduced(definition,[new_symbols(definition,[spl3_2])],[avatar_definition]) ).
fof(f53,plain,
( leq(sF2,sF1)
| ~ spl3_2 ),
inference(avatar_component_clause,[],[f52]) ).
fof(f54,plain,
( ~ leq(sF2,sF1)
| spl3_2 ),
inference(avatar_component_clause,[],[f52]) ).
fof(f55,plain,
( ~ spl3_1
| ~ spl3_2 ),
inference(avatar_split_clause,[],[f46,f52,f48]) ).
fof(f65,plain,
! [X0] :
( X0 != X0
| leq(X0,X0) ),
inference(superposition,[],[f36,f27]) ).
fof(f70,plain,
! [X0] : leq(X0,X0),
inference(trivial_inequality_removal,[],[f65]) ).
fof(f71,plain,
! [X0] : star(X0) = addition(addition(one,multiplication(X0,star(X0))),star(X0)),
inference(resolution,[],[f37,f35]) ).
fof(f74,plain,
leq(addition(one,multiplication(sK0,sF1)),sF1),
inference(superposition,[],[f37,f43]) ).
fof(f76,plain,
! [X0] : star(X0) = addition(star(X0),addition(one,multiplication(X0,star(X0)))),
inference(forward_demodulation,[],[f71,f24]) ).
fof(f86,plain,
! [X0,X1] : addition(X0,X1) = addition(X0,addition(X0,X1)),
inference(superposition,[],[f25,f27]) ).
fof(f88,plain,
! [X2,X0,X1] : addition(addition(X0,X1),X2) = addition(X1,addition(X0,X2)),
inference(superposition,[],[f25,f24]) ).
fof(f96,plain,
! [X0,X1] : addition(X0,X1) = addition(X0,addition(X1,addition(X0,X1))),
inference(superposition,[],[f27,f25]) ).
fof(f99,plain,
! [X2,X0,X1] : addition(X0,addition(X1,X2)) = addition(X2,addition(X0,X1)),
inference(superposition,[],[f24,f25]) ).
fof(f108,plain,
! [X0] : multiplication(sF1,multiplication(sF1,X0)) = multiplication(sF2,X0),
inference(superposition,[],[f28,f45]) ).
fof(f200,plain,
sF1 = addition(addition(one,multiplication(sK0,sF1)),sF1),
inference(resolution,[],[f74,f35]) ).
fof(f201,plain,
sF1 = addition(sF1,addition(one,multiplication(sK0,sF1))),
inference(forward_demodulation,[],[f200,f24]) ).
fof(f213,plain,
! [X2,X0,X1] :
( ~ leq(addition(X0,multiplication(X1,X2)),X2)
| leq(multiplication(star(X1),X0),X2) ),
inference(superposition,[],[f39,f24]) ).
fof(f276,plain,
! [X0,X1] :
( addition(X0,X1) != addition(X0,X1)
| leq(X0,addition(X0,X1)) ),
inference(superposition,[],[f36,f86]) ).
fof(f281,plain,
! [X0,X1] : leq(X0,addition(X0,X1)),
inference(trivial_inequality_removal,[],[f276]) ).
fof(f399,plain,
! [X2,X3,X0,X1] : addition(addition(X0,addition(X1,X2)),X3) = addition(X2,addition(addition(X0,X1),X3)),
inference(superposition,[],[f88,f25]) ).
fof(f435,plain,
! [X2,X3,X0,X1] : addition(addition(X0,addition(X1,X2)),X3) = addition(X2,addition(X0,addition(X1,X3))),
inference(forward_demodulation,[],[f399,f25]) ).
fof(f444,plain,
! [X2,X3,X0,X1] : addition(X0,addition(addition(X1,X2),X3)) = addition(X2,addition(X0,addition(X1,X3))),
inference(forward_demodulation,[],[f435,f25]) ).
fof(f450,plain,
! [X2,X3,X0,X1] : addition(X0,addition(X1,addition(X2,X3))) = addition(X2,addition(X0,addition(X1,X3))),
inference(forward_demodulation,[],[f444,f25]) ).
fof(f601,plain,
! [X2,X0,X1] : leq(X1,addition(X0,addition(X1,X2))),
inference(superposition,[],[f281,f99]) ).
fof(f842,plain,
! [X0] : leq(one,star(X0)),
inference(superposition,[],[f601,f76]) ).
fof(f896,plain,
leq(one,sF1),
inference(superposition,[],[f842,f43]) ).
fof(f952,plain,
sF1 = addition(one,sF1),
inference(resolution,[],[f896,f35]) ).
fof(f996,plain,
! [X0] : addition(sF1,X0) = addition(one,addition(sF1,X0)),
inference(superposition,[],[f25,f952]) ).
fof(f998,plain,
! [X0] : multiplication(sF1,X0) = addition(multiplication(one,X0),multiplication(sF1,X0)),
inference(superposition,[],[f32,f952]) ).
fof(f1035,plain,
! [X0] : multiplication(sF1,X0) = addition(X0,multiplication(sF1,X0)),
inference(forward_demodulation,[],[f998,f30]) ).
fof(f3141,plain,
sF1 = addition(sF1,addition(addition(one,multiplication(sK0,sF1)),sF1)),
inference(superposition,[],[f96,f201]) ).
fof(f3171,plain,
sF1 = addition(sF1,addition(sF1,addition(one,multiplication(sK0,sF1)))),
inference(forward_demodulation,[],[f3141,f99]) ).
fof(f3197,plain,
sF1 = addition(one,addition(sF1,addition(sF1,multiplication(sK0,sF1)))),
inference(forward_demodulation,[],[f3171,f450]) ).
fof(f3214,plain,
sF1 = addition(sF1,addition(sF1,multiplication(sK0,sF1))),
inference(forward_demodulation,[],[f3197,f996]) ).
fof(f3237,plain,
sF1 = addition(sF1,multiplication(sK0,sF1)),
inference(forward_demodulation,[],[f3214,f86]) ).
fof(f3916,plain,
( ~ leq(sF1,sF1)
| leq(multiplication(star(sK0),sF1),sF1) ),
inference(superposition,[],[f213,f3237]) ).
fof(f3956,plain,
leq(multiplication(star(sK0),sF1),sF1),
inference(forward_subsumption_resolution,[],[f3916,f70]) ).
fof(f3970,plain,
leq(multiplication(sF1,sF1),sF1),
inference(forward_demodulation,[],[f3956,f43]) ).
fof(f3973,plain,
leq(sF2,sF1),
inference(forward_demodulation,[],[f3970,f45]) ).
fof(f3975,plain,
( $false
| spl3_2 ),
inference(forward_subsumption_resolution,[],[f3973,f54]) ).
fof(f3976,plain,
spl3_2,
inference(avatar_contradiction_clause,[],[f3975]) ).
fof(f3978,plain,
( sF1 = addition(sF2,sF1)
| ~ spl3_2 ),
inference(resolution,[],[f53,f35]) ).
fof(f3979,plain,
( sF1 = addition(sF1,sF2)
| ~ spl3_2 ),
inference(forward_demodulation,[],[f3978,f24]) ).
fof(f3983,plain,
( ! [X0] : multiplication(sF1,X0) = addition(multiplication(sF1,X0),multiplication(sF2,X0))
| ~ spl3_2 ),
inference(superposition,[],[f32,f3979]) ).
fof(f3984,plain,
( sF1 != sF2
| leq(sF1,sF2)
| ~ spl3_2 ),
inference(superposition,[],[f36,f3979]) ).
fof(f4019,plain,
( sF1 != sF2
| spl3_1
| ~ spl3_2 ),
inference(forward_subsumption_resolution,[],[f3984,f50]) ).
fof(f4020,plain,
( ! [X0] : multiplication(sF1,X0) = addition(multiplication(sF1,X0),multiplication(sF1,multiplication(sF1,X0)))
| ~ spl3_2 ),
inference(forward_demodulation,[],[f3983,f108]) ).
fof(f4027,plain,
( ! [X0] : multiplication(sF1,X0) = multiplication(sF1,multiplication(sF1,X0))
| ~ spl3_2 ),
inference(forward_demodulation,[],[f4020,f1035]) ).
fof(f4510,plain,
( sF1 = multiplication(sF1,sF1)
| ~ spl3_2 ),
inference(superposition,[],[f4027,f29]) ).
fof(f4605,plain,
( sF1 = sF2
| ~ spl3_2 ),
inference(superposition,[],[f4510,f45]) ).
fof(f4643,plain,
( $false
| spl3_1
| ~ spl3_2 ),
inference(forward_subsumption_resolution,[],[f4605,f4019]) ).
fof(f4644,plain,
( spl3_1
| ~ spl3_2 ),
inference(avatar_contradiction_clause,[],[f4643]) ).
cnf(s1,plain,
( ~ spl3_1
| ~ spl3_2 ),
inference(sat_conversion,[],[f55]) ).
cnf(s23,plain,
spl3_2,
inference(sat_conversion,[],[f3976]) ).
cnf(s25,plain,
( spl3_1
| ~ spl3_2 ),
inference(sat_conversion,[],[f4644]) ).
cnf(s26,plain,
spl3_1,
inference(rat,[],[s25,s23]) ).
cnf(s32,plain,
$false,
inference(rat,[],[s1,s23,s26]) ).
fof(f4645,plain,
$false,
inference(avatar_sat_refutation,[],[s32]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : KLE040+2 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.10 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.22/0.48 % Computer : n026.cluster.edu
% 0.22/0.48 % Model : x86_64 x86_64
% 0.22/0.48 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.22/0.48 % Memory : 8046.5625MB
% 0.22/0.48 % OS : Linux 6.8.0-71-generic
% 0.22/0.48 % CPULimit : 300
% 0.22/0.48 % WCLimit : 300
% 0.22/0.48 % DateTime : Sun Sep 27 13:08:11 UTC 2026
% 0.22/0.48 % CPUTime :
% 0.22/0.48 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.26/0.52 Running first-order model finding
% 0.26/0.52 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
% 1.76/0.86 % (2832583)Will run a generic schedule for satisfiability detection.
% 1.76/0.86 % (2832594)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1793189580:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 1.76/0.86 % (2832589)% WARNING: option uhcvi not known.
% 1.76/0.86 % (2832590)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=4282718674:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 1.76/0.86 % (2832589)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2587507694:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 1.76/0.86 % (2832588)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2113164742_2999 on theBenchmark for (2999ds/0Mi)
% 1.76/0.86 % (2832591)dis+10_1_sil=32000:sp=arity:random_seed=2768586991:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 1.76/0.86 % (2832592)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3613073823:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 1.76/0.86 % (2832593)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2216378187:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 1.76/0.86 % TRYING [1]
% 1.76/0.86 % TRYING [2]
% 1.76/0.86 % TRYING [3]
% 1.76/0.86 % TRYING [4]
% 1.76/0.86 % TRYING [5]
% 1.76/0.86 % (2832594)Instruction limit reached!
% 1.76/0.86 % (2832594)------------------------------
% 1.76/0.86 % (2832594)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.76/0.86 % (2832594)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.76/0.86 % (2832594)CaDiCaL version: 2.1.3
% 1.76/0.86 % (2832594)Termination reason: Instruction limit
% 1.76/0.86 % (2832594)Termination phase: Saturation
% 1.76/0.86 % (2832594)Time elapsed: 0.052 s
% 1.76/0.86 % (2832594)Peak memory usage: 13 MB
% 1.76/0.86 % (2832594)Instructions burned: 161 (million)
% 1.76/0.86 % (2832618)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=3729628572:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 1.76/0.86 % TRYING [1]
% 1.76/0.86 % TRYING [2]
% 1.76/0.86 % TRYING [3]
% 1.76/0.86 % TRYING [4]
% 1.76/0.86 % (2832591)Instruction limit reached!
% 1.76/0.86 % (2832591)------------------------------
% 1.76/0.86 % (2832591)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.76/0.86 % (2832591)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.76/0.86 % (2832591)CaDiCaL version: 2.1.3
% 1.76/0.86 % (2832591)Termination reason: Instruction limit
% 1.76/0.86 % (2832591)Termination phase: Saturation
% 1.76/0.86 % (2832591)Time elapsed: 0.063 s
% 1.76/0.86 % (2832591)Peak memory usage: 12 MB
% 1.76/0.86 % (2832591)Instructions burned: 104 (million)
% 1.76/0.86 % TRYING [5]
% 1.76/0.86 % (2832592)Instruction limit reached!
% 1.76/0.86 % (2832592)------------------------------
% 1.76/0.86 % (2832592)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.76/0.86 % (2832592)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.76/0.86 % (2832592)CaDiCaL version: 2.1.3
% 1.76/0.86 % (2832592)Termination reason: Instruction limit
% 1.76/0.86 % (2832592)Termination phase: Saturation
% 1.76/0.86 % (2832592)Time elapsed: 0.075 s
% 1.76/0.86 % (2832592)Peak memory usage: 13 MB
% 1.76/0.86 % (2832592)Instructions burned: 117 (million)
% 1.76/0.86 % (2832593)Instruction limit reached!
% 1.76/0.86 % (2832593)------------------------------
% 1.76/0.86 % (2832593)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.76/0.86 % (2832593)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.76/0.86 % (2832593)CaDiCaL version: 2.1.3
% 1.76/0.86 % (2832593)Termination reason: Instruction limit
% 1.76/0.86 % (2832593)Termination phase: Saturation
% 1.76/0.86 % (2832593)Time elapsed: 0.077 s
% 1.76/0.86 % (2832593)Peak memory usage: 13 MB
% 1.76/0.86 % (2832593)Instructions burned: 132 (million)
% 1.76/0.86 % (2832627)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=1336380462:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 1.76/0.86 % TRYING [6]
% 1.76/0.86 % (2832632)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=1464870871:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 1.76/0.86 % (2832634)ott-21_1_sil=16000:fs=off:random_seed=3411151130:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 1.76/0.86 % TRYING [6]
% 1.76/0.86 % (2832634)Instruction limit reached!
% 1.76/0.86 % (2832634)------------------------------
% 1.76/0.86 % (2832634)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.76/0.86 % (2832634)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.76/0.86 % (2832634)CaDiCaL version: 2.1.3
% 1.76/0.86 % (2832634)Termination reason: Instruction limit
% 1.76/0.86 % (2832634)Termination phase: Saturation
% 1.76/0.86 % (2832634)Time elapsed: 0.075 s
% 1.76/0.86 % (2832634)Peak memory usage: 12 MB
% 1.76/0.86 % (2832634)Instructions burned: 183 (million)
% 1.76/0.86 % (2832627)Instruction limit reached!
% 1.76/0.86 % (2832627)------------------------------
% 1.76/0.86 % (2832627)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.76/0.86 % (2832627)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.76/0.86 % (2832627)CaDiCaL version: 2.1.3
% 1.76/0.86 % (2832627)Termination reason: Instruction limit
% 1.76/0.86 % (2832627)Termination phase: Saturation
% 1.76/0.86 % (2832627)Time elapsed: 0.089 s
% 1.76/0.86 % (2832627)Peak memory usage: 13 MB
% 1.76/0.86 % (2832627)Instructions burned: 132 (million)
% 1.76/0.86 % (2832677)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=3735266181:i=477:bd=all_2997 on theBenchmark for (2997ds/477Mi)
% 1.76/0.86 % (2832678)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=3244343905:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 1.76/0.86 % TRYING [1]
% 1.76/0.86 % TRYING [2]
% 1.76/0.86 % TRYING [3]
% 1.76/0.86 % TRYING [4]
% 1.76/0.86 % TRYING [7]
% 1.76/0.86 % (2832618)Instruction limit reached!
% 1.76/0.86 % (2832618)------------------------------
% 1.76/0.86 % (2832618)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.76/0.86 % (2832618)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.76/0.86 % (2832618)CaDiCaL version: 2.1.3
% 1.76/0.86 % (2832618)Termination reason: Instruction limit
% 1.76/0.86 % (2832618)Termination phase: Finite model building constraint generation
% 1.76/0.86 % (2832618)Time elapsed: 0.172 s
% 1.76/0.86 % (2832618)Peak memory usage: 31 MB
% 1.76/0.86 % (2832618)Instructions burned: 717 (million)
% 1.76/0.86 % (2832703)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=2662348340:i=1179_2997 on theBenchmark for (2997ds/1179Mi)
% 1.76/0.86 % TRYING [5]
% 1.76/0.86 % TRYING [7]
% 1.76/0.86 % (2832703) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2832583-2832703"...
% 1.76/0.86 % (2832703)...printing done.
% 1.76/0.86 % (2832703)Refutation found. Thanks to Tanya!
% 1.76/0.86 % SZS status Theorem for theBenchmark
% 1.76/0.86 % SZS output start Proof for theBenchmark
% See solution above
% 1.76/0.86 % (2832703)------------------------------
% 1.76/0.86 % (2832703)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.76/0.86 % (2832703)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.76/0.86 % (2832703)CaDiCaL version: 2.1.3
% 1.76/0.86 % (2832703)Termination reason: Refutation
% 1.76/0.86 % (2832703)Time elapsed: 0.061 s
% 1.76/0.86 % (2832703)Peak memory usage: 14 MB
% 1.76/0.86 % (2832703)Instructions burned: 193 (million)
% 1.76/0.86 % (2832583)Success in time 0.338 s
% 1.76/0.86 % Vampire exiting
%------------------------------------------------------------------------------