%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : PRO018+4 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n019.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.96s 0.82s
% Output : Refutation 1.96s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 24
% Syntax : Number of formulae : 173 ( 33 unt; 10 def)
% Number of atoms : 590 ( 41 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 678 ( 261 ~; 275 |; 112 &)
% ( 13 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 22 ( 20 usr; 10 prp; 0-3 aty)
% Number of functors : 15 ( 15 usr; 7 con; 0-3 aty)
% Number of variables : 214 ( 0 sgn 173 !; 41 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
! [X0,X1] :
( occurrence_of(X1,X0)
=> ( activity(X0)
& activity_occurrence(X1) ) ),
file('/export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p',sos_06) ).
fof(f9,axiom,
! [X0,X1,X2] :
( ( occurrence_of(X0,X1)
& occurrence_of(X0,X2) )
=> X1 = X2 ),
file('/export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p',sos_09) ).
fof(f13,axiom,
! [X0] :
( activity_occurrence(X0)
=> ? [X1] :
( activity(X1)
& occurrence_of(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_12) ).
fof(f17,axiom,
! [X0,X1] :
( occurrence_of(X0,X1)
=> ( arboreal(X0)
<=> atomic(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_16) ).
fof(f24,axiom,
! [X0,X1,X2] :
( min_precedes(X0,X1,X2)
=> ? [X3] :
( root(X3,X2)
& min_precedes(X3,X1,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_23) ).
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/sandbox/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/sandbox/benchmark/theBenchmark.p',sos_32) ).
fof(f39,axiom,
atomic(tptp3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_38) ).
fof(f40,axiom,
tptp4 != tptp3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_39) ).
fof(f43,axiom,
tptp3 != tptp1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_42) ).
fof(f44,axiom,
tptp3 != tptp2,
file('/export/starexec/sandbox/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/sandbox/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(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(f84,plain,
! [X0,X1,X2] :
( ? [X3] :
( root(X3,X2)
& min_precedes(X3,X1,X2) )
| ~ min_precedes(X0,X1,X2) ),
inference(ennf_transformation,[],[f24]) ).
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,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(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,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,[],[f98]) ).
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) )
| ( ? [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(f101,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,[],[f100]) ).
fof(f102,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(f103,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,[],[f101,f102]) ).
fof(f106,plain,
! [X0,X1,X2] :
( ( occurrence_of(sK3(X0,X1,X2),X0)
& subactivity_occurrence(X1,sK3(X0,X1,X2))
& subactivity_occurrence(X2,sK3(X0,X1,X2)) )
| ~ min_precedes(X1,X2,X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(X3,sK3(X0,X1,X2))],[f65]) ).
fof(f108,plain,
! [X0] :
( occurrence_of(X0,sK5(X0))
| ~ activity_occurrence(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5]),skolemize(X1,sK5(X0))],[f75]) ).
fof(f114,plain,
! [X0,X1] :
( ( ( arboreal(X0)
| ~ atomic(X1) )
& ( atomic(X1)
| ~ arboreal(X0) ) )
| ~ occurrence_of(X0,X1) ),
inference(nnf_transformation,[],[f79]) ).
fof(f120,plain,
! [X0,X1,X2] :
( ( root(sK10(X1,X2),X2)
& min_precedes(sK10(X1,X2),X1,X2) )
| ~ min_precedes(X0,X1,X2) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK10]),skolemize(X3,sK10(X1,X2))],[f84]) ).
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)
& ! [X3] :
( ~ min_precedes(X0,X3,X2)
| ~ min_precedes(X3,X1,X2) ) )
| ~ next_subocc(X0,X1,X2) ) ),
inference(nnf_transformation,[],[f87]) ).
fof(f122,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,[],[f121]) ).
fof(f123,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,[],[f122]) ).
fof(f124,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))],[f123]) ).
fof(f125,plain,
! [X0,X1] :
( ( occurrence_of(sK12(X0),tptp3)
& next_subocc(X0,sK12(X0),tptp0)
& occurrence_of(sK13(X0),tptp4)
& min_precedes(sK12(X0),sK13(X0),tptp0)
& ( occurrence_of(sK14(X0),tptp1)
| occurrence_of(sK14(X0),tptp2) )
& min_precedes(sK13(X0),sK14(X0),tptp0)
& ! [X5] :
( sK13(X0) = X5
| sK14(X0) = X5
| ~ min_precedes(sK12(X0),X5,tptp0) ) )
| ~ occurrence_of(X1,tptp0)
| ~ subactivity_occurrence(X0,X1)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK12,sK13,sK14]),skolemize(X2,sK12(X0)),skolemize(X3,sK13(X0)),skolemize(X4,sK14(X0))],[f99]) ).
fof(f129,plain,
( ! [X2,X3] :
( ~ occurrence_of(X2,tptp3)
| ~ next_subocc(sK16,X2,tptp0)
| ( ~ occurrence_of(X3,tptp1)
& ~ occurrence_of(X3,tptp2) )
| ~ min_precedes(X2,X3,tptp0)
| ~ leaf_occ(X3,sK17)
| ( occurrence_of(sK18(X2),tptp2)
& min_precedes(X2,sK18(X2),tptp0)
& occurrence_of(X3,tptp1) )
| sP0(X2,X3) )
& occurrence_of(sK17,tptp0)
& subactivity_occurrence(sK16,sK17)
& arboreal(sK16)
& ~ leaf_occ(sK16,sK17) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK16,sK17,sK18]),skolemize(X0,sK16),skolemize(X1,sK17),skolemize(X4,sK18(X2))],[f103]) ).
fof(f134,plain,
! [X0,X1] :
( ~ occurrence_of(X1,X0)
| activity_occurrence(X1) ),
inference(cnf_transformation,[],[f61]) ).
fof(f137,plain,
! [X2,X0,X1] :
( subactivity_occurrence(X2,sK3(X0,X1,X2))
| ~ min_precedes(X1,X2,X0) ),
inference(cnf_transformation,[],[f106]) ).
fof(f139,plain,
! [X2,X0,X1] :
( occurrence_of(sK3(X0,X1,X2),X0)
| ~ min_precedes(X1,X2,X0) ),
inference(cnf_transformation,[],[f106]) ).
fof(f142,plain,
! [X2,X0,X1] :
( ~ occurrence_of(X0,X2)
| ~ occurrence_of(X0,X1)
| X1 = X2 ),
inference(cnf_transformation,[],[f69]) ).
fof(f143,plain,
! [X2,X3,X0,X1] :
( ~ min_precedes(X1,X3,X2)
| ~ occurrence_of(X0,X2)
| ~ leaf_occ(X1,X0) ),
inference(cnf_transformation,[],[f71]) ).
fof(f147,plain,
! [X0] :
( occurrence_of(X0,sK5(X0))
| ~ activity_occurrence(X0) ),
inference(cnf_transformation,[],[f108]) ).
fof(f156,plain,
! [X0,X1] :
( ~ occurrence_of(X0,X1)
| ~ atomic(X1)
| arboreal(X0) ),
inference(cnf_transformation,[],[f114]) ).
fof(f168,plain,
! [X2,X0,X1] :
( ~ min_precedes(X0,X1,X2)
| min_precedes(sK10(X1,X2),X1,X2) ),
inference(cnf_transformation,[],[f120]) ).
fof(f174,plain,
! [X2,X0,X1] :
( ~ next_subocc(X0,X1,X2)
| min_precedes(X0,X1,X2) ),
inference(cnf_transformation,[],[f124]) ).
fof(f182,plain,
! [X0,X1,X5] :
( ~ min_precedes(sK12(X0),X5,tptp0)
| sK14(X0) = X5
| sK13(X0) = X5
| ~ occurrence_of(X1,tptp0)
| ~ subactivity_occurrence(X0,X1)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f125]) ).
fof(f184,plain,
! [X0,X1] :
( ~ subactivity_occurrence(X0,X1)
| occurrence_of(sK14(X0),tptp2)
| ~ occurrence_of(X1,tptp0)
| occurrence_of(sK14(X0),tptp1)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f125]) ).
fof(f185,plain,
! [X0,X1] :
( ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0)
| min_precedes(sK12(X0),sK13(X0),tptp0)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f125]) ).
fof(f186,plain,
! [X0,X1] :
( ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0)
| occurrence_of(sK13(X0),tptp4)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f125]) ).
fof(f187,plain,
! [X0,X1] :
( ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0)
| next_subocc(X0,sK12(X0),tptp0)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f125]) ).
fof(f188,plain,
! [X0,X1] :
( ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0)
| occurrence_of(sK12(X0),tptp3)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f125]) ).
fof(f193,plain,
atomic(tptp3),
inference(cnf_transformation,[],[f39]) ).
fof(f194,plain,
tptp3 != tptp4,
inference(cnf_transformation,[],[f40]) ).
fof(f197,plain,
tptp3 != tptp1,
inference(cnf_transformation,[],[f43]) ).
fof(f198,plain,
tptp3 != tptp2,
inference(cnf_transformation,[],[f44]) ).
fof(f203,plain,
~ leaf_occ(sK16,sK17),
inference(cnf_transformation,[],[f129]) ).
fof(f204,plain,
arboreal(sK16),
inference(cnf_transformation,[],[f129]) ).
fof(f205,plain,
subactivity_occurrence(sK16,sK17),
inference(cnf_transformation,[],[f129]) ).
fof(f206,plain,
occurrence_of(sK17,tptp0),
inference(cnf_transformation,[],[f129]) ).
fof(f241,plain,
! [X0,X1] :
( ~ occurrence_of(X0,X1)
| sK5(X0) = X1
| ~ activity_occurrence(X0) ),
inference(resolution,[],[f142,f147]) ).
fof(f244,plain,
! [X0,X1] :
( ~ occurrence_of(X0,X1)
| sK5(X0) = X1 ),
inference(forward_subsumption_resolution,[],[f241,f134]) ).
fof(f377,plain,
( ~ occurrence_of(sK17,tptp0)
| occurrence_of(sK13(sK16),tptp4)
| ~ arboreal(sK16)
| leaf_occ(sK16,sK17) ),
inference(resolution,[],[f186,f205]) ).
fof(f381,plain,
( occurrence_of(sK13(sK16),tptp4)
| ~ arboreal(sK16)
| leaf_occ(sK16,sK17) ),
inference(forward_subsumption_resolution,[],[f377,f206]) ).
fof(f382,plain,
( occurrence_of(sK13(sK16),tptp4)
| leaf_occ(sK16,sK17) ),
inference(forward_subsumption_resolution,[],[f381,f204]) ).
fof(f383,plain,
occurrence_of(sK13(sK16),tptp4),
inference(forward_subsumption_resolution,[],[f382,f203]) ).
fof(f384,plain,
tptp4 = sK5(sK13(sK16)),
inference(resolution,[],[f383,f244]) ).
fof(f391,plain,
( ~ occurrence_of(sK17,tptp0)
| occurrence_of(sK12(sK16),tptp3)
| ~ arboreal(sK16)
| leaf_occ(sK16,sK17) ),
inference(resolution,[],[f188,f205]) ).
fof(f393,plain,
! [X2,X0,X1] :
( ~ occurrence_of(sK3(X0,X1,X2),tptp0)
| occurrence_of(sK12(X2),tptp3)
| ~ arboreal(X2)
| leaf_occ(X2,sK3(X0,X1,X2))
| ~ min_precedes(X1,X2,X0) ),
inference(resolution,[],[f188,f137]) ).
fof(f395,plain,
( occurrence_of(sK12(sK16),tptp3)
| ~ arboreal(sK16)
| leaf_occ(sK16,sK17) ),
inference(forward_subsumption_resolution,[],[f391,f206]) ).
fof(f396,plain,
( occurrence_of(sK12(sK16),tptp3)
| leaf_occ(sK16,sK17) ),
inference(forward_subsumption_resolution,[],[f395,f204]) ).
fof(f397,plain,
occurrence_of(sK12(sK16),tptp3),
inference(forward_subsumption_resolution,[],[f396,f203]) ).
fof(f401,plain,
( ~ occurrence_of(sK17,tptp0)
| next_subocc(sK16,sK12(sK16),tptp0)
| ~ arboreal(sK16)
| leaf_occ(sK16,sK17) ),
inference(resolution,[],[f187,f205]) ).
fof(f403,plain,
! [X2,X0,X1] :
( ~ occurrence_of(sK3(X0,X1,X2),tptp0)
| next_subocc(X2,sK12(X2),tptp0)
| ~ arboreal(X2)
| leaf_occ(X2,sK3(X0,X1,X2))
| ~ min_precedes(X1,X2,X0) ),
inference(resolution,[],[f187,f137]) ).
fof(f405,plain,
( next_subocc(sK16,sK12(sK16),tptp0)
| ~ arboreal(sK16)
| leaf_occ(sK16,sK17) ),
inference(forward_subsumption_resolution,[],[f401,f206]) ).
fof(f406,plain,
( next_subocc(sK16,sK12(sK16),tptp0)
| leaf_occ(sK16,sK17) ),
inference(forward_subsumption_resolution,[],[f405,f204]) ).
fof(f407,plain,
next_subocc(sK16,sK12(sK16),tptp0),
inference(forward_subsumption_resolution,[],[f406,f203]) ).
fof(f418,plain,
( ~ atomic(tptp3)
| arboreal(sK12(sK16)) ),
inference(resolution,[],[f397,f156]) ).
fof(f421,plain,
arboreal(sK12(sK16)),
inference(forward_subsumption_resolution,[],[f418,f193]) ).
fof(f422,plain,
( ~ occurrence_of(sK17,tptp0)
| min_precedes(sK12(sK16),sK13(sK16),tptp0)
| ~ arboreal(sK16)
| leaf_occ(sK16,sK17) ),
inference(resolution,[],[f185,f205]) ).
fof(f426,plain,
( min_precedes(sK12(sK16),sK13(sK16),tptp0)
| ~ arboreal(sK16)
| leaf_occ(sK16,sK17) ),
inference(forward_subsumption_resolution,[],[f422,f206]) ).
fof(f427,plain,
( min_precedes(sK12(sK16),sK13(sK16),tptp0)
| leaf_occ(sK16,sK17) ),
inference(forward_subsumption_resolution,[],[f426,f204]) ).
fof(f428,plain,
min_precedes(sK12(sK16),sK13(sK16),tptp0),
inference(forward_subsumption_resolution,[],[f427,f203]) ).
fof(f433,plain,
( occurrence_of(sK14(sK16),tptp2)
| ~ occurrence_of(sK17,tptp0)
| occurrence_of(sK14(sK16),tptp1)
| ~ arboreal(sK16)
| leaf_occ(sK16,sK17) ),
inference(resolution,[],[f184,f205]) ).
fof(f437,plain,
( occurrence_of(sK14(sK16),tptp2)
| occurrence_of(sK14(sK16),tptp1)
| ~ arboreal(sK16)
| leaf_occ(sK16,sK17) ),
inference(forward_subsumption_resolution,[],[f433,f206]) ).
fof(f438,plain,
( occurrence_of(sK14(sK16),tptp2)
| occurrence_of(sK14(sK16),tptp1)
| leaf_occ(sK16,sK17) ),
inference(forward_subsumption_resolution,[],[f437,f204]) ).
fof(f439,plain,
( occurrence_of(sK14(sK16),tptp2)
| occurrence_of(sK14(sK16),tptp1) ),
inference(forward_subsumption_resolution,[],[f438,f203]) ).
fof(f441,definition,
( spl19_9
<=> occurrence_of(sK14(sK16),tptp1) ),
introduced(definition,[new_symbols(definition,[spl19_9])],[avatar_definition]) ).
fof(f443,plain,
( occurrence_of(sK14(sK16),tptp1)
| ~ spl19_9 ),
inference(avatar_component_clause,[],[f441]) ).
fof(f445,definition,
( spl19_10
<=> occurrence_of(sK14(sK16),tptp2) ),
introduced(definition,[new_symbols(definition,[spl19_10])],[avatar_definition]) ).
fof(f447,plain,
( occurrence_of(sK14(sK16),tptp2)
| ~ spl19_10 ),
inference(avatar_component_clause,[],[f445]) ).
fof(f448,plain,
( spl19_9
| spl19_10 ),
inference(avatar_split_clause,[],[f439,f445,f441]) ).
fof(f449,plain,
( tptp1 = sK5(sK14(sK16))
| ~ spl19_9 ),
inference(resolution,[],[f443,f244]) ).
fof(f476,plain,
min_precedes(sK16,sK12(sK16),tptp0),
inference(resolution,[],[f407,f174]) ).
fof(f542,plain,
! [X0] :
( ~ leaf_occ(sK12(sK16),X0)
| ~ occurrence_of(X0,tptp0) ),
inference(resolution,[],[f428,f143]) ).
fof(f596,plain,
! [X0] :
( ~ leaf_occ(sK16,X0)
| ~ occurrence_of(X0,tptp0) ),
inference(resolution,[],[f476,f143]) ).
fof(f601,plain,
min_precedes(sK10(sK12(sK16),tptp0),sK12(sK16),tptp0),
inference(resolution,[],[f476,f168]) ).
fof(f1059,plain,
! [X0,X1] :
( occurrence_of(sK12(X0),tptp3)
| ~ arboreal(X0)
| leaf_occ(X0,sK3(tptp0,X1,X0))
| ~ min_precedes(X1,X0,tptp0)
| ~ min_precedes(X1,X0,tptp0) ),
inference(resolution,[],[f393,f139]) ).
fof(f1060,plain,
! [X0,X1] :
( leaf_occ(X0,sK3(tptp0,X1,X0))
| ~ arboreal(X0)
| occurrence_of(sK12(X0),tptp3)
| ~ min_precedes(X1,X0,tptp0) ),
inference(duplicate_literal_removal,[],[f1059]) ).
fof(f1109,plain,
! [X0,X1] :
( next_subocc(X0,sK12(X0),tptp0)
| ~ arboreal(X0)
| leaf_occ(X0,sK3(tptp0,X1,X0))
| ~ min_precedes(X1,X0,tptp0)
| ~ min_precedes(X1,X0,tptp0) ),
inference(resolution,[],[f403,f139]) ).
fof(f1110,plain,
! [X0,X1] :
( leaf_occ(X0,sK3(tptp0,X1,X0))
| ~ arboreal(X0)
| next_subocc(X0,sK12(X0),tptp0)
| ~ min_precedes(X1,X0,tptp0) ),
inference(duplicate_literal_removal,[],[f1109]) ).
fof(f2216,definition,
( spl19_148
<=> ! [X0] :
( ~ occurrence_of(X0,tptp0)
| ~ subactivity_occurrence(sK16,X0) ) ),
introduced(definition,[new_symbols(definition,[spl19_148])],[avatar_definition]) ).
fof(f2217,plain,
( ! [X0] :
( ~ subactivity_occurrence(sK16,X0)
| ~ occurrence_of(X0,tptp0) )
| ~ spl19_148 ),
inference(avatar_component_clause,[],[f2216]) ).
fof(f2280,plain,
( ~ occurrence_of(sK17,tptp0)
| ~ spl19_148 ),
inference(resolution,[],[f2217,f205]) ).
fof(f2284,plain,
( $false
| ~ spl19_148 ),
inference(forward_subsumption_resolution,[],[f2280,f206]) ).
fof(f2285,plain,
~ spl19_148,
inference(avatar_contradiction_clause,[],[f2284]) ).
fof(f2358,definition,
( spl19_156
<=> ! [X0] : ~ min_precedes(X0,sK12(sK16),tptp0) ),
introduced(definition,[new_symbols(definition,[spl19_156])],[avatar_definition]) ).
fof(f2359,plain,
( ! [X0] : ~ min_precedes(X0,sK12(sK16),tptp0)
| ~ spl19_156 ),
inference(avatar_component_clause,[],[f2358]) ).
fof(f2414,plain,
! [X0] :
( ~ arboreal(sK12(sK16))
| occurrence_of(sK12(sK12(sK16)),tptp3)
| ~ min_precedes(X0,sK12(sK16),tptp0)
| ~ occurrence_of(sK3(tptp0,X0,sK12(sK16)),tptp0) ),
inference(resolution,[],[f1060,f542]) ).
fof(f2420,plain,
! [X0] :
( ~ arboreal(sK12(sK16))
| occurrence_of(sK12(sK12(sK16)),tptp3)
| ~ min_precedes(X0,sK12(sK16),tptp0) ),
inference(forward_subsumption_resolution,[],[f2414,f139]) ).
fof(f2456,definition,
( spl19_160
<=> occurrence_of(sK12(sK12(sK16)),tptp3) ),
introduced(definition,[new_symbols(definition,[spl19_160])],[avatar_definition]) ).
fof(f2458,plain,
( occurrence_of(sK12(sK12(sK16)),tptp3)
| ~ spl19_160 ),
inference(avatar_component_clause,[],[f2456]) ).
fof(f2463,plain,
( $false
| ~ spl19_156 ),
inference(resolution,[],[f2359,f601]) ).
fof(f2467,plain,
~ spl19_156,
inference(avatar_contradiction_clause,[],[f2463]) ).
fof(f2468,plain,
! [X0] :
( occurrence_of(sK12(sK12(sK16)),tptp3)
| ~ min_precedes(X0,sK12(sK16),tptp0) ),
inference(forward_subsumption_resolution,[],[f2420,f421]) ).
fof(f2469,plain,
( spl19_156
| spl19_160 ),
inference(avatar_split_clause,[],[f2468,f2456,f2358]) ).
fof(f2569,plain,
! [X0] :
( ~ arboreal(sK12(sK16))
| next_subocc(sK12(sK16),sK12(sK12(sK16)),tptp0)
| ~ min_precedes(X0,sK12(sK16),tptp0)
| ~ occurrence_of(sK3(tptp0,X0,sK12(sK16)),tptp0) ),
inference(resolution,[],[f1110,f542]) ).
fof(f2575,plain,
! [X0] :
( ~ arboreal(sK12(sK16))
| next_subocc(sK12(sK16),sK12(sK12(sK16)),tptp0)
| ~ min_precedes(X0,sK12(sK16),tptp0) ),
inference(forward_subsumption_resolution,[],[f2569,f139]) ).
fof(f2580,plain,
! [X0] :
( next_subocc(sK12(sK16),sK12(sK12(sK16)),tptp0)
| ~ min_precedes(X0,sK12(sK16),tptp0) ),
inference(forward_subsumption_resolution,[],[f2575,f421]) ).
fof(f2587,definition,
( spl19_162
<=> next_subocc(sK12(sK16),sK12(sK12(sK16)),tptp0) ),
introduced(definition,[new_symbols(definition,[spl19_162])],[avatar_definition]) ).
fof(f2589,plain,
( next_subocc(sK12(sK16),sK12(sK12(sK16)),tptp0)
| ~ spl19_162 ),
inference(avatar_component_clause,[],[f2587]) ).
fof(f2590,plain,
( spl19_156
| spl19_162 ),
inference(avatar_split_clause,[],[f2580,f2587,f2358]) ).
fof(f2596,plain,
( tptp3 = sK5(sK12(sK12(sK16)))
| ~ spl19_160 ),
inference(resolution,[],[f2458,f244]) ).
fof(f2724,plain,
( min_precedes(sK12(sK16),sK12(sK12(sK16)),tptp0)
| ~ spl19_162 ),
inference(resolution,[],[f2589,f174]) ).
fof(f2892,plain,
( ! [X0] :
( sK14(sK16) = sK12(sK12(sK16))
| sK13(sK16) = sK12(sK12(sK16))
| ~ occurrence_of(X0,tptp0)
| ~ subactivity_occurrence(sK16,X0)
| ~ arboreal(sK16)
| leaf_occ(sK16,X0) )
| ~ spl19_162 ),
inference(resolution,[],[f2724,f182]) ).
fof(f2925,plain,
( ! [X0] :
( sK14(sK16) = sK12(sK12(sK16))
| sK13(sK16) = sK12(sK12(sK16))
| ~ occurrence_of(X0,tptp0)
| ~ subactivity_occurrence(sK16,X0)
| ~ arboreal(sK16) )
| ~ spl19_162 ),
inference(forward_subsumption_resolution,[],[f2892,f596]) ).
fof(f2936,definition,
( spl19_175
<=> occurrence_of(sK12(sK12(sK16)),tptp2) ),
introduced(definition,[new_symbols(definition,[spl19_175])],[avatar_definition]) ).
fof(f2937,plain,
( occurrence_of(sK12(sK12(sK16)),tptp2)
| ~ spl19_175 ),
inference(avatar_component_clause,[],[f2936]) ).
fof(f2954,plain,
( ! [X0] :
( sK14(sK16) = sK12(sK12(sK16))
| sK13(sK16) = sK12(sK12(sK16))
| ~ occurrence_of(X0,tptp0)
| ~ subactivity_occurrence(sK16,X0) )
| ~ spl19_162 ),
inference(forward_subsumption_resolution,[],[f2925,f204]) ).
fof(f2956,definition,
( spl19_179
<=> sK13(sK16) = sK12(sK12(sK16)) ),
introduced(definition,[new_symbols(definition,[spl19_179])],[avatar_definition]) ).
fof(f2958,plain,
( sK13(sK16) = sK12(sK12(sK16))
| ~ spl19_179 ),
inference(avatar_component_clause,[],[f2956]) ).
fof(f2960,definition,
( spl19_180
<=> sK14(sK16) = sK12(sK12(sK16)) ),
introduced(definition,[new_symbols(definition,[spl19_180])],[avatar_definition]) ).
fof(f2962,plain,
( sK14(sK16) = sK12(sK12(sK16))
| ~ spl19_180 ),
inference(avatar_component_clause,[],[f2960]) ).
fof(f2963,plain,
( spl19_148
| spl19_179
| spl19_180
| ~ spl19_162 ),
inference(avatar_split_clause,[],[f2954,f2587,f2960,f2956,f2216]) ).
fof(f3008,plain,
( tptp4 = sK5(sK12(sK12(sK16)))
| ~ spl19_179 ),
inference(superposition,[],[f384,f2958]) ).
fof(f3249,plain,
( tptp1 = sK5(sK12(sK12(sK16)))
| ~ spl19_9
| ~ spl19_180 ),
inference(superposition,[],[f449,f2962]) ).
fof(f3298,plain,
( tptp3 = tptp1
| ~ spl19_9
| ~ spl19_160
| ~ spl19_180 ),
inference(forward_demodulation,[],[f3249,f2596]) ).
fof(f3300,plain,
( $false
| ~ spl19_9
| ~ spl19_160
| ~ spl19_180 ),
inference(forward_subsumption_resolution,[],[f3298,f197]) ).
fof(f3301,plain,
( ~ spl19_9
| ~ spl19_160
| ~ spl19_180 ),
inference(avatar_contradiction_clause,[],[f3300]) ).
fof(f3303,plain,
( occurrence_of(sK12(sK12(sK16)),tptp2)
| ~ spl19_10
| ~ spl19_180 ),
inference(forward_demodulation,[],[f447,f2962]) ).
fof(f3326,plain,
( spl19_175
| ~ spl19_10
| ~ spl19_180 ),
inference(avatar_split_clause,[],[f3303,f2960,f445,f2936]) ).
fof(f3364,plain,
( tptp2 = sK5(sK12(sK12(sK16)))
| ~ spl19_175 ),
inference(resolution,[],[f2937,f244]) ).
fof(f3366,plain,
( tptp3 = tptp2
| ~ spl19_160
| ~ spl19_175 ),
inference(forward_demodulation,[],[f3364,f2596]) ).
fof(f3367,plain,
( $false
| ~ spl19_160
| ~ spl19_175 ),
inference(forward_subsumption_resolution,[],[f3366,f198]) ).
fof(f3368,plain,
( ~ spl19_160
| ~ spl19_175 ),
inference(avatar_contradiction_clause,[],[f3367]) ).
fof(f3758,plain,
( tptp3 = tptp4
| ~ spl19_160
| ~ spl19_179 ),
inference(superposition,[],[f3008,f2596]) ).
fof(f3766,plain,
( $false
| ~ spl19_160
| ~ spl19_179 ),
inference(forward_subsumption_resolution,[],[f3758,f194]) ).
fof(f3767,plain,
( ~ spl19_160
| ~ spl19_179 ),
inference(avatar_contradiction_clause,[],[f3766]) ).
cnf(s6,plain,
( spl19_9
| spl19_10 ),
inference(sat_conversion,[],[f448]) ).
cnf(s107,plain,
~ spl19_148,
inference(sat_conversion,[],[f2285]) ).
cnf(s116,plain,
~ spl19_156,
inference(sat_conversion,[],[f2467]) ).
cnf(s117,plain,
( spl19_156
| spl19_160 ),
inference(sat_conversion,[],[f2469]) ).
cnf(s122,plain,
( spl19_156
| spl19_162 ),
inference(sat_conversion,[],[f2590]) ).
cnf(s134,plain,
( spl19_148
| ~ spl19_162
| spl19_179
| spl19_180 ),
inference(sat_conversion,[],[f2963]) ).
cnf(s142,plain,
( ~ spl19_9
| ~ spl19_160
| ~ spl19_180 ),
inference(sat_conversion,[],[f3301]) ).
cnf(s144,plain,
( ~ spl19_10
| spl19_175
| ~ spl19_180 ),
inference(sat_conversion,[],[f3326]) ).
cnf(s148,plain,
( ~ spl19_160
| ~ spl19_175 ),
inference(sat_conversion,[],[f3368]) ).
cnf(s154,plain,
( ~ spl19_160
| ~ spl19_179 ),
inference(sat_conversion,[],[f3767]) ).
cnf(s157,plain,
spl19_162,
inference(rat,[],[s122,s116]) ).
cnf(s158,plain,
spl19_160,
inference(rat,[],[s117,s116]) ).
cnf(s159,plain,
~ spl19_179,
inference(rat,[],[s154,s158]) ).
cnf(s160,plain,
~ spl19_175,
inference(rat,[],[s148,s158]) ).
cnf(s167,plain,
spl19_180,
inference(rat,[],[s134,s159,s157,s107]) ).
cnf(s168,plain,
~ spl19_9,
inference(rat,[],[s142,s158,s167]) ).
cnf(s169,plain,
~ spl19_10,
inference(rat,[],[s144,s160,s167]) ).
cnf(s184,plain,
$false,
inference(rat,[],[s6,s169,s168]) ).
fof(f3768,plain,
$false,
inference(avatar_sat_refutation,[],[s184]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : PRO018+4 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.39 % Computer : n019.cluster.edu
% 0.12/0.39 % Model : x86_64 x86_64
% 0.12/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.39 % Memory : 8046.5625MB
% 0.12/0.39 % OS : Linux 6.8.0-71-generic
% 0.12/0.39 % CPULimit : 300
% 0.12/0.39 % WCLimit : 300
% 0.12/0.39 % DateTime : Sun Sep 27 22:26:04 UTC 2026
% 0.12/0.39 % CPUTime :
% 0.12/0.39 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.42 Running first-order model finding
% 0.12/0.42 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.96/0.82 % (3472084)Will run a generic schedule for satisfiability detection.
% 1.96/0.82 % (3472093)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=713403477:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 1.96/0.82 % (3472090)% WARNING: option uhcvi not known.
% 1.96/0.82 % (3472089)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=50822333_2999 on theBenchmark for (2999ds/0Mi)
% 1.96/0.82 % (3472090)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2715670234:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 1.96/0.82 % (3472094)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3635993827:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 1.96/0.82 % (3472091)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=911391674:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 1.96/0.82 % (3472092)dis+10_1_sil=32000:sp=arity:random_seed=394867860:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 1.96/0.82 % (3472095)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2167882072:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 1.96/0.82 % Detected minimum model sizes of [4]
% 1.96/0.82 % Detected maximum model sizes of [max]
% 1.96/0.82 % TRYING [4]
% 1.96/0.82 % TRYING [5]
% 1.96/0.82 % (3472093)Instruction limit reached!
% 1.96/0.82 % (3472093)------------------------------
% 1.96/0.82 % (3472093)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.96/0.82 % (3472093)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.96/0.82 % (3472093)CaDiCaL version: 2.1.3
% 1.96/0.82 % (3472093)Termination reason: Instruction limit
% 1.96/0.82 % (3472093)Termination phase: Saturation
% 1.96/0.82 % (3472093)Time elapsed: 0.039 s
% 1.96/0.82 % (3472093)Peak memory usage: 12 MB
% 1.96/0.82 % (3472093)Instructions burned: 116 (million)
% 1.96/0.82 % TRYING [6]
% 1.96/0.82 % (3472103)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=2276981669:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 1.96/0.82 % Detected minimum model sizes of [4]
% 1.96/0.82 % Detected maximum model sizes of [max]
% 1.96/0.82 % TRYING [4]
% 1.96/0.82 % TRYING [5]
% 1.96/0.82 % TRYING [6]
% 1.96/0.82 % (3472092)Instruction limit reached!
% 1.96/0.82 % (3472092)------------------------------
% 1.96/0.82 % (3472092)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.96/0.82 % (3472092)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.96/0.82 % (3472092)CaDiCaL version: 2.1.3
% 1.96/0.82 % (3472092)Termination reason: Instruction limit
% 1.96/0.82 % (3472092)Termination phase: Saturation
% 1.96/0.82 % (3472092)Time elapsed: 0.068 s
% 1.96/0.82 % (3472092)Peak memory usage: 12 MB
% 1.96/0.82 % (3472092)Instructions burned: 103 (million)
% 1.96/0.82 % (3472094)Instruction limit reached!
% 1.96/0.82 % (3472094)------------------------------
% 1.96/0.82 % (3472094)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.96/0.82 % (3472094)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.96/0.82 % (3472094)CaDiCaL version: 2.1.3
% 1.96/0.82 % (3472094)Termination reason: Instruction limit
% 1.96/0.82 % (3472094)Termination phase: Saturation
% 1.96/0.82 % (3472094)Time elapsed: 0.083 s
% 1.96/0.82 % (3472094)Peak memory usage: 13 MB
% 1.96/0.82 % (3472094)Instructions burned: 132 (million)
% 1.96/0.82 % TRYING [7]
% 1.96/0.82 % TRYING [7]
% 1.96/0.82 % (3472105)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=2369763915:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 1.96/0.82 % (3472106)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=2786424467:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 1.96/0.82 % (3472095)Instruction limit reached!
% 1.96/0.82 % (3472095)------------------------------
% 1.96/0.82 % (3472095)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.96/0.82 % (3472095)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.96/0.82 % (3472095)CaDiCaL version: 2.1.3
% 1.96/0.82 % (3472095)Termination reason: Instruction limit
% 1.96/0.82 % (3472095)Termination phase: Saturation
% 1.96/0.82 % (3472095)Time elapsed: 0.105 s
% 1.96/0.82 % (3472095)Peak memory usage: 14 MB
% 1.96/0.82 % (3472095)Instructions burned: 160 (million)
% 1.96/0.82 % (3472109)ott-21_1_sil=16000:fs=off:random_seed=133283466:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 1.96/0.82 % TRYING [8]
% 1.96/0.82 % (3472105)Instruction limit reached!
% 1.96/0.82 % (3472105)------------------------------
% 1.96/0.82 % (3472105)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.96/0.82 % (3472105)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.96/0.82 % (3472105)CaDiCaL version: 2.1.3
% 1.96/0.82 % (3472105)Termination reason: Instruction limit
% 1.96/0.82 % (3472105)Termination phase: Saturation
% 1.96/0.82 % (3472105)Time elapsed: 0.092 s
% 1.96/0.82 % (3472105)Peak memory usage: 14 MB
% 1.96/0.82 % (3472105)Instructions burned: 132 (million)
% 1.96/0.82 % (3472103)Instruction limit reached!
% 1.96/0.82 % (3472103)------------------------------
% 1.96/0.82 % (3472103)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.96/0.82 % (3472103)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.96/0.82 % (3472103)CaDiCaL version: 2.1.3
% 1.96/0.82 % (3472103)Termination reason: Instruction limit
% 1.96/0.82 % (3472103)Termination phase: Finite model building constraint generation
% 1.96/0.82 % (3472103)Time elapsed: 0.155 s
% 1.96/0.82 % (3472103)Peak memory usage: 28 MB
% 1.96/0.82 % (3472103)Instructions burned: 715 (million)
% 1.96/0.82 % (3472111)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=144573690:i=477:bd=all_2997 on theBenchmark for (2997ds/477Mi)
% 1.96/0.82 % (3472112)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=2089332776:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 1.96/0.82 % Detected minimum model sizes of [4]
% 1.96/0.82 % Detected maximum model sizes of [max]
% 1.96/0.82 % TRYING [4]
% 1.96/0.82 % TRYING [5]
% 1.96/0.82 % (3472109)Instruction limit reached!
% 1.96/0.82 % (3472109)------------------------------
% 1.96/0.82 % (3472109)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.96/0.82 % (3472109)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.96/0.82 % (3472109)CaDiCaL version: 2.1.3
% 1.96/0.82 % (3472109)Termination reason: Instruction limit
% 1.96/0.82 % (3472109)Termination phase: Saturation
% 1.96/0.82 % (3472109)Time elapsed: 0.095 s
% 1.96/0.82 % (3472109)Peak memory usage: 13 MB
% 1.96/0.82 % (3472109)Instructions burned: 181 (million)
% 1.96/0.82 % (3472115)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=2535713406:i=1179_2997 on theBenchmark for (2997ds/1179Mi)
% 1.96/0.82 % TRYING [6]
% 1.96/0.82 % TRYING [8]
% 1.96/0.82 % TRYING [7]
% 1.96/0.82 % (3472115) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3472084-3472115"...
% 1.96/0.82 % (3472115)...printing done.
% 1.96/0.82 % (3472115)Refutation found. Thanks to Tanya!
% 1.96/0.82 % SZS status Theorem for theBenchmark
% 1.96/0.82 % SZS output start Proof for theBenchmark
% See solution above
% 1.96/0.82 % (3472115)------------------------------
% 1.96/0.82 % (3472115)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.96/0.82 % (3472115)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.96/0.82 % (3472115)CaDiCaL version: 2.1.3
% 1.96/0.82 % (3472115)Termination reason: Refutation
% 1.96/0.82 % (3472115)Time elapsed: 0.099 s
% 1.96/0.82 % (3472115)Peak memory usage: 14 MB
% 1.96/0.82 % (3472115)Instructions burned: 147 (million)
% 1.96/0.82 % (3472084)Success in time 0.387 s
% 1.96/0.82 % Vampire exiting
%------------------------------------------------------------------------------