%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : KLE008+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 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:01 AM UTC 2026
% Result : Theorem 4.02s 1.60s
% Output : Refutation 5.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 16
% Syntax : Number of formulae : 106 ( 33 unt; 3 def)
% Number of atoms : 235 ( 72 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 217 ( 88 ~; 93 |; 23 &)
% ( 9 <=>; 3 =>; 0 <=; 1 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 4 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 103 ( 0 sgn 94 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',additive_commutativity) ).
fof(f2,axiom,
! [X0,X1,X2] : addition(X2,addition(X1,X0)) = addition(addition(X2,X1),X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',additive_associativity) ).
fof(f3,axiom,
! [X0] : addition(X0,zero) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',additive_identity) ).
fof(f4,axiom,
! [X0] : addition(X0,X0) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',additive_idempotence) ).
fof(f5,axiom,
! [X0,X1,X2] : multiplication(X0,multiplication(X1,X2)) = multiplication(multiplication(X0,X1),X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiplicative_associativity) ).
fof(f7,axiom,
! [X0] : multiplication(one,X0) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',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/theBenchmark.p',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/theBenchmark.p',left_distributivity) ).
fof(f11,axiom,
! [X0] : multiplication(zero,X0) = zero,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',left_annihilation) ).
fof(f12,axiom,
! [X0,X1] :
( leq(X0,X1)
<=> addition(X0,X1) = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',order) ).
fof(f14,axiom,
! [X0,X1] :
( complement(X1,X0)
<=> ( multiplication(X0,X1) = zero
& multiplication(X1,X0) = zero
& addition(X0,X1) = one ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',test_2) ).
fof(f15,axiom,
! [X0,X1] :
( test(X0)
=> ( c(X0) = X1
<=> complement(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',test_3) ).
fof(f17,conjecture,
! [X0,X1,X2] :
( test(X2)
=> ( leq(X0,multiplication(X2,X1))
<=> ( leq(X0,X1)
& leq(multiplication(c(X2),X0),zero) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(f18,negated_conjecture,
~ ! [X0,X1,X2] :
( test(X2)
=> ( leq(X0,multiplication(X2,X1))
<=> ( leq(X0,X1)
& leq(multiplication(c(X2),X0),zero) ) ) ),
inference(negated_conjecture,[status(cth)],[f17]) ).
fof(f19,plain,
? [X0,X1,X2] :
( ( leq(X0,multiplication(X2,X1))
<~> ( leq(X0,X1)
& leq(multiplication(c(X2),X0),zero) ) )
& test(X2) ),
inference(ennf_transformation,[],[f18]) ).
fof(f21,plain,
! [X0,X1] :
( ( c(X0) = X1
<=> complement(X0,X1) )
| ~ test(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f22,plain,
? [X0,X1,X2] :
( ( ~ leq(X0,X1)
| ~ leq(multiplication(c(X2),X0),zero)
| ~ leq(X0,multiplication(X2,X1)) )
& ( ( leq(X0,X1)
& leq(multiplication(c(X2),X0),zero) )
| leq(X0,multiplication(X2,X1)) )
& test(X2) ),
inference(nnf_transformation,[],[f19]) ).
fof(f23,plain,
? [X0,X1,X2] :
( ( ~ leq(X0,X1)
| ~ leq(multiplication(c(X2),X0),zero)
| ~ leq(X0,multiplication(X2,X1)) )
& ( ( leq(X0,X1)
& leq(multiplication(c(X2),X0),zero) )
| leq(X0,multiplication(X2,X1)) )
& test(X2) ),
inference(flattening,[],[f22]) ).
fof(f24,plain,
( ( ~ leq(sK0,sK1)
| ~ leq(multiplication(c(sK2),sK0),zero)
| ~ leq(sK0,multiplication(sK2,sK1)) )
& ( ( leq(sK0,sK1)
& leq(multiplication(c(sK2),sK0),zero) )
| leq(sK0,multiplication(sK2,sK1)) )
& test(sK2) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f23]) ).
fof(f25,plain,
! [X0,X1] :
( ( leq(X0,X1)
| addition(X0,X1) != X1 )
& ( addition(X0,X1) = X1
| ~ leq(X0,X1) ) ),
inference(nnf_transformation,[],[f12]) ).
fof(f26,plain,
! [X0,X1] :
( ( complement(X1,X0)
| zero != multiplication(X0,X1)
| zero != multiplication(X1,X0)
| addition(X0,X1) != one )
& ( ( multiplication(X0,X1) = zero
& multiplication(X1,X0) = zero
& addition(X0,X1) = one )
| ~ complement(X1,X0) ) ),
inference(nnf_transformation,[],[f14]) ).
fof(f27,plain,
! [X0,X1] :
( ( complement(X1,X0)
| zero != multiplication(X0,X1)
| zero != multiplication(X1,X0)
| addition(X0,X1) != one )
& ( ( multiplication(X0,X1) = zero
& multiplication(X1,X0) = zero
& addition(X0,X1) = one )
| ~ complement(X1,X0) ) ),
inference(flattening,[],[f26]) ).
fof(f28,plain,
! [X0,X1] :
( ( ( c(X0) = X1
| ~ complement(X0,X1) )
& ( complement(X0,X1)
| c(X0) != X1 ) )
| ~ test(X0) ),
inference(nnf_transformation,[],[f21]) ).
fof(f32,plain,
test(sK2),
inference(cnf_transformation,[],[f24]) ).
fof(f33,plain,
( leq(multiplication(c(sK2),sK0),zero)
| leq(sK0,multiplication(sK2,sK1)) ),
inference(cnf_transformation,[],[f24]) ).
fof(f34,plain,
( leq(sK0,sK1)
| leq(sK0,multiplication(sK2,sK1)) ),
inference(cnf_transformation,[],[f24]) ).
fof(f35,plain,
( ~ leq(sK0,sK1)
| ~ leq(multiplication(c(sK2),sK0),zero)
| ~ leq(sK0,multiplication(sK2,sK1)) ),
inference(cnf_transformation,[],[f24]) ).
fof(f36,plain,
! [X0,X1] :
( ~ leq(X0,X1)
| addition(X0,X1) = X1 ),
inference(cnf_transformation,[],[f25]) ).
fof(f37,plain,
! [X0,X1] :
( addition(X0,X1) != X1
| leq(X0,X1) ),
inference(cnf_transformation,[],[f25]) ).
fof(f39,plain,
! [X0,X1] :
( ~ complement(X1,X0)
| addition(X0,X1) = one ),
inference(cnf_transformation,[],[f27]) ).
fof(f41,plain,
! [X0,X1] :
( ~ complement(X1,X0)
| zero = multiplication(X0,X1) ),
inference(cnf_transformation,[],[f27]) ).
fof(f43,plain,
! [X0] : zero = multiplication(zero,X0),
inference(cnf_transformation,[],[f11]) ).
fof(f45,plain,
! [X0] : addition(X0,zero) = X0,
inference(cnf_transformation,[],[f3]) ).
fof(f46,plain,
! [X0,X1] :
( complement(X0,X1)
| c(X0) != X1
| ~ test(X0) ),
inference(cnf_transformation,[],[f28]) ).
fof(f50,plain,
! [X2,X0,X1] : multiplication(X0,multiplication(X1,X2)) = multiplication(multiplication(X0,X1),X2),
inference(cnf_transformation,[],[f5]) ).
fof(f51,plain,
! [X2,X0,X1] : multiplication(addition(X0,X1),X2) = addition(multiplication(X0,X2),multiplication(X1,X2)),
inference(cnf_transformation,[],[f9]) ).
fof(f52,plain,
! [X2,X0,X1] : multiplication(X0,addition(X1,X2)) = addition(multiplication(X0,X1),multiplication(X0,X2)),
inference(cnf_transformation,[],[f8]) ).
fof(f53,plain,
! [X0] : addition(X0,X0) = X0,
inference(cnf_transformation,[],[f4]) ).
fof(f54,plain,
! [X2,X0,X1] : addition(X2,addition(X1,X0)) = addition(addition(X2,X1),X0),
inference(cnf_transformation,[],[f2]) ).
fof(f55,plain,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f56,plain,
! [X0] : multiplication(one,X0) = X0,
inference(cnf_transformation,[],[f7]) ).
fof(f58,plain,
! [X0] :
( complement(X0,c(X0))
| ~ test(X0) ),
inference(equality_resolution,[],[f46]) ).
fof(f60,definition,
( spl4_1
<=> leq(sK0,multiplication(sK2,sK1)) ),
introduced(definition,[new_symbols(definition,[spl4_1])],[avatar_definition]) ).
fof(f61,plain,
( ~ leq(sK0,multiplication(sK2,sK1))
| spl4_1 ),
inference(avatar_component_clause,[],[f60]) ).
fof(f62,plain,
( leq(sK0,multiplication(sK2,sK1))
| ~ spl4_1 ),
inference(avatar_component_clause,[],[f60]) ).
fof(f64,definition,
( spl4_2
<=> leq(multiplication(c(sK2),sK0),zero) ),
introduced(definition,[new_symbols(definition,[spl4_2])],[avatar_definition]) ).
fof(f65,plain,
( ~ leq(multiplication(c(sK2),sK0),zero)
| spl4_2 ),
inference(avatar_component_clause,[],[f64]) ).
fof(f66,plain,
( leq(multiplication(c(sK2),sK0),zero)
| ~ spl4_2 ),
inference(avatar_component_clause,[],[f64]) ).
fof(f67,plain,
( spl4_1
| spl4_2 ),
inference(avatar_split_clause,[],[f33,f64,f60]) ).
fof(f69,definition,
( spl4_3
<=> leq(sK0,sK1) ),
introduced(definition,[new_symbols(definition,[spl4_3])],[avatar_definition]) ).
fof(f70,plain,
( ~ leq(sK0,sK1)
| spl4_3 ),
inference(avatar_component_clause,[],[f69]) ).
fof(f71,plain,
( leq(sK0,sK1)
| ~ spl4_3 ),
inference(avatar_component_clause,[],[f69]) ).
fof(f72,plain,
( spl4_1
| spl4_3 ),
inference(avatar_split_clause,[],[f34,f69,f60]) ).
fof(f73,plain,
( ~ spl4_1
| ~ spl4_2
| ~ spl4_3 ),
inference(avatar_split_clause,[],[f35,f69,f64,f60]) ).
fof(f79,plain,
! [X0] : addition(zero,X0) = X0,
inference(superposition,[],[f45,f55]) ).
fof(f84,plain,
( sK1 = addition(sK0,sK1)
| ~ spl4_3 ),
inference(resolution,[],[f36,f71]) ).
fof(f85,plain,
( zero = addition(multiplication(c(sK2),sK0),zero)
| ~ spl4_2 ),
inference(resolution,[],[f36,f66]) ).
fof(f86,plain,
( zero = addition(zero,multiplication(c(sK2),sK0))
| ~ spl4_2 ),
inference(forward_demodulation,[],[f85,f55]) ).
fof(f87,plain,
( zero = multiplication(c(sK2),sK0)
| ~ spl4_2 ),
inference(forward_demodulation,[],[f86,f79]) ).
fof(f99,plain,
! [X0] :
( one = addition(c(X0),X0)
| ~ test(X0) ),
inference(resolution,[],[f39,f58]) ).
fof(f100,plain,
! [X0] :
( ~ test(X0)
| one = addition(X0,c(X0)) ),
inference(forward_demodulation,[],[f99,f55]) ).
fof(f106,plain,
! [X0] :
( ~ test(X0)
| zero = multiplication(c(X0),X0) ),
inference(resolution,[],[f41,f58]) ).
fof(f146,plain,
! [X0,X1] : addition(X0,X1) = addition(X0,addition(X0,X1)),
inference(superposition,[],[f54,f53]) ).
fof(f181,plain,
( ! [X0] : multiplication(addition(X0,c(sK2)),sK0) = addition(multiplication(X0,sK0),zero)
| ~ spl4_2 ),
inference(superposition,[],[f51,f87]) ).
fof(f191,plain,
! [X2,X0,X1] : multiplication(addition(X0,X1),X2) = addition(multiplication(X1,X2),multiplication(X0,X2)),
inference(superposition,[],[f55,f51]) ).
fof(f193,plain,
( ! [X0] : addition(zero,multiplication(X0,sK0)) = multiplication(addition(X0,c(sK2)),sK0)
| ~ spl4_2 ),
inference(forward_demodulation,[],[f181,f55]) ).
fof(f204,plain,
( ! [X0] : multiplication(X0,sK0) = multiplication(addition(X0,c(sK2)),sK0)
| ~ spl4_2 ),
inference(forward_demodulation,[],[f193,f79]) ).
fof(f240,plain,
! [X2,X0,X1] :
( multiplication(X0,addition(X1,X2)) != multiplication(X0,X2)
| leq(multiplication(X0,X1),multiplication(X0,X2)) ),
inference(superposition,[],[f37,f52]) ).
fof(f354,plain,
one = addition(sK2,c(sK2)),
inference(resolution,[],[f100,f32]) ).
fof(f378,plain,
zero = multiplication(c(sK2),sK2),
inference(resolution,[],[f106,f32]) ).
fof(f409,plain,
one = addition(sK2,one),
inference(superposition,[],[f146,f354]) ).
fof(f422,plain,
one = addition(one,sK2),
inference(forward_demodulation,[],[f409,f55]) ).
fof(f1594,plain,
! [X0] : multiplication(zero,X0) = multiplication(c(sK2),multiplication(sK2,X0)),
inference(superposition,[],[f50,f378]) ).
fof(f1616,plain,
! [X0] : zero = multiplication(c(sK2),multiplication(sK2,X0)),
inference(forward_demodulation,[],[f1594,f43]) ).
fof(f1644,plain,
( ! [X0] :
( multiplication(X0,sK1) != multiplication(X0,sK1)
| leq(multiplication(X0,sK0),multiplication(X0,sK1)) )
| ~ spl4_3 ),
inference(superposition,[],[f240,f84]) ).
fof(f1654,plain,
( ! [X0] : leq(multiplication(X0,sK0),multiplication(X0,sK1))
| ~ spl4_3 ),
inference(trivial_inequality_removal,[],[f1644]) ).
fof(f2995,plain,
( multiplication(one,sK0) = multiplication(sK2,sK0)
| ~ spl4_2 ),
inference(superposition,[],[f204,f354]) ).
fof(f3041,plain,
( sK0 = multiplication(sK2,sK0)
| ~ spl4_2 ),
inference(forward_demodulation,[],[f2995,f56]) ).
fof(f3055,plain,
( leq(sK0,multiplication(sK2,sK1))
| ~ spl4_2
| ~ spl4_3 ),
inference(superposition,[],[f1654,f3041]) ).
fof(f3101,plain,
( $false
| spl4_1
| ~ spl4_2
| ~ spl4_3 ),
inference(forward_subsumption_resolution,[],[f3055,f61]) ).
fof(f3102,plain,
( spl4_1
| ~ spl4_2
| ~ spl4_3 ),
inference(avatar_contradiction_clause,[],[f3101]) ).
fof(f3108,plain,
( multiplication(sK2,sK1) = addition(sK0,multiplication(sK2,sK1))
| ~ spl4_1 ),
inference(resolution,[],[f62,f36]) ).
fof(f3120,plain,
( ! [X0] : addition(multiplication(sK2,sK1),X0) = addition(sK0,addition(multiplication(sK2,sK1),X0))
| ~ spl4_1 ),
inference(superposition,[],[f54,f3108]) ).
fof(f3129,plain,
( ! [X0] :
( multiplication(X0,multiplication(sK2,sK1)) != multiplication(X0,multiplication(sK2,sK1))
| leq(multiplication(X0,sK0),multiplication(X0,multiplication(sK2,sK1))) )
| ~ spl4_1 ),
inference(superposition,[],[f240,f3108]) ).
fof(f3130,plain,
( ! [X0] : leq(multiplication(X0,sK0),multiplication(X0,multiplication(sK2,sK1)))
| ~ spl4_1 ),
inference(trivial_inequality_removal,[],[f3129]) ).
fof(f3629,plain,
( leq(multiplication(c(sK2),sK0),zero)
| ~ spl4_1 ),
inference(superposition,[],[f3130,f1616]) ).
fof(f4132,plain,
( ! [X0] :
( addition(multiplication(sK2,sK1),X0) != addition(multiplication(sK2,sK1),X0)
| leq(sK0,addition(multiplication(sK2,sK1),X0)) )
| ~ spl4_1 ),
inference(superposition,[],[f37,f3120]) ).
fof(f4145,plain,
( ! [X0] : leq(sK0,addition(multiplication(sK2,sK1),X0))
| ~ spl4_1 ),
inference(trivial_inequality_removal,[],[f4132]) ).
fof(f4163,plain,
( ! [X0] : leq(sK0,multiplication(addition(X0,sK2),sK1))
| ~ spl4_1 ),
inference(superposition,[],[f4145,f191]) ).
fof(f4302,plain,
( leq(sK0,multiplication(one,sK1))
| ~ spl4_1 ),
inference(superposition,[],[f4163,f422]) ).
fof(f4304,plain,
( leq(sK0,sK1)
| ~ spl4_1 ),
inference(forward_demodulation,[],[f4302,f56]) ).
fof(f4305,plain,
( $false
| ~ spl4_1
| spl4_3 ),
inference(forward_subsumption_resolution,[],[f4304,f70]) ).
fof(f4306,plain,
( ~ spl4_1
| spl4_3 ),
inference(avatar_contradiction_clause,[],[f4305]) ).
fof(f4309,plain,
( $false
| ~ spl4_1
| spl4_2 ),
inference(forward_subsumption_resolution,[],[f3629,f65]) ).
fof(f4310,plain,
( ~ spl4_1
| spl4_2 ),
inference(avatar_contradiction_clause,[],[f4309]) ).
cnf(s1,plain,
( spl4_1
| spl4_2 ),
inference(sat_conversion,[],[f67]) ).
cnf(s2,plain,
( spl4_1
| spl4_3 ),
inference(sat_conversion,[],[f72]) ).
cnf(s3,plain,
( ~ spl4_1
| ~ spl4_2
| ~ spl4_3 ),
inference(sat_conversion,[],[f73]) ).
cnf(s15,plain,
( spl4_1
| ~ spl4_2
| ~ spl4_3 ),
inference(sat_conversion,[],[f3102]) ).
cnf(s18,plain,
( ~ spl4_1
| spl4_3 ),
inference(sat_conversion,[],[f4306]) ).
cnf(s20,plain,
( ~ spl4_1
| spl4_2 ),
inference(sat_conversion,[],[f4310]) ).
cnf(s22,plain,
spl4_1,
inference(rat,[],[s15,s1,s2]) ).
cnf(s23,plain,
spl4_2,
inference(rat,[],[s20,s22]) ).
cnf(s24,plain,
spl4_3,
inference(rat,[],[s18,s22]) ).
cnf(s25,plain,
$false,
inference(rat,[],[s3,s23,s24,s22]) ).
fof(f4311,plain,
$false,
inference(avatar_sat_refutation,[],[s25]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KLE008+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.38 % Computer : n026.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:01:11 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.39 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.42 Running first-order theorem proving
% 0.10/0.42 Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.02/1.60 % (2826997)Detected formulas, will run a generic FOF schedule.
% 4.02/1.60 % (2827008)dis-21_1_sil=8000:lcm=predicate:random_seed=1912128146:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 4.02/1.60 % (2827008)Refutation not found, incomplete strategy
% 4.02/1.60 % (2827008)------------------------------
% 4.02/1.60 % (2827008)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.02/1.60 % (2827008)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.02/1.60 % (2827008)CaDiCaL version: 2.1.3
% 4.02/1.60 % (2827008)Termination reason: Refutation not found, incomplete strategy
% 4.02/1.60 % (2827008)Time elapsed: 0.002 s
% 4.02/1.60 % (2827008)Peak memory usage: 88 MB
% 4.02/1.60 % (2827008)Instructions burned: 2 (million)
% 4.02/1.60 % (2827004)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=1309827606:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 4.02/1.60 % (2827002)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=3069031892:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 4.02/1.60 % (2827003)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=4278525117:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 4.02/1.60 % (2827005)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=3027413582:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 4.02/1.60 % (2827006)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2221776908:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 4.02/1.60 % (2827007)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3134832769:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 4.02/1.60 % (2827005)Refutation not found, incomplete strategy
% 4.02/1.60 % (2827005)------------------------------
% 4.02/1.60 % (2827005)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.02/1.60 % (2827005)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.02/1.60 % (2827005)CaDiCaL version: 2.1.3
% 4.02/1.60 % (2827005)Termination reason: Refutation not found, incomplete strategy
% 4.02/1.60 % (2827005)Time elapsed: 0.002 s
% 4.02/1.60 % (2827005)Peak memory usage: 88 MB
% 4.02/1.60 % (2827006)Instruction limit reached!
% 4.02/1.60 % (2827006)------------------------------
% 4.02/1.60 % (2827006)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.02/1.60 % (2827006)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.02/1.60 % (2827006)CaDiCaL version: 2.1.3
% 4.02/1.60 % (2827006)Termination reason: Instruction limit
% 4.02/1.60 % (2827006)Termination phase: Saturation
% 4.02/1.60 % (2827006)Time elapsed: 0.070 s
% 4.02/1.60 % (2827006)Peak memory usage: 89 MB
% 4.02/1.60 % (2827006)Instructions burned: 121 (million)
% 4.02/1.60 % (2827007)Instruction limit reached!
% 4.02/1.60 % (2827007)------------------------------
% 4.02/1.60 % (2827007)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.02/1.60 % (2827007)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.02/1.60 % (2827007)CaDiCaL version: 2.1.3
% 4.02/1.60 % (2827007)Termination reason: Instruction limit
% 4.02/1.60 % (2827007)Termination phase: Saturation
% 4.02/1.60 % (2827007)Time elapsed: 0.084 s
% 4.02/1.60 % (2827007)Peak memory usage: 90 MB
% 4.02/1.60 % (2827007)Instructions burned: 141 (million)
% 4.02/1.60 % (2827008)------------------------------
% 4.02/1.60 % (2827008)------------------------------
% 4.02/1.60 % (2827018)lrs+1011_1_sil=32000:sp=occurrence:random_seed=1810470141:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 4.02/1.60 % (2827016)lrs+10_1_sil=8000:sp=occurrence:random_seed=1717572974:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 4.02/1.60 % (2827017)lrs+10_1_sil=32000:urr=on:br=off:random_seed=2489371188:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 4.02/1.60 % (2827005)------------------------------
% 4.02/1.60 % (2827005)------------------------------
% 4.02/1.60 % (2827016)First to succeed.
% 4.02/1.60 % (2827016)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2826997"
% 4.02/1.60 % (2827018)Instruction limit reached!
% 4.02/1.60 % (2827018)------------------------------
% 4.02/1.60 % (2827018)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.02/1.60 % (2827018)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.02/1.60 % (2827018)CaDiCaL version: 2.1.3
% 4.02/1.60 % (2827018)Termination reason: Instruction limit
% 4.02/1.60 % (2827018)Termination phase: Saturation
% 4.02/1.60 % (2827018)Time elapsed: 0.110 s
% 4.02/1.60 % (2827018)Peak memory usage: 93 MB
% 4.02/1.60 % (2827018)Instructions burned: 327 (million)
% 4.02/1.60 % (2827017)Instruction limit reached!
% 4.02/1.60 % (2827017)------------------------------
% 4.02/1.60 % (2827017)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.02/1.60 % (2827017)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.02/1.60 % (2827017)CaDiCaL version: 2.1.3
% 4.02/1.60 % (2827017)Termination reason: Instruction limit
% 4.02/1.60 % (2827017)Termination phase: Saturation
% 4.02/1.60 % (2827017)Time elapsed: 0.076 s
% 4.02/1.60 % (2827017)Peak memory usage: 89 MB
% 4.02/1.60 % (2827017)Instructions burned: 158 (million)
% 4.02/1.60 % (2827022)dis+10_5:1_slsqr=1,4:sil=8000:fde=unused:erd=off:urr=full:fd=off:s2agt=8:br=off:slsq=on:random_seed=3728282614:s2a=on:i=248:s2at=1.23:gtg=position_2995 on theBenchmark for (2995ds/248Mi)
% 4.02/1.60 % (2827023)lrs+1002_1_to=lpo:sil=8000:sos=on:random_seed=3075576165:st=4:cts=off:i=294:sd=2:ins=7:amm=off:ss=axioms_2995 on theBenchmark for (2995ds/294Mi)
% 4.02/1.60 % (2827024)lrs+10_1_ncem=casc2026/models/loop7.pt:sil=32000:tgt=ground:npcc=on:random_seed=3969479071:i=2350_2995 on theBenchmark for (2995ds/2350Mi)
% 4.02/1.60 % (2827023)Instruction limit reached!
% 4.02/1.60 % (2827023)------------------------------
% 4.02/1.60 % (2827023)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.02/1.60 % (2827023)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.02/1.60 % (2827023)CaDiCaL version: 2.1.3
% 4.02/1.60 % (2827023)Termination reason: Instruction limit
% 4.02/1.60 % (2827023)Termination phase: Saturation
% 4.02/1.60 % (2827023)Time elapsed: 0.086 s
% 4.02/1.60 % (2827023)Peak memory usage: 89 MB
% 4.02/1.60 % (2827023)Instructions burned: 294 (million)
% 4.02/1.60 % (2827022)Instruction limit reached!
% 4.02/1.60 % (2827022)------------------------------
% 4.02/1.60 % (2827022)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.02/1.60 % (2827022)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.02/1.60 % (2827022)CaDiCaL version: 2.1.3
% 4.02/1.60 % (2827022)Termination reason: Instruction limit
% 4.02/1.60 % (2827022)Termination phase: Saturation
% 4.02/1.60 % (2827022)Time elapsed: 0.157 s
% 4.02/1.60 % (2827022)Peak memory usage: 92 MB
% 4.02/1.60 % (2827022)Instructions burned: 249 (million)
% 4.02/1.60 % (2827016)Refutation found. Thanks to Tanya!
% 4.02/1.60 % SZS status Theorem for theBenchmark
% 4.02/1.60 % SZS output start Proof for theBenchmark
% See solution above
% 5.73/1.79 % (2827016)------------------------------
% 5.73/1.79 % (2827016)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.73/1.79 % (2827016)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.73/1.79 % (2827016)CaDiCaL version: 2.1.3
% 5.73/1.79 % (2827016)Termination reason: Refutation
% 5.73/1.79 % (2827016)Time elapsed: 0.095 s
% 5.73/1.79 % (2827016)Peak memory usage: 92 MB
% 5.73/1.79 % (2827016)Instructions burned: 147 (million)
% 5.73/1.79 % (2827016)------------------------------
% 5.73/1.79 % (2827016)------------------------------
% 5.73/1.79 % (2826997)Success in time 0.733 s
% 5.73/1.79 % Vampire exiting
%------------------------------------------------------------------------------