%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU280+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n008.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 12:48:08 PM UTC 2026
% Result : Theorem 3.37s 1.35s
% Output : Refutation 3.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 11
% Syntax : Number of formulae : 85 ( 6 unt; 9 def)
% Number of atoms : 315 ( 58 equ)
% Maximal formula atoms : 9 ( 3 avg)
% Number of connectives : 374 ( 144 ~; 152 |; 58 &)
% ( 15 <=>; 4 =>; 0 <=; 1 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 13 ( 11 usr; 10 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 107 ( 0 sgn 70 !; 37 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
! [X0] :
? [X1] :
! [X2] :
( in(X2,X1)
<=> ( in(X2,X0)
& ordinal(X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',s1_xboole_0__e6_22__wellord2) ).
fof(f2,negated_conjecture,
~ ! [X0] :
? [X1] :
! [X2] :
( in(X2,X1)
<=> ( in(X2,X0)
& ordinal(X2) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
fof(f7,axiom,
! [X0] :
( ! [X1,X2,X3] :
( ( X1 = X2
& ordinal(X2)
& X1 = X3
& ordinal(X3) )
=> X2 = X3 )
=> ? [X1] :
! [X2] :
( in(X2,X1)
<=> ? [X3] :
( in(X3,X0)
& X3 = X2
& ordinal(X2) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',s1_tarski__e6_22__wellord2__1) ).
fof(f8,plain,
! [X0] :
( ! [X1,X2,X3] :
( ( X1 = X2
& ordinal(X2)
& X1 = X3
& ordinal(X3) )
=> X2 = X3 )
=> ? [X4] :
! [X5] :
( in(X5,X4)
<=> ? [X6] :
( in(X6,X0)
& X5 = X6
& ordinal(X5) ) ) ),
inference(rectify,[],[f7]) ).
fof(f9,plain,
? [X0] :
! [X1] :
? [X2] :
( in(X2,X1)
<~> ( in(X2,X0)
& ordinal(X2) ) ),
inference(ennf_transformation,[],[f2]) ).
fof(f10,plain,
! [X0] :
( ? [X4] :
! [X5] :
( in(X5,X4)
<=> ? [X6] :
( in(X6,X0)
& X5 = X6
& ordinal(X5) ) )
| ? [X1,X2,X3] :
( X2 != X3
& X1 = X2
& ordinal(X2)
& X1 = X3
& ordinal(X3) ) ),
inference(ennf_transformation,[],[f8]) ).
fof(f11,plain,
! [X0] :
( ? [X4] :
! [X5] :
( in(X5,X4)
<=> ? [X6] :
( in(X6,X0)
& X5 = X6
& ordinal(X5) ) )
| ? [X1,X2,X3] :
( X2 != X3
& X1 = X2
& ordinal(X2)
& X1 = X3
& ordinal(X3) ) ),
inference(flattening,[],[f10]) ).
fof(f16,definition,
( ? [X1,X2,X3] :
( X2 != X3
& X1 = X2
& ordinal(X2)
& X1 = X3
& ordinal(X3) )
| ~ sP0 ),
introduced(definition,[new_symbols(definition,[sP0])],[predicate_definition_introduction]) ).
fof(f17,plain,
! [X0] :
( ? [X4] :
! [X5] :
( in(X5,X4)
<=> ? [X6] :
( in(X6,X0)
& X5 = X6
& ordinal(X5) ) )
| sP0 ),
inference(definition_folding,[],[f11,f16]) ).
fof(f18,plain,
? [X0] :
! [X1] :
? [X2] :
( ( ~ in(X2,X0)
| ~ ordinal(X2)
| ~ in(X2,X1) )
& ( ( in(X2,X0)
& ordinal(X2) )
| in(X2,X1) ) ),
inference(nnf_transformation,[],[f9]) ).
fof(f19,plain,
? [X0] :
! [X1] :
? [X2] :
( ( ~ in(X2,X0)
| ~ ordinal(X2)
| ~ in(X2,X1) )
& ( ( in(X2,X0)
& ordinal(X2) )
| in(X2,X1) ) ),
inference(flattening,[],[f18]) ).
fof(f20,plain,
! [X1] :
( ( ~ in(sK2(X1),sK1)
| ~ ordinal(sK2(X1))
| ~ in(sK2(X1),X1) )
& ( ( in(sK2(X1),sK1)
& ordinal(sK2(X1)) )
| in(sK2(X1),X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2]),skolemize(X0,sK1),skolemize(X2,sK2(X1))],[f19]) ).
fof(f21,plain,
( ? [X1,X2,X3] :
( X2 != X3
& X1 = X2
& ordinal(X2)
& X1 = X3
& ordinal(X3) )
| ~ sP0 ),
inference(nnf_transformation,[],[f16]) ).
fof(f22,plain,
( ? [X0,X1,X2] :
( X1 != X2
& X0 = X1
& ordinal(X1)
& X0 = X2
& ordinal(X2) )
| ~ sP0 ),
inference(rectify,[],[f21]) ).
fof(f23,plain,
( ( sK4 != sK5
& sK3 = sK4
& ordinal(sK4)
& sK3 = sK5
& ordinal(sK5) )
| ~ sP0 ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3,sK4,sK5]),skolemize(X0,sK3),skolemize(X1,sK4),skolemize(X2,sK5)],[f22]) ).
fof(f24,plain,
! [X0] :
( ? [X4] :
! [X5] :
( ( in(X5,X4)
| ! [X6] :
( ~ in(X6,X0)
| X5 != X6
| ~ ordinal(X5) ) )
& ( ? [X6] :
( in(X6,X0)
& X5 = X6
& ordinal(X5) )
| ~ in(X5,X4) ) )
| sP0 ),
inference(nnf_transformation,[],[f17]) ).
fof(f25,plain,
! [X0] :
( ? [X1] :
! [X2] :
( ( in(X2,X1)
| ! [X3] :
( ~ in(X3,X0)
| X2 != X3
| ~ ordinal(X2) ) )
& ( ? [X4] :
( in(X4,X0)
& X2 = X4
& ordinal(X2) )
| ~ in(X2,X1) ) )
| sP0 ),
inference(rectify,[],[f24]) ).
fof(f26,plain,
! [X0] :
( ! [X2] :
( ( in(X2,sK6(X0))
| ! [X3] :
( ~ in(X3,X0)
| X2 != X3
| ~ ordinal(X2) ) )
& ( ( in(sK7(X0,X2),X0)
& sK7(X0,X2) = X2
& ordinal(X2) )
| ~ in(X2,sK6(X0)) ) )
| sP0 ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK6,sK7]),skolemize(X1,sK6(X0)),skolemize(X4,sK7(X0,X2))],[f25]) ).
fof(f28,plain,
! [X1] :
( in(sK2(X1),X1)
| ordinal(sK2(X1)) ),
inference(cnf_transformation,[],[f20]) ).
fof(f29,plain,
! [X1] :
( in(sK2(X1),sK1)
| in(sK2(X1),X1) ),
inference(cnf_transformation,[],[f20]) ).
fof(f30,plain,
! [X1] :
( ~ in(sK2(X1),sK1)
| ~ ordinal(sK2(X1))
| ~ in(sK2(X1),X1) ),
inference(cnf_transformation,[],[f20]) ).
fof(f32,plain,
( sK3 = sK5
| ~ sP0 ),
inference(cnf_transformation,[],[f23]) ).
fof(f34,plain,
( sK3 = sK4
| ~ sP0 ),
inference(cnf_transformation,[],[f23]) ).
fof(f35,plain,
( sK4 != sK5
| ~ sP0 ),
inference(cnf_transformation,[],[f23]) ).
fof(f36,plain,
! [X2,X0] :
( ordinal(X2)
| ~ in(X2,sK6(X0))
| sP0 ),
inference(cnf_transformation,[],[f26]) ).
fof(f37,plain,
! [X2,X0] :
( sK7(X0,X2) = X2
| ~ in(X2,sK6(X0))
| sP0 ),
inference(cnf_transformation,[],[f26]) ).
fof(f38,plain,
! [X2,X0] :
( in(sK7(X0,X2),X0)
| ~ in(X2,sK6(X0))
| sP0 ),
inference(cnf_transformation,[],[f26]) ).
fof(f39,plain,
! [X2,X3,X0] :
( in(X2,sK6(X0))
| ~ in(X3,X0)
| X2 != X3
| ~ ordinal(X2)
| sP0 ),
inference(cnf_transformation,[],[f26]) ).
fof(f47,plain,
! [X3,X0] :
( in(X3,sK6(X0))
| ~ in(X3,X0)
| ~ ordinal(X3)
| sP0 ),
inference(equality_resolution,[],[f39]) ).
fof(f49,definition,
( spl9_1
<=> sP0 ),
introduced(definition,[new_symbols(definition,[spl9_1])],[avatar_definition]) ).
fof(f53,definition,
( spl9_2
<=> ! [X2,X0] :
( ordinal(X2)
| ~ in(X2,sK6(X0)) ) ),
introduced(definition,[new_symbols(definition,[spl9_2])],[avatar_definition]) ).
fof(f54,plain,
( ! [X2,X0] :
( ~ in(X2,sK6(X0))
| ordinal(X2) )
| ~ spl9_2 ),
inference(avatar_component_clause,[],[f53]) ).
fof(f55,plain,
( spl9_1
| spl9_2 ),
inference(avatar_split_clause,[],[f36,f53,f49]) ).
fof(f57,definition,
( spl9_3
<=> ! [X2,X0] :
( sK7(X0,X2) = X2
| ~ in(X2,sK6(X0)) ) ),
introduced(definition,[new_symbols(definition,[spl9_3])],[avatar_definition]) ).
fof(f58,plain,
( ! [X2,X0] :
( ~ in(X2,sK6(X0))
| sK7(X0,X2) = X2 )
| ~ spl9_3 ),
inference(avatar_component_clause,[],[f57]) ).
fof(f59,plain,
( spl9_1
| spl9_3 ),
inference(avatar_split_clause,[],[f37,f57,f49]) ).
fof(f61,definition,
( spl9_4
<=> ! [X2,X0] :
( in(sK7(X0,X2),X0)
| ~ in(X2,sK6(X0)) ) ),
introduced(definition,[new_symbols(definition,[spl9_4])],[avatar_definition]) ).
fof(f62,plain,
( ! [X2,X0] :
( in(sK7(X0,X2),X0)
| ~ in(X2,sK6(X0)) )
| ~ spl9_4 ),
inference(avatar_component_clause,[],[f61]) ).
fof(f63,plain,
( spl9_1
| spl9_4 ),
inference(avatar_split_clause,[],[f38,f61,f49]) ).
fof(f65,definition,
( spl9_5
<=> ! [X0,X3] :
( in(X3,sK6(X0))
| ~ ordinal(X3)
| ~ in(X3,X0) ) ),
introduced(definition,[new_symbols(definition,[spl9_5])],[avatar_definition]) ).
fof(f66,plain,
( ! [X3,X0] :
( in(X3,sK6(X0))
| ~ ordinal(X3)
| ~ in(X3,X0) )
| ~ spl9_5 ),
inference(avatar_component_clause,[],[f65]) ).
fof(f67,plain,
( spl9_1
| spl9_5 ),
inference(avatar_split_clause,[],[f47,f65,f49]) ).
fof(f74,definition,
( spl9_7
<=> sK3 = sK5 ),
introduced(definition,[new_symbols(definition,[spl9_7])],[avatar_definition]) ).
fof(f76,plain,
( sK3 = sK5
| ~ spl9_7 ),
inference(avatar_component_clause,[],[f74]) ).
fof(f77,plain,
( ~ spl9_1
| spl9_7 ),
inference(avatar_split_clause,[],[f32,f74,f49]) ).
fof(f84,definition,
( spl9_9
<=> sK3 = sK4 ),
introduced(definition,[new_symbols(definition,[spl9_9])],[avatar_definition]) ).
fof(f86,plain,
( sK3 = sK4
| ~ spl9_9 ),
inference(avatar_component_clause,[],[f84]) ).
fof(f87,plain,
( ~ spl9_1
| spl9_9 ),
inference(avatar_split_clause,[],[f34,f84,f49]) ).
fof(f89,definition,
( spl9_10
<=> sK4 = sK5 ),
introduced(definition,[new_symbols(definition,[spl9_10])],[avatar_definition]) ).
fof(f91,plain,
( sK4 != sK5
| spl9_10 ),
inference(avatar_component_clause,[],[f89]) ).
fof(f92,plain,
( ~ spl9_1
| ~ spl9_10 ),
inference(avatar_split_clause,[],[f35,f89,f49]) ).
fof(f106,plain,
( ! [X0] :
( ordinal(sK2(sK6(X0)))
| ordinal(sK2(sK6(X0))) )
| ~ spl9_2 ),
inference(resolution,[],[f54,f28]) ).
fof(f107,plain,
( ! [X0] : ordinal(sK2(sK6(X0)))
| ~ spl9_2 ),
inference(duplicate_literal_removal,[],[f106]) ).
fof(f110,plain,
( ! [X0] :
( in(sK2(sK6(X0)),sK1)
| sK2(sK6(X0)) = sK7(X0,sK2(sK6(X0))) )
| ~ spl9_3 ),
inference(resolution,[],[f58,f29]) ).
fof(f116,plain,
( ! [X0,X1] :
( ~ in(X0,X1)
| ~ ordinal(X0)
| sK7(X1,X0) = X0 )
| ~ spl9_3
| ~ spl9_5 ),
inference(resolution,[],[f66,f58]) ).
fof(f131,plain,
( ! [X0] :
( ~ ordinal(sK2(sK6(X0)))
| sK2(sK6(X0)) = sK7(sK1,sK2(sK6(X0)))
| sK2(sK6(X0)) = sK7(X0,sK2(sK6(X0))) )
| ~ spl9_3
| ~ spl9_5 ),
inference(resolution,[],[f116,f110]) ).
fof(f135,plain,
( ! [X0] :
( sK2(sK6(X0)) = sK7(sK1,sK2(sK6(X0)))
| sK2(sK6(X0)) = sK7(X0,sK2(sK6(X0))) )
| ~ spl9_2
| ~ spl9_3
| ~ spl9_5 ),
inference(forward_subsumption_resolution,[],[f131,f107]) ).
fof(f162,plain,
( sK2(sK6(sK1)) != sK2(sK6(sK1))
| sK2(sK6(sK1)) = sK7(sK1,sK2(sK6(sK1)))
| ~ spl9_2
| ~ spl9_3
| ~ spl9_5 ),
inference(equality_factoring,[],[f135]) ).
fof(f163,plain,
( sK2(sK6(sK1)) = sK7(sK1,sK2(sK6(sK1)))
| ~ spl9_2
| ~ spl9_3
| ~ spl9_5 ),
inference(trivial_inequality_removal,[],[f162]) ).
fof(f168,plain,
( in(sK2(sK6(sK1)),sK1)
| ~ in(sK2(sK6(sK1)),sK6(sK1))
| ~ spl9_2
| ~ spl9_3
| ~ spl9_4
| ~ spl9_5 ),
inference(superposition,[],[f62,f163]) ).
fof(f169,plain,
( in(sK2(sK6(sK1)),sK1)
| ~ spl9_2
| ~ spl9_3
| ~ spl9_4
| ~ spl9_5 ),
inference(forward_subsumption_resolution,[],[f168,f29]) ).
fof(f174,plain,
( ~ ordinal(sK2(sK6(sK1)))
| ~ in(sK2(sK6(sK1)),sK6(sK1))
| ~ spl9_2
| ~ spl9_3
| ~ spl9_4
| ~ spl9_5 ),
inference(resolution,[],[f169,f30]) ).
fof(f177,plain,
( ~ in(sK2(sK6(sK1)),sK6(sK1))
| ~ spl9_2
| ~ spl9_3
| ~ spl9_4
| ~ spl9_5 ),
inference(forward_subsumption_resolution,[],[f174,f54]) ).
fof(f201,plain,
( ~ ordinal(sK2(sK6(sK1)))
| ~ in(sK2(sK6(sK1)),sK1)
| ~ spl9_2
| ~ spl9_3
| ~ spl9_4
| ~ spl9_5 ),
inference(resolution,[],[f177,f66]) ).
fof(f202,plain,
( ~ in(sK2(sK6(sK1)),sK1)
| ~ spl9_2
| ~ spl9_3
| ~ spl9_4
| ~ spl9_5 ),
inference(forward_subsumption_resolution,[],[f201,f107]) ).
fof(f203,plain,
( $false
| ~ spl9_2
| ~ spl9_3
| ~ spl9_4
| ~ spl9_5 ),
inference(forward_subsumption_resolution,[],[f202,f169]) ).
fof(f204,plain,
( ~ spl9_2
| ~ spl9_3
| ~ spl9_4
| ~ spl9_5 ),
inference(avatar_contradiction_clause,[],[f203]) ).
fof(f205,plain,
( sK3 != sK4
| ~ spl9_7
| spl9_10 ),
inference(forward_demodulation,[],[f91,f76]) ).
fof(f206,plain,
( $false
| ~ spl9_7
| ~ spl9_9
| spl9_10 ),
inference(forward_subsumption_resolution,[],[f205,f86]) ).
fof(f207,plain,
( ~ spl9_7
| ~ spl9_9
| spl9_10 ),
inference(avatar_contradiction_clause,[],[f206]) ).
cnf(s1,plain,
( spl9_1
| spl9_2 ),
inference(sat_conversion,[],[f55]) ).
cnf(s2,plain,
( spl9_1
| spl9_3 ),
inference(sat_conversion,[],[f59]) ).
cnf(s3,plain,
( spl9_1
| spl9_4 ),
inference(sat_conversion,[],[f63]) ).
cnf(s4,plain,
( spl9_1
| spl9_5 ),
inference(sat_conversion,[],[f67]) ).
cnf(s6,plain,
( ~ spl9_1
| spl9_7 ),
inference(sat_conversion,[],[f77]) ).
cnf(s8,plain,
( ~ spl9_1
| spl9_9 ),
inference(sat_conversion,[],[f87]) ).
cnf(s9,plain,
( ~ spl9_1
| ~ spl9_10 ),
inference(sat_conversion,[],[f92]) ).
cnf(s10,plain,
( ~ spl9_2
| ~ spl9_3
| ~ spl9_4
| ~ spl9_5 ),
inference(sat_conversion,[],[f204]) ).
cnf(s11,plain,
( ~ spl9_7
| ~ spl9_9
| spl9_10 ),
inference(sat_conversion,[],[f207]) ).
cnf(s12,plain,
spl9_1,
inference(rat,[],[s10,s1,s2,s3,s4]) ).
cnf(s13,plain,
~ spl9_10,
inference(rat,[],[s9,s12]) ).
cnf(s14,plain,
spl9_9,
inference(rat,[],[s8,s12]) ).
cnf(s16,plain,
spl9_7,
inference(rat,[],[s6,s12]) ).
cnf(s18,plain,
$false,
inference(rat,[],[s11,s13,s14,s16]) ).
fof(f208,plain,
$false,
inference(avatar_sat_refutation,[],[s18]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU280+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.38 % Computer : n008.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Mon Sep 28 04:28:54 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/0.42 Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.54/1.26 % (1873700)Detected formulas, will run a generic FOF schedule.
% 2.54/1.26 % (1873811)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2358231288:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.54/1.26 % (1873807)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=3197707757:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.54/1.26 % (1873813)dis-21_1_sil=8000:lcm=predicate:random_seed=3286395907: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)
% 2.54/1.26 % (1873802)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=733571840:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.54/1.26 % (1873804)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=755472936:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.54/1.26 % (1873805)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=509389053:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.54/1.26 % (1873807)Refutation not found, incomplete strategy
% 2.54/1.26 % (1873807)------------------------------
% 2.54/1.26 % (1873807)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.54/1.26 % (1873807)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.54/1.26 % (1873807)CaDiCaL version: 2.1.3
% 2.54/1.26 % (1873807)Termination reason: Refutation not found, incomplete strategy
% 2.54/1.26 % (1873807)Time elapsed: 0.001 s
% 2.54/1.26 % (1873807)Peak memory usage: 88 MB
% 2.54/1.26 % (1873809)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=4058041070:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.54/1.26 % (1873809)Refutation not found, incomplete strategy
% 2.54/1.26 % (1873809)------------------------------
% 2.54/1.26 % (1873809)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.54/1.26 % (1873809)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.54/1.26 % (1873809)CaDiCaL version: 2.1.3
% 2.54/1.26 % (1873809)Termination reason: Refutation not found, incomplete strategy
% 2.54/1.26 % (1873809)Time elapsed: 0.001 s
% 2.54/1.26 % (1873809)Peak memory usage: 88 MB
% 2.54/1.26 % (1873811)Instruction limit reached!
% 2.54/1.26 % (1873811)------------------------------
% 2.54/1.26 % (1873811)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.54/1.26 % (1873811)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.54/1.26 % (1873811)CaDiCaL version: 2.1.3
% 2.54/1.26 % (1873811)Termination reason: Instruction limit
% 2.54/1.26 % (1873811)Termination phase: Saturation
% 2.54/1.26 % (1873811)Time elapsed: 0.050 s
% 2.54/1.26 % (1873811)Peak memory usage: 89 MB
% 2.54/1.26 % (1873811)Instructions burned: 142 (million)
% 2.54/1.26 % (1873813)Instruction limit reached!
% 2.54/1.26 % (1873813)------------------------------
% 2.54/1.26 % (1873813)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.54/1.26 % (1873813)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.54/1.26 % (1873813)CaDiCaL version: 2.1.3
% 2.54/1.26 % (1873813)Termination reason: Instruction limit
% 2.54/1.26 % (1873813)Termination phase: Saturation
% 2.54/1.26 % (1873813)Time elapsed: 0.063 s
% 2.54/1.26 % (1873813)Peak memory usage: 88 MB
% 2.54/1.26 % (1873813)Instructions burned: 129 (million)
% 2.54/1.26 % (1873832)lrs+10_1_sil=8000:sp=occurrence:random_seed=2338750807:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 2.54/1.26 % (1873832)First to succeed.
% 2.54/1.26 % (1873832)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-1873700"
% 2.54/1.26 % (1873833)lrs+10_1_sil=32000:urr=on:br=off:random_seed=2715612744:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/157Mi)
% 2.54/1.26 % (1873833)Refutation not found, incomplete strategy
% 2.54/1.26 % (1873833)------------------------------
% 2.54/1.26 % (1873833)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.54/1.26 % (1873833)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.54/1.26 % (1873833)CaDiCaL version: 2.1.3
% 2.54/1.26 % (1873833)Termination reason: Refutation not found, incomplete strategy
% 3.37/1.35 % (1873833)Time elapsed: 0.002 s
% 3.37/1.35 % (1873833)Peak memory usage: 89 MB
% 3.37/1.35 % (1873833)Instructions burned: 1 (million)
% 3.37/1.35 % (1873807)------------------------------
% 3.37/1.35 % (1873807)------------------------------
% 3.37/1.35 % (1873809)------------------------------
% 3.37/1.35 % (1873809)------------------------------
% 3.37/1.35 % (1873832)Refutation found. Thanks to Tanya!
% 3.37/1.35 % SZS status Theorem for theBenchmark
% 3.37/1.35 % SZS output start Proof for theBenchmark
% See solution above
% 3.37/1.35 % (1873832)------------------------------
% 3.37/1.35 % (1873832)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.37/1.35 % (1873832)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.37/1.35 % (1873832)CaDiCaL version: 2.1.3
% 3.37/1.35 % (1873832)Termination reason: Refutation
% 3.37/1.35 % (1873832)Time elapsed: 0.004 s
% 3.37/1.35 % (1873832)Peak memory usage: 90 MB
% 3.37/1.35 % (1873832)Instructions burned: 7 (million)
% 3.37/1.35 % (1873832)------------------------------
% 3.37/1.35 % (1873832)------------------------------
% 3.37/1.35 % (1873700)Success in time 0.397 s
% 3.37/1.35 % Vampire exiting
%------------------------------------------------------------------------------