%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : PRO018+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n017.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:29 PM UTC 2026
% Result : Theorem 12.09s 2.75s
% Output : Refutation 13.83s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 24
% Syntax : Number of formulae : 186 ( 28 unt; 9 def)
% Number of atoms : 696 ( 49 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 811 ( 301 ~; 324 |; 156 &)
% ( 16 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 24 ( 22 usr; 9 prp; 0-3 aty)
% Number of functors : 20 ( 20 usr; 7 con; 0-3 aty)
% Number of variables : 268 ( 0 sgn 212 !; 56 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( occurrence_of(X1,X0)
=> ( activity(X0)
& activity_occurrence(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos) ).
fof(f2,axiom,
! [X0] :
( activity_occurrence(X0)
=> ? [X1] :
( activity(X1)
& occurrence_of(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_01) ).
fof(f3,axiom,
! [X0,X1,X2] :
( ( occurrence_of(X0,X1)
& occurrence_of(X0,X2) )
=> X1 = X2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_02) ).
fof(f8,axiom,
! [X0,X1] :
( occurrence_of(X0,X1)
=> ( arboreal(X0)
<=> atomic(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_07) ).
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/sandbox/benchmark/theBenchmark.p',sos_11) ).
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/sandbox/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/sandbox/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/sandbox/benchmark/theBenchmark.p',sos_23) ).
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/sandbox/benchmark/theBenchmark.p',sos_25) ).
fof(f35,axiom,
! [X0,X1] :
( leaf_occ(X0,X1)
<=> ? [X2] :
( occurrence_of(X1,X2)
& subactivity_occurrence(X0,X1)
& leaf(X0,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_34) ).
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)
& 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_35) ).
fof(f43,axiom,
tptp4 != tptp3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_42) ).
fof(f46,axiom,
tptp3 != tptp1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_45) ).
fof(f47,axiom,
tptp3 != tptp2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_46) ).
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,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(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,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)],[f49]) ).
fof(f51,plain,
! [X0,X1] :
( ( activity(X0)
& activity_occurrence(X1) )
| ~ occurrence_of(X1,X0) ),
inference(ennf_transformation,[],[f1]) ).
fof(f52,plain,
! [X0] :
( ? [X1] :
( activity(X1)
& occurrence_of(X0,X1) )
| ~ activity_occurrence(X0) ),
inference(ennf_transformation,[],[f2]) ).
fof(f53,plain,
! [X0,X1,X2] :
( X1 = X2
| ~ occurrence_of(X0,X1)
| ~ occurrence_of(X0,X2) ),
inference(ennf_transformation,[],[f3]) ).
fof(f54,plain,
! [X0,X1,X2] :
( X1 = X2
| ~ occurrence_of(X0,X1)
| ~ occurrence_of(X0,X2) ),
inference(flattening,[],[f53]) ).
fof(f61,plain,
! [X0,X1] :
( ( arboreal(X0)
<=> atomic(X1) )
| ~ occurrence_of(X0,X1) ),
inference(ennf_transformation,[],[f8]) ).
fof(f65,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(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(f96,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,[],[f36]) ).
fof(f97,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,[],[f96]) ).
fof(f98,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,[],[f50]) ).
fof(f99,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,[],[f98]) ).
fof(f100,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(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) )
| sP0(X2,X3) )
& occurrence_of(X1,tptp0)
& subactivity_occurrence(X0,X1)
& arboreal(X0)
& ~ leaf_occ(X0,X1) ),
inference(definition_folding,[],[f99,f100]) ).
fof(f102,plain,
! [X0] :
( ( activity(sK1(X0))
& occurrence_of(X0,sK1(X0)) )
| ~ activity_occurrence(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(X1,sK1(X0))],[f52]) ).
fof(f103,plain,
! [X0,X1] :
( ( ( arboreal(X0)
| ~ atomic(X1) )
& ( atomic(X1)
| ~ arboreal(X0) ) )
| ~ occurrence_of(X0,X1) ),
inference(nnf_transformation,[],[f61]) ).
fof(f106,plain,
! [X0,X1,X2] :
( ( subactivity(sK2(X0,X1,X2),X0)
& subactivity(sK3(X0,X1,X2),X0)
& atocc(X1,sK2(X0,X1,X2))
& atocc(X2,sK3(X0,X1,X2)) )
| ~ min_precedes(X1,X2,X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2,sK3]),skolemize(X3,sK2(X0,X1,X2)),skolemize(X4,sK3(X0,X1,X2))],[f65]) ).
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)
| ? [X2] : min_precedes(X2,X0,X1) )
& ! [X3] : ~ min_precedes(X0,X3,X1) )
| ~ leaf(X0,X1) ) ),
inference(nnf_transformation,[],[f78]) ).
fof(f110,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,[],[f109]) ).
fof(f111,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,[],[f110]) ).
fof(f112,plain,
! [X0,X1] :
( ( leaf(X0,X1)
| ( ~ root(X0,X1)
& ! [X2] : ~ min_precedes(X2,X0,X1) )
| min_precedes(X0,sK6(X0,X1),X1) )
& ( ( ( root(X0,X1)
| min_precedes(sK7(X0,X1),X0,X1) )
& ! [X5] : ~ min_precedes(X0,X5,X1) )
| ~ leaf(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK6,sK7]),skolemize(X3,sK6(X0,X1)),skolemize(X4,sK7(X0,X1))],[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)
& ! [X3] :
( ~ min_precedes(X0,X3,X2)
| ~ min_precedes(X3,X1,X2) ) )
| ~ next_subocc(X0,X1,X2) ) ),
inference(nnf_transformation,[],[f79]) ).
fof(f114,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,[],[f113]) ).
fof(f115,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,[],[f114]) ).
fof(f116,plain,
! [X0,X1,X2] :
( ( next_subocc(X0,X1,X2)
| ~ min_precedes(X0,X1,X2)
| ( min_precedes(X0,sK8(X0,X1,X2),X2)
& min_precedes(sK8(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,[sK8]),skolemize(X3,sK8(X0,X1,X2))],[f115]) ).
fof(f117,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(f118,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,[],[f117]) ).
fof(f119,plain,
! [X0,X1] :
( ( atocc(X0,X1)
| ! [X2] :
( ~ subactivity(X1,X2)
| ~ atomic(X2)
| ~ occurrence_of(X0,X2) ) )
& ( ( subactivity(X1,sK9(X0,X1))
& atomic(sK9(X0,X1))
& occurrence_of(X0,sK9(X0,X1)) )
| ~ atocc(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK9]),skolemize(X3,sK9(X0,X1))],[f118]) ).
fof(f120,plain,
! [X0,X1,X2] :
( ( occurrence_of(sK10(X0,X1,X2),X0)
& subactivity_occurrence(X1,sK10(X0,X1,X2))
& subactivity_occurrence(X2,sK10(X0,X1,X2)) )
| ~ min_precedes(X1,X2,X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK10]),skolemize(X3,sK10(X0,X1,X2))],[f81]) ).
fof(f124,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(f125,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,[],[f124]) ).
fof(f126,plain,
! [X0,X1] :
( ( leaf_occ(X0,X1)
| ! [X2] :
( ~ occurrence_of(X1,X2)
| ~ subactivity_occurrence(X0,X1)
| ~ leaf(X0,X2) ) )
& ( ( occurrence_of(X1,sK14(X0,X1))
& subactivity_occurrence(X0,X1)
& leaf(X0,sK14(X0,X1)) )
| ~ leaf_occ(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK14]),skolemize(X3,sK14(X0,X1))],[f125]) ).
fof(f127,plain,
! [X0,X1] :
( ( occurrence_of(sK15(X0),tptp3)
& next_subocc(X0,sK15(X0),tptp0)
& occurrence_of(sK16(X0),tptp4)
& min_precedes(sK15(X0),sK16(X0),tptp0)
& ( occurrence_of(sK17(X0),tptp1)
| occurrence_of(sK17(X0),tptp2) )
& min_precedes(sK16(X0),sK17(X0),tptp0)
& ! [X5] :
( sK16(X0) = X5
| sK17(X0) = X5
| ~ min_precedes(sK15(X0),X5,tptp0) ) )
| ~ occurrence_of(X1,tptp0)
| ~ subactivity_occurrence(X0,X1)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK15,sK16,sK17]),skolemize(X2,sK15(X0)),skolemize(X3,sK16(X0)),skolemize(X4,sK17(X0))],[f97]) ).
fof(f131,plain,
( ! [X2,X3] :
( ~ occurrence_of(X2,tptp3)
| ~ next_subocc(sK19,X2,tptp0)
| ( ~ occurrence_of(X3,tptp1)
& ~ occurrence_of(X3,tptp2) )
| ~ min_precedes(X2,X3,tptp0)
| ~ leaf_occ(X3,sK20)
| ( occurrence_of(sK21(X2),tptp2)
& min_precedes(X2,sK21(X2),tptp0)
& occurrence_of(X3,tptp1) )
| sP0(X2,X3) )
& occurrence_of(sK20,tptp0)
& subactivity_occurrence(sK19,sK20)
& arboreal(sK19)
& ~ leaf_occ(sK19,sK20) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK19,sK20,sK21]),skolemize(X0,sK19),skolemize(X1,sK20),skolemize(X4,sK21(X2))],[f101]) ).
fof(f132,plain,
! [X0,X1] :
( ~ occurrence_of(X1,X0)
| activity_occurrence(X1) ),
inference(cnf_transformation,[],[f51]) ).
fof(f134,plain,
! [X0] :
( occurrence_of(X0,sK1(X0))
| ~ activity_occurrence(X0) ),
inference(cnf_transformation,[],[f102]) ).
fof(f136,plain,
! [X2,X0,X1] :
( ~ occurrence_of(X0,X2)
| ~ occurrence_of(X0,X1)
| X1 = X2 ),
inference(cnf_transformation,[],[f54]) ).
fof(f142,plain,
! [X0,X1] :
( ~ occurrence_of(X0,X1)
| ~ atomic(X1)
| arboreal(X0) ),
inference(cnf_transformation,[],[f103]) ).
fof(f149,plain,
! [X2,X0,X1] :
( atocc(X1,sK2(X0,X1,X2))
| ~ min_precedes(X1,X2,X0) ),
inference(cnf_transformation,[],[f106]) ).
fof(f163,plain,
! [X0,X1,X5] :
( ~ min_precedes(X0,X5,X1)
| ~ leaf(X0,X1) ),
inference(cnf_transformation,[],[f112]) ).
fof(f168,plain,
! [X2,X0,X1] :
( ~ next_subocc(X0,X1,X2)
| min_precedes(X0,X1,X2) ),
inference(cnf_transformation,[],[f116]) ).
fof(f171,plain,
! [X0,X1] :
( occurrence_of(X0,sK9(X0,X1))
| ~ atocc(X0,X1) ),
inference(cnf_transformation,[],[f119]) ).
fof(f172,plain,
! [X0,X1] :
( atomic(sK9(X0,X1))
| ~ atocc(X0,X1) ),
inference(cnf_transformation,[],[f119]) ).
fof(f178,plain,
! [X2,X0,X1] :
( subactivity_occurrence(X1,sK10(X0,X1,X2))
| ~ min_precedes(X1,X2,X0) ),
inference(cnf_transformation,[],[f120]) ).
fof(f179,plain,
! [X2,X0,X1] :
( occurrence_of(sK10(X0,X1,X2),X0)
| ~ min_precedes(X1,X2,X0) ),
inference(cnf_transformation,[],[f120]) ).
fof(f190,plain,
! [X0,X1] :
( leaf(X0,sK14(X0,X1))
| ~ leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f126]) ).
fof(f192,plain,
! [X0,X1] :
( occurrence_of(X1,sK14(X0,X1))
| ~ leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f126]) ).
fof(f194,plain,
! [X0,X1,X5] :
( ~ min_precedes(sK15(X0),X5,tptp0)
| sK17(X0) = X5
| sK16(X0) = X5
| ~ occurrence_of(X1,tptp0)
| ~ subactivity_occurrence(X0,X1)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f127]) ).
fof(f196,plain,
! [X0,X1] :
( ~ subactivity_occurrence(X0,X1)
| occurrence_of(sK17(X0),tptp2)
| ~ occurrence_of(X1,tptp0)
| occurrence_of(sK17(X0),tptp1)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f127]) ).
fof(f197,plain,
! [X0,X1] :
( ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0)
| min_precedes(sK15(X0),sK16(X0),tptp0)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f127]) ).
fof(f198,plain,
! [X0,X1] :
( ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0)
| occurrence_of(sK16(X0),tptp4)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f127]) ).
fof(f199,plain,
! [X0,X1] :
( ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0)
| next_subocc(X0,sK15(X0),tptp0)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f127]) ).
fof(f200,plain,
! [X0,X1] :
( ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0)
| occurrence_of(sK15(X0),tptp3)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f127]) ).
fof(f207,plain,
tptp3 != tptp4,
inference(cnf_transformation,[],[f43]) ).
fof(f210,plain,
tptp3 != tptp1,
inference(cnf_transformation,[],[f46]) ).
fof(f211,plain,
tptp3 != tptp2,
inference(cnf_transformation,[],[f47]) ).
fof(f216,plain,
~ leaf_occ(sK19,sK20),
inference(cnf_transformation,[],[f131]) ).
fof(f217,plain,
arboreal(sK19),
inference(cnf_transformation,[],[f131]) ).
fof(f218,plain,
subactivity_occurrence(sK19,sK20),
inference(cnf_transformation,[],[f131]) ).
fof(f219,plain,
occurrence_of(sK20,tptp0),
inference(cnf_transformation,[],[f131]) ).
fof(f234,plain,
( ~ occurrence_of(sK20,tptp0)
| occurrence_of(sK16(sK19),tptp4)
| ~ arboreal(sK19)
| leaf_occ(sK19,sK20) ),
inference(resolution,[],[f198,f218]) ).
fof(f235,plain,
( occurrence_of(sK16(sK19),tptp4)
| ~ arboreal(sK19)
| leaf_occ(sK19,sK20) ),
inference(forward_subsumption_resolution,[],[f234,f219]) ).
fof(f236,plain,
( occurrence_of(sK16(sK19),tptp4)
| leaf_occ(sK19,sK20) ),
inference(forward_subsumption_resolution,[],[f235,f217]) ).
fof(f237,plain,
occurrence_of(sK16(sK19),tptp4),
inference(forward_subsumption_resolution,[],[f236,f216]) ).
fof(f238,plain,
( ~ occurrence_of(sK20,tptp0)
| min_precedes(sK15(sK19),sK16(sK19),tptp0)
| ~ arboreal(sK19)
| leaf_occ(sK19,sK20) ),
inference(resolution,[],[f197,f218]) ).
fof(f239,plain,
( min_precedes(sK15(sK19),sK16(sK19),tptp0)
| ~ arboreal(sK19)
| leaf_occ(sK19,sK20) ),
inference(forward_subsumption_resolution,[],[f238,f219]) ).
fof(f240,plain,
( min_precedes(sK15(sK19),sK16(sK19),tptp0)
| leaf_occ(sK19,sK20) ),
inference(forward_subsumption_resolution,[],[f239,f217]) ).
fof(f241,plain,
min_precedes(sK15(sK19),sK16(sK19),tptp0),
inference(forward_subsumption_resolution,[],[f240,f216]) ).
fof(f250,plain,
( occurrence_of(sK17(sK19),tptp2)
| ~ occurrence_of(sK20,tptp0)
| occurrence_of(sK17(sK19),tptp1)
| ~ arboreal(sK19)
| leaf_occ(sK19,sK20) ),
inference(resolution,[],[f196,f218]) ).
fof(f251,plain,
( occurrence_of(sK17(sK19),tptp2)
| occurrence_of(sK17(sK19),tptp1)
| ~ arboreal(sK19)
| leaf_occ(sK19,sK20) ),
inference(forward_subsumption_resolution,[],[f250,f219]) ).
fof(f252,plain,
( occurrence_of(sK17(sK19),tptp2)
| occurrence_of(sK17(sK19),tptp1)
| leaf_occ(sK19,sK20) ),
inference(forward_subsumption_resolution,[],[f251,f217]) ).
fof(f253,plain,
( occurrence_of(sK17(sK19),tptp2)
| occurrence_of(sK17(sK19),tptp1) ),
inference(forward_subsumption_resolution,[],[f252,f216]) ).
fof(f255,definition,
( spl22_1
<=> occurrence_of(sK17(sK19),tptp1) ),
introduced(definition,[new_symbols(definition,[spl22_1])],[avatar_definition]) ).
fof(f257,plain,
( occurrence_of(sK17(sK19),tptp1)
| ~ spl22_1 ),
inference(avatar_component_clause,[],[f255]) ).
fof(f259,definition,
( spl22_2
<=> occurrence_of(sK17(sK19),tptp2) ),
introduced(definition,[new_symbols(definition,[spl22_2])],[avatar_definition]) ).
fof(f261,plain,
( occurrence_of(sK17(sK19),tptp2)
| ~ spl22_2 ),
inference(avatar_component_clause,[],[f259]) ).
fof(f262,plain,
( spl22_1
| spl22_2 ),
inference(avatar_split_clause,[],[f253,f259,f255]) ).
fof(f285,plain,
! [X0] :
( ~ occurrence_of(sK16(sK19),X0)
| tptp4 = X0 ),
inference(resolution,[],[f136,f237]) ).
fof(f323,plain,
! [X2,X0,X1] :
( ~ occurrence_of(sK10(X2,X0,X1),tptp0)
| ~ min_precedes(X0,X1,X2)
| next_subocc(X0,sK15(X0),tptp0)
| ~ arboreal(X0)
| leaf_occ(X0,sK10(X2,X0,X1)) ),
inference(resolution,[],[f178,f199]) ).
fof(f324,plain,
! [X2,X0,X1] :
( ~ occurrence_of(sK10(X2,X0,X1),tptp0)
| ~ min_precedes(X0,X1,X2)
| occurrence_of(sK15(X0),tptp3)
| ~ arboreal(X0)
| leaf_occ(X0,sK10(X2,X0,X1)) ),
inference(resolution,[],[f178,f200]) ).
fof(f326,plain,
~ leaf(sK15(sK19),tptp0),
inference(resolution,[],[f163,f241]) ).
fof(f332,plain,
! [X0,X1] :
( ~ min_precedes(X0,X1,tptp0)
| next_subocc(X0,sK15(X0),tptp0)
| ~ arboreal(X0)
| leaf_occ(X0,sK10(tptp0,X0,X1))
| ~ min_precedes(X0,X1,tptp0) ),
inference(resolution,[],[f323,f179]) ).
fof(f333,plain,
! [X0,X1] :
( leaf_occ(X0,sK10(tptp0,X0,X1))
| next_subocc(X0,sK15(X0),tptp0)
| ~ arboreal(X0)
| ~ min_precedes(X0,X1,tptp0) ),
inference(duplicate_literal_removal,[],[f332]) ).
fof(f341,plain,
! [X0,X1] :
( ~ min_precedes(X0,X1,tptp0)
| occurrence_of(sK15(X0),tptp3)
| ~ arboreal(X0)
| leaf_occ(X0,sK10(tptp0,X0,X1))
| ~ min_precedes(X0,X1,tptp0) ),
inference(resolution,[],[f324,f179]) ).
fof(f342,plain,
! [X0,X1] :
( leaf_occ(X0,sK10(tptp0,X0,X1))
| occurrence_of(sK15(X0),tptp3)
| ~ arboreal(X0)
| ~ min_precedes(X0,X1,tptp0) ),
inference(duplicate_literal_removal,[],[f341]) ).
fof(f359,definition,
( spl22_7
<=> ! [X0] :
( ~ occurrence_of(X0,tptp0)
| leaf_occ(sK19,X0)
| ~ subactivity_occurrence(sK19,X0) ) ),
introduced(definition,[new_symbols(definition,[spl22_7])],[avatar_definition]) ).
fof(f360,plain,
( ! [X0] :
( ~ subactivity_occurrence(sK19,X0)
| leaf_occ(sK19,X0)
| ~ occurrence_of(X0,tptp0) )
| ~ spl22_7 ),
inference(avatar_component_clause,[],[f359]) ).
fof(f537,definition,
( spl22_22
<=> occurrence_of(sK15(sK15(sK19)),tptp3) ),
introduced(definition,[new_symbols(definition,[spl22_22])],[avatar_definition]) ).
fof(f539,plain,
( occurrence_of(sK15(sK15(sK19)),tptp3)
| ~ spl22_22 ),
inference(avatar_component_clause,[],[f537]) ).
fof(f545,definition,
( spl22_24
<=> next_subocc(sK15(sK19),sK15(sK15(sK19)),tptp0) ),
introduced(definition,[new_symbols(definition,[spl22_24])],[avatar_definition]) ).
fof(f546,plain,
( ~ next_subocc(sK15(sK19),sK15(sK15(sK19)),tptp0)
| spl22_24 ),
inference(avatar_component_clause,[],[f545]) ).
fof(f547,plain,
( next_subocc(sK15(sK19),sK15(sK15(sK19)),tptp0)
| ~ spl22_24 ),
inference(avatar_component_clause,[],[f545]) ).
fof(f608,plain,
( ! [X0] :
( ~ occurrence_of(sK15(sK15(sK19)),X0)
| tptp3 = X0 )
| ~ spl22_22 ),
inference(resolution,[],[f539,f136]) ).
fof(f611,plain,
( min_precedes(sK15(sK19),sK15(sK15(sK19)),tptp0)
| ~ spl22_24 ),
inference(resolution,[],[f547,f168]) ).
fof(f618,plain,
( ! [X0] :
( sK17(sK19) = sK15(sK15(sK19))
| sK16(sK19) = sK15(sK15(sK19))
| ~ occurrence_of(X0,tptp0)
| ~ subactivity_occurrence(sK19,X0)
| ~ arboreal(sK19)
| leaf_occ(sK19,X0) )
| ~ spl22_24 ),
inference(resolution,[],[f611,f194]) ).
fof(f623,plain,
( ! [X0] :
( sK17(sK19) = sK15(sK15(sK19))
| sK16(sK19) = sK15(sK15(sK19))
| ~ occurrence_of(X0,tptp0)
| ~ subactivity_occurrence(sK19,X0)
| leaf_occ(sK19,X0) )
| ~ spl22_24 ),
inference(forward_subsumption_resolution,[],[f618,f217]) ).
fof(f643,definition,
( spl22_35
<=> sK16(sK19) = sK15(sK15(sK19)) ),
introduced(definition,[new_symbols(definition,[spl22_35])],[avatar_definition]) ).
fof(f645,plain,
( sK16(sK19) = sK15(sK15(sK19))
| ~ spl22_35 ),
inference(avatar_component_clause,[],[f643]) ).
fof(f647,definition,
( spl22_36
<=> sK17(sK19) = sK15(sK15(sK19)) ),
introduced(definition,[new_symbols(definition,[spl22_36])],[avatar_definition]) ).
fof(f649,plain,
( sK17(sK19) = sK15(sK15(sK19))
| ~ spl22_36 ),
inference(avatar_component_clause,[],[f647]) ).
fof(f650,plain,
( spl22_7
| spl22_35
| spl22_36
| ~ spl22_24 ),
inference(avatar_split_clause,[],[f623,f545,f647,f643,f359]) ).
fof(f673,plain,
( activity_occurrence(sK15(sK15(sK19)))
| ~ spl22_22 ),
inference(resolution,[],[f132,f539]) ).
fof(f674,plain,
activity_occurrence(sK16(sK19)),
inference(resolution,[],[f132,f237]) ).
fof(f1003,plain,
! [X0,X1] :
( ~ activity_occurrence(X0)
| ~ occurrence_of(X0,X1)
| sK1(X0) = X1 ),
inference(resolution,[],[f134,f136]) ).
fof(f1008,plain,
( ~ activity_occurrence(sK15(sK15(sK19)))
| tptp3 = sK1(sK15(sK15(sK19)))
| ~ spl22_22 ),
inference(resolution,[],[f134,f608]) ).
fof(f1009,plain,
( ~ activity_occurrence(sK16(sK19))
| tptp4 = sK1(sK16(sK19)) ),
inference(resolution,[],[f134,f285]) ).
fof(f1020,plain,
tptp4 = sK1(sK16(sK19)),
inference(forward_subsumption_resolution,[],[f1009,f674]) ).
fof(f1021,plain,
( tptp3 = sK1(sK15(sK15(sK19)))
| ~ spl22_22 ),
inference(forward_subsumption_resolution,[],[f1008,f673]) ).
fof(f1026,plain,
! [X0,X1] :
( ~ occurrence_of(X0,X1)
| sK1(X0) = X1 ),
inference(forward_subsumption_resolution,[],[f1003,f132]) ).
fof(f1030,plain,
! [X0,X1] :
( ~ leaf_occ(X1,X0)
| sK1(X0) = sK14(X1,X0) ),
inference(resolution,[],[f1026,f192]) ).
fof(f1032,plain,
! [X2,X0,X1] :
( ~ min_precedes(X1,X2,X0)
| sK1(sK10(X0,X1,X2)) = X0 ),
inference(resolution,[],[f1026,f179]) ).
fof(f1045,plain,
tptp0 = sK1(sK10(tptp0,sK15(sK19),sK16(sK19))),
inference(resolution,[],[f1032,f241]) ).
fof(f1746,plain,
( tptp1 = sK1(sK17(sK19))
| ~ spl22_1 ),
inference(resolution,[],[f257,f1026]) ).
fof(f2258,plain,
! [X0,X1] :
( ~ atocc(X0,X1)
| ~ atomic(sK9(X0,X1))
| arboreal(X0) ),
inference(resolution,[],[f171,f142]) ).
fof(f2288,plain,
! [X0,X1] :
( ~ atocc(X0,X1)
| arboreal(X0) ),
inference(forward_subsumption_resolution,[],[f2258,f172]) ).
fof(f2309,plain,
! [X2,X0,X1] :
( ~ min_precedes(X0,X1,X2)
| arboreal(X0) ),
inference(resolution,[],[f149,f2288]) ).
fof(f2795,definition,
( spl22_136
<=> leaf_occ(sK15(sK19),sK10(tptp0,sK15(sK19),sK16(sK19))) ),
introduced(definition,[new_symbols(definition,[spl22_136])],[avatar_definition]) ).
fof(f2796,plain,
( leaf_occ(sK15(sK19),sK10(tptp0,sK15(sK19),sK16(sK19)))
| ~ spl22_136 ),
inference(avatar_component_clause,[],[f2795]) ).
fof(f2797,plain,
( ~ leaf_occ(sK15(sK19),sK10(tptp0,sK15(sK19),sK16(sK19)))
| spl22_136 ),
inference(avatar_component_clause,[],[f2795]) ).
fof(f2805,plain,
( occurrence_of(sK15(sK15(sK19)),tptp3)
| ~ arboreal(sK15(sK19))
| ~ min_precedes(sK15(sK19),sK16(sK19),tptp0)
| spl22_136 ),
inference(resolution,[],[f2797,f342]) ).
fof(f2806,plain,
( next_subocc(sK15(sK19),sK15(sK15(sK19)),tptp0)
| ~ arboreal(sK15(sK19))
| ~ min_precedes(sK15(sK19),sK16(sK19),tptp0)
| spl22_136 ),
inference(resolution,[],[f2797,f333]) ).
fof(f2807,plain,
( next_subocc(sK15(sK19),sK15(sK15(sK19)),tptp0)
| ~ min_precedes(sK15(sK19),sK16(sK19),tptp0)
| spl22_136 ),
inference(forward_subsumption_resolution,[],[f2806,f2309]) ).
fof(f2809,plain,
( ~ min_precedes(sK15(sK19),sK16(sK19),tptp0)
| spl22_24
| spl22_136 ),
inference(forward_subsumption_resolution,[],[f2807,f546]) ).
fof(f2811,plain,
( $false
| spl22_24
| spl22_136 ),
inference(forward_subsumption_resolution,[],[f2809,f241]) ).
fof(f2812,plain,
( spl22_24
| spl22_136 ),
inference(avatar_contradiction_clause,[],[f2811]) ).
fof(f2818,plain,
( tptp3 = sK1(sK17(sK19))
| ~ spl22_22
| ~ spl22_36 ),
inference(superposition,[],[f1021,f649]) ).
fof(f2822,plain,
( tptp3 = tptp1
| ~ spl22_1
| ~ spl22_22
| ~ spl22_36 ),
inference(forward_demodulation,[],[f2818,f1746]) ).
fof(f2825,plain,
( $false
| ~ spl22_1
| ~ spl22_22
| ~ spl22_36 ),
inference(forward_subsumption_resolution,[],[f2822,f210]) ).
fof(f2826,plain,
( ~ spl22_1
| ~ spl22_22
| ~ spl22_36 ),
inference(avatar_contradiction_clause,[],[f2825]) ).
fof(f2861,plain,
( occurrence_of(sK15(sK15(sK19)),tptp3)
| ~ min_precedes(sK15(sK19),sK16(sK19),tptp0)
| spl22_136 ),
inference(forward_subsumption_resolution,[],[f2805,f2309]) ).
fof(f2872,plain,
( occurrence_of(sK15(sK15(sK19)),tptp3)
| spl22_136 ),
inference(forward_subsumption_resolution,[],[f2861,f241]) ).
fof(f2989,plain,
( sK1(sK10(tptp0,sK15(sK19),sK16(sK19))) = sK14(sK15(sK19),sK10(tptp0,sK15(sK19),sK16(sK19)))
| ~ spl22_136 ),
inference(resolution,[],[f2796,f1030]) ).
fof(f2991,plain,
( tptp0 = sK14(sK15(sK19),sK10(tptp0,sK15(sK19),sK16(sK19)))
| ~ spl22_136 ),
inference(forward_demodulation,[],[f2989,f1045]) ).
fof(f2994,plain,
( leaf(sK15(sK19),tptp0)
| ~ leaf_occ(sK15(sK19),sK10(tptp0,sK15(sK19),sK16(sK19)))
| ~ spl22_136 ),
inference(superposition,[],[f190,f2991]) ).
fof(f2997,plain,
( ~ leaf_occ(sK15(sK19),sK10(tptp0,sK15(sK19),sK16(sK19)))
| ~ spl22_136 ),
inference(forward_subsumption_resolution,[],[f2994,f326]) ).
fof(f2999,plain,
( $false
| ~ spl22_136 ),
inference(forward_subsumption_resolution,[],[f2997,f2796]) ).
fof(f3000,plain,
~ spl22_136,
inference(avatar_contradiction_clause,[],[f2999]) ).
fof(f3030,plain,
( spl22_22
| spl22_136 ),
inference(avatar_split_clause,[],[f2872,f2795,f537]) ).
fof(f3055,plain,
( leaf_occ(sK19,sK20)
| ~ occurrence_of(sK20,tptp0)
| ~ spl22_7 ),
inference(resolution,[],[f360,f218]) ).
fof(f3074,plain,
( ~ occurrence_of(sK20,tptp0)
| ~ spl22_7 ),
inference(forward_subsumption_resolution,[],[f3055,f216]) ).
fof(f3084,plain,
( $false
| ~ spl22_7 ),
inference(forward_subsumption_resolution,[],[f3074,f219]) ).
fof(f3085,plain,
~ spl22_7,
inference(avatar_contradiction_clause,[],[f3084]) ).
fof(f3095,plain,
( tptp3 = sK1(sK15(sK15(sK19)))
| ~ spl22_22 ),
inference(resolution,[],[f539,f1026]) ).
fof(f3102,plain,
( tptp3 = sK1(sK16(sK19))
| ~ spl22_22
| ~ spl22_35 ),
inference(forward_demodulation,[],[f3095,f645]) ).
fof(f3103,plain,
( tptp3 = tptp4
| ~ spl22_22
| ~ spl22_35 ),
inference(forward_demodulation,[],[f3102,f1020]) ).
fof(f3104,plain,
( $false
| ~ spl22_22
| ~ spl22_35 ),
inference(forward_subsumption_resolution,[],[f3103,f207]) ).
fof(f3105,plain,
( ~ spl22_22
| ~ spl22_35 ),
inference(avatar_contradiction_clause,[],[f3104]) ).
fof(f3122,plain,
( tptp2 = sK1(sK17(sK19))
| ~ spl22_2 ),
inference(resolution,[],[f261,f1026]) ).
fof(f3127,plain,
( tptp3 = tptp2
| ~ spl22_2
| ~ spl22_22
| ~ spl22_36 ),
inference(forward_demodulation,[],[f3122,f2818]) ).
fof(f3128,plain,
( $false
| ~ spl22_2
| ~ spl22_22
| ~ spl22_36 ),
inference(forward_subsumption_resolution,[],[f3127,f211]) ).
fof(f3129,plain,
( ~ spl22_2
| ~ spl22_22
| ~ spl22_36 ),
inference(avatar_contradiction_clause,[],[f3128]) ).
cnf(s1,plain,
( spl22_1
| spl22_2 ),
inference(sat_conversion,[],[f262]) ).
cnf(s28,plain,
( spl22_7
| ~ spl22_24
| spl22_35
| spl22_36 ),
inference(sat_conversion,[],[f650]) ).
cnf(s143,plain,
( spl22_24
| spl22_136 ),
inference(sat_conversion,[],[f2812]) ).
cnf(s145,plain,
( ~ spl22_1
| ~ spl22_22
| ~ spl22_36 ),
inference(sat_conversion,[],[f2826]) ).
cnf(s155,plain,
~ spl22_136,
inference(sat_conversion,[],[f3000]) ).
cnf(s157,plain,
( spl22_22
| spl22_136 ),
inference(sat_conversion,[],[f3030]) ).
cnf(s166,plain,
~ spl22_7,
inference(sat_conversion,[],[f3085]) ).
cnf(s167,plain,
( ~ spl22_22
| ~ spl22_35 ),
inference(sat_conversion,[],[f3105]) ).
cnf(s168,plain,
( ~ spl22_2
| ~ spl22_22
| ~ spl22_36 ),
inference(sat_conversion,[],[f3129]) ).
cnf(s169,plain,
spl22_22,
inference(rat,[],[s157,s155]) ).
cnf(s170,plain,
~ spl22_35,
inference(rat,[],[s167,s169]) ).
cnf(s171,plain,
( ~ spl22_1
| ~ spl22_36 ),
inference(rat,[],[s145,s169]) ).
cnf(s172,plain,
spl22_24,
inference(rat,[],[s143,s155]) ).
cnf(s187,plain,
spl22_36,
inference(rat,[],[s28,s170,s172,s166]) ).
cnf(s188,plain,
~ spl22_2,
inference(rat,[],[s168,s169,s187]) ).
cnf(s189,plain,
~ spl22_1,
inference(rat,[],[s171,s187]) ).
cnf(s193,plain,
$false,
inference(rat,[],[s1,s188,s189]) ).
fof(f3130,plain,
$false,
inference(avatar_sat_refutation,[],[s193]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : PRO018+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.38 % Computer : n017.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Sun Sep 27 22:20:20 UTC 2026
% 0.11/0.39 % CPUTime :
% 0.11/0.39 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/0.42 Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 12.09/2.75 % (2993176)Detected formulas, will run a generic FOF schedule.
% 12.09/2.75 % (2993286)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1540799643:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 12.09/2.75 % (2993286)Instruction limit reached!
% 12.09/2.75 % (2993286)------------------------------
% 12.09/2.75 % (2993286)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.09/2.75 % (2993286)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.09/2.75 % (2993286)CaDiCaL version: 2.1.3
% 12.09/2.75 % (2993286)Termination reason: Instruction limit
% 12.09/2.75 % (2993286)Termination phase: Saturation
% 12.09/2.75 % (2993286)Time elapsed: 0.034 s
% 12.09/2.75 % (2993286)Peak memory usage: 88 MB
% 12.09/2.75 % (2993286)Instructions burned: 120 (million)
% 12.09/2.75 % (2993287)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3902059086:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 12.09/2.75 % (2993282)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=72582612:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 12.09/2.75 % (2993283)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=1503240716:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 12.09/2.75 % (2993284)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=2034026781:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 12.09/2.75 % (2993285)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1996986799:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 12.09/2.75 % (2993288)dis-21_1_sil=8000:lcm=predicate:random_seed=4022623206: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)
% 12.09/2.75 % (2993285)Instruction limit reached!
% 12.09/2.75 % (2993285)------------------------------
% 12.09/2.75 % (2993285)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.09/2.75 % (2993285)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.09/2.75 % (2993285)CaDiCaL version: 2.1.3
% 12.09/2.75 % (2993285)Termination reason: Instruction limit
% 12.09/2.75 % (2993285)Termination phase: Saturation
% 12.09/2.75 % (2993285)Time elapsed: 0.085 s
% 12.09/2.75 % (2993285)Peak memory usage: 89 MB
% 12.09/2.75 % (2993285)Instructions burned: 109 (million)
% 12.09/2.75 % (2993288)Instruction limit reached!
% 12.09/2.75 % (2993288)------------------------------
% 12.09/2.75 % (2993288)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.09/2.75 % (2993288)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.09/2.75 % (2993288)CaDiCaL version: 2.1.3
% 12.09/2.75 % (2993288)Termination reason: Instruction limit
% 12.09/2.75 % (2993288)Termination phase: Saturation
% 12.09/2.75 % (2993288)Time elapsed: 0.098 s
% 12.09/2.75 % (2993288)Peak memory usage: 89 MB
% 12.09/2.75 % (2993288)Instructions burned: 129 (million)
% 12.09/2.75 % (2993287)Instruction limit reached!
% 12.09/2.75 % (2993287)------------------------------
% 12.09/2.75 % (2993287)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.09/2.75 % (2993287)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.09/2.75 % (2993287)CaDiCaL version: 2.1.3
% 12.09/2.75 % (2993287)Termination reason: Instruction limit
% 12.09/2.75 % (2993287)Termination phase: Saturation
% 12.09/2.75 % (2993287)Time elapsed: 0.127 s
% 12.09/2.75 % (2993287)Peak memory usage: 90 MB
% 12.09/2.75 % (2993287)Instructions burned: 139 (million)
% 12.09/2.75 % (2993291)lrs+10_1_sil=8000:sp=occurrence:random_seed=2720417734:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 12.09/2.75 % (2993328)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=3601603454:s2a=on:i=248:s2at=1.23:gtg=position_2997 on theBenchmark for (2997ds/248Mi)
% 12.09/2.75 % (2993326)lrs+1011_1_sil=32000:sp=occurrence:random_seed=2326230153:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 12.09/2.75 % (2993324)lrs+10_1_sil=32000:urr=on:br=off:random_seed=3081325921:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 12.09/2.75 % (2993324)Refutation not found, incomplete strategy
% 12.09/2.75 % (2993324)------------------------------
% 12.09/2.75 % (2993324)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.09/2.75 % (2993324)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.09/2.75 % (2993324)CaDiCaL version: 2.1.3
% 12.09/2.75 % (2993324)Termination reason: Refutation not found, incomplete strategy
% 12.09/2.75 % (2993324)Time elapsed: 0.014 s
% 12.09/2.75 % (2993324)Peak memory usage: 88 MB
% 12.09/2.75 % (2993324)Instructions burned: 13 (million)
% 12.09/2.75 % (2993328)Instruction limit reached!
% 12.09/2.75 % (2993328)------------------------------
% 12.09/2.75 % (2993328)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.09/2.75 % (2993328)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.09/2.75 % (2993328)CaDiCaL version: 2.1.3
% 12.09/2.75 % (2993328)Termination reason: Instruction limit
% 12.09/2.75 % (2993328)Termination phase: Saturation
% 12.09/2.75 % (2993328)Time elapsed: 0.128 s
% 12.09/2.75 % (2993328)Peak memory usage: 89 MB
% 12.09/2.75 % (2993328)Instructions burned: 249 (million)
% 12.09/2.75 % (2993291)Instruction limit reached!
% 12.09/2.75 % (2993291)------------------------------
% 12.09/2.75 % (2993291)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.09/2.75 % (2993291)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.09/2.75 % (2993291)CaDiCaL version: 2.1.3
% 12.09/2.75 % (2993291)Termination reason: Instruction limit
% 12.09/2.75 % (2993291)Termination phase: Saturation
% 12.09/2.75 % (2993291)Time elapsed: 0.297 s
% 12.09/2.75 % (2993291)Peak memory usage: 91 MB
% 12.09/2.75 % (2993291)Instructions burned: 285 (million)
% 12.09/2.75 % (2993342)lrs+1002_1_to=lpo:sil=8000:sos=on:random_seed=1751484374:st=4:cts=off:i=294:sd=2:ins=7:amm=off:ss=axioms_2993 on theBenchmark for (2993ds/294Mi)
% 12.09/2.75 % (2993326)Instruction limit reached!
% 12.09/2.75 % (2993326)------------------------------
% 12.09/2.75 % (2993326)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.09/2.75 % (2993326)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.09/2.75 % (2993326)CaDiCaL version: 2.1.3
% 12.09/2.75 % (2993326)Termination reason: Instruction limit
% 12.09/2.75 % (2993326)Termination phase: Saturation
% 12.09/2.75 % (2993326)Time elapsed: 0.346 s
% 12.09/2.75 % (2993326)Peak memory usage: 92 MB
% 12.09/2.75 % (2993326)Instructions burned: 325 (million)
% 12.09/2.75 % (2993324)------------------------------
% 12.09/2.75 % (2993324)------------------------------
% 12.09/2.75 % (2993344)lrs+10_1_ncem=casc2026/models/loop7.pt:sil=32000:tgt=ground:npcc=on:random_seed=3356448553:i=2350_2993 on theBenchmark for (2993ds/2350Mi)
% 12.09/2.75 % (2993342)Instruction limit reached!
% 12.09/2.75 % (2993342)------------------------------
% 12.09/2.75 % (2993342)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.09/2.75 % (2993342)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.09/2.75 % (2993342)CaDiCaL version: 2.1.3
% 12.09/2.75 % (2993342)Termination reason: Instruction limit
% 12.09/2.75 % (2993342)Termination phase: Saturation
% 12.09/2.75 % (2993342)Time elapsed: 0.159 s
% 12.09/2.75 % (2993342)Peak memory usage: 89 MB
% 12.09/2.75 % (2993342)Instructions burned: 295 (million)
% 12.09/2.75 % (2993348)dis-1011_32:1_sfv=off:sil=16000:sos=all:erd=off:acc=on:fd=off:flr=on:random_seed=1037532772:cts=off:i=113:fsr=off:ss=included:sgt=4_2991 on theBenchmark for (2991ds/113Mi)
% 12.09/2.75 % (2993351)lrs-1004_1_sil=8000:sp=occurrence:sos=all:erd=off:fs=off:bce=on:random_seed=3523143783:i=127:av=off:fsr=off:sup=off_2990 on theBenchmark for (2990ds/127Mi)
% 12.09/2.75 % (2993348)Instruction limit reached!
% 12.09/2.75 % (2993348)------------------------------
% 12.09/2.75 % (2993348)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.09/2.75 % (2993348)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.09/2.75 % (2993348)CaDiCaL version: 2.1.3
% 12.09/2.75 % (2993348)Termination reason: Instruction limit
% 12.09/2.75 % (2993348)Termination phase: Saturation
% 12.09/2.75 % (2993348)Time elapsed: 0.097 s
% 12.09/2.75 % (2993348)Peak memory usage: 90 MB
% 12.09/2.75 % (2993348)Instructions burned: 114 (million)
% 12.09/2.75 % (2993353)dis-1003_1024_sil=8000:sos=all:sac=on:random_seed=2166401418:cond=fast:i=114:sd=1:nm=0:fsr=off:gtg=exists_sym:ss=axioms_2990 on theBenchmark for (2990ds/114Mi)
% 12.09/2.75 % (2993353)Instruction limit reached!
% 12.09/2.75 % (2993353)------------------------------
% 12.09/2.75 % (2993353)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.09/2.75 % (2993353)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.09/2.75 % (2993353)CaDiCaL version: 2.1.3
% 12.09/2.75 % (2993353)Termination reason: Instruction limit
% 12.09/2.75 % (2993353)Termination phase: Saturation
% 12.09/2.75 % (2993353)Time elapsed: 0.065 s
% 12.09/2.75 % (2993353)Peak memory usage: 89 MB
% 12.09/2.75 % (2993353)Instructions burned: 116 (million)
% 12.09/2.75 % (2993351)Instruction limit reached!
% 12.09/2.75 % (2993351)------------------------------
% 12.09/2.75 % (2993351)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.09/2.75 % (2993351)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.09/2.75 % (2993351)CaDiCaL version: 2.1.3
% 12.09/2.75 % (2993351)Termination reason: Instruction limit
% 12.09/2.75 % (2993351)Termination phase: Saturation
% 12.09/2.75 % (2993351)Time elapsed: 0.118 s
% 12.09/2.75 % (2993351)Peak memory usage: 89 MB
% 12.09/2.75 % (2993351)Instructions burned: 128 (million)
% 12.09/2.75 % (2993282)First to succeed.
% 12.09/2.75 % (2993282)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2993176"
% 12.09/2.75 % (2993361)lrs+10_1_sil=8000:sp=occurrence:random_seed=2903483937:st=1.2:i=907:sd=14:ss=axioms:sgt=12_2987 on theBenchmark for (2987ds/907Mi)
% 12.09/2.75 % (2993362)dis-1010_1_sil=16000:fde=unused:sp=occurrence:sos=on:random_seed=2147325876:i=437:sd=1:aac=none:ss=included_2987 on theBenchmark for (2987ds/437Mi)
% 12.09/2.75 % (2993283)Also succeeded, but the first one will report.
% 12.09/2.75 % (2993364)lrs-1002_1_ncem=casc2026/models/all5champsBiggishL14.pt:sil=16000:npcc=on:random_seed=832576786:i=5202:ss=axioms:sgt=16_2986 on theBenchmark for (2986ds/5202Mi)
% 12.09/2.75 % (2993362)Instruction limit reached!
% 12.09/2.75 % (2993362)------------------------------
% 12.09/2.75 % (2993362)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.09/2.75 % (2993362)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.09/2.75 % (2993362)CaDiCaL version: 2.1.3
% 12.09/2.75 % (2993362)Termination reason: Instruction limit
% 12.09/2.75 % (2993362)Termination phase: Saturation
% 12.09/2.75 % (2993362)Time elapsed: 0.183 s
% 12.09/2.75 % (2993362)Peak memory usage: 90 MB
% 12.09/2.75 % (2993362)Instructions burned: 439 (million)
% 12.09/2.75 % (2993284)Also succeeded, but the first one will report.
% 12.09/2.75 % (2993282)Refutation found. Thanks to Tanya!
% 12.09/2.75 % SZS status Theorem for theBenchmark
% 12.09/2.75 % SZS output start Proof for theBenchmark
% See solution above
% 13.83/3.01 % (2993282)------------------------------
% 13.83/3.01 % (2993282)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 13.83/3.01 % (2993282)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.83/3.01 % (2993282)CaDiCaL version: 2.1.3
% 13.83/3.01 % (2993282)Termination reason: Refutation
% 13.83/3.01 % (2993282)Time elapsed: 1.303 s
% 13.83/3.01 % (2993282)Peak memory usage: 133 MB
% 13.83/3.01 % (2993282)Instructions burned: 1362 (million)
% 13.83/3.01 % (2993282)------------------------------
% 13.83/3.01 % (2993282)------------------------------
% 13.83/3.01 % (2993176)Success in time 1.883 s
% 13.83/3.01 % Vampire exiting
%------------------------------------------------------------------------------