%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : KLE142+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 : n017.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:58 AM UTC 2026
% Result : Theorem 0.32s 0.97s
% Output : Refutation 0.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 18
% Syntax : Number of formulae : 89 ( 43 unt; 2 def)
% Number of atoms : 135 ( 49 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 105 ( 59 ~; 39 |; 2 &)
% ( 3 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 3 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 112 ( 0 sgn 111 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE004+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/KLE004+0.ax',additive_associativity) ).
fof(f3,axiom,
! [X0] : addition(X0,zero) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE004+0.ax',additive_identity) ).
fof(f4,axiom,
! [X0] : addition(X0,X0) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE004+0.ax',idempotence) ).
fof(f5,axiom,
! [X0,X1,X2] : multiplication(X0,multiplication(X1,X2)) = multiplication(multiplication(X0,X1),X2),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE004+0.ax',multiplicative_associativity) ).
fof(f6,axiom,
! [X0] : multiplication(X0,one) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE004+0.ax',multiplicative_right_identity) ).
fof(f7,axiom,
! [X0] : multiplication(one,X0) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE004+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/sandbox2/benchmark/Axioms/KLE004+0.ax',distributivity1) ).
fof(f9,axiom,
! [X0,X1,X2] : multiplication(addition(X0,X1),X2) = addition(multiplication(X0,X2),multiplication(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE004+0.ax',distributivity2) ).
fof(f10,axiom,
! [X0] : multiplication(zero,X0) = zero,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE004+0.ax',left_annihilation) ).
fof(f11,axiom,
! [X0] : addition(one,multiplication(X0,star(X0))) = star(X0),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE004+0.ax',star_unfold1) ).
fof(f14,axiom,
! [X0,X1,X2] :
( leq(addition(multiplication(X2,X0),X1),X2)
=> leq(multiplication(X1,star(X0)),X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE004+0.ax',star_induction2) ).
fof(f15,axiom,
! [X0] : strong_iteration(X0) = addition(multiplication(X0,strong_iteration(X0)),one),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE004+0.ax',infty_unfold1) ).
fof(f16,axiom,
! [X0,X1,X2] :
( leq(X2,addition(multiplication(X0,X2),X1))
=> leq(X2,multiplication(strong_iteration(X0),X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE004+0.ax',infty_coinduction) ).
fof(f18,axiom,
! [X0,X1] :
( leq(X0,X1)
<=> addition(X0,X1) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE004+0.ax',order) ).
fof(f19,conjecture,
! [X0] :
( leq(strong_iteration(strong_iteration(X0)),strong_iteration(one))
& leq(strong_iteration(one),strong_iteration(strong_iteration(X0))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(f20,negated_conjecture,
~ ! [X0] :
( leq(strong_iteration(strong_iteration(X0)),strong_iteration(one))
& leq(strong_iteration(one),strong_iteration(strong_iteration(X0))) ),
inference(negated_conjecture,[status(cth)],[f19]) ).
fof(f22,plain,
! [X0,X1,X2] :
( leq(multiplication(X1,star(X0)),X2)
| ~ leq(addition(multiplication(X2,X0),X1),X2) ),
inference(ennf_transformation,[],[f14]) ).
fof(f23,plain,
! [X0,X1,X2] :
( leq(X2,multiplication(strong_iteration(X0),X1))
| ~ leq(X2,addition(multiplication(X0,X2),X1)) ),
inference(ennf_transformation,[],[f16]) ).
fof(f24,plain,
? [X0] :
( ~ leq(strong_iteration(strong_iteration(X0)),strong_iteration(one))
| ~ leq(strong_iteration(one),strong_iteration(strong_iteration(X0))) ),
inference(ennf_transformation,[],[f20]) ).
fof(f25,plain,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f26,plain,
! [X2,X0,X1] : addition(X2,addition(X1,X0)) = addition(addition(X2,X1),X0),
inference(cnf_transformation,[],[f2]) ).
fof(f27,plain,
! [X0] : addition(X0,zero) = X0,
inference(cnf_transformation,[],[f3]) ).
fof(f28,plain,
! [X0] : addition(X0,X0) = X0,
inference(cnf_transformation,[],[f4]) ).
fof(f29,plain,
! [X2,X0,X1] : multiplication(X0,multiplication(X1,X2)) = multiplication(multiplication(X0,X1),X2),
inference(cnf_transformation,[],[f5]) ).
fof(f30,plain,
! [X0] : multiplication(X0,one) = X0,
inference(cnf_transformation,[],[f6]) ).
fof(f31,plain,
! [X0] : multiplication(one,X0) = X0,
inference(cnf_transformation,[],[f7]) ).
fof(f32,plain,
! [X2,X0,X1] : multiplication(X0,addition(X1,X2)) = addition(multiplication(X0,X1),multiplication(X0,X2)),
inference(cnf_transformation,[],[f8]) ).
fof(f33,plain,
! [X2,X0,X1] : multiplication(addition(X0,X1),X2) = addition(multiplication(X0,X2),multiplication(X1,X2)),
inference(cnf_transformation,[],[f9]) ).
fof(f34,plain,
! [X0] : zero = multiplication(zero,X0),
inference(cnf_transformation,[],[f10]) ).
fof(f35,plain,
! [X0] : star(X0) = addition(one,multiplication(X0,star(X0))),
inference(cnf_transformation,[],[f11]) ).
fof(f38,plain,
! [X2,X0,X1] :
( ~ leq(addition(multiplication(X2,X0),X1),X2)
| leq(multiplication(X1,star(X0)),X2) ),
inference(cnf_transformation,[],[f22]) ).
fof(f39,plain,
! [X0] : strong_iteration(X0) = addition(multiplication(X0,strong_iteration(X0)),one),
inference(cnf_transformation,[],[f15]) ).
fof(f40,plain,
! [X2,X0,X1] :
( ~ leq(X2,addition(multiplication(X0,X2),X1))
| leq(X2,multiplication(strong_iteration(X0),X1)) ),
inference(cnf_transformation,[],[f23]) ).
fof(f42,plain,
! [X0,X1] :
( addition(X0,X1) != X1
| leq(X0,X1) ),
inference(cnf_transformation,[],[f18]) ).
fof(f44,plain,
( ~ leq(strong_iteration(one),strong_iteration(strong_iteration(sK0)))
| ~ leq(strong_iteration(strong_iteration(sK0)),strong_iteration(one)) ),
inference(cnf_transformation,[],[f24]) ).
fof(f46,plain,
! [X2,X0,X1] :
( leq(addition(multiplication(X2,X0),X1),X2)
| ~ leq(multiplication(X1,star(X0)),X2) ),
inference(consistent_polarity_flipping,[],[f38]) ).
fof(f47,plain,
! [X2,X0,X1] :
( leq(X2,addition(multiplication(X0,X2),X1))
| ~ leq(X2,multiplication(strong_iteration(X0),X1)) ),
inference(consistent_polarity_flipping,[],[f40]) ).
fof(f49,plain,
! [X0,X1] :
( addition(X0,X1) != X1
| ~ leq(X0,X1) ),
inference(consistent_polarity_flipping,[],[f42]) ).
fof(f50,plain,
( leq(strong_iteration(one),strong_iteration(strong_iteration(sK0)))
| leq(strong_iteration(strong_iteration(sK0)),strong_iteration(one)) ),
inference(consistent_polarity_flipping,[],[f44]) ).
fof(f52,definition,
( spl1_1
<=> leq(strong_iteration(strong_iteration(sK0)),strong_iteration(one)) ),
introduced(definition,[new_symbols(definition,[spl1_1])],[avatar_definition]) ).
fof(f54,plain,
( leq(strong_iteration(strong_iteration(sK0)),strong_iteration(one))
| ~ spl1_1 ),
inference(avatar_component_clause,[],[f52]) ).
fof(f56,definition,
( spl1_2
<=> leq(strong_iteration(one),strong_iteration(strong_iteration(sK0))) ),
introduced(definition,[new_symbols(definition,[spl1_2])],[avatar_definition]) ).
fof(f58,plain,
( leq(strong_iteration(one),strong_iteration(strong_iteration(sK0)))
| ~ spl1_2 ),
inference(avatar_component_clause,[],[f56]) ).
fof(f59,plain,
( spl1_1
| spl1_2 ),
inference(avatar_split_clause,[],[f50,f56,f52]) ).
fof(f60,plain,
! [X0] : addition(zero,X0) = X0,
inference(superposition,[],[f25,f27]) ).
fof(f77,plain,
star(zero) = addition(one,zero),
inference(superposition,[],[f35,f34]) ).
fof(f79,plain,
one = star(zero),
inference(forward_demodulation,[],[f77,f27]) ).
fof(f84,plain,
! [X0] : strong_iteration(X0) = addition(one,multiplication(X0,strong_iteration(X0))),
inference(superposition,[],[f39,f25]) ).
fof(f103,plain,
! [X0,X1] : addition(X0,X1) = addition(X0,addition(X0,X1)),
inference(superposition,[],[f26,f28]) ).
fof(f114,plain,
! [X2,X0,X1] : addition(X0,addition(X1,X2)) = addition(X1,addition(X2,X0)),
inference(superposition,[],[f26,f25]) ).
fof(f118,plain,
! [X2,X0,X1] :
( ~ leq(addition(X0,X1),X2)
| addition(X0,addition(X1,X2)) != X2 ),
inference(superposition,[],[f49,f26]) ).
fof(f134,plain,
! [X0,X1] : multiplication(X0,addition(one,X1)) = addition(X0,multiplication(X0,X1)),
inference(superposition,[],[f32,f30]) ).
fof(f163,plain,
! [X0,X1] : multiplication(addition(one,X1),X0) = addition(X0,multiplication(X1,X0)),
inference(superposition,[],[f33,f31]) ).
fof(f209,plain,
! [X2,X0,X1] :
( ~ leq(multiplication(X0,star(X2)),X1)
| leq(addition(X0,multiplication(X1,X2)),X1) ),
inference(superposition,[],[f46,f25]) ).
fof(f221,plain,
! [X0,X1] :
( leq(X0,addition(X0,X1))
| ~ leq(X0,multiplication(strong_iteration(one),X1)) ),
inference(superposition,[],[f47,f31]) ).
fof(f227,plain,
! [X2,X0,X1] :
( ~ leq(X2,multiplication(strong_iteration(X1),X0))
| leq(X2,addition(X0,multiplication(X1,X2))) ),
inference(superposition,[],[f47,f25]) ).
fof(f285,plain,
! [X0] : strong_iteration(X0) = addition(one,strong_iteration(X0)),
inference(superposition,[],[f103,f84]) ).
fof(f292,plain,
! [X0,X1] :
( addition(X0,X1) != addition(X0,X1)
| ~ leq(X0,addition(X0,X1)) ),
inference(superposition,[],[f49,f103]) ).
fof(f297,plain,
! [X0,X1] : ~ leq(X0,addition(X0,X1)),
inference(trivial_inequality_removal,[],[f292]) ).
fof(f688,plain,
! [X0] : multiplication(X0,zero) = multiplication(addition(one,X0),zero),
inference(superposition,[],[f163,f60]) ).
fof(f822,plain,
! [X0,X1] : ~ leq(X0,multiplication(strong_iteration(one),X1)),
inference(forward_subsumption_resolution,[],[f221,f297]) ).
fof(f826,plain,
! [X0] : ~ leq(X0,strong_iteration(one)),
inference(superposition,[],[f822,f30]) ).
fof(f1289,plain,
! [X0,X1] :
( ~ leq(multiplication(X0,one),X1)
| leq(addition(X0,multiplication(X1,zero)),X1) ),
inference(superposition,[],[f209,f79]) ).
fof(f1293,plain,
! [X0,X1] :
( ~ leq(X0,X1)
| leq(addition(X0,multiplication(X1,zero)),X1) ),
inference(forward_demodulation,[],[f1289,f30]) ).
fof(f1390,plain,
! [X0,X1] :
( ~ leq(X1,strong_iteration(X0))
| leq(X1,addition(one,multiplication(X0,X1))) ),
inference(superposition,[],[f227,f30]) ).
fof(f1877,plain,
( $false
| ~ spl1_1 ),
inference(forward_subsumption_resolution,[],[f54,f826]) ).
fof(f1878,plain,
~ spl1_1,
inference(avatar_contradiction_clause,[],[f1877]) ).
fof(f8679,plain,
( leq(strong_iteration(one),addition(one,multiplication(strong_iteration(sK0),strong_iteration(one))))
| ~ spl1_2 ),
inference(resolution,[],[f1390,f58]) ).
fof(f8834,plain,
( leq(addition(strong_iteration(one),multiplication(addition(one,multiplication(strong_iteration(sK0),strong_iteration(one))),zero)),addition(one,multiplication(strong_iteration(sK0),strong_iteration(one))))
| ~ spl1_2 ),
inference(resolution,[],[f8679,f1293]) ).
fof(f8837,plain,
( leq(addition(strong_iteration(one),multiplication(multiplication(strong_iteration(sK0),strong_iteration(one)),zero)),addition(one,multiplication(strong_iteration(sK0),strong_iteration(one))))
| ~ spl1_2 ),
inference(forward_demodulation,[],[f8834,f688]) ).
fof(f8838,plain,
( leq(addition(strong_iteration(one),multiplication(strong_iteration(sK0),multiplication(strong_iteration(one),zero))),addition(one,multiplication(strong_iteration(sK0),strong_iteration(one))))
| ~ spl1_2 ),
inference(forward_demodulation,[],[f8837,f29]) ).
fof(f9018,plain,
( addition(one,multiplication(strong_iteration(sK0),strong_iteration(one))) != addition(strong_iteration(one),addition(multiplication(strong_iteration(sK0),multiplication(strong_iteration(one),zero)),addition(one,multiplication(strong_iteration(sK0),strong_iteration(one)))))
| ~ spl1_2 ),
inference(resolution,[],[f8838,f118]) ).
fof(f9019,plain,
( addition(one,multiplication(strong_iteration(sK0),strong_iteration(one))) != addition(strong_iteration(one),addition(one,addition(multiplication(strong_iteration(sK0),strong_iteration(one)),multiplication(strong_iteration(sK0),multiplication(strong_iteration(one),zero)))))
| ~ spl1_2 ),
inference(forward_demodulation,[],[f9018,f114]) ).
fof(f9022,plain,
( addition(one,multiplication(strong_iteration(sK0),strong_iteration(one))) != addition(strong_iteration(one),addition(one,multiplication(strong_iteration(sK0),addition(strong_iteration(one),multiplication(strong_iteration(one),zero)))))
| ~ spl1_2 ),
inference(forward_demodulation,[],[f9019,f32]) ).
fof(f9025,plain,
( addition(one,multiplication(strong_iteration(sK0),strong_iteration(one))) != addition(strong_iteration(one),addition(one,multiplication(strong_iteration(sK0),multiplication(strong_iteration(one),addition(one,zero)))))
| ~ spl1_2 ),
inference(forward_demodulation,[],[f9022,f134]) ).
fof(f9028,plain,
( addition(one,multiplication(strong_iteration(sK0),strong_iteration(one))) != addition(strong_iteration(one),addition(one,multiplication(strong_iteration(sK0),multiplication(strong_iteration(one),one))))
| ~ spl1_2 ),
inference(forward_demodulation,[],[f9025,f27]) ).
fof(f9031,plain,
( addition(one,multiplication(strong_iteration(sK0),strong_iteration(one))) != addition(strong_iteration(one),addition(one,multiplication(strong_iteration(sK0),strong_iteration(one))))
| ~ spl1_2 ),
inference(forward_demodulation,[],[f9028,f30]) ).
fof(f9041,plain,
( addition(one,multiplication(strong_iteration(sK0),strong_iteration(one))) != addition(one,addition(multiplication(strong_iteration(sK0),strong_iteration(one)),strong_iteration(one)))
| ~ spl1_2 ),
inference(superposition,[],[f9031,f114]) ).
fof(f9042,plain,
( addition(one,multiplication(strong_iteration(sK0),strong_iteration(one))) != addition(one,addition(strong_iteration(one),multiplication(strong_iteration(sK0),strong_iteration(one))))
| ~ spl1_2 ),
inference(forward_demodulation,[],[f9041,f25]) ).
fof(f9047,plain,
( addition(one,multiplication(strong_iteration(sK0),strong_iteration(one))) != addition(one,multiplication(addition(one,strong_iteration(sK0)),strong_iteration(one)))
| ~ spl1_2 ),
inference(forward_demodulation,[],[f9042,f163]) ).
fof(f9055,plain,
( addition(one,multiplication(strong_iteration(sK0),strong_iteration(one))) != addition(one,multiplication(strong_iteration(sK0),strong_iteration(one)))
| ~ spl1_2 ),
inference(forward_demodulation,[],[f9047,f285]) ).
fof(f9056,plain,
( $false
| ~ spl1_2 ),
inference(trivial_inequality_removal,[],[f9055]) ).
fof(f9057,plain,
~ spl1_2,
inference(avatar_contradiction_clause,[],[f9056]) ).
cnf(s1,plain,
( spl1_1
| spl1_2 ),
inference(sat_conversion,[],[f59]) ).
cnf(s23,plain,
~ spl1_1,
inference(sat_conversion,[],[f1878]) ).
cnf(s28,plain,
~ spl1_2,
inference(sat_conversion,[],[f9057]) ).
cnf(s29,plain,
$false,
inference(rat,[],[s1,s28,s23]) ).
fof(f9058,plain,
$false,
inference(avatar_sat_refutation,[],[s29]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : KLE142+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.24/0.49 % Computer : n017.cluster.edu
% 0.24/0.49 % Model : x86_64 x86_64
% 0.24/0.49 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.24/0.49 % Memory : 8046.5625MB
% 0.24/0.49 % OS : Linux 6.8.0-71-generic
% 0.24/0.49 % CPULimit : 300
% 0.24/0.49 % WCLimit : 300
% 0.24/0.49 % DateTime : Sun Sep 27 13:07:20 UTC 2026
% 0.09/0.50 % CPUTime :
% 0.09/0.50 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.55 Running first-order model finding
% 0.09/0.56 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
% 0.32/0.96 % (2540262)Will run a generic schedule for satisfiability detection.
% 0.32/0.96 % (2540271)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=314825080:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.32/0.96 % (2540268)% WARNING: option uhcvi not known.
% 0.32/0.96 % (2540270)dis+10_1_sil=32000:sp=arity:random_seed=2590339832:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.32/0.96 % (2540267)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3007248114_2999 on theBenchmark for (2999ds/0Mi)
% 0.32/0.96 % (2540268)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1813034732:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.32/0.96 % (2540269)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=4042313446:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.32/0.96 % (2540272)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2664565392:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.32/0.96 % (2540273)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=4050881881:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.32/0.96 % TRYING [1]
% 0.32/0.96 % TRYING [2]
% 0.32/0.96 % TRYING [3]
% 0.32/0.96 % TRYING [4]
% 0.32/0.96 % (2540271)Instruction limit reached!
% 0.32/0.96 % (2540271)------------------------------
% 0.32/0.96 % (2540271)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.32/0.96 % (2540271)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.32/0.96 % (2540271)CaDiCaL version: 2.1.3
% 0.32/0.96 % (2540271)Termination reason: Instruction limit
% 0.32/0.96 % (2540271)Termination phase: Saturation
% 0.32/0.96 % (2540271)Time elapsed: 0.064 s
% 0.32/0.96 % (2540271)Peak memory usage: 13 MB
% 0.32/0.96 % (2540271)Instructions burned: 117 (million)
% 0.32/0.96 % TRYING [5]
% 0.32/0.96 % (2540281)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=700515405:i=714:nm=2_2998 on theBenchmark for (2998ds/714Mi)
% 0.32/0.96 % (2540270)Instruction limit reached!
% 0.32/0.96 % (2540270)------------------------------
% 0.32/0.96 % (2540270)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.32/0.96 % (2540270)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.32/0.96 % (2540270)CaDiCaL version: 2.1.3
% 0.32/0.96 % (2540270)Termination reason: Instruction limit
% 0.32/0.96 % (2540270)Termination phase: Saturation
% 0.32/0.96 % (2540270)Time elapsed: 0.104 s
% 0.32/0.96 % (2540270)Peak memory usage: 12 MB
% 0.32/0.96 % (2540270)Instructions burned: 104 (million)
% 0.32/0.96 % TRYING [1]
% 0.32/0.96 % TRYING [2]
% 0.32/0.96 % TRYING [3]
% 0.32/0.96 % TRYING [4]
% 0.32/0.96 % (2540272)Instruction limit reached!
% 0.32/0.96 % (2540272)------------------------------
% 0.32/0.96 % (2540272)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.32/0.96 % (2540272)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.32/0.96 % (2540272)CaDiCaL version: 2.1.3
% 0.32/0.96 % (2540272)Termination reason: Instruction limit
% 0.32/0.96 % (2540272)Termination phase: Saturation
% 0.32/0.96 % (2540272)Time elapsed: 0.137 s
% 0.32/0.96 % (2540272)Peak memory usage: 13 MB
% 0.32/0.96 % (2540272)Instructions burned: 131 (million)
% 0.32/0.96 % (2540283)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=515076823:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 0.32/0.96 % TRYING [5]
% 0.32/0.96 % (2540273)Instruction limit reached!
% 0.32/0.96 % (2540273)------------------------------
% 0.32/0.96 % (2540273)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.32/0.96 % (2540273)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.32/0.96 % (2540273)CaDiCaL version: 2.1.3
% 0.32/0.96 % (2540273)Termination reason: Instruction limit
% 0.32/0.96 % (2540273)Termination phase: Saturation
% 0.32/0.96 % (2540273)Time elapsed: 0.169 s
% 0.32/0.96 % (2540273)Peak memory usage: 12 MB
% 0.32/0.96 % (2540273)Instructions burned: 159 (million)
% 0.32/0.96 % TRYING [6]
% 0.32/0.96 % (2540284)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=4105397459:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 0.32/0.96 % (2540286)ott-21_1_sil=16000:fs=off:random_seed=1935916814:i=180:av=off:fsr=off_2997 on theBenchmark for (2997ds/180Mi)
% 0.32/0.96 % TRYING [6]
% 0.32/0.96 % (2540283)Instruction limit reached!
% 0.32/0.96 % (2540283)------------------------------
% 0.32/0.96 % (2540283)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.32/0.97 % (2540283)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.32/0.97 % (2540283)CaDiCaL version: 2.1.3
% 0.32/0.97 % (2540283)Termination reason: Instruction limit
% 0.32/0.97 % (2540283)Termination phase: Saturation
% 0.32/0.97 % (2540283)Time elapsed: 0.149 s
% 0.32/0.97 % (2540283)Peak memory usage: 13 MB
% 0.32/0.97 % (2540283)Instructions burned: 131 (million)
% 0.32/0.97 % (2540268) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2540262-2540268"...
% 0.32/0.97 % (2540268)...printing done.
% 0.32/0.97 % (2540268)Refutation found. Thanks to Tanya!
% 0.32/0.97 % SZS status Theorem for theBenchmark
% 0.32/0.97 % SZS output start Proof for theBenchmark
% See solution above
% 0.32/0.97 % (2540268)------------------------------
% 0.32/0.97 % (2540268)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.32/0.97 % (2540268)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.32/0.97 % (2540268)CaDiCaL version: 2.1.3
% 0.32/0.97 % (2540268)Termination reason: Refutation
% 0.32/0.97 % (2540268)Time elapsed: 0.338 s
% 0.32/0.97 % (2540268)Peak memory usage: 15 MB
% 0.32/0.97 % (2540268)Instructions burned: 341 (million)
% 0.32/0.97 % (2540262)Success in time 0.396 s
% 0.32/0.97 % Vampire exiting
%------------------------------------------------------------------------------