%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : PRO017+4 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 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:41 PM UTC 2026
% Result : Theorem 1.71s 0.78s
% Output : Refutation 1.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 22
% Syntax : Number of formulae : 167 ( 32 unt; 9 def)
% Number of atoms : 535 ( 41 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 615 ( 247 ~; 261 |; 82 &)
% ( 13 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 21 ( 19 usr; 10 prp; 0-3 aty)
% Number of functors : 13 ( 13 usr; 7 con; 0-3 aty)
% Number of variables : 184 ( 0 sgn 157 !; 27 ?)
% 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,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(f52,plain,
! [X0] :
( activity_occurrence(X0)
=> ? [X1] : occurrence_of(X0,X1) ),
inference(pure_predicate_removal,[],[f13]) ).
fof(f53,plain,
! [X0,X1] :
( occurrence_of(X1,X0)
=> activity_occurrence(X1) ),
inference(pure_predicate_removal,[],[f4]) ).
fof(f61,plain,
! [X0,X1] :
( activity_occurrence(X1)
| ~ occurrence_of(X1,X0) ),
inference(ennf_transformation,[],[f53]) ).
fof(f65,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(f68,plain,
! [X0,X1,X2] :
( X1 = X2
| ~ occurrence_of(X0,X1)
| ~ occurrence_of(X0,X2) ),
inference(ennf_transformation,[],[f9]) ).
fof(f69,plain,
! [X0,X1,X2] :
( X1 = X2
| ~ occurrence_of(X0,X1)
| ~ occurrence_of(X0,X2) ),
inference(flattening,[],[f68]) ).
fof(f70,plain,
! [X0,X1,X2] :
( ! [X3] : ~ min_precedes(X1,X3,X2)
| ~ occurrence_of(X0,X2)
| ~ leaf_occ(X1,X0) ),
inference(ennf_transformation,[],[f10]) ).
fof(f71,plain,
! [X0,X1,X2] :
( ! [X3] : ~ min_precedes(X1,X3,X2)
| ~ occurrence_of(X0,X2)
| ~ leaf_occ(X1,X0) ),
inference(flattening,[],[f70]) ).
fof(f75,plain,
! [X0] :
( ? [X1] : occurrence_of(X0,X1)
| ~ activity_occurrence(X0) ),
inference(ennf_transformation,[],[f52]) ).
fof(f79,plain,
! [X0,X1] :
( ( arboreal(X0)
<=> atomic(X1) )
| ~ occurrence_of(X0,X1) ),
inference(ennf_transformation,[],[f17]) ).
fof(f87,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(f98,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(f99,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,[],[f98]) ).
fof(f100,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(f101,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,[],[f100]) ).
fof(f104,plain,
! [X0,X1,X2] :
( ( occurrence_of(sK2(X0,X1,X2),X0)
& subactivity_occurrence(X1,sK2(X0,X1,X2))
& subactivity_occurrence(X2,sK2(X0,X1,X2)) )
| ~ min_precedes(X1,X2,X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(X3,sK2(X0,X1,X2))],[f65]) ).
fof(f106,plain,
! [X0] :
( occurrence_of(X0,sK4(X0))
| ~ activity_occurrence(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4]),skolemize(X1,sK4(X0))],[f75]) ).
fof(f112,plain,
! [X0,X1] :
( ( ( arboreal(X0)
| ~ atomic(X1) )
& ( atomic(X1)
| ~ arboreal(X0) ) )
| ~ occurrence_of(X0,X1) ),
inference(nnf_transformation,[],[f79]) ).
fof(f119,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,[],[f87]) ).
fof(f120,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,[],[f119]) ).
fof(f121,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,[],[f120]) ).
fof(f122,plain,
! [X0,X1,X2] :
( ( next_subocc(X0,X1,X2)
| ~ min_precedes(X0,X1,X2)
| ( min_precedes(X0,sK10(X0,X1,X2),X2)
& min_precedes(sK10(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,[sK10]),skolemize(X3,sK10(X0,X1,X2))],[f121]) ).
fof(f123,plain,
! [X0,X1] :
( ( occurrence_of(sK11(X0),tptp3)
& next_subocc(X0,sK11(X0),tptp0)
& occurrence_of(sK12(X0),tptp4)
& min_precedes(sK11(X0),sK12(X0),tptp0)
& ( occurrence_of(sK13(X0),tptp2)
| occurrence_of(sK13(X0),tptp1) )
& min_precedes(sK12(X0),sK13(X0),tptp0)
& ! [X5] :
( sK12(X0) = X5
| sK13(X0) = X5
| ~ min_precedes(sK11(X0),X5,tptp0) ) )
| ~ occurrence_of(X1,tptp0)
| ~ subactivity_occurrence(X0,X1)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK11,sK12,sK13]),skolemize(X2,sK11(X0)),skolemize(X3,sK12(X0)),skolemize(X4,sK13(X0))],[f99]) ).
fof(f124,plain,
( ! [X2,X3] :
( ~ occurrence_of(X2,tptp3)
| ~ next_subocc(sK14,X2,tptp0)
| ( ~ occurrence_of(X3,tptp2)
& ~ occurrence_of(X3,tptp1) )
| ~ min_precedes(X2,X3,tptp0)
| ~ leaf(X3,tptp0) )
& occurrence_of(sK15,tptp0)
& subactivity_occurrence(sK14,sK15)
& arboreal(sK14)
& ~ leaf_occ(sK14,sK15) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK14,sK15]),skolemize(X0,sK14),skolemize(X1,sK15)],[f101]) ).
fof(f129,plain,
! [X0,X1] :
( ~ occurrence_of(X1,X0)
| activity_occurrence(X1) ),
inference(cnf_transformation,[],[f61]) ).
fof(f132,plain,
! [X2,X0,X1] :
( subactivity_occurrence(X2,sK2(X0,X1,X2))
| ~ min_precedes(X1,X2,X0) ),
inference(cnf_transformation,[],[f104]) ).
fof(f134,plain,
! [X2,X0,X1] :
( occurrence_of(sK2(X0,X1,X2),X0)
| ~ min_precedes(X1,X2,X0) ),
inference(cnf_transformation,[],[f104]) ).
fof(f137,plain,
! [X2,X0,X1] :
( ~ occurrence_of(X0,X2)
| ~ occurrence_of(X0,X1)
| X1 = X2 ),
inference(cnf_transformation,[],[f69]) ).
fof(f138,plain,
! [X2,X3,X0,X1] :
( ~ min_precedes(X1,X3,X2)
| ~ occurrence_of(X0,X2)
| ~ leaf_occ(X1,X0) ),
inference(cnf_transformation,[],[f71]) ).
fof(f142,plain,
! [X0] :
( occurrence_of(X0,sK4(X0))
| ~ activity_occurrence(X0) ),
inference(cnf_transformation,[],[f106]) ).
fof(f151,plain,
! [X0,X1] :
( ~ occurrence_of(X0,X1)
| ~ atomic(X1)
| arboreal(X0) ),
inference(cnf_transformation,[],[f112]) ).
fof(f169,plain,
! [X2,X0,X1] :
( ~ next_subocc(X0,X1,X2)
| min_precedes(X0,X1,X2) ),
inference(cnf_transformation,[],[f122]) ).
fof(f177,plain,
! [X0,X1,X5] :
( ~ min_precedes(sK11(X0),X5,tptp0)
| sK13(X0) = X5
| sK12(X0) = X5
| ~ occurrence_of(X1,tptp0)
| ~ subactivity_occurrence(X0,X1)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f123]) ).
fof(f179,plain,
! [X0,X1] :
( ~ subactivity_occurrence(X0,X1)
| occurrence_of(sK13(X0),tptp1)
| ~ occurrence_of(X1,tptp0)
| occurrence_of(sK13(X0),tptp2)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f123]) ).
fof(f180,plain,
! [X0,X1] :
( ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0)
| min_precedes(sK11(X0),sK12(X0),tptp0)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f123]) ).
fof(f181,plain,
! [X0,X1] :
( ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0)
| occurrence_of(sK12(X0),tptp4)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f123]) ).
fof(f182,plain,
! [X0,X1] :
( ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0)
| next_subocc(X0,sK11(X0),tptp0)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f123]) ).
fof(f183,plain,
! [X0,X1] :
( ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0)
| occurrence_of(sK11(X0),tptp3)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f123]) ).
fof(f188,plain,
atomic(tptp3),
inference(cnf_transformation,[],[f39]) ).
fof(f189,plain,
tptp3 != tptp4,
inference(cnf_transformation,[],[f40]) ).
fof(f192,plain,
tptp3 != tptp2,
inference(cnf_transformation,[],[f43]) ).
fof(f193,plain,
tptp3 != tptp1,
inference(cnf_transformation,[],[f44]) ).
fof(f195,plain,
~ leaf_occ(sK14,sK15),
inference(cnf_transformation,[],[f124]) ).
fof(f196,plain,
arboreal(sK14),
inference(cnf_transformation,[],[f124]) ).
fof(f197,plain,
subactivity_occurrence(sK14,sK15),
inference(cnf_transformation,[],[f124]) ).
fof(f198,plain,
occurrence_of(sK15,tptp0),
inference(cnf_transformation,[],[f124]) ).
fof(f222,plain,
! [X0,X1] :
( ~ occurrence_of(X0,X1)
| sK4(X0) = X1
| ~ activity_occurrence(X0) ),
inference(resolution,[],[f137,f142]) ).
fof(f224,plain,
! [X0,X1] :
( ~ occurrence_of(X0,X1)
| sK4(X0) = X1 ),
inference(forward_subsumption_resolution,[],[f222,f129]) ).
fof(f360,plain,
( ~ occurrence_of(sK15,tptp0)
| occurrence_of(sK12(sK14),tptp4)
| ~ arboreal(sK14)
| leaf_occ(sK14,sK15) ),
inference(resolution,[],[f181,f197]) ).
fof(f364,plain,
( occurrence_of(sK12(sK14),tptp4)
| ~ arboreal(sK14)
| leaf_occ(sK14,sK15) ),
inference(forward_subsumption_resolution,[],[f360,f198]) ).
fof(f365,plain,
( occurrence_of(sK12(sK14),tptp4)
| leaf_occ(sK14,sK15) ),
inference(forward_subsumption_resolution,[],[f364,f196]) ).
fof(f366,plain,
occurrence_of(sK12(sK14),tptp4),
inference(forward_subsumption_resolution,[],[f365,f195]) ).
fof(f372,plain,
tptp4 = sK4(sK12(sK14)),
inference(resolution,[],[f366,f224]) ).
fof(f375,plain,
( ~ occurrence_of(sK15,tptp0)
| occurrence_of(sK11(sK14),tptp3)
| ~ arboreal(sK14)
| leaf_occ(sK14,sK15) ),
inference(resolution,[],[f183,f197]) ).
fof(f377,plain,
! [X2,X0,X1] :
( ~ occurrence_of(sK2(X0,X1,X2),tptp0)
| occurrence_of(sK11(X2),tptp3)
| ~ arboreal(X2)
| leaf_occ(X2,sK2(X0,X1,X2))
| ~ min_precedes(X1,X2,X0) ),
inference(resolution,[],[f183,f132]) ).
fof(f379,plain,
( occurrence_of(sK11(sK14),tptp3)
| ~ arboreal(sK14)
| leaf_occ(sK14,sK15) ),
inference(forward_subsumption_resolution,[],[f375,f198]) ).
fof(f380,plain,
( occurrence_of(sK11(sK14),tptp3)
| leaf_occ(sK14,sK15) ),
inference(forward_subsumption_resolution,[],[f379,f196]) ).
fof(f381,plain,
occurrence_of(sK11(sK14),tptp3),
inference(forward_subsumption_resolution,[],[f380,f195]) ).
fof(f385,plain,
( ~ occurrence_of(sK15,tptp0)
| next_subocc(sK14,sK11(sK14),tptp0)
| ~ arboreal(sK14)
| leaf_occ(sK14,sK15) ),
inference(resolution,[],[f182,f197]) ).
fof(f387,plain,
! [X2,X0,X1] :
( ~ occurrence_of(sK2(X0,X1,X2),tptp0)
| next_subocc(X2,sK11(X2),tptp0)
| ~ arboreal(X2)
| leaf_occ(X2,sK2(X0,X1,X2))
| ~ min_precedes(X1,X2,X0) ),
inference(resolution,[],[f182,f132]) ).
fof(f389,plain,
( next_subocc(sK14,sK11(sK14),tptp0)
| ~ arboreal(sK14)
| leaf_occ(sK14,sK15) ),
inference(forward_subsumption_resolution,[],[f385,f198]) ).
fof(f390,plain,
( next_subocc(sK14,sK11(sK14),tptp0)
| leaf_occ(sK14,sK15) ),
inference(forward_subsumption_resolution,[],[f389,f196]) ).
fof(f391,plain,
next_subocc(sK14,sK11(sK14),tptp0),
inference(forward_subsumption_resolution,[],[f390,f195]) ).
fof(f403,plain,
( ~ atomic(tptp3)
| arboreal(sK11(sK14)) ),
inference(resolution,[],[f381,f151]) ).
fof(f406,plain,
arboreal(sK11(sK14)),
inference(forward_subsumption_resolution,[],[f403,f188]) ).
fof(f407,plain,
( ~ occurrence_of(sK15,tptp0)
| min_precedes(sK11(sK14),sK12(sK14),tptp0)
| ~ arboreal(sK14)
| leaf_occ(sK14,sK15) ),
inference(resolution,[],[f180,f197]) ).
fof(f411,plain,
( min_precedes(sK11(sK14),sK12(sK14),tptp0)
| ~ arboreal(sK14)
| leaf_occ(sK14,sK15) ),
inference(forward_subsumption_resolution,[],[f407,f198]) ).
fof(f412,plain,
( min_precedes(sK11(sK14),sK12(sK14),tptp0)
| leaf_occ(sK14,sK15) ),
inference(forward_subsumption_resolution,[],[f411,f196]) ).
fof(f413,plain,
min_precedes(sK11(sK14),sK12(sK14),tptp0),
inference(forward_subsumption_resolution,[],[f412,f195]) ).
fof(f418,plain,
( occurrence_of(sK13(sK14),tptp1)
| ~ occurrence_of(sK15,tptp0)
| occurrence_of(sK13(sK14),tptp2)
| ~ arboreal(sK14)
| leaf_occ(sK14,sK15) ),
inference(resolution,[],[f179,f197]) ).
fof(f422,plain,
( occurrence_of(sK13(sK14),tptp1)
| occurrence_of(sK13(sK14),tptp2)
| ~ arboreal(sK14)
| leaf_occ(sK14,sK15) ),
inference(forward_subsumption_resolution,[],[f418,f198]) ).
fof(f423,plain,
( occurrence_of(sK13(sK14),tptp1)
| occurrence_of(sK13(sK14),tptp2)
| leaf_occ(sK14,sK15) ),
inference(forward_subsumption_resolution,[],[f422,f196]) ).
fof(f424,plain,
( occurrence_of(sK13(sK14),tptp1)
| occurrence_of(sK13(sK14),tptp2) ),
inference(forward_subsumption_resolution,[],[f423,f195]) ).
fof(f426,definition,
( spl16_9
<=> occurrence_of(sK13(sK14),tptp2) ),
introduced(definition,[new_symbols(definition,[spl16_9])],[avatar_definition]) ).
fof(f428,plain,
( occurrence_of(sK13(sK14),tptp2)
| ~ spl16_9 ),
inference(avatar_component_clause,[],[f426]) ).
fof(f430,definition,
( spl16_10
<=> occurrence_of(sK13(sK14),tptp1) ),
introduced(definition,[new_symbols(definition,[spl16_10])],[avatar_definition]) ).
fof(f432,plain,
( occurrence_of(sK13(sK14),tptp1)
| ~ spl16_10 ),
inference(avatar_component_clause,[],[f430]) ).
fof(f433,plain,
( spl16_9
| spl16_10 ),
inference(avatar_split_clause,[],[f424,f430,f426]) ).
fof(f457,plain,
min_precedes(sK14,sK11(sK14),tptp0),
inference(resolution,[],[f391,f169]) ).
fof(f503,plain,
! [X0] :
( ~ leaf_occ(sK11(sK14),X0)
| ~ occurrence_of(X0,tptp0) ),
inference(resolution,[],[f413,f138]) ).
fof(f556,plain,
! [X0] :
( ~ leaf_occ(sK14,X0)
| ~ occurrence_of(X0,tptp0) ),
inference(resolution,[],[f457,f138]) ).
fof(f889,plain,
! [X0,X1] :
( occurrence_of(sK11(X0),tptp3)
| ~ arboreal(X0)
| leaf_occ(X0,sK2(tptp0,X1,X0))
| ~ min_precedes(X1,X0,tptp0)
| ~ min_precedes(X1,X0,tptp0) ),
inference(resolution,[],[f377,f134]) ).
fof(f890,plain,
! [X0,X1] :
( leaf_occ(X0,sK2(tptp0,X1,X0))
| ~ arboreal(X0)
| occurrence_of(sK11(X0),tptp3)
| ~ min_precedes(X1,X0,tptp0) ),
inference(duplicate_literal_removal,[],[f889]) ).
fof(f937,plain,
! [X0,X1] :
( next_subocc(X0,sK11(X0),tptp0)
| ~ arboreal(X0)
| leaf_occ(X0,sK2(tptp0,X1,X0))
| ~ min_precedes(X1,X0,tptp0)
| ~ min_precedes(X1,X0,tptp0) ),
inference(resolution,[],[f387,f134]) ).
fof(f938,plain,
! [X0,X1] :
( leaf_occ(X0,sK2(tptp0,X1,X0))
| ~ arboreal(X0)
| next_subocc(X0,sK11(X0),tptp0)
| ~ min_precedes(X1,X0,tptp0) ),
inference(duplicate_literal_removal,[],[f937]) ).
fof(f1128,plain,
( tptp1 = sK4(sK13(sK14))
| ~ spl16_10 ),
inference(resolution,[],[f432,f224]) ).
fof(f1840,definition,
( spl16_104
<=> ! [X0] : ~ min_precedes(X0,sK11(sK14),tptp0) ),
introduced(definition,[new_symbols(definition,[spl16_104])],[avatar_definition]) ).
fof(f1841,plain,
( ! [X0] : ~ min_precedes(X0,sK11(sK14),tptp0)
| ~ spl16_104 ),
inference(avatar_component_clause,[],[f1840]) ).
fof(f1917,plain,
! [X0] :
( ~ arboreal(sK11(sK14))
| occurrence_of(sK11(sK11(sK14)),tptp3)
| ~ min_precedes(X0,sK11(sK14),tptp0)
| ~ occurrence_of(sK2(tptp0,X0,sK11(sK14)),tptp0) ),
inference(resolution,[],[f890,f503]) ).
fof(f1921,plain,
! [X0] :
( ~ arboreal(sK11(sK14))
| occurrence_of(sK11(sK11(sK14)),tptp3)
| ~ min_precedes(X0,sK11(sK14),tptp0) ),
inference(forward_subsumption_resolution,[],[f1917,f134]) ).
fof(f1949,definition,
( spl16_108
<=> occurrence_of(sK11(sK11(sK14)),tptp3) ),
introduced(definition,[new_symbols(definition,[spl16_108])],[avatar_definition]) ).
fof(f1951,plain,
( occurrence_of(sK11(sK11(sK14)),tptp3)
| ~ spl16_108 ),
inference(avatar_component_clause,[],[f1949]) ).
fof(f1957,plain,
( $false
| ~ spl16_104 ),
inference(resolution,[],[f1841,f457]) ).
fof(f1960,plain,
~ spl16_104,
inference(avatar_contradiction_clause,[],[f1957]) ).
fof(f1961,plain,
! [X0] :
( occurrence_of(sK11(sK11(sK14)),tptp3)
| ~ min_precedes(X0,sK11(sK14),tptp0) ),
inference(forward_subsumption_resolution,[],[f1921,f406]) ).
fof(f1962,plain,
( spl16_104
| spl16_108 ),
inference(avatar_split_clause,[],[f1961,f1949,f1840]) ).
fof(f2072,plain,
! [X0] :
( ~ arboreal(sK11(sK14))
| next_subocc(sK11(sK14),sK11(sK11(sK14)),tptp0)
| ~ min_precedes(X0,sK11(sK14),tptp0)
| ~ occurrence_of(sK2(tptp0,X0,sK11(sK14)),tptp0) ),
inference(resolution,[],[f938,f503]) ).
fof(f2076,plain,
! [X0] :
( ~ arboreal(sK11(sK14))
| next_subocc(sK11(sK14),sK11(sK11(sK14)),tptp0)
| ~ min_precedes(X0,sK11(sK14),tptp0) ),
inference(forward_subsumption_resolution,[],[f2072,f134]) ).
fof(f2079,plain,
! [X0] :
( next_subocc(sK11(sK14),sK11(sK11(sK14)),tptp0)
| ~ min_precedes(X0,sK11(sK14),tptp0) ),
inference(forward_subsumption_resolution,[],[f2076,f406]) ).
fof(f2086,definition,
( spl16_113
<=> next_subocc(sK11(sK14),sK11(sK11(sK14)),tptp0) ),
introduced(definition,[new_symbols(definition,[spl16_113])],[avatar_definition]) ).
fof(f2088,plain,
( next_subocc(sK11(sK14),sK11(sK11(sK14)),tptp0)
| ~ spl16_113 ),
inference(avatar_component_clause,[],[f2086]) ).
fof(f2089,plain,
( spl16_104
| spl16_113 ),
inference(avatar_split_clause,[],[f2079,f2086,f1840]) ).
fof(f2119,plain,
( tptp3 = sK4(sK11(sK11(sK14)))
| ~ spl16_108 ),
inference(resolution,[],[f1951,f224]) ).
fof(f2374,plain,
( min_precedes(sK11(sK14),sK11(sK11(sK14)),tptp0)
| ~ spl16_113 ),
inference(resolution,[],[f2088,f169]) ).
fof(f2665,plain,
( ! [X0] :
( sK13(sK14) = sK11(sK11(sK14))
| sK12(sK14) = sK11(sK11(sK14))
| ~ occurrence_of(X0,tptp0)
| ~ subactivity_occurrence(sK14,X0)
| ~ arboreal(sK14)
| leaf_occ(sK14,X0) )
| ~ spl16_113 ),
inference(resolution,[],[f2374,f177]) ).
fof(f2698,plain,
( ! [X0] :
( sK13(sK14) = sK11(sK11(sK14))
| sK12(sK14) = sK11(sK11(sK14))
| ~ occurrence_of(X0,tptp0)
| ~ subactivity_occurrence(sK14,X0)
| ~ arboreal(sK14) )
| ~ spl16_113 ),
inference(forward_subsumption_resolution,[],[f2665,f556]) ).
fof(f2705,definition,
( spl16_135
<=> occurrence_of(sK11(sK11(sK14)),tptp2) ),
introduced(definition,[new_symbols(definition,[spl16_135])],[avatar_definition]) ).
fof(f2706,plain,
( occurrence_of(sK11(sK11(sK14)),tptp2)
| ~ spl16_135 ),
inference(avatar_component_clause,[],[f2705]) ).
fof(f2718,plain,
( ! [X0] :
( sK13(sK14) = sK11(sK11(sK14))
| sK12(sK14) = sK11(sK11(sK14))
| ~ occurrence_of(X0,tptp0)
| ~ subactivity_occurrence(sK14,X0) )
| ~ spl16_113 ),
inference(forward_subsumption_resolution,[],[f2698,f196]) ).
fof(f2720,definition,
( spl16_138
<=> ! [X0] :
( ~ occurrence_of(X0,tptp0)
| ~ subactivity_occurrence(sK14,X0) ) ),
introduced(definition,[new_symbols(definition,[spl16_138])],[avatar_definition]) ).
fof(f2721,plain,
( ! [X0] :
( ~ subactivity_occurrence(sK14,X0)
| ~ occurrence_of(X0,tptp0) )
| ~ spl16_138 ),
inference(avatar_component_clause,[],[f2720]) ).
fof(f2723,definition,
( spl16_139
<=> sK12(sK14) = sK11(sK11(sK14)) ),
introduced(definition,[new_symbols(definition,[spl16_139])],[avatar_definition]) ).
fof(f2725,plain,
( sK12(sK14) = sK11(sK11(sK14))
| ~ spl16_139 ),
inference(avatar_component_clause,[],[f2723]) ).
fof(f2727,definition,
( spl16_140
<=> sK13(sK14) = sK11(sK11(sK14)) ),
introduced(definition,[new_symbols(definition,[spl16_140])],[avatar_definition]) ).
fof(f2729,plain,
( sK13(sK14) = sK11(sK11(sK14))
| ~ spl16_140 ),
inference(avatar_component_clause,[],[f2727]) ).
fof(f2730,plain,
( spl16_138
| spl16_139
| spl16_140
| ~ spl16_113 ),
inference(avatar_split_clause,[],[f2718,f2086,f2727,f2723,f2720]) ).
fof(f2769,plain,
( ~ occurrence_of(sK15,tptp0)
| ~ spl16_138 ),
inference(resolution,[],[f2721,f197]) ).
fof(f2773,plain,
( $false
| ~ spl16_138 ),
inference(forward_subsumption_resolution,[],[f2769,f198]) ).
fof(f2774,plain,
~ spl16_138,
inference(avatar_contradiction_clause,[],[f2773]) ).
fof(f2794,plain,
( tptp4 = sK4(sK11(sK11(sK14)))
| ~ spl16_139 ),
inference(superposition,[],[f372,f2725]) ).
fof(f3047,plain,
( tptp3 = tptp4
| ~ spl16_108
| ~ spl16_139 ),
inference(superposition,[],[f2794,f2119]) ).
fof(f3055,plain,
( $false
| ~ spl16_108
| ~ spl16_139 ),
inference(forward_subsumption_resolution,[],[f3047,f189]) ).
fof(f3056,plain,
( ~ spl16_108
| ~ spl16_139 ),
inference(avatar_contradiction_clause,[],[f3055]) ).
fof(f3099,plain,
( tptp1 = sK4(sK11(sK11(sK14)))
| ~ spl16_10
| ~ spl16_140 ),
inference(superposition,[],[f1128,f2729]) ).
fof(f3124,plain,
( tptp3 = tptp1
| ~ spl16_10
| ~ spl16_108
| ~ spl16_140 ),
inference(forward_demodulation,[],[f3099,f2119]) ).
fof(f3132,plain,
( $false
| ~ spl16_10
| ~ spl16_108
| ~ spl16_140 ),
inference(forward_subsumption_resolution,[],[f3124,f193]) ).
fof(f3133,plain,
( ~ spl16_10
| ~ spl16_108
| ~ spl16_140 ),
inference(avatar_contradiction_clause,[],[f3132]) ).
fof(f3134,plain,
( occurrence_of(sK11(sK11(sK14)),tptp2)
| ~ spl16_9
| ~ spl16_140 ),
inference(forward_demodulation,[],[f428,f2729]) ).
fof(f3154,plain,
( spl16_135
| ~ spl16_9
| ~ spl16_140 ),
inference(avatar_split_clause,[],[f3134,f2727,f426,f2705]) ).
fof(f3221,plain,
( tptp2 = sK4(sK11(sK11(sK14)))
| ~ spl16_135 ),
inference(resolution,[],[f2706,f224]) ).
fof(f3223,plain,
( tptp3 = tptp2
| ~ spl16_108
| ~ spl16_135 ),
inference(forward_demodulation,[],[f3221,f2119]) ).
fof(f3224,plain,
( $false
| ~ spl16_108
| ~ spl16_135 ),
inference(forward_subsumption_resolution,[],[f3223,f192]) ).
fof(f3225,plain,
( ~ spl16_108
| ~ spl16_135 ),
inference(avatar_contradiction_clause,[],[f3224]) ).
cnf(s6,plain,
( spl16_9
| spl16_10 ),
inference(sat_conversion,[],[f433]) ).
cnf(s79,plain,
~ spl16_104,
inference(sat_conversion,[],[f1960]) ).
cnf(s80,plain,
( spl16_104
| spl16_108 ),
inference(sat_conversion,[],[f1962]) ).
cnf(s85,plain,
( spl16_104
| spl16_113 ),
inference(sat_conversion,[],[f2089]) ).
cnf(s101,plain,
( ~ spl16_113
| spl16_138
| spl16_139
| spl16_140 ),
inference(sat_conversion,[],[f2730]) ).
cnf(s102,plain,
~ spl16_138,
inference(sat_conversion,[],[f2774]) ).
cnf(s105,plain,
( ~ spl16_108
| ~ spl16_139 ),
inference(sat_conversion,[],[f3056]) ).
cnf(s110,plain,
( ~ spl16_10
| ~ spl16_108
| ~ spl16_140 ),
inference(sat_conversion,[],[f3133]) ).
cnf(s111,plain,
( ~ spl16_9
| spl16_135
| ~ spl16_140 ),
inference(sat_conversion,[],[f3154]) ).
cnf(s117,plain,
( ~ spl16_108
| ~ spl16_135 ),
inference(sat_conversion,[],[f3225]) ).
cnf(s118,plain,
( ~ spl16_113
| spl16_139
| spl16_140 ),
inference(rat,[],[s101,s102]) ).
cnf(s121,plain,
spl16_113,
inference(rat,[],[s85,s79]) ).
cnf(s122,plain,
spl16_108,
inference(rat,[],[s80,s79]) ).
cnf(s123,plain,
~ spl16_135,
inference(rat,[],[s117,s122]) ).
cnf(s124,plain,
~ spl16_139,
inference(rat,[],[s105,s122]) ).
cnf(s125,plain,
spl16_140,
inference(rat,[],[s118,s121,s124]) ).
cnf(s126,plain,
~ spl16_10,
inference(rat,[],[s110,s122,s125]) ).
cnf(s127,plain,
~ spl16_9,
inference(rat,[],[s111,s123,s125]) ).
cnf(s143,plain,
$false,
inference(rat,[],[s6,s126,s127]) ).
fof(f3226,plain,
$false,
inference(avatar_sat_refutation,[],[s143]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : PRO017+4 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.37 % Computer : n002.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Sun Sep 27 22:27:37 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.41 Running first-order model finding
% 0.11/0.41 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.71/0.78 % (3949942)Will run a generic schedule for satisfiability detection.
% 1.71/0.78 % (3949950)dis+10_1_sil=32000:sp=arity:random_seed=3154513432:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 1.71/0.78 % (3949948)% WARNING: option uhcvi not known.
% 1.71/0.78 % (3949947)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3885301128_2999 on theBenchmark for (2999ds/0Mi)
% 1.71/0.78 % (3949951)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3625967933:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 1.71/0.78 % (3949948)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2079339364:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 1.71/0.78 % (3949949)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2668108016:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 1.71/0.78 % (3949952)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1574470764:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 1.71/0.78 % (3949953)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2693074273:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 1.71/0.78 % Detected minimum model sizes of [4]
% 1.71/0.78 % Detected maximum model sizes of [max]
% 1.71/0.78 % TRYING [4]
% 1.71/0.78 % TRYING [5]
% 1.71/0.78 % (3949950)Instruction limit reached!
% 1.71/0.78 % (3949950)------------------------------
% 1.71/0.78 % (3949950)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.71/0.78 % (3949950)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.71/0.78 % (3949950)CaDiCaL version: 2.1.3
% 1.71/0.78 % (3949950)Termination reason: Instruction limit
% 1.71/0.78 % (3949950)Termination phase: Saturation
% 1.71/0.78 % (3949950)Time elapsed: 0.039 s
% 1.71/0.78 % (3949950)Peak memory usage: 12 MB
% 1.71/0.78 % (3949950)Instructions burned: 104 (million)
% 1.71/0.78 % TRYING [6]
% 1.71/0.78 % (3949961)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=2429237525:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 1.71/0.78 % Detected minimum model sizes of [4]
% 1.71/0.78 % Detected maximum model sizes of [max]
% 1.71/0.78 % TRYING [4]
% 1.71/0.78 % TRYING [5]
% 1.71/0.78 % TRYING [6]
% 1.71/0.78 % (3949951)Instruction limit reached!
% 1.71/0.78 % (3949951)------------------------------
% 1.71/0.78 % (3949951)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.71/0.78 % (3949951)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.71/0.78 % (3949951)CaDiCaL version: 2.1.3
% 1.71/0.78 % (3949951)Termination reason: Instruction limit
% 1.71/0.78 % (3949951)Termination phase: Saturation
% 1.71/0.78 % (3949951)Time elapsed: 0.074 s
% 1.71/0.78 % (3949951)Peak memory usage: 12 MB
% 1.71/0.78 % (3949951)Instructions burned: 117 (million)
% 1.71/0.78 % TRYING [7]
% 1.71/0.78 % TRYING [7]
% 1.71/0.78 % (3949952)Instruction limit reached!
% 1.71/0.78 % (3949952)------------------------------
% 1.71/0.78 % (3949952)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.71/0.78 % (3949952)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.71/0.78 % (3949952)CaDiCaL version: 2.1.3
% 1.71/0.78 % (3949952)Termination reason: Instruction limit
% 1.71/0.78 % (3949952)Termination phase: Saturation
% 1.71/0.78 % (3949952)Time elapsed: 0.089 s
% 1.71/0.78 % (3949952)Peak memory usage: 14 MB
% 1.71/0.78 % (3949952)Instructions burned: 132 (million)
% 1.71/0.78 % (3949963)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=2476381113:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 1.71/0.78 % (3949953)Instruction limit reached!
% 1.71/0.78 % (3949953)------------------------------
% 1.71/0.78 % (3949953)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.71/0.78 % (3949953)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.71/0.78 % (3949953)CaDiCaL version: 2.1.3
% 1.71/0.78 % (3949953)Termination reason: Instruction limit
% 1.71/0.78 % (3949953)Termination phase: Saturation
% 1.71/0.78 % (3949953)Time elapsed: 0.098 s
% 1.71/0.78 % (3949953)Peak memory usage: 14 MB
% 1.71/0.78 % (3949953)Instructions burned: 159 (million)
% 1.71/0.78 % (3949964)dis+11_32_anc=none:slsqr=2,1:sil=64000:sas=cadical:lma=off:lsd=50:s2agt=8:slsqc=1:kmz=on:newcnf=on:slsq=on:random_seed=2755914393:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 1.71/0.78 % (3949966)ott-21_1_sil=16000:fs=off:random_seed=3654992997:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 1.71/0.78 % TRYING [8]
% 1.71/0.78 % (3949963)Instruction limit reached!
% 1.71/0.78 % (3949963)------------------------------
% 1.71/0.78 % (3949963)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.71/0.78 % (3949963)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.71/0.78 % (3949963)CaDiCaL version: 2.1.3
% 1.71/0.78 % (3949963)Termination reason: Instruction limit
% 1.71/0.78 % (3949963)Termination phase: Saturation
% 1.71/0.78 % (3949963)Time elapsed: 0.092 s
% 1.71/0.78 % (3949963)Peak memory usage: 14 MB
% 1.71/0.78 % (3949963)Instructions burned: 131 (million)
% 1.71/0.78 % (3949961)Instruction limit reached!
% 1.71/0.78 % (3949961)------------------------------
% 1.71/0.78 % (3949961)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.71/0.78 % (3949961)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.71/0.78 % (3949961)CaDiCaL version: 2.1.3
% 1.71/0.78 % (3949961)Termination reason: Instruction limit
% 1.71/0.78 % (3949961)Termination phase: Finite model building constraint generation
% 1.71/0.78 % (3949961)Time elapsed: 0.157 s
% 1.71/0.78 % (3949961)Peak memory usage: 29 MB
% 1.71/0.78 % (3949961)Instructions burned: 716 (million)
% 1.71/0.78 % (3949969)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=220765984:i=477:bd=all_2997 on theBenchmark for (2997ds/477Mi)
% 1.71/0.78 % (3949970)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=3638940023:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 1.71/0.78 % Detected minimum model sizes of [4]
% 1.71/0.78 % Detected maximum model sizes of [max]
% 1.71/0.78 % TRYING [4]
% 1.71/0.78 % (3949966)Instruction limit reached!
% 1.71/0.78 % (3949966)------------------------------
% 1.71/0.78 % (3949966)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.71/0.78 % (3949966)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.71/0.78 % (3949966)CaDiCaL version: 2.1.3
% 1.71/0.78 % (3949966)Termination reason: Instruction limit
% 1.71/0.78 % (3949966)Termination phase: Saturation
% 1.71/0.78 % (3949966)Time elapsed: 0.097 s
% 1.71/0.78 % (3949966)Peak memory usage: 13 MB
% 1.71/0.78 % (3949966)Instructions burned: 180 (million)
% 1.71/0.78 % TRYING [5]
% 1.71/0.78 % (3949973)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=3559841241:i=1179_2997 on theBenchmark for (2997ds/1179Mi)
% 1.71/0.78 % TRYING [6]
% 1.71/0.78 % TRYING [8]
% 1.71/0.78 % TRYING [7]
% 1.71/0.78 % (3949973) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3949942-3949973"...
% 1.71/0.78 % (3949973)...printing done.
% 1.71/0.78 % (3949973)Refutation found. Thanks to Tanya!
% 1.71/0.78 % SZS status Theorem for theBenchmark
% 1.71/0.78 % SZS output start Proof for theBenchmark
% See solution above
% 1.71/0.78 % (3949973)------------------------------
% 1.71/0.78 % (3949973)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.71/0.78 % (3949973)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.71/0.78 % (3949973)CaDiCaL version: 2.1.3
% 1.71/0.78 % (3949973)Termination reason: Refutation
% 1.71/0.78 % (3949973)Time elapsed: 0.086 s
% 1.71/0.78 % (3949973)Peak memory usage: 14 MB
% 1.71/0.78 % (3949973)Instructions burned: 128 (million)
% 1.71/0.78 % (3949942)Success in time 0.361 s
% 1.71/0.78 % Vampire exiting
%------------------------------------------------------------------------------