%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWV055+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n007.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 01:20:05 PM UTC 2026
% Result : Theorem 0.89s 0.43s
% Output : Refutation 0.89s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 16
% Syntax : Number of formulae : 92 ( 31 unt; 8 def)
% Number of atoms : 248 ( 30 equ)
% Maximal formula atoms : 13 ( 2 avg)
% Number of connectives : 259 ( 103 ~; 107 |; 31 &)
% ( 9 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 3 avg)
% Maximal term depth : 7 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 9 prp; 0-2 aty)
% Number of functors : 22 ( 22 usr; 12 con; 0-3 aty)
% Number of variables : 60 ( 0 sgn 52 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0] : ~ gt(X0,X0),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',irreflexivity_gt) ).
fof(f5,axiom,
! [X0,X1,X2] :
( ( leq(X0,X1)
& leq(X1,X2) )
=> leq(X0,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',transitivity_leq) ).
fof(f10,axiom,
! [X0,X1] :
( leq(X0,pred(X1))
<=> gt(X1,X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',leq_gt_pred) ).
fof(f28,axiom,
succ(tptp_minus_1) = n0,
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',succ_tptp_minus_1) ).
fof(f29,axiom,
! [X0] : plus(X0,n1) = succ(X0),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',succ_plus_1_r) ).
fof(f39,axiom,
! [X0] : minus(X0,n1) = pred(X0),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',pred_minus_1) ).
fof(f40,axiom,
! [X0] : pred(succ(X0)) = X0,
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',pred_succ) ).
fof(f53,conjecture,
( ( leq(n0,pv10)
& leq(pv10,minus(n135300,n1))
& ! [X0,X1] :
( ( leq(n0,X0)
& leq(X0,minus(pv10,n1)) )
=> sum(n0,minus(n5,n1),a_select3(q,X0,X1)) = n1 ) )
=> ( leq(n0,pv10)
& leq(pv10,minus(n135300,n1))
& ! [X2,X3] :
( ( leq(n0,X2)
& leq(X2,minus(n0,n1)) )
=> a_select3(q,pv10,X2) = divide(sqrt(times(minus(a_select3(center,X2,n0),a_select2(x,pv10)),minus(a_select3(center,X2,n0),a_select2(x,pv10)))),sum(n0,minus(n5,n1),sqrt(times(minus(a_select3(center,X3,n0),a_select2(x,pv10)),minus(a_select3(center,X3,n0),a_select2(x,pv10)))))) )
& ! [X4,X5] :
( ( leq(n0,X4)
& leq(X4,minus(pv10,n1)) )
=> sum(n0,minus(n5,n1),a_select3(q,X4,X5)) = n1 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cl5_nebula_norm_0037) ).
fof(f54,negated_conjecture,
~ ( ( leq(n0,pv10)
& leq(pv10,minus(n135300,n1))
& ! [X0,X1] :
( ( leq(n0,X0)
& leq(X0,minus(pv10,n1)) )
=> sum(n0,minus(n5,n1),a_select3(q,X0,X1)) = n1 ) )
=> ( leq(n0,pv10)
& leq(pv10,minus(n135300,n1))
& ! [X2,X3] :
( ( leq(n0,X2)
& leq(X2,minus(n0,n1)) )
=> a_select3(q,pv10,X2) = divide(sqrt(times(minus(a_select3(center,X2,n0),a_select2(x,pv10)),minus(a_select3(center,X2,n0),a_select2(x,pv10)))),sum(n0,minus(n5,n1),sqrt(times(minus(a_select3(center,X3,n0),a_select2(x,pv10)),minus(a_select3(center,X3,n0),a_select2(x,pv10)))))) )
& ! [X4,X5] :
( ( leq(n0,X4)
& leq(X4,minus(pv10,n1)) )
=> sum(n0,minus(n5,n1),a_select3(q,X4,X5)) = n1 ) ) ),
inference(negated_conjecture,[status(cth)],[f53]) ).
fof(f105,plain,
! [X0,X1,X2] :
( leq(X0,X2)
| ~ leq(X0,X1)
| ~ leq(X1,X2) ),
inference(ennf_transformation,[],[f5]) ).
fof(f106,plain,
! [X0,X1,X2] :
( leq(X0,X2)
| ~ leq(X0,X1)
| ~ leq(X1,X2) ),
inference(flattening,[],[f105]) ).
fof(f143,plain,
( ( ~ leq(n0,pv10)
| ~ leq(pv10,minus(n135300,n1))
| ? [X2,X3] :
( a_select3(q,pv10,X2) != divide(sqrt(times(minus(a_select3(center,X2,n0),a_select2(x,pv10)),minus(a_select3(center,X2,n0),a_select2(x,pv10)))),sum(n0,minus(n5,n1),sqrt(times(minus(a_select3(center,X3,n0),a_select2(x,pv10)),minus(a_select3(center,X3,n0),a_select2(x,pv10))))))
& leq(n0,X2)
& leq(X2,minus(n0,n1)) )
| ? [X4,X5] :
( n1 != sum(n0,minus(n5,n1),a_select3(q,X4,X5))
& leq(n0,X4)
& leq(X4,minus(pv10,n1)) ) )
& leq(n0,pv10)
& leq(pv10,minus(n135300,n1))
& ! [X0,X1] :
( sum(n0,minus(n5,n1),a_select3(q,X0,X1)) = n1
| ~ leq(n0,X0)
| ~ leq(X0,minus(pv10,n1)) ) ),
inference(ennf_transformation,[],[f54]) ).
fof(f144,plain,
( ( ~ leq(n0,pv10)
| ~ leq(pv10,minus(n135300,n1))
| ? [X2,X3] :
( a_select3(q,pv10,X2) != divide(sqrt(times(minus(a_select3(center,X2,n0),a_select2(x,pv10)),minus(a_select3(center,X2,n0),a_select2(x,pv10)))),sum(n0,minus(n5,n1),sqrt(times(minus(a_select3(center,X3,n0),a_select2(x,pv10)),minus(a_select3(center,X3,n0),a_select2(x,pv10))))))
& leq(n0,X2)
& leq(X2,minus(n0,n1)) )
| ? [X4,X5] :
( n1 != sum(n0,minus(n5,n1),a_select3(q,X4,X5))
& leq(n0,X4)
& leq(X4,minus(pv10,n1)) ) )
& leq(n0,pv10)
& leq(pv10,minus(n135300,n1))
& ! [X0,X1] :
( sum(n0,minus(n5,n1),a_select3(q,X0,X1)) = n1
| ~ leq(n0,X0)
| ~ leq(X0,minus(pv10,n1)) ) ),
inference(flattening,[],[f143]) ).
fof(f159,plain,
! [X0] : ~ gt(X0,X0),
inference(cnf_transformation,[],[f3]) ).
fof(f161,plain,
! [X2,X0,X1] :
( ~ leq(X0,X1)
| ~ leq(X1,X2)
| leq(X0,X2) ),
inference(cnf_transformation,[],[f106]) ).
fof(f165,plain,
! [X0,X1] :
( gt(X1,X0)
| ~ leq(X0,pred(X1)) ),
inference(cnf_transformation,[],[f10]) ).
fof(f284,plain,
n0 = succ(tptp_minus_1),
inference(cnf_transformation,[],[f28]) ).
fof(f285,plain,
! [X0] : succ(X0) = plus(X0,n1),
inference(cnf_transformation,[],[f29]) ).
fof(f295,plain,
! [X0] : minus(X0,n1) = pred(X0),
inference(cnf_transformation,[],[f39]) ).
fof(f296,plain,
! [X0] : pred(succ(X0)) = X0,
inference(cnf_transformation,[],[f40]) ).
fof(f315,plain,
( n1 != sum(n0,minus(n5,n1),a_select3(q,sK31,sK32))
| leq(sK33,minus(n0,n1))
| ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,pv10) ),
inference(cnf_transformation,[],[f144]) ).
fof(f316,plain,
( n1 != sum(n0,minus(n5,n1),a_select3(q,sK31,sK32))
| leq(n0,sK33)
| ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,pv10) ),
inference(cnf_transformation,[],[f144]) ).
fof(f318,plain,
( leq(n0,sK31)
| leq(sK33,minus(n0,n1))
| ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,pv10) ),
inference(cnf_transformation,[],[f144]) ).
fof(f319,plain,
( leq(n0,sK31)
| leq(n0,sK33)
| ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,pv10) ),
inference(cnf_transformation,[],[f144]) ).
fof(f321,plain,
( leq(sK31,minus(pv10,n1))
| leq(sK33,minus(n0,n1))
| ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,pv10) ),
inference(cnf_transformation,[],[f144]) ).
fof(f322,plain,
( leq(sK31,minus(pv10,n1))
| leq(n0,sK33)
| ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,pv10) ),
inference(cnf_transformation,[],[f144]) ).
fof(f324,plain,
! [X0,X1] :
( ~ leq(X0,minus(pv10,n1))
| ~ leq(n0,X0)
| n1 = sum(n0,minus(n5,n1),a_select3(q,X0,X1)) ),
inference(cnf_transformation,[],[f144]) ).
fof(f325,plain,
leq(pv10,minus(n135300,n1)),
inference(cnf_transformation,[],[f144]) ).
fof(f326,plain,
leq(n0,pv10),
inference(cnf_transformation,[],[f144]) ).
fof(f366,plain,
! [X0,X1] :
( gt(X1,X0)
| ~ leq(X0,minus(X1,n1)) ),
inference(definition_unfolding,[],[f165,f295]) ).
fof(f372,plain,
n0 = plus(tptp_minus_1,n1),
inference(definition_unfolding,[],[f284,f285]) ).
fof(f382,plain,
! [X0] : minus(plus(X0,n1),n1) = X0,
inference(definition_unfolding,[],[f296,f295,f285]) ).
fof(f397,plain,
! [X0] : gt(X0,X0),
inference(consistent_polarity_flipping,[],[f159]) ).
fof(f400,plain,
! [X0,X1] :
( ~ gt(X1,X0)
| ~ leq(X0,minus(X1,n1)) ),
inference(consistent_polarity_flipping,[],[f366]) ).
fof(f487,definition,
( spl35_1
<=> leq(n0,pv10) ),
introduced(definition,[new_symbols(definition,[spl35_1])],[avatar_definition]) ).
fof(f491,definition,
( spl35_2
<=> leq(pv10,minus(n135300,n1)) ),
introduced(definition,[new_symbols(definition,[spl35_2])],[avatar_definition]) ).
fof(f495,definition,
( spl35_3
<=> leq(sK33,minus(n0,n1)) ),
introduced(definition,[new_symbols(definition,[spl35_3])],[avatar_definition]) ).
fof(f497,plain,
( leq(sK33,minus(n0,n1))
| ~ spl35_3 ),
inference(avatar_component_clause,[],[f495]) ).
fof(f499,definition,
( spl35_4
<=> n1 = sum(n0,minus(n5,n1),a_select3(q,sK31,sK32)) ),
introduced(definition,[new_symbols(definition,[spl35_4])],[avatar_definition]) ).
fof(f501,plain,
( n1 != sum(n0,minus(n5,n1),a_select3(q,sK31,sK32))
| spl35_4 ),
inference(avatar_component_clause,[],[f499]) ).
fof(f502,plain,
( ~ spl35_1
| ~ spl35_2
| spl35_3
| ~ spl35_4 ),
inference(avatar_split_clause,[],[f315,f499,f495,f491,f487]) ).
fof(f504,definition,
( spl35_5
<=> leq(n0,sK33) ),
introduced(definition,[new_symbols(definition,[spl35_5])],[avatar_definition]) ).
fof(f506,plain,
( leq(n0,sK33)
| ~ spl35_5 ),
inference(avatar_component_clause,[],[f504]) ).
fof(f507,plain,
( ~ spl35_1
| ~ spl35_2
| spl35_5
| ~ spl35_4 ),
inference(avatar_split_clause,[],[f316,f499,f504,f491,f487]) ).
fof(f514,definition,
( spl35_7
<=> leq(n0,sK31) ),
introduced(definition,[new_symbols(definition,[spl35_7])],[avatar_definition]) ).
fof(f516,plain,
( leq(n0,sK31)
| ~ spl35_7 ),
inference(avatar_component_clause,[],[f514]) ).
fof(f517,plain,
( ~ spl35_1
| ~ spl35_2
| spl35_3
| spl35_7 ),
inference(avatar_split_clause,[],[f318,f514,f495,f491,f487]) ).
fof(f518,plain,
( ~ spl35_1
| ~ spl35_2
| spl35_5
| spl35_7 ),
inference(avatar_split_clause,[],[f319,f514,f504,f491,f487]) ).
fof(f521,definition,
( spl35_8
<=> leq(sK31,minus(pv10,n1)) ),
introduced(definition,[new_symbols(definition,[spl35_8])],[avatar_definition]) ).
fof(f523,plain,
( leq(sK31,minus(pv10,n1))
| ~ spl35_8 ),
inference(avatar_component_clause,[],[f521]) ).
fof(f524,plain,
( ~ spl35_1
| ~ spl35_2
| spl35_3
| spl35_8 ),
inference(avatar_split_clause,[],[f321,f521,f495,f491,f487]) ).
fof(f525,plain,
( ~ spl35_1
| ~ spl35_2
| spl35_5
| spl35_8 ),
inference(avatar_split_clause,[],[f322,f521,f504,f491,f487]) ).
fof(f527,plain,
spl35_2,
inference(avatar_split_clause,[],[f325,f491]) ).
fof(f528,plain,
spl35_1,
inference(avatar_split_clause,[],[f326,f487]) ).
fof(f529,plain,
( ! [X0] :
( ~ leq(n0,sK31)
| n1 = sum(n0,minus(n5,n1),a_select3(q,sK31,X0)) )
| ~ spl35_8 ),
inference(resolution,[],[f324,f523]) ).
fof(f530,plain,
( ! [X0] : n1 = sum(n0,minus(n5,n1),a_select3(q,sK31,X0))
| ~ spl35_7
| ~ spl35_8 ),
inference(forward_subsumption_resolution,[],[f529,f516]) ).
fof(f540,plain,
( $false
| spl35_4
| ~ spl35_7
| ~ spl35_8 ),
inference(backward_subsumption_resolution,[],[f501,f530]) ).
fof(f541,plain,
( spl35_4
| ~ spl35_7
| ~ spl35_8 ),
inference(avatar_contradiction_clause,[],[f540]) ).
fof(f577,plain,
tptp_minus_1 = minus(n0,n1),
inference(superposition,[],[f382,f372]) ).
fof(f594,plain,
! [X0] : ~ leq(X0,minus(X0,n1)),
inference(resolution,[],[f400,f397]) ).
fof(f635,plain,
( ! [X0] :
( ~ leq(sK33,X0)
| leq(n0,X0) )
| ~ spl35_5 ),
inference(resolution,[],[f161,f506]) ).
fof(f653,definition,
( spl35_12
<=> leq(n0,tptp_minus_1) ),
introduced(definition,[new_symbols(definition,[spl35_12])],[avatar_definition]) ).
fof(f4291,plain,
( leq(sK33,tptp_minus_1)
| ~ spl35_3 ),
inference(superposition,[],[f497,f577]) ).
fof(f4323,plain,
( leq(n0,tptp_minus_1)
| ~ spl35_3
| ~ spl35_5 ),
inference(resolution,[],[f4291,f635]) ).
fof(f4356,plain,
( spl35_12
| ~ spl35_3
| ~ spl35_5 ),
inference(avatar_split_clause,[],[f4323,f504,f495,f653]) ).
fof(f4412,plain,
~ leq(n0,tptp_minus_1),
inference(superposition,[],[f594,f577]) ).
fof(f4417,plain,
~ spl35_12,
inference(avatar_split_clause,[],[f4412,f653]) ).
cnf(s1,plain,
( ~ spl35_1
| ~ spl35_2
| spl35_3
| ~ spl35_4 ),
inference(sat_conversion,[],[f502]) ).
cnf(s2,plain,
( ~ spl35_1
| ~ spl35_2
| ~ spl35_4
| spl35_5 ),
inference(sat_conversion,[],[f507]) ).
cnf(s4,plain,
( ~ spl35_1
| ~ spl35_2
| spl35_3
| spl35_7 ),
inference(sat_conversion,[],[f517]) ).
cnf(s5,plain,
( ~ spl35_1
| ~ spl35_2
| spl35_5
| spl35_7 ),
inference(sat_conversion,[],[f518]) ).
cnf(s7,plain,
( ~ spl35_1
| ~ spl35_2
| spl35_3
| spl35_8 ),
inference(sat_conversion,[],[f524]) ).
cnf(s8,plain,
( ~ spl35_1
| ~ spl35_2
| spl35_5
| spl35_8 ),
inference(sat_conversion,[],[f525]) ).
cnf(s10,plain,
spl35_2,
inference(sat_conversion,[],[f527]) ).
cnf(s11,plain,
spl35_1,
inference(sat_conversion,[],[f528]) ).
cnf(s13,plain,
( spl35_4
| ~ spl35_7
| ~ spl35_8 ),
inference(sat_conversion,[],[f541]) ).
cnf(s137,plain,
( ~ spl35_3
| ~ spl35_5
| spl35_12 ),
inference(sat_conversion,[],[f4356]) ).
cnf(s139,plain,
~ spl35_12,
inference(sat_conversion,[],[f4417]) ).
cnf(s141,plain,
( ~ spl35_3
| ~ spl35_5 ),
inference(rat,[],[s137,s139]) ).
cnf(s178,plain,
( spl35_5
| spl35_8 ),
inference(rat,[],[s8,s10,s11]) ).
cnf(s179,plain,
( spl35_3
| spl35_8 ),
inference(rat,[],[s7,s10,s11]) ).
cnf(s181,plain,
( spl35_5
| spl35_7 ),
inference(rat,[],[s5,s10,s11]) ).
cnf(s182,plain,
( spl35_3
| spl35_7 ),
inference(rat,[],[s4,s10,s11]) ).
cnf(s184,plain,
( ~ spl35_4
| spl35_5 ),
inference(rat,[],[s2,s10,s11]) ).
cnf(s185,plain,
( spl35_3
| ~ spl35_4 ),
inference(rat,[],[s1,s10,s11]) ).
cnf(s186,plain,
spl35_3,
inference(rat,[],[s13,s185,s182,s179]) ).
cnf(s187,plain,
~ spl35_5,
inference(rat,[],[s141,s186]) ).
cnf(s188,plain,
spl35_8,
inference(rat,[],[s178,s187]) ).
cnf(s189,plain,
spl35_7,
inference(rat,[],[s181,s187]) ).
cnf(s190,plain,
~ spl35_4,
inference(rat,[],[s184,s187]) ).
cnf(s191,plain,
$false,
inference(rat,[],[s13,s188,s189,s190]) ).
fof(f4419,plain,
$false,
inference(avatar_sat_refutation,[],[s191]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV055+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.18 % Computer : n007.cluster.edu
% 0.09/0.18 % Model : x86_64 x86_64
% 0.09/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.18 % Memory : 8046.5625MB
% 0.09/0.18 % OS : Linux 6.8.0-71-generic
% 0.09/0.18 % CPULimit : 300
% 0.09/0.18 % WCLimit : 300
% 0.09/0.18 % DateTime : Mon Sep 28 09:42:55 UTC 2026
% 0.09/0.18 % CPUTime :
% 0.09/0.18 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.21 Running first-order model finding
% 0.09/0.21 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
% 0.89/0.43 % (2282823)Will run a generic schedule for satisfiability detection.
% 0.89/0.43 % (2282831)dis+10_1_sil=32000:sp=arity:random_seed=2198567292:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.89/0.43 % (2282829)% WARNING: option uhcvi not known.
% 0.89/0.43 % (2282829)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=204789006:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.89/0.43 % (2282828)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1865833569_2999 on theBenchmark for (2999ds/0Mi)
% 0.89/0.43 % (2282830)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=4008009157:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.89/0.43 % (2282832)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2335278499:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.89/0.43 % (2282833)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3820583801:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.89/0.43 % (2282834)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2876645180:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.89/0.43 % (2282831)Instruction limit reached!
% 0.89/0.43 % (2282831)------------------------------
% 0.89/0.43 % (2282831)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.89/0.43 % (2282831)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.89/0.43 % (2282831)CaDiCaL version: 2.1.3
% 0.89/0.43 % (2282831)Termination reason: Instruction limit
% 0.89/0.43 % (2282831)Termination phase: Saturation
% 0.89/0.43 % (2282831)Time elapsed: 0.031 s
% 0.89/0.43 % (2282831)Peak memory usage: 12 MB
% 0.89/0.43 % (2282831)Instructions burned: 106 (million)
% 0.89/0.43 % (2282842)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=3850855443:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.89/0.43 % TRYING [1]
% 0.89/0.43 % TRYING [2]
% 0.89/0.43 % TRYING [1]
% 0.89/0.43 % TRYING [2]
% 0.89/0.43 % TRYING [3]
% 0.89/0.43 % TRYING [3]
% 0.89/0.43 % (2282832)Instruction limit reached!
% 0.89/0.43 % (2282832)------------------------------
% 0.89/0.43 % (2282832)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.89/0.43 % (2282832)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.89/0.43 % (2282832)CaDiCaL version: 2.1.3
% 0.89/0.43 % (2282832)Termination reason: Instruction limit
% 0.89/0.43 % (2282832)Termination phase: Saturation
% 0.89/0.43 % (2282832)Time elapsed: 0.067 s
% 0.89/0.43 % (2282832)Peak memory usage: 13 MB
% 0.89/0.43 % (2282832)Instructions burned: 116 (million)
% 0.89/0.43 % TRYING [4]
% 0.89/0.43 % (2282833)Instruction limit reached!
% 0.89/0.43 % (2282833)------------------------------
% 0.89/0.43 % (2282833)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.89/0.43 % (2282833)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.89/0.43 % (2282833)CaDiCaL version: 2.1.3
% 0.89/0.43 % (2282833)Termination reason: Instruction limit
% 0.89/0.43 % (2282833)Termination phase: Saturation
% 0.89/0.43 % (2282833)Time elapsed: 0.080 s
% 0.89/0.43 % (2282833)Peak memory usage: 13 MB
% 0.89/0.43 % (2282833)Instructions burned: 132 (million)
% 0.89/0.43 % (2282844)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=1135100779:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 0.89/0.43 % (2282834)Instruction limit reached!
% 0.89/0.43 % (2282834)------------------------------
% 0.89/0.43 % (2282834)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.89/0.43 % (2282834)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.89/0.43 % (2282834)CaDiCaL version: 2.1.3
% 0.89/0.43 % (2282834)Termination reason: Instruction limit
% 0.89/0.43 % (2282834)Termination phase: Saturation
% 0.89/0.43 % (2282834)Time elapsed: 0.095 s
% 0.89/0.43 % (2282834)Peak memory usage: 14 MB
% 0.89/0.43 % (2282834)Instructions burned: 159 (million)
% 0.89/0.43 % (2282845)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=1973016484:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 0.89/0.43 % (2282850)ott-21_1_sil=16000:fs=off:random_seed=1401015918:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 0.89/0.43 % (2282829) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2282823-2282829"...
% 0.89/0.43 % (2282829)...printing done.
% 0.89/0.43 % (2282829)Refutation found. Thanks to Tanya!
% 0.89/0.43 % SZS status Theorem for theBenchmark
% 0.89/0.43 % SZS output start Proof for theBenchmark
% See solution above
% 0.89/0.44 % (2282829)------------------------------
% 0.89/0.44 % (2282829)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.89/0.44 % (2282829)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.89/0.44 % (2282829)CaDiCaL version: 2.1.3
% 0.89/0.44 % (2282829)Termination reason: Refutation
% 0.89/0.44 % (2282829)Time elapsed: 0.160 s
% 0.89/0.44 % (2282829)Peak memory usage: 15 MB
% 0.89/0.44 % (2282829)Instructions burned: 282 (million)
% 0.89/0.44 % (2282823)Success in time 0.212 s
% 0.89/0.44 % Vampire exiting
%------------------------------------------------------------------------------