%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : PRO010+4 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n013.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:30:25 PM UTC 2026
% Result : Theorem 2.79s 1.34s
% Output : Refutation 3.96s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 15
% Syntax : Number of formulae : 88 ( 16 unt; 9 def)
% Number of atoms : 248 ( 7 equ)
% Maximal formula atoms : 9 ( 2 avg)
% Number of connectives : 261 ( 101 ~; 89 |; 53 &)
% ( 8 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 17 ( 15 usr; 8 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 6 con; 0-3 aty)
% Number of variables : 118 ( 0 sgn 93 !; 25 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f7,axiom,
! [X0,X1,X2] :
( min_precedes(X1,X2,X0)
=> ? [X3] :
( occurrence_of(X3,X0)
& subactivity_occurrence(X1,X3)
& subactivity_occurrence(X2,X3) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_06) ).
fof(f9,axiom,
! [X0,X1,X2] :
( ( occurrence_of(X0,X1)
& occurrence_of(X0,X2) )
=> X1 = X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_08) ).
fof(f10,axiom,
! [X0,X1,X2] :
( ( occurrence_of(X0,X2)
& leaf_occ(X1,X0) )
=> ~ ? [X3] : min_precedes(X1,X3,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_09) ).
fof(f33,axiom,
! [X0] :
( occurrence_of(X0,tptp0)
=> ? [X1,X2,X3] :
( occurrence_of(X1,tptp3)
& root_occ(X1,X0)
& occurrence_of(X2,tptp4)
& next_subocc(X1,X2,tptp0)
& ( occurrence_of(X3,tptp1)
| occurrence_of(X3,tptp2) )
& next_subocc(X2,X3,tptp0)
& leaf_occ(X3,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_32) ).
fof(f45,axiom,
tptp1 != tptp2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_44) ).
fof(f46,conjecture,
! [X0] :
( occurrence_of(X0,tptp0)
=> ? [X1,X2] :
( leaf_occ(X2,X0)
& ( occurrence_of(X2,tptp1)
=> ~ ? [X3] :
( occurrence_of(X3,tptp2)
& min_precedes(X1,X3,tptp0) ) )
& ( occurrence_of(X2,tptp2)
=> ~ ? [X4] :
( occurrence_of(X4,tptp1)
& min_precedes(X1,X4,tptp0) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(f47,negated_conjecture,
~ ! [X0] :
( occurrence_of(X0,tptp0)
=> ? [X1,X2] :
( leaf_occ(X2,X0)
& ( occurrence_of(X2,tptp1)
=> ~ ? [X3] :
( occurrence_of(X3,tptp2)
& min_precedes(X1,X3,tptp0) ) )
& ( occurrence_of(X2,tptp2)
=> ~ ? [X4] :
( occurrence_of(X4,tptp1)
& min_precedes(X1,X4,tptp0) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f46]) ).
fof(f64,plain,
! [X0,X1,X2] :
( ? [X3] :
( occurrence_of(X3,X0)
& subactivity_occurrence(X1,X3)
& subactivity_occurrence(X2,X3) )
| ~ min_precedes(X1,X2,X0) ),
inference(ennf_transformation,[],[f7]) ).
fof(f67,plain,
! [X0,X1,X2] :
( X1 = X2
| ~ occurrence_of(X0,X1)
| ~ occurrence_of(X0,X2) ),
inference(ennf_transformation,[],[f9]) ).
fof(f68,plain,
! [X0,X1,X2] :
( X1 = X2
| ~ occurrence_of(X0,X1)
| ~ occurrence_of(X0,X2) ),
inference(flattening,[],[f67]) ).
fof(f69,plain,
! [X0,X1,X2] :
( ! [X3] : ~ min_precedes(X1,X3,X2)
| ~ occurrence_of(X0,X2)
| ~ leaf_occ(X1,X0) ),
inference(ennf_transformation,[],[f10]) ).
fof(f70,plain,
! [X0,X1,X2] :
( ! [X3] : ~ min_precedes(X1,X3,X2)
| ~ occurrence_of(X0,X2)
| ~ leaf_occ(X1,X0) ),
inference(flattening,[],[f69]) ).
fof(f96,plain,
! [X0] :
( ? [X1,X2,X3] :
( occurrence_of(X1,tptp3)
& root_occ(X1,X0)
& occurrence_of(X2,tptp4)
& next_subocc(X1,X2,tptp0)
& ( occurrence_of(X3,tptp1)
| occurrence_of(X3,tptp2) )
& next_subocc(X2,X3,tptp0)
& leaf_occ(X3,X0) )
| ~ occurrence_of(X0,tptp0) ),
inference(ennf_transformation,[],[f33]) ).
fof(f97,plain,
? [X0] :
( ! [X1,X2] :
( ~ leaf_occ(X2,X0)
| ( ? [X3] :
( occurrence_of(X3,tptp2)
& min_precedes(X1,X3,tptp0) )
& occurrence_of(X2,tptp1) )
| ( ? [X4] :
( occurrence_of(X4,tptp1)
& min_precedes(X1,X4,tptp0) )
& occurrence_of(X2,tptp2) ) )
& occurrence_of(X0,tptp0) ),
inference(ennf_transformation,[],[f47]) ).
fof(f98,definition,
! [X1,X2] :
( ( ? [X4] :
( occurrence_of(X4,tptp1)
& min_precedes(X1,X4,tptp0) )
& occurrence_of(X2,tptp2) )
| ~ sP0(X1,X2) ),
introduced(definition,[new_symbols(definition,[sP0])],[predicate_definition_introduction]) ).
fof(f99,plain,
? [X0] :
( ! [X1,X2] :
( ~ leaf_occ(X2,X0)
| ( ? [X3] :
( occurrence_of(X3,tptp2)
& min_precedes(X1,X3,tptp0) )
& occurrence_of(X2,tptp1) )
| sP0(X1,X2) )
& occurrence_of(X0,tptp0) ),
inference(definition_folding,[],[f97,f98]) ).
fof(f102,plain,
! [X0,X1,X2] :
( ( occurrence_of(sK3(X0,X1,X2),X0)
& subactivity_occurrence(X1,sK3(X0,X1,X2))
& subactivity_occurrence(X2,sK3(X0,X1,X2)) )
| ~ min_precedes(X1,X2,X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(X3,sK3(X0,X1,X2))],[f64]) ).
fof(f124,plain,
! [X0] :
( ( occurrence_of(sK13(X0),tptp3)
& root_occ(sK13(X0),X0)
& occurrence_of(sK14(X0),tptp4)
& next_subocc(sK13(X0),sK14(X0),tptp0)
& ( occurrence_of(sK15(X0),tptp1)
| occurrence_of(sK15(X0),tptp2) )
& next_subocc(sK14(X0),sK15(X0),tptp0)
& leaf_occ(sK15(X0),X0) )
| ~ occurrence_of(X0,tptp0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK13,sK14,sK15]),skolemize(X1,sK13(X0)),skolemize(X2,sK14(X0)),skolemize(X3,sK15(X0))],[f96]) ).
fof(f125,plain,
! [X1,X2] :
( ( ? [X4] :
( occurrence_of(X4,tptp1)
& min_precedes(X1,X4,tptp0) )
& occurrence_of(X2,tptp2) )
| ~ sP0(X1,X2) ),
inference(nnf_transformation,[],[f98]) ).
fof(f126,plain,
! [X0,X1] :
( ( ? [X2] :
( occurrence_of(X2,tptp1)
& min_precedes(X0,X2,tptp0) )
& occurrence_of(X1,tptp2) )
| ~ sP0(X0,X1) ),
inference(rectify,[],[f125]) ).
fof(f127,plain,
! [X0,X1] :
( ( occurrence_of(sK16(X0),tptp1)
& min_precedes(X0,sK16(X0),tptp0)
& occurrence_of(X1,tptp2) )
| ~ sP0(X0,X1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK16]),skolemize(X2,sK16(X0))],[f126]) ).
fof(f128,plain,
( ! [X1,X2] :
( ~ leaf_occ(X2,sK17)
| ( occurrence_of(sK18(X1),tptp2)
& min_precedes(X1,sK18(X1),tptp0)
& occurrence_of(X2,tptp1) )
| sP0(X1,X2) )
& occurrence_of(sK17,tptp0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK17,sK18]),skolemize(X0,sK17),skolemize(X3,sK18(X1))],[f99]) ).
fof(f138,plain,
! [X2,X0,X1] :
( ~ min_precedes(X1,X2,X0)
| occurrence_of(sK3(X0,X1,X2),X0) ),
inference(cnf_transformation,[],[f102]) ).
fof(f141,plain,
! [X2,X0,X1] :
( X1 = X2
| ~ occurrence_of(X0,X1)
| ~ occurrence_of(X0,X2) ),
inference(cnf_transformation,[],[f68]) ).
fof(f142,plain,
! [X2,X3,X0,X1] :
( ~ leaf_occ(X1,X0)
| ~ occurrence_of(X0,X2)
| ~ min_precedes(X1,X3,X2) ),
inference(cnf_transformation,[],[f70]) ).
fof(f184,plain,
! [X0] :
( leaf_occ(sK15(X0),X0)
| ~ occurrence_of(X0,tptp0) ),
inference(cnf_transformation,[],[f124]) ).
fof(f201,plain,
tptp1 != tptp2,
inference(cnf_transformation,[],[f45]) ).
fof(f202,plain,
! [X0,X1] :
( ~ sP0(X0,X1)
| occurrence_of(X1,tptp2) ),
inference(cnf_transformation,[],[f127]) ).
fof(f203,plain,
! [X0,X1] :
( ~ sP0(X0,X1)
| min_precedes(X0,sK16(X0),tptp0) ),
inference(cnf_transformation,[],[f127]) ).
fof(f205,plain,
occurrence_of(sK17,tptp0),
inference(cnf_transformation,[],[f128]) ).
fof(f206,plain,
! [X2,X1] :
( sP0(X1,X2)
| occurrence_of(X2,tptp1)
| ~ leaf_occ(X2,sK17) ),
inference(cnf_transformation,[],[f128]) ).
fof(f207,plain,
! [X2,X1] :
( sP0(X1,X2)
| min_precedes(X1,sK18(X1),tptp0)
| ~ leaf_occ(X2,sK17) ),
inference(cnf_transformation,[],[f128]) ).
fof(f209,definition,
! [X0,X1] :
( sQ19_eqProxy(X0,X1)
<=> X0 = X1 ),
introduced(definition,[new_symbols(definition,[sQ19_eqProxy])],[equality_proxy_definition]) ).
fof(f213,plain,
! [X2,X0,X1] :
( sQ19_eqProxy(X1,X2)
| ~ occurrence_of(X0,X1)
| ~ occurrence_of(X0,X2) ),
inference(equality_proxy_replacement,[],[f141,f209]) ).
fof(f221,plain,
~ sQ19_eqProxy(tptp1,tptp2),
inference(equality_proxy_replacement,[],[f201,f209]) ).
fof(f230,plain,
! [X0,X1] :
( occurrence_of(X0,tptp2)
| min_precedes(X1,sK18(X1),tptp0)
| ~ leaf_occ(X0,sK17) ),
inference(resolution,[],[f202,f207]) ).
fof(f237,definition,
( spl20_2
<=> ! [X0] :
( occurrence_of(X0,tptp2)
| ~ leaf_occ(X0,sK17) ) ),
introduced(definition,[new_symbols(definition,[spl20_2])],[avatar_definition]) ).
fof(f238,plain,
( ! [X0] :
( ~ leaf_occ(X0,sK17)
| occurrence_of(X0,tptp2) )
| ~ spl20_2 ),
inference(avatar_component_clause,[],[f237]) ).
fof(f241,definition,
( spl20_3
<=> ! [X1] : min_precedes(X1,sK18(X1),tptp0) ),
introduced(definition,[new_symbols(definition,[spl20_3])],[avatar_definition]) ).
fof(f242,plain,
( ! [X1] : min_precedes(X1,sK18(X1),tptp0)
| ~ spl20_3 ),
inference(avatar_component_clause,[],[f241]) ).
fof(f243,plain,
( spl20_3
| spl20_2 ),
inference(avatar_split_clause,[],[f230,f237,f241]) ).
fof(f267,definition,
( spl20_4
<=> occurrence_of(sK15(sK17),tptp2) ),
introduced(definition,[new_symbols(definition,[spl20_4])],[avatar_definition]) ).
fof(f268,plain,
( occurrence_of(sK15(sK17),tptp2)
| ~ spl20_4 ),
inference(avatar_component_clause,[],[f267]) ).
fof(f270,definition,
( spl20_5
<=> occurrence_of(sK15(sK17),tptp1) ),
introduced(definition,[new_symbols(definition,[spl20_5])],[avatar_definition]) ).
fof(f271,plain,
( occurrence_of(sK15(sK17),tptp1)
| ~ spl20_5 ),
inference(avatar_component_clause,[],[f270]) ).
fof(f273,definition,
( spl20_6
<=> occurrence_of(sK17,tptp0) ),
introduced(definition,[new_symbols(definition,[spl20_6])],[avatar_definition]) ).
fof(f274,plain,
( ~ occurrence_of(sK17,tptp0)
| spl20_6 ),
inference(avatar_component_clause,[],[f273]) ).
fof(f277,plain,
( $false
| spl20_6 ),
inference(resolution,[],[f274,f205]) ).
fof(f278,plain,
spl20_6,
inference(avatar_contradiction_clause,[],[f277]) ).
fof(f284,definition,
( spl20_7
<=> ! [X1] :
( occurrence_of(X1,tptp1)
| ~ leaf_occ(X1,sK17) ) ),
introduced(definition,[new_symbols(definition,[spl20_7])],[avatar_definition]) ).
fof(f285,plain,
( ! [X1] :
( ~ leaf_occ(X1,sK17)
| occurrence_of(X1,tptp1) )
| ~ spl20_7 ),
inference(avatar_component_clause,[],[f284]) ).
fof(f303,plain,
( occurrence_of(sK15(sK17),tptp1)
| ~ occurrence_of(sK17,tptp0)
| ~ spl20_7 ),
inference(resolution,[],[f285,f184]) ).
fof(f304,plain,
( ~ spl20_6
| spl20_5
| ~ spl20_7 ),
inference(avatar_split_clause,[],[f303,f284,f270,f273]) ).
fof(f318,plain,
! [X0,X1] :
( min_precedes(X0,sK16(X0),tptp0)
| occurrence_of(X1,tptp1)
| ~ leaf_occ(X1,sK17) ),
inference(resolution,[],[f203,f206]) ).
fof(f351,plain,
! [X0] :
( ~ occurrence_of(X0,tptp2)
| ~ occurrence_of(X0,tptp1) ),
inference(resolution,[],[f213,f221]) ).
fof(f376,plain,
( ~ occurrence_of(sK15(sK17),tptp1)
| ~ spl20_4 ),
inference(resolution,[],[f351,f268]) ).
fof(f378,plain,
( $false
| ~ spl20_4
| ~ spl20_5 ),
inference(resolution,[],[f376,f271]) ).
fof(f379,plain,
( ~ spl20_4
| ~ spl20_5 ),
inference(avatar_contradiction_clause,[],[f378]) ).
fof(f381,definition,
( spl20_14
<=> ! [X0] : min_precedes(X0,sK16(X0),tptp0) ),
introduced(definition,[new_symbols(definition,[spl20_14])],[avatar_definition]) ).
fof(f382,plain,
( ! [X0] : min_precedes(X0,sK16(X0),tptp0)
| ~ spl20_14 ),
inference(avatar_component_clause,[],[f381]) ).
fof(f383,plain,
( spl20_7
| spl20_14 ),
inference(avatar_split_clause,[],[f318,f381,f284]) ).
fof(f386,plain,
! [X2,X0,X1] :
( ~ min_precedes(sK15(X0),X2,X1)
| ~ occurrence_of(X0,X1)
| ~ occurrence_of(X0,tptp0) ),
inference(resolution,[],[f142,f184]) ).
fof(f808,plain,
( ! [X0] : occurrence_of(sK3(tptp0,X0,sK16(X0)),tptp0)
| ~ spl20_14 ),
inference(resolution,[],[f382,f138]) ).
fof(f810,plain,
( occurrence_of(sK15(sK17),tptp2)
| ~ occurrence_of(sK17,tptp0)
| ~ spl20_2 ),
inference(resolution,[],[f238,f184]) ).
fof(f811,plain,
( ~ spl20_6
| spl20_4
| ~ spl20_2 ),
inference(avatar_split_clause,[],[f810,f237,f267,f273]) ).
fof(f1406,plain,
( ! [X0] :
( ~ occurrence_of(X0,tptp0)
| ~ occurrence_of(X0,tptp0) )
| ~ spl20_14 ),
inference(resolution,[],[f386,f382]) ).
fof(f1411,plain,
( ! [X0] : ~ occurrence_of(X0,tptp0)
| ~ spl20_14 ),
inference(duplicate_literal_removal,[],[f1406]) ).
fof(f1416,plain,
( $false
| ~ spl20_14 ),
inference(resolution,[],[f1411,f808]) ).
fof(f1420,plain,
~ spl20_14,
inference(avatar_contradiction_clause,[],[f1416]) ).
fof(f1428,plain,
( ! [X0] :
( ~ occurrence_of(X0,tptp0)
| ~ occurrence_of(X0,tptp0) )
| ~ spl20_3 ),
inference(resolution,[],[f242,f386]) ).
fof(f1429,plain,
( ! [X0] : ~ occurrence_of(X0,tptp0)
| ~ spl20_3 ),
inference(duplicate_literal_removal,[],[f1428]) ).
fof(f1433,plain,
( $false
| ~ spl20_3 ),
inference(resolution,[],[f1429,f205]) ).
fof(f1434,plain,
~ spl20_3,
inference(avatar_contradiction_clause,[],[f1433]) ).
cnf(s2,plain,
( spl20_2
| spl20_3 ),
inference(sat_conversion,[],[f243]) ).
cnf(s5,plain,
spl20_6,
inference(sat_conversion,[],[f278]) ).
cnf(s10,plain,
( spl20_5
| ~ spl20_6
| ~ spl20_7 ),
inference(sat_conversion,[],[f304]) ).
cnf(s13,plain,
( ~ spl20_4
| ~ spl20_5 ),
inference(sat_conversion,[],[f379]) ).
cnf(s14,plain,
( spl20_7
| spl20_14 ),
inference(sat_conversion,[],[f383]) ).
cnf(s42,plain,
( ~ spl20_2
| spl20_4
| ~ spl20_6 ),
inference(sat_conversion,[],[f811]) ).
cnf(s106,plain,
~ spl20_14,
inference(sat_conversion,[],[f1420]) ).
cnf(s107,plain,
~ spl20_3,
inference(sat_conversion,[],[f1434]) ).
cnf(s108,plain,
spl20_7,
inference(rat,[],[s14,s106]) ).
cnf(s109,plain,
( spl20_5
| ~ spl20_6 ),
inference(rat,[],[s10,s108]) ).
cnf(s110,plain,
spl20_5,
inference(rat,[],[s109,s5]) ).
cnf(s112,plain,
~ spl20_4,
inference(rat,[],[s13,s110]) ).
cnf(s117,plain,
~ spl20_2,
inference(rat,[],[s42,s5,s112]) ).
cnf(s118,plain,
$false,
inference(rat,[],[s2,s107,s117]) ).
fof(f1435,plain,
$false,
inference(avatar_sat_refutation,[],[s118]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : PRO010+4 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.39 % Computer : n013.cluster.edu
% 0.12/0.39 % Model : x86_64 x86_64
% 0.12/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.39 % Memory : 8046.5625MB
% 0.12/0.39 % OS : Linux 6.8.0-71-generic
% 0.12/0.39 % CPULimit : 300
% 0.12/0.39 % WCLimit : 300
% 0.12/0.39 % DateTime : Sun Sep 27 22:20:52 UTC 2026
% 0.12/0.39 % CPUTime :
% 0.12/0.39 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.43 Running first-order theorem proving
% 0.12/0.43 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.79/1.34 % (608184)Detected formulas, will run a generic FOF schedule.
% 2.79/1.34 % (608192)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1169631965:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.79/1.34 % (608192)Refutation not found, incomplete strategy
% 2.79/1.34 % (608192)------------------------------
% 2.79/1.34 % (608192)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.79/1.34 % (608192)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.79/1.34 % (608192)CaDiCaL version: 2.1.3
% 2.79/1.34 % (608192)Termination reason: Refutation not found, incomplete strategy
% 2.79/1.34 % (608192)Time elapsed: 0.001 s
% 2.79/1.34 % (608192)Peak memory usage: 87 MB
% 2.79/1.34 % (608190)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=732566537:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.79/1.34 % (608191)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=1900750464:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.79/1.34 % (608189)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=3500283462:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.79/1.34 % (608195)dis-21_1_sil=8000:lcm=predicate:random_seed=891924692: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.79/1.34 % (608194)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=421222454:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.79/1.34 % (608193)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=4124829170:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.79/1.34 % (608193)Refutation not found, incomplete strategy
% 2.79/1.34 % (608193)------------------------------
% 2.79/1.34 % (608193)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.79/1.34 % (608193)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.79/1.34 % (608193)CaDiCaL version: 2.1.3
% 2.79/1.34 % (608193)Termination reason: Refutation not found, incomplete strategy
% 2.79/1.34 % (608193)Time elapsed: 0.001 s
% 2.79/1.34 % (608193)Peak memory usage: 87 MB
% 2.79/1.34 % (608195)First to succeed.
% 2.79/1.34 % (608195)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-608184"
% 2.79/1.34 % (608192)------------------------------
% 2.79/1.34 % (608192)------------------------------
% 2.79/1.34 % (608194)Instruction limit reached!
% 2.79/1.34 % (608194)------------------------------
% 2.79/1.34 % (608194)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.79/1.34 % (608194)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.79/1.34 % (608194)CaDiCaL version: 2.1.3
% 2.79/1.34 % (608194)Termination reason: Instruction limit
% 2.79/1.34 % (608194)Termination phase: Saturation
% 2.79/1.34 % (608194)Time elapsed: 0.100 s
% 2.79/1.34 % (608194)Peak memory usage: 89 MB
% 2.79/1.34 % (608194)Instructions burned: 140 (million)
% 2.79/1.34 % (608203)lrs+10_1_sil=8000:sp=occurrence:random_seed=2492862623:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 2.79/1.34 % (608203)Also succeeded, but the first one will report.
% 2.79/1.34 % (608193)------------------------------
% 2.79/1.34 % (608193)------------------------------
% 2.79/1.34 % (608204)lrs+10_1_sil=32000:urr=on:br=off:random_seed=973306541:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 2.79/1.34 % (608204)Also succeeded, but the first one will report.
% 2.79/1.34 % (608195)Refutation found. Thanks to Tanya!
% 2.79/1.34 % SZS status Theorem for theBenchmark
% 2.79/1.34 % SZS output start Proof for theBenchmark
% See solution above
% 3.96/1.53 % (608195)------------------------------
% 3.96/1.53 % (608195)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.96/1.53 % (608195)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.96/1.53 % (608195)CaDiCaL version: 2.1.3
% 3.96/1.53 % (608195)Termination reason: Refutation
% 3.96/1.53 % (608195)Time elapsed: 0.024 s
% 3.96/1.53 % (608195)Peak memory usage: 89 MB
% 3.96/1.53 % (608195)Instructions burned: 33 (million)
% 3.96/1.53 % (608195)------------------------------
% 3.96/1.53 % (608195)------------------------------
% 3.96/1.53 % (608184)Success in time 0.471 s
% 3.96/1.53 % Vampire exiting
%------------------------------------------------------------------------------