TSTP Solution File: PRO014+4 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : PRO014+4 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n012.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:43:44 EDT 2022
% Result : Theorem 9.86s 2.68s
% Output : CNFRefutation 9.86s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 31
% Syntax : Number of clauses : 104 ( 37 unt; 27 nHn; 104 RR)
% Number of literals : 275 ( 9 equ; 154 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 14 ( 12 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 6 con; 0-2 aty)
% Number of variables : 137 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_62,plain,
( leaf_occ(X1,X2)
| next_subocc(esk14_1(X1),esk15_1(X1),tptp0)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1_sp297c/lgb.p',i_0_62) ).
cnf(i_0_85,negated_conjecture,
occurrence_of(esk17_0,tptp0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1_sp297c/lgb.p',i_0_85) ).
cnf(i_0_84,negated_conjecture,
subactivity_occurrence(esk16_0,esk17_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1_sp297c/lgb.p',i_0_84) ).
cnf(i_0_83,negated_conjecture,
arboreal(esk16_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1_sp297c/lgb.p',i_0_83) ).
cnf(i_0_82,negated_conjecture,
~ leaf_occ(esk16_0,esk17_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1_sp297c/lgb.p',i_0_82) ).
cnf(i_0_64,plain,
( leaf_occ(X1,X2)
| next_subocc(esk13_1(X1),esk14_1(X1),tptp0)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1_sp297c/lgb.p',i_0_64) ).
cnf(i_0_55,plain,
( min_precedes(X1,X2,X3)
| ~ next_subocc(X1,X2,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1_sp297c/lgb.p',i_0_55) ).
cnf(i_0_61,plain,
( leaf_occ(X1,X2)
| leaf(esk15_1(X1),tptp0)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1_sp297c/lgb.p',i_0_61) ).
cnf(i_0_49,plain,
( precedes(X1,X2)
| ~ min_precedes(X1,X2,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1_sp297c/lgb.p',i_0_49) ).
cnf(i_0_45,plain,
( earlier(X1,X2)
| ~ precedes(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1_sp297c/lgb.p',i_0_45) ).
cnf(i_0_63,plain,
( leaf_occ(X1,X2)
| occurrence_of(esk15_1(X1),tptp2)
| occurrence_of(esk15_1(X1),tptp1)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1_sp297c/lgb.p',i_0_63) ).
cnf(i_0_13,plain,
( atomic(X1)
| leaf_occ(X2,esk4_2(X2,X1))
| ~ leaf(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1_sp297c/lgb.p',i_0_13) ).
cnf(i_0_69,plain,
~ atomic(tptp0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1_sp297c/lgb.p',i_0_69) ).
cnf(i_0_59,plain,
( earlier(X1,X2)
| ~ earlier(X3,X2)
| ~ earlier(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1_sp297c/lgb.p',i_0_59) ).
cnf(i_0_80,negated_conjecture,
( ~ occurrence_of(X1,tptp3)
| ~ occurrence_of(X2,tptp1)
| ~ leaf(X2,tptp0)
| ~ min_precedes(X1,X2,tptp0)
| ~ next_subocc(esk16_0,X1,tptp0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1_sp297c/lgb.p',i_0_80) ).
cnf(i_0_81,negated_conjecture,
( ~ occurrence_of(X1,tptp3)
| ~ occurrence_of(X2,tptp2)
| ~ leaf(X2,tptp0)
| ~ min_precedes(X1,X2,tptp0)
| ~ next_subocc(esk16_0,X1,tptp0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1_sp297c/lgb.p',i_0_81) ).
cnf(i_0_67,plain,
( leaf_occ(X1,X2)
| occurrence_of(esk13_1(X1),tptp3)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1_sp297c/lgb.p',i_0_67) ).
cnf(i_0_66,plain,
( leaf_occ(X1,X2)
| next_subocc(X1,esk13_1(X1),tptp0)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1_sp297c/lgb.p',i_0_66) ).
cnf(i_0_15,plain,
( X1 = X2
| ~ occurrence_of(X3,X2)
| ~ occurrence_of(X3,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1_sp297c/lgb.p',i_0_15) ).
cnf(i_0_20,plain,
( occurrence_of(X1,esk5_1(X1))
| ~ activity_occurrence(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1_sp297c/lgb.p',i_0_20) ).
cnf(i_0_5,plain,
( activity_occurrence(X1)
| ~ occurrence_of(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1_sp297c/lgb.p',i_0_5) ).
cnf(i_0_14,plain,
( atomic(X1)
| occurrence_of(esk4_2(X2,X1),X1)
| ~ leaf(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1_sp297c/lgb.p',i_0_14) ).
cnf(i_0_56,plain,
( subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,X3)
| ~ subactivity_occurrence(X4,X2)
| ~ min_precedes(X1,X4,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1_sp297c/lgb.p',i_0_56) ).
cnf(i_0_36,plain,
( subactivity_occurrence(X1,X2)
| ~ leaf_occ(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1_sp297c/lgb.p',i_0_36) ).
cnf(i_0_44,plain,
( legal(X1)
| ~ precedes(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1_sp297c/lgb.p',i_0_44) ).
cnf(i_0_4,plain,
( X1 = X2
| min_precedes(X1,X2,X3)
| ~ arboreal(X1)
| ~ occurrence_of(X4,X3)
| ~ subactivity_occurrence(X1,X4)
| ~ leaf_occ(X2,X4) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1_sp297c/lgb.p',i_0_4) ).
cnf(i_0_18,plain,
( activity_occurrence(X1)
| ~ subactivity_occurrence(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1_sp297c/lgb.p',i_0_18) ).
cnf(i_0_60,plain,
( min_precedes(X1,X2,X3)
| ~ precedes(X1,X2)
| ~ min_precedes(X4,X2,X3)
| ~ min_precedes(X4,X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1_sp297c/lgb.p',i_0_60) ).
cnf(i_0_43,plain,
( precedes(X1,X2)
| ~ legal(X2)
| ~ earlier(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1_sp297c/lgb.p',i_0_43) ).
cnf(i_0_31,plain,
( arboreal(X1)
| ~ atomic(X2)
| ~ occurrence_of(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1_sp297c/lgb.p',i_0_31) ).
cnf(i_0_73,plain,
atomic(tptp3),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1_sp297c/lgb.p',i_0_73) ).
cnf(c_0_117,plain,
( leaf_occ(X1,X2)
| next_subocc(esk14_1(X1),esk15_1(X1),tptp0)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0) ),
i_0_62 ).
cnf(c_0_118,negated_conjecture,
occurrence_of(esk17_0,tptp0),
i_0_85 ).
cnf(c_0_119,negated_conjecture,
( next_subocc(esk14_1(X1),esk15_1(X1),tptp0)
| leaf_occ(X1,esk17_0)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,esk17_0) ),
inference(spm,[status(thm)],[c_0_117,c_0_118]) ).
cnf(c_0_120,negated_conjecture,
subactivity_occurrence(esk16_0,esk17_0),
i_0_84 ).
cnf(c_0_121,negated_conjecture,
arboreal(esk16_0),
i_0_83 ).
cnf(c_0_122,negated_conjecture,
~ leaf_occ(esk16_0,esk17_0),
i_0_82 ).
cnf(c_0_123,plain,
( leaf_occ(X1,X2)
| next_subocc(esk13_1(X1),esk14_1(X1),tptp0)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0) ),
i_0_64 ).
cnf(c_0_124,plain,
( min_precedes(X1,X2,X3)
| ~ next_subocc(X1,X2,X3) ),
i_0_55 ).
cnf(c_0_125,negated_conjecture,
next_subocc(esk14_1(esk16_0),esk15_1(esk16_0),tptp0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_119,c_0_120]),c_0_121])]),c_0_122]) ).
cnf(c_0_126,negated_conjecture,
( next_subocc(esk13_1(X1),esk14_1(X1),tptp0)
| leaf_occ(X1,esk17_0)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,esk17_0) ),
inference(spm,[status(thm)],[c_0_123,c_0_118]) ).
cnf(c_0_127,plain,
( leaf_occ(X1,X2)
| leaf(esk15_1(X1),tptp0)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0) ),
i_0_61 ).
cnf(c_0_128,plain,
( precedes(X1,X2)
| ~ min_precedes(X1,X2,X3) ),
i_0_49 ).
cnf(c_0_129,plain,
min_precedes(esk14_1(esk16_0),esk15_1(esk16_0),tptp0),
inference(spm,[status(thm)],[c_0_124,c_0_125]) ).
cnf(c_0_130,negated_conjecture,
next_subocc(esk13_1(esk16_0),esk14_1(esk16_0),tptp0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_126,c_0_120]),c_0_121])]),c_0_122]) ).
cnf(c_0_131,negated_conjecture,
( leaf(esk15_1(X1),tptp0)
| leaf_occ(X1,esk17_0)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,esk17_0) ),
inference(spm,[status(thm)],[c_0_127,c_0_118]) ).
cnf(c_0_132,plain,
( earlier(X1,X2)
| ~ precedes(X1,X2) ),
i_0_45 ).
cnf(c_0_133,plain,
precedes(esk14_1(esk16_0),esk15_1(esk16_0)),
inference(spm,[status(thm)],[c_0_128,c_0_129]) ).
cnf(c_0_134,plain,
min_precedes(esk13_1(esk16_0),esk14_1(esk16_0),tptp0),
inference(spm,[status(thm)],[c_0_124,c_0_130]) ).
cnf(c_0_135,plain,
( leaf_occ(X1,X2)
| occurrence_of(esk15_1(X1),tptp2)
| occurrence_of(esk15_1(X1),tptp1)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0) ),
i_0_63 ).
cnf(c_0_136,plain,
( atomic(X1)
| leaf_occ(X2,esk4_2(X2,X1))
| ~ leaf(X2,X1) ),
i_0_13 ).
cnf(c_0_137,negated_conjecture,
leaf(esk15_1(esk16_0),tptp0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_131,c_0_120]),c_0_121])]),c_0_122]) ).
cnf(c_0_138,plain,
~ atomic(tptp0),
i_0_69 ).
cnf(c_0_139,plain,
( earlier(X1,X2)
| ~ earlier(X3,X2)
| ~ earlier(X1,X3) ),
i_0_59 ).
cnf(c_0_140,plain,
earlier(esk14_1(esk16_0),esk15_1(esk16_0)),
inference(spm,[status(thm)],[c_0_132,c_0_133]) ).
cnf(c_0_141,plain,
precedes(esk13_1(esk16_0),esk14_1(esk16_0)),
inference(spm,[status(thm)],[c_0_128,c_0_134]) ).
cnf(c_0_142,negated_conjecture,
( ~ occurrence_of(X1,tptp3)
| ~ occurrence_of(X2,tptp1)
| ~ leaf(X2,tptp0)
| ~ min_precedes(X1,X2,tptp0)
| ~ next_subocc(esk16_0,X1,tptp0) ),
i_0_80 ).
cnf(c_0_143,negated_conjecture,
( occurrence_of(esk15_1(X1),tptp2)
| occurrence_of(esk15_1(X1),tptp1)
| leaf_occ(X1,esk17_0)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,esk17_0) ),
inference(spm,[status(thm)],[c_0_135,c_0_118]) ).
cnf(c_0_144,negated_conjecture,
( ~ occurrence_of(X1,tptp3)
| ~ occurrence_of(X2,tptp2)
| ~ leaf(X2,tptp0)
| ~ min_precedes(X1,X2,tptp0)
| ~ next_subocc(esk16_0,X1,tptp0) ),
i_0_81 ).
cnf(c_0_145,plain,
( leaf_occ(X1,X2)
| occurrence_of(esk13_1(X1),tptp3)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0) ),
i_0_67 ).
cnf(c_0_146,plain,
( leaf_occ(X1,X2)
| next_subocc(X1,esk13_1(X1),tptp0)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0) ),
i_0_66 ).
cnf(c_0_147,plain,
( X1 = X2
| ~ occurrence_of(X3,X2)
| ~ occurrence_of(X3,X1) ),
i_0_15 ).
cnf(c_0_148,plain,
( occurrence_of(X1,esk5_1(X1))
| ~ activity_occurrence(X1) ),
i_0_20 ).
cnf(c_0_149,plain,
( activity_occurrence(X1)
| ~ occurrence_of(X1,X2) ),
i_0_5 ).
cnf(c_0_150,plain,
( atomic(X1)
| occurrence_of(esk4_2(X2,X1),X1)
| ~ leaf(X2,X1) ),
i_0_14 ).
cnf(c_0_151,plain,
( subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,X3)
| ~ subactivity_occurrence(X4,X2)
| ~ min_precedes(X1,X4,X3) ),
i_0_56 ).
cnf(c_0_152,plain,
( subactivity_occurrence(X1,X2)
| ~ leaf_occ(X1,X2) ),
i_0_36 ).
cnf(c_0_153,plain,
leaf_occ(esk15_1(esk16_0),esk4_2(esk15_1(esk16_0),tptp0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_136,c_0_137]),c_0_138]) ).
cnf(c_0_154,plain,
( earlier(X1,esk15_1(esk16_0))
| ~ earlier(X1,esk14_1(esk16_0)) ),
inference(spm,[status(thm)],[c_0_139,c_0_140]) ).
cnf(c_0_155,plain,
earlier(esk13_1(esk16_0),esk14_1(esk16_0)),
inference(spm,[status(thm)],[c_0_132,c_0_141]) ).
cnf(c_0_156,plain,
( legal(X1)
| ~ precedes(X2,X1) ),
i_0_44 ).
cnf(c_0_157,negated_conjecture,
( ~ min_precedes(X1,esk15_1(esk16_0),tptp0)
| ~ occurrence_of(esk15_1(esk16_0),tptp1)
| ~ occurrence_of(X1,tptp3)
| ~ next_subocc(esk16_0,X1,tptp0) ),
inference(spm,[status(thm)],[c_0_142,c_0_137]) ).
cnf(c_0_158,negated_conjecture,
( occurrence_of(esk15_1(esk16_0),tptp1)
| occurrence_of(esk15_1(esk16_0),tptp2) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_143,c_0_120]),c_0_121])]),c_0_122]) ).
cnf(c_0_159,negated_conjecture,
( ~ min_precedes(X1,esk15_1(esk16_0),tptp0)
| ~ occurrence_of(esk15_1(esk16_0),tptp2)
| ~ occurrence_of(X1,tptp3)
| ~ next_subocc(esk16_0,X1,tptp0) ),
inference(spm,[status(thm)],[c_0_144,c_0_137]) ).
cnf(c_0_160,negated_conjecture,
( occurrence_of(esk13_1(X1),tptp3)
| leaf_occ(X1,esk17_0)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,esk17_0) ),
inference(spm,[status(thm)],[c_0_145,c_0_118]) ).
cnf(c_0_161,negated_conjecture,
( next_subocc(X1,esk13_1(X1),tptp0)
| leaf_occ(X1,esk17_0)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,esk17_0) ),
inference(spm,[status(thm)],[c_0_146,c_0_118]) ).
cnf(c_0_162,plain,
( X1 = X2
| min_precedes(X1,X2,X3)
| ~ arboreal(X1)
| ~ occurrence_of(X4,X3)
| ~ subactivity_occurrence(X1,X4)
| ~ leaf_occ(X2,X4) ),
i_0_4 ).
cnf(c_0_163,plain,
( activity_occurrence(X1)
| ~ subactivity_occurrence(X2,X1) ),
i_0_18 ).
cnf(c_0_164,plain,
( X1 = esk5_1(X2)
| ~ occurrence_of(X2,X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_147,c_0_148]),c_0_149]) ).
cnf(c_0_165,plain,
occurrence_of(esk4_2(esk15_1(esk16_0),tptp0),tptp0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_150,c_0_137]),c_0_138]) ).
cnf(c_0_166,plain,
( subactivity_occurrence(esk14_1(esk16_0),X1)
| ~ occurrence_of(X1,tptp0)
| ~ subactivity_occurrence(esk15_1(esk16_0),X1) ),
inference(spm,[status(thm)],[c_0_151,c_0_129]) ).
cnf(c_0_167,plain,
subactivity_occurrence(esk15_1(esk16_0),esk4_2(esk15_1(esk16_0),tptp0)),
inference(spm,[status(thm)],[c_0_152,c_0_153]) ).
cnf(c_0_168,plain,
( min_precedes(X1,X2,X3)
| ~ precedes(X1,X2)
| ~ min_precedes(X4,X2,X3)
| ~ min_precedes(X4,X1,X3) ),
i_0_60 ).
cnf(c_0_169,plain,
( precedes(X1,X2)
| ~ legal(X2)
| ~ earlier(X1,X2) ),
i_0_43 ).
cnf(c_0_170,plain,
earlier(esk13_1(esk16_0),esk15_1(esk16_0)),
inference(spm,[status(thm)],[c_0_154,c_0_155]) ).
cnf(c_0_171,plain,
legal(esk15_1(esk16_0)),
inference(spm,[status(thm)],[c_0_156,c_0_133]) ).
cnf(c_0_172,negated_conjecture,
( ~ min_precedes(X1,esk15_1(esk16_0),tptp0)
| ~ occurrence_of(X1,tptp3)
| ~ next_subocc(esk16_0,X1,tptp0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_157,c_0_158]),c_0_159]) ).
cnf(c_0_173,negated_conjecture,
occurrence_of(esk13_1(esk16_0),tptp3),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_160,c_0_120]),c_0_121])]),c_0_122]) ).
cnf(c_0_174,negated_conjecture,
next_subocc(esk16_0,esk13_1(esk16_0),tptp0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_161,c_0_120]),c_0_121])]),c_0_122]) ).
cnf(c_0_175,plain,
( X1 = X2
| min_precedes(X1,X2,esk5_1(X3))
| ~ arboreal(X1)
| ~ leaf_occ(X2,X3)
| ~ subactivity_occurrence(X1,X3) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_162,c_0_148]),c_0_163]) ).
cnf(c_0_176,plain,
esk5_1(esk4_2(esk15_1(esk16_0),tptp0)) = tptp0,
inference(spm,[status(thm)],[c_0_164,c_0_165]) ).
cnf(c_0_177,plain,
( subactivity_occurrence(esk13_1(esk16_0),X1)
| ~ occurrence_of(X1,tptp0)
| ~ subactivity_occurrence(esk14_1(esk16_0),X1) ),
inference(spm,[status(thm)],[c_0_151,c_0_134]) ).
cnf(c_0_178,plain,
subactivity_occurrence(esk14_1(esk16_0),esk4_2(esk15_1(esk16_0),tptp0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_166,c_0_165]),c_0_167])]) ).
cnf(c_0_179,plain,
( arboreal(X1)
| ~ atomic(X2)
| ~ occurrence_of(X1,X2) ),
i_0_31 ).
cnf(c_0_180,plain,
atomic(tptp3),
i_0_73 ).
cnf(c_0_181,plain,
( min_precedes(X1,esk15_1(esk16_0),tptp0)
| ~ precedes(X1,esk15_1(esk16_0))
| ~ min_precedes(esk14_1(esk16_0),X1,tptp0) ),
inference(spm,[status(thm)],[c_0_168,c_0_129]) ).
cnf(c_0_182,plain,
precedes(esk13_1(esk16_0),esk15_1(esk16_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_169,c_0_170]),c_0_171])]) ).
cnf(c_0_183,negated_conjecture,
~ min_precedes(esk13_1(esk16_0),esk15_1(esk16_0),tptp0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_172,c_0_173]),c_0_174])]) ).
cnf(c_0_184,plain,
( X1 = esk15_1(esk16_0)
| min_precedes(X1,esk15_1(esk16_0),tptp0)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,esk4_2(esk15_1(esk16_0),tptp0)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_175,c_0_153]),c_0_176]) ).
cnf(c_0_185,plain,
subactivity_occurrence(esk13_1(esk16_0),esk4_2(esk15_1(esk16_0),tptp0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_177,c_0_165]),c_0_178])]) ).
cnf(c_0_186,plain,
arboreal(esk13_1(esk16_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_179,c_0_173]),c_0_180])]) ).
cnf(c_0_187,plain,
~ min_precedes(esk14_1(esk16_0),esk13_1(esk16_0),tptp0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_181,c_0_182]),c_0_183]) ).
cnf(c_0_188,plain,
esk13_1(esk16_0) = esk15_1(esk16_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_184,c_0_185]),c_0_186])]),c_0_183]) ).
cnf(c_0_189,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_187,c_0_188]),c_0_129])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : PRO014+4 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n012.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon Jun 13 02:16:12 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected complete mode:
% 9.86/2.68 # ENIGMATIC: Solved by autoschedule-lgb:
% 9.86/2.68 # No SInE strategy applied
% 9.86/2.68 # Trying AutoSched0 for 150 seconds
% 9.86/2.68 # AutoSched0-Mode selected heuristic G_E___008_C18_F1_PI_SE_CS_SP_CO_S4S
% 9.86/2.68 # and selection function SelectNewComplexAHPNS.
% 9.86/2.68 #
% 9.86/2.68 # Preprocessing time : 0.024 s
% 9.86/2.68
% 9.86/2.68 # Proof found!
% 9.86/2.68 # SZS status Theorem
% 9.86/2.68 # SZS output start CNFRefutation
% See solution above
% 9.86/2.68 # Training examples: 0 positive, 0 negative
% 9.86/2.68
% 9.86/2.68 # -------------------------------------------------
% 9.86/2.68 # User time : 0.126 s
% 9.86/2.68 # System time : 0.008 s
% 9.86/2.68 # Total time : 0.134 s
% 9.86/2.68 # Maximum resident set size: 7120 pages
% 9.86/2.68
%------------------------------------------------------------------------------