%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : PRO006+3 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n003.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:23 PM UTC 2026
% Result : Theorem 7.29s 1.87s
% Output : Refutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 21
% Syntax : Number of formulae : 149 ( 22 unt; 5 def)
% Number of atoms : 495 ( 48 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 604 ( 258 ~; 265 |; 62 &)
% ( 10 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 16 ( 14 usr; 6 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 5 con; 0-3 aty)
% Number of variables : 239 ( 0 sgn 219 !; 20 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0,X1,X2] :
( ( occurrence_of(X0,X1)
& occurrence_of(X0,X2) )
=> X1 = X2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_02) ).
fof(f8,axiom,
! [X0,X1] :
( occurrence_of(X0,X1)
=> ( arboreal(X0)
<=> atomic(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_07) ).
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/sandbox/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/sandbox/benchmark/theBenchmark.p',sos_25) ).
fof(f34,axiom,
! [X0,X1] :
( root_occ(X0,X1)
<=> ? [X2] :
( occurrence_of(X1,X2)
& subactivity_occurrence(X0,X1)
& root(X0,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_33) ).
fof(f38,axiom,
! [X0,X1,X2] :
( ( occurrence_of(X0,X2)
& leaf_occ(X1,X0) )
=> ~ ? [X3] : min_precedes(X1,X3,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_37) ).
fof(f43,axiom,
! [X0,X1,X2,X3] :
( ( occurrence_of(X1,X0)
& subactivity_occurrence(X2,X1)
& root_occ(X3,X1)
& arboreal(X2)
& ~ min_precedes(X3,X2,X0) )
=> X3 = X2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_42) ).
fof(f44,axiom,
! [X0,X1,X2,X3] :
( ( occurrence_of(X1,X0)
& subactivity_occurrence(X2,X1)
& leaf_occ(X3,X1)
& arboreal(X2)
& ~ min_precedes(X2,X3,X0) )
=> X3 = X2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_43) ).
fof(f47,axiom,
! [X0,X1,X2] :
( min_precedes(X0,X1,X2)
=> arboreal(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_46) ).
fof(f50,axiom,
! [X0] :
( occurrence_of(X0,tptp0)
=> ? [X1,X2] :
( occurrence_of(X1,tptp4)
& root_occ(X1,X0)
& occurrence_of(X2,tptp3)
& leaf_occ(X2,X0)
& next_subocc(X1,X2,tptp0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_49) ).
fof(f53,axiom,
atomic(tptp4),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_52) ).
fof(f56,axiom,
atomic(tptp1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_55) ).
fof(f57,axiom,
tptp4 != tptp1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_56) ).
fof(f60,axiom,
tptp1 != tptp3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_59) ).
fof(f63,axiom,
! [X0,X1] :
( ( occurrence_of(X1,tptp0)
& subactivity_occurrence(X0,X1)
& arboreal(X0)
& ~ leaf_occ(X0,X1) )
=> ? [X2] :
( occurrence_of(X2,tptp1)
& next_subocc(X0,X2,tptp0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_62) ).
fof(f64,conjecture,
~ ? [X0] : occurrence_of(X0,tptp0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(f65,negated_conjecture,
~ ~ ? [X0] : occurrence_of(X0,tptp0),
inference(negated_conjecture,[status(cth)],[f64]) ).
fof(f66,plain,
? [X0] : occurrence_of(X0,tptp0),
inference(flattening,[],[f65]) ).
fof(f69,plain,
! [X0,X1,X2] :
( X1 = X2
| ~ occurrence_of(X0,X1)
| ~ occurrence_of(X0,X2) ),
inference(ennf_transformation,[],[f3]) ).
fof(f70,plain,
! [X0,X1,X2] :
( X1 = X2
| ~ occurrence_of(X0,X1)
| ~ occurrence_of(X0,X2) ),
inference(flattening,[],[f69]) ).
fof(f77,plain,
! [X0,X1] :
( ( arboreal(X0)
<=> atomic(X1) )
| ~ occurrence_of(X0,X1) ),
inference(ennf_transformation,[],[f8]) ).
fof(f95,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(f97,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(f116,plain,
! [X0,X1,X2] :
( ! [X3] : ~ min_precedes(X1,X3,X2)
| ~ occurrence_of(X0,X2)
| ~ leaf_occ(X1,X0) ),
inference(ennf_transformation,[],[f38]) ).
fof(f117,plain,
! [X0,X1,X2] :
( ! [X3] : ~ min_precedes(X1,X3,X2)
| ~ occurrence_of(X0,X2)
| ~ leaf_occ(X1,X0) ),
inference(flattening,[],[f116]) ).
fof(f126,plain,
! [X0,X1,X2,X3] :
( X3 = X2
| ~ occurrence_of(X1,X0)
| ~ subactivity_occurrence(X2,X1)
| ~ root_occ(X3,X1)
| ~ arboreal(X2)
| min_precedes(X3,X2,X0) ),
inference(ennf_transformation,[],[f43]) ).
fof(f127,plain,
! [X0,X1,X2,X3] :
( X3 = X2
| ~ occurrence_of(X1,X0)
| ~ subactivity_occurrence(X2,X1)
| ~ root_occ(X3,X1)
| ~ arboreal(X2)
| min_precedes(X3,X2,X0) ),
inference(flattening,[],[f126]) ).
fof(f128,plain,
! [X0,X1,X2,X3] :
( X3 = X2
| ~ occurrence_of(X1,X0)
| ~ subactivity_occurrence(X2,X1)
| ~ leaf_occ(X3,X1)
| ~ arboreal(X2)
| min_precedes(X2,X3,X0) ),
inference(ennf_transformation,[],[f44]) ).
fof(f129,plain,
! [X0,X1,X2,X3] :
( X3 = X2
| ~ occurrence_of(X1,X0)
| ~ subactivity_occurrence(X2,X1)
| ~ leaf_occ(X3,X1)
| ~ arboreal(X2)
| min_precedes(X2,X3,X0) ),
inference(flattening,[],[f128]) ).
fof(f133,plain,
! [X0,X1,X2] :
( arboreal(X0)
| ~ min_precedes(X0,X1,X2) ),
inference(ennf_transformation,[],[f47]) ).
fof(f138,plain,
! [X0] :
( ? [X1,X2] :
( occurrence_of(X1,tptp4)
& root_occ(X1,X0)
& occurrence_of(X2,tptp3)
& leaf_occ(X2,X0)
& next_subocc(X1,X2,tptp0) )
| ~ occurrence_of(X0,tptp0) ),
inference(ennf_transformation,[],[f50]) ).
fof(f139,plain,
! [X0,X1] :
( ? [X2] :
( occurrence_of(X2,tptp1)
& next_subocc(X0,X2,tptp0) )
| ~ occurrence_of(X1,tptp0)
| ~ subactivity_occurrence(X0,X1)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(ennf_transformation,[],[f63]) ).
fof(f140,plain,
! [X0,X1] :
( ? [X2] :
( occurrence_of(X2,tptp1)
& next_subocc(X0,X2,tptp0) )
| ~ occurrence_of(X1,tptp0)
| ~ subactivity_occurrence(X0,X1)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(flattening,[],[f139]) ).
fof(f142,plain,
! [X0,X1] :
( ( ( arboreal(X0)
| ~ atomic(X1) )
& ( atomic(X1)
| ~ arboreal(X0) ) )
| ~ occurrence_of(X0,X1) ),
inference(nnf_transformation,[],[f77]) ).
fof(f152,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,[],[f95]) ).
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(flattening,[],[f152]) ).
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)
& ! [X4] :
( ~ min_precedes(X0,X4,X2)
| ~ min_precedes(X4,X1,X2) ) )
| ~ next_subocc(X0,X1,X2) ) ),
inference(rectify,[],[f153]) ).
fof(f155,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))],[f154]) ).
fof(f159,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))],[f97]) ).
fof(f163,plain,
! [X0,X1] :
( ( root_occ(X0,X1)
| ! [X2] :
( ~ occurrence_of(X1,X2)
| ~ subactivity_occurrence(X0,X1)
| ~ root(X0,X2) ) )
& ( ? [X2] :
( occurrence_of(X1,X2)
& subactivity_occurrence(X0,X1)
& root(X0,X2) )
| ~ root_occ(X0,X1) ) ),
inference(nnf_transformation,[],[f34]) ).
fof(f164,plain,
! [X0,X1] :
( ( root_occ(X0,X1)
| ! [X2] :
( ~ occurrence_of(X1,X2)
| ~ subactivity_occurrence(X0,X1)
| ~ root(X0,X2) ) )
& ( ? [X3] :
( occurrence_of(X1,X3)
& subactivity_occurrence(X0,X1)
& root(X0,X3) )
| ~ root_occ(X0,X1) ) ),
inference(rectify,[],[f163]) ).
fof(f165,plain,
! [X0,X1] :
( ( root_occ(X0,X1)
| ! [X2] :
( ~ occurrence_of(X1,X2)
| ~ subactivity_occurrence(X0,X1)
| ~ root(X0,X2) ) )
& ( ( occurrence_of(X1,sK13(X0,X1))
& subactivity_occurrence(X0,X1)
& root(X0,sK13(X0,X1)) )
| ~ root_occ(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK13]),skolemize(X3,sK13(X0,X1))],[f164]) ).
fof(f170,plain,
! [X0] :
( ( occurrence_of(sK16(X0),tptp4)
& root_occ(sK16(X0),X0)
& occurrence_of(sK17(X0),tptp3)
& leaf_occ(sK17(X0),X0)
& next_subocc(sK16(X0),sK17(X0),tptp0) )
| ~ occurrence_of(X0,tptp0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK16,sK17]),skolemize(X1,sK16(X0)),skolemize(X2,sK17(X0))],[f138]) ).
fof(f171,plain,
! [X0,X1] :
( ( occurrence_of(sK18(X0),tptp1)
& next_subocc(X0,sK18(X0),tptp0) )
| ~ occurrence_of(X1,tptp0)
| ~ subactivity_occurrence(X0,X1)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK18]),skolemize(X2,sK18(X0))],[f140]) ).
fof(f172,plain,
occurrence_of(sK19,tptp0),
inference(skolemize,[status(esa),new_symbols(skolem,[sK19]),skolemize(X0,sK19)],[f66]) ).
fof(f177,plain,
! [X2,X0,X1] :
( ~ occurrence_of(X0,X2)
| ~ occurrence_of(X0,X1)
| X1 = X2 ),
inference(cnf_transformation,[],[f70]) ).
fof(f183,plain,
! [X0,X1] :
( ~ occurrence_of(X0,X1)
| ~ atomic(X1)
| arboreal(X0) ),
inference(cnf_transformation,[],[f142]) ).
fof(f208,plain,
! [X2,X0,X1,X4] :
( ~ next_subocc(X0,X1,X2)
| ~ min_precedes(X4,X1,X2)
| ~ min_precedes(X0,X4,X2) ),
inference(cnf_transformation,[],[f155]) ).
fof(f209,plain,
! [X2,X0,X1] :
( ~ next_subocc(X0,X1,X2)
| min_precedes(X0,X1,X2) ),
inference(cnf_transformation,[],[f155]) ).
fof(f218,plain,
! [X2,X0,X1] :
( subactivity_occurrence(X2,sK9(X0,X1,X2))
| ~ min_precedes(X1,X2,X0) ),
inference(cnf_transformation,[],[f159]) ).
fof(f219,plain,
! [X2,X0,X1] :
( subactivity_occurrence(X1,sK9(X0,X1,X2))
| ~ min_precedes(X1,X2,X0) ),
inference(cnf_transformation,[],[f159]) ).
fof(f220,plain,
! [X2,X0,X1] :
( occurrence_of(sK9(X0,X1,X2),X0)
| ~ min_precedes(X1,X2,X0) ),
inference(cnf_transformation,[],[f159]) ).
fof(f232,plain,
! [X0,X1] :
( ~ root_occ(X0,X1)
| subactivity_occurrence(X0,X1) ),
inference(cnf_transformation,[],[f165]) ).
fof(f241,plain,
! [X2,X3,X0,X1] :
( ~ min_precedes(X1,X3,X2)
| ~ occurrence_of(X0,X2)
| ~ leaf_occ(X1,X0) ),
inference(cnf_transformation,[],[f117]) ).
fof(f246,plain,
! [X2,X3,X0,X1] :
( ~ root_occ(X3,X1)
| ~ occurrence_of(X1,X0)
| ~ subactivity_occurrence(X2,X1)
| X2 = X3
| ~ arboreal(X2)
| min_precedes(X3,X2,X0) ),
inference(cnf_transformation,[],[f127]) ).
fof(f247,plain,
! [X2,X3,X0,X1] :
( ~ leaf_occ(X3,X1)
| ~ occurrence_of(X1,X0)
| ~ subactivity_occurrence(X2,X1)
| X2 = X3
| ~ arboreal(X2)
| min_precedes(X2,X3,X0) ),
inference(cnf_transformation,[],[f129]) ).
fof(f252,plain,
! [X2,X0,X1] :
( ~ min_precedes(X0,X1,X2)
| arboreal(X0) ),
inference(cnf_transformation,[],[f133]) ).
fof(f255,plain,
! [X0] :
( next_subocc(sK16(X0),sK17(X0),tptp0)
| ~ occurrence_of(X0,tptp0) ),
inference(cnf_transformation,[],[f170]) ).
fof(f256,plain,
! [X0] :
( leaf_occ(sK17(X0),X0)
| ~ occurrence_of(X0,tptp0) ),
inference(cnf_transformation,[],[f170]) ).
fof(f257,plain,
! [X0] :
( occurrence_of(sK17(X0),tptp3)
| ~ occurrence_of(X0,tptp0) ),
inference(cnf_transformation,[],[f170]) ).
fof(f258,plain,
! [X0] :
( root_occ(sK16(X0),X0)
| ~ occurrence_of(X0,tptp0) ),
inference(cnf_transformation,[],[f170]) ).
fof(f259,plain,
! [X0] :
( occurrence_of(sK16(X0),tptp4)
| ~ occurrence_of(X0,tptp0) ),
inference(cnf_transformation,[],[f170]) ).
fof(f262,plain,
atomic(tptp4),
inference(cnf_transformation,[],[f53]) ).
fof(f265,plain,
atomic(tptp1),
inference(cnf_transformation,[],[f56]) ).
fof(f266,plain,
tptp4 != tptp1,
inference(cnf_transformation,[],[f57]) ).
fof(f269,plain,
tptp3 != tptp1,
inference(cnf_transformation,[],[f60]) ).
fof(f272,plain,
! [X0,X1] :
( ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0)
| next_subocc(X0,sK18(X0),tptp0)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f171]) ).
fof(f273,plain,
! [X0,X1] :
( ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0)
| occurrence_of(sK18(X0),tptp1)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f171]) ).
fof(f274,plain,
occurrence_of(sK19,tptp0),
inference(cnf_transformation,[],[f172]) ).
fof(f278,plain,
! [X0] :
( ~ occurrence_of(X0,tptp0)
| ~ atomic(tptp4)
| arboreal(sK16(X0)) ),
inference(resolution,[],[f259,f183]) ).
fof(f280,plain,
! [X0] :
( ~ occurrence_of(X0,tptp0)
| arboreal(sK16(X0)) ),
inference(forward_subsumption_resolution,[],[f278,f262]) ).
fof(f287,plain,
! [X0] :
( min_precedes(sK16(X0),sK17(X0),tptp0)
| ~ occurrence_of(X0,tptp0) ),
inference(resolution,[],[f255,f209]) ).
fof(f288,plain,
! [X0,X1] :
( ~ leaf_occ(sK16(X0),X1)
| ~ occurrence_of(X1,tptp0)
| ~ occurrence_of(X0,tptp0) ),
inference(resolution,[],[f287,f241]) ).
fof(f292,plain,
! [X2,X0,X1] :
( min_precedes(X2,sK17(X0),X1)
| ~ subactivity_occurrence(X2,X0)
| sK17(X0) = X2
| ~ arboreal(X2)
| ~ occurrence_of(X0,X1)
| ~ occurrence_of(X0,tptp0) ),
inference(resolution,[],[f247,f256]) ).
fof(f296,plain,
! [X0] :
( subactivity_occurrence(sK16(X0),X0)
| ~ occurrence_of(X0,tptp0) ),
inference(resolution,[],[f232,f258]) ).
fof(f297,plain,
! [X0] :
( ~ occurrence_of(X0,tptp0)
| ~ occurrence_of(X0,tptp0)
| occurrence_of(sK18(sK16(X0)),tptp1)
| ~ arboreal(sK16(X0))
| leaf_occ(sK16(X0),X0) ),
inference(resolution,[],[f296,f273]) ).
fof(f300,plain,
! [X0] :
( ~ occurrence_of(X0,tptp0)
| occurrence_of(sK18(sK16(X0)),tptp1)
| ~ arboreal(sK16(X0))
| leaf_occ(sK16(X0),X0) ),
inference(duplicate_literal_removal,[],[f297]) ).
fof(f302,plain,
! [X0] :
( occurrence_of(sK18(sK16(X0)),tptp1)
| leaf_occ(sK16(X0),X0)
| ~ occurrence_of(X0,tptp0) ),
inference(forward_subsumption_resolution,[],[f300,f280]) ).
fof(f304,plain,
! [X0,X1] :
( ~ occurrence_of(sK18(sK16(X0)),X1)
| ~ occurrence_of(X0,tptp0)
| leaf_occ(sK16(X0),X0)
| tptp1 = X1 ),
inference(resolution,[],[f302,f177]) ).
fof(f312,plain,
! [X2,X0,X1] :
( min_precedes(sK16(X0),X2,X1)
| ~ subactivity_occurrence(X2,X0)
| sK16(X0) = X2
| ~ arboreal(X2)
| ~ occurrence_of(X0,X1)
| ~ occurrence_of(X0,tptp0) ),
inference(resolution,[],[f246,f258]) ).
fof(f320,plain,
! [X2,X0,X1] :
( ~ min_precedes(X0,X1,X2)
| ~ occurrence_of(sK9(X2,X0,X1),tptp0)
| next_subocc(X0,sK18(X0),tptp0)
| ~ arboreal(X0)
| leaf_occ(X0,sK9(X2,X0,X1)) ),
inference(resolution,[],[f219,f272]) ).
fof(f321,plain,
! [X2,X0,X1] :
( ~ occurrence_of(sK9(X2,X0,X1),tptp0)
| ~ min_precedes(X0,X1,X2)
| next_subocc(X0,sK18(X0),tptp0)
| leaf_occ(X0,sK9(X2,X0,X1)) ),
inference(forward_subsumption_resolution,[],[f320,f252]) ).
fof(f413,plain,
! [X0,X1] :
( ~ min_precedes(X0,X1,tptp0)
| ~ min_precedes(X0,X1,tptp0)
| next_subocc(X0,sK18(X0),tptp0)
| leaf_occ(X0,sK9(tptp0,X0,X1)) ),
inference(resolution,[],[f220,f321]) ).
fof(f419,plain,
! [X0,X1] :
( leaf_occ(X0,sK9(tptp0,X0,X1))
| next_subocc(X0,sK18(X0),tptp0)
| ~ min_precedes(X0,X1,tptp0) ),
inference(duplicate_literal_removal,[],[f413]) ).
fof(f578,plain,
! [X0,X1] :
( ~ min_precedes(sK16(X1),X0,tptp0)
| ~ min_precedes(X0,sK17(X1),tptp0)
| ~ occurrence_of(X1,tptp0) ),
inference(resolution,[],[f208,f255]) ).
fof(f585,plain,
! [X0,X1] :
( ~ min_precedes(X0,sK17(X1),tptp0)
| ~ occurrence_of(X1,tptp0)
| ~ subactivity_occurrence(X0,X1)
| sK16(X1) = X0
| ~ arboreal(X0)
| ~ occurrence_of(X1,tptp0)
| ~ occurrence_of(X1,tptp0) ),
inference(resolution,[],[f578,f312]) ).
fof(f586,plain,
! [X0,X1] :
( ~ min_precedes(X0,sK17(X1),tptp0)
| ~ occurrence_of(X1,tptp0)
| ~ subactivity_occurrence(X0,X1)
| sK16(X1) = X0
| ~ arboreal(X0) ),
inference(duplicate_literal_removal,[],[f585]) ).
fof(f591,plain,
! [X0,X1] :
( ~ min_precedes(X0,sK17(X1),tptp0)
| ~ occurrence_of(X1,tptp0)
| ~ subactivity_occurrence(X0,X1)
| sK16(X1) = X0 ),
inference(forward_subsumption_resolution,[],[f586,f252]) ).
fof(f613,plain,
! [X0] :
( ~ occurrence_of(X0,tptp0)
| ~ occurrence_of(X0,tptp0)
| occurrence_of(sK18(sK16(X0)),tptp1)
| ~ occurrence_of(X0,tptp0) ),
inference(resolution,[],[f288,f302]) ).
fof(f614,plain,
! [X0,X1] :
( ~ occurrence_of(sK9(tptp0,sK16(X0),X1),tptp0)
| ~ occurrence_of(X0,tptp0)
| next_subocc(sK16(X0),sK18(sK16(X0)),tptp0)
| ~ min_precedes(sK16(X0),X1,tptp0) ),
inference(resolution,[],[f288,f419]) ).
fof(f618,plain,
! [X0] :
( occurrence_of(sK18(sK16(X0)),tptp1)
| ~ occurrence_of(X0,tptp0) ),
inference(duplicate_literal_removal,[],[f613]) ).
fof(f623,plain,
! [X0,X1] :
( ~ min_precedes(sK16(X0),X1,tptp0)
| next_subocc(sK16(X0),sK18(sK16(X0)),tptp0)
| ~ occurrence_of(X0,tptp0) ),
inference(forward_subsumption_resolution,[],[f614,f220]) ).
fof(f630,plain,
! [X0] :
( ~ occurrence_of(X0,tptp0)
| ~ atomic(tptp1)
| arboreal(sK18(sK16(X0))) ),
inference(resolution,[],[f618,f183]) ).
fof(f631,plain,
! [X0,X1] :
( ~ occurrence_of(sK18(sK16(X0)),X1)
| ~ occurrence_of(X0,tptp0)
| tptp1 = X1 ),
inference(resolution,[],[f618,f177]) ).
fof(f633,plain,
! [X0] :
( arboreal(sK18(sK16(X0)))
| ~ occurrence_of(X0,tptp0) ),
inference(forward_subsumption_resolution,[],[f630,f265]) ).
fof(f645,plain,
! [X0] :
( next_subocc(sK16(X0),sK18(sK16(X0)),tptp0)
| ~ occurrence_of(X0,tptp0)
| ~ occurrence_of(X0,tptp0) ),
inference(resolution,[],[f623,f287]) ).
fof(f654,plain,
! [X0] :
( next_subocc(sK16(X0),sK18(sK16(X0)),tptp0)
| ~ occurrence_of(X0,tptp0) ),
inference(duplicate_literal_removal,[],[f645]) ).
fof(f659,plain,
! [X0] :
( min_precedes(sK16(X0),sK18(sK16(X0)),tptp0)
| ~ occurrence_of(X0,tptp0) ),
inference(resolution,[],[f654,f209]) ).
fof(f1039,plain,
! [X0,X1] :
( ~ occurrence_of(X0,tptp0)
| ~ subactivity_occurrence(X1,X0)
| sK16(X0) = X1
| ~ subactivity_occurrence(X1,X0)
| sK17(X0) = X1
| ~ arboreal(X1)
| ~ occurrence_of(X0,tptp0)
| ~ occurrence_of(X0,tptp0) ),
inference(resolution,[],[f591,f292]) ).
fof(f1048,plain,
! [X0,X1] :
( ~ subactivity_occurrence(X1,X0)
| ~ occurrence_of(X0,tptp0)
| sK16(X0) = X1
| sK17(X0) = X1
| ~ arboreal(X1) ),
inference(duplicate_literal_removal,[],[f1039]) ).
fof(f1058,plain,
! [X2,X0,X1] :
( ~ occurrence_of(sK9(X0,X1,X2),tptp0)
| sK16(sK9(X0,X1,X2)) = X2
| sK17(sK9(X0,X1,X2)) = X2
| ~ arboreal(X2)
| ~ min_precedes(X1,X2,X0) ),
inference(resolution,[],[f1048,f218]) ).
fof(f1084,plain,
! [X0,X1] :
( sK16(sK9(tptp0,X0,X1)) = X1
| sK17(sK9(tptp0,X0,X1)) = X1
| ~ arboreal(X1)
| ~ min_precedes(X0,X1,tptp0)
| ~ min_precedes(X0,X1,tptp0) ),
inference(resolution,[],[f1058,f220]) ).
fof(f1085,plain,
! [X0,X1] :
( ~ min_precedes(X0,X1,tptp0)
| sK17(sK9(tptp0,X0,X1)) = X1
| ~ arboreal(X1)
| sK16(sK9(tptp0,X0,X1)) = X1 ),
inference(duplicate_literal_removal,[],[f1084]) ).
fof(f1093,plain,
! [X0] :
( sK18(sK16(X0)) = sK17(sK9(tptp0,sK16(X0),sK18(sK16(X0))))
| ~ arboreal(sK18(sK16(X0)))
| sK18(sK16(X0)) = sK16(sK9(tptp0,sK16(X0),sK18(sK16(X0))))
| ~ occurrence_of(X0,tptp0) ),
inference(resolution,[],[f1085,f659]) ).
fof(f1108,plain,
! [X0] :
( ~ occurrence_of(X0,tptp0)
| sK18(sK16(X0)) = sK16(sK9(tptp0,sK16(X0),sK18(sK16(X0))))
| sK18(sK16(X0)) = sK17(sK9(tptp0,sK16(X0),sK18(sK16(X0)))) ),
inference(forward_subsumption_resolution,[],[f1093,f633]) ).
fof(f1230,plain,
( sK18(sK16(sK19)) = sK16(sK9(tptp0,sK16(sK19),sK18(sK16(sK19))))
| sK18(sK16(sK19)) = sK17(sK9(tptp0,sK16(sK19),sK18(sK16(sK19)))) ),
inference(resolution,[],[f1108,f274]) ).
fof(f1232,definition,
( spl20_32
<=> sK18(sK16(sK19)) = sK17(sK9(tptp0,sK16(sK19),sK18(sK16(sK19)))) ),
introduced(definition,[new_symbols(definition,[spl20_32])],[avatar_definition]) ).
fof(f1234,plain,
( sK18(sK16(sK19)) = sK17(sK9(tptp0,sK16(sK19),sK18(sK16(sK19))))
| ~ spl20_32 ),
inference(avatar_component_clause,[],[f1232]) ).
fof(f1236,definition,
( spl20_33
<=> sK18(sK16(sK19)) = sK16(sK9(tptp0,sK16(sK19),sK18(sK16(sK19)))) ),
introduced(definition,[new_symbols(definition,[spl20_33])],[avatar_definition]) ).
fof(f1238,plain,
( sK18(sK16(sK19)) = sK16(sK9(tptp0,sK16(sK19),sK18(sK16(sK19))))
| ~ spl20_33 ),
inference(avatar_component_clause,[],[f1236]) ).
fof(f1239,plain,
( spl20_32
| spl20_33 ),
inference(avatar_split_clause,[],[f1230,f1236,f1232]) ).
fof(f1244,plain,
( occurrence_of(sK18(sK16(sK19)),tptp3)
| ~ occurrence_of(sK9(tptp0,sK16(sK19),sK18(sK16(sK19))),tptp0)
| ~ spl20_32 ),
inference(superposition,[],[f257,f1234]) ).
fof(f1258,definition,
( spl20_34
<=> occurrence_of(sK9(tptp0,sK16(sK19),sK18(sK16(sK19))),tptp0) ),
introduced(definition,[new_symbols(definition,[spl20_34])],[avatar_definition]) ).
fof(f1259,plain,
( occurrence_of(sK9(tptp0,sK16(sK19),sK18(sK16(sK19))),tptp0)
| ~ spl20_34 ),
inference(avatar_component_clause,[],[f1258]) ).
fof(f1260,plain,
( ~ occurrence_of(sK9(tptp0,sK16(sK19),sK18(sK16(sK19))),tptp0)
| spl20_34 ),
inference(avatar_component_clause,[],[f1258]) ).
fof(f1321,definition,
( spl20_48
<=> occurrence_of(sK18(sK16(sK19)),tptp3) ),
introduced(definition,[new_symbols(definition,[spl20_48])],[avatar_definition]) ).
fof(f1323,plain,
( occurrence_of(sK18(sK16(sK19)),tptp3)
| ~ spl20_48 ),
inference(avatar_component_clause,[],[f1321]) ).
fof(f1324,plain,
( ~ spl20_34
| spl20_48
| ~ spl20_32 ),
inference(avatar_split_clause,[],[f1244,f1232,f1321,f1258]) ).
fof(f1336,definition,
( spl20_51
<=> min_precedes(sK16(sK19),sK18(sK16(sK19)),tptp0) ),
introduced(definition,[new_symbols(definition,[spl20_51])],[avatar_definition]) ).
fof(f1337,plain,
( min_precedes(sK16(sK19),sK18(sK16(sK19)),tptp0)
| ~ spl20_51 ),
inference(avatar_component_clause,[],[f1336]) ).
fof(f1338,plain,
( ~ min_precedes(sK16(sK19),sK18(sK16(sK19)),tptp0)
| spl20_51 ),
inference(avatar_component_clause,[],[f1336]) ).
fof(f1575,plain,
( ~ min_precedes(sK16(sK19),sK18(sK16(sK19)),tptp0)
| spl20_34 ),
inference(resolution,[],[f1260,f220]) ).
fof(f1576,plain,
( ~ spl20_51
| spl20_34 ),
inference(avatar_split_clause,[],[f1575,f1258,f1336]) ).
fof(f1577,plain,
( ~ occurrence_of(sK19,tptp0)
| spl20_51 ),
inference(resolution,[],[f1338,f659]) ).
fof(f1583,plain,
( $false
| spl20_51 ),
inference(forward_subsumption_resolution,[],[f1577,f274]) ).
fof(f1584,plain,
spl20_51,
inference(avatar_contradiction_clause,[],[f1583]) ).
fof(f1597,plain,
( occurrence_of(sK18(sK16(sK19)),tptp4)
| ~ occurrence_of(sK9(tptp0,sK16(sK19),sK18(sK16(sK19))),tptp0)
| ~ spl20_33 ),
inference(superposition,[],[f259,f1238]) ).
fof(f1674,plain,
( occurrence_of(sK18(sK16(sK19)),tptp4)
| ~ spl20_33
| ~ spl20_34 ),
inference(forward_subsumption_resolution,[],[f1597,f1259]) ).
fof(f1770,plain,
( ~ occurrence_of(sK19,tptp0)
| tptp3 = tptp1
| ~ spl20_48 ),
inference(resolution,[],[f1323,f631]) ).
fof(f1780,plain,
( tptp3 = tptp1
| ~ spl20_48 ),
inference(forward_subsumption_resolution,[],[f1770,f274]) ).
fof(f1787,plain,
( $false
| ~ spl20_48 ),
inference(forward_subsumption_resolution,[],[f1780,f269]) ).
fof(f1788,plain,
~ spl20_48,
inference(avatar_contradiction_clause,[],[f1787]) ).
fof(f1857,plain,
( ! [X0] :
( ~ occurrence_of(X0,tptp0)
| ~ leaf_occ(sK16(sK19),X0) )
| ~ spl20_51 ),
inference(resolution,[],[f1337,f241]) ).
fof(f1897,plain,
( ~ occurrence_of(sK19,tptp0)
| leaf_occ(sK16(sK19),sK19)
| tptp4 = tptp1
| ~ spl20_33
| ~ spl20_34 ),
inference(resolution,[],[f1674,f304]) ).
fof(f1905,plain,
( ~ occurrence_of(sK19,tptp0)
| tptp4 = tptp1
| ~ spl20_33
| ~ spl20_34
| ~ spl20_51 ),
inference(forward_subsumption_resolution,[],[f1897,f1857]) ).
fof(f1912,plain,
( tptp4 = tptp1
| ~ spl20_33
| ~ spl20_34
| ~ spl20_51 ),
inference(forward_subsumption_resolution,[],[f1905,f274]) ).
fof(f1916,plain,
( $false
| ~ spl20_33
| ~ spl20_34
| ~ spl20_51 ),
inference(forward_subsumption_resolution,[],[f1912,f266]) ).
fof(f1917,plain,
( ~ spl20_33
| ~ spl20_34
| ~ spl20_51 ),
inference(avatar_contradiction_clause,[],[f1916]) ).
cnf(s31,plain,
( spl20_32
| spl20_33 ),
inference(sat_conversion,[],[f1239]) ).
cnf(s44,plain,
( ~ spl20_32
| ~ spl20_34
| spl20_48 ),
inference(sat_conversion,[],[f1324]) ).
cnf(s51,plain,
( spl20_34
| ~ spl20_51 ),
inference(sat_conversion,[],[f1576]) ).
cnf(s52,plain,
spl20_51,
inference(sat_conversion,[],[f1584]) ).
cnf(s83,plain,
~ spl20_48,
inference(sat_conversion,[],[f1788]) ).
cnf(s96,plain,
( ~ spl20_33
| ~ spl20_34
| ~ spl20_51 ),
inference(sat_conversion,[],[f1917]) ).
cnf(s98,plain,
spl20_34,
inference(rat,[],[s51,s52]) ).
cnf(s99,plain,
~ spl20_33,
inference(rat,[],[s96,s52,s98]) ).
cnf(s104,plain,
~ spl20_32,
inference(rat,[],[s44,s83,s98]) ).
cnf(s105,plain,
$false,
inference(rat,[],[s31,s99,s104]) ).
fof(f1921,plain,
$false,
inference(avatar_sat_refutation,[],[s105]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : PRO006+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n003.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Sun Sep 27 22:18:41 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.41 Running first-order theorem proving
% 0.15/0.41 Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 7.29/1.87 % (974018)Detected formulas, will run a generic FOF schedule.
% 7.29/1.87 % (974028)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3896795682:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 7.29/1.87 % (974023)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=4096988046:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 7.29/1.87 % (974029)dis-21_1_sil=8000:lcm=predicate:random_seed=861791101: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)
% 7.29/1.87 % (974027)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=4039263920:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 7.29/1.87 % (974024)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=2559789681:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 7.29/1.87 % (974026)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=3712107260:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 7.29/1.87 % (974025)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=34926240:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 7.29/1.87 % (974026)Refutation not found, incomplete strategy
% 7.29/1.87 % (974026)------------------------------
% 7.29/1.87 % (974026)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.29/1.87 % (974026)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.29/1.87 % (974026)CaDiCaL version: 2.1.3
% 7.29/1.87 % (974026)Termination reason: Refutation not found, incomplete strategy
% 7.29/1.87 % (974026)Time elapsed: 0.001 s
% 7.29/1.87 % (974026)Peak memory usage: 87 MB
% 7.29/1.87 % (974028)Instruction limit reached!
% 7.29/1.87 % (974028)------------------------------
% 7.29/1.87 % (974028)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.29/1.87 % (974028)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.29/1.87 % (974028)CaDiCaL version: 2.1.3
% 7.29/1.87 % (974028)Termination reason: Instruction limit
% 7.29/1.87 % (974028)Termination phase: Saturation
% 7.29/1.87 % (974028)Time elapsed: 0.053 s
% 7.29/1.87 % (974028)Peak memory usage: 90 MB
% 7.29/1.87 % (974028)Instructions burned: 140 (million)
% 7.29/1.87 % (974027)Instruction limit reached!
% 7.29/1.87 % (974027)------------------------------
% 7.29/1.87 % (974027)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.29/1.87 % (974027)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.29/1.87 % (974027)CaDiCaL version: 2.1.3
% 7.29/1.87 % (974027)Termination reason: Instruction limit
% 7.29/1.87 % (974027)Termination phase: Saturation
% 7.29/1.87 % (974027)Time elapsed: 0.068 s
% 7.29/1.87 % (974027)Peak memory usage: 88 MB
% 7.29/1.87 % (974027)Instructions burned: 120 (million)
% 7.29/1.87 % (974029)Instruction limit reached!
% 7.29/1.87 % (974029)------------------------------
% 7.29/1.87 % (974029)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.29/1.87 % (974029)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.29/1.87 % (974029)CaDiCaL version: 2.1.3
% 7.29/1.87 % (974029)Termination reason: Instruction limit
% 7.29/1.87 % (974029)Termination phase: Saturation
% 7.29/1.87 % (974029)Time elapsed: 0.074 s
% 7.29/1.87 % (974029)Peak memory usage: 88 MB
% 7.29/1.87 % (974029)Instructions burned: 129 (million)
% 7.29/1.87 % (974037)lrs+10_1_sil=8000:sp=occurrence:random_seed=1850360918:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 7.29/1.87 % (974039)lrs+1011_1_sil=32000:sp=occurrence:random_seed=2013489732:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 7.29/1.87 % (974038)lrs+10_1_sil=32000:urr=on:br=off:random_seed=3747890213:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 7.29/1.87 % (974038)Refutation not found, incomplete strategy
% 7.29/1.87 % (974038)------------------------------
% 7.29/1.87 % (974038)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.29/1.87 % (974038)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.29/1.87 % (974038)CaDiCaL version: 2.1.3
% 7.29/1.87 % (974038)Termination reason: Refutation not found, incomplete strategy
% 7.29/1.87 % (974038)Time elapsed: 0.001 s
% 7.29/1.87 % (974038)Peak memory usage: 88 MB
% 7.29/1.87 % (974037)Instruction limit reached!
% 7.29/1.87 % (974037)------------------------------
% 7.29/1.87 % (974037)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.29/1.87 % (974037)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.29/1.87 % (974037)CaDiCaL version: 2.1.3
% 7.29/1.87 % (974037)Termination reason: Instruction limit
% 7.29/1.87 % (974037)Termination phase: Saturation
% 7.29/1.87 % (974037)Time elapsed: 0.101 s
% 7.29/1.87 % (974037)Peak memory usage: 91 MB
% 7.29/1.87 % (974037)Instructions burned: 285 (million)
% 7.29/1.87 % (974026)------------------------------
% 7.29/1.87 % (974026)------------------------------
% 7.29/1.87 % (974043)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=2546640154:s2a=on:i=248:s2at=1.23:gtg=position_2995 on theBenchmark for (2995ds/248Mi)
% 7.29/1.87 % (974044)lrs+1002_1_to=lpo:sil=8000:sos=on:random_seed=1798157402:st=4:cts=off:i=294:sd=2:ins=7:amm=off:ss=axioms_2995 on theBenchmark for (2995ds/294Mi)
% 7.29/1.87 % (974039)Instruction limit reached!
% 7.29/1.87 % (974039)------------------------------
% 7.29/1.87 % (974039)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.29/1.87 % (974039)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.29/1.87 % (974039)CaDiCaL version: 2.1.3
% 7.29/1.87 % (974039)Termination reason: Instruction limit
% 7.29/1.87 % (974039)Termination phase: Saturation
% 7.29/1.87 % (974039)Time elapsed: 0.203 s
% 7.29/1.87 % (974039)Peak memory usage: 91 MB
% 7.29/1.87 % (974039)Instructions burned: 326 (million)
% 7.29/1.87 % (974043)Instruction limit reached!
% 7.29/1.87 % (974043)------------------------------
% 7.29/1.87 % (974043)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.29/1.87 % (974043)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.29/1.87 % (974043)CaDiCaL version: 2.1.3
% 7.29/1.87 % (974043)Termination reason: Instruction limit
% 7.29/1.87 % (974043)Termination phase: Saturation
% 7.29/1.87 % (974043)Time elapsed: 0.072 s
% 7.29/1.87 % (974043)Peak memory usage: 89 MB
% 7.29/1.87 % (974043)Instructions burned: 248 (million)
% 7.29/1.87 % (974038)------------------------------
% 7.29/1.87 % (974038)------------------------------
% 7.29/1.87 % (974048)dis-1011_32:1_sfv=off:sil=16000:sos=all:erd=off:acc=on:fd=off:flr=on:random_seed=1173286782:cts=off:i=113:fsr=off:ss=included:sgt=4_2993 on theBenchmark for (2993ds/113Mi)
% 7.29/1.87 % (974047)lrs+10_1_ncem=casc2026/models/loop7.pt:sil=32000:tgt=ground:npcc=on:random_seed=1199100311:i=2350_2993 on theBenchmark for (2993ds/2350Mi)
% 7.29/1.87 % (974044)Instruction limit reached!
% 7.29/1.87 % (974044)------------------------------
% 7.29/1.87 % (974044)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.29/1.87 % (974044)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.29/1.87 % (974044)CaDiCaL version: 2.1.3
% 7.29/1.87 % (974044)Termination reason: Instruction limit
% 7.29/1.87 % (974044)Termination phase: Saturation
% 7.29/1.87 % (974044)Time elapsed: 0.165 s
% 7.29/1.87 % (974044)Peak memory usage: 88 MB
% 7.29/1.87 % (974044)Instructions burned: 296 (million)
% 7.29/1.87 % (974048)Instruction limit reached!
% 7.29/1.87 % (974048)------------------------------
% 7.29/1.87 % (974048)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.29/1.87 % (974048)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.29/1.87 % (974048)CaDiCaL version: 2.1.3
% 7.29/1.87 % (974048)Termination reason: Instruction limit
% 7.29/1.87 % (974048)Termination phase: Saturation
% 7.29/1.87 % (974048)Time elapsed: 0.045 s
% 7.29/1.87 % (974048)Peak memory usage: 90 MB
% 7.29/1.87 % (974048)Instructions burned: 115 (million)
% 7.29/1.87 % (974049)lrs-1004_1_sil=8000:sp=occurrence:sos=all:erd=off:fs=off:bce=on:random_seed=2662207607:i=127:av=off:fsr=off:sup=off_2993 on theBenchmark for (2993ds/127Mi)
% 7.29/1.87 % (974049)Instruction limit reached!
% 7.29/1.87 % (974049)------------------------------
% 7.29/1.87 % (974049)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.29/1.87 % (974049)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.29/1.87 % (974049)CaDiCaL version: 2.1.3
% 7.29/1.87 % (974049)Termination reason: Instruction limit
% 7.29/1.87 % (974049)Termination phase: Saturation
% 7.29/1.87 % (974049)Time elapsed: 0.069 s
% 7.29/1.87 % (974049)Peak memory usage: 89 MB
% 7.29/1.87 % (974049)Instructions burned: 128 (million)
% 7.29/1.87 % (974052)dis-1003_1024_sil=8000:sos=all:sac=on:random_seed=1912502052:cond=fast:i=114:sd=1:nm=0:fsr=off:gtg=exists_sym:ss=axioms_2992 on theBenchmark for (2992ds/114Mi)
% 7.29/1.87 % (974052)Refutation not found, incomplete strategy
% 7.29/1.87 % (974052)------------------------------
% 7.29/1.87 % (974052)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.29/1.87 % (974052)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.29/1.87 % (974052)CaDiCaL version: 2.1.3
% 7.29/1.87 % (974052)Termination reason: Refutation not found, incomplete strategy
% 7.29/1.87 % (974052)Time elapsed: 0.001 s
% 7.29/1.87 % (974052)Peak memory usage: 88 MB
% 7.29/1.87 % (974053)lrs+10_1_sil=8000:sp=occurrence:random_seed=502058917:st=1.2:i=907:sd=14:ss=axioms:sgt=12_2992 on theBenchmark for (2992ds/907Mi)
% 7.29/1.87 % (974023)First to succeed.
% 7.29/1.87 % (974023)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-974018"
% 7.29/1.87 % (974024)Also succeeded, but the first one will report.
% 7.29/1.87 % (974055)dis-1010_1_sil=16000:fde=unused:sp=occurrence:sos=on:random_seed=451611947:i=437:sd=1:aac=none:ss=included_2991 on theBenchmark for (2991ds/437Mi)
% 7.29/1.87 % (974055)Refutation not found, incomplete strategy
% 7.29/1.87 % (974055)------------------------------
% 7.29/1.87 % (974055)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.29/1.87 % (974055)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.29/1.87 % (974055)CaDiCaL version: 2.1.3
% 7.29/1.87 % (974055)Termination reason: Refutation not found, incomplete strategy
% 7.29/1.87 % (974055)Time elapsed: 0.005 s
% 7.29/1.87 % (974055)Peak memory usage: 88 MB
% 7.29/1.87 % (974055)Instructions burned: 6 (million)
% 7.29/1.87 % (974052)------------------------------
% 7.29/1.87 % (974052)------------------------------
% 7.29/1.87 % (974053)Instruction limit reached!
% 7.29/1.87 % (974053)------------------------------
% 7.29/1.87 % (974053)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.29/1.87 % (974053)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.29/1.87 % (974053)CaDiCaL version: 2.1.3
% 7.29/1.87 % (974053)Termination reason: Instruction limit
% 7.29/1.87 % (974053)Termination phase: Saturation
% 7.29/1.87 % (974053)Time elapsed: 0.311 s
% 7.29/1.87 % (974053)Peak memory usage: 96 MB
% 7.29/1.87 % (974053)Instructions burned: 909 (million)
% 7.29/1.87 % (974023)Refutation found. Thanks to Tanya!
% 7.29/1.87 % SZS status Theorem for theBenchmark
% 7.29/1.87 % SZS output start Proof for theBenchmark
% See solution above
% 0.17/2.04 % (974023)------------------------------
% 0.17/2.04 % (974023)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.17/2.04 % (974023)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/2.04 % (974023)CaDiCaL version: 2.1.3
% 0.17/2.04 % (974023)Termination reason: Refutation
% 0.17/2.04 % (974023)Time elapsed: 0.830 s
% 0.17/2.04 % (974023)Peak memory usage: 132 MB
% 0.17/2.04 % (974023)Instructions burned: 1220 (million)
% 0.17/2.04 % (974023)------------------------------
% 0.17/2.04 % (974023)------------------------------
% 0.17/2.04 % (974018)Success in time 1.266 s
% 0.17/2.04 % Vampire exiting
%------------------------------------------------------------------------------