%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : PRO017+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 : n002.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:28 PM UTC 2026
% Result : Theorem 5.00s 1.68s
% Output : Refutation 6.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 20
% Syntax : Number of formulae : 161 ( 34 unt; 8 def)
% Number of atoms : 533 ( 36 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 623 ( 251 ~; 270 |; 81 &)
% ( 12 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 18 ( 16 usr; 9 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 7 con; 0-3 aty)
% Number of variables : 187 ( 0 sgn 163 !; 24 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1,X2,X3] :
( ( min_precedes(X0,X1,X3)
& min_precedes(X1,X2,X3) )
=> min_precedes(X0,X2,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos) ).
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(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(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,tptp2)
| occurrence_of(X4,tptp1) )
& 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 != tptp2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_42) ).
fof(f44,axiom,
tptp3 != tptp1,
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,tptp2)
| occurrence_of(X3,tptp1) )
& min_precedes(X2,X3,tptp0)
& leaf(X3,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,tptp2)
| occurrence_of(X3,tptp1) )
& min_precedes(X2,X3,tptp0)
& leaf(X3,tptp0) ) ),
inference(negated_conjecture,[status(cth)],[f46]) ).
fof(f50,plain,
! [X0,X1,X2,X3] :
( min_precedes(X0,X2,X3)
| ~ min_precedes(X0,X1,X3)
| ~ min_precedes(X1,X2,X3) ),
inference(ennf_transformation,[],[f1]) ).
fof(f51,plain,
! [X0,X1,X2,X3] :
( min_precedes(X0,X2,X3)
| ~ min_precedes(X0,X1,X3)
| ~ min_precedes(X1,X2,X3) ),
inference(flattening,[],[f50]) ).
fof(f58,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(f66,plain,
! [X0,X1] :
( ( arboreal(X0)
<=> atomic(X1) )
| ~ occurrence_of(X0,X1) ),
inference(ennf_transformation,[],[f14]) ).
fof(f75,plain,
! [X0,X1,X2] :
( ! [X3] : ~ min_precedes(X1,X3,X2)
| ~ occurrence_of(X0,X2)
| ~ leaf_occ(X1,X0) ),
inference(ennf_transformation,[],[f22]) ).
fof(f76,plain,
! [X0,X1,X2] :
( ! [X3] : ~ min_precedes(X1,X3,X2)
| ~ occurrence_of(X0,X2)
| ~ leaf_occ(X1,X0) ),
inference(flattening,[],[f75]) ).
fof(f77,plain,
! [X0,X1,X2] :
( X1 = X2
| ~ occurrence_of(X0,X1)
| ~ occurrence_of(X0,X2) ),
inference(ennf_transformation,[],[f23]) ).
fof(f78,plain,
! [X0,X1,X2] :
( X1 = X2
| ~ occurrence_of(X0,X1)
| ~ occurrence_of(X0,X2) ),
inference(flattening,[],[f77]) ).
fof(f81,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(f92,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,tptp2)
| occurrence_of(X4,tptp1) )
& 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(f93,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,tptp2)
| occurrence_of(X4,tptp1) )
& 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,[],[f92]) ).
fof(f94,plain,
? [X0,X1] :
( ! [X2,X3] :
( ~ occurrence_of(X2,tptp3)
| ~ next_subocc(X0,X2,tptp0)
| ( ~ occurrence_of(X3,tptp2)
& ~ occurrence_of(X3,tptp1) )
| ~ min_precedes(X2,X3,tptp0)
| ~ leaf(X3,tptp0) )
& occurrence_of(X1,tptp0)
& subactivity_occurrence(X0,X1)
& arboreal(X0)
& ~ leaf_occ(X0,X1) ),
inference(ennf_transformation,[],[f47]) ).
fof(f95,plain,
? [X0,X1] :
( ! [X2,X3] :
( ~ occurrence_of(X2,tptp3)
| ~ next_subocc(X0,X2,tptp0)
| ( ~ occurrence_of(X3,tptp2)
& ~ occurrence_of(X3,tptp1) )
| ~ min_precedes(X2,X3,tptp0)
| ~ leaf(X3,tptp0) )
& occurrence_of(X1,tptp0)
& subactivity_occurrence(X0,X1)
& arboreal(X0)
& ~ leaf_occ(X0,X1) ),
inference(flattening,[],[f94]) ).
fof(f96,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,[],[f58]) ).
fof(f97,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,[],[f96]) ).
fof(f98,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,[],[f97]) ).
fof(f99,plain,
! [X0,X1,X2] :
( ( next_subocc(X0,X1,X2)
| ~ min_precedes(X0,X1,X2)
| ( min_precedes(X0,sK0(X0,X1,X2),X2)
& min_precedes(sK0(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,[sK0]),skolemize(X3,sK0(X0,X1,X2))],[f98]) ).
fof(f103,plain,
! [X0,X1] :
( ( ( arboreal(X0)
| ~ atomic(X1) )
& ( atomic(X1)
| ~ arboreal(X0) ) )
| ~ occurrence_of(X0,X1) ),
inference(nnf_transformation,[],[f66]) ).
fof(f113,plain,
! [X0,X1,X2] :
( ( occurrence_of(sK7(X0,X1,X2),X0)
& subactivity_occurrence(X1,sK7(X0,X1,X2))
& subactivity_occurrence(X2,sK7(X0,X1,X2)) )
| ~ min_precedes(X1,X2,X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK7]),skolemize(X3,sK7(X0,X1,X2))],[f81]) ).
fof(f118,plain,
! [X0,X1] :
( ( occurrence_of(sK13(X0),tptp3)
& next_subocc(X0,sK13(X0),tptp0)
& occurrence_of(sK14(X0),tptp4)
& min_precedes(sK13(X0),sK14(X0),tptp0)
& ( occurrence_of(sK15(X0),tptp2)
| occurrence_of(sK15(X0),tptp1) )
& min_precedes(sK14(X0),sK15(X0),tptp0)
& ! [X5] :
( sK14(X0) = X5
| sK15(X0) = X5
| ~ min_precedes(sK13(X0),X5,tptp0) ) )
| ~ occurrence_of(X1,tptp0)
| ~ subactivity_occurrence(X0,X1)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK13,sK14,sK15]),skolemize(X2,sK13(X0)),skolemize(X3,sK14(X0)),skolemize(X4,sK15(X0))],[f93]) ).
fof(f119,plain,
( ! [X2,X3] :
( ~ occurrence_of(X2,tptp3)
| ~ next_subocc(sK16,X2,tptp0)
| ( ~ occurrence_of(X3,tptp2)
& ~ occurrence_of(X3,tptp1) )
| ~ min_precedes(X2,X3,tptp0)
| ~ leaf(X3,tptp0) )
& occurrence_of(sK17,tptp0)
& subactivity_occurrence(sK16,sK17)
& arboreal(sK16)
& ~ leaf_occ(sK16,sK17) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK16,sK17]),skolemize(X0,sK16),skolemize(X1,sK17)],[f95]) ).
fof(f120,plain,
! [X2,X3,X0,X1] :
( ~ min_precedes(X1,X2,X3)
| ~ min_precedes(X0,X1,X3)
| min_precedes(X0,X2,X3) ),
inference(cnf_transformation,[],[f51]) ).
fof(f125,plain,
! [X2,X0,X1] :
( ~ next_subocc(X0,X1,X2)
| min_precedes(X0,X1,X2) ),
inference(cnf_transformation,[],[f99]) ).
fof(f142,plain,
! [X0,X1] :
( ~ occurrence_of(X0,X1)
| ~ atomic(X1)
| arboreal(X0) ),
inference(cnf_transformation,[],[f103]) ).
fof(f158,plain,
! [X2,X3,X0,X1] :
( ~ min_precedes(X1,X3,X2)
| ~ occurrence_of(X0,X2)
| ~ leaf_occ(X1,X0) ),
inference(cnf_transformation,[],[f76]) ).
fof(f159,plain,
! [X2,X0,X1] :
( ~ occurrence_of(X0,X2)
| ~ occurrence_of(X0,X1)
| X1 = X2 ),
inference(cnf_transformation,[],[f78]) ).
fof(f163,plain,
! [X2,X0,X1] :
( subactivity_occurrence(X1,sK7(X0,X1,X2))
| ~ min_precedes(X1,X2,X0) ),
inference(cnf_transformation,[],[f113]) ).
fof(f164,plain,
! [X2,X0,X1] :
( occurrence_of(sK7(X0,X1,X2),X0)
| ~ min_precedes(X1,X2,X0) ),
inference(cnf_transformation,[],[f113]) ).
fof(f179,plain,
! [X0,X1,X5] :
( ~ min_precedes(sK13(X0),X5,tptp0)
| sK15(X0) = X5
| sK14(X0) = X5
| ~ occurrence_of(X1,tptp0)
| ~ subactivity_occurrence(X0,X1)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f118]) ).
fof(f180,plain,
! [X0,X1] :
( ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0)
| min_precedes(sK14(X0),sK15(X0),tptp0)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f118]) ).
fof(f181,plain,
! [X0,X1] :
( ~ subactivity_occurrence(X0,X1)
| occurrence_of(sK15(X0),tptp1)
| ~ occurrence_of(X1,tptp0)
| occurrence_of(sK15(X0),tptp2)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f118]) ).
fof(f182,plain,
! [X0,X1] :
( ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0)
| min_precedes(sK13(X0),sK14(X0),tptp0)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f118]) ).
fof(f183,plain,
! [X0,X1] :
( ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0)
| occurrence_of(sK14(X0),tptp4)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f118]) ).
fof(f184,plain,
! [X0,X1] :
( ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0)
| next_subocc(X0,sK13(X0),tptp0)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f118]) ).
fof(f185,plain,
! [X0,X1] :
( ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0)
| occurrence_of(sK13(X0),tptp3)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f118]) ).
fof(f191,plain,
atomic(tptp3),
inference(cnf_transformation,[],[f39]) ).
fof(f192,plain,
tptp3 != tptp4,
inference(cnf_transformation,[],[f40]) ).
fof(f195,plain,
tptp3 != tptp2,
inference(cnf_transformation,[],[f43]) ).
fof(f196,plain,
tptp3 != tptp1,
inference(cnf_transformation,[],[f44]) ).
fof(f198,plain,
~ leaf_occ(sK16,sK17),
inference(cnf_transformation,[],[f119]) ).
fof(f199,plain,
arboreal(sK16),
inference(cnf_transformation,[],[f119]) ).
fof(f200,plain,
subactivity_occurrence(sK16,sK17),
inference(cnf_transformation,[],[f119]) ).
fof(f201,plain,
occurrence_of(sK17,tptp0),
inference(cnf_transformation,[],[f119]) ).
fof(f204,plain,
( ~ occurrence_of(sK17,tptp0)
| next_subocc(sK16,sK13(sK16),tptp0)
| ~ arboreal(sK16)
| leaf_occ(sK16,sK17) ),
inference(resolution,[],[f184,f200]) ).
fof(f205,plain,
( next_subocc(sK16,sK13(sK16),tptp0)
| ~ arboreal(sK16)
| leaf_occ(sK16,sK17) ),
inference(forward_subsumption_resolution,[],[f204,f201]) ).
fof(f206,plain,
( next_subocc(sK16,sK13(sK16),tptp0)
| leaf_occ(sK16,sK17) ),
inference(forward_subsumption_resolution,[],[f205,f199]) ).
fof(f207,plain,
next_subocc(sK16,sK13(sK16),tptp0),
inference(forward_subsumption_resolution,[],[f206,f198]) ).
fof(f208,plain,
( ~ occurrence_of(sK17,tptp0)
| occurrence_of(sK13(sK16),tptp3)
| ~ arboreal(sK16)
| leaf_occ(sK16,sK17) ),
inference(resolution,[],[f185,f200]) ).
fof(f209,plain,
( occurrence_of(sK13(sK16),tptp3)
| ~ arboreal(sK16)
| leaf_occ(sK16,sK17) ),
inference(forward_subsumption_resolution,[],[f208,f201]) ).
fof(f210,plain,
( occurrence_of(sK13(sK16),tptp3)
| leaf_occ(sK16,sK17) ),
inference(forward_subsumption_resolution,[],[f209,f199]) ).
fof(f211,plain,
occurrence_of(sK13(sK16),tptp3),
inference(forward_subsumption_resolution,[],[f210,f198]) ).
fof(f212,plain,
( ~ occurrence_of(sK17,tptp0)
| min_precedes(sK13(sK16),sK14(sK16),tptp0)
| ~ arboreal(sK16)
| leaf_occ(sK16,sK17) ),
inference(resolution,[],[f182,f200]) ).
fof(f213,plain,
( min_precedes(sK13(sK16),sK14(sK16),tptp0)
| ~ arboreal(sK16)
| leaf_occ(sK16,sK17) ),
inference(forward_subsumption_resolution,[],[f212,f201]) ).
fof(f214,plain,
( min_precedes(sK13(sK16),sK14(sK16),tptp0)
| leaf_occ(sK16,sK17) ),
inference(forward_subsumption_resolution,[],[f213,f199]) ).
fof(f215,plain,
min_precedes(sK13(sK16),sK14(sK16),tptp0),
inference(forward_subsumption_resolution,[],[f214,f198]) ).
fof(f216,plain,
( ~ occurrence_of(sK17,tptp0)
| min_precedes(sK14(sK16),sK15(sK16),tptp0)
| ~ arboreal(sK16)
| leaf_occ(sK16,sK17) ),
inference(resolution,[],[f180,f200]) ).
fof(f217,plain,
( min_precedes(sK14(sK16),sK15(sK16),tptp0)
| ~ arboreal(sK16)
| leaf_occ(sK16,sK17) ),
inference(forward_subsumption_resolution,[],[f216,f201]) ).
fof(f218,plain,
( min_precedes(sK14(sK16),sK15(sK16),tptp0)
| leaf_occ(sK16,sK17) ),
inference(forward_subsumption_resolution,[],[f217,f199]) ).
fof(f219,plain,
min_precedes(sK14(sK16),sK15(sK16),tptp0),
inference(forward_subsumption_resolution,[],[f218,f198]) ).
fof(f220,plain,
( ~ occurrence_of(sK17,tptp0)
| occurrence_of(sK14(sK16),tptp4)
| ~ arboreal(sK16)
| leaf_occ(sK16,sK17) ),
inference(resolution,[],[f183,f200]) ).
fof(f221,plain,
( occurrence_of(sK14(sK16),tptp4)
| ~ arboreal(sK16)
| leaf_occ(sK16,sK17) ),
inference(forward_subsumption_resolution,[],[f220,f201]) ).
fof(f222,plain,
( occurrence_of(sK14(sK16),tptp4)
| leaf_occ(sK16,sK17) ),
inference(forward_subsumption_resolution,[],[f221,f199]) ).
fof(f223,plain,
occurrence_of(sK14(sK16),tptp4),
inference(forward_subsumption_resolution,[],[f222,f198]) ).
fof(f224,plain,
min_precedes(sK16,sK13(sK16),tptp0),
inference(resolution,[],[f125,f207]) ).
fof(f243,plain,
( occurrence_of(sK15(sK16),tptp1)
| ~ occurrence_of(sK17,tptp0)
| occurrence_of(sK15(sK16),tptp2)
| ~ arboreal(sK16)
| leaf_occ(sK16,sK17) ),
inference(resolution,[],[f181,f200]) ).
fof(f244,plain,
( occurrence_of(sK15(sK16),tptp1)
| occurrence_of(sK15(sK16),tptp2)
| ~ arboreal(sK16)
| leaf_occ(sK16,sK17) ),
inference(forward_subsumption_resolution,[],[f243,f201]) ).
fof(f245,plain,
( occurrence_of(sK15(sK16),tptp1)
| occurrence_of(sK15(sK16),tptp2)
| leaf_occ(sK16,sK17) ),
inference(forward_subsumption_resolution,[],[f244,f199]) ).
fof(f246,plain,
( occurrence_of(sK15(sK16),tptp1)
| occurrence_of(sK15(sK16),tptp2) ),
inference(forward_subsumption_resolution,[],[f245,f198]) ).
fof(f248,definition,
( spl18_3
<=> occurrence_of(sK15(sK16),tptp2) ),
introduced(definition,[new_symbols(definition,[spl18_3])],[avatar_definition]) ).
fof(f250,plain,
( occurrence_of(sK15(sK16),tptp2)
| ~ spl18_3 ),
inference(avatar_component_clause,[],[f248]) ).
fof(f252,definition,
( spl18_4
<=> occurrence_of(sK15(sK16),tptp1) ),
introduced(definition,[new_symbols(definition,[spl18_4])],[avatar_definition]) ).
fof(f254,plain,
( occurrence_of(sK15(sK16),tptp1)
| ~ spl18_4 ),
inference(avatar_component_clause,[],[f252]) ).
fof(f255,plain,
( spl18_3
| spl18_4 ),
inference(avatar_split_clause,[],[f246,f252,f248]) ).
fof(f256,plain,
! [X0] :
( ~ min_precedes(X0,sK13(sK16),tptp0)
| min_precedes(X0,sK14(sK16),tptp0) ),
inference(resolution,[],[f120,f215]) ).
fof(f257,plain,
! [X0] :
( ~ min_precedes(X0,sK14(sK16),tptp0)
| min_precedes(X0,sK15(sK16),tptp0) ),
inference(resolution,[],[f120,f219]) ).
fof(f264,plain,
min_precedes(sK16,sK14(sK16),tptp0),
inference(resolution,[],[f256,f224]) ).
fof(f266,plain,
min_precedes(sK13(sK16),sK15(sK16),tptp0),
inference(resolution,[],[f257,f215]) ).
fof(f267,plain,
min_precedes(sK16,sK15(sK16),tptp0),
inference(resolution,[],[f257,f264]) ).
fof(f295,plain,
! [X0] :
( ~ leaf_occ(sK13(sK16),X0)
| ~ occurrence_of(X0,tptp0) ),
inference(resolution,[],[f158,f266]) ).
fof(f299,plain,
! [X0] :
( ~ leaf_occ(sK16,X0)
| ~ occurrence_of(X0,tptp0) ),
inference(resolution,[],[f158,f267]) ).
fof(f349,plain,
( ~ atomic(tptp3)
| arboreal(sK13(sK16)) ),
inference(resolution,[],[f142,f211]) ).
fof(f355,plain,
arboreal(sK13(sK16)),
inference(forward_subsumption_resolution,[],[f349,f191]) ).
fof(f369,plain,
! [X2,X0,X1] :
( ~ occurrence_of(sK7(X2,X0,X1),tptp0)
| ~ min_precedes(X0,X1,X2)
| next_subocc(X0,sK13(X0),tptp0)
| ~ arboreal(X0)
| leaf_occ(X0,sK7(X2,X0,X1)) ),
inference(resolution,[],[f163,f184]) ).
fof(f370,plain,
! [X2,X0,X1] :
( ~ occurrence_of(sK7(X2,X0,X1),tptp0)
| ~ min_precedes(X0,X1,X2)
| occurrence_of(sK13(X0),tptp3)
| ~ arboreal(X0)
| leaf_occ(X0,sK7(X2,X0,X1)) ),
inference(resolution,[],[f163,f185]) ).
fof(f407,plain,
! [X0,X1] :
( ~ min_precedes(X0,X1,tptp0)
| ~ min_precedes(X0,X1,tptp0)
| next_subocc(X0,sK13(X0),tptp0)
| ~ arboreal(X0)
| leaf_occ(X0,sK7(tptp0,X0,X1)) ),
inference(resolution,[],[f164,f369]) ).
fof(f411,plain,
! [X0,X1] :
( leaf_occ(X0,sK7(tptp0,X0,X1))
| next_subocc(X0,sK13(X0),tptp0)
| ~ arboreal(X0)
| ~ min_precedes(X0,X1,tptp0) ),
inference(duplicate_literal_removal,[],[f407]) ).
fof(f498,plain,
! [X0,X1] :
( ~ min_precedes(X0,X1,tptp0)
| occurrence_of(sK13(X0),tptp3)
| ~ arboreal(X0)
| leaf_occ(X0,sK7(tptp0,X0,X1))
| ~ min_precedes(X0,X1,tptp0) ),
inference(resolution,[],[f370,f164]) ).
fof(f499,plain,
! [X0,X1] :
( leaf_occ(X0,sK7(tptp0,X0,X1))
| occurrence_of(sK13(X0),tptp3)
| ~ arboreal(X0)
| ~ min_precedes(X0,X1,tptp0) ),
inference(duplicate_literal_removal,[],[f498]) ).
fof(f549,plain,
! [X0] :
( ~ occurrence_of(sK7(tptp0,sK13(sK16),X0),tptp0)
| occurrence_of(sK13(sK13(sK16)),tptp3)
| ~ arboreal(sK13(sK16))
| ~ min_precedes(sK13(sK16),X0,tptp0) ),
inference(resolution,[],[f295,f499]) ).
fof(f550,plain,
! [X0] :
( ~ occurrence_of(sK7(tptp0,sK13(sK16),X0),tptp0)
| next_subocc(sK13(sK16),sK13(sK13(sK16)),tptp0)
| ~ arboreal(sK13(sK16))
| ~ min_precedes(sK13(sK16),X0,tptp0) ),
inference(resolution,[],[f295,f411]) ).
fof(f555,plain,
! [X0] :
( next_subocc(sK13(sK16),sK13(sK13(sK16)),tptp0)
| ~ arboreal(sK13(sK16))
| ~ min_precedes(sK13(sK16),X0,tptp0) ),
inference(forward_subsumption_resolution,[],[f550,f164]) ).
fof(f556,plain,
! [X0] :
( occurrence_of(sK13(sK13(sK16)),tptp3)
| ~ arboreal(sK13(sK16))
| ~ min_precedes(sK13(sK16),X0,tptp0) ),
inference(forward_subsumption_resolution,[],[f549,f164]) ).
fof(f559,plain,
! [X0] :
( next_subocc(sK13(sK16),sK13(sK13(sK16)),tptp0)
| ~ min_precedes(sK13(sK16),X0,tptp0) ),
inference(forward_subsumption_resolution,[],[f555,f355]) ).
fof(f560,plain,
! [X0] :
( occurrence_of(sK13(sK13(sK16)),tptp3)
| ~ min_precedes(sK13(sK16),X0,tptp0) ),
inference(forward_subsumption_resolution,[],[f556,f355]) ).
fof(f565,definition,
( spl18_25
<=> next_subocc(sK13(sK16),sK13(sK13(sK16)),tptp0) ),
introduced(definition,[new_symbols(definition,[spl18_25])],[avatar_definition]) ).
fof(f567,plain,
( next_subocc(sK13(sK16),sK13(sK13(sK16)),tptp0)
| ~ spl18_25 ),
inference(avatar_component_clause,[],[f565]) ).
fof(f570,definition,
( spl18_26
<=> occurrence_of(sK13(sK13(sK16)),tptp3) ),
introduced(definition,[new_symbols(definition,[spl18_26])],[avatar_definition]) ).
fof(f572,plain,
( occurrence_of(sK13(sK13(sK16)),tptp3)
| ~ spl18_26 ),
inference(avatar_component_clause,[],[f570]) ).
fof(f575,definition,
( spl18_27
<=> ! [X0] : ~ min_precedes(sK13(sK16),X0,tptp0) ),
introduced(definition,[new_symbols(definition,[spl18_27])],[avatar_definition]) ).
fof(f576,plain,
( ! [X0] : ~ min_precedes(sK13(sK16),X0,tptp0)
| ~ spl18_27 ),
inference(avatar_component_clause,[],[f575]) ).
fof(f577,plain,
( spl18_27
| spl18_25 ),
inference(avatar_split_clause,[],[f559,f565,f575]) ).
fof(f578,plain,
( spl18_27
| spl18_26 ),
inference(avatar_split_clause,[],[f560,f570,f575]) ).
fof(f581,plain,
( ! [X0] :
( ~ occurrence_of(sK13(sK13(sK16)),X0)
| tptp3 = X0 )
| ~ spl18_26 ),
inference(resolution,[],[f572,f159]) ).
fof(f585,plain,
( min_precedes(sK13(sK16),sK13(sK13(sK16)),tptp0)
| ~ spl18_25 ),
inference(resolution,[],[f567,f125]) ).
fof(f588,plain,
( ! [X0] :
( sK15(sK16) = sK13(sK13(sK16))
| sK14(sK16) = sK13(sK13(sK16))
| ~ occurrence_of(X0,tptp0)
| ~ subactivity_occurrence(sK16,X0)
| ~ arboreal(sK16)
| leaf_occ(sK16,X0) )
| ~ spl18_25 ),
inference(resolution,[],[f585,f179]) ).
fof(f600,plain,
( ! [X0] :
( sK15(sK16) = sK13(sK13(sK16))
| sK14(sK16) = sK13(sK13(sK16))
| ~ occurrence_of(X0,tptp0)
| ~ subactivity_occurrence(sK16,X0)
| ~ arboreal(sK16) )
| ~ spl18_25 ),
inference(forward_subsumption_resolution,[],[f588,f299]) ).
fof(f616,plain,
( ! [X0] :
( sK15(sK16) = sK13(sK13(sK16))
| sK14(sK16) = sK13(sK13(sK16))
| ~ occurrence_of(X0,tptp0)
| ~ subactivity_occurrence(sK16,X0) )
| ~ spl18_25 ),
inference(forward_subsumption_resolution,[],[f600,f199]) ).
fof(f619,definition,
( spl18_32
<=> ! [X0] :
( ~ occurrence_of(X0,tptp0)
| ~ subactivity_occurrence(sK16,X0) ) ),
introduced(definition,[new_symbols(definition,[spl18_32])],[avatar_definition]) ).
fof(f620,plain,
( ! [X0] :
( ~ subactivity_occurrence(sK16,X0)
| ~ occurrence_of(X0,tptp0) )
| ~ spl18_32 ),
inference(avatar_component_clause,[],[f619]) ).
fof(f622,definition,
( spl18_33
<=> sK14(sK16) = sK13(sK13(sK16)) ),
introduced(definition,[new_symbols(definition,[spl18_33])],[avatar_definition]) ).
fof(f624,plain,
( sK14(sK16) = sK13(sK13(sK16))
| ~ spl18_33 ),
inference(avatar_component_clause,[],[f622]) ).
fof(f626,definition,
( spl18_34
<=> sK15(sK16) = sK13(sK13(sK16)) ),
introduced(definition,[new_symbols(definition,[spl18_34])],[avatar_definition]) ).
fof(f628,plain,
( sK15(sK16) = sK13(sK13(sK16))
| ~ spl18_34 ),
inference(avatar_component_clause,[],[f626]) ).
fof(f629,plain,
( spl18_32
| spl18_33
| spl18_34
| ~ spl18_25 ),
inference(avatar_split_clause,[],[f616,f565,f626,f622,f619]) ).
fof(f643,plain,
( $false
| ~ spl18_27 ),
inference(resolution,[],[f576,f215]) ).
fof(f651,plain,
~ spl18_27,
inference(avatar_contradiction_clause,[],[f643]) ).
fof(f652,plain,
( ~ occurrence_of(sK17,tptp0)
| ~ spl18_32 ),
inference(resolution,[],[f620,f200]) ).
fof(f655,plain,
( $false
| ~ spl18_32 ),
inference(forward_subsumption_resolution,[],[f652,f201]) ).
fof(f656,plain,
~ spl18_32,
inference(avatar_contradiction_clause,[],[f655]) ).
fof(f708,plain,
( ! [X0] :
( ~ occurrence_of(sK14(sK16),X0)
| tptp3 = X0 )
| ~ spl18_26
| ~ spl18_33 ),
inference(superposition,[],[f581,f624]) ).
fof(f713,plain,
( tptp3 = tptp4
| ~ spl18_26
| ~ spl18_33 ),
inference(resolution,[],[f708,f223]) ).
fof(f715,plain,
( $false
| ~ spl18_26
| ~ spl18_33 ),
inference(forward_subsumption_resolution,[],[f713,f192]) ).
fof(f716,plain,
( ~ spl18_26
| ~ spl18_33 ),
inference(avatar_contradiction_clause,[],[f715]) ).
fof(f723,plain,
( ! [X0] :
( ~ occurrence_of(sK15(sK16),X0)
| tptp3 = X0 )
| ~ spl18_26
| ~ spl18_34 ),
inference(superposition,[],[f581,f628]) ).
fof(f732,plain,
( tptp3 = tptp2
| ~ spl18_3
| ~ spl18_26
| ~ spl18_34 ),
inference(resolution,[],[f723,f250]) ).
fof(f734,plain,
( $false
| ~ spl18_3
| ~ spl18_26
| ~ spl18_34 ),
inference(forward_subsumption_resolution,[],[f732,f195]) ).
fof(f735,plain,
( ~ spl18_3
| ~ spl18_26
| ~ spl18_34 ),
inference(avatar_contradiction_clause,[],[f734]) ).
fof(f736,plain,
( tptp3 = tptp1
| ~ spl18_4
| ~ spl18_26
| ~ spl18_34 ),
inference(resolution,[],[f254,f723]) ).
fof(f741,plain,
( $false
| ~ spl18_4
| ~ spl18_26
| ~ spl18_34 ),
inference(forward_subsumption_resolution,[],[f736,f196]) ).
fof(f742,plain,
( ~ spl18_4
| ~ spl18_26
| ~ spl18_34 ),
inference(avatar_contradiction_clause,[],[f741]) ).
cnf(s2,plain,
( spl18_3
| spl18_4 ),
inference(sat_conversion,[],[f255]) ).
cnf(s21,plain,
( spl18_25
| spl18_27 ),
inference(sat_conversion,[],[f577]) ).
cnf(s22,plain,
( spl18_26
| spl18_27 ),
inference(sat_conversion,[],[f578]) ).
cnf(s26,plain,
( ~ spl18_25
| spl18_32
| spl18_33
| spl18_34 ),
inference(sat_conversion,[],[f629]) ).
cnf(s29,plain,
~ spl18_27,
inference(sat_conversion,[],[f651]) ).
cnf(s30,plain,
~ spl18_32,
inference(sat_conversion,[],[f656]) ).
cnf(s34,plain,
( ~ spl18_26
| ~ spl18_33 ),
inference(sat_conversion,[],[f716]) ).
cnf(s35,plain,
( ~ spl18_3
| ~ spl18_26
| ~ spl18_34 ),
inference(sat_conversion,[],[f735]) ).
cnf(s36,plain,
( ~ spl18_4
| ~ spl18_26
| ~ spl18_34 ),
inference(sat_conversion,[],[f742]) ).
cnf(s37,plain,
( ~ spl18_25
| spl18_33
| spl18_34 ),
inference(rat,[],[s26,s30]) ).
cnf(s38,plain,
spl18_26,
inference(rat,[],[s22,s29]) ).
cnf(s39,plain,
~ spl18_33,
inference(rat,[],[s34,s38]) ).
cnf(s40,plain,
spl18_25,
inference(rat,[],[s21,s29]) ).
cnf(s41,plain,
spl18_34,
inference(rat,[],[s37,s39,s40]) ).
cnf(s42,plain,
~ spl18_4,
inference(rat,[],[s36,s38,s41]) ).
cnf(s43,plain,
~ spl18_3,
inference(rat,[],[s35,s38,s41]) ).
cnf(s48,plain,
$false,
inference(rat,[],[s2,s42,s43]) ).
fof(f743,plain,
$false,
inference(avatar_sat_refutation,[],[s48]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : PRO017+2 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.39 % Computer : n002.cluster.edu
% 0.11/0.39 % Model : x86_64 x86_64
% 0.11/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.39 % Memory : 8046.5625MB
% 0.11/0.39 % OS : Linux 6.8.0-71-generic
% 0.11/0.39 % CPULimit : 300
% 0.11/0.39 % WCLimit : 300
% 0.11/0.39 % DateTime : Sun Sep 27 22:27:52 UTC 2026
% 0.11/0.39 % CPUTime :
% 0.11/0.39 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.43 Running first-order theorem proving
% 0.11/0.43 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
% 5.00/1.68 % (3950372)Detected formulas, will run a generic FOF schedule.
% 5.00/1.68 % (3950377)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=318278304:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 5.00/1.68 % (3950378)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=1337847910:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 5.00/1.68 % (3950383)dis-21_1_sil=8000:lcm=predicate:random_seed=3999765172: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)
% 5.00/1.68 % (3950380)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=374097424:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 5.00/1.68 % (3950381)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2626282953:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 5.00/1.68 % (3950379)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=2759950311:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 5.00/1.68 % (3950380)Refutation not found, incomplete strategy
% 5.00/1.68 % (3950380)------------------------------
% 5.00/1.68 % (3950380)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.00/1.68 % (3950380)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.00/1.68 % (3950380)CaDiCaL version: 2.1.3
% 5.00/1.68 % (3950380)Termination reason: Refutation not found, incomplete strategy
% 5.00/1.68 % (3950380)Time elapsed: 0.004 s
% 5.00/1.68 % (3950380)Peak memory usage: 88 MB
% 5.00/1.68 % (3950380)Instructions burned: 5 (million)
% 5.00/1.68 % (3950382)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=81208597:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 5.00/1.68 % (3950383)Instruction limit reached!
% 5.00/1.68 % (3950383)------------------------------
% 5.00/1.68 % (3950383)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.00/1.68 % (3950383)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.00/1.68 % (3950383)CaDiCaL version: 2.1.3
% 5.00/1.68 % (3950383)Termination reason: Instruction limit
% 5.00/1.68 % (3950383)Termination phase: Saturation
% 5.00/1.68 % (3950383)Time elapsed: 0.071 s
% 5.00/1.68 % (3950383)Peak memory usage: 89 MB
% 5.00/1.68 % (3950383)Instructions burned: 130 (million)
% 5.00/1.68 % (3950381)Instruction limit reached!
% 5.00/1.68 % (3950381)------------------------------
% 5.00/1.68 % (3950381)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.00/1.68 % (3950381)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.00/1.68 % (3950381)CaDiCaL version: 2.1.3
% 5.00/1.68 % (3950381)Termination reason: Instruction limit
% 5.00/1.68 % (3950381)Termination phase: Saturation
% 5.00/1.68 % (3950381)Time elapsed: 0.076 s
% 5.00/1.68 % (3950381)Peak memory usage: 88 MB
% 5.00/1.68 % (3950381)Instructions burned: 121 (million)
% 5.00/1.68 % (3950382)Instruction limit reached!
% 5.00/1.68 % (3950382)------------------------------
% 5.00/1.68 % (3950382)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.00/1.68 % (3950382)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.00/1.68 % (3950382)CaDiCaL version: 2.1.3
% 5.00/1.68 % (3950382)Termination reason: Instruction limit
% 5.00/1.68 % (3950382)Termination phase: Saturation
% 5.00/1.68 % (3950382)Time elapsed: 0.100 s
% 5.00/1.68 % (3950382)Peak memory usage: 90 MB
% 5.00/1.68 % (3950382)Instructions burned: 140 (million)
% 5.00/1.68 % (3950391)lrs+10_1_sil=8000:sp=occurrence:random_seed=119463552:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 5.00/1.68 % (3950392)lrs+10_1_sil=32000:urr=on:br=off:random_seed=1935763844:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 5.00/1.68 % (3950380)------------------------------
% 5.00/1.68 % (3950380)------------------------------
% 5.00/1.68 % (3950393)lrs+1011_1_sil=32000:sp=occurrence:random_seed=307101643:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 5.00/1.68 % (3950392)Instruction limit reached!
% 5.00/1.68 % (3950392)------------------------------
% 5.00/1.68 % (3950392)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.00/1.68 % (3950392)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.00/1.68 % (3950392)CaDiCaL version: 2.1.3
% 5.00/1.68 % (3950392)Termination reason: Instruction limit
% 5.00/1.68 % (3950392)Termination phase: Saturation
% 5.00/1.68 % (3950392)Time elapsed: 0.085 s
% 5.00/1.68 % (3950392)Peak memory usage: 89 MB
% 5.00/1.68 % (3950392)Instructions burned: 159 (million)
% 5.00/1.68 % (3950391)Instruction limit reached!
% 5.00/1.68 % (3950391)------------------------------
% 5.00/1.68 % (3950391)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.00/1.68 % (3950391)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.00/1.68 % (3950391)CaDiCaL version: 2.1.3
% 5.00/1.68 % (3950391)Termination reason: Instruction limit
% 5.00/1.68 % (3950391)Termination phase: Saturation
% 5.00/1.68 % (3950391)Time elapsed: 0.176 s
% 5.00/1.68 % (3950391)Peak memory usage: 91 MB
% 5.00/1.68 % (3950391)Instructions burned: 285 (million)
% 5.00/1.68 % (3950397)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=1854973463:s2a=on:i=248:s2at=1.23:gtg=position_2995 on theBenchmark for (2995ds/248Mi)
% 5.00/1.68 % (3950377)First to succeed.
% 5.00/1.68 % (3950377)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3950372"
% 5.00/1.68 % (3950398)lrs+1002_1_to=lpo:sil=8000:sos=on:random_seed=2510565465:st=4:cts=off:i=294:sd=2:ins=7:amm=off:ss=axioms_2995 on theBenchmark for (2995ds/294Mi)
% 5.00/1.68 % (3950393)Instruction limit reached!
% 5.00/1.68 % (3950393)------------------------------
% 5.00/1.68 % (3950393)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.00/1.68 % (3950393)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.00/1.68 % (3950393)CaDiCaL version: 2.1.3
% 5.00/1.68 % (3950393)Termination reason: Instruction limit
% 5.00/1.68 % (3950393)Termination phase: Saturation
% 5.00/1.68 % (3950393)Time elapsed: 0.215 s
% 5.00/1.68 % (3950393)Peak memory usage: 92 MB
% 5.00/1.68 % (3950393)Instructions burned: 326 (million)
% 5.00/1.68 % (3950400)lrs+10_1_ncem=casc2026/models/loop7.pt:sil=32000:tgt=ground:npcc=on:random_seed=144118042:i=2350_2994 on theBenchmark for (2994ds/2350Mi)
% 5.00/1.68 % (3950397)Instruction limit reached!
% 5.00/1.68 % (3950397)------------------------------
% 5.00/1.68 % (3950397)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.00/1.68 % (3950397)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.00/1.68 % (3950397)CaDiCaL version: 2.1.3
% 5.00/1.68 % (3950397)Termination reason: Instruction limit
% 5.00/1.68 % (3950397)Termination phase: Saturation
% 5.00/1.68 % (3950397)Time elapsed: 0.146 s
% 5.00/1.68 % (3950397)Peak memory usage: 90 MB
% 5.00/1.68 % (3950397)Instructions burned: 248 (million)
% 5.00/1.68 % (3950402)dis-1011_32:1_sfv=off:sil=16000:sos=all:erd=off:acc=on:fd=off:flr=on:random_seed=984190343:cts=off:i=113:fsr=off:ss=included:sgt=4_2993 on theBenchmark for (2993ds/113Mi)
% 5.00/1.68 % (3950402)Instruction limit reached!
% 5.00/1.68 % (3950402)------------------------------
% 5.00/1.68 % (3950402)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.00/1.68 % (3950402)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.00/1.68 % (3950402)CaDiCaL version: 2.1.3
% 5.00/1.68 % (3950402)Termination reason: Instruction limit
% 5.00/1.68 % (3950402)Termination phase: Saturation
% 5.00/1.68 % (3950402)Time elapsed: 0.045 s
% 5.00/1.68 % (3950402)Peak memory usage: 90 MB
% 5.00/1.68 % (3950402)Instructions burned: 115 (million)
% 5.00/1.68 % (3950398)Instruction limit reached!
% 5.00/1.68 % (3950398)------------------------------
% 5.00/1.68 % (3950398)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.00/1.68 % (3950398)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.00/1.68 % (3950398)CaDiCaL version: 2.1.3
% 5.00/1.68 % (3950398)Termination reason: Instruction limit
% 5.00/1.68 % (3950398)Termination phase: Saturation
% 5.00/1.68 % (3950398)Time elapsed: 0.177 s
% 5.00/1.68 % (3950398)Peak memory usage: 90 MB
% 5.00/1.68 % (3950398)Instructions burned: 294 (million)
% 5.00/1.68 % (3950377)Refutation found. Thanks to Tanya!
% 5.00/1.68 % SZS status Theorem for theBenchmark
% 5.00/1.68 % SZS output start Proof for theBenchmark
% See solution above
% 6.18/1.77 % (3950377)------------------------------
% 6.18/1.77 % (3950377)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.18/1.77 % (3950377)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.18/1.77 % (3950377)CaDiCaL version: 2.1.3
% 6.18/1.77 % (3950377)Termination reason: Refutation
% 6.18/1.77 % (3950377)Time elapsed: 0.448 s
% 6.18/1.77 % (3950377)Peak memory usage: 130 MB
% 6.18/1.77 % (3950377)Instructions burned: 1006 (million)
% 6.18/1.77 % (3950377)------------------------------
% 6.18/1.77 % (3950377)------------------------------
% 6.18/1.77 % (3950372)Success in time 0.807 s
% 6.18/1.77 % Vampire exiting
%------------------------------------------------------------------------------