%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : PRO009+1 : 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 : n018.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:36 PM UTC 2026
% Result : Theorem 2.85s 0.92s
% Output : Refutation 2.85s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 21
% Syntax : Number of formulae : 157 ( 14 unt; 6 def)
% Number of atoms : 603 ( 34 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 745 ( 299 ~; 320 |; 100 &)
% ( 14 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 21 ( 19 usr; 7 prp; 0-3 aty)
% Number of functors : 17 ( 17 usr; 6 con; 0-3 aty)
% Number of variables : 252 ( 0 sgn 215 !; 37 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0,X1,X2] :
( ( occurrence_of(X0,X1)
& occurrence_of(X0,X2) )
=> X1 = X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_02) ).
fof(f8,axiom,
! [X0,X1] :
( occurrence_of(X0,X1)
=> ( arboreal(X0)
<=> atomic(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_07) ).
fof(f9,axiom,
! [X0] :
( legal(X0)
=> arboreal(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_08) ).
fof(f12,axiom,
! [X0,X1,X2] :
( min_precedes(X1,X2,X0)
=> ? [X3,X4] :
( subactivity(X3,X0)
& subactivity(X4,X0)
& atocc(X1,X3)
& atocc(X2,X4) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_11) ).
fof(f13,axiom,
! [X0,X1] :
( root(X1,X0)
=> ? [X2] :
( subactivity(X2,X0)
& atocc(X1,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_12) ).
fof(f15,axiom,
! [X0,X1,X2] :
( min_precedes(X0,X1,X2)
=> ~ root(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_14) ).
fof(f17,axiom,
! [X0,X1] :
( root(X0,X1)
=> legal(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_16) ).
fof(f22,axiom,
! [X0,X1] :
( leaf(X0,X1)
<=> ( ( root(X0,X1)
| ? [X2] : min_precedes(X2,X0,X1) )
& ~ ? [X3] : min_precedes(X0,X3,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_21) ).
fof(f23,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_22) ).
fof(f24,axiom,
! [X0,X1] :
( atocc(X0,X1)
<=> ? [X2] :
( subactivity(X1,X2)
& atomic(X2)
& occurrence_of(X0,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_23) ).
fof(f29,axiom,
! [X0,X1,X2,X3] :
( ( occurrence_of(X1,X0)
& arboreal(X2)
& arboreal(X3)
& subactivity_occurrence(X2,X1)
& subactivity_occurrence(X3,X1) )
=> ( min_precedes(X2,X3,X0)
| min_precedes(X3,X2,X0)
| X2 = X3 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_28) ).
fof(f34,axiom,
! [X0,X1] :
( root_occ(X0,X1)
<=> ? [X2] :
( occurrence_of(X1,X2)
& subactivity_occurrence(X0,X1)
& root(X0,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_33) ).
fof(f35,axiom,
! [X0,X1] :
( leaf_occ(X0,X1)
<=> ? [X2] :
( occurrence_of(X1,X2)
& subactivity_occurrence(X0,X1)
& leaf(X0,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_34) ).
fof(f36,axiom,
! [X0] :
( occurrence_of(X0,tptp0)
=> ? [X1,X2,X3] :
( occurrence_of(X1,tptp3)
& root_occ(X1,X0)
& occurrence_of(X2,tptp4)
& next_subocc(X1,X2,tptp0)
& ( occurrence_of(X3,tptp2)
| occurrence_of(X3,tptp1) )
& next_subocc(X2,X3,tptp0)
& leaf_occ(X3,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_35) ).
fof(f49,conjecture,
! [X0] :
( occurrence_of(X0,tptp0)
=> ? [X1,X2] :
( occurrence_of(X1,tptp3)
& root_occ(X1,X0)
& ( occurrence_of(X2,tptp2)
| occurrence_of(X2,tptp1) )
& min_precedes(X1,X2,tptp0)
& leaf_occ(X2,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(f50,negated_conjecture,
~ ! [X0] :
( occurrence_of(X0,tptp0)
=> ? [X1,X2] :
( occurrence_of(X1,tptp3)
& root_occ(X1,X0)
& ( occurrence_of(X2,tptp2)
| occurrence_of(X2,tptp1) )
& min_precedes(X1,X2,tptp0)
& leaf_occ(X2,X0) ) ),
inference(negated_conjecture,[status(cth)],[f49]) ).
fof(f51,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(unused_predicate_definition_removal,[],[f23]) ).
fof(f54,plain,
! [X0,X1,X2] :
( X1 = X2
| ~ occurrence_of(X0,X1)
| ~ occurrence_of(X0,X2) ),
inference(ennf_transformation,[],[f3]) ).
fof(f55,plain,
! [X0,X1,X2] :
( X1 = X2
| ~ occurrence_of(X0,X1)
| ~ occurrence_of(X0,X2) ),
inference(flattening,[],[f54]) ).
fof(f62,plain,
! [X0,X1] :
( ( arboreal(X0)
<=> atomic(X1) )
| ~ occurrence_of(X0,X1) ),
inference(ennf_transformation,[],[f8]) ).
fof(f63,plain,
! [X0] :
( arboreal(X0)
| ~ legal(X0) ),
inference(ennf_transformation,[],[f9]) ).
fof(f66,plain,
! [X0,X1,X2] :
( ? [X3,X4] :
( subactivity(X3,X0)
& subactivity(X4,X0)
& atocc(X1,X3)
& atocc(X2,X4) )
| ~ min_precedes(X1,X2,X0) ),
inference(ennf_transformation,[],[f12]) ).
fof(f67,plain,
! [X0,X1] :
( ? [X2] :
( subactivity(X2,X0)
& atocc(X1,X2) )
| ~ root(X1,X0) ),
inference(ennf_transformation,[],[f13]) ).
fof(f69,plain,
! [X0,X1,X2] :
( ~ root(X1,X2)
| ~ min_precedes(X0,X1,X2) ),
inference(ennf_transformation,[],[f15]) ).
fof(f71,plain,
! [X0,X1] :
( legal(X0)
| ~ root(X0,X1) ),
inference(ennf_transformation,[],[f17]) ).
fof(f79,plain,
! [X0,X1] :
( leaf(X0,X1)
<=> ( ( root(X0,X1)
| ? [X2] : min_precedes(X2,X0,X1) )
& ! [X3] : ~ min_precedes(X0,X3,X1) ) ),
inference(ennf_transformation,[],[f22]) ).
fof(f80,plain,
! [X0,X1,X2] :
( ( min_precedes(X0,X1,X2)
& ! [X3] :
( ~ min_precedes(X0,X3,X2)
| ~ min_precedes(X3,X1,X2) ) )
| ~ next_subocc(X0,X1,X2) ),
inference(ennf_transformation,[],[f51]) ).
fof(f87,plain,
! [X0,X1,X2,X3] :
( min_precedes(X2,X3,X0)
| min_precedes(X3,X2,X0)
| X2 = X3
| ~ occurrence_of(X1,X0)
| ~ arboreal(X2)
| ~ arboreal(X3)
| ~ subactivity_occurrence(X2,X1)
| ~ subactivity_occurrence(X3,X1) ),
inference(ennf_transformation,[],[f29]) ).
fof(f88,plain,
! [X0,X1,X2,X3] :
( min_precedes(X2,X3,X0)
| min_precedes(X3,X2,X0)
| X2 = X3
| ~ occurrence_of(X1,X0)
| ~ arboreal(X2)
| ~ arboreal(X3)
| ~ subactivity_occurrence(X2,X1)
| ~ subactivity_occurrence(X3,X1) ),
inference(flattening,[],[f87]) ).
fof(f97,plain,
! [X0] :
( ? [X1,X2,X3] :
( occurrence_of(X1,tptp3)
& root_occ(X1,X0)
& occurrence_of(X2,tptp4)
& next_subocc(X1,X2,tptp0)
& ( occurrence_of(X3,tptp2)
| occurrence_of(X3,tptp1) )
& next_subocc(X2,X3,tptp0)
& leaf_occ(X3,X0) )
| ~ occurrence_of(X0,tptp0) ),
inference(ennf_transformation,[],[f36]) ).
fof(f98,plain,
? [X0] :
( ! [X1,X2] :
( ~ occurrence_of(X1,tptp3)
| ~ root_occ(X1,X0)
| ( ~ occurrence_of(X2,tptp2)
& ~ occurrence_of(X2,tptp1) )
| ~ min_precedes(X1,X2,tptp0)
| ~ leaf_occ(X2,X0) )
& occurrence_of(X0,tptp0) ),
inference(ennf_transformation,[],[f50]) ).
fof(f100,plain,
! [X0,X1] :
( ( ( arboreal(X0)
| ~ atomic(X1) )
& ( atomic(X1)
| ~ arboreal(X0) ) )
| ~ occurrence_of(X0,X1) ),
inference(nnf_transformation,[],[f62]) ).
fof(f103,plain,
! [X0,X1,X2] :
( ( subactivity(sK1(X0,X1,X2),X0)
& subactivity(sK2(X0,X1,X2),X0)
& atocc(X1,sK1(X0,X1,X2))
& atocc(X2,sK2(X0,X1,X2)) )
| ~ min_precedes(X1,X2,X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2]),skolemize(X3,sK1(X0,X1,X2)),skolemize(X4,sK2(X0,X1,X2))],[f66]) ).
fof(f104,plain,
! [X0,X1] :
( ( subactivity(sK3(X0,X1),X0)
& atocc(X1,sK3(X0,X1)) )
| ~ root(X1,X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(X2,sK3(X0,X1))],[f67]) ).
fof(f106,plain,
! [X0,X1] :
( ( leaf(X0,X1)
| ( ~ root(X0,X1)
& ! [X2] : ~ min_precedes(X2,X0,X1) )
| ? [X3] : min_precedes(X0,X3,X1) )
& ( ( ( root(X0,X1)
| ? [X2] : min_precedes(X2,X0,X1) )
& ! [X3] : ~ min_precedes(X0,X3,X1) )
| ~ leaf(X0,X1) ) ),
inference(nnf_transformation,[],[f79]) ).
fof(f107,plain,
! [X0,X1] :
( ( leaf(X0,X1)
| ( ~ root(X0,X1)
& ! [X2] : ~ min_precedes(X2,X0,X1) )
| ? [X3] : min_precedes(X0,X3,X1) )
& ( ( ( root(X0,X1)
| ? [X2] : min_precedes(X2,X0,X1) )
& ! [X3] : ~ min_precedes(X0,X3,X1) )
| ~ leaf(X0,X1) ) ),
inference(flattening,[],[f106]) ).
fof(f108,plain,
! [X0,X1] :
( ( leaf(X0,X1)
| ( ~ root(X0,X1)
& ! [X2] : ~ min_precedes(X2,X0,X1) )
| ? [X3] : min_precedes(X0,X3,X1) )
& ( ( ( root(X0,X1)
| ? [X4] : min_precedes(X4,X0,X1) )
& ! [X5] : ~ min_precedes(X0,X5,X1) )
| ~ leaf(X0,X1) ) ),
inference(rectify,[],[f107]) ).
fof(f109,plain,
! [X0,X1] :
( ( leaf(X0,X1)
| ( ~ root(X0,X1)
& ! [X2] : ~ min_precedes(X2,X0,X1) )
| min_precedes(X0,sK5(X0,X1),X1) )
& ( ( ( root(X0,X1)
| min_precedes(sK6(X0,X1),X0,X1) )
& ! [X5] : ~ min_precedes(X0,X5,X1) )
| ~ leaf(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5,sK6]),skolemize(X3,sK5(X0,X1)),skolemize(X4,sK6(X0,X1))],[f108]) ).
fof(f110,plain,
! [X0,X1] :
( ( atocc(X0,X1)
| ! [X2] :
( ~ subactivity(X1,X2)
| ~ atomic(X2)
| ~ occurrence_of(X0,X2) ) )
& ( ? [X2] :
( subactivity(X1,X2)
& atomic(X2)
& occurrence_of(X0,X2) )
| ~ atocc(X0,X1) ) ),
inference(nnf_transformation,[],[f24]) ).
fof(f111,plain,
! [X0,X1] :
( ( atocc(X0,X1)
| ! [X2] :
( ~ subactivity(X1,X2)
| ~ atomic(X2)
| ~ occurrence_of(X0,X2) ) )
& ( ? [X3] :
( subactivity(X1,X3)
& atomic(X3)
& occurrence_of(X0,X3) )
| ~ atocc(X0,X1) ) ),
inference(rectify,[],[f110]) ).
fof(f112,plain,
! [X0,X1] :
( ( atocc(X0,X1)
| ! [X2] :
( ~ subactivity(X1,X2)
| ~ atomic(X2)
| ~ occurrence_of(X0,X2) ) )
& ( ( subactivity(X1,sK7(X0,X1))
& atomic(sK7(X0,X1))
& occurrence_of(X0,sK7(X0,X1)) )
| ~ atocc(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK7]),skolemize(X3,sK7(X0,X1))],[f111]) ).
fof(f117,plain,
! [X0,X1] :
( ( root_occ(X0,X1)
| ! [X2] :
( ~ occurrence_of(X1,X2)
| ~ subactivity_occurrence(X0,X1)
| ~ root(X0,X2) ) )
& ( ? [X2] :
( occurrence_of(X1,X2)
& subactivity_occurrence(X0,X1)
& root(X0,X2) )
| ~ root_occ(X0,X1) ) ),
inference(nnf_transformation,[],[f34]) ).
fof(f118,plain,
! [X0,X1] :
( ( root_occ(X0,X1)
| ! [X2] :
( ~ occurrence_of(X1,X2)
| ~ subactivity_occurrence(X0,X1)
| ~ root(X0,X2) ) )
& ( ? [X3] :
( occurrence_of(X1,X3)
& subactivity_occurrence(X0,X1)
& root(X0,X3) )
| ~ root_occ(X0,X1) ) ),
inference(rectify,[],[f117]) ).
fof(f119,plain,
! [X0,X1] :
( ( root_occ(X0,X1)
| ! [X2] :
( ~ occurrence_of(X1,X2)
| ~ subactivity_occurrence(X0,X1)
| ~ root(X0,X2) ) )
& ( ( occurrence_of(X1,sK12(X0,X1))
& subactivity_occurrence(X0,X1)
& root(X0,sK12(X0,X1)) )
| ~ root_occ(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK12]),skolemize(X3,sK12(X0,X1))],[f118]) ).
fof(f120,plain,
! [X0,X1] :
( ( leaf_occ(X0,X1)
| ! [X2] :
( ~ occurrence_of(X1,X2)
| ~ subactivity_occurrence(X0,X1)
| ~ leaf(X0,X2) ) )
& ( ? [X2] :
( occurrence_of(X1,X2)
& subactivity_occurrence(X0,X1)
& leaf(X0,X2) )
| ~ leaf_occ(X0,X1) ) ),
inference(nnf_transformation,[],[f35]) ).
fof(f121,plain,
! [X0,X1] :
( ( leaf_occ(X0,X1)
| ! [X2] :
( ~ occurrence_of(X1,X2)
| ~ subactivity_occurrence(X0,X1)
| ~ leaf(X0,X2) ) )
& ( ? [X3] :
( occurrence_of(X1,X3)
& subactivity_occurrence(X0,X1)
& leaf(X0,X3) )
| ~ leaf_occ(X0,X1) ) ),
inference(rectify,[],[f120]) ).
fof(f122,plain,
! [X0,X1] :
( ( leaf_occ(X0,X1)
| ! [X2] :
( ~ occurrence_of(X1,X2)
| ~ subactivity_occurrence(X0,X1)
| ~ leaf(X0,X2) ) )
& ( ( occurrence_of(X1,sK13(X0,X1))
& subactivity_occurrence(X0,X1)
& leaf(X0,sK13(X0,X1)) )
| ~ leaf_occ(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK13]),skolemize(X3,sK13(X0,X1))],[f121]) ).
fof(f123,plain,
! [X0] :
( ( occurrence_of(sK14(X0),tptp3)
& root_occ(sK14(X0),X0)
& occurrence_of(sK15(X0),tptp4)
& next_subocc(sK14(X0),sK15(X0),tptp0)
& ( occurrence_of(sK16(X0),tptp2)
| occurrence_of(sK16(X0),tptp1) )
& next_subocc(sK15(X0),sK16(X0),tptp0)
& leaf_occ(sK16(X0),X0) )
| ~ occurrence_of(X0,tptp0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK14,sK15,sK16]),skolemize(X1,sK14(X0)),skolemize(X2,sK15(X0)),skolemize(X3,sK16(X0))],[f97]) ).
fof(f124,plain,
( ! [X1,X2] :
( ~ occurrence_of(X1,tptp3)
| ~ root_occ(X1,sK17)
| ( ~ occurrence_of(X2,tptp2)
& ~ occurrence_of(X2,tptp1) )
| ~ min_precedes(X1,X2,tptp0)
| ~ leaf_occ(X2,sK17) )
& occurrence_of(sK17,tptp0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK17]),skolemize(X0,sK17)],[f98]) ).
fof(f129,plain,
! [X2,X0,X1] :
( ~ occurrence_of(X0,X2)
| ~ occurrence_of(X0,X1)
| X1 = X2 ),
inference(cnf_transformation,[],[f55]) ).
fof(f135,plain,
! [X0,X1] :
( ~ occurrence_of(X0,X1)
| ~ atomic(X1)
| arboreal(X0) ),
inference(cnf_transformation,[],[f100]) ).
fof(f136,plain,
! [X0] :
( ~ legal(X0)
| arboreal(X0) ),
inference(cnf_transformation,[],[f63]) ).
fof(f141,plain,
! [X2,X0,X1] :
( atocc(X2,sK2(X0,X1,X2))
| ~ min_precedes(X1,X2,X0) ),
inference(cnf_transformation,[],[f103]) ).
fof(f145,plain,
! [X0,X1] :
( atocc(X1,sK3(X0,X1))
| ~ root(X1,X0) ),
inference(cnf_transformation,[],[f104]) ).
fof(f149,plain,
! [X2,X0,X1] :
( ~ min_precedes(X0,X1,X2)
| ~ root(X1,X2) ),
inference(cnf_transformation,[],[f69]) ).
fof(f151,plain,
! [X0,X1] :
( ~ root(X0,X1)
| legal(X0) ),
inference(cnf_transformation,[],[f71]) ).
fof(f157,plain,
! [X0,X1] :
( min_precedes(sK6(X0,X1),X0,X1)
| root(X0,X1)
| ~ leaf(X0,X1) ),
inference(cnf_transformation,[],[f109]) ).
fof(f161,plain,
! [X2,X0,X1] :
( ~ next_subocc(X0,X1,X2)
| min_precedes(X0,X1,X2) ),
inference(cnf_transformation,[],[f80]) ).
fof(f162,plain,
! [X0,X1] :
( occurrence_of(X0,sK7(X0,X1))
| ~ atocc(X0,X1) ),
inference(cnf_transformation,[],[f112]) ).
fof(f163,plain,
! [X0,X1] :
( atomic(sK7(X0,X1))
| ~ atocc(X0,X1) ),
inference(cnf_transformation,[],[f112]) ).
fof(f175,plain,
! [X2,X3,X0,X1] :
( ~ subactivity_occurrence(X3,X1)
| min_precedes(X3,X2,X0)
| X2 = X3
| ~ occurrence_of(X1,X0)
| ~ arboreal(X2)
| ~ arboreal(X3)
| ~ subactivity_occurrence(X2,X1)
| min_precedes(X2,X3,X0) ),
inference(cnf_transformation,[],[f88]) ).
fof(f181,plain,
! [X0,X1] :
( root(X0,sK12(X0,X1))
| ~ root_occ(X0,X1) ),
inference(cnf_transformation,[],[f119]) ).
fof(f182,plain,
! [X0,X1] :
( ~ root_occ(X0,X1)
| subactivity_occurrence(X0,X1) ),
inference(cnf_transformation,[],[f119]) ).
fof(f183,plain,
! [X0,X1] :
( occurrence_of(X1,sK12(X0,X1))
| ~ root_occ(X0,X1) ),
inference(cnf_transformation,[],[f119]) ).
fof(f185,plain,
! [X0,X1] :
( leaf(X0,sK13(X0,X1))
| ~ leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f122]) ).
fof(f186,plain,
! [X0,X1] :
( ~ leaf_occ(X0,X1)
| subactivity_occurrence(X0,X1) ),
inference(cnf_transformation,[],[f122]) ).
fof(f189,plain,
! [X0] :
( leaf_occ(sK16(X0),X0)
| ~ occurrence_of(X0,tptp0) ),
inference(cnf_transformation,[],[f123]) ).
fof(f190,plain,
! [X0] :
( next_subocc(sK15(X0),sK16(X0),tptp0)
| ~ occurrence_of(X0,tptp0) ),
inference(cnf_transformation,[],[f123]) ).
fof(f191,plain,
! [X0] :
( occurrence_of(sK16(X0),tptp1)
| occurrence_of(sK16(X0),tptp2)
| ~ occurrence_of(X0,tptp0) ),
inference(cnf_transformation,[],[f123]) ).
fof(f194,plain,
! [X0] :
( root_occ(sK14(X0),X0)
| ~ occurrence_of(X0,tptp0) ),
inference(cnf_transformation,[],[f123]) ).
fof(f195,plain,
! [X0] :
( occurrence_of(sK14(X0),tptp3)
| ~ occurrence_of(X0,tptp0) ),
inference(cnf_transformation,[],[f123]) ).
fof(f208,plain,
occurrence_of(sK17,tptp0),
inference(cnf_transformation,[],[f124]) ).
fof(f209,plain,
! [X2,X1] :
( ~ min_precedes(X1,X2,tptp0)
| ~ root_occ(X1,sK17)
| ~ occurrence_of(X2,tptp1)
| ~ occurrence_of(X1,tptp3)
| ~ leaf_occ(X2,sK17) ),
inference(cnf_transformation,[],[f124]) ).
fof(f210,plain,
! [X2,X1] :
( ~ min_precedes(X1,X2,tptp0)
| ~ root_occ(X1,sK17)
| ~ occurrence_of(X2,tptp2)
| ~ occurrence_of(X1,tptp3)
| ~ leaf_occ(X2,sK17) ),
inference(cnf_transformation,[],[f124]) ).
fof(f533,plain,
! [X0,X1] :
( ~ atocc(X0,X1)
| ~ atomic(sK7(X0,X1))
| arboreal(X0) ),
inference(resolution,[],[f162,f135]) ).
fof(f536,plain,
! [X0,X1] :
( ~ atocc(X0,X1)
| arboreal(X0) ),
inference(forward_subsumption_resolution,[],[f533,f163]) ).
fof(f576,plain,
! [X0,X1] :
( ~ root(X0,X1)
| arboreal(X0) ),
inference(resolution,[],[f145,f536]) ).
fof(f616,plain,
! [X0,X1] :
( ~ root_occ(X0,X1)
| legal(X0) ),
inference(resolution,[],[f181,f151]) ).
fof(f689,plain,
! [X0] :
( ~ occurrence_of(sK17,X0)
| tptp0 = X0 ),
inference(resolution,[],[f129,f208]) ).
fof(f700,plain,
! [X0] :
( ~ root_occ(X0,sK17)
| tptp0 = sK12(X0,sK17) ),
inference(resolution,[],[f689,f183]) ).
fof(f1109,plain,
! [X0] :
( ~ occurrence_of(X0,tptp0)
| legal(sK14(X0)) ),
inference(resolution,[],[f194,f616]) ).
fof(f1114,plain,
legal(sK14(sK17)),
inference(resolution,[],[f1109,f208]) ).
fof(f1216,plain,
arboreal(sK14(sK17)),
inference(resolution,[],[f1114,f136]) ).
fof(f2030,plain,
! [X2,X0,X1] :
( ~ min_precedes(X0,X1,X2)
| arboreal(X1) ),
inference(resolution,[],[f141,f536]) ).
fof(f2378,plain,
( tptp0 = sK12(sK14(sK17),sK17)
| ~ occurrence_of(sK17,tptp0) ),
inference(resolution,[],[f700,f194]) ).
fof(f2379,plain,
tptp0 = sK12(sK14(sK17),sK17),
inference(forward_subsumption_resolution,[],[f2378,f208]) ).
fof(f2391,plain,
( root(sK14(sK17),tptp0)
| ~ root_occ(sK14(sK17),sK17) ),
inference(superposition,[],[f181,f2379]) ).
fof(f2393,definition,
( spl18_105
<=> root_occ(sK14(sK17),sK17) ),
introduced(definition,[new_symbols(definition,[spl18_105])],[avatar_definition]) ).
fof(f2394,plain,
( root_occ(sK14(sK17),sK17)
| ~ spl18_105 ),
inference(avatar_component_clause,[],[f2393]) ).
fof(f2395,plain,
( ~ root_occ(sK14(sK17),sK17)
| spl18_105 ),
inference(avatar_component_clause,[],[f2393]) ).
fof(f2397,definition,
( spl18_106
<=> root(sK14(sK17),tptp0) ),
introduced(definition,[new_symbols(definition,[spl18_106])],[avatar_definition]) ).
fof(f2399,plain,
( root(sK14(sK17),tptp0)
| ~ spl18_106 ),
inference(avatar_component_clause,[],[f2397]) ).
fof(f2400,plain,
( ~ spl18_105
| spl18_106 ),
inference(avatar_split_clause,[],[f2391,f2397,f2393]) ).
fof(f2402,plain,
( ~ occurrence_of(sK17,tptp0)
| spl18_105 ),
inference(resolution,[],[f2395,f194]) ).
fof(f2403,plain,
( $false
| spl18_105 ),
inference(forward_subsumption_resolution,[],[f2402,f208]) ).
fof(f2404,plain,
spl18_105,
inference(avatar_contradiction_clause,[],[f2403]) ).
fof(f2409,plain,
( subactivity_occurrence(sK14(sK17),sK17)
| ~ spl18_105 ),
inference(resolution,[],[f2394,f182]) ).
fof(f3364,plain,
! [X0,X1] :
( root(X0,X1)
| ~ leaf(X0,X1)
| arboreal(X0) ),
inference(resolution,[],[f157,f2030]) ).
fof(f3373,plain,
! [X0,X1] :
( ~ leaf(X0,X1)
| arboreal(X0) ),
inference(forward_subsumption_resolution,[],[f3364,f576]) ).
fof(f3873,definition,
( spl18_146
<=> leaf_occ(sK16(sK17),sK17) ),
introduced(definition,[new_symbols(definition,[spl18_146])],[avatar_definition]) ).
fof(f3874,plain,
( leaf_occ(sK16(sK17),sK17)
| ~ spl18_146 ),
inference(avatar_component_clause,[],[f3873]) ).
fof(f3875,plain,
( ~ leaf_occ(sK16(sK17),sK17)
| spl18_146 ),
inference(avatar_component_clause,[],[f3873]) ).
fof(f3881,plain,
( ~ occurrence_of(sK17,tptp0)
| spl18_146 ),
inference(resolution,[],[f3875,f189]) ).
fof(f3882,plain,
( $false
| spl18_146 ),
inference(forward_subsumption_resolution,[],[f3881,f208]) ).
fof(f3883,plain,
spl18_146,
inference(avatar_contradiction_clause,[],[f3882]) ).
fof(f5282,plain,
! [X0,X1] :
( ~ leaf_occ(X0,X1)
| arboreal(X0) ),
inference(resolution,[],[f3373,f185]) ).
fof(f5674,plain,
( ! [X0,X1] :
( min_precedes(sK14(sK17),X0,X1)
| sK14(sK17) = X0
| ~ occurrence_of(sK17,X1)
| ~ arboreal(X0)
| ~ arboreal(sK14(sK17))
| ~ subactivity_occurrence(X0,sK17)
| min_precedes(X0,sK14(sK17),X1) )
| ~ spl18_105 ),
inference(resolution,[],[f175,f2409]) ).
fof(f5677,plain,
( ! [X0,X1] :
( min_precedes(sK14(sK17),X0,X1)
| min_precedes(X0,sK14(sK17),X1)
| ~ occurrence_of(sK17,X1)
| ~ arboreal(X0)
| ~ subactivity_occurrence(X0,sK17)
| sK14(sK17) = X0 )
| ~ spl18_105 ),
inference(forward_subsumption_resolution,[],[f5674,f1216]) ).
fof(f7602,plain,
( ! [X0] :
( min_precedes(X0,sK14(sK17),tptp0)
| ~ occurrence_of(sK17,tptp0)
| ~ arboreal(X0)
| ~ subactivity_occurrence(X0,sK17)
| sK14(sK17) = X0
| ~ root_occ(sK14(sK17),sK17)
| ~ occurrence_of(X0,tptp2)
| ~ occurrence_of(sK14(sK17),tptp3)
| ~ leaf_occ(X0,sK17) )
| ~ spl18_105 ),
inference(resolution,[],[f5677,f210]) ).
fof(f7603,plain,
( ! [X0] :
( min_precedes(X0,sK14(sK17),tptp0)
| ~ occurrence_of(sK17,tptp0)
| ~ arboreal(X0)
| ~ subactivity_occurrence(X0,sK17)
| sK14(sK17) = X0
| ~ root_occ(sK14(sK17),sK17)
| ~ occurrence_of(X0,tptp1)
| ~ occurrence_of(sK14(sK17),tptp3)
| ~ leaf_occ(X0,sK17) )
| ~ spl18_105 ),
inference(resolution,[],[f5677,f209]) ).
fof(f7621,plain,
( ! [X0] :
( min_precedes(X0,sK14(sK17),tptp0)
| ~ occurrence_of(sK17,tptp0)
| ~ arboreal(X0)
| ~ subactivity_occurrence(X0,sK17)
| sK14(sK17) = X0
| ~ occurrence_of(X0,tptp1)
| ~ occurrence_of(sK14(sK17),tptp3)
| ~ leaf_occ(X0,sK17) )
| ~ spl18_105 ),
inference(forward_subsumption_resolution,[],[f7603,f194]) ).
fof(f7622,plain,
( ! [X0] :
( min_precedes(X0,sK14(sK17),tptp0)
| ~ occurrence_of(sK17,tptp0)
| ~ arboreal(X0)
| ~ subactivity_occurrence(X0,sK17)
| sK14(sK17) = X0
| ~ occurrence_of(X0,tptp2)
| ~ occurrence_of(sK14(sK17),tptp3)
| ~ leaf_occ(X0,sK17) )
| ~ spl18_105 ),
inference(forward_subsumption_resolution,[],[f7602,f194]) ).
fof(f7627,plain,
( ! [X0] :
( min_precedes(X0,sK14(sK17),tptp0)
| ~ occurrence_of(sK17,tptp0)
| ~ arboreal(X0)
| ~ subactivity_occurrence(X0,sK17)
| sK14(sK17) = X0
| ~ occurrence_of(X0,tptp1)
| ~ leaf_occ(X0,sK17) )
| ~ spl18_105 ),
inference(forward_subsumption_resolution,[],[f7621,f195]) ).
fof(f7628,plain,
( ! [X0] :
( min_precedes(X0,sK14(sK17),tptp0)
| ~ occurrence_of(sK17,tptp0)
| ~ arboreal(X0)
| ~ subactivity_occurrence(X0,sK17)
| sK14(sK17) = X0
| ~ occurrence_of(X0,tptp2)
| ~ leaf_occ(X0,sK17) )
| ~ spl18_105 ),
inference(forward_subsumption_resolution,[],[f7622,f195]) ).
fof(f7631,plain,
( ! [X0] :
( min_precedes(X0,sK14(sK17),tptp0)
| ~ occurrence_of(sK17,tptp0)
| ~ subactivity_occurrence(X0,sK17)
| sK14(sK17) = X0
| ~ occurrence_of(X0,tptp1)
| ~ leaf_occ(X0,sK17) )
| ~ spl18_105 ),
inference(forward_subsumption_resolution,[],[f7627,f5282]) ).
fof(f7632,plain,
( ! [X0] :
( min_precedes(X0,sK14(sK17),tptp0)
| ~ occurrence_of(sK17,tptp0)
| ~ subactivity_occurrence(X0,sK17)
| sK14(sK17) = X0
| ~ occurrence_of(X0,tptp2)
| ~ leaf_occ(X0,sK17) )
| ~ spl18_105 ),
inference(forward_subsumption_resolution,[],[f7628,f5282]) ).
fof(f7635,plain,
( ! [X0] :
( min_precedes(X0,sK14(sK17),tptp0)
| ~ occurrence_of(sK17,tptp0)
| sK14(sK17) = X0
| ~ occurrence_of(X0,tptp1)
| ~ leaf_occ(X0,sK17) )
| ~ spl18_105 ),
inference(forward_subsumption_resolution,[],[f7631,f186]) ).
fof(f7636,plain,
( ! [X0] :
( min_precedes(X0,sK14(sK17),tptp0)
| ~ occurrence_of(sK17,tptp0)
| sK14(sK17) = X0
| ~ occurrence_of(X0,tptp2)
| ~ leaf_occ(X0,sK17) )
| ~ spl18_105 ),
inference(forward_subsumption_resolution,[],[f7632,f186]) ).
fof(f7637,plain,
( ! [X0] :
( min_precedes(X0,sK14(sK17),tptp0)
| sK14(sK17) = X0
| ~ occurrence_of(X0,tptp1)
| ~ leaf_occ(X0,sK17) )
| ~ spl18_105 ),
inference(forward_subsumption_resolution,[],[f7635,f208]) ).
fof(f7638,plain,
( ! [X0] :
( min_precedes(X0,sK14(sK17),tptp0)
| sK14(sK17) = X0
| ~ occurrence_of(X0,tptp2)
| ~ leaf_occ(X0,sK17) )
| ~ spl18_105 ),
inference(forward_subsumption_resolution,[],[f7636,f208]) ).
fof(f8455,plain,
( ! [X0] :
( sK14(sK17) = X0
| ~ occurrence_of(X0,tptp2)
| ~ leaf_occ(X0,sK17)
| ~ root(sK14(sK17),tptp0) )
| ~ spl18_105 ),
inference(resolution,[],[f7638,f149]) ).
fof(f8466,plain,
( ! [X0] :
( ~ leaf_occ(X0,sK17)
| ~ occurrence_of(X0,tptp2)
| sK14(sK17) = X0 )
| ~ spl18_105
| ~ spl18_106 ),
inference(forward_subsumption_resolution,[],[f8455,f2399]) ).
fof(f8619,plain,
( ~ occurrence_of(sK16(sK17),tptp2)
| sK16(sK17) = sK14(sK17)
| ~ spl18_105
| ~ spl18_106
| ~ spl18_146 ),
inference(resolution,[],[f8466,f3874]) ).
fof(f9186,definition,
( spl18_291
<=> sK16(sK17) = sK14(sK17) ),
introduced(definition,[new_symbols(definition,[spl18_291])],[avatar_definition]) ).
fof(f9188,plain,
( sK16(sK17) = sK14(sK17)
| ~ spl18_291 ),
inference(avatar_component_clause,[],[f9186]) ).
fof(f9190,definition,
( spl18_292
<=> occurrence_of(sK16(sK17),tptp2) ),
introduced(definition,[new_symbols(definition,[spl18_292])],[avatar_definition]) ).
fof(f9192,plain,
( ~ occurrence_of(sK16(sK17),tptp2)
| spl18_292 ),
inference(avatar_component_clause,[],[f9190]) ).
fof(f9193,plain,
( spl18_291
| ~ spl18_292
| ~ spl18_105
| ~ spl18_106
| ~ spl18_146 ),
inference(avatar_split_clause,[],[f8619,f3873,f2397,f2393,f9190,f9186]) ).
fof(f9445,plain,
( ! [X0] :
( sK14(sK17) = X0
| ~ occurrence_of(X0,tptp1)
| ~ leaf_occ(X0,sK17)
| ~ root(sK14(sK17),tptp0) )
| ~ spl18_105 ),
inference(resolution,[],[f7637,f149]) ).
fof(f9455,plain,
( ! [X0] :
( ~ leaf_occ(X0,sK17)
| ~ occurrence_of(X0,tptp1)
| sK14(sK17) = X0 )
| ~ spl18_105
| ~ spl18_106 ),
inference(forward_subsumption_resolution,[],[f9445,f2399]) ).
fof(f9458,plain,
( ~ occurrence_of(sK16(sK17),tptp1)
| sK16(sK17) = sK14(sK17)
| ~ spl18_105
| ~ spl18_106
| ~ spl18_146 ),
inference(resolution,[],[f9455,f3874]) ).
fof(f9463,definition,
( spl18_295
<=> occurrence_of(sK16(sK17),tptp1) ),
introduced(definition,[new_symbols(definition,[spl18_295])],[avatar_definition]) ).
fof(f9465,plain,
( ~ occurrence_of(sK16(sK17),tptp1)
| spl18_295 ),
inference(avatar_component_clause,[],[f9463]) ).
fof(f9466,plain,
( spl18_291
| ~ spl18_295
| ~ spl18_105
| ~ spl18_106
| ~ spl18_146 ),
inference(avatar_split_clause,[],[f9458,f3873,f2397,f2393,f9463,f9186]) ).
fof(f9467,plain,
( occurrence_of(sK16(sK17),tptp2)
| ~ occurrence_of(sK17,tptp0)
| spl18_295 ),
inference(resolution,[],[f9465,f191]) ).
fof(f9468,plain,
( ~ occurrence_of(sK17,tptp0)
| spl18_292
| spl18_295 ),
inference(forward_subsumption_resolution,[],[f9467,f9192]) ).
fof(f9469,plain,
( $false
| spl18_292
| spl18_295 ),
inference(forward_subsumption_resolution,[],[f9468,f208]) ).
fof(f9470,plain,
( spl18_292
| spl18_295 ),
inference(avatar_contradiction_clause,[],[f9469]) ).
fof(f9500,plain,
( next_subocc(sK15(sK17),sK14(sK17),tptp0)
| ~ occurrence_of(sK17,tptp0)
| ~ spl18_291 ),
inference(superposition,[],[f190,f9188]) ).
fof(f9523,plain,
( next_subocc(sK15(sK17),sK14(sK17),tptp0)
| ~ spl18_291 ),
inference(forward_subsumption_resolution,[],[f9500,f208]) ).
fof(f9544,plain,
( min_precedes(sK15(sK17),sK14(sK17),tptp0)
| ~ spl18_291 ),
inference(resolution,[],[f9523,f161]) ).
fof(f9549,plain,
( ~ root(sK14(sK17),tptp0)
| ~ spl18_291 ),
inference(resolution,[],[f9544,f149]) ).
fof(f9557,plain,
( $false
| ~ spl18_106
| ~ spl18_291 ),
inference(forward_subsumption_resolution,[],[f9549,f2399]) ).
fof(f9558,plain,
( ~ spl18_106
| ~ spl18_291 ),
inference(avatar_contradiction_clause,[],[f9557]) ).
cnf(s201,plain,
( ~ spl18_105
| spl18_106 ),
inference(sat_conversion,[],[f2400]) ).
cnf(s203,plain,
spl18_105,
inference(sat_conversion,[],[f2404]) ).
cnf(s294,plain,
spl18_146,
inference(sat_conversion,[],[f3883]) ).
cnf(s579,plain,
( ~ spl18_105
| ~ spl18_106
| ~ spl18_146
| spl18_291
| ~ spl18_292 ),
inference(sat_conversion,[],[f9193]) ).
cnf(s602,plain,
( ~ spl18_105
| ~ spl18_106
| ~ spl18_146
| spl18_291
| ~ spl18_295 ),
inference(sat_conversion,[],[f9466]) ).
cnf(s603,plain,
( spl18_292
| spl18_295 ),
inference(sat_conversion,[],[f9470]) ).
cnf(s604,plain,
( ~ spl18_106
| ~ spl18_291 ),
inference(sat_conversion,[],[f9558]) ).
cnf(s611,plain,
spl18_106,
inference(rat,[],[s201,s203]) ).
cnf(s612,plain,
~ spl18_291,
inference(rat,[],[s604,s611]) ).
cnf(s616,plain,
~ spl18_295,
inference(rat,[],[s602,s611,s203,s294,s612]) ).
cnf(s617,plain,
~ spl18_292,
inference(rat,[],[s579,s611,s203,s294,s612]) ).
cnf(s619,plain,
$false,
inference(rat,[],[s603,s616,s617]) ).
fof(f9559,plain,
$false,
inference(avatar_sat_refutation,[],[s619]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : PRO009+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.37 % Computer : n018.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:21:24 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.40 Running first-order model finding
% 0.11/0.40 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
% 2.85/0.92 % (2791473)Will run a generic schedule for satisfiability detection.
% 2.85/0.92 % (2791478)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2772350302_2999 on theBenchmark for (2999ds/0Mi)
% 2.85/0.92 % Detected minimum model sizes of [4]
% 2.85/0.92 % Detected maximum model sizes of [max]
% 2.85/0.92 % TRYING [4]
% 2.85/0.92 % (2791479)% WARNING: option uhcvi not known.
% 2.85/0.92 % (2791480)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1891212436:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 2.85/0.92 % (2791481)dis+10_1_sil=32000:sp=arity:random_seed=2749092015:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 2.85/0.92 % (2791482)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3349766822:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 2.85/0.92 % (2791484)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=632988540:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 2.85/0.92 % TRYING [5]
% 2.85/0.92 % (2791483)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2780433797:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 2.85/0.92 % (2791479)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2147898949:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 2.85/0.92 % TRYING [6]
% 2.85/0.92 % TRYING [7]
% 2.85/0.92 % (2791484)Instruction limit reached!
% 2.85/0.92 % (2791484)------------------------------
% 2.85/0.92 % (2791484)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.85/0.92 % (2791484)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.85/0.92 % (2791484)CaDiCaL version: 2.1.3
% 2.85/0.92 % (2791484)Termination reason: Instruction limit
% 2.85/0.92 % (2791484)Termination phase: Saturation
% 2.85/0.92 % (2791484)Time elapsed: 0.062 s
% 2.85/0.92 % (2791484)Peak memory usage: 12 MB
% 2.85/0.92 % (2791484)Instructions burned: 161 (million)
% 2.85/0.92 % (2791482)Instruction limit reached!
% 2.85/0.92 % (2791482)------------------------------
% 2.85/0.92 % (2791482)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.85/0.92 % (2791482)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.85/0.92 % (2791482)CaDiCaL version: 2.1.3
% 2.85/0.92 % (2791482)Termination reason: Instruction limit
% 2.85/0.92 % (2791482)Termination phase: Saturation
% 2.85/0.92 % (2791482)Time elapsed: 0.069 s
% 2.85/0.92 % (2791482)Peak memory usage: 12 MB
% 2.85/0.92 % (2791482)Instructions burned: 116 (million)
% 2.85/0.92 % (2791481)Instruction limit reached!
% 2.85/0.92 % (2791481)------------------------------
% 2.85/0.92 % (2791481)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.85/0.92 % (2791481)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.85/0.92 % (2791481)CaDiCaL version: 2.1.3
% 2.85/0.92 % (2791481)Termination reason: Instruction limit
% 2.85/0.92 % (2791481)Termination phase: Saturation
% 2.85/0.92 % (2791481)Time elapsed: 0.072 s
% 2.85/0.92 % (2791481)Peak memory usage: 12 MB
% 2.85/0.92 % (2791481)Instructions burned: 103 (million)
% 2.85/0.92 % (2791492)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=757656715:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 2.85/0.92 % Detected minimum model sizes of [4]
% 2.85/0.92 % Detected maximum model sizes of [max]
% 2.85/0.92 % TRYING [4]
% 2.85/0.92 % (2791493)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=4206197253:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 2.85/0.92 % (2791483)Instruction limit reached!
% 2.85/0.92 % (2791483)------------------------------
% 2.85/0.92 % (2791483)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.85/0.92 % (2791483)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.85/0.92 % (2791483)CaDiCaL version: 2.1.3
% 2.85/0.92 % (2791483)Termination reason: Instruction limit
% 2.85/0.92 % (2791483)Termination phase: Saturation
% 2.85/0.92 % (2791483)Time elapsed: 0.090 s
% 2.85/0.92 % (2791483)Peak memory usage: 14 MB
% 2.85/0.92 % (2791483)Instructions burned: 132 (million)
% 2.85/0.92 % (2791494)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=3955848896:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 2.85/0.92 % TRYING [8]
% 2.85/0.92 % TRYING [5]
% 2.85/0.92 % (2791498)ott-21_1_sil=16000:fs=off:random_seed=1769827498:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 2.85/0.92 % TRYING [6]
% 2.85/0.92 % TRYING [7]
% 2.85/0.92 % (2791493)Instruction limit reached!
% 2.85/0.92 % (2791493)------------------------------
% 2.85/0.92 % (2791493)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.85/0.92 % (2791493)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.85/0.92 % (2791493)CaDiCaL version: 2.1.3
% 2.85/0.92 % (2791493)Termination reason: Instruction limit
% 2.85/0.92 % (2791493)Termination phase: Saturation
% 2.85/0.92 % (2791493)Time elapsed: 0.091 s
% 2.85/0.92 % (2791493)Peak memory usage: 13 MB
% 2.85/0.92 % (2791493)Instructions burned: 132 (million)
% 2.85/0.92 % TRYING [9]
% 2.85/0.92 % (2791500)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=830416396:i=477:bd=all_2997 on theBenchmark for (2997ds/477Mi)
% 2.85/0.92 % (2791498)Instruction limit reached!
% 2.85/0.92 % (2791498)------------------------------
% 2.85/0.92 % (2791498)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.85/0.92 % (2791498)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.85/0.92 % (2791498)CaDiCaL version: 2.1.3
% 2.85/0.92 % (2791498)Termination reason: Instruction limit
% 2.85/0.92 % (2791498)Termination phase: Saturation
% 2.85/0.92 % (2791498)Time elapsed: 0.097 s
% 2.85/0.92 % (2791498)Peak memory usage: 12 MB
% 2.85/0.92 % (2791498)Instructions burned: 180 (million)
% 2.85/0.92 % (2791502)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=1285753839:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 2.85/0.92 % Detected minimum model sizes of [4]
% 2.85/0.92 % Detected maximum model sizes of [max]
% 2.85/0.92 % TRYING [4]
% 2.85/0.92 % TRYING [5]
% 2.85/0.92 % TRYING [8]
% 2.85/0.92 % TRYING [6]
% 2.85/0.92 % (2791492)Instruction limit reached!
% 2.85/0.92 % (2791492)------------------------------
% 2.85/0.92 % (2791492)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.85/0.92 % (2791492)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.85/0.92 % (2791492)CaDiCaL version: 2.1.3
% 2.85/0.92 % (2791492)Termination reason: Instruction limit
% 2.85/0.92 % (2791492)Termination phase: Finite model building constraint generation
% 2.85/0.92 % (2791492)Time elapsed: 0.269 s
% 2.85/0.92 % (2791492)Peak memory usage: 30 MB
% 2.85/0.92 % (2791492)Instructions burned: 715 (million)
% 2.85/0.92 % TRYING [10]
% 2.85/0.92 % (2791504)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=862951743:i=1179_2996 on theBenchmark for (2996ds/1179Mi)
% 2.85/0.92 % TRYING [7]
% 2.85/0.92 % (2791500) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2791473-2791500"...
% 2.85/0.92 % (2791500)...printing done.
% 2.85/0.92 % (2791500)Refutation found. Thanks to Tanya!
% 2.85/0.92 % SZS status Theorem for theBenchmark
% 2.85/0.92 % SZS output start Proof for theBenchmark
% See solution above
% 2.85/0.92 % (2791500)------------------------------
% 2.85/0.92 % (2791500)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.85/0.92 % (2791500)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.85/0.92 % (2791500)CaDiCaL version: 2.1.3
% 2.85/0.92 % (2791500)Termination reason: Refutation
% 2.85/0.92 % (2791500)Time elapsed: 0.258 s
% 2.85/0.92 % (2791500)Peak memory usage: 15 MB
% 2.85/0.92 % (2791500)Instructions burned: 350 (million)
% 2.85/0.92 % (2791473)Success in time 0.503 s
% 2.85/0.92 % Vampire exiting
%------------------------------------------------------------------------------