%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : PRO018+4 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n006.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.18s 1.55s
% Output : Refutation 5.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 22
% Syntax : Number of formulae : 163 ( 30 unt; 9 def)
% Number of atoms : 574 ( 40 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 670 ( 259 ~; 274 |; 109 &)
% ( 12 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 20 ( 18 usr; 9 prp; 0-3 aty)
% Number of functors : 14 ( 14 usr; 7 con; 0-3 aty)
% Number of variables : 202 ( 0 sgn 163 !; 39 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
! [X0,X1] :
( occurrence_of(X1,X0)
=> ( activity(X0)
& activity_occurrence(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_03) ).
fof(f7,axiom,
! [X0,X1,X2] :
( min_precedes(X1,X2,X0)
=> ? [X3] :
( occurrence_of(X3,X0)
& subactivity_occurrence(X1,X3)
& subactivity_occurrence(X2,X3) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_06) ).
fof(f9,axiom,
! [X0,X1,X2] :
( ( occurrence_of(X0,X1)
& occurrence_of(X0,X2) )
=> X1 = X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_08) ).
fof(f10,axiom,
! [X0,X1,X2] :
( ( occurrence_of(X0,X2)
& leaf_occ(X1,X0) )
=> ~ ? [X3] : min_precedes(X1,X3,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_09) ).
fof(f13,axiom,
! [X0] :
( activity_occurrence(X0)
=> ? [X1] :
( activity(X1)
& occurrence_of(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_12) ).
fof(f17,axiom,
! [X0,X1] :
( occurrence_of(X0,X1)
=> ( arboreal(X0)
<=> atomic(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_16) ).
fof(f27,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_26) ).
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(f39,axiom,
atomic(tptp3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_38) ).
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(f51,plain,
! [X0] :
( activity_occurrence(X0)
=> ? [X1] : occurrence_of(X0,X1) ),
inference(pure_predicate_removal,[],[f13]) ).
fof(f52,plain,
! [X0,X1] :
( occurrence_of(X1,X0)
=> activity_occurrence(X1) ),
inference(pure_predicate_removal,[],[f4]) ).
fof(f54,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(f55,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,[],[f54]) ).
fof(f56,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(f57,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,[],[f56]) ).
fof(f60,plain,
! [X0,X1,X2] :
( ? [X3] :
( occurrence_of(X3,X0)
& subactivity_occurrence(X1,X3)
& subactivity_occurrence(X2,X3) )
| ~ min_precedes(X1,X2,X0) ),
inference(ennf_transformation,[],[f7]) ).
fof(f63,plain,
! [X0,X1,X2] :
( ! [X3] : ~ min_precedes(X1,X3,X2)
| ~ occurrence_of(X0,X2)
| ~ leaf_occ(X1,X0) ),
inference(ennf_transformation,[],[f10]) ).
fof(f64,plain,
! [X0,X1,X2] :
( ! [X3] : ~ min_precedes(X1,X3,X2)
| ~ occurrence_of(X0,X2)
| ~ leaf_occ(X1,X0) ),
inference(flattening,[],[f63]) ).
fof(f72,plain,
! [X0,X1] :
( ( arboreal(X0)
<=> atomic(X1) )
| ~ occurrence_of(X0,X1) ),
inference(ennf_transformation,[],[f17]) ).
fof(f76,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,[],[f27]) ).
fof(f77,plain,
! [X0] :
( ? [X1] : occurrence_of(X0,X1)
| ~ activity_occurrence(X0) ),
inference(ennf_transformation,[],[f51]) ).
fof(f78,plain,
! [X0,X1] :
( activity_occurrence(X1)
| ~ occurrence_of(X1,X0) ),
inference(ennf_transformation,[],[f52]) ).
fof(f79,plain,
! [X0,X1,X2] :
( X1 = X2
| ~ occurrence_of(X0,X1)
| ~ occurrence_of(X0,X2) ),
inference(ennf_transformation,[],[f9]) ).
fof(f80,plain,
! [X0,X1,X2] :
( X1 = X2
| ~ occurrence_of(X0,X1)
| ~ occurrence_of(X0,X2) ),
inference(flattening,[],[f79]) ).
fof(f99,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(f100,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,[],[f55,f99]) ).
fof(f104,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))],[f100]) ).
fof(f105,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))],[f57]) ).
fof(f106,plain,
! [X0,X1,X2] :
( ( occurrence_of(sK8(X0,X1,X2),X0)
& subactivity_occurrence(X1,sK8(X0,X1,X2))
& subactivity_occurrence(X2,sK8(X0,X1,X2)) )
| ~ min_precedes(X1,X2,X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK8]),skolemize(X3,sK8(X0,X1,X2))],[f60]) ).
fof(f111,plain,
! [X0,X1] :
( ( ( arboreal(X0)
| ~ atomic(X1) )
& ( atomic(X1)
| ~ arboreal(X0) ) )
| ~ occurrence_of(X0,X1) ),
inference(nnf_transformation,[],[f72]) ).
fof(f112,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,[],[f76]) ).
fof(f113,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,[],[f112]) ).
fof(f114,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,[],[f113]) ).
fof(f115,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))],[f114]) ).
fof(f116,plain,
! [X0] :
( occurrence_of(X0,sK12(X0))
| ~ activity_occurrence(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK12]),skolemize(X1,sK12(X0))],[f77]) ).
fof(f128,plain,
~ leaf_occ(sK2,sK3),
inference(cnf_transformation,[],[f104]) ).
fof(f129,plain,
arboreal(sK2),
inference(cnf_transformation,[],[f104]) ).
fof(f130,plain,
subactivity_occurrence(sK2,sK3),
inference(cnf_transformation,[],[f104]) ).
fof(f131,plain,
occurrence_of(sK3,tptp0),
inference(cnf_transformation,[],[f104]) ).
fof(f139,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,[],[f105]) ).
fof(f141,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,[],[f105]) ).
fof(f142,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,[],[f105]) ).
fof(f143,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,[],[f105]) ).
fof(f144,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,[],[f105]) ).
fof(f145,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,[],[f105]) ).
fof(f146,plain,
tptp3 != tptp2,
inference(cnf_transformation,[],[f44]) ).
fof(f147,plain,
tptp3 != tptp1,
inference(cnf_transformation,[],[f43]) ).
fof(f148,plain,
tptp3 != tptp4,
inference(cnf_transformation,[],[f40]) ).
fof(f149,plain,
atomic(tptp3),
inference(cnf_transformation,[],[f39]) ).
fof(f154,plain,
! [X2,X0,X1] :
( subactivity_occurrence(X2,sK8(X0,X1,X2))
| ~ min_precedes(X1,X2,X0) ),
inference(cnf_transformation,[],[f106]) ).
fof(f156,plain,
! [X2,X0,X1] :
( occurrence_of(sK8(X0,X1,X2),X0)
| ~ min_precedes(X1,X2,X0) ),
inference(cnf_transformation,[],[f106]) ).
fof(f164,plain,
! [X2,X3,X0,X1] :
( ~ min_precedes(X1,X3,X2)
| ~ occurrence_of(X0,X2)
| ~ leaf_occ(X1,X0) ),
inference(cnf_transformation,[],[f64]) ).
fof(f172,plain,
! [X0,X1] :
( ~ occurrence_of(X0,X1)
| ~ atomic(X1)
| arboreal(X0) ),
inference(cnf_transformation,[],[f111]) ).
fof(f176,plain,
! [X2,X0,X1] :
( ~ next_subocc(X0,X1,X2)
| min_precedes(X0,X1,X2) ),
inference(cnf_transformation,[],[f115]) ).
fof(f179,plain,
! [X0] :
( occurrence_of(X0,sK12(X0))
| ~ activity_occurrence(X0) ),
inference(cnf_transformation,[],[f116]) ).
fof(f180,plain,
! [X0,X1] :
( ~ occurrence_of(X1,X0)
| activity_occurrence(X1) ),
inference(cnf_transformation,[],[f78]) ).
fof(f181,plain,
! [X2,X0,X1] :
( ~ occurrence_of(X0,X2)
| ~ occurrence_of(X0,X1)
| X1 = X2 ),
inference(cnf_transformation,[],[f80]) ).
fof(f220,plain,
! [X0,X1] :
( ~ occurrence_of(X0,X1)
| sK12(X0) = X1
| ~ activity_occurrence(X0) ),
inference(resolution,[],[f181,f179]) ).
fof(f222,plain,
! [X0,X1] :
( ~ occurrence_of(X0,X1)
| sK12(X0) = X1 ),
inference(forward_subsumption_resolution,[],[f220,f180]) ).
fof(f301,plain,
( ~ occurrence_of(sK3,tptp0)
| occurrence_of(sK6(sK2),tptp4)
| ~ arboreal(sK2)
| leaf_occ(sK2,sK3) ),
inference(resolution,[],[f143,f130]) ).
fof(f307,plain,
( occurrence_of(sK6(sK2),tptp4)
| ~ arboreal(sK2)
| leaf_occ(sK2,sK3) ),
inference(forward_subsumption_resolution,[],[f301,f131]) ).
fof(f308,plain,
( occurrence_of(sK6(sK2),tptp4)
| leaf_occ(sK2,sK3) ),
inference(forward_subsumption_resolution,[],[f307,f129]) ).
fof(f309,plain,
occurrence_of(sK6(sK2),tptp4),
inference(forward_subsumption_resolution,[],[f308,f128]) ).
fof(f311,plain,
! [X0] :
( ~ occurrence_of(sK6(sK2),X0)
| tptp4 = X0 ),
inference(resolution,[],[f309,f181]) ).
fof(f316,plain,
( ~ occurrence_of(sK3,tptp0)
| occurrence_of(sK5(sK2),tptp3)
| ~ arboreal(sK2)
| leaf_occ(sK2,sK3) ),
inference(resolution,[],[f145,f130]) ).
fof(f317,plain,
! [X2,X0,X1] :
( ~ occurrence_of(sK8(X0,X1,X2),tptp0)
| occurrence_of(sK5(X2),tptp3)
| ~ arboreal(X2)
| leaf_occ(X2,sK8(X0,X1,X2))
| ~ min_precedes(X1,X2,X0) ),
inference(resolution,[],[f145,f154]) ).
fof(f322,plain,
( occurrence_of(sK5(sK2),tptp3)
| ~ arboreal(sK2)
| leaf_occ(sK2,sK3) ),
inference(forward_subsumption_resolution,[],[f316,f131]) ).
fof(f323,plain,
( occurrence_of(sK5(sK2),tptp3)
| leaf_occ(sK2,sK3) ),
inference(forward_subsumption_resolution,[],[f322,f129]) ).
fof(f324,plain,
occurrence_of(sK5(sK2),tptp3),
inference(forward_subsumption_resolution,[],[f323,f128]) ).
fof(f350,plain,
( ~ atomic(tptp3)
| arboreal(sK5(sK2)) ),
inference(resolution,[],[f324,f172]) ).
fof(f353,plain,
arboreal(sK5(sK2)),
inference(forward_subsumption_resolution,[],[f350,f149]) ).
fof(f359,plain,
( ~ occurrence_of(sK3,tptp0)
| next_subocc(sK2,sK5(sK2),tptp0)
| ~ arboreal(sK2)
| leaf_occ(sK2,sK3) ),
inference(resolution,[],[f144,f130]) ).
fof(f360,plain,
! [X2,X0,X1] :
( ~ occurrence_of(sK8(X0,X1,X2),tptp0)
| next_subocc(X2,sK5(X2),tptp0)
| ~ arboreal(X2)
| leaf_occ(X2,sK8(X0,X1,X2))
| ~ min_precedes(X1,X2,X0) ),
inference(resolution,[],[f144,f154]) ).
fof(f365,plain,
( next_subocc(sK2,sK5(sK2),tptp0)
| ~ arboreal(sK2)
| leaf_occ(sK2,sK3) ),
inference(forward_subsumption_resolution,[],[f359,f131]) ).
fof(f366,plain,
( next_subocc(sK2,sK5(sK2),tptp0)
| leaf_occ(sK2,sK3) ),
inference(forward_subsumption_resolution,[],[f365,f129]) ).
fof(f367,plain,
next_subocc(sK2,sK5(sK2),tptp0),
inference(forward_subsumption_resolution,[],[f366,f128]) ).
fof(f383,plain,
min_precedes(sK2,sK5(sK2),tptp0),
inference(resolution,[],[f367,f176]) ).
fof(f409,plain,
( ~ occurrence_of(sK3,tptp0)
| min_precedes(sK5(sK2),sK6(sK2),tptp0)
| ~ arboreal(sK2)
| leaf_occ(sK2,sK3) ),
inference(resolution,[],[f142,f130]) ).
fof(f415,plain,
( min_precedes(sK5(sK2),sK6(sK2),tptp0)
| ~ arboreal(sK2)
| leaf_occ(sK2,sK3) ),
inference(forward_subsumption_resolution,[],[f409,f131]) ).
fof(f416,plain,
( min_precedes(sK5(sK2),sK6(sK2),tptp0)
| leaf_occ(sK2,sK3) ),
inference(forward_subsumption_resolution,[],[f415,f129]) ).
fof(f417,plain,
min_precedes(sK5(sK2),sK6(sK2),tptp0),
inference(forward_subsumption_resolution,[],[f416,f128]) ).
fof(f425,plain,
( occurrence_of(sK7(sK2),tptp2)
| ~ occurrence_of(sK3,tptp0)
| occurrence_of(sK7(sK2),tptp1)
| ~ arboreal(sK2)
| leaf_occ(sK2,sK3) ),
inference(resolution,[],[f141,f130]) ).
fof(f431,plain,
( occurrence_of(sK7(sK2),tptp2)
| occurrence_of(sK7(sK2),tptp1)
| ~ arboreal(sK2)
| leaf_occ(sK2,sK3) ),
inference(forward_subsumption_resolution,[],[f425,f131]) ).
fof(f432,plain,
( occurrence_of(sK7(sK2),tptp2)
| occurrence_of(sK7(sK2),tptp1)
| leaf_occ(sK2,sK3) ),
inference(forward_subsumption_resolution,[],[f431,f129]) ).
fof(f433,plain,
( occurrence_of(sK7(sK2),tptp2)
| occurrence_of(sK7(sK2),tptp1) ),
inference(forward_subsumption_resolution,[],[f432,f128]) ).
fof(f435,definition,
( spl17_7
<=> occurrence_of(sK7(sK2),tptp1) ),
introduced(definition,[new_symbols(definition,[spl17_7])],[avatar_definition]) ).
fof(f437,plain,
( occurrence_of(sK7(sK2),tptp1)
| ~ spl17_7 ),
inference(avatar_component_clause,[],[f435]) ).
fof(f439,definition,
( spl17_8
<=> occurrence_of(sK7(sK2),tptp2) ),
introduced(definition,[new_symbols(definition,[spl17_8])],[avatar_definition]) ).
fof(f441,plain,
( occurrence_of(sK7(sK2),tptp2)
| ~ spl17_8 ),
inference(avatar_component_clause,[],[f439]) ).
fof(f442,plain,
( spl17_7
| spl17_8 ),
inference(avatar_split_clause,[],[f433,f439,f435]) ).
fof(f444,plain,
( ! [X0] :
( ~ occurrence_of(sK7(sK2),X0)
| tptp1 = X0 )
| ~ spl17_7 ),
inference(resolution,[],[f437,f181]) ).
fof(f464,plain,
! [X0] :
( ~ leaf_occ(sK2,X0)
| ~ occurrence_of(X0,tptp0) ),
inference(resolution,[],[f383,f164]) ).
fof(f510,plain,
! [X0] :
( ~ leaf_occ(sK5(sK2),X0)
| ~ occurrence_of(X0,tptp0) ),
inference(resolution,[],[f417,f164]) ).
fof(f857,plain,
! [X0,X1] :
( occurrence_of(sK5(X0),tptp3)
| ~ arboreal(X0)
| leaf_occ(X0,sK8(tptp0,X1,X0))
| ~ min_precedes(X1,X0,tptp0)
| ~ min_precedes(X1,X0,tptp0) ),
inference(resolution,[],[f317,f156]) ).
fof(f858,plain,
! [X0,X1] :
( leaf_occ(X0,sK8(tptp0,X1,X0))
| ~ arboreal(X0)
| occurrence_of(sK5(X0),tptp3)
| ~ min_precedes(X1,X0,tptp0) ),
inference(duplicate_literal_removal,[],[f857]) ).
fof(f879,plain,
! [X0,X1] :
( next_subocc(X0,sK5(X0),tptp0)
| ~ arboreal(X0)
| leaf_occ(X0,sK8(tptp0,X1,X0))
| ~ min_precedes(X1,X0,tptp0)
| ~ min_precedes(X1,X0,tptp0) ),
inference(resolution,[],[f360,f156]) ).
fof(f880,plain,
! [X0,X1] :
( leaf_occ(X0,sK8(tptp0,X1,X0))
| ~ arboreal(X0)
| next_subocc(X0,sK5(X0),tptp0)
| ~ min_precedes(X1,X0,tptp0) ),
inference(duplicate_literal_removal,[],[f879]) ).
fof(f1130,definition,
( spl17_25
<=> ! [X0] :
( ~ occurrence_of(X0,tptp0)
| ~ subactivity_occurrence(sK2,X0) ) ),
introduced(definition,[new_symbols(definition,[spl17_25])],[avatar_definition]) ).
fof(f1131,plain,
( ! [X0] :
( ~ subactivity_occurrence(sK2,X0)
| ~ occurrence_of(X0,tptp0) )
| ~ spl17_25 ),
inference(avatar_component_clause,[],[f1130]) ).
fof(f1486,plain,
( ~ occurrence_of(sK3,tptp0)
| ~ spl17_25 ),
inference(resolution,[],[f1131,f130]) ).
fof(f1490,plain,
( $false
| ~ spl17_25 ),
inference(forward_subsumption_resolution,[],[f1486,f131]) ).
fof(f1491,plain,
~ spl17_25,
inference(avatar_contradiction_clause,[],[f1490]) ).
fof(f2319,definition,
( spl17_88
<=> ! [X0] : ~ min_precedes(X0,sK5(sK2),tptp0) ),
introduced(definition,[new_symbols(definition,[spl17_88])],[avatar_definition]) ).
fof(f2320,plain,
( ! [X0] : ~ min_precedes(X0,sK5(sK2),tptp0)
| ~ spl17_88 ),
inference(avatar_component_clause,[],[f2319]) ).
fof(f2397,plain,
! [X0] :
( ~ arboreal(sK5(sK2))
| occurrence_of(sK5(sK5(sK2)),tptp3)
| ~ min_precedes(X0,sK5(sK2),tptp0)
| ~ occurrence_of(sK8(tptp0,X0,sK5(sK2)),tptp0) ),
inference(resolution,[],[f858,f510]) ).
fof(f2412,plain,
! [X0] :
( ~ arboreal(sK5(sK2))
| occurrence_of(sK5(sK5(sK2)),tptp3)
| ~ min_precedes(X0,sK5(sK2),tptp0) ),
inference(forward_subsumption_resolution,[],[f2397,f156]) ).
fof(f2459,definition,
( spl17_96
<=> occurrence_of(sK5(sK5(sK2)),tptp3) ),
introduced(definition,[new_symbols(definition,[spl17_96])],[avatar_definition]) ).
fof(f2461,plain,
( occurrence_of(sK5(sK5(sK2)),tptp3)
| ~ spl17_96 ),
inference(avatar_component_clause,[],[f2459]) ).
fof(f2470,plain,
( $false
| ~ spl17_88 ),
inference(resolution,[],[f2320,f383]) ).
fof(f2481,plain,
~ spl17_88,
inference(avatar_contradiction_clause,[],[f2470]) ).
fof(f2484,plain,
! [X0] :
( occurrence_of(sK5(sK5(sK2)),tptp3)
| ~ min_precedes(X0,sK5(sK2),tptp0) ),
inference(forward_subsumption_resolution,[],[f2412,f353]) ).
fof(f2485,plain,
( spl17_88
| spl17_96 ),
inference(avatar_split_clause,[],[f2484,f2459,f2319]) ).
fof(f2576,plain,
! [X0] :
( ~ arboreal(sK5(sK2))
| next_subocc(sK5(sK2),sK5(sK5(sK2)),tptp0)
| ~ min_precedes(X0,sK5(sK2),tptp0)
| ~ occurrence_of(sK8(tptp0,X0,sK5(sK2)),tptp0) ),
inference(resolution,[],[f880,f510]) ).
fof(f2591,plain,
! [X0] :
( ~ arboreal(sK5(sK2))
| next_subocc(sK5(sK2),sK5(sK5(sK2)),tptp0)
| ~ min_precedes(X0,sK5(sK2),tptp0) ),
inference(forward_subsumption_resolution,[],[f2576,f156]) ).
fof(f2593,plain,
! [X0] :
( next_subocc(sK5(sK2),sK5(sK5(sK2)),tptp0)
| ~ min_precedes(X0,sK5(sK2),tptp0) ),
inference(forward_subsumption_resolution,[],[f2591,f353]) ).
fof(f2600,definition,
( spl17_98
<=> next_subocc(sK5(sK2),sK5(sK5(sK2)),tptp0) ),
introduced(definition,[new_symbols(definition,[spl17_98])],[avatar_definition]) ).
fof(f2602,plain,
( next_subocc(sK5(sK2),sK5(sK5(sK2)),tptp0)
| ~ spl17_98 ),
inference(avatar_component_clause,[],[f2600]) ).
fof(f2603,plain,
( spl17_88
| spl17_98 ),
inference(avatar_split_clause,[],[f2593,f2600,f2319]) ).
fof(f2629,plain,
( tptp3 = sK12(sK5(sK5(sK2)))
| ~ spl17_96 ),
inference(resolution,[],[f2461,f222]) ).
fof(f2738,plain,
( min_precedes(sK5(sK2),sK5(sK5(sK2)),tptp0)
| ~ spl17_98 ),
inference(resolution,[],[f2602,f176]) ).
fof(f3530,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) )
| ~ spl17_98 ),
inference(resolution,[],[f2738,f139]) ).
fof(f3558,plain,
( ! [X0] :
( sK7(sK2) = sK5(sK5(sK2))
| sK6(sK2) = sK5(sK5(sK2))
| ~ occurrence_of(X0,tptp0)
| ~ subactivity_occurrence(sK2,X0)
| ~ arboreal(sK2) )
| ~ spl17_98 ),
inference(forward_subsumption_resolution,[],[f3530,f464]) ).
fof(f3587,plain,
( ! [X0] :
( sK7(sK2) = sK5(sK5(sK2))
| sK6(sK2) = sK5(sK5(sK2))
| ~ occurrence_of(X0,tptp0)
| ~ subactivity_occurrence(sK2,X0) )
| ~ spl17_98 ),
inference(forward_subsumption_resolution,[],[f3558,f129]) ).
fof(f3589,definition,
( spl17_129
<=> sK6(sK2) = sK5(sK5(sK2)) ),
introduced(definition,[new_symbols(definition,[spl17_129])],[avatar_definition]) ).
fof(f3591,plain,
( sK6(sK2) = sK5(sK5(sK2))
| ~ spl17_129 ),
inference(avatar_component_clause,[],[f3589]) ).
fof(f3593,definition,
( spl17_130
<=> sK7(sK2) = sK5(sK5(sK2)) ),
introduced(definition,[new_symbols(definition,[spl17_130])],[avatar_definition]) ).
fof(f3595,plain,
( sK7(sK2) = sK5(sK5(sK2))
| ~ spl17_130 ),
inference(avatar_component_clause,[],[f3593]) ).
fof(f3596,plain,
( spl17_25
| spl17_129
| spl17_130
| ~ spl17_98 ),
inference(avatar_split_clause,[],[f3587,f2600,f3593,f3589,f1130]) ).
fof(f3705,plain,
( occurrence_of(sK6(sK2),tptp3)
| ~ spl17_96
| ~ spl17_129 ),
inference(superposition,[],[f2461,f3591]) ).
fof(f3757,plain,
( occurrence_of(sK7(sK2),tptp3)
| ~ spl17_96
| ~ spl17_130 ),
inference(superposition,[],[f2461,f3595]) ).
fof(f3759,plain,
( tptp3 = sK12(sK7(sK2))
| ~ spl17_96
| ~ spl17_130 ),
inference(superposition,[],[f2629,f3595]) ).
fof(f3800,plain,
( tptp3 = tptp4
| ~ spl17_96
| ~ spl17_129 ),
inference(resolution,[],[f3705,f311]) ).
fof(f3806,plain,
( $false
| ~ spl17_96
| ~ spl17_129 ),
inference(forward_subsumption_resolution,[],[f3800,f148]) ).
fof(f3807,plain,
( ~ spl17_96
| ~ spl17_129 ),
inference(avatar_contradiction_clause,[],[f3806]) ).
fof(f3824,plain,
( tptp3 = tptp1
| ~ spl17_7
| ~ spl17_96
| ~ spl17_130 ),
inference(resolution,[],[f3757,f444]) ).
fof(f3830,plain,
( $false
| ~ spl17_7
| ~ spl17_96
| ~ spl17_130 ),
inference(forward_subsumption_resolution,[],[f3824,f147]) ).
fof(f3831,plain,
( ~ spl17_7
| ~ spl17_96
| ~ spl17_130 ),
inference(avatar_contradiction_clause,[],[f3830]) ).
fof(f3832,plain,
( tptp2 = sK12(sK7(sK2))
| ~ spl17_8 ),
inference(resolution,[],[f441,f222]) ).
fof(f3837,plain,
( tptp3 = tptp2
| ~ spl17_8
| ~ spl17_96
| ~ spl17_130 ),
inference(forward_demodulation,[],[f3832,f3759]) ).
fof(f3838,plain,
( $false
| ~ spl17_8
| ~ spl17_96
| ~ spl17_130 ),
inference(forward_subsumption_resolution,[],[f3837,f146]) ).
fof(f3839,plain,
( ~ spl17_8
| ~ spl17_96
| ~ spl17_130 ),
inference(avatar_contradiction_clause,[],[f3838]) ).
cnf(s6,plain,
( spl17_7
| spl17_8 ),
inference(sat_conversion,[],[f442]) ).
cnf(s38,plain,
~ spl17_25,
inference(sat_conversion,[],[f1491]) ).
cnf(s68,plain,
~ spl17_88,
inference(sat_conversion,[],[f2481]) ).
cnf(s69,plain,
( spl17_88
| spl17_96 ),
inference(sat_conversion,[],[f2485]) ).
cnf(s73,plain,
( spl17_88
| spl17_98 ),
inference(sat_conversion,[],[f2603]) ).
cnf(s100,plain,
( spl17_25
| ~ spl17_98
| spl17_129
| spl17_130 ),
inference(sat_conversion,[],[f3596]) ).
cnf(s109,plain,
( ~ spl17_96
| ~ spl17_129 ),
inference(sat_conversion,[],[f3807]) ).
cnf(s110,plain,
( ~ spl17_7
| ~ spl17_96
| ~ spl17_130 ),
inference(sat_conversion,[],[f3831]) ).
cnf(s111,plain,
( ~ spl17_8
| ~ spl17_96
| ~ spl17_130 ),
inference(sat_conversion,[],[f3839]) ).
cnf(s120,plain,
spl17_98,
inference(rat,[],[s73,s68]) ).
cnf(s121,plain,
spl17_96,
inference(rat,[],[s69,s68]) ).
cnf(s122,plain,
~ spl17_129,
inference(rat,[],[s109,s121]) ).
cnf(s137,plain,
spl17_130,
inference(rat,[],[s100,s122,s120,s38]) ).
cnf(s138,plain,
~ spl17_8,
inference(rat,[],[s111,s121,s137]) ).
cnf(s139,plain,
~ spl17_7,
inference(rat,[],[s110,s121,s137]) ).
cnf(s148,plain,
$false,
inference(rat,[],[s6,s138,s139]) ).
fof(f3840,plain,
$false,
inference(avatar_sat_refutation,[],[s148]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : PRO018+4 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.36 % Computer : n006.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Sun Sep 27 22:25:11 UTC 2026
% 0.11/0.36 % CPUTime :
% 0.11/0.36 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.40 Running first-order theorem proving
% 0.11/0.40 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.18/1.55 % (3384577)Detected formulas, will run a generic FOF schedule.
% 4.18/1.55 % (3384583)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=642826507:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 4.18/1.55 % (3384587)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3666104464:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 4.18/1.55 % (3384586)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2754881574:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 4.18/1.55 % (3384588)dis-21_1_sil=8000:lcm=predicate:random_seed=4053714164: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.18/1.55 % (3384585)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=910429082:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 4.18/1.55 % (3384584)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=3393845088:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 4.18/1.55 % (3384582)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=401813852:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 4.18/1.55 % (3384586)Instruction limit reached!
% 4.18/1.55 % (3384586)------------------------------
% 4.18/1.55 % (3384586)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.18/1.55 % (3384586)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.18/1.55 % (3384586)CaDiCaL version: 2.1.3
% 4.18/1.55 % (3384586)Termination reason: Instruction limit
% 4.18/1.55 % (3384586)Termination phase: Saturation
% 4.18/1.55 % (3384586)Time elapsed: 0.062 s
% 4.18/1.55 % (3384586)Peak memory usage: 88 MB
% 4.18/1.55 % (3384586)Instructions burned: 120 (million)
% 4.18/1.55 % (3384585)Instruction limit reached!
% 4.18/1.55 % (3384585)------------------------------
% 4.18/1.55 % (3384585)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.18/1.55 % (3384585)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.18/1.55 % (3384585)CaDiCaL version: 2.1.3
% 4.18/1.55 % (3384585)Termination reason: Instruction limit
% 4.18/1.55 % (3384585)Termination phase: Saturation
% 4.18/1.55 % (3384585)Time elapsed: 0.063 s
% 4.18/1.55 % (3384585)Peak memory usage: 89 MB
% 4.18/1.55 % (3384585)Instructions burned: 110 (million)
% 4.18/1.55 % (3384588)Instruction limit reached!
% 4.18/1.55 % (3384588)------------------------------
% 4.18/1.55 % (3384588)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.18/1.55 % (3384588)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.18/1.55 % (3384588)CaDiCaL version: 2.1.3
% 4.18/1.55 % (3384588)Termination reason: Instruction limit
% 4.18/1.55 % (3384588)Termination phase: Saturation
% 4.18/1.55 % (3384588)Time elapsed: 0.071 s
% 4.18/1.55 % (3384588)Peak memory usage: 89 MB
% 4.18/1.55 % (3384588)Instructions burned: 131 (million)
% 4.18/1.55 % (3384587)Instruction limit reached!
% 4.18/1.55 % (3384587)------------------------------
% 4.18/1.55 % (3384587)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.18/1.55 % (3384587)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.18/1.55 % (3384587)CaDiCaL version: 2.1.3
% 4.18/1.55 % (3384587)Termination reason: Instruction limit
% 4.18/1.55 % (3384587)Termination phase: Saturation
% 4.18/1.55 % (3384587)Time elapsed: 0.106 s
% 4.18/1.55 % (3384587)Peak memory usage: 89 MB
% 4.18/1.55 % (3384587)Instructions burned: 139 (million)
% 4.18/1.55 % (3384596)lrs+10_1_sil=8000:sp=occurrence:random_seed=852236286:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 4.18/1.55 % (3384597)lrs+10_1_sil=32000:urr=on:br=off:random_seed=286414613:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 4.18/1.55 % (3384598)lrs+1011_1_sil=32000:sp=occurrence:random_seed=1328333609:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 4.18/1.55 % (3384599)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=3833287861:s2a=on:i=248:s2at=1.23:gtg=position_2997 on theBenchmark for (2997ds/248Mi)
% 4.18/1.55 % (3384597)Instruction limit reached!
% 4.18/1.55 % (3384597)------------------------------
% 4.18/1.55 % (3384597)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.18/1.55 % (3384597)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.18/1.55 % (3384597)CaDiCaL version: 2.1.3
% 4.18/1.55 % (3384597)Termination reason: Instruction limit
% 4.18/1.55 % (3384597)Termination phase: Saturation
% 4.18/1.55 % (3384597)Time elapsed: 0.080 s
% 4.18/1.55 % (3384597)Peak memory usage: 89 MB
% 4.18/1.55 % (3384597)Instructions burned: 157 (million)
% 4.18/1.55 % (3384596)First to succeed.
% 4.18/1.55 % (3384596)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3384577"
% 4.18/1.55 % (3384583)Also succeeded, but the first one will report.
% 4.18/1.55 % (3384599)Instruction limit reached!
% 4.18/1.55 % (3384599)------------------------------
% 4.18/1.55 % (3384599)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.18/1.55 % (3384599)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.18/1.55 % (3384599)CaDiCaL version: 2.1.3
% 4.18/1.55 % (3384599)Termination reason: Instruction limit
% 4.18/1.55 % (3384599)Termination phase: Saturation
% 4.18/1.55 % (3384599)Time elapsed: 0.135 s
% 4.18/1.55 % (3384599)Peak memory usage: 89 MB
% 4.18/1.55 % (3384599)Instructions burned: 248 (million)
% 4.18/1.55 % (3384604)lrs+1002_1_to=lpo:sil=8000:sos=on:random_seed=581158353:st=4:cts=off:i=294:sd=2:ins=7:amm=off:ss=axioms_2995 on theBenchmark for (2995ds/294Mi)
% 4.18/1.55 % (3384598)Instruction limit reached!
% 4.18/1.55 % (3384598)------------------------------
% 4.18/1.55 % (3384598)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.18/1.55 % (3384598)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.18/1.55 % (3384598)CaDiCaL version: 2.1.3
% 4.18/1.55 % (3384598)Termination reason: Instruction limit
% 4.18/1.55 % (3384598)Termination phase: Saturation
% 4.18/1.55 % (3384598)Time elapsed: 0.224 s
% 4.18/1.55 % (3384598)Peak memory usage: 91 MB
% 4.18/1.55 % (3384598)Instructions burned: 325 (million)
% 4.18/1.55 % (3384605)lrs+10_1_ncem=casc2026/models/loop7.pt:sil=32000:tgt=ground:npcc=on:random_seed=2680321276:i=2350_2994 on theBenchmark for (2994ds/2350Mi)
% 4.18/1.55 % (3384596)Refutation found. Thanks to Tanya!
% 4.18/1.55 % SZS status Theorem for theBenchmark
% 4.18/1.55 % SZS output start Proof for theBenchmark
% See solution above
% 5.61/1.75 % (3384596)------------------------------
% 5.61/1.75 % (3384596)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.61/1.75 % (3384596)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.61/1.75 % (3384596)CaDiCaL version: 2.1.3
% 5.61/1.75 % (3384596)Termination reason: Refutation
% 5.61/1.75 % (3384596)Time elapsed: 0.129 s
% 5.61/1.75 % (3384596)Peak memory usage: 92 MB
% 5.61/1.75 % (3384596)Instructions burned: 206 (million)
% 5.61/1.75 % (3384596)------------------------------
% 5.61/1.75 % (3384596)------------------------------
% 5.61/1.75 % (3384577)Success in time 0.714 s
% 5.61/1.75 % Vampire exiting
%------------------------------------------------------------------------------