%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : PRO014+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 : n012.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:27 PM UTC 2026
% Result : Theorem 2.92s 1.20s
% Output : Refutation 2.92s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 17
% Syntax : Number of formulae : 153 ( 28 unt; 7 def)
% Number of atoms : 576 ( 11 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 699 ( 276 ~; 302 |; 100 &)
% ( 13 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 18 ( 16 usr; 8 prp; 0-3 aty)
% Number of functors : 14 ( 14 usr; 7 con; 0-3 aty)
% Number of variables : 223 ( 0 sgn 191 !; 32 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
! [X0,X1] :
( occurrence_of(X0,X1)
=> ( arboreal(X0)
<=> atomic(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_07) ).
fof(f22,axiom,
! [X0,X1] :
( leaf(X0,X1)
<=> ( ( root(X0,X1)
| ? [X2] : min_precedes(X2,X0,X1) )
& ~ ? [X3] : min_precedes(X0,X3,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_21) ).
fof(f23,axiom,
! [X0,X1,X2] :
( next_subocc(X0,X1,X2)
<=> ( min_precedes(X0,X1,X2)
& ~ ? [X3] :
( min_precedes(X0,X3,X2)
& min_precedes(X3,X1,X2) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_22) ).
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(f29,axiom,
! [X0,X1,X2,X3] :
( ( occurrence_of(X1,X0)
& arboreal(X2)
& arboreal(X3)
& subactivity_occurrence(X2,X1)
& subactivity_occurrence(X3,X1) )
=> ( min_precedes(X2,X3,X0)
| min_precedes(X3,X2,X0)
| X2 = X3 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_28) ).
fof(f30,axiom,
! [X0,X1,X2,X3] :
( ( min_precedes(X0,X1,X2)
& occurrence_of(X3,X2)
& subactivity_occurrence(X1,X3) )
=> subactivity_occurrence(X0,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_29) ).
fof(f45,axiom,
! [X0,X1,X2] :
( next_subocc(X0,X1,X2)
=> ( arboreal(X0)
& arboreal(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_44) ).
fof(f50,axiom,
! [X0,X1] :
( ( occurrence_of(X1,tptp0)
& subactivity_occurrence(X0,X1)
& arboreal(X0)
& ~ leaf_occ(X0,X1) )
=> ? [X2,X3,X4] :
( occurrence_of(X2,tptp3)
& next_subocc(X0,X2,tptp0)
& occurrence_of(X3,tptp4)
& next_subocc(X2,X3,tptp0)
& ( occurrence_of(X4,tptp2)
| occurrence_of(X4,tptp1) )
& next_subocc(X3,X4,tptp0)
& leaf(X4,tptp0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_49) ).
fof(f56,axiom,
atomic(tptp3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_55) ).
fof(f63,conjecture,
! [X0,X1] :
( ( occurrence_of(X1,tptp0)
& subactivity_occurrence(X0,X1)
& arboreal(X0)
& ~ leaf_occ(X0,X1) )
=> ? [X2,X3] :
( occurrence_of(X2,tptp3)
& next_subocc(X0,X2,tptp0)
& ( occurrence_of(X3,tptp2)
| occurrence_of(X3,tptp1) )
& min_precedes(X2,X3,tptp0)
& leaf(X3,tptp0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(f64,negated_conjecture,
~ ! [X0,X1] :
( ( occurrence_of(X1,tptp0)
& subactivity_occurrence(X0,X1)
& arboreal(X0)
& ~ leaf_occ(X0,X1) )
=> ? [X2,X3] :
( occurrence_of(X2,tptp3)
& next_subocc(X0,X2,tptp0)
& ( occurrence_of(X3,tptp2)
| occurrence_of(X3,tptp1) )
& min_precedes(X2,X3,tptp0)
& leaf(X3,tptp0) ) ),
inference(negated_conjecture,[status(cth)],[f63]) ).
fof(f76,plain,
! [X0,X1] :
( ( arboreal(X0)
<=> atomic(X1) )
| ~ occurrence_of(X0,X1) ),
inference(ennf_transformation,[],[f8]) ).
fof(f93,plain,
! [X0,X1] :
( leaf(X0,X1)
<=> ( ( root(X0,X1)
| ? [X2] : min_precedes(X2,X0,X1) )
& ! [X3] : ~ min_precedes(X0,X3,X1) ) ),
inference(ennf_transformation,[],[f22]) ).
fof(f94,plain,
! [X0,X1,X2] :
( next_subocc(X0,X1,X2)
<=> ( min_precedes(X0,X1,X2)
& ! [X3] :
( ~ min_precedes(X0,X3,X2)
| ~ min_precedes(X3,X1,X2) ) ) ),
inference(ennf_transformation,[],[f23]) ).
fof(f96,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(f101,plain,
! [X0,X1,X2,X3] :
( min_precedes(X2,X3,X0)
| min_precedes(X3,X2,X0)
| X2 = X3
| ~ occurrence_of(X1,X0)
| ~ arboreal(X2)
| ~ arboreal(X3)
| ~ subactivity_occurrence(X2,X1)
| ~ subactivity_occurrence(X3,X1) ),
inference(ennf_transformation,[],[f29]) ).
fof(f102,plain,
! [X0,X1,X2,X3] :
( min_precedes(X2,X3,X0)
| min_precedes(X3,X2,X0)
| X2 = X3
| ~ occurrence_of(X1,X0)
| ~ arboreal(X2)
| ~ arboreal(X3)
| ~ subactivity_occurrence(X2,X1)
| ~ subactivity_occurrence(X3,X1) ),
inference(flattening,[],[f101]) ).
fof(f103,plain,
! [X0,X1,X2,X3] :
( subactivity_occurrence(X0,X3)
| ~ min_precedes(X0,X1,X2)
| ~ occurrence_of(X3,X2)
| ~ subactivity_occurrence(X1,X3) ),
inference(ennf_transformation,[],[f30]) ).
fof(f104,plain,
! [X0,X1,X2,X3] :
( subactivity_occurrence(X0,X3)
| ~ min_precedes(X0,X1,X2)
| ~ occurrence_of(X3,X2)
| ~ subactivity_occurrence(X1,X3) ),
inference(flattening,[],[f103]) ).
fof(f130,plain,
! [X0,X1,X2] :
( ( arboreal(X0)
& arboreal(X1) )
| ~ next_subocc(X0,X1,X2) ),
inference(ennf_transformation,[],[f45]) ).
fof(f138,plain,
! [X0,X1] :
( ? [X2,X3,X4] :
( occurrence_of(X2,tptp3)
& next_subocc(X0,X2,tptp0)
& occurrence_of(X3,tptp4)
& next_subocc(X2,X3,tptp0)
& ( occurrence_of(X4,tptp2)
| occurrence_of(X4,tptp1) )
& next_subocc(X3,X4,tptp0)
& leaf(X4,tptp0) )
| ~ occurrence_of(X1,tptp0)
| ~ subactivity_occurrence(X0,X1)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(ennf_transformation,[],[f50]) ).
fof(f139,plain,
! [X0,X1] :
( ? [X2,X3,X4] :
( occurrence_of(X2,tptp3)
& next_subocc(X0,X2,tptp0)
& occurrence_of(X3,tptp4)
& next_subocc(X2,X3,tptp0)
& ( occurrence_of(X4,tptp2)
| occurrence_of(X4,tptp1) )
& next_subocc(X3,X4,tptp0)
& leaf(X4,tptp0) )
| ~ occurrence_of(X1,tptp0)
| ~ subactivity_occurrence(X0,X1)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(flattening,[],[f138]) ).
fof(f140,plain,
? [X0,X1] :
( ! [X2,X3] :
( ~ occurrence_of(X2,tptp3)
| ~ next_subocc(X0,X2,tptp0)
| ( ~ occurrence_of(X3,tptp2)
& ~ occurrence_of(X3,tptp1) )
| ~ min_precedes(X2,X3,tptp0)
| ~ leaf(X3,tptp0) )
& occurrence_of(X1,tptp0)
& subactivity_occurrence(X0,X1)
& arboreal(X0)
& ~ leaf_occ(X0,X1) ),
inference(ennf_transformation,[],[f64]) ).
fof(f141,plain,
? [X0,X1] :
( ! [X2,X3] :
( ~ occurrence_of(X2,tptp3)
| ~ next_subocc(X0,X2,tptp0)
| ( ~ occurrence_of(X3,tptp2)
& ~ occurrence_of(X3,tptp1) )
| ~ min_precedes(X2,X3,tptp0)
| ~ leaf(X3,tptp0) )
& occurrence_of(X1,tptp0)
& subactivity_occurrence(X0,X1)
& arboreal(X0)
& ~ leaf_occ(X0,X1) ),
inference(flattening,[],[f140]) ).
fof(f143,plain,
! [X0,X1] :
( ( ( arboreal(X0)
| ~ atomic(X1) )
& ( atomic(X1)
| ~ arboreal(X0) ) )
| ~ occurrence_of(X0,X1) ),
inference(nnf_transformation,[],[f76]) ).
fof(f149,plain,
! [X0,X1] :
( ( leaf(X0,X1)
| ( ~ root(X0,X1)
& ! [X2] : ~ min_precedes(X2,X0,X1) )
| ? [X3] : min_precedes(X0,X3,X1) )
& ( ( ( root(X0,X1)
| ? [X2] : min_precedes(X2,X0,X1) )
& ! [X3] : ~ min_precedes(X0,X3,X1) )
| ~ leaf(X0,X1) ) ),
inference(nnf_transformation,[],[f93]) ).
fof(f150,plain,
! [X0,X1] :
( ( leaf(X0,X1)
| ( ~ root(X0,X1)
& ! [X2] : ~ min_precedes(X2,X0,X1) )
| ? [X3] : min_precedes(X0,X3,X1) )
& ( ( ( root(X0,X1)
| ? [X2] : min_precedes(X2,X0,X1) )
& ! [X3] : ~ min_precedes(X0,X3,X1) )
| ~ leaf(X0,X1) ) ),
inference(flattening,[],[f149]) ).
fof(f151,plain,
! [X0,X1] :
( ( leaf(X0,X1)
| ( ~ root(X0,X1)
& ! [X2] : ~ min_precedes(X2,X0,X1) )
| ? [X3] : min_precedes(X0,X3,X1) )
& ( ( ( root(X0,X1)
| ? [X4] : min_precedes(X4,X0,X1) )
& ! [X5] : ~ min_precedes(X0,X5,X1) )
| ~ leaf(X0,X1) ) ),
inference(rectify,[],[f150]) ).
fof(f152,plain,
! [X0,X1] :
( ( leaf(X0,X1)
| ( ~ root(X0,X1)
& ! [X2] : ~ min_precedes(X2,X0,X1) )
| min_precedes(X0,sK5(X0,X1),X1) )
& ( ( ( root(X0,X1)
| min_precedes(sK6(X0,X1),X0,X1) )
& ! [X5] : ~ min_precedes(X0,X5,X1) )
| ~ leaf(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5,sK6]),skolemize(X3,sK5(X0,X1)),skolemize(X4,sK6(X0,X1))],[f151]) ).
fof(f153,plain,
! [X0,X1,X2] :
( ( next_subocc(X0,X1,X2)
| ~ min_precedes(X0,X1,X2)
| ? [X3] :
( min_precedes(X0,X3,X2)
& min_precedes(X3,X1,X2) ) )
& ( ( min_precedes(X0,X1,X2)
& ! [X3] :
( ~ min_precedes(X0,X3,X2)
| ~ min_precedes(X3,X1,X2) ) )
| ~ next_subocc(X0,X1,X2) ) ),
inference(nnf_transformation,[],[f94]) ).
fof(f154,plain,
! [X0,X1,X2] :
( ( next_subocc(X0,X1,X2)
| ~ min_precedes(X0,X1,X2)
| ? [X3] :
( min_precedes(X0,X3,X2)
& min_precedes(X3,X1,X2) ) )
& ( ( min_precedes(X0,X1,X2)
& ! [X3] :
( ~ min_precedes(X0,X3,X2)
| ~ min_precedes(X3,X1,X2) ) )
| ~ next_subocc(X0,X1,X2) ) ),
inference(flattening,[],[f153]) ).
fof(f155,plain,
! [X0,X1,X2] :
( ( next_subocc(X0,X1,X2)
| ~ min_precedes(X0,X1,X2)
| ? [X3] :
( min_precedes(X0,X3,X2)
& min_precedes(X3,X1,X2) ) )
& ( ( min_precedes(X0,X1,X2)
& ! [X4] :
( ~ min_precedes(X0,X4,X2)
| ~ min_precedes(X4,X1,X2) ) )
| ~ next_subocc(X0,X1,X2) ) ),
inference(rectify,[],[f154]) ).
fof(f156,plain,
! [X0,X1,X2] :
( ( next_subocc(X0,X1,X2)
| ~ min_precedes(X0,X1,X2)
| ( min_precedes(X0,sK7(X0,X1,X2),X2)
& min_precedes(sK7(X0,X1,X2),X1,X2) ) )
& ( ( min_precedes(X0,X1,X2)
& ! [X4] :
( ~ min_precedes(X0,X4,X2)
| ~ min_precedes(X4,X1,X2) ) )
| ~ next_subocc(X0,X1,X2) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK7]),skolemize(X3,sK7(X0,X1,X2))],[f155]) ).
fof(f160,plain,
! [X0,X1,X2] :
( ( occurrence_of(sK9(X0,X1,X2),X0)
& subactivity_occurrence(X1,sK9(X0,X1,X2))
& subactivity_occurrence(X2,sK9(X0,X1,X2)) )
| ~ min_precedes(X1,X2,X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK9]),skolemize(X3,sK9(X0,X1,X2))],[f96]) ).
fof(f168,plain,
! [X0,X1] :
( ( occurrence_of(sK15(X0),tptp3)
& next_subocc(X0,sK15(X0),tptp0)
& occurrence_of(sK16(X0),tptp4)
& next_subocc(sK15(X0),sK16(X0),tptp0)
& ( occurrence_of(sK17(X0),tptp2)
| occurrence_of(sK17(X0),tptp1) )
& next_subocc(sK16(X0),sK17(X0),tptp0)
& leaf(sK17(X0),tptp0) )
| ~ occurrence_of(X1,tptp0)
| ~ subactivity_occurrence(X0,X1)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK15,sK16,sK17]),skolemize(X2,sK15(X0)),skolemize(X3,sK16(X0)),skolemize(X4,sK17(X0))],[f139]) ).
fof(f169,plain,
( ! [X2,X3] :
( ~ occurrence_of(X2,tptp3)
| ~ next_subocc(sK18,X2,tptp0)
| ( ~ occurrence_of(X3,tptp2)
& ~ occurrence_of(X3,tptp1) )
| ~ min_precedes(X2,X3,tptp0)
| ~ leaf(X3,tptp0) )
& occurrence_of(sK19,tptp0)
& subactivity_occurrence(sK18,sK19)
& arboreal(sK18)
& ~ leaf_occ(sK18,sK19) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK18,sK19]),skolemize(X0,sK18),skolemize(X1,sK19)],[f141]) ).
fof(f180,plain,
! [X0,X1] :
( ~ occurrence_of(X0,X1)
| ~ atomic(X1)
| arboreal(X0) ),
inference(cnf_transformation,[],[f143]) ).
fof(f201,plain,
! [X0,X1,X5] :
( ~ min_precedes(X0,X5,X1)
| ~ leaf(X0,X1) ),
inference(cnf_transformation,[],[f152]) ).
fof(f206,plain,
! [X2,X0,X1] :
( ~ next_subocc(X0,X1,X2)
| min_precedes(X0,X1,X2) ),
inference(cnf_transformation,[],[f156]) ).
fof(f215,plain,
! [X2,X0,X1] :
( subactivity_occurrence(X2,sK9(X0,X1,X2))
| ~ min_precedes(X1,X2,X0) ),
inference(cnf_transformation,[],[f160]) ).
fof(f217,plain,
! [X2,X0,X1] :
( occurrence_of(sK9(X0,X1,X2),X0)
| ~ min_precedes(X1,X2,X0) ),
inference(cnf_transformation,[],[f160]) ).
fof(f222,plain,
! [X2,X3,X0,X1] :
( ~ subactivity_occurrence(X3,X1)
| min_precedes(X3,X2,X0)
| X2 = X3
| ~ occurrence_of(X1,X0)
| ~ arboreal(X2)
| ~ arboreal(X3)
| ~ subactivity_occurrence(X2,X1)
| min_precedes(X2,X3,X0) ),
inference(cnf_transformation,[],[f102]) ).
fof(f223,plain,
! [X2,X3,X0,X1] :
( ~ min_precedes(X0,X1,X2)
| subactivity_occurrence(X0,X3)
| ~ occurrence_of(X3,X2)
| ~ subactivity_occurrence(X1,X3) ),
inference(cnf_transformation,[],[f104]) ).
fof(f242,plain,
! [X2,X0,X1] :
( ~ next_subocc(X0,X1,X2)
| arboreal(X1) ),
inference(cnf_transformation,[],[f130]) ).
fof(f249,plain,
! [X0,X1] :
( ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0)
| leaf(sK17(X0),tptp0)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f168]) ).
fof(f250,plain,
! [X0,X1] :
( ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0)
| next_subocc(sK16(X0),sK17(X0),tptp0)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f168]) ).
fof(f251,plain,
! [X0,X1] :
( ~ subactivity_occurrence(X0,X1)
| occurrence_of(sK17(X0),tptp1)
| ~ occurrence_of(X1,tptp0)
| occurrence_of(sK17(X0),tptp2)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f168]) ).
fof(f252,plain,
! [X0,X1] :
( ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0)
| next_subocc(sK15(X0),sK16(X0),tptp0)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f168]) ).
fof(f254,plain,
! [X0,X1] :
( ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0)
| next_subocc(X0,sK15(X0),tptp0)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f168]) ).
fof(f255,plain,
! [X0,X1] :
( ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0)
| occurrence_of(sK15(X0),tptp3)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f168]) ).
fof(f261,plain,
atomic(tptp3),
inference(cnf_transformation,[],[f56]) ).
fof(f268,plain,
~ leaf_occ(sK18,sK19),
inference(cnf_transformation,[],[f169]) ).
fof(f269,plain,
arboreal(sK18),
inference(cnf_transformation,[],[f169]) ).
fof(f270,plain,
subactivity_occurrence(sK18,sK19),
inference(cnf_transformation,[],[f169]) ).
fof(f271,plain,
occurrence_of(sK19,tptp0),
inference(cnf_transformation,[],[f169]) ).
fof(f272,plain,
! [X2,X3] :
( ~ next_subocc(sK18,X2,tptp0)
| ~ occurrence_of(X2,tptp3)
| ~ occurrence_of(X3,tptp1)
| ~ min_precedes(X2,X3,tptp0)
| ~ leaf(X3,tptp0) ),
inference(cnf_transformation,[],[f169]) ).
fof(f273,plain,
! [X2,X3] :
( ~ next_subocc(sK18,X2,tptp0)
| ~ occurrence_of(X2,tptp3)
| ~ occurrence_of(X3,tptp2)
| ~ min_precedes(X2,X3,tptp0)
| ~ leaf(X3,tptp0) ),
inference(cnf_transformation,[],[f169]) ).
fof(f274,plain,
( ~ occurrence_of(sK19,tptp0)
| leaf(sK17(sK18),tptp0)
| ~ arboreal(sK18)
| leaf_occ(sK18,sK19) ),
inference(resolution,[],[f249,f270]) ).
fof(f275,plain,
( leaf(sK17(sK18),tptp0)
| ~ arboreal(sK18)
| leaf_occ(sK18,sK19) ),
inference(forward_subsumption_resolution,[],[f274,f271]) ).
fof(f276,plain,
( leaf(sK17(sK18),tptp0)
| leaf_occ(sK18,sK19) ),
inference(forward_subsumption_resolution,[],[f275,f269]) ).
fof(f277,plain,
leaf(sK17(sK18),tptp0),
inference(forward_subsumption_resolution,[],[f276,f268]) ).
fof(f278,plain,
( ~ occurrence_of(sK19,tptp0)
| occurrence_of(sK15(sK18),tptp3)
| ~ arboreal(sK18)
| leaf_occ(sK18,sK19) ),
inference(resolution,[],[f255,f270]) ).
fof(f279,plain,
( occurrence_of(sK15(sK18),tptp3)
| ~ arboreal(sK18)
| leaf_occ(sK18,sK19) ),
inference(forward_subsumption_resolution,[],[f278,f271]) ).
fof(f280,plain,
( occurrence_of(sK15(sK18),tptp3)
| leaf_occ(sK18,sK19) ),
inference(forward_subsumption_resolution,[],[f279,f269]) ).
fof(f281,plain,
occurrence_of(sK15(sK18),tptp3),
inference(forward_subsumption_resolution,[],[f280,f268]) ).
fof(f282,plain,
( ~ occurrence_of(sK19,tptp0)
| next_subocc(sK18,sK15(sK18),tptp0)
| ~ arboreal(sK18)
| leaf_occ(sK18,sK19) ),
inference(resolution,[],[f254,f270]) ).
fof(f283,plain,
( next_subocc(sK18,sK15(sK18),tptp0)
| ~ arboreal(sK18)
| leaf_occ(sK18,sK19) ),
inference(forward_subsumption_resolution,[],[f282,f271]) ).
fof(f284,plain,
( next_subocc(sK18,sK15(sK18),tptp0)
| leaf_occ(sK18,sK19) ),
inference(forward_subsumption_resolution,[],[f283,f269]) ).
fof(f285,plain,
next_subocc(sK18,sK15(sK18),tptp0),
inference(forward_subsumption_resolution,[],[f284,f268]) ).
fof(f287,plain,
( ~ occurrence_of(sK19,tptp0)
| next_subocc(sK15(sK18),sK16(sK18),tptp0)
| ~ arboreal(sK18)
| leaf_occ(sK18,sK19) ),
inference(resolution,[],[f252,f270]) ).
fof(f288,plain,
( next_subocc(sK15(sK18),sK16(sK18),tptp0)
| ~ arboreal(sK18)
| leaf_occ(sK18,sK19) ),
inference(forward_subsumption_resolution,[],[f287,f271]) ).
fof(f289,plain,
( next_subocc(sK15(sK18),sK16(sK18),tptp0)
| leaf_occ(sK18,sK19) ),
inference(forward_subsumption_resolution,[],[f288,f269]) ).
fof(f290,plain,
next_subocc(sK15(sK18),sK16(sK18),tptp0),
inference(forward_subsumption_resolution,[],[f289,f268]) ).
fof(f295,plain,
( ~ occurrence_of(sK19,tptp0)
| next_subocc(sK16(sK18),sK17(sK18),tptp0)
| ~ arboreal(sK18)
| leaf_occ(sK18,sK19) ),
inference(resolution,[],[f250,f270]) ).
fof(f296,plain,
( next_subocc(sK16(sK18),sK17(sK18),tptp0)
| ~ arboreal(sK18)
| leaf_occ(sK18,sK19) ),
inference(forward_subsumption_resolution,[],[f295,f271]) ).
fof(f297,plain,
( next_subocc(sK16(sK18),sK17(sK18),tptp0)
| leaf_occ(sK18,sK19) ),
inference(forward_subsumption_resolution,[],[f296,f269]) ).
fof(f298,plain,
next_subocc(sK16(sK18),sK17(sK18),tptp0),
inference(forward_subsumption_resolution,[],[f297,f268]) ).
fof(f299,plain,
min_precedes(sK15(sK18),sK16(sK18),tptp0),
inference(resolution,[],[f290,f206]) ).
fof(f300,plain,
min_precedes(sK16(sK18),sK17(sK18),tptp0),
inference(resolution,[],[f298,f206]) ).
fof(f301,plain,
! [X0] :
( ~ occurrence_of(sK15(sK18),tptp3)
| ~ occurrence_of(X0,tptp2)
| ~ min_precedes(sK15(sK18),X0,tptp0)
| ~ leaf(X0,tptp0) ),
inference(resolution,[],[f273,f285]) ).
fof(f302,plain,
! [X0] :
( ~ min_precedes(sK15(sK18),X0,tptp0)
| ~ occurrence_of(X0,tptp2)
| ~ leaf(X0,tptp0) ),
inference(forward_subsumption_resolution,[],[f301,f281]) ).
fof(f313,plain,
! [X0] :
( ~ occurrence_of(sK15(sK18),tptp3)
| ~ occurrence_of(X0,tptp1)
| ~ min_precedes(sK15(sK18),X0,tptp0)
| ~ leaf(X0,tptp0) ),
inference(resolution,[],[f272,f285]) ).
fof(f314,plain,
! [X0] :
( ~ min_precedes(sK15(sK18),X0,tptp0)
| ~ occurrence_of(X0,tptp1)
| ~ leaf(X0,tptp0) ),
inference(forward_subsumption_resolution,[],[f313,f281]) ).
fof(f316,plain,
( occurrence_of(sK17(sK18),tptp1)
| ~ occurrence_of(sK19,tptp0)
| occurrence_of(sK17(sK18),tptp2)
| ~ arboreal(sK18)
| leaf_occ(sK18,sK19) ),
inference(resolution,[],[f251,f270]) ).
fof(f317,plain,
( occurrence_of(sK17(sK18),tptp1)
| occurrence_of(sK17(sK18),tptp2)
| ~ arboreal(sK18)
| leaf_occ(sK18,sK19) ),
inference(forward_subsumption_resolution,[],[f316,f271]) ).
fof(f318,plain,
( occurrence_of(sK17(sK18),tptp1)
| occurrence_of(sK17(sK18),tptp2)
| leaf_occ(sK18,sK19) ),
inference(forward_subsumption_resolution,[],[f317,f269]) ).
fof(f319,plain,
( occurrence_of(sK17(sK18),tptp1)
| occurrence_of(sK17(sK18),tptp2) ),
inference(forward_subsumption_resolution,[],[f318,f268]) ).
fof(f321,definition,
( spl20_3
<=> occurrence_of(sK17(sK18),tptp2) ),
introduced(definition,[new_symbols(definition,[spl20_3])],[avatar_definition]) ).
fof(f323,plain,
( occurrence_of(sK17(sK18),tptp2)
| ~ spl20_3 ),
inference(avatar_component_clause,[],[f321]) ).
fof(f325,definition,
( spl20_4
<=> occurrence_of(sK17(sK18),tptp1) ),
introduced(definition,[new_symbols(definition,[spl20_4])],[avatar_definition]) ).
fof(f327,plain,
( occurrence_of(sK17(sK18),tptp1)
| ~ spl20_4 ),
inference(avatar_component_clause,[],[f325]) ).
fof(f328,plain,
( spl20_3
| spl20_4 ),
inference(avatar_split_clause,[],[f319,f325,f321]) ).
fof(f360,plain,
~ leaf(sK15(sK18),tptp0),
inference(resolution,[],[f201,f299]) ).
fof(f375,plain,
! [X2,X3,X0,X1,X4] :
( ~ subactivity_occurrence(X3,sK9(X2,X0,X1))
| min_precedes(X1,X3,X4)
| X1 = X3
| ~ occurrence_of(sK9(X2,X0,X1),X4)
| ~ arboreal(X3)
| ~ arboreal(X1)
| ~ min_precedes(X0,X1,X2)
| min_precedes(X3,X1,X4) ),
inference(resolution,[],[f215,f222]) ).
fof(f408,plain,
( ~ atomic(tptp3)
| arboreal(sK15(sK18)) ),
inference(resolution,[],[f180,f281]) ).
fof(f414,plain,
arboreal(sK15(sK18)),
inference(forward_subsumption_resolution,[],[f408,f261]) ).
fof(f607,plain,
arboreal(sK17(sK18)),
inference(resolution,[],[f242,f298]) ).
fof(f727,plain,
! [X0] :
( ~ subactivity_occurrence(sK16(sK18),X0)
| ~ occurrence_of(X0,tptp0)
| subactivity_occurrence(sK15(sK18),X0) ),
inference(resolution,[],[f223,f299]) ).
fof(f729,plain,
! [X0] :
( ~ subactivity_occurrence(sK17(sK18),X0)
| ~ occurrence_of(X0,tptp0)
| subactivity_occurrence(sK16(sK18),X0) ),
inference(resolution,[],[f223,f300]) ).
fof(f734,plain,
! [X0,X1] :
( subactivity_occurrence(sK16(sK18),sK9(X0,X1,sK17(sK18)))
| ~ occurrence_of(sK9(X0,X1,sK17(sK18)),tptp0)
| ~ min_precedes(X1,sK17(sK18),X0) ),
inference(resolution,[],[f729,f215]) ).
fof(f1071,plain,
! [X0,X1] :
( ~ occurrence_of(sK9(X0,X1,sK17(sK18)),tptp0)
| ~ min_precedes(X1,sK17(sK18),X0)
| ~ occurrence_of(sK9(X0,X1,sK17(sK18)),tptp0)
| subactivity_occurrence(sK15(sK18),sK9(X0,X1,sK17(sK18))) ),
inference(resolution,[],[f734,f727]) ).
fof(f1093,plain,
! [X0,X1] :
( subactivity_occurrence(sK15(sK18),sK9(X0,X1,sK17(sK18)))
| ~ min_precedes(X1,sK17(sK18),X0)
| ~ occurrence_of(sK9(X0,X1,sK17(sK18)),tptp0) ),
inference(duplicate_literal_removal,[],[f1071]) ).
fof(f1149,plain,
! [X2,X0,X1] :
( ~ min_precedes(X0,sK17(sK18),X1)
| ~ occurrence_of(sK9(X1,X0,sK17(sK18)),tptp0)
| min_precedes(sK17(sK18),sK15(sK18),X2)
| sK17(sK18) = sK15(sK18)
| ~ occurrence_of(sK9(X1,X0,sK17(sK18)),X2)
| ~ arboreal(sK15(sK18))
| ~ arboreal(sK17(sK18))
| ~ min_precedes(X0,sK17(sK18),X1)
| min_precedes(sK15(sK18),sK17(sK18),X2) ),
inference(resolution,[],[f1093,f375]) ).
fof(f1167,plain,
! [X2,X0,X1] :
( ~ min_precedes(X0,sK17(sK18),X1)
| ~ occurrence_of(sK9(X1,X0,sK17(sK18)),tptp0)
| min_precedes(sK17(sK18),sK15(sK18),X2)
| sK17(sK18) = sK15(sK18)
| ~ occurrence_of(sK9(X1,X0,sK17(sK18)),X2)
| ~ arboreal(sK15(sK18))
| ~ arboreal(sK17(sK18))
| min_precedes(sK15(sK18),sK17(sK18),X2) ),
inference(duplicate_literal_removal,[],[f1149]) ).
fof(f1173,plain,
! [X2,X0,X1] :
( ~ min_precedes(X0,sK17(sK18),X1)
| ~ occurrence_of(sK9(X1,X0,sK17(sK18)),tptp0)
| min_precedes(sK17(sK18),sK15(sK18),X2)
| sK17(sK18) = sK15(sK18)
| ~ occurrence_of(sK9(X1,X0,sK17(sK18)),X2)
| ~ arboreal(sK17(sK18))
| min_precedes(sK15(sK18),sK17(sK18),X2) ),
inference(forward_subsumption_resolution,[],[f1167,f414]) ).
fof(f1177,definition,
( spl20_48
<=> sK17(sK18) = sK15(sK18) ),
introduced(definition,[new_symbols(definition,[spl20_48])],[avatar_definition]) ).
fof(f1179,plain,
( sK17(sK18) = sK15(sK18)
| ~ spl20_48 ),
inference(avatar_component_clause,[],[f1177]) ).
fof(f1181,definition,
( spl20_49
<=> ! [X2,X0,X1] :
( ~ min_precedes(X0,sK17(sK18),X1)
| min_precedes(sK15(sK18),sK17(sK18),X2)
| ~ occurrence_of(sK9(X1,X0,sK17(sK18)),X2)
| min_precedes(sK17(sK18),sK15(sK18),X2)
| ~ occurrence_of(sK9(X1,X0,sK17(sK18)),tptp0) ) ),
introduced(definition,[new_symbols(definition,[spl20_49])],[avatar_definition]) ).
fof(f1182,plain,
( ! [X2,X0,X1] :
( ~ occurrence_of(sK9(X1,X0,sK17(sK18)),tptp0)
| min_precedes(sK15(sK18),sK17(sK18),X2)
| ~ occurrence_of(sK9(X1,X0,sK17(sK18)),X2)
| min_precedes(sK17(sK18),sK15(sK18),X2)
| ~ min_precedes(X0,sK17(sK18),X1) )
| ~ spl20_49 ),
inference(avatar_component_clause,[],[f1181]) ).
fof(f1185,plain,
! [X2,X0,X1] :
( ~ min_precedes(X0,sK17(sK18),X1)
| ~ occurrence_of(sK9(X1,X0,sK17(sK18)),tptp0)
| min_precedes(sK17(sK18),sK15(sK18),X2)
| sK17(sK18) = sK15(sK18)
| ~ occurrence_of(sK9(X1,X0,sK17(sK18)),X2)
| min_precedes(sK15(sK18),sK17(sK18),X2) ),
inference(forward_subsumption_resolution,[],[f1173,f607]) ).
fof(f1186,plain,
( spl20_48
| spl20_49 ),
inference(avatar_split_clause,[],[f1185,f1181,f1177]) ).
fof(f1198,plain,
( ~ leaf(sK17(sK18),tptp0)
| ~ spl20_48 ),
inference(superposition,[],[f360,f1179]) ).
fof(f1236,plain,
( $false
| ~ spl20_48 ),
inference(forward_subsumption_resolution,[],[f1198,f277]) ).
fof(f1237,plain,
~ spl20_48,
inference(avatar_contradiction_clause,[],[f1236]) ).
fof(f1242,plain,
( ! [X0,X1] :
( min_precedes(sK15(sK18),sK17(sK18),X0)
| ~ occurrence_of(sK9(tptp0,X1,sK17(sK18)),X0)
| min_precedes(sK17(sK18),sK15(sK18),X0)
| ~ min_precedes(X1,sK17(sK18),tptp0)
| ~ min_precedes(X1,sK17(sK18),tptp0) )
| ~ spl20_49 ),
inference(resolution,[],[f1182,f217]) ).
fof(f1243,plain,
( ! [X0,X1] :
( ~ occurrence_of(sK9(tptp0,X1,sK17(sK18)),X0)
| min_precedes(sK15(sK18),sK17(sK18),X0)
| min_precedes(sK17(sK18),sK15(sK18),X0)
| ~ min_precedes(X1,sK17(sK18),tptp0) )
| ~ spl20_49 ),
inference(duplicate_literal_removal,[],[f1242]) ).
fof(f1244,plain,
( ! [X0] :
( min_precedes(sK15(sK18),sK17(sK18),tptp0)
| min_precedes(sK17(sK18),sK15(sK18),tptp0)
| ~ min_precedes(X0,sK17(sK18),tptp0)
| ~ min_precedes(X0,sK17(sK18),tptp0) )
| ~ spl20_49 ),
inference(resolution,[],[f1243,f217]) ).
fof(f1246,plain,
( ! [X0] :
( min_precedes(sK15(sK18),sK17(sK18),tptp0)
| min_precedes(sK17(sK18),sK15(sK18),tptp0)
| ~ min_precedes(X0,sK17(sK18),tptp0) )
| ~ spl20_49 ),
inference(duplicate_literal_removal,[],[f1244]) ).
fof(f1249,definition,
( spl20_50
<=> ! [X0] : ~ min_precedes(X0,sK17(sK18),tptp0) ),
introduced(definition,[new_symbols(definition,[spl20_50])],[avatar_definition]) ).
fof(f1250,plain,
( ! [X0] : ~ min_precedes(X0,sK17(sK18),tptp0)
| ~ spl20_50 ),
inference(avatar_component_clause,[],[f1249]) ).
fof(f1252,definition,
( spl20_51
<=> min_precedes(sK15(sK18),sK17(sK18),tptp0) ),
introduced(definition,[new_symbols(definition,[spl20_51])],[avatar_definition]) ).
fof(f1254,plain,
( min_precedes(sK15(sK18),sK17(sK18),tptp0)
| ~ spl20_51 ),
inference(avatar_component_clause,[],[f1252]) ).
fof(f1261,definition,
( spl20_52
<=> min_precedes(sK17(sK18),sK15(sK18),tptp0) ),
introduced(definition,[new_symbols(definition,[spl20_52])],[avatar_definition]) ).
fof(f1263,plain,
( min_precedes(sK17(sK18),sK15(sK18),tptp0)
| ~ spl20_52 ),
inference(avatar_component_clause,[],[f1261]) ).
fof(f1264,plain,
( spl20_50
| spl20_52
| spl20_51
| ~ spl20_49 ),
inference(avatar_split_clause,[],[f1246,f1181,f1252,f1261,f1249]) ).
fof(f1266,plain,
( $false
| ~ spl20_50 ),
inference(resolution,[],[f1250,f300]) ).
fof(f1267,plain,
~ spl20_50,
inference(avatar_contradiction_clause,[],[f1266]) ).
fof(f1269,plain,
( ~ occurrence_of(sK17(sK18),tptp1)
| ~ leaf(sK17(sK18),tptp0)
| ~ spl20_51 ),
inference(resolution,[],[f1254,f314]) ).
fof(f1270,plain,
( ~ occurrence_of(sK17(sK18),tptp2)
| ~ leaf(sK17(sK18),tptp0)
| ~ spl20_51 ),
inference(resolution,[],[f1254,f302]) ).
fof(f1278,plain,
( ~ leaf(sK17(sK18),tptp0)
| ~ spl20_4
| ~ spl20_51 ),
inference(forward_subsumption_resolution,[],[f1269,f327]) ).
fof(f1279,plain,
( $false
| ~ spl20_4
| ~ spl20_51 ),
inference(forward_subsumption_resolution,[],[f1278,f277]) ).
fof(f1280,plain,
( ~ spl20_4
| ~ spl20_51 ),
inference(avatar_contradiction_clause,[],[f1279]) ).
fof(f1281,plain,
( ~ leaf(sK17(sK18),tptp0)
| ~ spl20_3
| ~ spl20_51 ),
inference(forward_subsumption_resolution,[],[f1270,f323]) ).
fof(f1282,plain,
( $false
| ~ spl20_3
| ~ spl20_51 ),
inference(forward_subsumption_resolution,[],[f1281,f277]) ).
fof(f1283,plain,
( ~ spl20_3
| ~ spl20_51 ),
inference(avatar_contradiction_clause,[],[f1282]) ).
fof(f1291,plain,
( ~ leaf(sK17(sK18),tptp0)
| ~ spl20_52 ),
inference(resolution,[],[f1263,f201]) ).
fof(f1295,plain,
( $false
| ~ spl20_52 ),
inference(forward_subsumption_resolution,[],[f1291,f277]) ).
fof(f1296,plain,
~ spl20_52,
inference(avatar_contradiction_clause,[],[f1295]) ).
cnf(s2,plain,
( spl20_3
| spl20_4 ),
inference(sat_conversion,[],[f328]) ).
cnf(s42,plain,
( spl20_48
| spl20_49 ),
inference(sat_conversion,[],[f1186]) ).
cnf(s44,plain,
~ spl20_48,
inference(sat_conversion,[],[f1237]) ).
cnf(s47,plain,
( ~ spl20_49
| spl20_50
| spl20_51
| spl20_52 ),
inference(sat_conversion,[],[f1264]) ).
cnf(s48,plain,
~ spl20_50,
inference(sat_conversion,[],[f1267]) ).
cnf(s49,plain,
( ~ spl20_4
| ~ spl20_51 ),
inference(sat_conversion,[],[f1280]) ).
cnf(s50,plain,
( ~ spl20_3
| ~ spl20_51 ),
inference(sat_conversion,[],[f1283]) ).
cnf(s51,plain,
~ spl20_52,
inference(sat_conversion,[],[f1296]) ).
cnf(s52,plain,
( ~ spl20_49
| spl20_51 ),
inference(rat,[],[s47,s51,s48]) ).
cnf(s54,plain,
spl20_49,
inference(rat,[],[s42,s44]) ).
cnf(s55,plain,
spl20_51,
inference(rat,[],[s52,s54]) ).
cnf(s56,plain,
~ spl20_3,
inference(rat,[],[s50,s55]) ).
cnf(s57,plain,
~ spl20_4,
inference(rat,[],[s49,s55]) ).
cnf(s73,plain,
$false,
inference(rat,[],[s2,s57,s56]) ).
fof(f1297,plain,
$false,
inference(avatar_sat_refutation,[],[s73]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : PRO014+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.02 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.04/0.30 % Computer : n012.cluster.edu
% 0.04/0.30 % Model : x86_64 x86_64
% 0.04/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.04/0.30 % Memory : 8046.5625MB
% 0.04/0.30 % OS : Linux 6.8.0-71-generic
% 0.04/0.30 % CPULimit : 300
% 0.04/0.30 % WCLimit : 300
% 0.04/0.30 % DateTime : Sun Sep 27 22:21:49 UTC 2026
% 0.04/0.30 % CPUTime :
% 0.04/0.30 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.04/0.32 Running first-order theorem proving
% 0.04/0.32 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.92/1.20 % (2813059)Detected formulas, will run a generic FOF schedule.
% 2.92/1.20 % (2813069)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2622443196:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.92/1.20 % (2813065)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=3998134064:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.92/1.20 % (2813067)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=3252996735:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.92/1.20 % (2813066)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=3814626602:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.92/1.20 % (2813068)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=516934880:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.92/1.20 % (2813064)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=300452445:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.92/1.20 % (2813070)dis-21_1_sil=8000:lcm=predicate:random_seed=3322074413: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.92/1.20 % (2813067)Refutation not found, incomplete strategy
% 2.92/1.20 % (2813067)------------------------------
% 2.92/1.20 % (2813067)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.92/1.20 % (2813067)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.92/1.20 % (2813067)CaDiCaL version: 2.1.3
% 2.92/1.20 % (2813067)Termination reason: Refutation not found, incomplete strategy
% 2.92/1.20 % (2813067)Time elapsed: 0.002 s
% 2.92/1.20 % (2813067)Peak memory usage: 88 MB
% 2.92/1.20 % (2813067)Instructions burned: 5 (million)
% 2.92/1.20 % (2813068)Instruction limit reached!
% 2.92/1.20 % (2813068)------------------------------
% 2.92/1.20 % (2813068)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.92/1.20 % (2813068)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.92/1.20 % (2813068)CaDiCaL version: 2.1.3
% 2.92/1.20 % (2813068)Termination reason: Instruction limit
% 2.92/1.20 % (2813068)Termination phase: Saturation
% 2.92/1.20 % (2813068)Time elapsed: 0.039 s
% 2.92/1.20 % (2813068)Peak memory usage: 88 MB
% 2.92/1.20 % (2813068)Instructions burned: 122 (million)
% 2.92/1.20 % (2813070)Instruction limit reached!
% 2.92/1.20 % (2813070)------------------------------
% 2.92/1.20 % (2813070)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.92/1.20 % (2813070)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.92/1.20 % (2813070)CaDiCaL version: 2.1.3
% 2.92/1.20 % (2813070)Termination reason: Instruction limit
% 2.92/1.20 % (2813070)Termination phase: Saturation
% 2.92/1.20 % (2813070)Time elapsed: 0.040 s
% 2.92/1.20 % (2813070)Peak memory usage: 88 MB
% 2.92/1.20 % (2813070)Instructions burned: 131 (million)
% 2.92/1.20 % (2813069)Instruction limit reached!
% 2.92/1.20 % (2813069)------------------------------
% 2.92/1.20 % (2813069)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.92/1.20 % (2813069)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.92/1.20 % (2813069)CaDiCaL version: 2.1.3
% 2.92/1.20 % (2813069)Termination reason: Instruction limit
% 2.92/1.20 % (2813069)Termination phase: Saturation
% 2.92/1.20 % (2813069)Time elapsed: 0.052 s
% 2.92/1.20 % (2813069)Peak memory usage: 89 MB
% 2.92/1.20 % (2813069)Instructions burned: 142 (million)
% 2.92/1.20 % (2813079)lrs+10_1_sil=32000:urr=on:br=off:random_seed=2981008918:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/157Mi)
% 2.92/1.20 % (2813078)lrs+10_1_sil=8000:sp=occurrence:random_seed=1948345546:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 2.92/1.20 % (2813080)lrs+1011_1_sil=32000:sp=occurrence:random_seed=2277925478:i=325:sd=1:ss=axioms:sgt=32_2998 on theBenchmark for (2998ds/325Mi)
% 2.92/1.20 % (2813067)------------------------------
% 2.92/1.20 % (2813067)------------------------------
% 2.92/1.20 % (2813079)Instruction limit reached!
% 2.92/1.20 % (2813079)------------------------------
% 2.92/1.20 % (2813079)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.92/1.20 % (2813079)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.92/1.20 % (2813079)CaDiCaL version: 2.1.3
% 2.92/1.20 % (2813079)Termination reason: Instruction limit
% 2.92/1.20 % (2813079)Termination phase: Saturation
% 2.92/1.20 % (2813079)Time elapsed: 0.045 s
% 2.92/1.20 % (2813079)Peak memory usage: 88 MB
% 2.92/1.20 % (2813079)Instructions burned: 160 (million)
% 2.92/1.20 % (2813078)Instruction limit reached!
% 2.92/1.20 % (2813078)------------------------------
% 2.92/1.20 % (2813078)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.92/1.20 % (2813078)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.92/1.20 % (2813078)CaDiCaL version: 2.1.3
% 2.92/1.20 % (2813078)Termination reason: Instruction limit
% 2.92/1.20 % (2813078)Termination phase: Saturation
% 2.92/1.20 % (2813078)Time elapsed: 0.097 s
% 2.92/1.20 % (2813078)Peak memory usage: 91 MB
% 2.92/1.20 % (2813078)Instructions burned: 286 (million)
% 2.92/1.20 % (2813084)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=1219534255:s2a=on:i=248:s2at=1.23:gtg=position_2997 on theBenchmark for (2997ds/248Mi)
% 2.92/1.20 % (2813085)lrs+1002_1_to=lpo:sil=8000:sos=on:random_seed=817500228:st=4:cts=off:i=294:sd=2:ins=7:amm=off:ss=axioms_2997 on theBenchmark for (2997ds/294Mi)
% 2.92/1.20 % (2813080)Instruction limit reached!
% 2.92/1.20 % (2813080)------------------------------
% 2.92/1.20 % (2813080)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.92/1.20 % (2813080)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.92/1.20 % (2813080)CaDiCaL version: 2.1.3
% 2.92/1.20 % (2813080)Termination reason: Instruction limit
% 2.92/1.20 % (2813080)Termination phase: Saturation
% 2.92/1.20 % (2813080)Time elapsed: 0.119 s
% 2.92/1.20 % (2813080)Peak memory usage: 92 MB
% 2.92/1.20 % (2813080)Instructions burned: 326 (million)
% 2.92/1.20 % (2813084)Instruction limit reached!
% 2.92/1.20 % (2813084)------------------------------
% 2.92/1.20 % (2813084)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.92/1.20 % (2813084)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.92/1.20 % (2813084)CaDiCaL version: 2.1.3
% 2.92/1.20 % (2813084)Termination reason: Instruction limit
% 2.92/1.20 % (2813084)Termination phase: Saturation
% 2.92/1.20 % (2813084)Time elapsed: 0.073 s
% 2.92/1.20 % (2813084)Peak memory usage: 89 MB
% 2.92/1.20 % (2813084)Instructions burned: 249 (million)
% 2.92/1.20 % (2813086)lrs+10_1_ncem=casc2026/models/loop7.pt:sil=32000:tgt=ground:npcc=on:random_seed=4102218969:i=2350_2996 on theBenchmark for (2996ds/2350Mi)
% 2.92/1.20 % (2813085)Instruction limit reached!
% 2.92/1.20 % (2813085)------------------------------
% 2.92/1.20 % (2813085)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.92/1.20 % (2813085)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.92/1.20 % (2813085)CaDiCaL version: 2.1.3
% 2.92/1.20 % (2813085)Termination reason: Instruction limit
% 2.92/1.20 % (2813085)Termination phase: Saturation
% 2.92/1.20 % (2813085)Time elapsed: 0.096 s
% 2.92/1.20 % (2813085)Peak memory usage: 89 MB
% 2.92/1.20 % (2813085)Instructions burned: 294 (million)
% 2.92/1.20 % (2813089)dis-1011_32:1_sfv=off:sil=16000:sos=all:erd=off:acc=on:fd=off:flr=on:random_seed=3169219274:cts=off:i=113:fsr=off:ss=included:sgt=4_2996 on theBenchmark for (2996ds/113Mi)
% 2.92/1.20 % (2813064)First to succeed.
% 2.92/1.20 % (2813064)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-2813059"
% 2.92/1.20 % (2813089)Instruction limit reached!
% 2.92/1.20 % (2813089)------------------------------
% 2.92/1.20 % (2813089)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.92/1.20 % (2813089)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.92/1.20 % (2813089)CaDiCaL version: 2.1.3
% 2.92/1.20 % (2813089)Termination reason: Instruction limit
% 2.92/1.20 % (2813089)Termination phase: Saturation
% 2.92/1.20 % (2813089)Time elapsed: 0.046 s
% 2.92/1.20 % (2813089)Peak memory usage: 90 MB
% 2.92/1.20 % (2813089)Instructions burned: 115 (million)
% 2.92/1.20 % (2813090)lrs-1004_1_sil=8000:sp=occurrence:sos=all:erd=off:fs=off:bce=on:random_seed=3060902710:i=127:av=off:fsr=off:sup=off_2995 on theBenchmark for (2995ds/127Mi)
% 2.92/1.20 % (2813092)dis-1003_1024_sil=8000:sos=all:sac=on:random_seed=3649058683:cond=fast:i=114:sd=1:nm=0:fsr=off:gtg=exists_sym:ss=axioms_2995 on theBenchmark for (2995ds/114Mi)
% 2.92/1.20 % (2813090)Instruction limit reached!
% 2.92/1.20 % (2813090)------------------------------
% 2.92/1.20 % (2813090)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.92/1.20 % (2813090)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.92/1.20 % (2813090)CaDiCaL version: 2.1.3
% 2.92/1.20 % (2813090)Termination reason: Instruction limit
% 2.92/1.20 % (2813090)Termination phase: Saturation
% 2.92/1.20 % (2813090)Time elapsed: 0.037 s
% 2.92/1.20 % (2813090)Peak memory usage: 89 MB
% 2.92/1.20 % (2813090)Instructions burned: 129 (million)
% 2.92/1.20 % (2813092)Instruction limit reached!
% 2.92/1.20 % (2813092)------------------------------
% 2.92/1.20 % (2813092)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.92/1.20 % (2813092)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.92/1.20 % (2813092)CaDiCaL version: 2.1.3
% 2.92/1.20 % (2813092)Termination reason: Instruction limit
% 2.92/1.20 % (2813092)Termination phase: Saturation
% 2.92/1.20 % (2813092)Time elapsed: 0.041 s
% 2.92/1.20 % (2813092)Peak memory usage: 89 MB
% 2.92/1.20 % (2813092)Instructions burned: 117 (million)
% 2.92/1.20 % (2813095)lrs+10_1_sil=8000:sp=occurrence:random_seed=3324038252:st=1.2:i=907:sd=14:ss=axioms:sgt=12_2994 on theBenchmark for (2994ds/907Mi)
% 2.92/1.20 % (2813097)dis-1010_1_sil=16000:fde=unused:sp=occurrence:sos=on:random_seed=2355034502:i=437:sd=1:aac=none:ss=included_2994 on theBenchmark for (2994ds/437Mi)
% 2.92/1.20 % (2813064)Refutation found. Thanks to Tanya!
% 2.92/1.20 % SZS status Theorem for theBenchmark
% 2.92/1.20 % SZS output start Proof for theBenchmark
% See solution above
% 2.92/1.29 % (2813064)------------------------------
% 2.92/1.29 % (2813064)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.92/1.29 % (2813064)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.92/1.29 % (2813064)CaDiCaL version: 2.1.3
% 2.92/1.29 % (2813064)Termination reason: Refutation
% 2.92/1.29 % (2813064)Time elapsed: 0.414 s
% 2.92/1.29 % (2813064)Peak memory usage: 130 MB
% 2.92/1.29 % (2813064)Instructions burned: 1103 (million)
% 2.92/1.29 % (2813064)------------------------------
% 2.92/1.29 % (2813064)------------------------------
% 2.92/1.29 % (2813059)Success in time 0.685 s
% 2.92/1.29 % Vampire exiting
%------------------------------------------------------------------------------