%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : PRO014+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n013.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:26 PM UTC 2026
% Result : Theorem 9.40s 2.19s
% Output : Refutation 9.91s
% Verified :
% SZS Type : Refutation
% Derivation depth : 34
% Number of leaves : 21
% Syntax : Number of formulae : 198 ( 32 unt; 9 def)
% Number of atoms : 739 ( 15 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 911 ( 370 ~; 420 |; 98 &)
% ( 15 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 20 ( 18 usr; 10 prp; 0-3 aty)
% Number of functors : 14 ( 14 usr; 7 con; 0-3 aty)
% Number of variables : 264 ( 0 sgn 232 !; 32 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
! [X0,X1] :
( occurrence_of(X0,X1)
=> ( arboreal(X0)
<=> atomic(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_07) ).
fof(f15,axiom,
! [X0,X1,X2] :
( min_precedes(X0,X1,X2)
=> ~ root(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_14) ).
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(f26,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_25) ).
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(f30,axiom,
! [X0,X1,X2,X3] :
( ( min_precedes(X0,X1,X2)
& occurrence_of(X3,X2)
& subactivity_occurrence(X1,X3) )
=> subactivity_occurrence(X0,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_29) ).
fof(f36,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)
& next_subocc(X2,X3,tptp0)
& ( occurrence_of(X4,tptp2)
| occurrence_of(X4,tptp1) )
& next_subocc(X3,X4,tptp0)
& leaf(X4,tptp0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_35) ).
fof(f40,axiom,
atomic(tptp2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_39) ).
fof(f41,axiom,
atomic(tptp1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_40) ).
fof(f42,axiom,
atomic(tptp3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_41) ).
fof(f49,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(f50,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)],[f49]) ).
fof(f61,plain,
! [X0,X1] :
( ( arboreal(X0)
<=> atomic(X1) )
| ~ occurrence_of(X0,X1) ),
inference(ennf_transformation,[],[f8]) ).
fof(f68,plain,
! [X0,X1,X2] :
( ~ root(X1,X2)
| ~ min_precedes(X0,X1,X2) ),
inference(ennf_transformation,[],[f15]) ).
fof(f78,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(f79,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,[],[f23]) ).
fof(f81,plain,
! [X0,X1,X2] :
( ? [X3] :
( occurrence_of(X3,X0)
& subactivity_occurrence(X1,X3)
& subactivity_occurrence(X2,X3) )
| ~ min_precedes(X1,X2,X0) ),
inference(ennf_transformation,[],[f26]) ).
fof(f86,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(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(flattening,[],[f86]) ).
fof(f88,plain,
! [X0,X1,X2,X3] :
( subactivity_occurrence(X0,X3)
| ~ min_precedes(X0,X1,X2)
| ~ occurrence_of(X3,X2)
| ~ subactivity_occurrence(X1,X3) ),
inference(ennf_transformation,[],[f30]) ).
fof(f89,plain,
! [X0,X1,X2,X3] :
( subactivity_occurrence(X0,X3)
| ~ min_precedes(X0,X1,X2)
| ~ occurrence_of(X3,X2)
| ~ subactivity_occurrence(X1,X3) ),
inference(flattening,[],[f88]) ).
fof(f96,plain,
! [X0,X1] :
( ? [X2,X3,X4] :
( occurrence_of(X2,tptp3)
& next_subocc(X0,X2,tptp0)
& occurrence_of(X3,tptp4)
& next_subocc(X2,X3,tptp0)
& ( occurrence_of(X4,tptp2)
| occurrence_of(X4,tptp1) )
& next_subocc(X3,X4,tptp0)
& leaf(X4,tptp0) )
| ~ occurrence_of(X1,tptp0)
| ~ subactivity_occurrence(X0,X1)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(ennf_transformation,[],[f36]) ).
fof(f97,plain,
! [X0,X1] :
( ? [X2,X3,X4] :
( occurrence_of(X2,tptp3)
& next_subocc(X0,X2,tptp0)
& occurrence_of(X3,tptp4)
& next_subocc(X2,X3,tptp0)
& ( occurrence_of(X4,tptp2)
| occurrence_of(X4,tptp1) )
& next_subocc(X3,X4,tptp0)
& leaf(X4,tptp0) )
| ~ occurrence_of(X1,tptp0)
| ~ subactivity_occurrence(X0,X1)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(flattening,[],[f96]) ).
fof(f98,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,[],[f50]) ).
fof(f99,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,[],[f98]) ).
fof(f101,plain,
! [X0,X1] :
( ( ( arboreal(X0)
| ~ atomic(X1) )
& ( atomic(X1)
| ~ arboreal(X0) ) )
| ~ occurrence_of(X0,X1) ),
inference(nnf_transformation,[],[f61]) ).
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(nnf_transformation,[],[f78]) ).
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)
| ? [X2] : min_precedes(X2,X0,X1) )
& ! [X3] : ~ min_precedes(X0,X3,X1) )
| ~ leaf(X0,X1) ) ),
inference(flattening,[],[f107]) ).
fof(f109,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,[],[f108]) ).
fof(f110,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))],[f109]) ).
fof(f111,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,[],[f79]) ).
fof(f112,plain,
! [X0,X1,X2] :
( ( next_subocc(X0,X1,X2)
| ~ min_precedes(X0,X1,X2)
| ? [X3] :
( min_precedes(X0,X3,X2)
& min_precedes(X3,X1,X2) ) )
& ( ( min_precedes(X0,X1,X2)
& ! [X3] :
( ~ min_precedes(X0,X3,X2)
| ~ min_precedes(X3,X1,X2) ) )
| ~ next_subocc(X0,X1,X2) ) ),
inference(flattening,[],[f111]) ).
fof(f113,plain,
! [X0,X1,X2] :
( ( next_subocc(X0,X1,X2)
| ~ min_precedes(X0,X1,X2)
| ? [X3] :
( min_precedes(X0,X3,X2)
& min_precedes(X3,X1,X2) ) )
& ( ( min_precedes(X0,X1,X2)
& ! [X4] :
( ~ min_precedes(X0,X4,X2)
| ~ min_precedes(X4,X1,X2) ) )
| ~ next_subocc(X0,X1,X2) ) ),
inference(rectify,[],[f112]) ).
fof(f114,plain,
! [X0,X1,X2] :
( ( next_subocc(X0,X1,X2)
| ~ min_precedes(X0,X1,X2)
| ( min_precedes(X0,sK7(X0,X1,X2),X2)
& min_precedes(sK7(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,[sK7]),skolemize(X3,sK7(X0,X1,X2))],[f113]) ).
fof(f118,plain,
! [X0,X1,X2] :
( ( occurrence_of(sK9(X0,X1,X2),X0)
& subactivity_occurrence(X1,sK9(X0,X1,X2))
& subactivity_occurrence(X2,sK9(X0,X1,X2)) )
| ~ min_precedes(X1,X2,X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK9]),skolemize(X3,sK9(X0,X1,X2))],[f81]) ).
fof(f125,plain,
! [X0,X1] :
( ( occurrence_of(sK14(X0),tptp3)
& next_subocc(X0,sK14(X0),tptp0)
& 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(sK16(X0),tptp0) )
| ~ occurrence_of(X1,tptp0)
| ~ subactivity_occurrence(X0,X1)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK14,sK15,sK16]),skolemize(X2,sK14(X0)),skolemize(X3,sK15(X0)),skolemize(X4,sK16(X0))],[f97]) ).
fof(f126,plain,
( ! [X2,X3] :
( ~ occurrence_of(X2,tptp3)
| ~ next_subocc(sK17,X2,tptp0)
| ( ~ occurrence_of(X3,tptp2)
& ~ occurrence_of(X3,tptp1) )
| ~ min_precedes(X2,X3,tptp0)
| ~ leaf(X3,tptp0) )
& occurrence_of(sK18,tptp0)
& subactivity_occurrence(sK17,sK18)
& arboreal(sK17)
& ~ leaf_occ(sK17,sK18) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK17,sK18]),skolemize(X0,sK17),skolemize(X1,sK18)],[f99]) ).
fof(f137,plain,
! [X0,X1] :
( ~ occurrence_of(X0,X1)
| ~ atomic(X1)
| arboreal(X0) ),
inference(cnf_transformation,[],[f101]) ).
fof(f151,plain,
! [X2,X0,X1] :
( ~ min_precedes(X0,X1,X2)
| ~ root(X1,X2) ),
inference(cnf_transformation,[],[f68]) ).
fof(f158,plain,
! [X0,X1,X5] :
( ~ min_precedes(X0,X5,X1)
| ~ leaf(X0,X1) ),
inference(cnf_transformation,[],[f110]) ).
fof(f159,plain,
! [X0,X1] :
( min_precedes(sK6(X0,X1),X0,X1)
| root(X0,X1)
| ~ leaf(X0,X1) ),
inference(cnf_transformation,[],[f110]) ).
fof(f163,plain,
! [X2,X0,X1] :
( ~ next_subocc(X0,X1,X2)
| min_precedes(X0,X1,X2) ),
inference(cnf_transformation,[],[f114]) ).
fof(f172,plain,
! [X2,X0,X1] :
( subactivity_occurrence(X2,sK9(X0,X1,X2))
| ~ min_precedes(X1,X2,X0) ),
inference(cnf_transformation,[],[f118]) ).
fof(f173,plain,
! [X2,X0,X1] :
( subactivity_occurrence(X1,sK9(X0,X1,X2))
| ~ min_precedes(X1,X2,X0) ),
inference(cnf_transformation,[],[f118]) ).
fof(f174,plain,
! [X2,X0,X1] :
( occurrence_of(sK9(X0,X1,X2),X0)
| ~ min_precedes(X1,X2,X0) ),
inference(cnf_transformation,[],[f118]) ).
fof(f179,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,[],[f87]) ).
fof(f180,plain,
! [X2,X3,X0,X1] :
( ~ min_precedes(X0,X1,X2)
| subactivity_occurrence(X0,X3)
| ~ occurrence_of(X3,X2)
| ~ subactivity_occurrence(X1,X3) ),
inference(cnf_transformation,[],[f89]) ).
fof(f189,plain,
! [X0,X1] :
( ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0)
| leaf(sK16(X0),tptp0)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f125]) ).
fof(f190,plain,
! [X0,X1] :
( ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0)
| next_subocc(sK15(X0),sK16(X0),tptp0)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f125]) ).
fof(f191,plain,
! [X0,X1] :
( ~ subactivity_occurrence(X0,X1)
| occurrence_of(sK16(X0),tptp1)
| ~ occurrence_of(X1,tptp0)
| occurrence_of(sK16(X0),tptp2)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f125]) ).
fof(f192,plain,
! [X0,X1] :
( ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0)
| next_subocc(sK14(X0),sK15(X0),tptp0)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f125]) ).
fof(f194,plain,
! [X0,X1] :
( ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0)
| next_subocc(X0,sK14(X0),tptp0)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f125]) ).
fof(f195,plain,
! [X0,X1] :
( ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0)
| occurrence_of(sK14(X0),tptp3)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f125]) ).
fof(f199,plain,
atomic(tptp2),
inference(cnf_transformation,[],[f40]) ).
fof(f200,plain,
atomic(tptp1),
inference(cnf_transformation,[],[f41]) ).
fof(f201,plain,
atomic(tptp3),
inference(cnf_transformation,[],[f42]) ).
fof(f208,plain,
~ leaf_occ(sK17,sK18),
inference(cnf_transformation,[],[f126]) ).
fof(f209,plain,
arboreal(sK17),
inference(cnf_transformation,[],[f126]) ).
fof(f210,plain,
subactivity_occurrence(sK17,sK18),
inference(cnf_transformation,[],[f126]) ).
fof(f211,plain,
occurrence_of(sK18,tptp0),
inference(cnf_transformation,[],[f126]) ).
fof(f212,plain,
! [X2,X3] :
( ~ next_subocc(sK17,X2,tptp0)
| ~ occurrence_of(X2,tptp3)
| ~ occurrence_of(X3,tptp1)
| ~ min_precedes(X2,X3,tptp0)
| ~ leaf(X3,tptp0) ),
inference(cnf_transformation,[],[f126]) ).
fof(f213,plain,
! [X2,X3] :
( ~ next_subocc(sK17,X2,tptp0)
| ~ occurrence_of(X2,tptp3)
| ~ occurrence_of(X3,tptp2)
| ~ min_precedes(X2,X3,tptp0)
| ~ leaf(X3,tptp0) ),
inference(cnf_transformation,[],[f126]) ).
fof(f214,plain,
( ~ occurrence_of(sK18,tptp0)
| occurrence_of(sK14(sK17),tptp3)
| ~ arboreal(sK17)
| leaf_occ(sK17,sK18) ),
inference(resolution,[],[f195,f210]) ).
fof(f215,plain,
( occurrence_of(sK14(sK17),tptp3)
| ~ arboreal(sK17)
| leaf_occ(sK17,sK18) ),
inference(forward_subsumption_resolution,[],[f214,f211]) ).
fof(f216,plain,
( occurrence_of(sK14(sK17),tptp3)
| leaf_occ(sK17,sK18) ),
inference(forward_subsumption_resolution,[],[f215,f209]) ).
fof(f217,plain,
occurrence_of(sK14(sK17),tptp3),
inference(forward_subsumption_resolution,[],[f216,f208]) ).
fof(f218,plain,
( ~ occurrence_of(sK18,tptp0)
| next_subocc(sK17,sK14(sK17),tptp0)
| ~ arboreal(sK17)
| leaf_occ(sK17,sK18) ),
inference(resolution,[],[f194,f210]) ).
fof(f219,plain,
( next_subocc(sK17,sK14(sK17),tptp0)
| ~ arboreal(sK17)
| leaf_occ(sK17,sK18) ),
inference(forward_subsumption_resolution,[],[f218,f211]) ).
fof(f220,plain,
( next_subocc(sK17,sK14(sK17),tptp0)
| leaf_occ(sK17,sK18) ),
inference(forward_subsumption_resolution,[],[f219,f209]) ).
fof(f221,plain,
next_subocc(sK17,sK14(sK17),tptp0),
inference(forward_subsumption_resolution,[],[f220,f208]) ).
fof(f222,plain,
( ~ occurrence_of(sK18,tptp0)
| leaf(sK16(sK17),tptp0)
| ~ arboreal(sK17)
| leaf_occ(sK17,sK18) ),
inference(resolution,[],[f189,f210]) ).
fof(f223,plain,
( leaf(sK16(sK17),tptp0)
| ~ arboreal(sK17)
| leaf_occ(sK17,sK18) ),
inference(forward_subsumption_resolution,[],[f222,f211]) ).
fof(f224,plain,
( leaf(sK16(sK17),tptp0)
| leaf_occ(sK17,sK18) ),
inference(forward_subsumption_resolution,[],[f223,f209]) ).
fof(f225,plain,
leaf(sK16(sK17),tptp0),
inference(forward_subsumption_resolution,[],[f224,f208]) ).
fof(f226,plain,
( ~ occurrence_of(sK18,tptp0)
| next_subocc(sK14(sK17),sK15(sK17),tptp0)
| ~ arboreal(sK17)
| leaf_occ(sK17,sK18) ),
inference(resolution,[],[f192,f210]) ).
fof(f227,plain,
( next_subocc(sK14(sK17),sK15(sK17),tptp0)
| ~ arboreal(sK17)
| leaf_occ(sK17,sK18) ),
inference(forward_subsumption_resolution,[],[f226,f211]) ).
fof(f228,plain,
( next_subocc(sK14(sK17),sK15(sK17),tptp0)
| leaf_occ(sK17,sK18) ),
inference(forward_subsumption_resolution,[],[f227,f209]) ).
fof(f229,plain,
next_subocc(sK14(sK17),sK15(sK17),tptp0),
inference(forward_subsumption_resolution,[],[f228,f208]) ).
fof(f230,plain,
( ~ occurrence_of(sK18,tptp0)
| next_subocc(sK15(sK17),sK16(sK17),tptp0)
| ~ arboreal(sK17)
| leaf_occ(sK17,sK18) ),
inference(resolution,[],[f190,f210]) ).
fof(f231,plain,
( next_subocc(sK15(sK17),sK16(sK17),tptp0)
| ~ arboreal(sK17)
| leaf_occ(sK17,sK18) ),
inference(forward_subsumption_resolution,[],[f230,f211]) ).
fof(f232,plain,
( next_subocc(sK15(sK17),sK16(sK17),tptp0)
| leaf_occ(sK17,sK18) ),
inference(forward_subsumption_resolution,[],[f231,f209]) ).
fof(f233,plain,
next_subocc(sK15(sK17),sK16(sK17),tptp0),
inference(forward_subsumption_resolution,[],[f232,f208]) ).
fof(f241,plain,
min_precedes(sK14(sK17),sK15(sK17),tptp0),
inference(resolution,[],[f229,f163]) ).
fof(f242,plain,
min_precedes(sK15(sK17),sK16(sK17),tptp0),
inference(resolution,[],[f233,f163]) ).
fof(f243,plain,
( occurrence_of(sK16(sK17),tptp1)
| ~ occurrence_of(sK18,tptp0)
| occurrence_of(sK16(sK17),tptp2)
| ~ arboreal(sK17)
| leaf_occ(sK17,sK18) ),
inference(resolution,[],[f191,f210]) ).
fof(f244,plain,
( occurrence_of(sK16(sK17),tptp1)
| occurrence_of(sK16(sK17),tptp2)
| ~ arboreal(sK17)
| leaf_occ(sK17,sK18) ),
inference(forward_subsumption_resolution,[],[f243,f211]) ).
fof(f245,plain,
( occurrence_of(sK16(sK17),tptp1)
| occurrence_of(sK16(sK17),tptp2)
| leaf_occ(sK17,sK18) ),
inference(forward_subsumption_resolution,[],[f244,f209]) ).
fof(f246,plain,
( occurrence_of(sK16(sK17),tptp1)
| occurrence_of(sK16(sK17),tptp2) ),
inference(forward_subsumption_resolution,[],[f245,f208]) ).
fof(f248,definition,
( spl19_1
<=> occurrence_of(sK16(sK17),tptp2) ),
introduced(definition,[new_symbols(definition,[spl19_1])],[avatar_definition]) ).
fof(f250,plain,
( occurrence_of(sK16(sK17),tptp2)
| ~ spl19_1 ),
inference(avatar_component_clause,[],[f248]) ).
fof(f252,definition,
( spl19_2
<=> occurrence_of(sK16(sK17),tptp1) ),
introduced(definition,[new_symbols(definition,[spl19_2])],[avatar_definition]) ).
fof(f254,plain,
( occurrence_of(sK16(sK17),tptp1)
| ~ spl19_2 ),
inference(avatar_component_clause,[],[f252]) ).
fof(f255,plain,
( spl19_1
| spl19_2 ),
inference(avatar_split_clause,[],[f246,f252,f248]) ).
fof(f256,plain,
! [X0] :
( ~ occurrence_of(sK14(sK17),tptp3)
| ~ occurrence_of(X0,tptp1)
| ~ min_precedes(sK14(sK17),X0,tptp0)
| ~ leaf(X0,tptp0) ),
inference(resolution,[],[f212,f221]) ).
fof(f257,plain,
! [X0] :
( ~ min_precedes(sK14(sK17),X0,tptp0)
| ~ occurrence_of(X0,tptp1)
| ~ leaf(X0,tptp0) ),
inference(forward_subsumption_resolution,[],[f256,f217]) ).
fof(f268,plain,
! [X0] :
( ~ occurrence_of(sK14(sK17),tptp3)
| ~ occurrence_of(X0,tptp2)
| ~ min_precedes(sK14(sK17),X0,tptp0)
| ~ leaf(X0,tptp0) ),
inference(resolution,[],[f213,f221]) ).
fof(f269,plain,
! [X0] :
( ~ min_precedes(sK14(sK17),X0,tptp0)
| ~ occurrence_of(X0,tptp2)
| ~ leaf(X0,tptp0) ),
inference(forward_subsumption_resolution,[],[f268,f217]) ).
fof(f274,plain,
( ~ atomic(tptp3)
| arboreal(sK14(sK17)) ),
inference(resolution,[],[f137,f217]) ).
fof(f276,plain,
( ~ atomic(tptp1)
| arboreal(sK16(sK17))
| ~ spl19_2 ),
inference(resolution,[],[f137,f254]) ).
fof(f278,plain,
( arboreal(sK16(sK17))
| ~ spl19_2 ),
inference(forward_subsumption_resolution,[],[f276,f200]) ).
fof(f280,plain,
arboreal(sK14(sK17)),
inference(forward_subsumption_resolution,[],[f274,f201]) ).
fof(f305,plain,
! [X2,X3,X0,X1,X4] :
( ~ subactivity_occurrence(X3,sK9(X2,X0,X1))
| min_precedes(X1,X3,X4)
| X1 = X3
| ~ occurrence_of(sK9(X2,X0,X1),X4)
| ~ arboreal(X3)
| ~ arboreal(X1)
| ~ min_precedes(X0,X1,X2)
| min_precedes(X3,X1,X4) ),
inference(resolution,[],[f172,f179]) ).
fof(f314,plain,
! [X2,X3,X0,X1,X4] :
( ~ subactivity_occurrence(X3,sK9(X2,X0,X1))
| min_precedes(X0,X3,X4)
| X0 = X3
| ~ occurrence_of(sK9(X2,X0,X1),X4)
| ~ arboreal(X3)
| ~ arboreal(X0)
| ~ min_precedes(X0,X1,X2)
| min_precedes(X3,X0,X4) ),
inference(resolution,[],[f173,f179]) ).
fof(f323,plain,
~ leaf(sK14(sK17),tptp0),
inference(resolution,[],[f158,f241]) ).
fof(f347,plain,
~ root(sK16(sK17),tptp0),
inference(resolution,[],[f151,f242]) ).
fof(f388,plain,
! [X0] :
( ~ subactivity_occurrence(sK15(sK17),X0)
| ~ occurrence_of(X0,tptp0)
| subactivity_occurrence(sK14(sK17),X0) ),
inference(resolution,[],[f180,f241]) ).
fof(f389,plain,
! [X0] :
( ~ subactivity_occurrence(sK16(sK17),X0)
| ~ occurrence_of(X0,tptp0)
| subactivity_occurrence(sK15(sK17),X0) ),
inference(resolution,[],[f180,f242]) ).
fof(f394,plain,
! [X0,X1] :
( subactivity_occurrence(sK15(sK17),sK9(X0,X1,sK16(sK17)))
| ~ occurrence_of(sK9(X0,X1,sK16(sK17)),tptp0)
| ~ min_precedes(X1,sK16(sK17),X0) ),
inference(resolution,[],[f389,f172]) ).
fof(f395,plain,
! [X0,X1] :
( subactivity_occurrence(sK15(sK17),sK9(X0,sK16(sK17),X1))
| ~ occurrence_of(sK9(X0,sK16(sK17),X1),tptp0)
| ~ min_precedes(sK16(sK17),X1,X0) ),
inference(resolution,[],[f389,f173]) ).
fof(f400,plain,
! [X0,X1] :
( ~ occurrence_of(sK9(X0,sK16(sK17),X1),tptp0)
| ~ min_precedes(sK16(sK17),X1,X0)
| ~ occurrence_of(sK9(X0,sK16(sK17),X1),tptp0)
| subactivity_occurrence(sK14(sK17),sK9(X0,sK16(sK17),X1)) ),
inference(resolution,[],[f395,f388]) ).
fof(f422,plain,
! [X0,X1] :
( subactivity_occurrence(sK14(sK17),sK9(X0,sK16(sK17),X1))
| ~ min_precedes(sK16(sK17),X1,X0)
| ~ occurrence_of(sK9(X0,sK16(sK17),X1),tptp0) ),
inference(duplicate_literal_removal,[],[f400]) ).
fof(f485,definition,
( spl19_18
<=> arboreal(sK16(sK17)) ),
introduced(definition,[new_symbols(definition,[spl19_18])],[avatar_definition]) ).
fof(f486,plain,
( arboreal(sK16(sK17))
| ~ spl19_18 ),
inference(avatar_component_clause,[],[f485]) ).
fof(f487,plain,
( ~ arboreal(sK16(sK17))
| spl19_18 ),
inference(avatar_component_clause,[],[f485]) ).
fof(f491,plain,
( ~ atomic(tptp2)
| arboreal(sK16(sK17))
| ~ spl19_1 ),
inference(resolution,[],[f250,f137]) ).
fof(f492,plain,
( arboreal(sK16(sK17))
| ~ spl19_1 ),
inference(forward_subsumption_resolution,[],[f491,f199]) ).
fof(f493,plain,
( $false
| ~ spl19_1
| spl19_18 ),
inference(forward_subsumption_resolution,[],[f492,f487]) ).
fof(f494,plain,
( ~ spl19_1
| spl19_18 ),
inference(avatar_contradiction_clause,[],[f493]) ).
fof(f495,plain,
( $false
| ~ spl19_2
| spl19_18 ),
inference(forward_subsumption_resolution,[],[f278,f487]) ).
fof(f496,plain,
( ~ spl19_2
| spl19_18 ),
inference(avatar_contradiction_clause,[],[f495]) ).
fof(f607,plain,
! [X0,X1] :
( ~ occurrence_of(sK9(X0,X1,sK16(sK17)),tptp0)
| ~ min_precedes(X1,sK16(sK17),X0)
| ~ occurrence_of(sK9(X0,X1,sK16(sK17)),tptp0)
| subactivity_occurrence(sK14(sK17),sK9(X0,X1,sK16(sK17))) ),
inference(resolution,[],[f394,f388]) ).
fof(f629,plain,
! [X0,X1] :
( subactivity_occurrence(sK14(sK17),sK9(X0,X1,sK16(sK17)))
| ~ min_precedes(X1,sK16(sK17),X0)
| ~ occurrence_of(sK9(X0,X1,sK16(sK17)),tptp0) ),
inference(duplicate_literal_removal,[],[f607]) ).
fof(f653,plain,
! [X2,X0,X1] :
( ~ min_precedes(sK16(sK17),X0,X1)
| ~ occurrence_of(sK9(X1,sK16(sK17),X0),tptp0)
| min_precedes(sK16(sK17),sK14(sK17),X2)
| sK14(sK17) = sK16(sK17)
| ~ occurrence_of(sK9(X1,sK16(sK17),X0),X2)
| ~ arboreal(sK14(sK17))
| ~ arboreal(sK16(sK17))
| ~ min_precedes(sK16(sK17),X0,X1)
| min_precedes(sK14(sK17),sK16(sK17),X2) ),
inference(resolution,[],[f422,f314]) ).
fof(f673,plain,
! [X2,X0,X1] :
( ~ min_precedes(sK16(sK17),X0,X1)
| ~ occurrence_of(sK9(X1,sK16(sK17),X0),tptp0)
| min_precedes(sK16(sK17),sK14(sK17),X2)
| sK14(sK17) = sK16(sK17)
| ~ occurrence_of(sK9(X1,sK16(sK17),X0),X2)
| ~ arboreal(sK14(sK17))
| ~ arboreal(sK16(sK17))
| min_precedes(sK14(sK17),sK16(sK17),X2) ),
inference(duplicate_literal_removal,[],[f653]) ).
fof(f684,plain,
! [X2,X0,X1] :
( ~ min_precedes(sK16(sK17),X0,X1)
| ~ occurrence_of(sK9(X1,sK16(sK17),X0),tptp0)
| min_precedes(sK16(sK17),sK14(sK17),X2)
| sK14(sK17) = sK16(sK17)
| ~ occurrence_of(sK9(X1,sK16(sK17),X0),X2)
| ~ arboreal(sK16(sK17))
| min_precedes(sK14(sK17),sK16(sK17),X2) ),
inference(forward_subsumption_resolution,[],[f673,f280]) ).
fof(f695,plain,
( ! [X2,X0,X1] :
( ~ min_precedes(sK16(sK17),X0,X1)
| ~ occurrence_of(sK9(X1,sK16(sK17),X0),tptp0)
| min_precedes(sK16(sK17),sK14(sK17),X2)
| sK14(sK17) = sK16(sK17)
| ~ occurrence_of(sK9(X1,sK16(sK17),X0),X2)
| min_precedes(sK14(sK17),sK16(sK17),X2) )
| ~ spl19_18 ),
inference(forward_subsumption_resolution,[],[f684,f486]) ).
fof(f697,definition,
( spl19_32
<=> sK14(sK17) = sK16(sK17) ),
introduced(definition,[new_symbols(definition,[spl19_32])],[avatar_definition]) ).
fof(f698,plain,
( sK14(sK17) != sK16(sK17)
| spl19_32 ),
inference(avatar_component_clause,[],[f697]) ).
fof(f699,plain,
( sK14(sK17) = sK16(sK17)
| ~ spl19_32 ),
inference(avatar_component_clause,[],[f697]) ).
fof(f701,definition,
( spl19_33
<=> ! [X2,X0,X1] :
( ~ min_precedes(sK16(sK17),X0,X1)
| min_precedes(sK14(sK17),sK16(sK17),X2)
| ~ occurrence_of(sK9(X1,sK16(sK17),X0),X2)
| min_precedes(sK16(sK17),sK14(sK17),X2)
| ~ occurrence_of(sK9(X1,sK16(sK17),X0),tptp0) ) ),
introduced(definition,[new_symbols(definition,[spl19_33])],[avatar_definition]) ).
fof(f702,plain,
( ! [X2,X0,X1] :
( ~ occurrence_of(sK9(X1,sK16(sK17),X0),tptp0)
| min_precedes(sK14(sK17),sK16(sK17),X2)
| ~ occurrence_of(sK9(X1,sK16(sK17),X0),X2)
| min_precedes(sK16(sK17),sK14(sK17),X2)
| ~ min_precedes(sK16(sK17),X0,X1) )
| ~ spl19_33 ),
inference(avatar_component_clause,[],[f701]) ).
fof(f703,plain,
( spl19_32
| spl19_33
| ~ spl19_18 ),
inference(avatar_split_clause,[],[f695,f485,f701,f697]) ).
fof(f796,definition,
( spl19_40
<=> ! [X0] : ~ min_precedes(sK16(sK17),X0,tptp0) ),
introduced(definition,[new_symbols(definition,[spl19_40])],[avatar_definition]) ).
fof(f797,plain,
( ! [X0] : ~ min_precedes(sK16(sK17),X0,tptp0)
| ~ spl19_40 ),
inference(avatar_component_clause,[],[f796]) ).
fof(f808,plain,
( ! [X0,X1] :
( min_precedes(sK14(sK17),sK16(sK17),X0)
| ~ occurrence_of(sK9(tptp0,sK16(sK17),X1),X0)
| min_precedes(sK16(sK17),sK14(sK17),X0)
| ~ min_precedes(sK16(sK17),X1,tptp0)
| ~ min_precedes(sK16(sK17),X1,tptp0) )
| ~ spl19_33 ),
inference(resolution,[],[f702,f174]) ).
fof(f809,plain,
( ! [X0,X1] :
( ~ occurrence_of(sK9(tptp0,sK16(sK17),X1),X0)
| min_precedes(sK14(sK17),sK16(sK17),X0)
| min_precedes(sK16(sK17),sK14(sK17),X0)
| ~ min_precedes(sK16(sK17),X1,tptp0) )
| ~ spl19_33 ),
inference(duplicate_literal_removal,[],[f808]) ).
fof(f810,plain,
( ! [X0] :
( min_precedes(sK14(sK17),sK16(sK17),tptp0)
| min_precedes(sK16(sK17),sK14(sK17),tptp0)
| ~ min_precedes(sK16(sK17),X0,tptp0)
| ~ min_precedes(sK16(sK17),X0,tptp0) )
| ~ spl19_33 ),
inference(resolution,[],[f809,f174]) ).
fof(f812,plain,
( ! [X0] :
( min_precedes(sK14(sK17),sK16(sK17),tptp0)
| min_precedes(sK16(sK17),sK14(sK17),tptp0)
| ~ min_precedes(sK16(sK17),X0,tptp0) )
| ~ spl19_33 ),
inference(duplicate_literal_removal,[],[f810]) ).
fof(f814,definition,
( spl19_42
<=> min_precedes(sK16(sK17),sK14(sK17),tptp0) ),
introduced(definition,[new_symbols(definition,[spl19_42])],[avatar_definition]) ).
fof(f816,plain,
( min_precedes(sK16(sK17),sK14(sK17),tptp0)
| ~ spl19_42 ),
inference(avatar_component_clause,[],[f814]) ).
fof(f818,definition,
( spl19_43
<=> min_precedes(sK14(sK17),sK16(sK17),tptp0) ),
introduced(definition,[new_symbols(definition,[spl19_43])],[avatar_definition]) ).
fof(f819,plain,
( ~ min_precedes(sK14(sK17),sK16(sK17),tptp0)
| spl19_43 ),
inference(avatar_component_clause,[],[f818]) ).
fof(f820,plain,
( min_precedes(sK14(sK17),sK16(sK17),tptp0)
| ~ spl19_43 ),
inference(avatar_component_clause,[],[f818]) ).
fof(f824,plain,
( ~ occurrence_of(sK16(sK17),tptp1)
| ~ leaf(sK16(sK17),tptp0)
| ~ spl19_43 ),
inference(resolution,[],[f820,f257]) ).
fof(f830,plain,
( ~ leaf(sK16(sK17),tptp0)
| ~ spl19_2
| ~ spl19_43 ),
inference(forward_subsumption_resolution,[],[f824,f254]) ).
fof(f831,plain,
( $false
| ~ spl19_2
| ~ spl19_43 ),
inference(forward_subsumption_resolution,[],[f830,f225]) ).
fof(f832,plain,
( ~ spl19_2
| ~ spl19_43 ),
inference(avatar_contradiction_clause,[],[f831]) ).
fof(f843,plain,
( ~ leaf(sK16(sK17),tptp0)
| ~ spl19_32 ),
inference(superposition,[],[f323,f699]) ).
fof(f864,plain,
( $false
| ~ spl19_32 ),
inference(forward_subsumption_resolution,[],[f843,f225]) ).
fof(f865,plain,
~ spl19_32,
inference(avatar_contradiction_clause,[],[f864]) ).
fof(f869,plain,
( spl19_40
| spl19_42
| spl19_43
| ~ spl19_33 ),
inference(avatar_split_clause,[],[f812,f701,f818,f814,f796]) ).
fof(f1191,plain,
! [X2,X0,X1] :
( ~ min_precedes(X0,sK16(sK17),X1)
| ~ occurrence_of(sK9(X1,X0,sK16(sK17)),tptp0)
| min_precedes(sK16(sK17),sK14(sK17),X2)
| sK14(sK17) = sK16(sK17)
| ~ occurrence_of(sK9(X1,X0,sK16(sK17)),X2)
| ~ arboreal(sK14(sK17))
| ~ arboreal(sK16(sK17))
| ~ min_precedes(X0,sK16(sK17),X1)
| min_precedes(sK14(sK17),sK16(sK17),X2) ),
inference(resolution,[],[f629,f305]) ).
fof(f1209,plain,
! [X2,X0,X1] :
( ~ min_precedes(X0,sK16(sK17),X1)
| ~ occurrence_of(sK9(X1,X0,sK16(sK17)),tptp0)
| min_precedes(sK16(sK17),sK14(sK17),X2)
| sK14(sK17) = sK16(sK17)
| ~ occurrence_of(sK9(X1,X0,sK16(sK17)),X2)
| ~ arboreal(sK14(sK17))
| ~ arboreal(sK16(sK17))
| min_precedes(sK14(sK17),sK16(sK17),X2) ),
inference(duplicate_literal_removal,[],[f1191]) ).
fof(f1216,plain,
( ! [X2,X0,X1] :
( ~ min_precedes(X0,sK16(sK17),X1)
| ~ occurrence_of(sK9(X1,X0,sK16(sK17)),tptp0)
| min_precedes(sK16(sK17),sK14(sK17),X2)
| ~ occurrence_of(sK9(X1,X0,sK16(sK17)),X2)
| ~ arboreal(sK14(sK17))
| ~ arboreal(sK16(sK17))
| min_precedes(sK14(sK17),sK16(sK17),X2) )
| spl19_32 ),
inference(forward_subsumption_resolution,[],[f1209,f698]) ).
fof(f1221,plain,
( ! [X2,X0,X1] :
( ~ min_precedes(X0,sK16(sK17),X1)
| ~ occurrence_of(sK9(X1,X0,sK16(sK17)),tptp0)
| min_precedes(sK16(sK17),sK14(sK17),X2)
| ~ occurrence_of(sK9(X1,X0,sK16(sK17)),X2)
| ~ arboreal(sK16(sK17))
| min_precedes(sK14(sK17),sK16(sK17),X2) )
| spl19_32 ),
inference(forward_subsumption_resolution,[],[f1216,f280]) ).
fof(f1222,plain,
( ! [X2,X0,X1] :
( ~ occurrence_of(sK9(X1,X0,sK16(sK17)),tptp0)
| ~ min_precedes(X0,sK16(sK17),X1)
| min_precedes(sK16(sK17),sK14(sK17),X2)
| ~ occurrence_of(sK9(X1,X0,sK16(sK17)),X2)
| min_precedes(sK14(sK17),sK16(sK17),X2) )
| ~ spl19_18
| spl19_32 ),
inference(forward_subsumption_resolution,[],[f1221,f486]) ).
fof(f1365,definition,
( spl19_85
<=> ! [X0] : ~ min_precedes(X0,sK16(sK17),tptp0) ),
introduced(definition,[new_symbols(definition,[spl19_85])],[avatar_definition]) ).
fof(f1366,plain,
( ! [X0] : ~ min_precedes(X0,sK16(sK17),tptp0)
| ~ spl19_85 ),
inference(avatar_component_clause,[],[f1365]) ).
fof(f3286,plain,
( ! [X0,X1] :
( ~ min_precedes(X0,sK16(sK17),tptp0)
| min_precedes(sK16(sK17),sK14(sK17),X1)
| ~ occurrence_of(sK9(tptp0,X0,sK16(sK17)),X1)
| min_precedes(sK14(sK17),sK16(sK17),X1)
| ~ min_precedes(X0,sK16(sK17),tptp0) )
| ~ spl19_18
| spl19_32 ),
inference(resolution,[],[f1222,f174]) ).
fof(f3287,plain,
( ! [X0,X1] :
( ~ occurrence_of(sK9(tptp0,X0,sK16(sK17)),X1)
| min_precedes(sK16(sK17),sK14(sK17),X1)
| ~ min_precedes(X0,sK16(sK17),tptp0)
| min_precedes(sK14(sK17),sK16(sK17),X1) )
| ~ spl19_18
| spl19_32 ),
inference(duplicate_literal_removal,[],[f3286]) ).
fof(f3288,plain,
( ! [X0] :
( min_precedes(sK16(sK17),sK14(sK17),tptp0)
| ~ min_precedes(X0,sK16(sK17),tptp0)
| min_precedes(sK14(sK17),sK16(sK17),tptp0)
| ~ min_precedes(X0,sK16(sK17),tptp0) )
| ~ spl19_18
| spl19_32 ),
inference(resolution,[],[f3287,f174]) ).
fof(f3292,plain,
( ! [X0] :
( min_precedes(sK16(sK17),sK14(sK17),tptp0)
| ~ min_precedes(X0,sK16(sK17),tptp0)
| min_precedes(sK14(sK17),sK16(sK17),tptp0) )
| ~ spl19_18
| spl19_32 ),
inference(duplicate_literal_removal,[],[f3288]) ).
fof(f3294,plain,
( ! [X0] :
( ~ min_precedes(X0,sK16(sK17),tptp0)
| min_precedes(sK14(sK17),sK16(sK17),tptp0) )
| ~ spl19_18
| spl19_32
| ~ spl19_40 ),
inference(forward_subsumption_resolution,[],[f3292,f797]) ).
fof(f3295,plain,
( ! [X0] : ~ min_precedes(X0,sK16(sK17),tptp0)
| ~ spl19_18
| spl19_32
| ~ spl19_40
| spl19_43 ),
inference(forward_subsumption_resolution,[],[f3294,f819]) ).
fof(f3296,plain,
( spl19_85
| ~ spl19_18
| spl19_32
| ~ spl19_40
| spl19_43 ),
inference(avatar_split_clause,[],[f3295,f818,f796,f697,f485,f1365]) ).
fof(f3334,plain,
( ~ leaf(sK16(sK17),tptp0)
| ~ spl19_42 ),
inference(resolution,[],[f816,f158]) ).
fof(f3346,plain,
( $false
| ~ spl19_42 ),
inference(forward_subsumption_resolution,[],[f3334,f225]) ).
fof(f3347,plain,
~ spl19_42,
inference(avatar_contradiction_clause,[],[f3346]) ).
fof(f3374,plain,
( root(sK16(sK17),tptp0)
| ~ leaf(sK16(sK17),tptp0)
| ~ spl19_85 ),
inference(resolution,[],[f1366,f159]) ).
fof(f3381,plain,
( ~ leaf(sK16(sK17),tptp0)
| ~ spl19_85 ),
inference(forward_subsumption_resolution,[],[f3374,f347]) ).
fof(f3383,plain,
( $false
| ~ spl19_85 ),
inference(forward_subsumption_resolution,[],[f3381,f225]) ).
fof(f3384,plain,
~ spl19_85,
inference(avatar_contradiction_clause,[],[f3383]) ).
fof(f3408,plain,
( ~ occurrence_of(sK16(sK17),tptp2)
| ~ leaf(sK16(sK17),tptp0)
| ~ spl19_43 ),
inference(resolution,[],[f820,f269]) ).
fof(f3429,plain,
( ~ leaf(sK16(sK17),tptp0)
| ~ spl19_1
| ~ spl19_43 ),
inference(forward_subsumption_resolution,[],[f3408,f250]) ).
fof(f3432,plain,
( $false
| ~ spl19_1
| ~ spl19_43 ),
inference(forward_subsumption_resolution,[],[f3429,f225]) ).
fof(f3433,plain,
( ~ spl19_1
| ~ spl19_43 ),
inference(avatar_contradiction_clause,[],[f3432]) ).
cnf(s1,plain,
( spl19_1
| spl19_2 ),
inference(sat_conversion,[],[f255]) ).
cnf(s14,plain,
( ~ spl19_1
| spl19_18 ),
inference(sat_conversion,[],[f494]) ).
cnf(s15,plain,
( ~ spl19_2
| spl19_18 ),
inference(sat_conversion,[],[f496]) ).
cnf(s40,plain,
( ~ spl19_18
| spl19_32
| spl19_33 ),
inference(sat_conversion,[],[f703]) ).
cnf(s46,plain,
( ~ spl19_2
| ~ spl19_43 ),
inference(sat_conversion,[],[f832]) ).
cnf(s47,plain,
~ spl19_32,
inference(sat_conversion,[],[f865]) ).
cnf(s49,plain,
( ~ spl19_33
| spl19_40
| spl19_42
| spl19_43 ),
inference(sat_conversion,[],[f869]) ).
cnf(s145,plain,
( ~ spl19_18
| spl19_32
| ~ spl19_40
| spl19_43
| spl19_85 ),
inference(sat_conversion,[],[f3296]) ).
cnf(s149,plain,
~ spl19_42,
inference(sat_conversion,[],[f3347]) ).
cnf(s157,plain,
~ spl19_85,
inference(sat_conversion,[],[f3384]) ).
cnf(s163,plain,
( ~ spl19_1
| ~ spl19_43 ),
inference(sat_conversion,[],[f3433]) ).
cnf(s165,plain,
( ~ spl19_18
| spl19_32
| ~ spl19_40
| spl19_43 ),
inference(rat,[],[s145,s157]) ).
cnf(s171,plain,
( ~ spl19_33
| spl19_40
| spl19_43 ),
inference(rat,[],[s49,s149]) ).
cnf(s174,plain,
( ~ spl19_18
| spl19_33 ),
inference(rat,[],[s40,s47]) ).
cnf(s177,plain,
( ~ spl19_18
| spl19_43 ),
inference(rat,[],[s171,s174,s165,s47]) ).
cnf(s178,plain,
~ spl19_2,
inference(rat,[],[s177,s15,s46]) ).
cnf(s180,plain,
spl19_1,
inference(rat,[],[s1,s178]) ).
cnf(s181,plain,
~ spl19_43,
inference(rat,[],[s163,s180]) ).
cnf(s182,plain,
spl19_18,
inference(rat,[],[s14,s180]) ).
cnf(s183,plain,
$false,
inference(rat,[],[s177,s181,s182]) ).
fof(f3434,plain,
$false,
inference(avatar_sat_refutation,[],[s183]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : PRO014+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.38 % Computer : n013.cluster.edu
% 0.13/0.38 % Model : x86_64 x86_64
% 0.13/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.38 % Memory : 8046.5625MB
% 0.13/0.38 % OS : Linux 6.8.0-71-generic
% 0.13/0.38 % CPULimit : 300
% 0.13/0.38 % WCLimit : 300
% 0.13/0.38 % DateTime : Sun Sep 27 22:21:51 UTC 2026
% 0.13/0.38 % CPUTime :
% 0.13/0.38 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.41 Running first-order theorem proving
% 0.13/0.41 Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 9.40/2.19 % (609856)Detected formulas, will run a generic FOF schedule.
% 9.40/2.19 % (609864)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1961878189:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 9.40/2.19 % (609864)Refutation not found, incomplete strategy
% 9.40/2.19 % (609864)------------------------------
% 9.40/2.19 % (609864)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.40/2.19 % (609864)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.40/2.19 % (609864)CaDiCaL version: 2.1.3
% 9.40/2.19 % (609864)Termination reason: Refutation not found, incomplete strategy
% 9.40/2.19 % (609864)Time elapsed: 0.002 s
% 9.40/2.19 % (609864)Peak memory usage: 88 MB
% 9.40/2.19 % (609864)Instructions burned: 4 (million)
% 9.40/2.19 % (609862)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=2251186941:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 9.40/2.19 % (609865)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3849286923:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 9.40/2.19 % (609861)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=2552950799:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 9.40/2.19 % (609863)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=4150735851:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 9.40/2.19 % (609866)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=314048131:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 9.40/2.19 % (609867)dis-21_1_sil=8000:lcm=predicate:random_seed=845326981:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 9.40/2.19 % (609865)Instruction limit reached!
% 9.40/2.19 % (609865)------------------------------
% 9.40/2.19 % (609865)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.40/2.19 % (609865)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.40/2.19 % (609865)CaDiCaL version: 2.1.3
% 9.40/2.19 % (609865)Termination reason: Instruction limit
% 9.40/2.19 % (609865)Termination phase: Saturation
% 9.40/2.19 % (609865)Time elapsed: 0.074 s
% 9.40/2.19 % (609865)Peak memory usage: 88 MB
% 9.40/2.19 % (609865)Instructions burned: 120 (million)
% 9.40/2.19 % (609867)Instruction limit reached!
% 9.40/2.19 % (609867)------------------------------
% 9.40/2.19 % (609867)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.40/2.19 % (609867)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.40/2.19 % (609867)CaDiCaL version: 2.1.3
% 9.40/2.19 % (609867)Termination reason: Instruction limit
% 9.40/2.19 % (609867)Termination phase: Saturation
% 9.40/2.19 % (609867)Time elapsed: 0.077 s
% 9.40/2.19 % (609867)Peak memory usage: 89 MB
% 9.40/2.19 % (609867)Instructions burned: 129 (million)
% 9.40/2.19 % (609866)Instruction limit reached!
% 9.40/2.19 % (609866)------------------------------
% 9.40/2.19 % (609866)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.40/2.19 % (609866)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.40/2.19 % (609866)CaDiCaL version: 2.1.3
% 9.40/2.19 % (609866)Termination reason: Instruction limit
% 9.40/2.19 % (609866)Termination phase: Saturation
% 9.40/2.19 % (609866)Time elapsed: 0.102 s
% 9.40/2.19 % (609866)Peak memory usage: 90 MB
% 9.40/2.19 % (609866)Instructions burned: 140 (million)
% 9.40/2.19 % (609864)------------------------------
% 9.40/2.19 % (609864)------------------------------
% 9.40/2.19 % (609875)lrs+10_1_sil=8000:sp=occurrence:random_seed=3099297947:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 9.40/2.19 % (609878)dis+10_5:1_slsqr=1,4:sil=8000:fde=unused:erd=off:urr=full:fd=off:s2agt=8:br=off:slsq=on:random_seed=1856358123:s2a=on:i=248:s2at=1.23:gtg=position_2997 on theBenchmark for (2997ds/248Mi)
% 9.40/2.19 % (609876)lrs+10_1_sil=32000:urr=on:br=off:random_seed=1190049763:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 9.40/2.19 % (609877)lrs+1011_1_sil=32000:sp=occurrence:random_seed=2906367813:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 9.40/2.19 % (609876)Refutation not found, incomplete strategy
% 9.40/2.19 % (609876)------------------------------
% 9.40/2.19 % (609876)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.40/2.19 % (609876)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.40/2.19 % (609876)CaDiCaL version: 2.1.3
% 9.40/2.19 % (609876)Termination reason: Refutation not found, incomplete strategy
% 9.40/2.19 % (609876)Time elapsed: 0.013 s
% 9.40/2.19 % (609876)Peak memory usage: 88 MB
% 9.40/2.19 % (609876)Instructions burned: 21 (million)
% 9.40/2.19 % (609878)Instruction limit reached!
% 9.40/2.19 % (609878)------------------------------
% 9.40/2.19 % (609878)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.40/2.19 % (609878)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.40/2.19 % (609878)CaDiCaL version: 2.1.3
% 9.40/2.19 % (609878)Termination reason: Instruction limit
% 9.40/2.19 % (609878)Termination phase: Saturation
% 9.40/2.19 % (609878)Time elapsed: 0.072 s
% 9.40/2.19 % (609878)Peak memory usage: 89 MB
% 9.40/2.19 % (609878)Instructions burned: 252 (million)
% 9.40/2.19 % (609883)lrs+1002_1_to=lpo:sil=8000:sos=on:random_seed=3400750027:st=4:cts=off:i=294:sd=2:ins=7:amm=off:ss=axioms_2995 on theBenchmark for (2995ds/294Mi)
% 9.40/2.19 % (609875)Instruction limit reached!
% 9.40/2.19 % (609875)------------------------------
% 9.40/2.19 % (609875)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.40/2.19 % (609875)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.40/2.19 % (609875)CaDiCaL version: 2.1.3
% 9.40/2.19 % (609875)Termination reason: Instruction limit
% 9.40/2.19 % (609875)Termination phase: Saturation
% 9.40/2.19 % (609875)Time elapsed: 0.184 s
% 9.40/2.19 % (609875)Peak memory usage: 91 MB
% 9.40/2.19 % (609875)Instructions burned: 286 (million)
% 9.40/2.19 % (609883)Instruction limit reached!
% 9.40/2.19 % (609883)------------------------------
% 9.40/2.19 % (609883)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.40/2.19 % (609883)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.40/2.19 % (609883)CaDiCaL version: 2.1.3
% 9.40/2.19 % (609883)Termination reason: Instruction limit
% 9.40/2.19 % (609883)Termination phase: Saturation
% 9.40/2.19 % (609883)Time elapsed: 0.091 s
% 9.40/2.19 % (609883)Peak memory usage: 89 MB
% 9.40/2.19 % (609883)Instructions burned: 297 (million)
% 9.40/2.19 % (609877)Instruction limit reached!
% 9.40/2.19 % (609877)------------------------------
% 9.40/2.19 % (609877)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.40/2.19 % (609877)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.40/2.19 % (609877)CaDiCaL version: 2.1.3
% 9.40/2.19 % (609877)Termination reason: Instruction limit
% 9.40/2.19 % (609877)Termination phase: Saturation
% 9.40/2.19 % (609877)Time elapsed: 0.221 s
% 9.40/2.19 % (609877)Peak memory usage: 92 MB
% 9.40/2.19 % (609877)Instructions burned: 326 (million)
% 9.40/2.19 % (609876)------------------------------
% 9.40/2.19 % (609876)------------------------------
% 9.40/2.19 % (609885)lrs+10_1_ncem=casc2026/models/loop7.pt:sil=32000:tgt=ground:npcc=on:random_seed=3644107362:i=2350_2994 on theBenchmark for (2994ds/2350Mi)
% 9.40/2.19 % (609887)lrs-1004_1_sil=8000:sp=occurrence:sos=all:erd=off:fs=off:bce=on:random_seed=3222823748:i=127:av=off:fsr=off:sup=off_2994 on theBenchmark for (2994ds/127Mi)
% 9.40/2.19 % (609886)dis-1011_32:1_sfv=off:sil=16000:sos=all:erd=off:acc=on:fd=off:flr=on:random_seed=337197952:cts=off:i=113:fsr=off:ss=included:sgt=4_2994 on theBenchmark for (2994ds/113Mi)
% 9.40/2.19 % (609887)Instruction limit reached!
% 9.40/2.19 % (609887)------------------------------
% 9.40/2.19 % (609887)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.40/2.19 % (609887)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.40/2.19 % (609887)CaDiCaL version: 2.1.3
% 9.40/2.19 % (609887)Termination reason: Instruction limit
% 9.40/2.19 % (609887)Termination phase: Saturation
% 9.40/2.19 % (609887)Time elapsed: 0.036 s
% 9.40/2.19 % (609887)Peak memory usage: 89 MB
% 9.40/2.19 % (609887)Instructions burned: 128 (million)
% 9.40/2.19 % (609888)dis-1003_1024_sil=8000:sos=all:sac=on:random_seed=680612991:cond=fast:i=114:sd=1:nm=0:fsr=off:gtg=exists_sym:ss=axioms_2993 on theBenchmark for (2993ds/114Mi)
% 9.40/2.19 % (609886)Instruction limit reached!
% 9.40/2.19 % (609886)------------------------------
% 9.40/2.19 % (609886)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.40/2.19 % (609886)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.40/2.19 % (609886)CaDiCaL version: 2.1.3
% 9.40/2.19 % (609886)Termination reason: Instruction limit
% 9.40/2.19 % (609886)Termination phase: Saturation
% 9.40/2.19 % (609886)Time elapsed: 0.080 s
% 9.40/2.19 % (609886)Peak memory usage: 90 MB
% 9.40/2.19 % (609886)Instructions burned: 114 (million)
% 9.40/2.19 % (609888)Instruction limit reached!
% 9.40/2.19 % (609888)------------------------------
% 9.40/2.19 % (609888)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.40/2.19 % (609888)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.40/2.19 % (609888)CaDiCaL version: 2.1.3
% 9.40/2.19 % (609888)Termination reason: Instruction limit
% 9.40/2.19 % (609888)Termination phase: Saturation
% 9.40/2.19 % (609888)Time elapsed: 0.072 s
% 9.40/2.19 % (609888)Peak memory usage: 89 MB
% 9.40/2.19 % (609888)Instructions burned: 114 (million)
% 9.40/2.19 % (609892)lrs+10_1_sil=8000:sp=occurrence:random_seed=2827084208:st=1.2:i=907:sd=14:ss=axioms:sgt=12_2992 on theBenchmark for (2992ds/907Mi)
% 9.40/2.19 % (609894)dis-1010_1_sil=16000:fde=unused:sp=occurrence:sos=on:random_seed=235283045:i=437:sd=1:aac=none:ss=included_2992 on theBenchmark for (2992ds/437Mi)
% 9.40/2.19 % (609895)lrs-1002_1_ncem=casc2026/models/all5champsBiggishL14.pt:sil=16000:npcc=on:random_seed=960212289:i=5202:ss=axioms:sgt=16_2991 on theBenchmark for (2991ds/5202Mi)
% 9.40/2.19 % (609861)First to succeed.
% 9.40/2.19 % (609861)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-609856"
% 9.40/2.19 % (609862)Also succeeded, but the first one will report.
% 9.40/2.19 % (609894)Instruction limit reached!
% 9.40/2.19 % (609894)------------------------------
% 9.40/2.19 % (609894)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.40/2.19 % (609894)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.40/2.19 % (609894)CaDiCaL version: 2.1.3
% 9.40/2.19 % (609894)Termination reason: Instruction limit
% 9.40/2.19 % (609894)Termination phase: Saturation
% 9.40/2.19 % (609894)Time elapsed: 0.253 s
% 9.40/2.19 % (609894)Peak memory usage: 90 MB
% 9.40/2.19 % (609894)Instructions burned: 438 (million)
% 9.40/2.19 % (609899)dis+10_3:1_sil=8000:acc=on:urr=on:br=off:sac=on:newcnf=on:random_seed=1231723561:i=134:sd=2:doe=on:nm=16:sup=off:ss=included_2988 on theBenchmark for (2988ds/134Mi)
% 9.40/2.19 % (609861)Refutation found. Thanks to Tanya!
% 9.40/2.19 % SZS status Theorem for theBenchmark
% 9.40/2.19 % SZS output start Proof for theBenchmark
% See solution above
% 9.91/2.28 % (609861)------------------------------
% 9.91/2.28 % (609861)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.91/2.28 % (609861)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.91/2.28 % (609861)CaDiCaL version: 2.1.3
% 9.91/2.28 % (609861)Termination reason: Refutation
% 9.91/2.28 % (609861)Time elapsed: 0.941 s
% 9.91/2.28 % (609861)Peak memory usage: 133 MB
% 9.91/2.28 % (609861)Instructions burned: 1405 (million)
% 9.91/2.28 % (609861)------------------------------
% 9.91/2.28 % (609861)------------------------------
% 9.91/2.28 % (609856)Success in time 1.341 s
% 9.91/2.28 % Vampire exiting
%------------------------------------------------------------------------------