TSTP Solution File: PRO014+4 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : PRO014+4 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n032.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Fri May 3 02:54:20 EDT 2024
% Result : Theorem 19.70s 3.52s
% Output : CNFRefutation 19.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 27
% Syntax : Number of formulae : 205 ( 35 unt; 0 def)
% Number of atoms : 808 ( 30 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 967 ( 364 ~; 373 |; 182 &)
% ( 13 <=>; 35 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 16 ( 14 usr; 1 prp; 0-3 aty)
% Number of functors : 16 ( 16 usr; 7 con; 0-3 aty)
% Number of variables : 425 ( 7 sgn 264 !; 60 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
! [X12,X13] :
( occurrence_of(X13,X12)
=> ( activity_occurrence(X13)
& activity(X12) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_03) ).
fof(f5,axiom,
! [X14,X15,X16,X17] :
( ( subactivity_occurrence(X17,X15)
& subactivity_occurrence(X16,X15)
& arboreal(X17)
& arboreal(X16)
& occurrence_of(X15,X14) )
=> ( X16 = X17
| min_precedes(X17,X16,X14)
| min_precedes(X16,X17,X14) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_04) ).
fof(f7,axiom,
! [X21,X22,X23] :
( min_precedes(X22,X23,X21)
=> ? [X24] :
( subactivity_occurrence(X23,X24)
& subactivity_occurrence(X22,X24)
& occurrence_of(X24,X21) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_06) ).
fof(f9,axiom,
! [X28,X29,X30] :
( ( occurrence_of(X28,X30)
& occurrence_of(X28,X29) )
=> X29 = X30 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_08) ).
fof(f13,axiom,
! [X41] :
( activity_occurrence(X41)
=> ? [X42] :
( occurrence_of(X41,X42)
& activity(X42) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_12) ).
fof(f14,axiom,
! [X43] :
( legal(X43)
=> arboreal(X43) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_13) ).
fof(f16,axiom,
! [X47,X48] :
( leaf(X47,X48)
<=> ( ~ ? [X50] : min_precedes(X47,X50,X48)
& ( ? [X49] : min_precedes(X49,X47,X48)
| root(X47,X48) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_15) ).
fof(f17,axiom,
! [X51,X52] :
( occurrence_of(X51,X52)
=> ( arboreal(X51)
<=> atomic(X52) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_16) ).
fof(f18,axiom,
! [X53,X54] :
( root(X53,X54)
=> legal(X53) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_17) ).
fof(f19,axiom,
! [X55,X56] :
( leaf_occ(X55,X56)
<=> ? [X57] :
( leaf(X55,X57)
& subactivity_occurrence(X55,X56)
& occurrence_of(X56,X57) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_18) ).
fof(f22,axiom,
! [X63,X64] :
( precedes(X63,X64)
<=> ( legal(X64)
& earlier(X63,X64) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_21) ).
fof(f25,axiom,
! [X72,X73,X74] :
( min_precedes(X72,X73,X74)
=> precedes(X72,X73) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_24) ).
fof(f27,axiom,
! [X78,X79,X80] :
( next_subocc(X78,X79,X80)
<=> ( ~ ? [X81] :
( min_precedes(X81,X79,X80)
& min_precedes(X78,X81,X80) )
& min_precedes(X78,X79,X80) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_26) ).
fof(f28,axiom,
! [X82,X83,X84,X85] :
( ( subactivity_occurrence(X83,X85)
& occurrence_of(X85,X84)
& min_precedes(X82,X83,X84) )
=> subactivity_occurrence(X82,X85) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_27) ).
fof(f33,axiom,
! [X101,X102] :
( ( ~ leaf_occ(X101,X102)
& arboreal(X101)
& subactivity_occurrence(X101,X102)
& occurrence_of(X102,tptp0) )
=> ? [X103,X104,X105] :
( leaf(X105,tptp0)
& next_subocc(X104,X105,tptp0)
& ( occurrence_of(X105,tptp1)
| occurrence_of(X105,tptp2) )
& next_subocc(X103,X104,tptp0)
& occurrence_of(X104,tptp4)
& next_subocc(X101,X103,tptp0)
& occurrence_of(X103,tptp3) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_32) ).
fof(f39,axiom,
atomic(tptp3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_38) ).
fof(f46,conjecture,
! [X106,X107] :
( ( ~ leaf_occ(X106,X107)
& arboreal(X106)
& subactivity_occurrence(X106,X107)
& occurrence_of(X107,tptp0) )
=> ? [X108,X109] :
( leaf(X109,tptp0)
& min_precedes(X108,X109,tptp0)
& ( occurrence_of(X109,tptp1)
| occurrence_of(X109,tptp2) )
& next_subocc(X106,X108,tptp0)
& occurrence_of(X108,tptp3) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(f47,negated_conjecture,
~ ! [X106,X107] :
( ( ~ leaf_occ(X106,X107)
& arboreal(X106)
& subactivity_occurrence(X106,X107)
& occurrence_of(X107,tptp0) )
=> ? [X108,X109] :
( leaf(X109,tptp0)
& min_precedes(X108,X109,tptp0)
& ( occurrence_of(X109,tptp1)
| occurrence_of(X109,tptp2) )
& next_subocc(X106,X108,tptp0)
& occurrence_of(X108,tptp3) ) ),
inference(negated_conjecture,[],[f46]) ).
fof(f50,plain,
! [X0,X1] :
( occurrence_of(X1,X0)
=> ( activity_occurrence(X1)
& activity(X0) ) ),
inference(rectify,[],[f4]) ).
fof(f51,plain,
! [X0,X1,X2,X3] :
( ( subactivity_occurrence(X3,X1)
& subactivity_occurrence(X2,X1)
& arboreal(X3)
& arboreal(X2)
& occurrence_of(X1,X0) )
=> ( X2 = X3
| min_precedes(X3,X2,X0)
| min_precedes(X2,X3,X0) ) ),
inference(rectify,[],[f5]) ).
fof(f53,plain,
! [X0,X1,X2] :
( min_precedes(X1,X2,X0)
=> ? [X3] :
( subactivity_occurrence(X2,X3)
& subactivity_occurrence(X1,X3)
& occurrence_of(X3,X0) ) ),
inference(rectify,[],[f7]) ).
fof(f55,plain,
! [X0,X1,X2] :
( ( occurrence_of(X0,X2)
& occurrence_of(X0,X1) )
=> X1 = X2 ),
inference(rectify,[],[f9]) ).
fof(f59,plain,
! [X0] :
( activity_occurrence(X0)
=> ? [X1] :
( occurrence_of(X0,X1)
& activity(X1) ) ),
inference(rectify,[],[f13]) ).
fof(f60,plain,
! [X0] :
( legal(X0)
=> arboreal(X0) ),
inference(rectify,[],[f14]) ).
fof(f62,plain,
! [X0,X1] :
( leaf(X0,X1)
<=> ( ~ ? [X2] : min_precedes(X0,X2,X1)
& ( ? [X3] : min_precedes(X3,X0,X1)
| root(X0,X1) ) ) ),
inference(rectify,[],[f16]) ).
fof(f63,plain,
! [X0,X1] :
( occurrence_of(X0,X1)
=> ( arboreal(X0)
<=> atomic(X1) ) ),
inference(rectify,[],[f17]) ).
fof(f64,plain,
! [X0,X1] :
( root(X0,X1)
=> legal(X0) ),
inference(rectify,[],[f18]) ).
fof(f65,plain,
! [X0,X1] :
( leaf_occ(X0,X1)
<=> ? [X2] :
( leaf(X0,X2)
& subactivity_occurrence(X0,X1)
& occurrence_of(X1,X2) ) ),
inference(rectify,[],[f19]) ).
fof(f68,plain,
! [X0,X1] :
( precedes(X0,X1)
<=> ( legal(X1)
& earlier(X0,X1) ) ),
inference(rectify,[],[f22]) ).
fof(f71,plain,
! [X0,X1,X2] :
( min_precedes(X0,X1,X2)
=> precedes(X0,X1) ),
inference(rectify,[],[f25]) ).
fof(f73,plain,
! [X0,X1,X2] :
( next_subocc(X0,X1,X2)
<=> ( ~ ? [X3] :
( min_precedes(X3,X1,X2)
& min_precedes(X0,X3,X2) )
& min_precedes(X0,X1,X2) ) ),
inference(rectify,[],[f27]) ).
fof(f74,plain,
! [X0,X1,X2,X3] :
( ( subactivity_occurrence(X1,X3)
& occurrence_of(X3,X2)
& min_precedes(X0,X1,X2) )
=> subactivity_occurrence(X0,X3) ),
inference(rectify,[],[f28]) ).
fof(f79,plain,
! [X0,X1] :
( ( ~ leaf_occ(X0,X1)
& arboreal(X0)
& subactivity_occurrence(X0,X1)
& occurrence_of(X1,tptp0) )
=> ? [X2,X3,X4] :
( leaf(X4,tptp0)
& next_subocc(X3,X4,tptp0)
& ( occurrence_of(X4,tptp1)
| occurrence_of(X4,tptp2) )
& next_subocc(X2,X3,tptp0)
& occurrence_of(X3,tptp4)
& next_subocc(X0,X2,tptp0)
& occurrence_of(X2,tptp3) ) ),
inference(rectify,[],[f33]) ).
fof(f80,plain,
~ ! [X0,X1] :
( ( ~ leaf_occ(X0,X1)
& arboreal(X0)
& subactivity_occurrence(X0,X1)
& occurrence_of(X1,tptp0) )
=> ? [X2,X3] :
( leaf(X3,tptp0)
& min_precedes(X2,X3,tptp0)
& ( occurrence_of(X3,tptp1)
| occurrence_of(X3,tptp2) )
& next_subocc(X0,X2,tptp0)
& occurrence_of(X2,tptp3) ) ),
inference(rectify,[],[f47]) ).
fof(f85,plain,
! [X0,X1] :
( occurrence_of(X1,X0)
=> activity_occurrence(X1) ),
inference(pure_predicate_removal,[],[f50]) ).
fof(f86,plain,
! [X0] :
( activity_occurrence(X0)
=> ? [X1] : occurrence_of(X0,X1) ),
inference(pure_predicate_removal,[],[f59]) ).
fof(f94,plain,
! [X0,X1] :
( activity_occurrence(X1)
| ~ occurrence_of(X1,X0) ),
inference(ennf_transformation,[],[f85]) ).
fof(f95,plain,
! [X0,X1,X2,X3] :
( X2 = X3
| min_precedes(X3,X2,X0)
| min_precedes(X2,X3,X0)
| ~ subactivity_occurrence(X3,X1)
| ~ subactivity_occurrence(X2,X1)
| ~ arboreal(X3)
| ~ arboreal(X2)
| ~ occurrence_of(X1,X0) ),
inference(ennf_transformation,[],[f51]) ).
fof(f96,plain,
! [X0,X1,X2,X3] :
( X2 = X3
| min_precedes(X3,X2,X0)
| min_precedes(X2,X3,X0)
| ~ subactivity_occurrence(X3,X1)
| ~ subactivity_occurrence(X2,X1)
| ~ arboreal(X3)
| ~ arboreal(X2)
| ~ occurrence_of(X1,X0) ),
inference(flattening,[],[f95]) ).
fof(f98,plain,
! [X0,X1,X2] :
( ? [X3] :
( subactivity_occurrence(X2,X3)
& subactivity_occurrence(X1,X3)
& occurrence_of(X3,X0) )
| ~ min_precedes(X1,X2,X0) ),
inference(ennf_transformation,[],[f53]) ).
fof(f101,plain,
! [X0,X1,X2] :
( X1 = X2
| ~ occurrence_of(X0,X2)
| ~ occurrence_of(X0,X1) ),
inference(ennf_transformation,[],[f55]) ).
fof(f102,plain,
! [X0,X1,X2] :
( X1 = X2
| ~ occurrence_of(X0,X2)
| ~ occurrence_of(X0,X1) ),
inference(flattening,[],[f101]) ).
fof(f108,plain,
! [X0] :
( ? [X1] : occurrence_of(X0,X1)
| ~ activity_occurrence(X0) ),
inference(ennf_transformation,[],[f86]) ).
fof(f109,plain,
! [X0] :
( arboreal(X0)
| ~ legal(X0) ),
inference(ennf_transformation,[],[f60]) ).
fof(f111,plain,
! [X0,X1] :
( leaf(X0,X1)
<=> ( ! [X2] : ~ min_precedes(X0,X2,X1)
& ( ? [X3] : min_precedes(X3,X0,X1)
| root(X0,X1) ) ) ),
inference(ennf_transformation,[],[f62]) ).
fof(f112,plain,
! [X0,X1] :
( ( arboreal(X0)
<=> atomic(X1) )
| ~ occurrence_of(X0,X1) ),
inference(ennf_transformation,[],[f63]) ).
fof(f113,plain,
! [X0,X1] :
( legal(X0)
| ~ root(X0,X1) ),
inference(ennf_transformation,[],[f64]) ).
fof(f118,plain,
! [X0,X1,X2] :
( precedes(X0,X1)
| ~ min_precedes(X0,X1,X2) ),
inference(ennf_transformation,[],[f71]) ).
fof(f120,plain,
! [X0,X1,X2] :
( next_subocc(X0,X1,X2)
<=> ( ! [X3] :
( ~ min_precedes(X3,X1,X2)
| ~ min_precedes(X0,X3,X2) )
& min_precedes(X0,X1,X2) ) ),
inference(ennf_transformation,[],[f73]) ).
fof(f121,plain,
! [X0,X1,X2,X3] :
( subactivity_occurrence(X0,X3)
| ~ subactivity_occurrence(X1,X3)
| ~ occurrence_of(X3,X2)
| ~ min_precedes(X0,X1,X2) ),
inference(ennf_transformation,[],[f74]) ).
fof(f122,plain,
! [X0,X1,X2,X3] :
( subactivity_occurrence(X0,X3)
| ~ subactivity_occurrence(X1,X3)
| ~ occurrence_of(X3,X2)
| ~ min_precedes(X0,X1,X2) ),
inference(flattening,[],[f121]) ).
fof(f131,plain,
! [X0,X1] :
( ? [X2,X3,X4] :
( leaf(X4,tptp0)
& next_subocc(X3,X4,tptp0)
& ( occurrence_of(X4,tptp1)
| occurrence_of(X4,tptp2) )
& next_subocc(X2,X3,tptp0)
& occurrence_of(X3,tptp4)
& next_subocc(X0,X2,tptp0)
& occurrence_of(X2,tptp3) )
| leaf_occ(X0,X1)
| ~ arboreal(X0)
| ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0) ),
inference(ennf_transformation,[],[f79]) ).
fof(f132,plain,
! [X0,X1] :
( ? [X2,X3,X4] :
( leaf(X4,tptp0)
& next_subocc(X3,X4,tptp0)
& ( occurrence_of(X4,tptp1)
| occurrence_of(X4,tptp2) )
& next_subocc(X2,X3,tptp0)
& occurrence_of(X3,tptp4)
& next_subocc(X0,X2,tptp0)
& occurrence_of(X2,tptp3) )
| leaf_occ(X0,X1)
| ~ arboreal(X0)
| ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0) ),
inference(flattening,[],[f131]) ).
fof(f133,plain,
? [X0,X1] :
( ! [X2,X3] :
( ~ leaf(X3,tptp0)
| ~ min_precedes(X2,X3,tptp0)
| ( ~ occurrence_of(X3,tptp1)
& ~ occurrence_of(X3,tptp2) )
| ~ next_subocc(X0,X2,tptp0)
| ~ occurrence_of(X2,tptp3) )
& ~ leaf_occ(X0,X1)
& arboreal(X0)
& subactivity_occurrence(X0,X1)
& occurrence_of(X1,tptp0) ),
inference(ennf_transformation,[],[f80]) ).
fof(f134,plain,
? [X0,X1] :
( ! [X2,X3] :
( ~ leaf(X3,tptp0)
| ~ min_precedes(X2,X3,tptp0)
| ( ~ occurrence_of(X3,tptp1)
& ~ occurrence_of(X3,tptp2) )
| ~ next_subocc(X0,X2,tptp0)
| ~ occurrence_of(X2,tptp3) )
& ~ leaf_occ(X0,X1)
& arboreal(X0)
& subactivity_occurrence(X0,X1)
& occurrence_of(X1,tptp0) ),
inference(flattening,[],[f133]) ).
fof(f139,plain,
! [X0,X1,X2] :
( ? [X3] :
( subactivity_occurrence(X2,X3)
& subactivity_occurrence(X1,X3)
& occurrence_of(X3,X0) )
=> ( subactivity_occurrence(X2,sK2(X0,X1,X2))
& subactivity_occurrence(X1,sK2(X0,X1,X2))
& occurrence_of(sK2(X0,X1,X2),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f140,plain,
! [X0,X1,X2] :
( ( subactivity_occurrence(X2,sK2(X0,X1,X2))
& subactivity_occurrence(X1,sK2(X0,X1,X2))
& occurrence_of(sK2(X0,X1,X2),X0) )
| ~ min_precedes(X1,X2,X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2])],[f98,f139]) ).
fof(f143,plain,
! [X0] :
( ? [X1] : occurrence_of(X0,X1)
=> occurrence_of(X0,sK4(X0)) ),
introduced(choice_axiom,[]) ).
fof(f144,plain,
! [X0] :
( occurrence_of(X0,sK4(X0))
| ~ activity_occurrence(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4])],[f108,f143]) ).
fof(f147,plain,
! [X0,X1] :
( ( leaf(X0,X1)
| ? [X2] : min_precedes(X0,X2,X1)
| ( ! [X3] : ~ min_precedes(X3,X0,X1)
& ~ root(X0,X1) ) )
& ( ( ! [X2] : ~ min_precedes(X0,X2,X1)
& ( ? [X3] : min_precedes(X3,X0,X1)
| root(X0,X1) ) )
| ~ leaf(X0,X1) ) ),
inference(nnf_transformation,[],[f111]) ).
fof(f148,plain,
! [X0,X1] :
( ( leaf(X0,X1)
| ? [X2] : min_precedes(X0,X2,X1)
| ( ! [X3] : ~ min_precedes(X3,X0,X1)
& ~ root(X0,X1) ) )
& ( ( ! [X2] : ~ min_precedes(X0,X2,X1)
& ( ? [X3] : min_precedes(X3,X0,X1)
| root(X0,X1) ) )
| ~ leaf(X0,X1) ) ),
inference(flattening,[],[f147]) ).
fof(f149,plain,
! [X0,X1] :
( ( leaf(X0,X1)
| ? [X2] : min_precedes(X0,X2,X1)
| ( ! [X3] : ~ min_precedes(X3,X0,X1)
& ~ root(X0,X1) ) )
& ( ( ! [X4] : ~ min_precedes(X0,X4,X1)
& ( ? [X5] : min_precedes(X5,X0,X1)
| root(X0,X1) ) )
| ~ leaf(X0,X1) ) ),
inference(rectify,[],[f148]) ).
fof(f150,plain,
! [X0,X1] :
( ? [X2] : min_precedes(X0,X2,X1)
=> min_precedes(X0,sK6(X0,X1),X1) ),
introduced(choice_axiom,[]) ).
fof(f151,plain,
! [X0,X1] :
( ? [X5] : min_precedes(X5,X0,X1)
=> min_precedes(sK7(X0,X1),X0,X1) ),
introduced(choice_axiom,[]) ).
fof(f152,plain,
! [X0,X1] :
( ( leaf(X0,X1)
| min_precedes(X0,sK6(X0,X1),X1)
| ( ! [X3] : ~ min_precedes(X3,X0,X1)
& ~ root(X0,X1) ) )
& ( ( ! [X4] : ~ min_precedes(X0,X4,X1)
& ( min_precedes(sK7(X0,X1),X0,X1)
| root(X0,X1) ) )
| ~ leaf(X0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK6,sK7])],[f149,f151,f150]) ).
fof(f153,plain,
! [X0,X1] :
( ( ( arboreal(X0)
| ~ atomic(X1) )
& ( atomic(X1)
| ~ arboreal(X0) ) )
| ~ occurrence_of(X0,X1) ),
inference(nnf_transformation,[],[f112]) ).
fof(f154,plain,
! [X0,X1] :
( ( leaf_occ(X0,X1)
| ! [X2] :
( ~ leaf(X0,X2)
| ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,X2) ) )
& ( ? [X2] :
( leaf(X0,X2)
& subactivity_occurrence(X0,X1)
& occurrence_of(X1,X2) )
| ~ leaf_occ(X0,X1) ) ),
inference(nnf_transformation,[],[f65]) ).
fof(f155,plain,
! [X0,X1] :
( ( leaf_occ(X0,X1)
| ! [X2] :
( ~ leaf(X0,X2)
| ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,X2) ) )
& ( ? [X3] :
( leaf(X0,X3)
& subactivity_occurrence(X0,X1)
& occurrence_of(X1,X3) )
| ~ leaf_occ(X0,X1) ) ),
inference(rectify,[],[f154]) ).
fof(f156,plain,
! [X0,X1] :
( ? [X3] :
( leaf(X0,X3)
& subactivity_occurrence(X0,X1)
& occurrence_of(X1,X3) )
=> ( leaf(X0,sK8(X0,X1))
& subactivity_occurrence(X0,X1)
& occurrence_of(X1,sK8(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f157,plain,
! [X0,X1] :
( ( leaf_occ(X0,X1)
| ! [X2] :
( ~ leaf(X0,X2)
| ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,X2) ) )
& ( ( leaf(X0,sK8(X0,X1))
& subactivity_occurrence(X0,X1)
& occurrence_of(X1,sK8(X0,X1)) )
| ~ leaf_occ(X0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK8])],[f155,f156]) ).
fof(f158,plain,
! [X0,X1] :
( ( precedes(X0,X1)
| ~ legal(X1)
| ~ earlier(X0,X1) )
& ( ( legal(X1)
& earlier(X0,X1) )
| ~ precedes(X0,X1) ) ),
inference(nnf_transformation,[],[f68]) ).
fof(f159,plain,
! [X0,X1] :
( ( precedes(X0,X1)
| ~ legal(X1)
| ~ earlier(X0,X1) )
& ( ( legal(X1)
& earlier(X0,X1) )
| ~ precedes(X0,X1) ) ),
inference(flattening,[],[f158]) ).
fof(f162,plain,
! [X0,X1,X2] :
( ( next_subocc(X0,X1,X2)
| ? [X3] :
( min_precedes(X3,X1,X2)
& min_precedes(X0,X3,X2) )
| ~ min_precedes(X0,X1,X2) )
& ( ( ! [X3] :
( ~ min_precedes(X3,X1,X2)
| ~ min_precedes(X0,X3,X2) )
& min_precedes(X0,X1,X2) )
| ~ next_subocc(X0,X1,X2) ) ),
inference(nnf_transformation,[],[f120]) ).
fof(f163,plain,
! [X0,X1,X2] :
( ( next_subocc(X0,X1,X2)
| ? [X3] :
( min_precedes(X3,X1,X2)
& min_precedes(X0,X3,X2) )
| ~ min_precedes(X0,X1,X2) )
& ( ( ! [X3] :
( ~ min_precedes(X3,X1,X2)
| ~ min_precedes(X0,X3,X2) )
& min_precedes(X0,X1,X2) )
| ~ next_subocc(X0,X1,X2) ) ),
inference(flattening,[],[f162]) ).
fof(f164,plain,
! [X0,X1,X2] :
( ( next_subocc(X0,X1,X2)
| ? [X3] :
( min_precedes(X3,X1,X2)
& min_precedes(X0,X3,X2) )
| ~ min_precedes(X0,X1,X2) )
& ( ( ! [X4] :
( ~ min_precedes(X4,X1,X2)
| ~ min_precedes(X0,X4,X2) )
& min_precedes(X0,X1,X2) )
| ~ next_subocc(X0,X1,X2) ) ),
inference(rectify,[],[f163]) ).
fof(f165,plain,
! [X0,X1,X2] :
( ? [X3] :
( min_precedes(X3,X1,X2)
& min_precedes(X0,X3,X2) )
=> ( min_precedes(sK10(X0,X1,X2),X1,X2)
& min_precedes(X0,sK10(X0,X1,X2),X2) ) ),
introduced(choice_axiom,[]) ).
fof(f166,plain,
! [X0,X1,X2] :
( ( next_subocc(X0,X1,X2)
| ( min_precedes(sK10(X0,X1,X2),X1,X2)
& min_precedes(X0,sK10(X0,X1,X2),X2) )
| ~ min_precedes(X0,X1,X2) )
& ( ( ! [X4] :
( ~ min_precedes(X4,X1,X2)
| ~ min_precedes(X0,X4,X2) )
& min_precedes(X0,X1,X2) )
| ~ next_subocc(X0,X1,X2) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK10])],[f164,f165]) ).
fof(f167,plain,
! [X0] :
( ? [X2,X3,X4] :
( leaf(X4,tptp0)
& next_subocc(X3,X4,tptp0)
& ( occurrence_of(X4,tptp1)
| occurrence_of(X4,tptp2) )
& next_subocc(X2,X3,tptp0)
& occurrence_of(X3,tptp4)
& next_subocc(X0,X2,tptp0)
& occurrence_of(X2,tptp3) )
=> ( leaf(sK13(X0),tptp0)
& next_subocc(sK12(X0),sK13(X0),tptp0)
& ( occurrence_of(sK13(X0),tptp1)
| occurrence_of(sK13(X0),tptp2) )
& next_subocc(sK11(X0),sK12(X0),tptp0)
& occurrence_of(sK12(X0),tptp4)
& next_subocc(X0,sK11(X0),tptp0)
& occurrence_of(sK11(X0),tptp3) ) ),
introduced(choice_axiom,[]) ).
fof(f168,plain,
! [X0,X1] :
( ( leaf(sK13(X0),tptp0)
& next_subocc(sK12(X0),sK13(X0),tptp0)
& ( occurrence_of(sK13(X0),tptp1)
| occurrence_of(sK13(X0),tptp2) )
& next_subocc(sK11(X0),sK12(X0),tptp0)
& occurrence_of(sK12(X0),tptp4)
& next_subocc(X0,sK11(X0),tptp0)
& occurrence_of(sK11(X0),tptp3) )
| leaf_occ(X0,X1)
| ~ arboreal(X0)
| ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK11,sK12,sK13])],[f132,f167]) ).
fof(f169,plain,
( ? [X0,X1] :
( ! [X2,X3] :
( ~ leaf(X3,tptp0)
| ~ min_precedes(X2,X3,tptp0)
| ( ~ occurrence_of(X3,tptp1)
& ~ occurrence_of(X3,tptp2) )
| ~ next_subocc(X0,X2,tptp0)
| ~ occurrence_of(X2,tptp3) )
& ~ leaf_occ(X0,X1)
& arboreal(X0)
& subactivity_occurrence(X0,X1)
& occurrence_of(X1,tptp0) )
=> ( ! [X3,X2] :
( ~ leaf(X3,tptp0)
| ~ min_precedes(X2,X3,tptp0)
| ( ~ occurrence_of(X3,tptp1)
& ~ occurrence_of(X3,tptp2) )
| ~ next_subocc(sK14,X2,tptp0)
| ~ occurrence_of(X2,tptp3) )
& ~ leaf_occ(sK14,sK15)
& arboreal(sK14)
& subactivity_occurrence(sK14,sK15)
& occurrence_of(sK15,tptp0) ) ),
introduced(choice_axiom,[]) ).
fof(f170,plain,
( ! [X2,X3] :
( ~ leaf(X3,tptp0)
| ~ min_precedes(X2,X3,tptp0)
| ( ~ occurrence_of(X3,tptp1)
& ~ occurrence_of(X3,tptp2) )
| ~ next_subocc(sK14,X2,tptp0)
| ~ occurrence_of(X2,tptp3) )
& ~ leaf_occ(sK14,sK15)
& arboreal(sK14)
& subactivity_occurrence(sK14,sK15)
& occurrence_of(sK15,tptp0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK14,sK15])],[f134,f169]) ).
fof(f175,plain,
! [X0,X1] :
( activity_occurrence(X1)
| ~ occurrence_of(X1,X0) ),
inference(cnf_transformation,[],[f94]) ).
fof(f176,plain,
! [X2,X3,X0,X1] :
( X2 = X3
| min_precedes(X3,X2,X0)
| min_precedes(X2,X3,X0)
| ~ subactivity_occurrence(X3,X1)
| ~ subactivity_occurrence(X2,X1)
| ~ arboreal(X3)
| ~ arboreal(X2)
| ~ occurrence_of(X1,X0) ),
inference(cnf_transformation,[],[f96]) ).
fof(f178,plain,
! [X2,X0,X1] :
( occurrence_of(sK2(X0,X1,X2),X0)
| ~ min_precedes(X1,X2,X0) ),
inference(cnf_transformation,[],[f140]) ).
fof(f180,plain,
! [X2,X0,X1] :
( subactivity_occurrence(X2,sK2(X0,X1,X2))
| ~ min_precedes(X1,X2,X0) ),
inference(cnf_transformation,[],[f140]) ).
fof(f183,plain,
! [X2,X0,X1] :
( X1 = X2
| ~ occurrence_of(X0,X2)
| ~ occurrence_of(X0,X1) ),
inference(cnf_transformation,[],[f102]) ).
fof(f188,plain,
! [X0] :
( occurrence_of(X0,sK4(X0))
| ~ activity_occurrence(X0) ),
inference(cnf_transformation,[],[f144]) ).
fof(f189,plain,
! [X0] :
( arboreal(X0)
| ~ legal(X0) ),
inference(cnf_transformation,[],[f109]) ).
fof(f192,plain,
! [X0,X1] :
( min_precedes(sK7(X0,X1),X0,X1)
| root(X0,X1)
| ~ leaf(X0,X1) ),
inference(cnf_transformation,[],[f152]) ).
fof(f193,plain,
! [X0,X1,X4] :
( ~ min_precedes(X0,X4,X1)
| ~ leaf(X0,X1) ),
inference(cnf_transformation,[],[f152]) ).
fof(f197,plain,
! [X0,X1] :
( arboreal(X0)
| ~ atomic(X1)
| ~ occurrence_of(X0,X1) ),
inference(cnf_transformation,[],[f153]) ).
fof(f198,plain,
! [X0,X1] :
( legal(X0)
| ~ root(X0,X1) ),
inference(cnf_transformation,[],[f113]) ).
fof(f200,plain,
! [X0,X1] :
( subactivity_occurrence(X0,X1)
| ~ leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f157]) ).
fof(f202,plain,
! [X2,X0,X1] :
( leaf_occ(X0,X1)
| ~ leaf(X0,X2)
| ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,X2) ),
inference(cnf_transformation,[],[f157]) ).
fof(f206,plain,
! [X0,X1] :
( legal(X1)
| ~ precedes(X0,X1) ),
inference(cnf_transformation,[],[f159]) ).
fof(f211,plain,
! [X2,X0,X1] :
( precedes(X0,X1)
| ~ min_precedes(X0,X1,X2) ),
inference(cnf_transformation,[],[f118]) ).
fof(f214,plain,
! [X2,X0,X1] :
( min_precedes(X0,X1,X2)
| ~ next_subocc(X0,X1,X2) ),
inference(cnf_transformation,[],[f166]) ).
fof(f218,plain,
! [X2,X3,X0,X1] :
( subactivity_occurrence(X0,X3)
| ~ subactivity_occurrence(X1,X3)
| ~ occurrence_of(X3,X2)
| ~ min_precedes(X0,X1,X2) ),
inference(cnf_transformation,[],[f122]) ).
fof(f223,plain,
! [X0,X1] :
( occurrence_of(sK11(X0),tptp3)
| leaf_occ(X0,X1)
| ~ arboreal(X0)
| ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0) ),
inference(cnf_transformation,[],[f168]) ).
fof(f224,plain,
! [X0,X1] :
( next_subocc(X0,sK11(X0),tptp0)
| leaf_occ(X0,X1)
| ~ arboreal(X0)
| ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0) ),
inference(cnf_transformation,[],[f168]) ).
fof(f226,plain,
! [X0,X1] :
( next_subocc(sK11(X0),sK12(X0),tptp0)
| leaf_occ(X0,X1)
| ~ arboreal(X0)
| ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0) ),
inference(cnf_transformation,[],[f168]) ).
fof(f227,plain,
! [X0,X1] :
( occurrence_of(sK13(X0),tptp1)
| occurrence_of(sK13(X0),tptp2)
| leaf_occ(X0,X1)
| ~ arboreal(X0)
| ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0) ),
inference(cnf_transformation,[],[f168]) ).
fof(f228,plain,
! [X0,X1] :
( next_subocc(sK12(X0),sK13(X0),tptp0)
| leaf_occ(X0,X1)
| ~ arboreal(X0)
| ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0) ),
inference(cnf_transformation,[],[f168]) ).
fof(f229,plain,
! [X0,X1] :
( leaf(sK13(X0),tptp0)
| leaf_occ(X0,X1)
| ~ arboreal(X0)
| ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0) ),
inference(cnf_transformation,[],[f168]) ).
fof(f234,plain,
atomic(tptp3),
inference(cnf_transformation,[],[f39]) ).
fof(f241,plain,
occurrence_of(sK15,tptp0),
inference(cnf_transformation,[],[f170]) ).
fof(f242,plain,
subactivity_occurrence(sK14,sK15),
inference(cnf_transformation,[],[f170]) ).
fof(f243,plain,
arboreal(sK14),
inference(cnf_transformation,[],[f170]) ).
fof(f244,plain,
~ leaf_occ(sK14,sK15),
inference(cnf_transformation,[],[f170]) ).
fof(f245,plain,
! [X2,X3] :
( ~ leaf(X3,tptp0)
| ~ min_precedes(X2,X3,tptp0)
| ~ occurrence_of(X3,tptp2)
| ~ next_subocc(sK14,X2,tptp0)
| ~ occurrence_of(X2,tptp3) ),
inference(cnf_transformation,[],[f170]) ).
fof(f246,plain,
! [X2,X3] :
( ~ leaf(X3,tptp0)
| ~ min_precedes(X2,X3,tptp0)
| ~ occurrence_of(X3,tptp1)
| ~ next_subocc(sK14,X2,tptp0)
| ~ occurrence_of(X2,tptp3) ),
inference(cnf_transformation,[],[f170]) ).
cnf(c_53,plain,
( ~ occurrence_of(X0,X1)
| activity_occurrence(X0) ),
inference(cnf_transformation,[],[f175]) ).
cnf(c_54,plain,
( ~ subactivity_occurrence(X0,X1)
| ~ subactivity_occurrence(X2,X1)
| ~ occurrence_of(X1,X3)
| ~ arboreal(X0)
| ~ arboreal(X2)
| X0 = X2
| min_precedes(X0,X2,X3)
| min_precedes(X2,X0,X3) ),
inference(cnf_transformation,[],[f176]) ).
cnf(c_56,plain,
( ~ min_precedes(X0,X1,X2)
| subactivity_occurrence(X1,sK2(X2,X0,X1)) ),
inference(cnf_transformation,[],[f180]) ).
cnf(c_58,plain,
( ~ min_precedes(X0,X1,X2)
| occurrence_of(sK2(X2,X0,X1),X2) ),
inference(cnf_transformation,[],[f178]) ).
cnf(c_61,plain,
( ~ occurrence_of(X0,X1)
| ~ occurrence_of(X0,X2)
| X1 = X2 ),
inference(cnf_transformation,[],[f183]) ).
cnf(c_66,plain,
( ~ activity_occurrence(X0)
| occurrence_of(X0,sK4(X0)) ),
inference(cnf_transformation,[],[f188]) ).
cnf(c_67,plain,
( ~ legal(X0)
| arboreal(X0) ),
inference(cnf_transformation,[],[f189]) ).
cnf(c_72,plain,
( ~ min_precedes(X0,X1,X2)
| ~ leaf(X0,X2) ),
inference(cnf_transformation,[],[f193]) ).
cnf(c_73,plain,
( ~ leaf(X0,X1)
| min_precedes(sK7(X0,X1),X0,X1)
| root(X0,X1) ),
inference(cnf_transformation,[],[f192]) ).
cnf(c_74,plain,
( ~ occurrence_of(X0,X1)
| ~ atomic(X1)
| arboreal(X0) ),
inference(cnf_transformation,[],[f197]) ).
cnf(c_76,plain,
( ~ root(X0,X1)
| legal(X0) ),
inference(cnf_transformation,[],[f198]) ).
cnf(c_77,plain,
( ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,X2)
| ~ leaf(X0,X2)
| leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f202]) ).
cnf(c_79,plain,
( ~ leaf_occ(X0,X1)
| subactivity_occurrence(X0,X1) ),
inference(cnf_transformation,[],[f200]) ).
cnf(c_84,plain,
( ~ precedes(X0,X1)
| legal(X1) ),
inference(cnf_transformation,[],[f206]) ).
cnf(c_89,plain,
( ~ min_precedes(X0,X1,X2)
| precedes(X0,X1) ),
inference(cnf_transformation,[],[f211]) ).
cnf(c_95,plain,
( ~ next_subocc(X0,X1,X2)
| min_precedes(X0,X1,X2) ),
inference(cnf_transformation,[],[f214]) ).
cnf(c_96,plain,
( ~ min_precedes(X0,X1,X2)
| ~ subactivity_occurrence(X1,X3)
| ~ occurrence_of(X3,X2)
| subactivity_occurrence(X0,X3) ),
inference(cnf_transformation,[],[f218]) ).
cnf(c_101,plain,
( ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0)
| ~ arboreal(X0)
| leaf(sK13(X0),tptp0)
| leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f229]) ).
cnf(c_102,plain,
( ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0)
| ~ arboreal(X0)
| next_subocc(sK12(X0),sK13(X0),tptp0)
| leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f228]) ).
cnf(c_103,plain,
( ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0)
| ~ arboreal(X0)
| occurrence_of(sK13(X0),tptp1)
| occurrence_of(sK13(X0),tptp2)
| leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f227]) ).
cnf(c_104,plain,
( ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0)
| ~ arboreal(X0)
| next_subocc(sK11(X0),sK12(X0),tptp0)
| leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f226]) ).
cnf(c_106,plain,
( ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0)
| ~ arboreal(X0)
| next_subocc(X0,sK11(X0),tptp0)
| leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f224]) ).
cnf(c_107,plain,
( ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0)
| ~ arboreal(X0)
| occurrence_of(sK11(X0),tptp3)
| leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f223]) ).
cnf(c_112,plain,
atomic(tptp3),
inference(cnf_transformation,[],[f234]) ).
cnf(c_119,negated_conjecture,
( ~ min_precedes(X0,X1,tptp0)
| ~ next_subocc(sK14,X0,tptp0)
| ~ occurrence_of(X0,tptp3)
| ~ occurrence_of(X1,tptp1)
| ~ leaf(X1,tptp0) ),
inference(cnf_transformation,[],[f246]) ).
cnf(c_120,negated_conjecture,
( ~ min_precedes(X0,X1,tptp0)
| ~ next_subocc(sK14,X0,tptp0)
| ~ occurrence_of(X0,tptp3)
| ~ occurrence_of(X1,tptp2)
| ~ leaf(X1,tptp0) ),
inference(cnf_transformation,[],[f245]) ).
cnf(c_121,negated_conjecture,
~ leaf_occ(sK14,sK15),
inference(cnf_transformation,[],[f244]) ).
cnf(c_122,negated_conjecture,
arboreal(sK14),
inference(cnf_transformation,[],[f243]) ).
cnf(c_123,negated_conjecture,
subactivity_occurrence(sK14,sK15),
inference(cnf_transformation,[],[f242]) ).
cnf(c_124,negated_conjecture,
occurrence_of(sK15,tptp0),
inference(cnf_transformation,[],[f241]) ).
cnf(c_5428,negated_conjecture,
occurrence_of(sK15,tptp0),
inference(demodulation,[status(thm)],[c_124]) ).
cnf(c_5429,negated_conjecture,
subactivity_occurrence(sK14,sK15),
inference(demodulation,[status(thm)],[c_123]) ).
cnf(c_5430,negated_conjecture,
arboreal(sK14),
inference(demodulation,[status(thm)],[c_122]) ).
cnf(c_5431,negated_conjecture,
~ leaf_occ(sK14,sK15),
inference(demodulation,[status(thm)],[c_121]) ).
cnf(c_5432,negated_conjecture,
( ~ min_precedes(X0,X1,tptp0)
| ~ next_subocc(sK14,X0,tptp0)
| ~ occurrence_of(X0,tptp3)
| ~ occurrence_of(X1,tptp2)
| ~ leaf(X1,tptp0) ),
inference(demodulation,[status(thm)],[c_120]) ).
cnf(c_5433,negated_conjecture,
( ~ min_precedes(X0,X1,tptp0)
| ~ next_subocc(sK14,X0,tptp0)
| ~ occurrence_of(X0,tptp3)
| ~ occurrence_of(X1,tptp1)
| ~ leaf(X1,tptp0) ),
inference(demodulation,[status(thm)],[c_119]) ).
cnf(c_5434,plain,
X0 = X0,
theory(equality) ).
cnf(c_5444,plain,
( X0 != X1
| X2 != X3
| ~ leaf(X1,X3)
| leaf(X0,X2) ),
theory(equality) ).
cnf(c_5446,plain,
tptp0 = tptp0,
inference(instantiation,[status(thm)],[c_5434]) ).
cnf(c_6828,plain,
( ~ occurrence_of(X0,X1)
| ~ activity_occurrence(X0)
| sK4(X0) = X1 ),
inference(superposition,[status(thm)],[c_66,c_61]) ).
cnf(c_6987,plain,
( ~ leaf(X0,X1)
| precedes(sK7(X0,X1),X0)
| root(X0,X1) ),
inference(superposition,[status(thm)],[c_73,c_89]) ).
cnf(c_7124,plain,
( ~ occurrence_of(X0,X1)
| sK4(X0) = X1 ),
inference(global_subsumption_just,[status(thm)],[c_6828,c_53,c_6828]) ).
cnf(c_7131,plain,
( ~ min_precedes(X0,X1,X2)
| sK4(sK2(X2,X0,X1)) = X2 ),
inference(superposition,[status(thm)],[c_58,c_7124]) ).
cnf(c_7204,plain,
( ~ occurrence_of(sK2(X0,X1,X2),X3)
| ~ min_precedes(X1,X2,X0)
| ~ leaf(X2,X3)
| leaf_occ(X2,sK2(X0,X1,X2)) ),
inference(superposition,[status(thm)],[c_56,c_77]) ).
cnf(c_7411,plain,
( ~ leaf(X0,X1)
| root(X0,X1)
| legal(X0) ),
inference(superposition,[status(thm)],[c_6987,c_84]) ).
cnf(c_7700,plain,
( ~ leaf(X0,X1)
| legal(X0) ),
inference(global_subsumption_just,[status(thm)],[c_7411,c_76,c_7411]) ).
cnf(c_7942,plain,
( ~ subactivity_occurrence(sK14,sK15)
| ~ occurrence_of(sK15,tptp0)
| ~ arboreal(sK14)
| leaf(sK13(sK14),tptp0) ),
inference(superposition,[status(thm)],[c_101,c_5431]) ).
cnf(c_7948,plain,
leaf(sK13(sK14),tptp0),
inference(forward_subsumption_resolution,[status(thm)],[c_7942,c_5430,c_5428,c_5429]) ).
cnf(c_8132,plain,
legal(sK13(sK14)),
inference(superposition,[status(thm)],[c_7948,c_7700]) ).
cnf(c_8142,plain,
arboreal(sK13(sK14)),
inference(superposition,[status(thm)],[c_8132,c_67]) ).
cnf(c_8371,plain,
( ~ subactivity_occurrence(sK14,sK15)
| ~ occurrence_of(sK15,tptp0)
| ~ arboreal(sK14)
| occurrence_of(sK11(sK14),tptp3) ),
inference(superposition,[status(thm)],[c_107,c_5431]) ).
cnf(c_8383,plain,
occurrence_of(sK11(sK14),tptp3),
inference(forward_subsumption_resolution,[status(thm)],[c_8371,c_5430,c_5428,c_5429]) ).
cnf(c_8513,plain,
( ~ subactivity_occurrence(sK14,sK15)
| ~ occurrence_of(sK15,tptp0)
| ~ arboreal(sK14)
| next_subocc(sK14,sK11(sK14),tptp0) ),
inference(superposition,[status(thm)],[c_106,c_5431]) ).
cnf(c_8521,plain,
next_subocc(sK14,sK11(sK14),tptp0),
inference(forward_subsumption_resolution,[status(thm)],[c_8513,c_5430,c_5428,c_5429]) ).
cnf(c_8591,plain,
( X0 != sK13(sK14)
| X1 != tptp0
| ~ leaf(sK13(sK14),tptp0)
| leaf(X0,X1) ),
inference(instantiation,[status(thm)],[c_5444]) ).
cnf(c_8609,plain,
( ~ subactivity_occurrence(sK14,sK15)
| ~ occurrence_of(sK15,tptp0)
| ~ arboreal(sK14)
| next_subocc(sK12(sK14),sK13(sK14),tptp0) ),
inference(superposition,[status(thm)],[c_102,c_5431]) ).
cnf(c_8622,plain,
next_subocc(sK12(sK14),sK13(sK14),tptp0),
inference(forward_subsumption_resolution,[status(thm)],[c_8609,c_5430,c_5428,c_5429]) ).
cnf(c_8703,plain,
( ~ min_precedes(sK11(sK14),X0,tptp0)
| ~ next_subocc(sK14,sK11(sK14),tptp0)
| ~ occurrence_of(sK11(sK14),tptp3)
| ~ occurrence_of(X0,tptp1)
| ~ leaf(X0,tptp0) ),
inference(instantiation,[status(thm)],[c_5433]) ).
cnf(c_8704,plain,
( ~ min_precedes(sK11(sK14),X0,tptp0)
| ~ next_subocc(sK14,sK11(sK14),tptp0)
| ~ occurrence_of(sK11(sK14),tptp3)
| ~ occurrence_of(X0,tptp2)
| ~ leaf(X0,tptp0) ),
inference(instantiation,[status(thm)],[c_5432]) ).
cnf(c_8723,plain,
( ~ subactivity_occurrence(sK14,sK15)
| ~ occurrence_of(sK15,tptp0)
| ~ arboreal(sK14)
| next_subocc(sK11(sK14),sK12(sK14),tptp0) ),
inference(superposition,[status(thm)],[c_104,c_5431]) ).
cnf(c_8731,plain,
next_subocc(sK11(sK14),sK12(sK14),tptp0),
inference(forward_subsumption_resolution,[status(thm)],[c_8723,c_5430,c_5428,c_5429]) ).
cnf(c_8910,plain,
( ~ atomic(tptp3)
| arboreal(sK11(sK14)) ),
inference(superposition,[status(thm)],[c_8383,c_74]) ).
cnf(c_8912,plain,
arboreal(sK11(sK14)),
inference(forward_subsumption_resolution,[status(thm)],[c_8910,c_112]) ).
cnf(c_8927,plain,
min_precedes(sK12(sK14),sK13(sK14),tptp0),
inference(superposition,[status(thm)],[c_8622,c_95]) ).
cnf(c_8940,plain,
min_precedes(sK11(sK14),sK12(sK14),tptp0),
inference(superposition,[status(thm)],[c_8731,c_95]) ).
cnf(c_9284,plain,
( ~ subactivity_occurrence(sK14,sK15)
| ~ occurrence_of(sK15,tptp0)
| ~ arboreal(sK14)
| occurrence_of(sK13(sK14),tptp1)
| occurrence_of(sK13(sK14),tptp2) ),
inference(superposition,[status(thm)],[c_103,c_5431]) ).
cnf(c_9298,plain,
( occurrence_of(sK13(sK14),tptp1)
| occurrence_of(sK13(sK14),tptp2) ),
inference(forward_subsumption_resolution,[status(thm)],[c_9284,c_5430,c_5428,c_5429]) ).
cnf(c_10239,plain,
( ~ subactivity_occurrence(sK13(sK14),X0)
| ~ occurrence_of(X0,tptp0)
| subactivity_occurrence(sK12(sK14),X0) ),
inference(superposition,[status(thm)],[c_8927,c_96]) ).
cnf(c_10393,plain,
( ~ subactivity_occurrence(sK12(sK14),X0)
| ~ occurrence_of(X0,tptp0)
| subactivity_occurrence(sK11(sK14),X0) ),
inference(superposition,[status(thm)],[c_8940,c_96]) ).
cnf(c_10404,plain,
~ leaf(sK11(sK14),tptp0),
inference(superposition,[status(thm)],[c_8940,c_72]) ).
cnf(c_10866,plain,
( ~ min_precedes(sK11(sK14),sK13(sK14),tptp0)
| ~ next_subocc(sK14,sK11(sK14),tptp0)
| ~ occurrence_of(sK13(sK14),tptp1)
| ~ occurrence_of(sK11(sK14),tptp3)
| ~ leaf(sK13(sK14),tptp0) ),
inference(instantiation,[status(thm)],[c_8703]) ).
cnf(c_13372,plain,
( ~ subactivity_occurrence(sK13(sK14),X0)
| ~ subactivity_occurrence(X1,X0)
| ~ occurrence_of(X0,X2)
| ~ arboreal(sK13(sK14))
| ~ arboreal(X1)
| X1 = sK13(sK14)
| min_precedes(sK13(sK14),X1,X2)
| min_precedes(X1,sK13(sK14),X2) ),
inference(instantiation,[status(thm)],[c_54]) ).
cnf(c_15031,plain,
( ~ min_precedes(sK12(sK14),sK13(sK14),tptp0)
| occurrence_of(sK2(tptp0,sK12(sK14),sK13(sK14)),tptp0) ),
inference(instantiation,[status(thm)],[c_58]) ).
cnf(c_15033,plain,
( ~ min_precedes(sK12(sK14),sK13(sK14),tptp0)
| subactivity_occurrence(sK13(sK14),sK2(tptp0,sK12(sK14),sK13(sK14))) ),
inference(instantiation,[status(thm)],[c_56]) ).
cnf(c_20756,plain,
( ~ min_precedes(sK13(sK14),X0,X1)
| ~ leaf(sK13(sK14),X1) ),
inference(instantiation,[status(thm)],[c_72]) ).
cnf(c_24378,plain,
( ~ subactivity_occurrence(sK13(sK14),X0)
| ~ subactivity_occurrence(sK11(sK14),X0)
| ~ occurrence_of(X0,X1)
| ~ arboreal(sK13(sK14))
| ~ arboreal(sK11(sK14))
| sK11(sK14) = sK13(sK14)
| min_precedes(sK13(sK14),sK11(sK14),X1)
| min_precedes(sK11(sK14),sK13(sK14),X1) ),
inference(instantiation,[status(thm)],[c_13372]) ).
cnf(c_31662,plain,
sK4(sK2(tptp0,sK12(sK14),sK13(sK14))) = tptp0,
inference(superposition,[status(thm)],[c_8927,c_7131]) ).
cnf(c_32538,plain,
( ~ activity_occurrence(sK2(tptp0,sK12(sK14),sK13(sK14)))
| occurrence_of(sK2(tptp0,sK12(sK14),sK13(sK14)),tptp0) ),
inference(superposition,[status(thm)],[c_31662,c_66]) ).
cnf(c_35088,plain,
( ~ subactivity_occurrence(sK13(sK14),sK2(tptp0,sK12(sK14),sK13(sK14)))
| ~ subactivity_occurrence(sK11(sK14),sK2(tptp0,sK12(sK14),sK13(sK14)))
| ~ occurrence_of(sK2(tptp0,sK12(sK14),sK13(sK14)),X0)
| ~ arboreal(sK13(sK14))
| ~ arboreal(sK11(sK14))
| sK11(sK14) = sK13(sK14)
| min_precedes(sK13(sK14),sK11(sK14),X0)
| min_precedes(sK11(sK14),sK13(sK14),X0) ),
inference(instantiation,[status(thm)],[c_24378]) ).
cnf(c_35089,plain,
( ~ subactivity_occurrence(sK13(sK14),sK2(tptp0,sK12(sK14),sK13(sK14)))
| ~ subactivity_occurrence(sK11(sK14),sK2(tptp0,sK12(sK14),sK13(sK14)))
| ~ occurrence_of(sK2(tptp0,sK12(sK14),sK13(sK14)),tptp0)
| ~ arboreal(sK13(sK14))
| ~ arboreal(sK11(sK14))
| sK11(sK14) = sK13(sK14)
| min_precedes(sK13(sK14),sK11(sK14),tptp0)
| min_precedes(sK11(sK14),sK13(sK14),tptp0) ),
inference(instantiation,[status(thm)],[c_35088]) ).
cnf(c_47800,plain,
occurrence_of(sK2(tptp0,sK12(sK14),sK13(sK14)),tptp0),
inference(global_subsumption_just,[status(thm)],[c_32538,c_8927,c_15031]) ).
cnf(c_47815,plain,
( ~ min_precedes(sK12(sK14),sK13(sK14),tptp0)
| ~ leaf(sK13(sK14),tptp0)
| leaf_occ(sK13(sK14),sK2(tptp0,sK12(sK14),sK13(sK14))) ),
inference(superposition,[status(thm)],[c_47800,c_7204]) ).
cnf(c_47831,plain,
leaf_occ(sK13(sK14),sK2(tptp0,sK12(sK14),sK13(sK14))),
inference(forward_subsumption_resolution,[status(thm)],[c_47815,c_7948,c_8927]) ).
cnf(c_47906,plain,
subactivity_occurrence(sK13(sK14),sK2(tptp0,sK12(sK14),sK13(sK14))),
inference(superposition,[status(thm)],[c_47831,c_79]) ).
cnf(c_47926,plain,
( ~ occurrence_of(sK2(tptp0,sK12(sK14),sK13(sK14)),tptp0)
| subactivity_occurrence(sK12(sK14),sK2(tptp0,sK12(sK14),sK13(sK14))) ),
inference(superposition,[status(thm)],[c_47906,c_10239]) ).
cnf(c_47927,plain,
subactivity_occurrence(sK12(sK14),sK2(tptp0,sK12(sK14),sK13(sK14))),
inference(forward_subsumption_resolution,[status(thm)],[c_47926,c_47800]) ).
cnf(c_47972,plain,
( ~ occurrence_of(sK2(tptp0,sK12(sK14),sK13(sK14)),tptp0)
| subactivity_occurrence(sK11(sK14),sK2(tptp0,sK12(sK14),sK13(sK14))) ),
inference(superposition,[status(thm)],[c_47927,c_10393]) ).
cnf(c_47977,plain,
subactivity_occurrence(sK11(sK14),sK2(tptp0,sK12(sK14),sK13(sK14))),
inference(forward_subsumption_resolution,[status(thm)],[c_47972,c_47800]) ).
cnf(c_59771,plain,
( ~ min_precedes(sK11(sK14),sK13(sK14),tptp0)
| ~ next_subocc(sK14,sK11(sK14),tptp0)
| ~ occurrence_of(sK13(sK14),tptp2)
| ~ occurrence_of(sK11(sK14),tptp3)
| ~ leaf(sK13(sK14),tptp0) ),
inference(instantiation,[status(thm)],[c_8704]) ).
cnf(c_83060,plain,
( sK11(sK14) != sK13(sK14)
| X0 != tptp0
| ~ leaf(sK13(sK14),tptp0)
| leaf(sK11(sK14),X0) ),
inference(instantiation,[status(thm)],[c_8591]) ).
cnf(c_83061,plain,
( sK11(sK14) != sK13(sK14)
| tptp0 != tptp0
| ~ leaf(sK13(sK14),tptp0)
| leaf(sK11(sK14),tptp0) ),
inference(instantiation,[status(thm)],[c_83060]) ).
cnf(c_104350,plain,
( ~ min_precedes(sK13(sK14),sK11(sK14),X0)
| ~ leaf(sK13(sK14),X0) ),
inference(instantiation,[status(thm)],[c_20756]) ).
cnf(c_104351,plain,
( ~ min_precedes(sK13(sK14),sK11(sK14),tptp0)
| ~ leaf(sK13(sK14),tptp0) ),
inference(instantiation,[status(thm)],[c_104350]) ).
cnf(c_104352,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_104351,c_83061,c_59771,c_47977,c_35089,c_15031,c_15033,c_10866,c_10404,c_9298,c_8927,c_8912,c_8521,c_8383,c_8142,c_7948,c_5446]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.08 % Problem : PRO014+4 : TPTP v8.1.2. Released v4.0.0.
% 0.05/0.09 % Command : run_iprover %s %d THM
% 0.08/0.28 % Computer : n032.cluster.edu
% 0.08/0.28 % Model : x86_64 x86_64
% 0.08/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.28 % Memory : 8042.1875MB
% 0.08/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.28 % CPULimit : 300
% 0.08/0.28 % WCLimit : 300
% 0.08/0.28 % DateTime : Thu May 2 23:45:38 EDT 2024
% 0.08/0.28 % CPUTime :
% 0.12/0.36 Running first-order theorem proving
% 0.12/0.36 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 19.70/3.52 % SZS status Started for theBenchmark.p
% 19.70/3.52 % SZS status Theorem for theBenchmark.p
% 19.70/3.52
% 19.70/3.52 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 19.70/3.52
% 19.70/3.52 ------ iProver source info
% 19.70/3.52
% 19.70/3.52 git: date: 2024-05-02 19:28:25 +0000
% 19.70/3.52 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 19.70/3.52 git: non_committed_changes: false
% 19.70/3.52
% 19.70/3.52 ------ Parsing...
% 19.70/3.52 ------ Clausification by vclausify_rel & Parsing by iProver...
% 19.70/3.52
% 19.70/3.52 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe_e sup_sim: 0 sf_s rm: 2 0s sf_e pe_s pe_e
% 19.70/3.52
% 19.70/3.52 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 19.70/3.52
% 19.70/3.52 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 19.70/3.52 ------ Proving...
% 19.70/3.52 ------ Problem Properties
% 19.70/3.52
% 19.70/3.52
% 19.70/3.52 clauses 75
% 19.70/3.52 conjectures 6
% 19.70/3.52 EPR 49
% 19.70/3.52 Horn 55
% 19.70/3.52 unary 15
% 19.70/3.52 binary 25
% 19.70/3.52 lits 208
% 19.70/3.52 lits eq 12
% 19.70/3.52 fd_pure 0
% 19.70/3.52 fd_pseudo 0
% 19.70/3.52 fd_cond 0
% 19.70/3.52 fd_pseudo_cond 6
% 19.70/3.52 AC symbols 0
% 19.70/3.52
% 19.70/3.52 ------ Schedule dynamic 5 is on
% 19.70/3.52
% 19.70/3.52 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 19.70/3.52
% 19.70/3.52
% 19.70/3.52 ------
% 19.70/3.52 Current options:
% 19.70/3.52 ------
% 19.70/3.52
% 19.70/3.52
% 19.70/3.52
% 19.70/3.52
% 19.70/3.52 ------ Proving...
% 19.70/3.52
% 19.70/3.52
% 19.70/3.52 % SZS status Theorem for theBenchmark.p
% 19.70/3.52
% 19.70/3.52 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 19.70/3.52
% 19.70/3.52
%------------------------------------------------------------------------------