%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : PRO018+2 : 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 : n001.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:29 PM UTC 2026
% Result : Theorem 4.58s 1.65s
% Output : Refutation 6.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 23
% Syntax : Number of formulae : 166 ( 26 unt; 9 def)
% Number of atoms : 610 ( 40 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 714 ( 270 ~; 284 |; 132 &)
% ( 13 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 22 ( 20 usr; 9 prp; 0-3 aty)
% Number of functors : 17 ( 17 usr; 7 con; 0-3 aty)
% Number of variables : 243 ( 0 sgn 198 !; 45 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f5,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_04) ).
fof(f14,axiom,
! [X0,X1] :
( occurrence_of(X0,X1)
=> ( arboreal(X0)
<=> atomic(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_13) ).
fof(f16,axiom,
! [X0,X1] :
( atocc(X0,X1)
<=> ? [X2] :
( subactivity(X1,X2)
& atomic(X2)
& occurrence_of(X0,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_15) ).
fof(f19,axiom,
! [X0] :
( activity_occurrence(X0)
=> ? [X1] :
( activity(X1)
& occurrence_of(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_18) ).
fof(f22,axiom,
! [X0,X1,X2] :
( ( occurrence_of(X0,X2)
& leaf_occ(X1,X0) )
=> ~ ? [X3] : min_precedes(X1,X3,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_21) ).
fof(f23,axiom,
! [X0,X1,X2] :
( ( occurrence_of(X0,X1)
& occurrence_of(X0,X2) )
=> X1 = X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_22) ).
fof(f25,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_24) ).
fof(f27,axiom,
! [X0,X1,X2] :
( min_precedes(X1,X2,X0)
=> ? [X3,X4] :
( subactivity(X3,X0)
& subactivity(X4,X0)
& atocc(X1,X3)
& atocc(X2,X4) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_26) ).
fof(f30,axiom,
! [X0,X1] :
( occurrence_of(X1,X0)
=> ( activity(X0)
& activity_occurrence(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_29) ).
fof(f33,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)
& min_precedes(X2,X3,tptp0)
& ( occurrence_of(X4,tptp1)
| occurrence_of(X4,tptp2) )
& min_precedes(X3,X4,tptp0)
& ! [X5] :
( min_precedes(X2,X5,tptp0)
=> ( X5 = X3
| X5 = X4 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_32) ).
fof(f40,axiom,
tptp4 != tptp3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_39) ).
fof(f43,axiom,
tptp3 != tptp1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_42) ).
fof(f44,axiom,
tptp3 != tptp2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_43) ).
fof(f46,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,tptp1)
| occurrence_of(X3,tptp2) )
& min_precedes(X2,X3,tptp0)
& leaf_occ(X3,X1)
& ( occurrence_of(X3,tptp1)
=> ~ ? [X4] :
( occurrence_of(X4,tptp2)
& min_precedes(X2,X4,tptp0) ) )
& ( occurrence_of(X3,tptp2)
=> ~ ? [X5] :
( occurrence_of(X5,tptp1)
& min_precedes(X2,X5,tptp0) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(f47,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,tptp1)
| occurrence_of(X3,tptp2) )
& min_precedes(X2,X3,tptp0)
& leaf_occ(X3,X1)
& ( occurrence_of(X3,tptp1)
=> ~ ? [X4] :
( occurrence_of(X4,tptp2)
& min_precedes(X2,X4,tptp0) ) )
& ( occurrence_of(X3,tptp2)
=> ~ ? [X5] :
( occurrence_of(X5,tptp1)
& min_precedes(X2,X5,tptp0) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f46]) ).
fof(f50,plain,
? [X0,X1] :
( ! [X2,X3] :
( ~ occurrence_of(X2,tptp3)
| ~ next_subocc(X0,X2,tptp0)
| ( ~ occurrence_of(X3,tptp1)
& ~ occurrence_of(X3,tptp2) )
| ~ min_precedes(X2,X3,tptp0)
| ~ leaf_occ(X3,X1)
| ( ? [X4] :
( occurrence_of(X4,tptp2)
& min_precedes(X2,X4,tptp0) )
& occurrence_of(X3,tptp1) )
| ( ? [X5] :
( occurrence_of(X5,tptp1)
& min_precedes(X2,X5,tptp0) )
& occurrence_of(X3,tptp2) ) )
& occurrence_of(X1,tptp0)
& subactivity_occurrence(X0,X1)
& arboreal(X0)
& ~ leaf_occ(X0,X1) ),
inference(ennf_transformation,[],[f47]) ).
fof(f51,plain,
? [X0,X1] :
( ! [X2,X3] :
( ~ occurrence_of(X2,tptp3)
| ~ next_subocc(X0,X2,tptp0)
| ( ~ occurrence_of(X3,tptp1)
& ~ occurrence_of(X3,tptp2) )
| ~ min_precedes(X2,X3,tptp0)
| ~ leaf_occ(X3,X1)
| ( ? [X4] :
( occurrence_of(X4,tptp2)
& min_precedes(X2,X4,tptp0) )
& occurrence_of(X3,tptp1) )
| ( ? [X5] :
( occurrence_of(X5,tptp1)
& min_precedes(X2,X5,tptp0) )
& occurrence_of(X3,tptp2) ) )
& occurrence_of(X1,tptp0)
& subactivity_occurrence(X0,X1)
& arboreal(X0)
& ~ leaf_occ(X0,X1) ),
inference(flattening,[],[f50]) ).
fof(f52,plain,
! [X0,X1] :
( ? [X2,X3,X4] :
( occurrence_of(X2,tptp3)
& next_subocc(X0,X2,tptp0)
& occurrence_of(X3,tptp4)
& min_precedes(X2,X3,tptp0)
& ( occurrence_of(X4,tptp1)
| occurrence_of(X4,tptp2) )
& min_precedes(X3,X4,tptp0)
& ! [X5] :
( X5 = X3
| X5 = X4
| ~ min_precedes(X2,X5,tptp0) ) )
| ~ occurrence_of(X1,tptp0)
| ~ subactivity_occurrence(X0,X1)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(ennf_transformation,[],[f33]) ).
fof(f53,plain,
! [X0,X1] :
( ? [X2,X3,X4] :
( occurrence_of(X2,tptp3)
& next_subocc(X0,X2,tptp0)
& occurrence_of(X3,tptp4)
& min_precedes(X2,X3,tptp0)
& ( occurrence_of(X4,tptp1)
| occurrence_of(X4,tptp2) )
& min_precedes(X3,X4,tptp0)
& ! [X5] :
( X5 = X3
| X5 = X4
| ~ min_precedes(X2,X5,tptp0) ) )
| ~ occurrence_of(X1,tptp0)
| ~ subactivity_occurrence(X0,X1)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(flattening,[],[f52]) ).
fof(f60,plain,
! [X0,X1,X2] :
( ! [X3] : ~ min_precedes(X1,X3,X2)
| ~ occurrence_of(X0,X2)
| ~ leaf_occ(X1,X0) ),
inference(ennf_transformation,[],[f22]) ).
fof(f61,plain,
! [X0,X1,X2] :
( ! [X3] : ~ min_precedes(X1,X3,X2)
| ~ occurrence_of(X0,X2)
| ~ leaf_occ(X1,X0) ),
inference(flattening,[],[f60]) ).
fof(f65,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,[],[f5]) ).
fof(f69,plain,
! [X0,X1] :
( ( arboreal(X0)
<=> atomic(X1) )
| ~ occurrence_of(X0,X1) ),
inference(ennf_transformation,[],[f14]) ).
fof(f72,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,[],[f25]) ).
fof(f76,plain,
! [X0,X1] :
( ( activity(X0)
& activity_occurrence(X1) )
| ~ occurrence_of(X1,X0) ),
inference(ennf_transformation,[],[f30]) ).
fof(f77,plain,
! [X0] :
( ? [X1] :
( activity(X1)
& occurrence_of(X0,X1) )
| ~ activity_occurrence(X0) ),
inference(ennf_transformation,[],[f19]) ).
fof(f78,plain,
! [X0,X1,X2] :
( X1 = X2
| ~ occurrence_of(X0,X1)
| ~ occurrence_of(X0,X2) ),
inference(ennf_transformation,[],[f23]) ).
fof(f79,plain,
! [X0,X1,X2] :
( X1 = X2
| ~ occurrence_of(X0,X1)
| ~ occurrence_of(X0,X2) ),
inference(flattening,[],[f78]) ).
fof(f91,plain,
! [X0,X1,X2] :
( ? [X3,X4] :
( subactivity(X3,X0)
& subactivity(X4,X0)
& atocc(X1,X3)
& atocc(X2,X4) )
| ~ min_precedes(X1,X2,X0) ),
inference(ennf_transformation,[],[f27]) ).
fof(f96,definition,
! [X2,X3] :
( ( ? [X5] :
( occurrence_of(X5,tptp1)
& min_precedes(X2,X5,tptp0) )
& occurrence_of(X3,tptp2) )
| ~ sP0(X2,X3) ),
introduced(definition,[new_symbols(definition,[sP0])],[predicate_definition_introduction]) ).
fof(f97,plain,
? [X0,X1] :
( ! [X2,X3] :
( ~ occurrence_of(X2,tptp3)
| ~ next_subocc(X0,X2,tptp0)
| ( ~ occurrence_of(X3,tptp1)
& ~ occurrence_of(X3,tptp2) )
| ~ min_precedes(X2,X3,tptp0)
| ~ leaf_occ(X3,X1)
| ( ? [X4] :
( occurrence_of(X4,tptp2)
& min_precedes(X2,X4,tptp0) )
& occurrence_of(X3,tptp1) )
| sP0(X2,X3) )
& occurrence_of(X1,tptp0)
& subactivity_occurrence(X0,X1)
& arboreal(X0)
& ~ leaf_occ(X0,X1) ),
inference(definition_folding,[],[f51,f96]) ).
fof(f101,plain,
( ! [X2,X3] :
( ~ occurrence_of(X2,tptp3)
| ~ next_subocc(sK2,X2,tptp0)
| ( ~ occurrence_of(X3,tptp1)
& ~ occurrence_of(X3,tptp2) )
| ~ min_precedes(X2,X3,tptp0)
| ~ leaf_occ(X3,sK3)
| ( occurrence_of(sK4(X2),tptp2)
& min_precedes(X2,sK4(X2),tptp0)
& occurrence_of(X3,tptp1) )
| sP0(X2,X3) )
& occurrence_of(sK3,tptp0)
& subactivity_occurrence(sK2,sK3)
& arboreal(sK2)
& ~ leaf_occ(sK2,sK3) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2,sK3,sK4]),skolemize(X0,sK2),skolemize(X1,sK3),skolemize(X4,sK4(X2))],[f97]) ).
fof(f102,plain,
! [X0,X1] :
( ( occurrence_of(sK5(X0),tptp3)
& next_subocc(X0,sK5(X0),tptp0)
& occurrence_of(sK6(X0),tptp4)
& min_precedes(sK5(X0),sK6(X0),tptp0)
& ( occurrence_of(sK7(X0),tptp1)
| occurrence_of(sK7(X0),tptp2) )
& min_precedes(sK6(X0),sK7(X0),tptp0)
& ! [X5] :
( sK6(X0) = X5
| sK7(X0) = X5
| ~ min_precedes(sK5(X0),X5,tptp0) ) )
| ~ occurrence_of(X1,tptp0)
| ~ subactivity_occurrence(X0,X1)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5,sK6,sK7]),skolemize(X2,sK5(X0)),skolemize(X3,sK6(X0)),skolemize(X4,sK7(X0))],[f53]) ).
fof(f108,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,[],[f65]) ).
fof(f109,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,[],[f108]) ).
fof(f110,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,[],[f109]) ).
fof(f111,plain,
! [X0,X1,X2] :
( ( next_subocc(X0,X1,X2)
| ~ min_precedes(X0,X1,X2)
| ( min_precedes(X0,sK11(X0,X1,X2),X2)
& min_precedes(sK11(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,[sK11]),skolemize(X3,sK11(X0,X1,X2))],[f110]) ).
fof(f112,plain,
! [X0,X1] :
( ( ( arboreal(X0)
| ~ atomic(X1) )
& ( atomic(X1)
| ~ arboreal(X0) ) )
| ~ occurrence_of(X0,X1) ),
inference(nnf_transformation,[],[f69]) ).
fof(f114,plain,
! [X0,X1,X2] :
( ( occurrence_of(sK13(X0,X1,X2),X0)
& subactivity_occurrence(X1,sK13(X0,X1,X2))
& subactivity_occurrence(X2,sK13(X0,X1,X2)) )
| ~ min_precedes(X1,X2,X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK13]),skolemize(X3,sK13(X0,X1,X2))],[f72]) ).
fof(f115,plain,
! [X0] :
( ( activity(sK14(X0))
& occurrence_of(X0,sK14(X0)) )
| ~ activity_occurrence(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK14]),skolemize(X1,sK14(X0))],[f77]) ).
fof(f121,plain,
! [X0,X1,X2] :
( ( subactivity(sK18(X0,X1,X2),X0)
& subactivity(sK19(X0,X1,X2),X0)
& atocc(X1,sK18(X0,X1,X2))
& atocc(X2,sK19(X0,X1,X2)) )
| ~ min_precedes(X1,X2,X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK18,sK19]),skolemize(X3,sK18(X0,X1,X2)),skolemize(X4,sK19(X0,X1,X2))],[f91]) ).
fof(f122,plain,
! [X0,X1] :
( ( atocc(X0,X1)
| ! [X2] :
( ~ subactivity(X1,X2)
| ~ atomic(X2)
| ~ occurrence_of(X0,X2) ) )
& ( ? [X2] :
( subactivity(X1,X2)
& atomic(X2)
& occurrence_of(X0,X2) )
| ~ atocc(X0,X1) ) ),
inference(nnf_transformation,[],[f16]) ).
fof(f123,plain,
! [X0,X1] :
( ( atocc(X0,X1)
| ! [X2] :
( ~ subactivity(X1,X2)
| ~ atomic(X2)
| ~ occurrence_of(X0,X2) ) )
& ( ? [X3] :
( subactivity(X1,X3)
& atomic(X3)
& occurrence_of(X0,X3) )
| ~ atocc(X0,X1) ) ),
inference(rectify,[],[f122]) ).
fof(f124,plain,
! [X0,X1] :
( ( atocc(X0,X1)
| ! [X2] :
( ~ subactivity(X1,X2)
| ~ atomic(X2)
| ~ occurrence_of(X0,X2) ) )
& ( ( subactivity(X1,sK20(X0,X1))
& atomic(sK20(X0,X1))
& occurrence_of(X0,sK20(X0,X1)) )
| ~ atocc(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK20]),skolemize(X3,sK20(X0,X1))],[f123]) ).
fof(f128,plain,
~ leaf_occ(sK2,sK3),
inference(cnf_transformation,[],[f101]) ).
fof(f129,plain,
arboreal(sK2),
inference(cnf_transformation,[],[f101]) ).
fof(f130,plain,
subactivity_occurrence(sK2,sK3),
inference(cnf_transformation,[],[f101]) ).
fof(f131,plain,
occurrence_of(sK3,tptp0),
inference(cnf_transformation,[],[f101]) ).
fof(f140,plain,
! [X0,X1,X5] :
( ~ min_precedes(sK5(X0),X5,tptp0)
| sK7(X0) = X5
| sK6(X0) = X5
| ~ occurrence_of(X1,tptp0)
| ~ subactivity_occurrence(X0,X1)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f102]) ).
fof(f142,plain,
! [X0,X1] :
( ~ subactivity_occurrence(X0,X1)
| occurrence_of(sK7(X0),tptp2)
| ~ occurrence_of(X1,tptp0)
| occurrence_of(sK7(X0),tptp1)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f102]) ).
fof(f143,plain,
! [X0,X1] :
( ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0)
| min_precedes(sK5(X0),sK6(X0),tptp0)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f102]) ).
fof(f144,plain,
! [X0,X1] :
( ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0)
| occurrence_of(sK6(X0),tptp4)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f102]) ).
fof(f145,plain,
! [X0,X1] :
( ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0)
| next_subocc(X0,sK5(X0),tptp0)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f102]) ).
fof(f146,plain,
! [X0,X1] :
( ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0)
| occurrence_of(sK5(X0),tptp3)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f102]) ).
fof(f148,plain,
tptp3 != tptp2,
inference(cnf_transformation,[],[f44]) ).
fof(f149,plain,
tptp3 != tptp1,
inference(cnf_transformation,[],[f43]) ).
fof(f150,plain,
tptp3 != tptp4,
inference(cnf_transformation,[],[f40]) ).
fof(f161,plain,
! [X2,X3,X0,X1] :
( ~ min_precedes(X1,X3,X2)
| ~ occurrence_of(X0,X2)
| ~ leaf_occ(X1,X0) ),
inference(cnf_transformation,[],[f61]) ).
fof(f170,plain,
! [X2,X0,X1] :
( ~ next_subocc(X0,X1,X2)
| min_precedes(X0,X1,X2) ),
inference(cnf_transformation,[],[f111]) ).
fof(f176,plain,
! [X0,X1] :
( ~ occurrence_of(X0,X1)
| ~ atomic(X1)
| arboreal(X0) ),
inference(cnf_transformation,[],[f112]) ).
fof(f180,plain,
! [X2,X0,X1] :
( subactivity_occurrence(X1,sK13(X0,X1,X2))
| ~ min_precedes(X1,X2,X0) ),
inference(cnf_transformation,[],[f114]) ).
fof(f181,plain,
! [X2,X0,X1] :
( occurrence_of(sK13(X0,X1,X2),X0)
| ~ min_precedes(X1,X2,X0) ),
inference(cnf_transformation,[],[f114]) ).
fof(f186,plain,
! [X0,X1] :
( ~ occurrence_of(X1,X0)
| activity_occurrence(X1) ),
inference(cnf_transformation,[],[f76]) ).
fof(f188,plain,
! [X0] :
( occurrence_of(X0,sK14(X0))
| ~ activity_occurrence(X0) ),
inference(cnf_transformation,[],[f115]) ).
fof(f190,plain,
! [X2,X0,X1] :
( ~ occurrence_of(X0,X2)
| ~ occurrence_of(X0,X1)
| X1 = X2 ),
inference(cnf_transformation,[],[f79]) ).
fof(f206,plain,
! [X2,X0,X1] :
( atocc(X1,sK18(X0,X1,X2))
| ~ min_precedes(X1,X2,X0) ),
inference(cnf_transformation,[],[f121]) ).
fof(f209,plain,
! [X0,X1] :
( occurrence_of(X0,sK20(X0,X1))
| ~ atocc(X0,X1) ),
inference(cnf_transformation,[],[f124]) ).
fof(f210,plain,
! [X0,X1] :
( atomic(sK20(X0,X1))
| ~ atocc(X0,X1) ),
inference(cnf_transformation,[],[f124]) ).
fof(f235,plain,
! [X0,X1] :
( ~ atocc(X0,X1)
| ~ atomic(sK20(X0,X1))
| arboreal(X0) ),
inference(resolution,[],[f209,f176]) ).
fof(f239,plain,
! [X0,X1] :
( ~ atocc(X0,X1)
| arboreal(X0) ),
inference(forward_subsumption_resolution,[],[f235,f210]) ).
fof(f242,plain,
! [X0,X1] :
( ~ occurrence_of(X0,X1)
| sK14(X0) = X1
| ~ activity_occurrence(X0) ),
inference(resolution,[],[f190,f188]) ).
fof(f245,plain,
! [X0,X1] :
( ~ occurrence_of(X0,X1)
| sK14(X0) = X1 ),
inference(forward_subsumption_resolution,[],[f242,f186]) ).
fof(f298,plain,
! [X2,X0,X1] :
( ~ min_precedes(X0,X1,X2)
| arboreal(X0) ),
inference(resolution,[],[f206,f239]) ).
fof(f364,plain,
( ~ occurrence_of(sK3,tptp0)
| occurrence_of(sK6(sK2),tptp4)
| ~ arboreal(sK2)
| leaf_occ(sK2,sK3) ),
inference(resolution,[],[f144,f130]) ).
fof(f371,plain,
( occurrence_of(sK6(sK2),tptp4)
| ~ arboreal(sK2)
| leaf_occ(sK2,sK3) ),
inference(forward_subsumption_resolution,[],[f364,f131]) ).
fof(f372,plain,
( occurrence_of(sK6(sK2),tptp4)
| leaf_occ(sK2,sK3) ),
inference(forward_subsumption_resolution,[],[f371,f129]) ).
fof(f373,plain,
occurrence_of(sK6(sK2),tptp4),
inference(forward_subsumption_resolution,[],[f372,f128]) ).
fof(f375,plain,
! [X0] :
( ~ occurrence_of(sK6(sK2),X0)
| tptp4 = X0 ),
inference(resolution,[],[f373,f190]) ).
fof(f384,plain,
! [X2,X0,X1] :
( ~ occurrence_of(sK13(X0,X1,X2),tptp0)
| occurrence_of(sK5(X1),tptp3)
| ~ arboreal(X1)
| leaf_occ(X1,sK13(X0,X1,X2))
| ~ min_precedes(X1,X2,X0) ),
inference(resolution,[],[f146,f180]) ).
fof(f385,plain,
! [X2,X0,X1] :
( ~ occurrence_of(sK13(X0,X1,X2),tptp0)
| occurrence_of(sK5(X1),tptp3)
| leaf_occ(X1,sK13(X0,X1,X2))
| ~ min_precedes(X1,X2,X0) ),
inference(forward_subsumption_resolution,[],[f384,f298]) ).
fof(f418,plain,
( ~ occurrence_of(sK3,tptp0)
| next_subocc(sK2,sK5(sK2),tptp0)
| ~ arboreal(sK2)
| leaf_occ(sK2,sK3) ),
inference(resolution,[],[f145,f130]) ).
fof(f421,plain,
! [X2,X0,X1] :
( ~ occurrence_of(sK13(X0,X1,X2),tptp0)
| next_subocc(X1,sK5(X1),tptp0)
| ~ arboreal(X1)
| leaf_occ(X1,sK13(X0,X1,X2))
| ~ min_precedes(X1,X2,X0) ),
inference(resolution,[],[f145,f180]) ).
fof(f422,plain,
! [X2,X0,X1] :
( ~ occurrence_of(sK13(X0,X1,X2),tptp0)
| next_subocc(X1,sK5(X1),tptp0)
| leaf_occ(X1,sK13(X0,X1,X2))
| ~ min_precedes(X1,X2,X0) ),
inference(forward_subsumption_resolution,[],[f421,f298]) ).
fof(f425,plain,
( next_subocc(sK2,sK5(sK2),tptp0)
| ~ arboreal(sK2)
| leaf_occ(sK2,sK3) ),
inference(forward_subsumption_resolution,[],[f418,f131]) ).
fof(f426,plain,
( next_subocc(sK2,sK5(sK2),tptp0)
| leaf_occ(sK2,sK3) ),
inference(forward_subsumption_resolution,[],[f425,f129]) ).
fof(f427,plain,
next_subocc(sK2,sK5(sK2),tptp0),
inference(forward_subsumption_resolution,[],[f426,f128]) ).
fof(f445,plain,
( ~ occurrence_of(sK3,tptp0)
| min_precedes(sK5(sK2),sK6(sK2),tptp0)
| ~ arboreal(sK2)
| leaf_occ(sK2,sK3) ),
inference(resolution,[],[f143,f130]) ).
fof(f452,plain,
( min_precedes(sK5(sK2),sK6(sK2),tptp0)
| ~ arboreal(sK2)
| leaf_occ(sK2,sK3) ),
inference(forward_subsumption_resolution,[],[f445,f131]) ).
fof(f453,plain,
( min_precedes(sK5(sK2),sK6(sK2),tptp0)
| leaf_occ(sK2,sK3) ),
inference(forward_subsumption_resolution,[],[f452,f129]) ).
fof(f454,plain,
min_precedes(sK5(sK2),sK6(sK2),tptp0),
inference(forward_subsumption_resolution,[],[f453,f128]) ).
fof(f455,plain,
( occurrence_of(sK7(sK2),tptp2)
| ~ occurrence_of(sK3,tptp0)
| occurrence_of(sK7(sK2),tptp1)
| ~ arboreal(sK2)
| leaf_occ(sK2,sK3) ),
inference(resolution,[],[f142,f130]) ).
fof(f462,plain,
( occurrence_of(sK7(sK2),tptp2)
| occurrence_of(sK7(sK2),tptp1)
| ~ arboreal(sK2)
| leaf_occ(sK2,sK3) ),
inference(forward_subsumption_resolution,[],[f455,f131]) ).
fof(f463,plain,
( occurrence_of(sK7(sK2),tptp2)
| occurrence_of(sK7(sK2),tptp1)
| leaf_occ(sK2,sK3) ),
inference(forward_subsumption_resolution,[],[f462,f129]) ).
fof(f464,plain,
( occurrence_of(sK7(sK2),tptp2)
| occurrence_of(sK7(sK2),tptp1) ),
inference(forward_subsumption_resolution,[],[f463,f128]) ).
fof(f466,definition,
( spl21_3
<=> occurrence_of(sK7(sK2),tptp1) ),
introduced(definition,[new_symbols(definition,[spl21_3])],[avatar_definition]) ).
fof(f468,plain,
( occurrence_of(sK7(sK2),tptp1)
| ~ spl21_3 ),
inference(avatar_component_clause,[],[f466]) ).
fof(f470,definition,
( spl21_4
<=> occurrence_of(sK7(sK2),tptp2) ),
introduced(definition,[new_symbols(definition,[spl21_4])],[avatar_definition]) ).
fof(f472,plain,
( occurrence_of(sK7(sK2),tptp2)
| ~ spl21_4 ),
inference(avatar_component_clause,[],[f470]) ).
fof(f473,plain,
( spl21_3
| spl21_4 ),
inference(avatar_split_clause,[],[f464,f470,f466]) ).
fof(f497,plain,
min_precedes(sK2,sK5(sK2),tptp0),
inference(resolution,[],[f427,f170]) ).
fof(f546,plain,
! [X0] :
( ~ leaf_occ(sK5(sK2),X0)
| ~ occurrence_of(X0,tptp0) ),
inference(resolution,[],[f454,f161]) ).
fof(f685,plain,
! [X0] :
( ~ leaf_occ(sK2,X0)
| ~ occurrence_of(X0,tptp0) ),
inference(resolution,[],[f497,f161]) ).
fof(f1031,plain,
! [X0,X1] :
( occurrence_of(sK5(X0),tptp3)
| leaf_occ(X0,sK13(tptp0,X0,X1))
| ~ min_precedes(X0,X1,tptp0)
| ~ min_precedes(X0,X1,tptp0) ),
inference(resolution,[],[f385,f181]) ).
fof(f1032,plain,
! [X0,X1] :
( leaf_occ(X0,sK13(tptp0,X0,X1))
| occurrence_of(sK5(X0),tptp3)
| ~ min_precedes(X0,X1,tptp0) ),
inference(duplicate_literal_removal,[],[f1031]) ).
fof(f1087,plain,
! [X0,X1] :
( next_subocc(X0,sK5(X0),tptp0)
| leaf_occ(X0,sK13(tptp0,X0,X1))
| ~ min_precedes(X0,X1,tptp0)
| ~ min_precedes(X0,X1,tptp0) ),
inference(resolution,[],[f422,f181]) ).
fof(f1088,plain,
! [X0,X1] :
( leaf_occ(X0,sK13(tptp0,X0,X1))
| next_subocc(X0,sK5(X0),tptp0)
| ~ min_precedes(X0,X1,tptp0) ),
inference(duplicate_literal_removal,[],[f1087]) ).
fof(f1184,definition,
( spl21_40
<=> ! [X0] :
( ~ occurrence_of(X0,tptp0)
| ~ subactivity_occurrence(sK2,X0) ) ),
introduced(definition,[new_symbols(definition,[spl21_40])],[avatar_definition]) ).
fof(f1185,plain,
( ! [X0] :
( ~ subactivity_occurrence(sK2,X0)
| ~ occurrence_of(X0,tptp0) )
| ~ spl21_40 ),
inference(avatar_component_clause,[],[f1184]) ).
fof(f1224,plain,
( ~ occurrence_of(sK3,tptp0)
| ~ spl21_40 ),
inference(resolution,[],[f1185,f130]) ).
fof(f1229,plain,
( $false
| ~ spl21_40 ),
inference(forward_subsumption_resolution,[],[f1224,f131]) ).
fof(f1230,plain,
~ spl21_40,
inference(avatar_contradiction_clause,[],[f1229]) ).
fof(f2199,definition,
( spl21_93
<=> ! [X0] : ~ min_precedes(sK5(sK2),X0,tptp0) ),
introduced(definition,[new_symbols(definition,[spl21_93])],[avatar_definition]) ).
fof(f2200,plain,
( ! [X0] : ~ min_precedes(sK5(sK2),X0,tptp0)
| ~ spl21_93 ),
inference(avatar_component_clause,[],[f2199]) ).
fof(f2278,plain,
! [X0] :
( occurrence_of(sK5(sK5(sK2)),tptp3)
| ~ min_precedes(sK5(sK2),X0,tptp0)
| ~ occurrence_of(sK13(tptp0,sK5(sK2),X0),tptp0) ),
inference(resolution,[],[f1032,f546]) ).
fof(f2289,plain,
! [X0] :
( occurrence_of(sK5(sK5(sK2)),tptp3)
| ~ min_precedes(sK5(sK2),X0,tptp0) ),
inference(forward_subsumption_resolution,[],[f2278,f181]) ).
fof(f2291,definition,
( spl21_97
<=> occurrence_of(sK5(sK5(sK2)),tptp3) ),
introduced(definition,[new_symbols(definition,[spl21_97])],[avatar_definition]) ).
fof(f2293,plain,
( occurrence_of(sK5(sK5(sK2)),tptp3)
| ~ spl21_97 ),
inference(avatar_component_clause,[],[f2291]) ).
fof(f2296,plain,
( spl21_93
| spl21_97 ),
inference(avatar_split_clause,[],[f2289,f2291,f2199]) ).
fof(f2428,plain,
( $false
| ~ spl21_93 ),
inference(resolution,[],[f2200,f454]) ).
fof(f2442,plain,
~ spl21_93,
inference(avatar_contradiction_clause,[],[f2428]) ).
fof(f2449,plain,
! [X0] :
( next_subocc(sK5(sK2),sK5(sK5(sK2)),tptp0)
| ~ min_precedes(sK5(sK2),X0,tptp0)
| ~ occurrence_of(sK13(tptp0,sK5(sK2),X0),tptp0) ),
inference(resolution,[],[f1088,f546]) ).
fof(f2454,plain,
! [X0] :
( next_subocc(sK5(sK2),sK5(sK5(sK2)),tptp0)
| ~ min_precedes(sK5(sK2),X0,tptp0) ),
inference(forward_subsumption_resolution,[],[f2449,f181]) ).
fof(f2461,definition,
( spl21_101
<=> next_subocc(sK5(sK2),sK5(sK5(sK2)),tptp0) ),
introduced(definition,[new_symbols(definition,[spl21_101])],[avatar_definition]) ).
fof(f2463,plain,
( next_subocc(sK5(sK2),sK5(sK5(sK2)),tptp0)
| ~ spl21_101 ),
inference(avatar_component_clause,[],[f2461]) ).
fof(f2464,plain,
( spl21_93
| spl21_101 ),
inference(avatar_split_clause,[],[f2454,f2461,f2199]) ).
fof(f2542,plain,
( tptp3 = sK14(sK5(sK5(sK2)))
| ~ spl21_97 ),
inference(resolution,[],[f2293,f245]) ).
fof(f2877,plain,
( min_precedes(sK5(sK2),sK5(sK5(sK2)),tptp0)
| ~ spl21_101 ),
inference(resolution,[],[f2463,f170]) ).
fof(f2941,plain,
( ! [X0] :
( ~ occurrence_of(sK7(sK2),X0)
| tptp2 = X0 )
| ~ spl21_4 ),
inference(resolution,[],[f472,f190]) ).
fof(f3364,plain,
( ! [X0] :
( sK7(sK2) = sK5(sK5(sK2))
| sK6(sK2) = sK5(sK5(sK2))
| ~ occurrence_of(X0,tptp0)
| ~ subactivity_occurrence(sK2,X0)
| ~ arboreal(sK2)
| leaf_occ(sK2,X0) )
| ~ spl21_101 ),
inference(resolution,[],[f2877,f140]) ).
fof(f3416,plain,
( ! [X0] :
( sK7(sK2) = sK5(sK5(sK2))
| sK6(sK2) = sK5(sK5(sK2))
| ~ occurrence_of(X0,tptp0)
| ~ subactivity_occurrence(sK2,X0)
| ~ arboreal(sK2) )
| ~ spl21_101 ),
inference(forward_subsumption_resolution,[],[f3364,f685]) ).
fof(f3430,plain,
( ! [X0] :
( sK7(sK2) = sK5(sK5(sK2))
| sK6(sK2) = sK5(sK5(sK2))
| ~ occurrence_of(X0,tptp0)
| ~ subactivity_occurrence(sK2,X0) )
| ~ spl21_101 ),
inference(forward_subsumption_resolution,[],[f3416,f129]) ).
fof(f3432,definition,
( spl21_144
<=> sK6(sK2) = sK5(sK5(sK2)) ),
introduced(definition,[new_symbols(definition,[spl21_144])],[avatar_definition]) ).
fof(f3434,plain,
( sK6(sK2) = sK5(sK5(sK2))
| ~ spl21_144 ),
inference(avatar_component_clause,[],[f3432]) ).
fof(f3436,definition,
( spl21_145
<=> sK7(sK2) = sK5(sK5(sK2)) ),
introduced(definition,[new_symbols(definition,[spl21_145])],[avatar_definition]) ).
fof(f3438,plain,
( sK7(sK2) = sK5(sK5(sK2))
| ~ spl21_145 ),
inference(avatar_component_clause,[],[f3436]) ).
fof(f3439,plain,
( spl21_40
| spl21_144
| spl21_145
| ~ spl21_101 ),
inference(avatar_split_clause,[],[f3430,f2461,f3436,f3432,f1184]) ).
fof(f3573,plain,
( occurrence_of(sK6(sK2),tptp3)
| ~ spl21_97
| ~ spl21_144 ),
inference(superposition,[],[f2293,f3434]) ).
fof(f3645,plain,
( occurrence_of(sK7(sK2),tptp3)
| ~ spl21_97
| ~ spl21_145 ),
inference(superposition,[],[f2293,f3438]) ).
fof(f3649,plain,
( tptp3 = sK14(sK7(sK2))
| ~ spl21_97
| ~ spl21_145 ),
inference(superposition,[],[f2542,f3438]) ).
fof(f3680,plain,
( tptp3 = tptp4
| ~ spl21_97
| ~ spl21_144 ),
inference(resolution,[],[f3573,f375]) ).
fof(f3689,plain,
( $false
| ~ spl21_97
| ~ spl21_144 ),
inference(forward_subsumption_resolution,[],[f3680,f150]) ).
fof(f3690,plain,
( ~ spl21_97
| ~ spl21_144 ),
inference(avatar_contradiction_clause,[],[f3689]) ).
fof(f3734,plain,
( tptp3 = tptp2
| ~ spl21_4
| ~ spl21_97
| ~ spl21_145 ),
inference(resolution,[],[f3645,f2941]) ).
fof(f3743,plain,
( $false
| ~ spl21_4
| ~ spl21_97
| ~ spl21_145 ),
inference(forward_subsumption_resolution,[],[f3734,f148]) ).
fof(f3744,plain,
( ~ spl21_4
| ~ spl21_97
| ~ spl21_145 ),
inference(avatar_contradiction_clause,[],[f3743]) ).
fof(f3758,plain,
( tptp1 = sK14(sK7(sK2))
| ~ spl21_3 ),
inference(resolution,[],[f468,f245]) ).
fof(f3760,plain,
( tptp3 = tptp1
| ~ spl21_3
| ~ spl21_97
| ~ spl21_145 ),
inference(forward_demodulation,[],[f3758,f3649]) ).
fof(f3761,plain,
( $false
| ~ spl21_3
| ~ spl21_97
| ~ spl21_145 ),
inference(forward_subsumption_resolution,[],[f3760,f149]) ).
fof(f3762,plain,
( ~ spl21_3
| ~ spl21_97
| ~ spl21_145 ),
inference(avatar_contradiction_clause,[],[f3761]) ).
cnf(s2,plain,
( spl21_3
| spl21_4 ),
inference(sat_conversion,[],[f473]) ).
cnf(s30,plain,
~ spl21_40,
inference(sat_conversion,[],[f1230]) ).
cnf(s68,plain,
( spl21_93
| spl21_97 ),
inference(sat_conversion,[],[f2296]) ).
cnf(s75,plain,
~ spl21_93,
inference(sat_conversion,[],[f2442]) ).
cnf(s77,plain,
( spl21_93
| spl21_101 ),
inference(sat_conversion,[],[f2464]) ).
cnf(s109,plain,
( spl21_40
| ~ spl21_101
| spl21_144
| spl21_145 ),
inference(sat_conversion,[],[f3439]) ).
cnf(s117,plain,
( ~ spl21_97
| ~ spl21_144 ),
inference(sat_conversion,[],[f3690]) ).
cnf(s118,plain,
( ~ spl21_4
| ~ spl21_97
| ~ spl21_145 ),
inference(sat_conversion,[],[f3744]) ).
cnf(s120,plain,
( ~ spl21_3
| ~ spl21_97
| ~ spl21_145 ),
inference(sat_conversion,[],[f3762]) ).
cnf(s123,plain,
spl21_101,
inference(rat,[],[s77,s75]) ).
cnf(s129,plain,
spl21_97,
inference(rat,[],[s68,s75]) ).
cnf(s130,plain,
~ spl21_144,
inference(rat,[],[s117,s129]) ).
cnf(s136,plain,
spl21_145,
inference(rat,[],[s109,s130,s123,s30]) ).
cnf(s137,plain,
~ spl21_3,
inference(rat,[],[s120,s129,s136]) ).
cnf(s138,plain,
~ spl21_4,
inference(rat,[],[s118,s129,s136]) ).
cnf(s142,plain,
$false,
inference(rat,[],[s2,s138,s137]) ).
fof(f3763,plain,
$false,
inference(avatar_sat_refutation,[],[s142]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : PRO018+2 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.38 % Computer : n001.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Sun Sep 27 22:31:02 UTC 2026
% 0.12/0.39 % CPUTime :
% 0.12/0.39 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.42 Running first-order theorem proving
% 0.12/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
% 4.58/1.64 % (4026873)Detected formulas, will run a generic FOF schedule.
% 4.58/1.64 % (4026878)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=3143366111:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 4.58/1.64 % (4026880)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=4006588962:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 4.58/1.64 % (4026882)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=4011921553:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 4.58/1.64 % (4026884)dis-21_1_sil=8000:lcm=predicate:random_seed=197788885: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)
% 4.58/1.64 % (4026879)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=2515285650:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 4.58/1.64 % (4026881)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=3306688313:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 4.58/1.64 % (4026883)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1095976250:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 4.58/1.64 % (4026881)Instruction limit reached!
% 4.58/1.64 % (4026881)------------------------------
% 4.58/1.64 % (4026881)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.58/1.64 % (4026881)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.58/1.64 % (4026881)CaDiCaL version: 2.1.3
% 4.58/1.64 % (4026881)Termination reason: Instruction limit
% 4.58/1.64 % (4026881)Termination phase: Saturation
% 4.58/1.64 % (4026881)Time elapsed: 0.061 s
% 4.58/1.64 % (4026881)Peak memory usage: 89 MB
% 4.58/1.64 % (4026881)Instructions burned: 110 (million)
% 4.58/1.64 % (4026882)Instruction limit reached!
% 4.58/1.64 % (4026882)------------------------------
% 4.58/1.64 % (4026882)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.58/1.64 % (4026882)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.58/1.64 % (4026882)CaDiCaL version: 2.1.3
% 4.58/1.64 % (4026882)Termination reason: Instruction limit
% 4.58/1.64 % (4026882)Termination phase: Saturation
% 4.58/1.64 % (4026882)Time elapsed: 0.067 s
% 4.58/1.64 % (4026882)Peak memory usage: 88 MB
% 4.58/1.64 % (4026882)Instructions burned: 120 (million)
% 4.58/1.64 % (4026884)Instruction limit reached!
% 4.58/1.64 % (4026884)------------------------------
% 4.58/1.64 % (4026884)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.58/1.64 % (4026884)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.58/1.64 % (4026884)CaDiCaL version: 2.1.3
% 4.58/1.64 % (4026884)Termination reason: Instruction limit
% 4.58/1.64 % (4026884)Termination phase: Saturation
% 4.58/1.64 % (4026884)Time elapsed: 0.075 s
% 4.58/1.64 % (4026884)Peak memory usage: 89 MB
% 4.58/1.64 % (4026884)Instructions burned: 131 (million)
% 4.58/1.64 % (4026883)Instruction limit reached!
% 4.58/1.64 % (4026883)------------------------------
% 4.58/1.64 % (4026883)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.58/1.64 % (4026883)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.58/1.64 % (4026883)CaDiCaL version: 2.1.3
% 4.58/1.64 % (4026883)Termination reason: Instruction limit
% 4.58/1.64 % (4026883)Termination phase: Saturation
% 4.58/1.64 % (4026883)Time elapsed: 0.099 s
% 4.58/1.64 % (4026883)Peak memory usage: 90 MB
% 4.58/1.64 % (4026883)Instructions burned: 139 (million)
% 4.58/1.64 % (4026892)lrs+10_1_sil=8000:sp=occurrence:random_seed=2413350516:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 4.58/1.64 % (4026893)lrs+10_1_sil=32000:urr=on:br=off:random_seed=3891959480:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 4.58/1.64 % (4026894)lrs+1011_1_sil=32000:sp=occurrence:random_seed=2271300524:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 4.58/1.64 % (4026895)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=2490306304:s2a=on:i=248:s2at=1.23:gtg=position_2997 on theBenchmark for (2997ds/248Mi)
% 4.58/1.64 % (4026893)Instruction limit reached!
% 4.58/1.64 % (4026893)------------------------------
% 4.58/1.64 % (4026893)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.58/1.64 % (4026893)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.58/1.64 % (4026893)CaDiCaL version: 2.1.3
% 4.58/1.64 % (4026893)Termination reason: Instruction limit
% 4.58/1.64 % (4026893)Termination phase: Saturation
% 4.58/1.64 % (4026893)Time elapsed: 0.083 s
% 4.58/1.64 % (4026893)Peak memory usage: 89 MB
% 4.58/1.64 % (4026893)Instructions burned: 157 (million)
% 4.58/1.64 % (4026892)First to succeed.
% 4.58/1.64 % (4026892)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-4026873"
% 4.58/1.64 % (4026878)Also succeeded, but the first one will report.
% 4.58/1.64 % (4026895)Instruction limit reached!
% 4.58/1.64 % (4026895)------------------------------
% 4.58/1.64 % (4026895)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.58/1.64 % (4026895)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.58/1.64 % (4026895)CaDiCaL version: 2.1.3
% 4.58/1.64 % (4026895)Termination reason: Instruction limit
% 4.58/1.64 % (4026895)Termination phase: Saturation
% 4.58/1.65 % (4026895)Time elapsed: 0.146 s
% 4.58/1.65 % (4026895)Peak memory usage: 90 MB
% 4.58/1.65 % (4026895)Instructions burned: 248 (million)
% 4.58/1.65 % (4026894)Instruction limit reached!
% 4.58/1.65 % (4026894)------------------------------
% 4.58/1.65 % (4026894)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.58/1.65 % (4026894)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.58/1.65 % (4026894)CaDiCaL version: 2.1.3
% 4.58/1.65 % (4026894)Termination reason: Instruction limit
% 4.58/1.65 % (4026894)Termination phase: Saturation
% 4.58/1.65 % (4026894)Time elapsed: 0.218 s
% 4.58/1.65 % (4026894)Peak memory usage: 91 MB
% 4.58/1.65 % (4026894)Instructions burned: 326 (million)
% 4.58/1.65 % (4026900)lrs+1002_1_to=lpo:sil=8000:sos=on:random_seed=241358346:st=4:cts=off:i=294:sd=2:ins=7:amm=off:ss=axioms_2995 on theBenchmark for (2995ds/294Mi)
% 4.58/1.65 % (4026901)lrs+10_1_ncem=casc2026/models/loop7.pt:sil=32000:tgt=ground:npcc=on:random_seed=3753467673:i=2350_2994 on theBenchmark for (2994ds/2350Mi)
% 4.58/1.65 % (4026892)Refutation found. Thanks to Tanya!
% 4.58/1.65 % SZS status Theorem for theBenchmark
% 4.58/1.65 % SZS output start Proof for theBenchmark
% See solution above
% 6.08/1.86 % (4026892)------------------------------
% 6.08/1.86 % (4026892)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.08/1.86 % (4026892)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.08/1.86 % (4026892)CaDiCaL version: 2.1.3
% 6.08/1.86 % (4026892)Termination reason: Refutation
% 6.08/1.86 % (4026892)Time elapsed: 0.113 s
% 6.08/1.86 % (4026892)Peak memory usage: 91 MB
% 6.08/1.86 % (4026892)Instructions burned: 170 (million)
% 6.08/1.86 % (4026892)------------------------------
% 6.08/1.86 % (4026892)------------------------------
% 6.08/1.86 % (4026873)Success in time 0.773 s
% 6.08/1.86 % Vampire exiting
%------------------------------------------------------------------------------