%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : PRO014+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% 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:43:44 EDT 2022
% Result : Theorem 13.45s 3.19s
% Output : CNFRefutation 13.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 27
% Syntax : Number of clauses : 99 ( 34 unt; 27 nHn; 99 RR)
% Number of literals : 264 ( 11 equ; 141 neg)
% Maximal clause size : 8 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-3 aty)
% Number of variables : 129 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_72,plain,
( leaf_occ(X1,X2)
| next_subocc(X1,esk16_1(X1),tptp0)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ke42xxz6/input.p',i_0_72) ).
cnf(i_0_91,negated_conjecture,
occurrence_of(esk20_0,tptp0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ke42xxz6/input.p',i_0_91) ).
cnf(i_0_68,plain,
( leaf_occ(X1,X2)
| next_subocc(esk17_1(X1),esk18_1(X1),tptp0)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ke42xxz6/input.p',i_0_68) ).
cnf(i_0_70,plain,
( leaf_occ(X1,X2)
| next_subocc(esk16_1(X1),esk17_1(X1),tptp0)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ke42xxz6/input.p',i_0_70) ).
cnf(i_0_90,negated_conjecture,
subactivity_occurrence(esk19_0,esk20_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ke42xxz6/input.p',i_0_90) ).
cnf(i_0_89,negated_conjecture,
arboreal(esk19_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ke42xxz6/input.p',i_0_89) ).
cnf(i_0_88,negated_conjecture,
~ leaf_occ(esk19_0,esk20_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ke42xxz6/input.p',i_0_88) ).
cnf(i_0_39,plain,
( min_precedes(X1,X2,X3)
| ~ next_subocc(X1,X2,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ke42xxz6/input.p',i_0_39) ).
cnf(i_0_54,plain,
( subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,X3)
| ~ subactivity_occurrence(X4,X2)
| ~ min_precedes(X1,X4,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ke42xxz6/input.p',i_0_54) ).
cnf(i_0_48,plain,
( occurrence_of(esk10_3(X1,X2,X3),X1)
| ~ min_precedes(X2,X3,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ke42xxz6/input.p',i_0_48) ).
cnf(i_0_47,plain,
( subactivity_occurrence(X1,esk10_3(X2,X1,X3))
| ~ min_precedes(X1,X3,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ke42xxz6/input.p',i_0_47) ).
cnf(i_0_26,plain,
( precedes(X1,X2)
| ~ min_precedes(X1,X2,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ke42xxz6/input.p',i_0_26) ).
cnf(i_0_53,plain,
( X1 = X2
| min_precedes(X2,X1,X3)
| min_precedes(X1,X2,X3)
| ~ arboreal(X2)
| ~ arboreal(X1)
| ~ occurrence_of(X4,X3)
| ~ subactivity_occurrence(X2,X4)
| ~ subactivity_occurrence(X1,X4) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ke42xxz6/input.p',i_0_53) ).
cnf(i_0_15,plain,
( legal(X1)
| ~ precedes(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ke42xxz6/input.p',i_0_15) ).
cnf(i_0_46,plain,
( subactivity_occurrence(X1,esk10_3(X2,X3,X1))
| ~ min_precedes(X3,X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ke42xxz6/input.p',i_0_46) ).
cnf(i_0_12,plain,
( arboreal(X1)
| ~ legal(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ke42xxz6/input.p',i_0_12) ).
cnf(i_0_67,plain,
( leaf_occ(X1,X2)
| leaf(esk18_1(X1),tptp0)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ke42xxz6/input.p',i_0_67) ).
cnf(i_0_16,plain,
( earlier(X1,X2)
| ~ precedes(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ke42xxz6/input.p',i_0_16) ).
cnf(i_0_8,plain,
( earlier(X1,X2)
| ~ earlier(X3,X2)
| ~ earlier(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ke42xxz6/input.p',i_0_8) ).
cnf(i_0_34,plain,
( ~ leaf(X1,X2)
| ~ min_precedes(X1,X3,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ke42xxz6/input.p',i_0_34) ).
cnf(i_0_29,plain,
( min_precedes(X1,X2,X3)
| ~ precedes(X1,X2)
| ~ min_precedes(X4,X2,X3)
| ~ min_precedes(X4,X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ke42xxz6/input.p',i_0_29) ).
cnf(i_0_14,plain,
( precedes(X1,X2)
| ~ legal(X2)
| ~ earlier(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ke42xxz6/input.p',i_0_14) ).
cnf(i_0_73,plain,
( leaf_occ(X1,X2)
| occurrence_of(esk16_1(X1),tptp3)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ke42xxz6/input.p',i_0_73) ).
cnf(i_0_69,plain,
( leaf_occ(X1,X2)
| occurrence_of(esk18_1(X1),tptp2)
| occurrence_of(esk18_1(X1),tptp1)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ke42xxz6/input.p',i_0_69) ).
cnf(i_0_86,negated_conjecture,
( ~ occurrence_of(X1,tptp3)
| ~ occurrence_of(X2,tptp1)
| ~ leaf(X2,tptp0)
| ~ min_precedes(X1,X2,tptp0)
| ~ next_subocc(esk19_0,X1,tptp0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ke42xxz6/input.p',i_0_86) ).
cnf(i_0_87,negated_conjecture,
( ~ occurrence_of(X1,tptp3)
| ~ occurrence_of(X2,tptp2)
| ~ leaf(X2,tptp0)
| ~ min_precedes(X1,X2,tptp0)
| ~ next_subocc(esk19_0,X1,tptp0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ke42xxz6/input.p',i_0_87) ).
cnf(i_0_7,plain,
( ~ earlier(X1,X2)
| ~ earlier(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ke42xxz6/input.p',i_0_7) ).
cnf(c_0_119,plain,
( leaf_occ(X1,X2)
| next_subocc(X1,esk16_1(X1),tptp0)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0) ),
i_0_72 ).
cnf(c_0_120,negated_conjecture,
occurrence_of(esk20_0,tptp0),
i_0_91 ).
cnf(c_0_121,plain,
( leaf_occ(X1,X2)
| next_subocc(esk17_1(X1),esk18_1(X1),tptp0)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0) ),
i_0_68 ).
cnf(c_0_122,plain,
( leaf_occ(X1,X2)
| next_subocc(esk16_1(X1),esk17_1(X1),tptp0)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0) ),
i_0_70 ).
cnf(c_0_123,negated_conjecture,
( next_subocc(X1,esk16_1(X1),tptp0)
| leaf_occ(X1,esk20_0)
| ~ subactivity_occurrence(X1,esk20_0)
| ~ arboreal(X1) ),
inference(spm,[status(thm)],[c_0_119,c_0_120]) ).
cnf(c_0_124,negated_conjecture,
subactivity_occurrence(esk19_0,esk20_0),
i_0_90 ).
cnf(c_0_125,negated_conjecture,
arboreal(esk19_0),
i_0_89 ).
cnf(c_0_126,negated_conjecture,
~ leaf_occ(esk19_0,esk20_0),
i_0_88 ).
cnf(c_0_127,negated_conjecture,
( next_subocc(esk17_1(X1),esk18_1(X1),tptp0)
| leaf_occ(X1,esk20_0)
| ~ subactivity_occurrence(X1,esk20_0)
| ~ arboreal(X1) ),
inference(spm,[status(thm)],[c_0_121,c_0_120]) ).
cnf(c_0_128,negated_conjecture,
( next_subocc(esk16_1(X1),esk17_1(X1),tptp0)
| leaf_occ(X1,esk20_0)
| ~ subactivity_occurrence(X1,esk20_0)
| ~ arboreal(X1) ),
inference(spm,[status(thm)],[c_0_122,c_0_120]) ).
cnf(c_0_129,plain,
( min_precedes(X1,X2,X3)
| ~ next_subocc(X1,X2,X3) ),
i_0_39 ).
cnf(c_0_130,negated_conjecture,
next_subocc(esk19_0,esk16_1(esk19_0),tptp0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_123,c_0_124]),c_0_125])]),c_0_126]) ).
cnf(c_0_131,negated_conjecture,
next_subocc(esk17_1(esk19_0),esk18_1(esk19_0),tptp0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_127,c_0_124]),c_0_125])]),c_0_126]) ).
cnf(c_0_132,negated_conjecture,
next_subocc(esk16_1(esk19_0),esk17_1(esk19_0),tptp0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_128,c_0_124]),c_0_125])]),c_0_126]) ).
cnf(c_0_133,plain,
( subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,X3)
| ~ subactivity_occurrence(X4,X2)
| ~ min_precedes(X1,X4,X3) ),
i_0_54 ).
cnf(c_0_134,plain,
min_precedes(esk19_0,esk16_1(esk19_0),tptp0),
inference(spm,[status(thm)],[c_0_129,c_0_130]) ).
cnf(c_0_135,plain,
( occurrence_of(esk10_3(X1,X2,X3),X1)
| ~ min_precedes(X2,X3,X1) ),
i_0_48 ).
cnf(c_0_136,plain,
min_precedes(esk17_1(esk19_0),esk18_1(esk19_0),tptp0),
inference(spm,[status(thm)],[c_0_129,c_0_131]) ).
cnf(c_0_137,plain,
min_precedes(esk16_1(esk19_0),esk17_1(esk19_0),tptp0),
inference(spm,[status(thm)],[c_0_129,c_0_132]) ).
cnf(c_0_138,plain,
( subactivity_occurrence(X1,esk10_3(X2,X1,X3))
| ~ min_precedes(X1,X3,X2) ),
i_0_47 ).
cnf(c_0_139,plain,
( subactivity_occurrence(esk19_0,X1)
| ~ subactivity_occurrence(esk16_1(esk19_0),X1)
| ~ occurrence_of(X1,tptp0) ),
inference(spm,[status(thm)],[c_0_133,c_0_134]) ).
cnf(c_0_140,plain,
occurrence_of(esk10_3(tptp0,esk17_1(esk19_0),esk18_1(esk19_0)),tptp0),
inference(spm,[status(thm)],[c_0_135,c_0_136]) ).
cnf(c_0_141,plain,
( subactivity_occurrence(esk16_1(esk19_0),X1)
| ~ subactivity_occurrence(esk17_1(esk19_0),X1)
| ~ occurrence_of(X1,tptp0) ),
inference(spm,[status(thm)],[c_0_133,c_0_137]) ).
cnf(c_0_142,plain,
subactivity_occurrence(esk17_1(esk19_0),esk10_3(tptp0,esk17_1(esk19_0),esk18_1(esk19_0))),
inference(spm,[status(thm)],[c_0_138,c_0_136]) ).
cnf(c_0_143,plain,
( precedes(X1,X2)
| ~ min_precedes(X1,X2,X3) ),
i_0_26 ).
cnf(c_0_144,plain,
( X1 = X2
| min_precedes(X2,X1,X3)
| min_precedes(X1,X2,X3)
| ~ arboreal(X2)
| ~ arboreal(X1)
| ~ occurrence_of(X4,X3)
| ~ subactivity_occurrence(X2,X4)
| ~ subactivity_occurrence(X1,X4) ),
i_0_53 ).
cnf(c_0_145,plain,
( subactivity_occurrence(esk19_0,esk10_3(tptp0,esk17_1(esk19_0),esk18_1(esk19_0)))
| ~ subactivity_occurrence(esk16_1(esk19_0),esk10_3(tptp0,esk17_1(esk19_0),esk18_1(esk19_0))) ),
inference(spm,[status(thm)],[c_0_139,c_0_140]) ).
cnf(c_0_146,plain,
subactivity_occurrence(esk16_1(esk19_0),esk10_3(tptp0,esk17_1(esk19_0),esk18_1(esk19_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_141,c_0_140]),c_0_142])]) ).
cnf(c_0_147,plain,
( legal(X1)
| ~ precedes(X2,X1) ),
i_0_15 ).
cnf(c_0_148,plain,
precedes(esk17_1(esk19_0),esk18_1(esk19_0)),
inference(spm,[status(thm)],[c_0_143,c_0_136]) ).
cnf(c_0_149,plain,
( X1 = X2
| min_precedes(X1,X2,tptp0)
| min_precedes(X2,X1,tptp0)
| ~ subactivity_occurrence(X2,esk10_3(tptp0,esk17_1(esk19_0),esk18_1(esk19_0)))
| ~ subactivity_occurrence(X1,esk10_3(tptp0,esk17_1(esk19_0),esk18_1(esk19_0)))
| ~ arboreal(X2)
| ~ arboreal(X1) ),
inference(spm,[status(thm)],[c_0_144,c_0_140]) ).
cnf(c_0_150,plain,
subactivity_occurrence(esk19_0,esk10_3(tptp0,esk17_1(esk19_0),esk18_1(esk19_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_145,c_0_146])]) ).
cnf(c_0_151,plain,
( subactivity_occurrence(X1,esk10_3(X2,X3,X1))
| ~ min_precedes(X3,X1,X2) ),
i_0_46 ).
cnf(c_0_152,plain,
( arboreal(X1)
| ~ legal(X1) ),
i_0_12 ).
cnf(c_0_153,plain,
legal(esk18_1(esk19_0)),
inference(spm,[status(thm)],[c_0_147,c_0_148]) ).
cnf(c_0_154,plain,
( leaf_occ(X1,X2)
| leaf(esk18_1(X1),tptp0)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0) ),
i_0_67 ).
cnf(c_0_155,plain,
( earlier(X1,X2)
| ~ precedes(X1,X2) ),
i_0_16 ).
cnf(c_0_156,plain,
( X1 = esk19_0
| min_precedes(esk19_0,X1,tptp0)
| min_precedes(X1,esk19_0,tptp0)
| ~ subactivity_occurrence(X1,esk10_3(tptp0,esk17_1(esk19_0),esk18_1(esk19_0)))
| ~ arboreal(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_149,c_0_150]),c_0_125])]) ).
cnf(c_0_157,plain,
subactivity_occurrence(esk18_1(esk19_0),esk10_3(tptp0,esk17_1(esk19_0),esk18_1(esk19_0))),
inference(spm,[status(thm)],[c_0_151,c_0_136]) ).
cnf(c_0_158,plain,
arboreal(esk18_1(esk19_0)),
inference(spm,[status(thm)],[c_0_152,c_0_153]) ).
cnf(c_0_159,negated_conjecture,
( leaf(esk18_1(X1),tptp0)
| leaf_occ(X1,esk20_0)
| ~ subactivity_occurrence(X1,esk20_0)
| ~ arboreal(X1) ),
inference(spm,[status(thm)],[c_0_154,c_0_120]) ).
cnf(c_0_160,plain,
( earlier(X1,X2)
| ~ earlier(X3,X2)
| ~ earlier(X1,X3) ),
i_0_8 ).
cnf(c_0_161,plain,
earlier(esk17_1(esk19_0),esk18_1(esk19_0)),
inference(spm,[status(thm)],[c_0_155,c_0_148]) ).
cnf(c_0_162,plain,
precedes(esk16_1(esk19_0),esk17_1(esk19_0)),
inference(spm,[status(thm)],[c_0_143,c_0_137]) ).
cnf(c_0_163,plain,
( ~ leaf(X1,X2)
| ~ min_precedes(X1,X3,X2) ),
i_0_34 ).
cnf(c_0_164,plain,
( esk18_1(esk19_0) = esk19_0
| min_precedes(esk18_1(esk19_0),esk19_0,tptp0)
| min_precedes(esk19_0,esk18_1(esk19_0),tptp0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_156,c_0_157]),c_0_158])]) ).
cnf(c_0_165,negated_conjecture,
leaf(esk18_1(esk19_0),tptp0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_159,c_0_124]),c_0_125])]),c_0_126]) ).
cnf(c_0_166,plain,
( earlier(X1,esk18_1(esk19_0))
| ~ earlier(X1,esk17_1(esk19_0)) ),
inference(spm,[status(thm)],[c_0_160,c_0_161]) ).
cnf(c_0_167,plain,
earlier(esk16_1(esk19_0),esk17_1(esk19_0)),
inference(spm,[status(thm)],[c_0_155,c_0_162]) ).
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_29 ).
cnf(c_0_169,plain,
( esk18_1(esk19_0) = esk19_0
| min_precedes(esk19_0,esk18_1(esk19_0),tptp0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_163,c_0_164]),c_0_165])]) ).
cnf(c_0_170,plain,
( precedes(X1,X2)
| ~ legal(X2)
| ~ earlier(X1,X2) ),
i_0_14 ).
cnf(c_0_171,plain,
earlier(esk16_1(esk19_0),esk18_1(esk19_0)),
inference(spm,[status(thm)],[c_0_166,c_0_167]) ).
cnf(c_0_172,plain,
( leaf_occ(X1,X2)
| occurrence_of(esk16_1(X1),tptp3)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0) ),
i_0_73 ).
cnf(c_0_173,plain,
( esk18_1(esk19_0) = esk19_0
| min_precedes(X1,esk18_1(esk19_0),tptp0)
| ~ min_precedes(esk19_0,X1,tptp0)
| ~ precedes(X1,esk18_1(esk19_0)) ),
inference(spm,[status(thm)],[c_0_168,c_0_169]) ).
cnf(c_0_174,plain,
precedes(esk16_1(esk19_0),esk18_1(esk19_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_170,c_0_171]),c_0_153])]) ).
cnf(c_0_175,negated_conjecture,
( leaf_occ(X1,esk20_0)
| occurrence_of(esk16_1(X1),tptp3)
| ~ subactivity_occurrence(X1,esk20_0)
| ~ arboreal(X1) ),
inference(spm,[status(thm)],[c_0_172,c_0_120]) ).
cnf(c_0_176,plain,
( leaf_occ(X1,X2)
| occurrence_of(esk18_1(X1),tptp2)
| occurrence_of(esk18_1(X1),tptp1)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0) ),
i_0_69 ).
cnf(c_0_177,negated_conjecture,
( ~ occurrence_of(X1,tptp3)
| ~ occurrence_of(X2,tptp1)
| ~ leaf(X2,tptp0)
| ~ min_precedes(X1,X2,tptp0)
| ~ next_subocc(esk19_0,X1,tptp0) ),
i_0_86 ).
cnf(c_0_178,plain,
( esk18_1(esk19_0) = esk19_0
| min_precedes(esk16_1(esk19_0),esk18_1(esk19_0),tptp0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_173,c_0_134]),c_0_174])]) ).
cnf(c_0_179,negated_conjecture,
occurrence_of(esk16_1(esk19_0),tptp3),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_175,c_0_124]),c_0_125])]),c_0_126]) ).
cnf(c_0_180,negated_conjecture,
( leaf_occ(X1,esk20_0)
| occurrence_of(esk18_1(X1),tptp1)
| occurrence_of(esk18_1(X1),tptp2)
| ~ subactivity_occurrence(X1,esk20_0)
| ~ arboreal(X1) ),
inference(spm,[status(thm)],[c_0_176,c_0_120]) ).
cnf(c_0_181,negated_conjecture,
( ~ occurrence_of(X1,tptp3)
| ~ occurrence_of(X2,tptp2)
| ~ leaf(X2,tptp0)
| ~ min_precedes(X1,X2,tptp0)
| ~ next_subocc(esk19_0,X1,tptp0) ),
i_0_87 ).
cnf(c_0_182,plain,
precedes(esk19_0,esk16_1(esk19_0)),
inference(spm,[status(thm)],[c_0_143,c_0_134]) ).
cnf(c_0_183,negated_conjecture,
( esk18_1(esk19_0) = esk19_0
| ~ occurrence_of(esk18_1(esk19_0),tptp1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_177,c_0_178]),c_0_130]),c_0_165]),c_0_179])]) ).
cnf(c_0_184,negated_conjecture,
( occurrence_of(esk18_1(esk19_0),tptp2)
| occurrence_of(esk18_1(esk19_0),tptp1) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_180,c_0_124]),c_0_125])]),c_0_126]) ).
cnf(c_0_185,negated_conjecture,
( esk18_1(esk19_0) = esk19_0
| ~ occurrence_of(esk18_1(esk19_0),tptp2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_181,c_0_178]),c_0_130]),c_0_165]),c_0_179])]) ).
cnf(c_0_186,plain,
( ~ earlier(X1,X2)
| ~ earlier(X2,X1) ),
i_0_7 ).
cnf(c_0_187,plain,
earlier(esk19_0,esk16_1(esk19_0)),
inference(spm,[status(thm)],[c_0_155,c_0_182]) ).
cnf(c_0_188,negated_conjecture,
esk18_1(esk19_0) = esk19_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_183,c_0_184]),c_0_185]) ).
cnf(c_0_189,plain,
~ earlier(esk16_1(esk19_0),esk19_0),
inference(spm,[status(thm)],[c_0_186,c_0_187]) ).
cnf(c_0_190,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_171,c_0_188]),c_0_189]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : PRO014+1 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.33 % Computer : n009.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Mon Jun 13 02:10:24 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.18/0.45 # ENIGMATIC: Selected complete mode:
% 13.45/3.19 # ENIGMATIC: Solved by autoschedule:
% 13.45/3.19 # No SInE strategy applied
% 13.45/3.19 # Trying AutoSched0 for 150 seconds
% 13.45/3.19 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI
% 13.45/3.19 # and selection function SelectCQArNTNpEqFirst.
% 13.45/3.19 #
% 13.45/3.19 # Preprocessing time : 0.025 s
% 13.45/3.19 # Presaturation interreduction done
% 13.45/3.19
% 13.45/3.19 # Proof found!
% 13.45/3.19 # SZS status Theorem
% 13.45/3.19 # SZS output start CNFRefutation
% See solution above
% 13.45/3.19 # Training examples: 0 positive, 0 negative
% 13.45/3.19
% 13.45/3.19 # -------------------------------------------------
% 13.45/3.19 # User time : 0.901 s
% 13.45/3.19 # System time : 0.018 s
% 13.45/3.19 # Total time : 0.920 s
% 13.45/3.19 # Maximum resident set size: 7124 pages
% 13.45/3.19
%------------------------------------------------------------------------------