TSTP Solution File: PRO014+3 by E-SAT---3.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.2.0
% Problem : PRO014+3 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d SAT
% Computer : n019.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 : Mon Jun 24 13:40:16 EDT 2024
% Result : Theorem 0.78s 0.62s
% Output : CNFRefutation 0.78s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 16
% Syntax : Number of formulae : 112 ( 36 unt; 0 def)
% Number of atoms : 385 ( 16 equ)
% Maximal formula atoms : 36 ( 3 avg)
% Number of connectives : 445 ( 172 ~; 174 |; 79 &)
% ( 3 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 15 ( 13 usr; 1 prp; 0-3 aty)
% Number of functors : 14 ( 14 usr; 7 con; 0-3 aty)
% Number of variables : 185 ( 3 sgn 97 !; 15 ?)
% Comments :
%------------------------------------------------------------------------------
fof(sos_49,axiom,
! [X162,X163] :
( ( occurrence_of(X163,tptp0)
& subactivity_occurrence(X162,X163)
& arboreal(X162)
& ~ leaf_occ(X162,X163) )
=> ? [X164,X165,X166] :
( occurrence_of(X164,tptp3)
& next_subocc(X162,X164,tptp0)
& occurrence_of(X165,tptp4)
& next_subocc(X164,X165,tptp0)
& ( occurrence_of(X166,tptp2)
| occurrence_of(X166,tptp1) )
& next_subocc(X165,X166,tptp0)
& leaf(X166,tptp0) ) ),
file('/export/starexec/sandbox/tmp/tmp.qK5Qz0i5kr/E---3.1_22102.p',sos_49) ).
fof(goals,conjecture,
! [X167,X168] :
( ( occurrence_of(X168,tptp0)
& subactivity_occurrence(X167,X168)
& arboreal(X167)
& ~ leaf_occ(X167,X168) )
=> ? [X169,X170] :
( occurrence_of(X169,tptp3)
& next_subocc(X167,X169,tptp0)
& ( occurrence_of(X170,tptp2)
| occurrence_of(X170,tptp1) )
& min_precedes(X169,X170,tptp0)
& leaf(X170,tptp0) ) ),
file('/export/starexec/sandbox/tmp/tmp.qK5Qz0i5kr/E---3.1_22102.p',goals) ).
fof(sos_45,axiom,
! [X146,X147] :
( ( leaf(X146,X147)
& ~ atomic(X147) )
=> ? [X148] :
( occurrence_of(X148,X147)
& leaf_occ(X146,X148) ) ),
file('/export/starexec/sandbox/tmp/tmp.qK5Qz0i5kr/E---3.1_22102.p',sos_45) ).
fof(sos_51,axiom,
~ atomic(tptp0),
file('/export/starexec/sandbox/tmp/tmp.qK5Qz0i5kr/E---3.1_22102.p',sos_51) ).
fof(sos_34,axiom,
! [X103,X104] :
( leaf_occ(X103,X104)
<=> ? [X105] :
( occurrence_of(X104,X105)
& subactivity_occurrence(X103,X104)
& leaf(X103,X105) ) ),
file('/export/starexec/sandbox/tmp/tmp.qK5Qz0i5kr/E---3.1_22102.p',sos_34) ).
fof(sos_29,axiom,
! [X84,X85,X86,X87] :
( ( min_precedes(X84,X85,X86)
& occurrence_of(X87,X86)
& subactivity_occurrence(X85,X87) )
=> subactivity_occurrence(X84,X87) ),
file('/export/starexec/sandbox/tmp/tmp.qK5Qz0i5kr/E---3.1_22102.p',sos_29) ).
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/sandbox/tmp/tmp.qK5Qz0i5kr/E---3.1_22102.p',sos_22) ).
fof(sos_15,axiom,
! [X39,X40,X41] :
( min_precedes(X39,X40,X41)
=> precedes(X39,X40) ),
file('/export/starexec/sandbox/tmp/tmp.qK5Qz0i5kr/E---3.1_22102.p',sos_15) ).
fof(sos_10,axiom,
! [X22,X23] :
( precedes(X22,X23)
<=> ( earlier(X22,X23)
& legal(X23) ) ),
file('/export/starexec/sandbox/tmp/tmp.qK5Qz0i5kr/E---3.1_22102.p',sos_10) ).
fof(sos_05,axiom,
! [X11,X12,X13] :
( ( earlier(X11,X12)
& earlier(X12,X13) )
=> earlier(X11,X13) ),
file('/export/starexec/sandbox/tmp/tmp.qK5Qz0i5kr/E---3.1_22102.p',sos_05) ).
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/sandbox/tmp/tmp.qK5Qz0i5kr/E---3.1_22102.p',sos_43) ).
fof(sos_02,axiom,
! [X5,X6,X7] :
( ( occurrence_of(X5,X6)
& occurrence_of(X5,X7) )
=> X6 = X7 ),
file('/export/starexec/sandbox/tmp/tmp.qK5Qz0i5kr/E---3.1_22102.p',sos_02) ).
fof(sos_01,axiom,
! [X3] :
( activity_occurrence(X3)
=> ? [X4] :
( activity(X4)
& occurrence_of(X3,X4) ) ),
file('/export/starexec/sandbox/tmp/tmp.qK5Qz0i5kr/E---3.1_22102.p',sos_01) ).
fof(sos,axiom,
! [X1,X2] :
( occurrence_of(X2,X1)
=> ( activity(X1)
& activity_occurrence(X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.qK5Qz0i5kr/E---3.1_22102.p',sos) ).
fof(sos_18,axiom,
! [X46,X47,X48,X49] :
( ( min_precedes(X46,X47,X49)
& min_precedes(X46,X48,X49)
& precedes(X47,X48) )
=> min_precedes(X47,X48,X49) ),
file('/export/starexec/sandbox/tmp/tmp.qK5Qz0i5kr/E---3.1_22102.p',sos_18) ).
fof(sos_04,axiom,
! [X9,X10] :
( earlier(X9,X10)
=> ~ earlier(X10,X9) ),
file('/export/starexec/sandbox/tmp/tmp.qK5Qz0i5kr/E---3.1_22102.p',sos_04) ).
fof(c_0_16,plain,
! [X162,X163] :
( ( occurrence_of(X163,tptp0)
& subactivity_occurrence(X162,X163)
& arboreal(X162)
& ~ leaf_occ(X162,X163) )
=> ? [X164,X165,X166] :
( occurrence_of(X164,tptp3)
& next_subocc(X162,X164,tptp0)
& occurrence_of(X165,tptp4)
& next_subocc(X164,X165,tptp0)
& ( occurrence_of(X166,tptp2)
| occurrence_of(X166,tptp1) )
& next_subocc(X165,X166,tptp0)
& leaf(X166,tptp0) ) ),
inference(fof_simplification,[status(thm)],[sos_49]) ).
fof(c_0_17,negated_conjecture,
~ ! [X167,X168] :
( ( occurrence_of(X168,tptp0)
& subactivity_occurrence(X167,X168)
& arboreal(X167)
& ~ leaf_occ(X167,X168) )
=> ? [X169,X170] :
( occurrence_of(X169,tptp3)
& next_subocc(X167,X169,tptp0)
& ( occurrence_of(X170,tptp2)
| occurrence_of(X170,tptp1) )
& min_precedes(X169,X170,tptp0)
& leaf(X170,tptp0) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[goals])]) ).
fof(c_0_18,plain,
! [X146,X147] :
( ( leaf(X146,X147)
& ~ atomic(X147) )
=> ? [X148] :
( occurrence_of(X148,X147)
& leaf_occ(X146,X148) ) ),
inference(fof_simplification,[status(thm)],[sos_45]) ).
fof(c_0_19,plain,
! [X349,X350] :
( ( occurrence_of(esk17_1(X349),tptp3)
| ~ occurrence_of(X350,tptp0)
| ~ subactivity_occurrence(X349,X350)
| ~ arboreal(X349)
| leaf_occ(X349,X350) )
& ( next_subocc(X349,esk17_1(X349),tptp0)
| ~ occurrence_of(X350,tptp0)
| ~ subactivity_occurrence(X349,X350)
| ~ arboreal(X349)
| leaf_occ(X349,X350) )
& ( occurrence_of(esk18_1(X349),tptp4)
| ~ occurrence_of(X350,tptp0)
| ~ subactivity_occurrence(X349,X350)
| ~ arboreal(X349)
| leaf_occ(X349,X350) )
& ( next_subocc(esk17_1(X349),esk18_1(X349),tptp0)
| ~ occurrence_of(X350,tptp0)
| ~ subactivity_occurrence(X349,X350)
| ~ arboreal(X349)
| leaf_occ(X349,X350) )
& ( occurrence_of(esk19_1(X349),tptp2)
| occurrence_of(esk19_1(X349),tptp1)
| ~ occurrence_of(X350,tptp0)
| ~ subactivity_occurrence(X349,X350)
| ~ arboreal(X349)
| leaf_occ(X349,X350) )
& ( next_subocc(esk18_1(X349),esk19_1(X349),tptp0)
| ~ occurrence_of(X350,tptp0)
| ~ subactivity_occurrence(X349,X350)
| ~ arboreal(X349)
| leaf_occ(X349,X350) )
& ( leaf(esk19_1(X349),tptp0)
| ~ occurrence_of(X350,tptp0)
| ~ subactivity_occurrence(X349,X350)
| ~ arboreal(X349)
| leaf_occ(X349,X350) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_16])])])])])])]) ).
fof(c_0_20,negated_conjecture,
! [X356,X357] :
( occurrence_of(esk21_0,tptp0)
& subactivity_occurrence(esk20_0,esk21_0)
& arboreal(esk20_0)
& ~ leaf_occ(esk20_0,esk21_0)
& ( ~ occurrence_of(X357,tptp2)
| ~ occurrence_of(X356,tptp3)
| ~ next_subocc(esk20_0,X356,tptp0)
| ~ min_precedes(X356,X357,tptp0)
| ~ leaf(X357,tptp0) )
& ( ~ occurrence_of(X357,tptp1)
| ~ occurrence_of(X356,tptp3)
| ~ next_subocc(esk20_0,X356,tptp0)
| ~ min_precedes(X356,X357,tptp0)
| ~ leaf(X357,tptp0) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_17])])])])])]) ).
fof(c_0_21,plain,
~ atomic(tptp0),
inference(fof_simplification,[status(thm)],[sos_51]) ).
fof(c_0_22,plain,
! [X333,X334] :
( ( occurrence_of(esk16_2(X333,X334),X334)
| ~ leaf(X333,X334)
| atomic(X334) )
& ( leaf_occ(X333,esk16_2(X333,X334))
| ~ leaf(X333,X334)
| atomic(X334) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_18])])])])]) ).
cnf(c_0_23,plain,
( leaf(esk19_1(X1),tptp0)
| leaf_occ(X1,X2)
| ~ occurrence_of(X2,tptp0)
| ~ subactivity_occurrence(X1,X2)
| ~ arboreal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_24,negated_conjecture,
subactivity_occurrence(esk20_0,esk21_0),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_25,negated_conjecture,
arboreal(esk20_0),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_26,negated_conjecture,
occurrence_of(esk21_0,tptp0),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_27,negated_conjecture,
~ leaf_occ(esk20_0,esk21_0),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
fof(c_0_28,plain,
~ atomic(tptp0),
inference(fof_nnf,[status(thm)],[c_0_21]) ).
fof(c_0_29,plain,
! [X287,X288,X290,X291,X292] :
( ( occurrence_of(X288,esk15_2(X287,X288))
| ~ leaf_occ(X287,X288) )
& ( subactivity_occurrence(X287,X288)
| ~ leaf_occ(X287,X288) )
& ( leaf(X287,esk15_2(X287,X288))
| ~ leaf_occ(X287,X288) )
& ( ~ occurrence_of(X291,X292)
| ~ subactivity_occurrence(X290,X291)
| ~ leaf(X290,X292)
| leaf_occ(X290,X291) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_34])])])])])])]) ).
cnf(c_0_30,plain,
( leaf_occ(X1,esk16_2(X1,X2))
| atomic(X2)
| ~ leaf(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_31,negated_conjecture,
leaf(esk19_1(esk20_0),tptp0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]),c_0_26])]),c_0_27]) ).
cnf(c_0_32,plain,
~ atomic(tptp0),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
fof(c_0_33,plain,
! [X265,X266,X267,X268] :
( ~ min_precedes(X265,X266,X267)
| ~ occurrence_of(X268,X267)
| ~ subactivity_occurrence(X266,X268)
| subactivity_occurrence(X265,X268) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_29])])]) ).
cnf(c_0_34,plain,
( subactivity_occurrence(X1,X2)
| ~ leaf_occ(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_35,negated_conjecture,
leaf_occ(esk19_1(esk20_0),esk16_2(esk19_1(esk20_0),tptp0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]) ).
fof(c_0_36,plain,
! [X235,X236,X237,X238,X239,X240,X241] :
( ( min_precedes(X235,X236,X237)
| ~ next_subocc(X235,X236,X237) )
& ( ~ min_precedes(X235,X238,X237)
| ~ min_precedes(X238,X236,X237)
| ~ next_subocc(X235,X236,X237) )
& ( min_precedes(X239,esk8_3(X239,X240,X241),X241)
| ~ min_precedes(X239,X240,X241)
| next_subocc(X239,X240,X241) )
& ( min_precedes(esk8_3(X239,X240,X241),X240,X241)
| ~ min_precedes(X239,X240,X241)
| next_subocc(X239,X240,X241) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_22])])])])])])]) ).
cnf(c_0_37,plain,
( next_subocc(esk18_1(X1),esk19_1(X1),tptp0)
| leaf_occ(X1,X2)
| ~ occurrence_of(X2,tptp0)
| ~ subactivity_occurrence(X1,X2)
| ~ arboreal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_38,plain,
( subactivity_occurrence(X1,X4)
| ~ min_precedes(X1,X2,X3)
| ~ occurrence_of(X4,X3)
| ~ subactivity_occurrence(X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_39,negated_conjecture,
subactivity_occurrence(esk19_1(esk20_0),esk16_2(esk19_1(esk20_0),tptp0)),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_40,plain,
( min_precedes(X1,X2,X3)
| ~ next_subocc(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_41,negated_conjecture,
next_subocc(esk18_1(esk20_0),esk19_1(esk20_0),tptp0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_24]),c_0_25]),c_0_26])]),c_0_27]) ).
cnf(c_0_42,plain,
( occurrence_of(esk16_2(X1,X2),X2)
| atomic(X2)
| ~ leaf(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
fof(c_0_43,plain,
! [X209,X210,X211] :
( ~ min_precedes(X209,X210,X211)
| precedes(X209,X210) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_15])])]) ).
cnf(c_0_44,plain,
( next_subocc(esk17_1(X1),esk18_1(X1),tptp0)
| leaf_occ(X1,X2)
| ~ occurrence_of(X2,tptp0)
| ~ subactivity_occurrence(X1,X2)
| ~ arboreal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_45,negated_conjecture,
( subactivity_occurrence(X1,esk16_2(esk19_1(esk20_0),tptp0))
| ~ min_precedes(X1,esk19_1(esk20_0),X2)
| ~ occurrence_of(esk16_2(esk19_1(esk20_0),tptp0),X2) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_46,negated_conjecture,
min_precedes(esk18_1(esk20_0),esk19_1(esk20_0),tptp0),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_47,negated_conjecture,
occurrence_of(esk16_2(esk19_1(esk20_0),tptp0),tptp0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_31]),c_0_32]) ).
fof(c_0_48,plain,
! [X192,X193] :
( ( earlier(X192,X193)
| ~ precedes(X192,X193) )
& ( legal(X193)
| ~ precedes(X192,X193) )
& ( ~ earlier(X192,X193)
| ~ legal(X193)
| precedes(X192,X193) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_10])])])]) ).
cnf(c_0_49,plain,
( precedes(X1,X2)
| ~ min_precedes(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_50,negated_conjecture,
next_subocc(esk17_1(esk20_0),esk18_1(esk20_0),tptp0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_24]),c_0_25]),c_0_26])]),c_0_27]) ).
cnf(c_0_51,negated_conjecture,
subactivity_occurrence(esk18_1(esk20_0),esk16_2(esk19_1(esk20_0),tptp0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47])]) ).
fof(c_0_52,plain,
! [X181,X182,X183] :
( ~ earlier(X181,X182)
| ~ earlier(X182,X183)
| earlier(X181,X183) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_05])])]) ).
cnf(c_0_53,plain,
( earlier(X1,X2)
| ~ precedes(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_54,negated_conjecture,
precedes(esk18_1(esk20_0),esk19_1(esk20_0)),
inference(spm,[status(thm)],[c_0_49,c_0_46]) ).
cnf(c_0_55,negated_conjecture,
min_precedes(esk17_1(esk20_0),esk18_1(esk20_0),tptp0),
inference(spm,[status(thm)],[c_0_40,c_0_50]) ).
fof(c_0_56,plain,
! [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 ),
inference(fof_simplification,[status(thm)],[sos_43]) ).
cnf(c_0_57,negated_conjecture,
( subactivity_occurrence(X1,esk16_2(esk19_1(esk20_0),tptp0))
| ~ min_precedes(X1,esk18_1(esk20_0),X2)
| ~ occurrence_of(esk16_2(esk19_1(esk20_0),tptp0),X2) ),
inference(spm,[status(thm)],[c_0_38,c_0_51]) ).
cnf(c_0_58,plain,
( next_subocc(X1,esk17_1(X1),tptp0)
| leaf_occ(X1,X2)
| ~ occurrence_of(X2,tptp0)
| ~ subactivity_occurrence(X1,X2)
| ~ arboreal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_59,plain,
( earlier(X1,X3)
| ~ earlier(X1,X2)
| ~ earlier(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_60,negated_conjecture,
earlier(esk18_1(esk20_0),esk19_1(esk20_0)),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_61,negated_conjecture,
precedes(esk17_1(esk20_0),esk18_1(esk20_0)),
inference(spm,[status(thm)],[c_0_49,c_0_55]) ).
fof(c_0_62,plain,
! [X326,X327,X328,X329] :
( ~ occurrence_of(X327,X326)
| ~ subactivity_occurrence(X328,X327)
| ~ leaf_occ(X329,X327)
| ~ arboreal(X328)
| min_precedes(X328,X329,X326)
| X329 = X328 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_56])])]) ).
cnf(c_0_63,negated_conjecture,
subactivity_occurrence(esk17_1(esk20_0),esk16_2(esk19_1(esk20_0),tptp0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_55]),c_0_47])]) ).
cnf(c_0_64,negated_conjecture,
next_subocc(esk20_0,esk17_1(esk20_0),tptp0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_24]),c_0_25]),c_0_26])]),c_0_27]) ).
fof(c_0_65,plain,
! [X175,X176,X177] :
( ~ occurrence_of(X175,X176)
| ~ occurrence_of(X175,X177)
| X176 = X177 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_02])])]) ).
fof(c_0_66,plain,
! [X173] :
( ( activity(esk1_1(X173))
| ~ activity_occurrence(X173) )
& ( occurrence_of(X173,esk1_1(X173))
| ~ activity_occurrence(X173) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_01])])])])]) ).
fof(c_0_67,plain,
! [X171,X172] :
( ( activity(X171)
| ~ occurrence_of(X172,X171) )
& ( activity_occurrence(X172)
| ~ occurrence_of(X172,X171) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos])])])]) ).
cnf(c_0_68,negated_conjecture,
( earlier(X1,esk19_1(esk20_0))
| ~ earlier(X1,esk18_1(esk20_0)) ),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_69,negated_conjecture,
earlier(esk17_1(esk20_0),esk18_1(esk20_0)),
inference(spm,[status(thm)],[c_0_53,c_0_61]) ).
cnf(c_0_70,plain,
( legal(X1)
| ~ precedes(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_71,plain,
( min_precedes(X3,X4,X2)
| X4 = X3
| ~ occurrence_of(X1,X2)
| ~ subactivity_occurrence(X3,X1)
| ~ leaf_occ(X4,X1)
| ~ arboreal(X3) ),
inference(split_conjunct,[status(thm)],[c_0_62]) ).
cnf(c_0_72,negated_conjecture,
( subactivity_occurrence(X1,esk16_2(esk19_1(esk20_0),tptp0))
| ~ min_precedes(X1,esk17_1(esk20_0),X2)
| ~ occurrence_of(esk16_2(esk19_1(esk20_0),tptp0),X2) ),
inference(spm,[status(thm)],[c_0_38,c_0_63]) ).
cnf(c_0_73,negated_conjecture,
min_precedes(esk20_0,esk17_1(esk20_0),tptp0),
inference(spm,[status(thm)],[c_0_40,c_0_64]) ).
cnf(c_0_74,plain,
( X2 = X3
| ~ occurrence_of(X1,X2)
| ~ occurrence_of(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_65]) ).
cnf(c_0_75,plain,
( occurrence_of(X1,esk1_1(X1))
| ~ activity_occurrence(X1) ),
inference(split_conjunct,[status(thm)],[c_0_66]) ).
cnf(c_0_76,plain,
( activity_occurrence(X1)
| ~ occurrence_of(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_67]) ).
fof(c_0_77,plain,
! [X216,X217,X218,X219] :
( ~ min_precedes(X216,X217,X219)
| ~ min_precedes(X216,X218,X219)
| ~ precedes(X217,X218)
| min_precedes(X217,X218,X219) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_18])])]) ).
cnf(c_0_78,plain,
( precedes(X1,X2)
| ~ earlier(X1,X2)
| ~ legal(X2) ),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_79,negated_conjecture,
earlier(esk17_1(esk20_0),esk19_1(esk20_0)),
inference(spm,[status(thm)],[c_0_68,c_0_69]) ).
cnf(c_0_80,negated_conjecture,
legal(esk19_1(esk20_0)),
inference(spm,[status(thm)],[c_0_70,c_0_54]) ).
cnf(c_0_81,negated_conjecture,
( X1 = esk19_1(esk20_0)
| min_precedes(X1,esk19_1(esk20_0),X2)
| ~ subactivity_occurrence(X1,esk16_2(esk19_1(esk20_0),tptp0))
| ~ arboreal(X1)
| ~ occurrence_of(esk16_2(esk19_1(esk20_0),tptp0),X2) ),
inference(spm,[status(thm)],[c_0_71,c_0_35]) ).
cnf(c_0_82,negated_conjecture,
subactivity_occurrence(esk20_0,esk16_2(esk19_1(esk20_0),tptp0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_73]),c_0_47])]) ).
cnf(c_0_83,plain,
( X1 = esk1_1(X2)
| ~ occurrence_of(X2,X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_75]),c_0_76]) ).
cnf(c_0_84,negated_conjecture,
( ~ occurrence_of(X1,tptp1)
| ~ occurrence_of(X2,tptp3)
| ~ next_subocc(esk20_0,X2,tptp0)
| ~ min_precedes(X2,X1,tptp0)
| ~ leaf(X1,tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_85,plain,
( occurrence_of(esk17_1(X1),tptp3)
| leaf_occ(X1,X2)
| ~ occurrence_of(X2,tptp0)
| ~ subactivity_occurrence(X1,X2)
| ~ arboreal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_86,plain,
( min_precedes(X2,X4,X3)
| ~ min_precedes(X1,X2,X3)
| ~ min_precedes(X1,X4,X3)
| ~ precedes(X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_77]) ).
cnf(c_0_87,negated_conjecture,
precedes(esk17_1(esk20_0),esk19_1(esk20_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_79]),c_0_80])]) ).
cnf(c_0_88,negated_conjecture,
( esk19_1(esk20_0) = esk20_0
| min_precedes(esk20_0,esk19_1(esk20_0),X1)
| ~ occurrence_of(esk16_2(esk19_1(esk20_0),tptp0),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_82]),c_0_25])]) ).
cnf(c_0_89,negated_conjecture,
esk1_1(esk16_2(esk19_1(esk20_0),tptp0)) = tptp0,
inference(spm,[status(thm)],[c_0_83,c_0_47]) ).
cnf(c_0_90,negated_conjecture,
activity_occurrence(esk16_2(esk19_1(esk20_0),tptp0)),
inference(spm,[status(thm)],[c_0_76,c_0_47]) ).
cnf(c_0_91,negated_conjecture,
( ~ occurrence_of(X1,tptp2)
| ~ occurrence_of(X2,tptp3)
| ~ next_subocc(esk20_0,X2,tptp0)
| ~ min_precedes(X2,X1,tptp0)
| ~ leaf(X1,tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_92,negated_conjecture,
( ~ next_subocc(esk20_0,X1,tptp0)
| ~ min_precedes(X1,esk19_1(esk20_0),tptp0)
| ~ occurrence_of(esk19_1(esk20_0),tptp1)
| ~ occurrence_of(X1,tptp3) ),
inference(spm,[status(thm)],[c_0_84,c_0_31]) ).
cnf(c_0_93,negated_conjecture,
occurrence_of(esk17_1(esk20_0),tptp3),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_85,c_0_24]),c_0_25]),c_0_26])]),c_0_27]) ).
cnf(c_0_94,negated_conjecture,
( min_precedes(esk17_1(esk20_0),esk19_1(esk20_0),X1)
| ~ min_precedes(X2,esk19_1(esk20_0),X1)
| ~ min_precedes(X2,esk17_1(esk20_0),X1) ),
inference(spm,[status(thm)],[c_0_86,c_0_87]) ).
cnf(c_0_95,negated_conjecture,
( esk19_1(esk20_0) = esk20_0
| min_precedes(esk20_0,esk19_1(esk20_0),tptp0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_75]),c_0_89]),c_0_90])]) ).
cnf(c_0_96,negated_conjecture,
( ~ next_subocc(esk20_0,X1,tptp0)
| ~ min_precedes(X1,esk19_1(esk20_0),tptp0)
| ~ occurrence_of(esk19_1(esk20_0),tptp2)
| ~ occurrence_of(X1,tptp3) ),
inference(spm,[status(thm)],[c_0_91,c_0_31]) ).
fof(c_0_97,plain,
! [X9,X10] :
( earlier(X9,X10)
=> ~ earlier(X10,X9) ),
inference(fof_simplification,[status(thm)],[sos_04]) ).
cnf(c_0_98,negated_conjecture,
( ~ min_precedes(esk17_1(esk20_0),esk19_1(esk20_0),tptp0)
| ~ occurrence_of(esk19_1(esk20_0),tptp1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_92,c_0_64]),c_0_93])]) ).
cnf(c_0_99,negated_conjecture,
( esk19_1(esk20_0) = esk20_0
| min_precedes(esk17_1(esk20_0),esk19_1(esk20_0),tptp0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_94,c_0_95]),c_0_73])]) ).
cnf(c_0_100,plain,
( occurrence_of(esk19_1(X1),tptp2)
| occurrence_of(esk19_1(X1),tptp1)
| leaf_occ(X1,X2)
| ~ occurrence_of(X2,tptp0)
| ~ subactivity_occurrence(X1,X2)
| ~ arboreal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_101,negated_conjecture,
( ~ min_precedes(esk17_1(esk20_0),esk19_1(esk20_0),tptp0)
| ~ occurrence_of(esk19_1(esk20_0),tptp2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_96,c_0_64]),c_0_93])]) ).
fof(c_0_102,plain,
! [X179,X180] :
( ~ earlier(X179,X180)
| ~ earlier(X180,X179) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_97])])]) ).
cnf(c_0_103,negated_conjecture,
precedes(esk20_0,esk17_1(esk20_0)),
inference(spm,[status(thm)],[c_0_49,c_0_73]) ).
cnf(c_0_104,negated_conjecture,
( esk19_1(esk20_0) = esk20_0
| ~ occurrence_of(esk19_1(esk20_0),tptp1) ),
inference(spm,[status(thm)],[c_0_98,c_0_99]) ).
cnf(c_0_105,negated_conjecture,
( occurrence_of(esk19_1(esk20_0),tptp1)
| occurrence_of(esk19_1(esk20_0),tptp2) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_100,c_0_24]),c_0_25]),c_0_26])]),c_0_27]) ).
cnf(c_0_106,negated_conjecture,
( esk19_1(esk20_0) = esk20_0
| ~ occurrence_of(esk19_1(esk20_0),tptp2) ),
inference(spm,[status(thm)],[c_0_101,c_0_99]) ).
cnf(c_0_107,plain,
( ~ earlier(X1,X2)
| ~ earlier(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_102]) ).
cnf(c_0_108,negated_conjecture,
earlier(esk20_0,esk17_1(esk20_0)),
inference(spm,[status(thm)],[c_0_53,c_0_103]) ).
cnf(c_0_109,negated_conjecture,
esk19_1(esk20_0) = esk20_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_104,c_0_105]),c_0_106]) ).
cnf(c_0_110,negated_conjecture,
~ earlier(esk17_1(esk20_0),esk20_0),
inference(spm,[status(thm)],[c_0_107,c_0_108]) ).
cnf(c_0_111,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_79,c_0_109]),c_0_110]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : PRO014+3 : TPTP v8.2.0. Released v4.0.0.
% 0.06/0.12 % Command : run_E %s %d SAT
% 0.12/0.33 % Computer : n019.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Thu Jun 20 06:27:53 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.19/0.48 Running first-order model finding
% 0.19/0.48 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.qK5Qz0i5kr/E---3.1_22102.p
% 0.78/0.62 # Version: 3.2.0
% 0.78/0.62 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.78/0.62 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.78/0.62 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.78/0.62 # Starting new_bool_3 with 300s (1) cores
% 0.78/0.62 # Starting new_bool_1 with 300s (1) cores
% 0.78/0.62 # Starting sh5l with 300s (1) cores
% 0.78/0.62 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 22179 completed with status 0
% 0.78/0.62 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.78/0.62 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.78/0.62 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.78/0.62 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.78/0.62 # No SInE strategy applied
% 0.78/0.62 # Search class: FGHSF-FFMM32-SFFFFFNN
% 0.78/0.62 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.78/0.62 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SA with 811s (1) cores
% 0.78/0.62 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.78/0.62 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2g with 136s (1) cores
% 0.78/0.62 # Starting G-E--_107_C48_F1_PI_AE_Q4_CS_SP_PS_S0Y with 136s (1) cores
% 0.78/0.62 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 0.78/0.62 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with pid 22189 completed with status 0
% 0.78/0.62 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 0.78/0.62 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.78/0.62 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.78/0.62 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.78/0.62 # No SInE strategy applied
% 0.78/0.62 # Search class: FGHSF-FFMM32-SFFFFFNN
% 0.78/0.62 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.78/0.62 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SA with 811s (1) cores
% 0.78/0.62 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.78/0.62 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2g with 136s (1) cores
% 0.78/0.62 # Starting G-E--_107_C48_F1_PI_AE_Q4_CS_SP_PS_S0Y with 136s (1) cores
% 0.78/0.62 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 0.78/0.62 # Preprocessing time : 0.004 s
% 0.78/0.62 # Presaturation interreduction done
% 0.78/0.62
% 0.78/0.62 # Proof found!
% 0.78/0.62 # SZS status Theorem
% 0.78/0.62 # SZS output start CNFRefutation
% See solution above
% 0.78/0.62 # Parsed axioms : 63
% 0.78/0.62 # Removed by relevancy pruning/SinE : 0
% 0.78/0.62 # Initial clauses : 107
% 0.78/0.62 # Removed in clause preprocessing : 0
% 0.78/0.62 # Initial clauses in saturation : 107
% 0.78/0.62 # Processed clauses : 1387
% 0.78/0.62 # ...of these trivial : 37
% 0.78/0.62 # ...subsumed : 386
% 0.78/0.62 # ...remaining for further processing : 964
% 0.78/0.62 # Other redundant clauses eliminated : 0
% 0.78/0.62 # Clauses deleted for lack of memory : 0
% 0.78/0.62 # Backward-subsumed : 15
% 0.78/0.62 # Backward-rewritten : 229
% 0.78/0.62 # Generated clauses : 3176
% 0.78/0.62 # ...of the previous two non-redundant : 2674
% 0.78/0.62 # ...aggressively subsumed : 0
% 0.78/0.62 # Contextual simplify-reflections : 13
% 0.78/0.62 # Paramodulations : 3176
% 0.78/0.62 # Factorizations : 0
% 0.78/0.62 # NegExts : 0
% 0.78/0.62 # Equation resolutions : 0
% 0.78/0.62 # Disequality decompositions : 0
% 0.78/0.62 # Total rewrite steps : 1804
% 0.78/0.62 # ...of those cached : 1647
% 0.78/0.62 # Propositional unsat checks : 0
% 0.78/0.62 # Propositional check models : 0
% 0.78/0.62 # Propositional check unsatisfiable : 0
% 0.78/0.62 # Propositional clauses : 0
% 0.78/0.62 # Propositional clauses after purity: 0
% 0.78/0.62 # Propositional unsat core size : 0
% 0.78/0.62 # Propositional preprocessing time : 0.000
% 0.78/0.62 # Propositional encoding time : 0.000
% 0.78/0.62 # Propositional solver time : 0.000
% 0.78/0.62 # Success case prop preproc time : 0.000
% 0.78/0.62 # Success case prop encoding time : 0.000
% 0.78/0.62 # Success case prop solver time : 0.000
% 0.78/0.62 # Current number of processed clauses : 613
% 0.78/0.62 # Positive orientable unit clauses : 208
% 0.78/0.62 # Positive unorientable unit clauses: 0
% 0.78/0.62 # Negative unit clauses : 71
% 0.78/0.62 # Non-unit-clauses : 334
% 0.78/0.62 # Current number of unprocessed clauses: 1367
% 0.78/0.62 # ...number of literals in the above : 3720
% 0.78/0.62 # Current number of archived formulas : 0
% 0.78/0.62 # Current number of archived clauses : 351
% 0.78/0.62 # Clause-clause subsumption calls (NU) : 43598
% 0.78/0.62 # Rec. Clause-clause subsumption calls : 26757
% 0.78/0.62 # Non-unit clause-clause subsumptions : 272
% 0.78/0.62 # Unit Clause-clause subsumption calls : 8703
% 0.78/0.62 # Rewrite failures with RHS unbound : 0
% 0.78/0.62 # BW rewrite match attempts : 61
% 0.78/0.62 # BW rewrite match successes : 25
% 0.78/0.62 # Condensation attempts : 0
% 0.78/0.62 # Condensation successes : 0
% 0.78/0.62 # Termbank termtop insertions : 63236
% 0.78/0.62 # Search garbage collected termcells : 1946
% 0.78/0.62
% 0.78/0.62 # -------------------------------------------------
% 0.78/0.62 # User time : 0.116 s
% 0.78/0.62 # System time : 0.009 s
% 0.78/0.62 # Total time : 0.125 s
% 0.78/0.62 # Maximum resident set size: 2232 pages
% 0.78/0.62
% 0.78/0.62 # -------------------------------------------------
% 0.78/0.62 # User time : 0.545 s
% 0.78/0.62 # System time : 0.036 s
% 0.78/0.62 # Total time : 0.581 s
% 0.78/0.62 # Maximum resident set size: 1868 pages
% 0.78/0.62 % E---3.1 exiting
% 0.78/0.62 % E exiting
%------------------------------------------------------------------------------