TSTP Solution File: PRO009+3 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : PRO009+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n009.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 : 600s
% DateTime : Mon Jul 18 17:44:59 EDT 2022
% Result : Theorem 0.24s 1.41s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 19
% Syntax : Number of formulae : 119 ( 13 unt; 0 def)
% Number of atoms : 379 ( 21 equ)
% Maximal formula atoms : 15 ( 3 avg)
% Number of connectives : 450 ( 190 ~; 184 |; 57 &)
% ( 4 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 18 ( 16 usr; 1 prp; 0-3 aty)
% Number of functors : 15 ( 15 usr; 6 con; 0-4 aty)
% Number of variables : 212 ( 16 sgn 92 !; 13 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goals,conjecture,
! [X166] :
( occurrence_of(X166,tptp0)
=> ? [X167,X168] :
( occurrence_of(X167,tptp3)
& root_occ(X167,X166)
& ( occurrence_of(X168,tptp2)
| occurrence_of(X168,tptp1) )
& min_precedes(X167,X168,tptp0)
& leaf_occ(X168,X166) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',goals) ).
fof(sos_02,axiom,
! [X5,X6,X7] :
( ( occurrence_of(X5,X6)
& occurrence_of(X5,X7) )
=> X6 = X7 ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',sos_02) ).
fof(sos_01,axiom,
! [X3] :
( activity_occurrence(X3)
=> ? [X4] :
( activity(X4)
& occurrence_of(X3,X4) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',sos_01) ).
fof(sos,axiom,
! [X1,X2] :
( occurrence_of(X2,X1)
=> ( activity(X1)
& activity_occurrence(X2) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',sos) ).
fof(sos_23,axiom,
! [X65,X66] :
( atocc(X65,X66)
<=> ? [X67] :
( subactivity(X66,X67)
& atomic(X67)
& occurrence_of(X65,X67) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',sos_23) ).
fof(sos_33,axiom,
! [X100,X101] :
( root_occ(X100,X101)
<=> ? [X102] :
( occurrence_of(X101,X102)
& subactivity_occurrence(X100,X101)
& root(X100,X102) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',sos_33) ).
fof(sos_12,axiom,
! [X29,X30] :
( root(X30,X29)
=> ? [X31] :
( subactivity(X31,X29)
& atocc(X30,X31) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',sos_12) ).
fof(sos_49,axiom,
! [X162] :
( occurrence_of(X162,tptp0)
=> ? [X163,X164,X165] :
( occurrence_of(X163,tptp3)
& root_occ(X163,X162)
& occurrence_of(X164,tptp4)
& next_subocc(X163,X164,tptp0)
& ( occurrence_of(X165,tptp2)
| occurrence_of(X165,tptp1) )
& next_subocc(X164,X165,tptp0)
& leaf_occ(X165,X162) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',sos_49) ).
fof(sos_32,axiom,
! [X95,X96,X97,X98] :
( ( occurrence_of(X97,X95)
& occurrence_of(X98,X96)
& subactivity(X95,X96)
& ~ subactivity_occurrence(X97,X98) )
=> ? [X99] :
( subactivity_occurrence(X99,X98)
& ~ subactivity_occurrence(X99,X97) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',sos_32) ).
fof(sos_03,axiom,
! [X8] :
( activity(X8)
=> subactivity(X8,X8) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',sos_03) ).
fof(sos_16,axiom,
! [X42,X43] :
( root(X42,X43)
=> legal(X42) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',sos_16) ).
fof(sos_31,axiom,
! [X92,X93,X94] :
( ( subactivity_occurrence(X92,X93)
& subactivity_occurrence(X93,X94) )
=> subactivity_occurrence(X92,X94) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',sos_31) ).
fof(sos_22,axiom,
! [X61,X62,X63] :
( next_subocc(X61,X62,X63)
<=> ( min_precedes(X61,X62,X63)
& ~ ? [X64] :
( min_precedes(X61,X64,X63)
& min_precedes(X64,X62,X63) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',sos_22) ).
fof(sos_43,axiom,
! [X139,X140,X141,X142] :
( ( occurrence_of(X140,X139)
& subactivity_occurrence(X141,X140)
& leaf_occ(X142,X140)
& arboreal(X141)
& ~ min_precedes(X141,X142,X139) )
=> X142 = X141 ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',sos_43) ).
fof(sos_08,axiom,
! [X19] :
( legal(X19)
=> arboreal(X19) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',sos_08) ).
fof(sos_15,axiom,
! [X39,X40,X41] :
( min_precedes(X39,X40,X41)
=> precedes(X39,X40) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',sos_15) ).
fof(sos_10,axiom,
! [X22,X23] :
( precedes(X22,X23)
<=> ( earlier(X22,X23)
& legal(X23) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',sos_10) ).
fof(sos_04,axiom,
! [X9,X10] :
( earlier(X9,X10)
=> ~ earlier(X10,X9) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',sos_04) ).
fof(sos_60,axiom,
tptp3 != tptp1,
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',sos_60) ).
fof(c_0_19,negated_conjecture,
~ ! [X166] :
( occurrence_of(X166,tptp0)
=> ? [X167,X168] :
( occurrence_of(X167,tptp3)
& root_occ(X167,X166)
& ( occurrence_of(X168,tptp2)
| occurrence_of(X168,tptp1) )
& min_precedes(X167,X168,tptp0)
& leaf_occ(X168,X166) ) ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_20,plain,
! [X8,X9,X10] :
( ~ occurrence_of(X8,X9)
| ~ occurrence_of(X8,X10)
| X9 = X10 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_02])]) ).
fof(c_0_21,plain,
! [X5] :
( ( activity(esk8_1(X5))
| ~ activity_occurrence(X5) )
& ( occurrence_of(X5,esk8_1(X5))
| ~ activity_occurrence(X5) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_01])])])])])]) ).
fof(c_0_22,plain,
! [X3,X4] :
( ( activity(X3)
| ~ occurrence_of(X4,X3) )
& ( activity_occurrence(X4)
| ~ occurrence_of(X4,X3) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos])])]) ).
fof(c_0_23,negated_conjecture,
! [X170,X171] :
( occurrence_of(esk1_0,tptp0)
& ( ~ occurrence_of(X171,tptp2)
| ~ occurrence_of(X170,tptp3)
| ~ root_occ(X170,esk1_0)
| ~ min_precedes(X170,X171,tptp0)
| ~ leaf_occ(X171,esk1_0) )
& ( ~ occurrence_of(X171,tptp1)
| ~ occurrence_of(X170,tptp3)
| ~ root_occ(X170,esk1_0)
| ~ min_precedes(X170,X171,tptp0)
| ~ leaf_occ(X171,esk1_0) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_19])])])])])])]) ).
cnf(c_0_24,plain,
( X1 = X2
| ~ occurrence_of(X3,X2)
| ~ occurrence_of(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_25,plain,
( occurrence_of(X1,esk8_1(X1))
| ~ activity_occurrence(X1) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_26,plain,
( activity_occurrence(X1)
| ~ occurrence_of(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
fof(c_0_27,plain,
! [X68,X69,X68,X69,X71] :
( ( subactivity(X69,esk16_2(X68,X69))
| ~ atocc(X68,X69) )
& ( atomic(esk16_2(X68,X69))
| ~ atocc(X68,X69) )
& ( occurrence_of(X68,esk16_2(X68,X69))
| ~ atocc(X68,X69) )
& ( ~ subactivity(X69,X71)
| ~ atomic(X71)
| ~ occurrence_of(X68,X71)
| atocc(X68,X69) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_23])])])])])])]) ).
cnf(c_0_28,negated_conjecture,
occurrence_of(esk1_0,tptp0),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
fof(c_0_29,plain,
! [X103,X104,X103,X104,X106] :
( ( occurrence_of(X104,esk6_2(X103,X104))
| ~ root_occ(X103,X104) )
& ( subactivity_occurrence(X103,X104)
| ~ root_occ(X103,X104) )
& ( root(X103,esk6_2(X103,X104))
| ~ root_occ(X103,X104) )
& ( ~ occurrence_of(X104,X106)
| ~ subactivity_occurrence(X103,X104)
| ~ root(X103,X106)
| root_occ(X103,X104) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_33])])])])])])]) ).
cnf(c_0_30,plain,
( X1 = esk8_1(X2)
| ~ occurrence_of(X2,X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]) ).
cnf(c_0_31,plain,
( occurrence_of(X1,esk16_2(X1,X2))
| ~ atocc(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_32,negated_conjecture,
( X1 = tptp0
| ~ occurrence_of(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_24,c_0_28]) ).
cnf(c_0_33,plain,
( occurrence_of(X2,esk6_2(X1,X2))
| ~ root_occ(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_34,plain,
( esk16_2(X1,X2) = esk8_1(X1)
| ~ atocc(X1,X2) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
fof(c_0_35,plain,
! [X32,X33] :
( ( subactivity(esk15_2(X32,X33),X32)
| ~ root(X33,X32) )
& ( atocc(X33,esk15_2(X32,X33))
| ~ root(X33,X32) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_12])])])])])]) ).
cnf(c_0_36,plain,
( root(X1,esk6_2(X1,X2))
| ~ root_occ(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_37,negated_conjecture,
( esk6_2(X1,esk1_0) = tptp0
| ~ root_occ(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_38,plain,
( occurrence_of(X1,esk8_1(X1))
| ~ atocc(X1,X2) ),
inference(spm,[status(thm)],[c_0_31,c_0_34]) ).
cnf(c_0_39,plain,
( atocc(X1,esk15_2(X2,X1))
| ~ root(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_40,plain,
( esk6_2(X1,X2) = esk8_1(X2)
| ~ root_occ(X1,X2) ),
inference(spm,[status(thm)],[c_0_30,c_0_33]) ).
cnf(c_0_41,plain,
( root_occ(X1,X2)
| ~ root(X1,X3)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_42,negated_conjecture,
( root(X1,tptp0)
| ~ root_occ(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
fof(c_0_43,plain,
! [X166] :
( ( occurrence_of(esk3_1(X166),tptp3)
| ~ occurrence_of(X166,tptp0) )
& ( root_occ(esk3_1(X166),X166)
| ~ occurrence_of(X166,tptp0) )
& ( occurrence_of(esk4_1(X166),tptp4)
| ~ occurrence_of(X166,tptp0) )
& ( next_subocc(esk3_1(X166),esk4_1(X166),tptp0)
| ~ occurrence_of(X166,tptp0) )
& ( occurrence_of(esk5_1(X166),tptp2)
| occurrence_of(esk5_1(X166),tptp1)
| ~ occurrence_of(X166,tptp0) )
& ( next_subocc(esk4_1(X166),esk5_1(X166),tptp0)
| ~ occurrence_of(X166,tptp0) )
& ( leaf_occ(esk5_1(X166),X166)
| ~ occurrence_of(X166,tptp0) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_49])])])])])]) ).
cnf(c_0_44,plain,
( occurrence_of(X1,esk8_1(X1))
| ~ root(X1,X2) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_45,plain,
( root(X1,esk8_1(X2))
| ~ root_occ(X1,X2) ),
inference(spm,[status(thm)],[c_0_36,c_0_40]) ).
cnf(c_0_46,negated_conjecture,
( root_occ(X1,X2)
| ~ root_occ(X1,esk1_0)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_47,plain,
( root_occ(esk3_1(X1),X1)
| ~ occurrence_of(X1,tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
fof(c_0_48,plain,
! [X100,X101,X102,X103] :
( ( subactivity_occurrence(esk12_4(X100,X101,X102,X103),X103)
| ~ occurrence_of(X102,X100)
| ~ occurrence_of(X103,X101)
| ~ subactivity(X100,X101)
| subactivity_occurrence(X102,X103) )
& ( ~ subactivity_occurrence(esk12_4(X100,X101,X102,X103),X102)
| ~ occurrence_of(X102,X100)
| ~ occurrence_of(X103,X101)
| ~ subactivity(X100,X101)
| subactivity_occurrence(X102,X103) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[sos_32])])])])])])]) ).
fof(c_0_49,plain,
! [X9] :
( ~ activity(X9)
| subactivity(X9,X9) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_03])]) ).
cnf(c_0_50,plain,
( occurrence_of(X1,esk8_1(X1))
| ~ root_occ(X1,X2) ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_51,negated_conjecture,
( root_occ(esk3_1(esk1_0),X1)
| ~ subactivity_occurrence(esk3_1(esk1_0),X1)
| ~ occurrence_of(X1,tptp0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_28])]) ).
cnf(c_0_52,plain,
( subactivity_occurrence(X1,X2)
| ~ root_occ(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_53,plain,
( subactivity_occurrence(X1,X2)
| ~ subactivity(X3,X4)
| ~ occurrence_of(X2,X4)
| ~ occurrence_of(X1,X3)
| ~ subactivity_occurrence(esk12_4(X3,X4,X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_54,plain,
( subactivity_occurrence(X1,X2)
| subactivity_occurrence(esk12_4(X3,X4,X1,X2),X2)
| ~ subactivity(X3,X4)
| ~ occurrence_of(X2,X4)
| ~ occurrence_of(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_55,plain,
( subactivity(X1,X1)
| ~ activity(X1) ),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_56,plain,
( activity(esk8_1(X1))
| ~ activity_occurrence(X1) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_57,negated_conjecture,
( occurrence_of(esk3_1(esk1_0),esk8_1(esk3_1(esk1_0)))
| ~ subactivity_occurrence(esk3_1(esk1_0),X1)
| ~ occurrence_of(X1,tptp0) ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_58,plain,
( subactivity_occurrence(esk3_1(X1),X1)
| ~ occurrence_of(X1,tptp0) ),
inference(spm,[status(thm)],[c_0_52,c_0_47]) ).
cnf(c_0_59,plain,
( occurrence_of(esk3_1(X1),tptp3)
| ~ occurrence_of(X1,tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
fof(c_0_60,plain,
! [X44,X45] :
( ~ root(X44,X45)
| legal(X44) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_16])])])]) ).
cnf(c_0_61,plain,
( subactivity_occurrence(X1,X1)
| ~ subactivity(X2,X3)
| ~ occurrence_of(X1,X3)
| ~ occurrence_of(X1,X2) ),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_62,plain,
( subactivity(esk8_1(X1),esk8_1(X1))
| ~ activity_occurrence(X1) ),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_63,negated_conjecture,
occurrence_of(esk3_1(esk1_0),esk8_1(esk3_1(esk1_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_28])]) ).
cnf(c_0_64,plain,
( esk8_1(esk3_1(X1)) = tptp3
| ~ occurrence_of(X1,tptp0) ),
inference(spm,[status(thm)],[c_0_30,c_0_59]) ).
cnf(c_0_65,plain,
( legal(X1)
| ~ root(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_60]) ).
fof(c_0_66,plain,
! [X95,X96,X97] :
( ~ subactivity_occurrence(X95,X96)
| ~ subactivity_occurrence(X96,X97)
| subactivity_occurrence(X95,X97) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_31])]) ).
cnf(c_0_67,plain,
( subactivity_occurrence(X1,X1)
| ~ activity_occurrence(X2)
| ~ occurrence_of(X1,esk8_1(X2)) ),
inference(spm,[status(thm)],[c_0_61,c_0_62]) ).
cnf(c_0_68,negated_conjecture,
occurrence_of(esk3_1(esk1_0),tptp3),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_28])]) ).
cnf(c_0_69,plain,
( legal(X1)
| ~ root_occ(X1,X2) ),
inference(spm,[status(thm)],[c_0_65,c_0_36]) ).
fof(c_0_70,plain,
! [X65,X66,X67,X68,X65,X66,X67] :
( ( min_precedes(X65,X66,X67)
| ~ next_subocc(X65,X66,X67) )
& ( ~ min_precedes(X65,X68,X67)
| ~ min_precedes(X68,X66,X67)
| ~ next_subocc(X65,X66,X67) )
& ( min_precedes(X65,esk7_3(X65,X66,X67),X67)
| ~ min_precedes(X65,X66,X67)
| next_subocc(X65,X66,X67) )
& ( min_precedes(esk7_3(X65,X66,X67),X66,X67)
| ~ min_precedes(X65,X66,X67)
| next_subocc(X65,X66,X67) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_22])])])])])])]) ).
fof(c_0_71,plain,
! [X143,X144,X145,X146] :
( ~ occurrence_of(X144,X143)
| ~ subactivity_occurrence(X145,X144)
| ~ leaf_occ(X146,X144)
| ~ arboreal(X145)
| min_precedes(X145,X146,X143)
| X146 = X145 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[sos_43])])]) ).
cnf(c_0_72,plain,
( subactivity_occurrence(X1,X2)
| ~ subactivity_occurrence(X3,X2)
| ~ subactivity_occurrence(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_66]) ).
cnf(c_0_73,plain,
( subactivity_occurrence(X1,X1)
| ~ activity_occurrence(X1) ),
inference(spm,[status(thm)],[c_0_67,c_0_25]) ).
cnf(c_0_74,negated_conjecture,
activity_occurrence(esk3_1(esk1_0)),
inference(spm,[status(thm)],[c_0_26,c_0_68]) ).
fof(c_0_75,plain,
! [X20] :
( ~ legal(X20)
| arboreal(X20) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_08])]) ).
cnf(c_0_76,negated_conjecture,
( legal(esk3_1(esk1_0))
| ~ subactivity_occurrence(esk3_1(esk1_0),X1)
| ~ occurrence_of(X1,tptp0) ),
inference(spm,[status(thm)],[c_0_69,c_0_51]) ).
fof(c_0_77,plain,
! [X42,X43,X44] :
( ~ min_precedes(X42,X43,X44)
| precedes(X42,X43) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_15])])])]) ).
cnf(c_0_78,plain,
( min_precedes(X1,X2,X3)
| ~ next_subocc(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_70]) ).
cnf(c_0_79,plain,
( next_subocc(esk3_1(X1),esk4_1(X1),tptp0)
| ~ occurrence_of(X1,tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_80,plain,
( X1 = X2
| min_precedes(X2,X1,X3)
| ~ arboreal(X2)
| ~ leaf_occ(X1,X4)
| ~ subactivity_occurrence(X2,X4)
| ~ occurrence_of(X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_71]) ).
cnf(c_0_81,plain,
( leaf_occ(esk5_1(X1),X1)
| ~ occurrence_of(X1,tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_82,plain,
( subactivity_occurrence(X1,X2)
| ~ subactivity_occurrence(X1,esk3_1(X2))
| ~ occurrence_of(X2,tptp0) ),
inference(spm,[status(thm)],[c_0_72,c_0_58]) ).
cnf(c_0_83,negated_conjecture,
subactivity_occurrence(esk3_1(esk1_0),esk3_1(esk1_0)),
inference(spm,[status(thm)],[c_0_73,c_0_74]) ).
cnf(c_0_84,plain,
( arboreal(X1)
| ~ legal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_75]) ).
cnf(c_0_85,negated_conjecture,
legal(esk3_1(esk1_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_58]),c_0_28])]) ).
fof(c_0_86,plain,
! [X24,X25,X24,X25] :
( ( earlier(X24,X25)
| ~ precedes(X24,X25) )
& ( legal(X25)
| ~ precedes(X24,X25) )
& ( ~ earlier(X24,X25)
| ~ legal(X25)
| precedes(X24,X25) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_10])])])])]) ).
cnf(c_0_87,plain,
( precedes(X1,X2)
| ~ min_precedes(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_77]) ).
cnf(c_0_88,plain,
( min_precedes(esk3_1(X1),esk4_1(X1),tptp0)
| ~ occurrence_of(X1,tptp0) ),
inference(spm,[status(thm)],[c_0_78,c_0_79]) ).
cnf(c_0_89,plain,
( esk5_1(X1) = X2
| min_precedes(X2,esk5_1(X1),X3)
| ~ subactivity_occurrence(X2,X1)
| ~ arboreal(X2)
| ~ occurrence_of(X1,tptp0)
| ~ occurrence_of(X1,X3) ),
inference(spm,[status(thm)],[c_0_80,c_0_81]) ).
cnf(c_0_90,negated_conjecture,
subactivity_occurrence(esk3_1(esk1_0),esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_83]),c_0_28])]) ).
cnf(c_0_91,negated_conjecture,
arboreal(esk3_1(esk1_0)),
inference(spm,[status(thm)],[c_0_84,c_0_85]) ).
fof(c_0_92,plain,
! [X11,X12] :
( ~ earlier(X11,X12)
| ~ earlier(X12,X11) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[sos_04])])]) ).
cnf(c_0_93,plain,
( earlier(X1,X2)
| ~ precedes(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_86]) ).
cnf(c_0_94,plain,
( precedes(esk3_1(X1),esk4_1(X1))
| ~ occurrence_of(X1,tptp0) ),
inference(spm,[status(thm)],[c_0_87,c_0_88]) ).
cnf(c_0_95,negated_conjecture,
( ~ leaf_occ(X1,esk1_0)
| ~ min_precedes(X2,X1,tptp0)
| ~ root_occ(X2,esk1_0)
| ~ occurrence_of(X2,tptp3)
| ~ occurrence_of(X1,tptp2) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_96,negated_conjecture,
( esk3_1(esk1_0) = esk5_1(esk1_0)
| min_precedes(esk3_1(esk1_0),esk5_1(esk1_0),X1)
| ~ occurrence_of(esk1_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_89,c_0_90]),c_0_91]),c_0_28])]) ).
cnf(c_0_97,plain,
( next_subocc(esk4_1(X1),esk5_1(X1),tptp0)
| ~ occurrence_of(X1,tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_98,negated_conjecture,
( ~ leaf_occ(X1,esk1_0)
| ~ min_precedes(X2,X1,tptp0)
| ~ root_occ(X2,esk1_0)
| ~ occurrence_of(X2,tptp3)
| ~ occurrence_of(X1,tptp1) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_99,plain,
( ~ earlier(X1,X2)
| ~ earlier(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_92]) ).
cnf(c_0_100,plain,
( earlier(esk3_1(X1),esk4_1(X1))
| ~ occurrence_of(X1,tptp0) ),
inference(spm,[status(thm)],[c_0_93,c_0_94]) ).
cnf(c_0_101,negated_conjecture,
( esk3_1(esk1_0) = esk5_1(esk1_0)
| ~ leaf_occ(esk5_1(esk1_0),esk1_0)
| ~ root_occ(esk3_1(esk1_0),esk1_0)
| ~ occurrence_of(esk5_1(esk1_0),tptp2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_95,c_0_96]),c_0_68]),c_0_28])]) ).
cnf(c_0_102,plain,
( min_precedes(esk4_1(X1),esk5_1(X1),tptp0)
| ~ occurrence_of(X1,tptp0) ),
inference(spm,[status(thm)],[c_0_78,c_0_97]) ).
cnf(c_0_103,negated_conjecture,
( esk3_1(esk1_0) = esk5_1(esk1_0)
| ~ leaf_occ(esk5_1(esk1_0),esk1_0)
| ~ root_occ(esk3_1(esk1_0),esk1_0)
| ~ occurrence_of(esk5_1(esk1_0),tptp1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_98,c_0_96]),c_0_68]),c_0_28])]) ).
cnf(c_0_104,plain,
( ~ earlier(esk4_1(X1),esk3_1(X1))
| ~ occurrence_of(X1,tptp0) ),
inference(spm,[status(thm)],[c_0_99,c_0_100]) ).
cnf(c_0_105,negated_conjecture,
( esk3_1(esk1_0) = esk5_1(esk1_0)
| ~ leaf_occ(esk5_1(esk1_0),esk1_0)
| ~ occurrence_of(esk5_1(esk1_0),tptp2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_101,c_0_47]),c_0_28])]) ).
cnf(c_0_106,plain,
( precedes(esk4_1(X1),esk5_1(X1))
| ~ occurrence_of(X1,tptp0) ),
inference(spm,[status(thm)],[c_0_87,c_0_102]) ).
cnf(c_0_107,negated_conjecture,
( esk3_1(esk1_0) = esk5_1(esk1_0)
| ~ leaf_occ(esk5_1(esk1_0),esk1_0)
| ~ occurrence_of(esk5_1(esk1_0),tptp1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_103,c_0_47]),c_0_28])]) ).
cnf(c_0_108,negated_conjecture,
( ~ leaf_occ(esk5_1(esk1_0),esk1_0)
| ~ earlier(esk4_1(esk1_0),esk5_1(esk1_0))
| ~ occurrence_of(esk5_1(esk1_0),tptp2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_104,c_0_105]),c_0_28])]) ).
cnf(c_0_109,plain,
( earlier(esk4_1(X1),esk5_1(X1))
| ~ occurrence_of(X1,tptp0) ),
inference(spm,[status(thm)],[c_0_93,c_0_106]) ).
cnf(c_0_110,plain,
( occurrence_of(esk5_1(X1),tptp1)
| occurrence_of(esk5_1(X1),tptp2)
| ~ occurrence_of(X1,tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_111,negated_conjecture,
( occurrence_of(esk5_1(esk1_0),tptp3)
| ~ leaf_occ(esk5_1(esk1_0),esk1_0)
| ~ occurrence_of(esk5_1(esk1_0),tptp1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_107]),c_0_28])]) ).
cnf(c_0_112,negated_conjecture,
( ~ leaf_occ(esk5_1(esk1_0),esk1_0)
| ~ occurrence_of(esk5_1(esk1_0),tptp2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_108,c_0_109]),c_0_28])]) ).
cnf(c_0_113,plain,
( X1 = tptp1
| occurrence_of(esk5_1(X2),tptp2)
| ~ occurrence_of(esk5_1(X2),X1)
| ~ occurrence_of(X2,tptp0) ),
inference(spm,[status(thm)],[c_0_24,c_0_110]) ).
cnf(c_0_114,negated_conjecture,
( occurrence_of(esk5_1(esk1_0),tptp3)
| ~ occurrence_of(esk5_1(esk1_0),tptp1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_111,c_0_81]),c_0_28])]) ).
cnf(c_0_115,plain,
tptp3 != tptp1,
inference(split_conjunct,[status(thm)],[sos_60]) ).
cnf(c_0_116,negated_conjecture,
~ occurrence_of(esk5_1(esk1_0),tptp2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_112,c_0_81]),c_0_28])]) ).
cnf(c_0_117,negated_conjecture,
~ occurrence_of(esk5_1(esk1_0),tptp1),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_113,c_0_114]),c_0_28])]),c_0_115]),c_0_116]) ).
cnf(c_0_118,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_117,c_0_110]),c_0_28])]),c_0_116]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : PRO009+3 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.13 % Command : run_ET %s %d
% 0.14/0.34 % Computer : n009.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Mon Jun 13 01:42:25 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.24/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.24/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.24/1.41 # Preprocessing time : 0.020 s
% 0.24/1.41
% 0.24/1.41 # Proof found!
% 0.24/1.41 # SZS status Theorem
% 0.24/1.41 # SZS output start CNFRefutation
% See solution above
% 0.24/1.41 # Proof object total steps : 119
% 0.24/1.41 # Proof object clause steps : 81
% 0.24/1.41 # Proof object formula steps : 38
% 0.24/1.41 # Proof object conjectures : 32
% 0.24/1.41 # Proof object clause conjectures : 29
% 0.24/1.41 # Proof object formula conjectures : 3
% 0.24/1.41 # Proof object initial clauses used : 31
% 0.24/1.41 # Proof object initial formulas used : 19
% 0.24/1.41 # Proof object generating inferences : 50
% 0.24/1.41 # Proof object simplifying inferences : 41
% 0.24/1.41 # Training examples: 0 positive, 0 negative
% 0.24/1.41 # Parsed axioms : 63
% 0.24/1.41 # Removed by relevancy pruning/SinE : 3
% 0.24/1.41 # Initial clauses : 94
% 0.24/1.41 # Removed in clause preprocessing : 0
% 0.24/1.41 # Initial clauses in saturation : 94
% 0.24/1.41 # Processed clauses : 1491
% 0.24/1.41 # ...of these trivial : 3
% 0.24/1.41 # ...subsumed : 852
% 0.24/1.41 # ...remaining for further processing : 636
% 0.24/1.41 # Other redundant clauses eliminated : 0
% 0.24/1.41 # Clauses deleted for lack of memory : 0
% 0.24/1.41 # Backward-subsumed : 83
% 0.24/1.41 # Backward-rewritten : 33
% 0.24/1.41 # Generated clauses : 4168
% 0.24/1.41 # ...of the previous two non-trivial : 3675
% 0.24/1.41 # Contextual simplify-reflections : 695
% 0.24/1.41 # Paramodulations : 4168
% 0.24/1.41 # Factorizations : 0
% 0.24/1.41 # Equation resolutions : 0
% 0.24/1.41 # Current number of processed clauses : 520
% 0.24/1.41 # Positive orientable unit clauses : 29
% 0.24/1.41 # Positive unorientable unit clauses: 0
% 0.24/1.41 # Negative unit clauses : 21
% 0.24/1.41 # Non-unit-clauses : 470
% 0.24/1.41 # Current number of unprocessed clauses: 1513
% 0.24/1.41 # ...number of literals in the above : 7350
% 0.24/1.41 # Current number of archived formulas : 0
% 0.24/1.41 # Current number of archived clauses : 116
% 0.24/1.41 # Clause-clause subsumption calls (NU) : 207374
% 0.24/1.41 # Rec. Clause-clause subsumption calls : 120504
% 0.24/1.41 # Non-unit clause-clause subsumptions : 1423
% 0.24/1.41 # Unit Clause-clause subsumption calls : 2233
% 0.24/1.41 # Rewrite failures with RHS unbound : 0
% 0.24/1.41 # BW rewrite match attempts : 17
% 0.24/1.41 # BW rewrite match successes : 15
% 0.24/1.41 # Condensation attempts : 0
% 0.24/1.41 # Condensation successes : 0
% 0.24/1.41 # Termbank termtop insertions : 61374
% 0.24/1.41
% 0.24/1.41 # -------------------------------------------------
% 0.24/1.41 # User time : 0.183 s
% 0.24/1.41 # System time : 0.002 s
% 0.24/1.41 # Total time : 0.185 s
% 0.24/1.41 # Maximum resident set size: 6008 pages
%------------------------------------------------------------------------------