%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : PRO011+3 : 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 : n020.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.63s 1.27s
% Output : Refutation 3.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 17
% Syntax : Number of formulae : 92 ( 18 unt; 9 def)
% Number of atoms : 266 ( 7 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 270 ( 96 ~; 88 |; 65 &)
% ( 10 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 19 ( 17 usr; 8 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 6 con; 0-3 aty)
% Number of variables : 127 ( 0 sgn 103 !; 24 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0,X1,X2] :
( ( occurrence_of(X0,X1)
& occurrence_of(X0,X2) )
=> X1 = X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_02) ).
fof(f8,axiom,
! [X0,X1] :
( occurrence_of(X0,X1)
=> ( arboreal(X0)
<=> atomic(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_07) ).
fof(f26,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_25) ).
fof(f47,axiom,
! [X0,X1,X2] :
( min_precedes(X0,X1,X2)
=> arboreal(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_46) ).
fof(f50,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_49) ).
fof(f52,axiom,
~ atomic(tptp0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_51) ).
fof(f62,axiom,
tptp1 != tptp2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_61) ).
fof(f63,conjecture,
! [X0] :
( occurrence_of(X0,tptp0)
=> ? [X1,X2] :
( leaf_occ(X2,X0)
& ( occurrence_of(X2,tptp1)
=> ~ ? [X3] :
( occurrence_of(X3,tptp2)
& subactivity_occurrence(X3,X0)
& min_precedes(X1,X3,tptp0) ) )
& ( occurrence_of(X2,tptp2)
=> ~ ? [X4] :
( occurrence_of(X4,tptp1)
& subactivity_occurrence(X4,X0)
& min_precedes(X1,X4,tptp0) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(f64,negated_conjecture,
~ ! [X0] :
( occurrence_of(X0,tptp0)
=> ? [X1,X2] :
( leaf_occ(X2,X0)
& ( occurrence_of(X2,tptp1)
=> ~ ? [X3] :
( occurrence_of(X3,tptp2)
& subactivity_occurrence(X3,X0)
& min_precedes(X1,X3,tptp0) ) )
& ( occurrence_of(X2,tptp2)
=> ~ ? [X4] :
( occurrence_of(X4,tptp1)
& subactivity_occurrence(X4,X0)
& min_precedes(X1,X4,tptp0) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f63]) ).
fof(f67,plain,
! [X0,X1,X2] :
( X1 = X2
| ~ occurrence_of(X0,X1)
| ~ occurrence_of(X0,X2) ),
inference(ennf_transformation,[],[f3]) ).
fof(f68,plain,
! [X0,X1,X2] :
( X1 = X2
| ~ occurrence_of(X0,X1)
| ~ occurrence_of(X0,X2) ),
inference(flattening,[],[f67]) ).
fof(f75,plain,
! [X0,X1] :
( ( arboreal(X0)
<=> atomic(X1) )
| ~ occurrence_of(X0,X1) ),
inference(ennf_transformation,[],[f8]) ).
fof(f95,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,[],[f26]) ).
fof(f131,plain,
! [X0,X1,X2] :
( arboreal(X0)
| ~ min_precedes(X0,X1,X2) ),
inference(ennf_transformation,[],[f47]) ).
fof(f136,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,[],[f50]) ).
fof(f137,plain,
? [X0] :
( ! [X1,X2] :
( ~ leaf_occ(X2,X0)
| ( ? [X3] :
( occurrence_of(X3,tptp2)
& subactivity_occurrence(X3,X0)
& min_precedes(X1,X3,tptp0) )
& occurrence_of(X2,tptp1) )
| ( ? [X4] :
( occurrence_of(X4,tptp1)
& subactivity_occurrence(X4,X0)
& min_precedes(X1,X4,tptp0) )
& occurrence_of(X2,tptp2) ) )
& occurrence_of(X0,tptp0) ),
inference(ennf_transformation,[],[f64]) ).
fof(f138,definition,
! [X0,X1,X2] :
( ( ? [X4] :
( occurrence_of(X4,tptp1)
& subactivity_occurrence(X4,X0)
& min_precedes(X1,X4,tptp0) )
& occurrence_of(X2,tptp2) )
| ~ sP0(X0,X1,X2) ),
introduced(definition,[new_symbols(definition,[sP0])],[predicate_definition_introduction]) ).
fof(f139,plain,
? [X0] :
( ! [X1,X2] :
( ~ leaf_occ(X2,X0)
| ( ? [X3] :
( occurrence_of(X3,tptp2)
& subactivity_occurrence(X3,X0)
& min_precedes(X1,X3,tptp0) )
& occurrence_of(X2,tptp1) )
| sP0(X0,X1,X2) )
& occurrence_of(X0,tptp0) ),
inference(definition_folding,[],[f137,f138]) ).
fof(f141,plain,
! [X0,X1] :
( ( ( arboreal(X0)
| ~ atomic(X1) )
& ( atomic(X1)
| ~ arboreal(X0) ) )
| ~ occurrence_of(X0,X1) ),
inference(nnf_transformation,[],[f75]) ).
fof(f158,plain,
! [X0,X1,X2] :
( ( occurrence_of(sK10(X0,X1,X2),X0)
& subactivity_occurrence(X1,sK10(X0,X1,X2))
& subactivity_occurrence(X2,sK10(X0,X1,X2)) )
| ~ min_precedes(X1,X2,X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK10]),skolemize(X3,sK10(X0,X1,X2))],[f95]) ).
fof(f169,plain,
! [X0] :
( ( occurrence_of(sK17(X0),tptp3)
& root_occ(sK17(X0),X0)
& occurrence_of(sK18(X0),tptp4)
& next_subocc(sK17(X0),sK18(X0),tptp0)
& ( occurrence_of(sK19(X0),tptp1)
| occurrence_of(sK19(X0),tptp2) )
& next_subocc(sK18(X0),sK19(X0),tptp0)
& leaf_occ(sK19(X0),X0) )
| ~ occurrence_of(X0,tptp0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK17,sK18,sK19]),skolemize(X1,sK17(X0)),skolemize(X2,sK18(X0)),skolemize(X3,sK19(X0))],[f136]) ).
fof(f170,plain,
! [X0,X1,X2] :
( ( ? [X4] :
( occurrence_of(X4,tptp1)
& subactivity_occurrence(X4,X0)
& min_precedes(X1,X4,tptp0) )
& occurrence_of(X2,tptp2) )
| ~ sP0(X0,X1,X2) ),
inference(nnf_transformation,[],[f138]) ).
fof(f171,plain,
! [X0,X1,X2] :
( ( ? [X3] :
( occurrence_of(X3,tptp1)
& subactivity_occurrence(X3,X0)
& min_precedes(X1,X3,tptp0) )
& occurrence_of(X2,tptp2) )
| ~ sP0(X0,X1,X2) ),
inference(rectify,[],[f170]) ).
fof(f172,plain,
! [X0,X1,X2] :
( ( occurrence_of(sK20(X0,X1),tptp1)
& subactivity_occurrence(sK20(X0,X1),X0)
& min_precedes(X1,sK20(X0,X1),tptp0)
& occurrence_of(X2,tptp2) )
| ~ sP0(X0,X1,X2) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK20]),skolemize(X3,sK20(X0,X1))],[f171]) ).
fof(f173,plain,
( ! [X1,X2] :
( ~ leaf_occ(X2,sK21)
| ( occurrence_of(sK22(X1),tptp2)
& subactivity_occurrence(sK22(X1),sK21)
& min_precedes(X1,sK22(X1),tptp0)
& occurrence_of(X2,tptp1) )
| sP0(sK21,X1,X2) )
& occurrence_of(sK21,tptp0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK21,sK22]),skolemize(X0,sK21),skolemize(X3,sK22(X1))],[f139]) ).
fof(f178,plain,
! [X2,X0,X1] :
( X1 = X2
| ~ occurrence_of(X0,X1)
| ~ occurrence_of(X0,X2) ),
inference(cnf_transformation,[],[f68]) ).
fof(f183,plain,
! [X0,X1] :
( ~ arboreal(X0)
| atomic(X1)
| ~ occurrence_of(X0,X1) ),
inference(cnf_transformation,[],[f141]) ).
fof(f221,plain,
! [X2,X0,X1] :
( ~ min_precedes(X1,X2,X0)
| occurrence_of(sK10(X0,X1,X2),X0) ),
inference(cnf_transformation,[],[f158]) ).
fof(f253,plain,
! [X2,X0,X1] :
( arboreal(X0)
| ~ min_precedes(X0,X1,X2) ),
inference(cnf_transformation,[],[f131]) ).
fof(f256,plain,
! [X0] :
( leaf_occ(sK19(X0),X0)
| ~ occurrence_of(X0,tptp0) ),
inference(cnf_transformation,[],[f169]) ).
fof(f264,plain,
~ atomic(tptp0),
inference(cnf_transformation,[],[f52]) ).
fof(f274,plain,
tptp1 != tptp2,
inference(cnf_transformation,[],[f62]) ).
fof(f275,plain,
! [X2,X0,X1] :
( ~ sP0(X0,X1,X2)
| occurrence_of(X2,tptp2) ),
inference(cnf_transformation,[],[f172]) ).
fof(f276,plain,
! [X2,X0,X1] :
( ~ sP0(X0,X1,X2)
| min_precedes(X1,sK20(X0,X1),tptp0) ),
inference(cnf_transformation,[],[f172]) ).
fof(f279,plain,
occurrence_of(sK21,tptp0),
inference(cnf_transformation,[],[f173]) ).
fof(f280,plain,
! [X2,X1] :
( sP0(sK21,X1,X2)
| occurrence_of(X2,tptp1)
| ~ leaf_occ(X2,sK21) ),
inference(cnf_transformation,[],[f173]) ).
fof(f281,plain,
! [X2,X1] :
( sP0(sK21,X1,X2)
| min_precedes(X1,sK22(X1),tptp0)
| ~ leaf_occ(X2,sK21) ),
inference(cnf_transformation,[],[f173]) ).
fof(f284,definition,
! [X0,X1] :
( sQ23_eqProxy(X0,X1)
<=> X0 = X1 ),
introduced(definition,[new_symbols(definition,[sQ23_eqProxy])],[equality_proxy_definition]) ).
fof(f285,plain,
! [X2,X0,X1] :
( sQ23_eqProxy(X1,X2)
| ~ occurrence_of(X0,X1)
| ~ occurrence_of(X0,X2) ),
inference(equality_proxy_replacement,[],[f178,f284]) ).
fof(f302,plain,
~ sQ23_eqProxy(tptp1,tptp2),
inference(equality_proxy_replacement,[],[f274,f284]) ).
fof(f324,plain,
! [X2,X3,X0,X1] :
( atomic(X0)
| ~ occurrence_of(X1,X0)
| ~ min_precedes(X1,X2,X3) ),
inference(resolution,[],[f183,f253]) ).
fof(f341,plain,
! [X0,X1] :
( occurrence_of(X0,tptp2)
| min_precedes(X1,sK22(X1),tptp0)
| ~ leaf_occ(X0,sK21) ),
inference(resolution,[],[f275,f281]) ).
fof(f349,definition,
( spl24_2
<=> ! [X0] :
( occurrence_of(X0,tptp2)
| ~ leaf_occ(X0,sK21) ) ),
introduced(definition,[new_symbols(definition,[spl24_2])],[avatar_definition]) ).
fof(f350,plain,
( ! [X0] :
( ~ leaf_occ(X0,sK21)
| occurrence_of(X0,tptp2) )
| ~ spl24_2 ),
inference(avatar_component_clause,[],[f349]) ).
fof(f357,definition,
( spl24_4
<=> ! [X1] : min_precedes(X1,sK22(X1),tptp0) ),
introduced(definition,[new_symbols(definition,[spl24_4])],[avatar_definition]) ).
fof(f358,plain,
( ! [X1] : min_precedes(X1,sK22(X1),tptp0)
| ~ spl24_4 ),
inference(avatar_component_clause,[],[f357]) ).
fof(f359,plain,
( spl24_4
| spl24_2 ),
inference(avatar_split_clause,[],[f341,f349,f357]) ).
fof(f360,plain,
( occurrence_of(sK19(sK21),tptp2)
| ~ occurrence_of(sK21,tptp0)
| ~ spl24_2 ),
inference(resolution,[],[f350,f256]) ).
fof(f362,definition,
( spl24_5
<=> occurrence_of(sK21,tptp0) ),
introduced(definition,[new_symbols(definition,[spl24_5])],[avatar_definition]) ).
fof(f363,plain,
( ~ occurrence_of(sK21,tptp0)
| spl24_5 ),
inference(avatar_component_clause,[],[f362]) ).
fof(f365,definition,
( spl24_6
<=> occurrence_of(sK19(sK21),tptp2) ),
introduced(definition,[new_symbols(definition,[spl24_6])],[avatar_definition]) ).
fof(f366,plain,
( occurrence_of(sK19(sK21),tptp2)
| ~ spl24_6 ),
inference(avatar_component_clause,[],[f365]) ).
fof(f367,plain,
( ~ spl24_5
| spl24_6
| ~ spl24_2 ),
inference(avatar_split_clause,[],[f360,f349,f365,f362]) ).
fof(f368,plain,
( $false
| spl24_5 ),
inference(resolution,[],[f363,f279]) ).
fof(f369,plain,
spl24_5,
inference(avatar_contradiction_clause,[],[f368]) ).
fof(f411,definition,
( spl24_7
<=> ! [X1] :
( occurrence_of(X1,tptp1)
| ~ leaf_occ(X1,sK21) ) ),
introduced(definition,[new_symbols(definition,[spl24_7])],[avatar_definition]) ).
fof(f412,plain,
( ! [X1] :
( ~ leaf_occ(X1,sK21)
| occurrence_of(X1,tptp1) )
| ~ spl24_7 ),
inference(avatar_component_clause,[],[f411]) ).
fof(f437,definition,
( spl24_13
<=> occurrence_of(sK19(sK21),tptp1) ),
introduced(definition,[new_symbols(definition,[spl24_13])],[avatar_definition]) ).
fof(f438,plain,
( occurrence_of(sK19(sK21),tptp1)
| ~ spl24_13 ),
inference(avatar_component_clause,[],[f437]) ).
fof(f462,plain,
( occurrence_of(sK19(sK21),tptp1)
| ~ occurrence_of(sK21,tptp0)
| ~ spl24_7 ),
inference(resolution,[],[f412,f256]) ).
fof(f463,plain,
( ~ spl24_5
| spl24_13
| ~ spl24_7 ),
inference(avatar_split_clause,[],[f462,f411,f437,f362]) ).
fof(f473,plain,
! [X0] :
( ~ occurrence_of(X0,tptp2)
| ~ occurrence_of(X0,tptp1) ),
inference(resolution,[],[f285,f302]) ).
fof(f496,plain,
( ~ occurrence_of(sK19(sK21),tptp1)
| ~ spl24_6 ),
inference(resolution,[],[f473,f366]) ).
fof(f497,plain,
( $false
| ~ spl24_6
| ~ spl24_13 ),
inference(resolution,[],[f496,f438]) ).
fof(f498,plain,
( ~ spl24_6
| ~ spl24_13 ),
inference(avatar_contradiction_clause,[],[f497]) ).
fof(f522,plain,
! [X0,X1] :
( min_precedes(X0,sK20(sK21,X0),tptp0)
| occurrence_of(X1,tptp1)
| ~ leaf_occ(X1,sK21) ),
inference(resolution,[],[f276,f280]) ).
fof(f524,definition,
( spl24_18
<=> ! [X0] : min_precedes(X0,sK20(sK21,X0),tptp0) ),
introduced(definition,[new_symbols(definition,[spl24_18])],[avatar_definition]) ).
fof(f525,plain,
( ! [X0] : min_precedes(X0,sK20(sK21,X0),tptp0)
| ~ spl24_18 ),
inference(avatar_component_clause,[],[f524]) ).
fof(f526,plain,
( spl24_7
| spl24_18 ),
inference(avatar_split_clause,[],[f522,f524,f411]) ).
fof(f539,plain,
( ! [X0] : occurrence_of(sK10(tptp0,X0,sK20(sK21,X0)),tptp0)
| ~ spl24_18 ),
inference(resolution,[],[f525,f221]) ).
fof(f612,plain,
! [X2,X0,X1] :
( ~ min_precedes(X0,X1,X2)
| ~ occurrence_of(X0,tptp0) ),
inference(resolution,[],[f324,f264]) ).
fof(f623,plain,
( ! [X0] : ~ occurrence_of(X0,tptp0)
| ~ spl24_18 ),
inference(resolution,[],[f612,f525]) ).
fof(f625,plain,
( $false
| ~ spl24_18 ),
inference(resolution,[],[f623,f539]) ).
fof(f628,plain,
~ spl24_18,
inference(avatar_contradiction_clause,[],[f625]) ).
fof(f632,plain,
( ! [X0] : ~ occurrence_of(X0,tptp0)
| ~ spl24_4 ),
inference(resolution,[],[f358,f612]) ).
fof(f636,plain,
( $false
| ~ spl24_4 ),
inference(resolution,[],[f632,f279]) ).
fof(f637,plain,
~ spl24_4,
inference(avatar_contradiction_clause,[],[f636]) ).
cnf(s3,plain,
( spl24_2
| spl24_4 ),
inference(sat_conversion,[],[f359]) ).
cnf(s4,plain,
( ~ spl24_2
| ~ spl24_5
| spl24_6 ),
inference(sat_conversion,[],[f367]) ).
cnf(s5,plain,
spl24_5,
inference(sat_conversion,[],[f369]) ).
cnf(s16,plain,
( ~ spl24_5
| ~ spl24_7
| spl24_13 ),
inference(sat_conversion,[],[f463]) ).
cnf(s17,plain,
( ~ spl24_6
| ~ spl24_13 ),
inference(sat_conversion,[],[f498]) ).
cnf(s18,plain,
( spl24_7
| spl24_18 ),
inference(sat_conversion,[],[f526]) ).
cnf(s23,plain,
~ spl24_18,
inference(sat_conversion,[],[f628]) ).
cnf(s24,plain,
~ spl24_4,
inference(sat_conversion,[],[f637]) ).
cnf(s25,plain,
spl24_7,
inference(rat,[],[s18,s23]) ).
cnf(s26,plain,
( ~ spl24_5
| spl24_13 ),
inference(rat,[],[s16,s25]) ).
cnf(s28,plain,
spl24_13,
inference(rat,[],[s26,s5]) ).
cnf(s30,plain,
~ spl24_6,
inference(rat,[],[s17,s28]) ).
cnf(s40,plain,
~ spl24_2,
inference(rat,[],[s4,s30,s5]) ).
cnf(s41,plain,
$false,
inference(rat,[],[s3,s24,s40]) ).
fof(f638,plain,
$false,
inference(avatar_sat_refutation,[],[s41]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : PRO011+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.38 % Computer : n020.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 22:21:35 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.42 Running first-order theorem proving
% 0.10/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.63/1.27 % (3822708)Detected formulas, will run a generic FOF schedule.
% 2.63/1.27 % (3822713)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=3352894914:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.63/1.27 % (3822718)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2041476244:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.63/1.27 % (3822716)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2759424150:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.63/1.27 % (3822715)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=68636844:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.63/1.27 % (3822714)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=745653934:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.63/1.27 % (3822719)dis-21_1_sil=8000:lcm=predicate:random_seed=294137850: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.63/1.27 % (3822717)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3006227846:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.63/1.27 % (3822719)First to succeed.
% 2.63/1.27 % (3822719)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3822708"
% 2.63/1.27 % (3822717)Also succeeded, but the first one will report.
% 2.63/1.27 % (3822716)Instruction limit reached!
% 2.63/1.27 % (3822716)------------------------------
% 2.63/1.27 % (3822716)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.63/1.27 % (3822716)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.63/1.27 % (3822716)CaDiCaL version: 2.1.3
% 2.63/1.27 % (3822716)Termination reason: Instruction limit
% 2.63/1.27 % (3822716)Termination phase: Saturation
% 2.63/1.27 % (3822716)Time elapsed: 0.061 s
% 2.63/1.27 % (3822716)Peak memory usage: 88 MB
% 2.63/1.27 % (3822716)Instructions burned: 109 (million)
% 2.63/1.27 % (3822718)Instruction limit reached!
% 2.63/1.27 % (3822718)------------------------------
% 2.63/1.27 % (3822718)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.63/1.27 % (3822718)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.63/1.27 % (3822718)CaDiCaL version: 2.1.3
% 2.63/1.27 % (3822718)Termination reason: Instruction limit
% 2.63/1.27 % (3822718)Termination phase: Saturation
% 2.63/1.27 % (3822718)Time elapsed: 0.098 s
% 2.63/1.27 % (3822718)Peak memory usage: 90 MB
% 2.63/1.27 % (3822718)Instructions burned: 140 (million)
% 2.63/1.27 % (3822727)lrs+10_1_sil=8000:sp=occurrence:random_seed=3381475434:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 2.63/1.27 % (3822727)Also succeeded, but the first one will report.
% 2.63/1.27 % (3822728)lrs+10_1_sil=32000:urr=on:br=off:random_seed=3124893647:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 2.63/1.27 % (3822728)Also succeeded, but the first one will report.
% 2.63/1.27 % (3822719)Refutation found. Thanks to Tanya!
% 2.63/1.27 % SZS status Theorem for theBenchmark
% 2.63/1.27 % SZS output start Proof for theBenchmark
% See solution above
% 3.39/1.36 % (3822719)------------------------------
% 3.39/1.36 % (3822719)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.39/1.36 % (3822719)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.39/1.36 % (3822719)CaDiCaL version: 2.1.3
% 3.39/1.36 % (3822719)Termination reason: Refutation
% 3.39/1.36 % (3822719)Time elapsed: 0.010 s
% 3.39/1.36 % (3822719)Peak memory usage: 89 MB
% 3.39/1.36 % (3822719)Instructions burned: 14 (million)
% 3.39/1.36 % (3822719)------------------------------
% 3.39/1.36 % (3822719)------------------------------
% 3.39/1.36 % (3822708)Success in time 0.411 s
% 3.39/1.36 % Vampire exiting
%------------------------------------------------------------------------------