TSTP Solution File: PRO014+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : PRO014+3 : 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 7.35s 2.29s
% Output : CNFRefutation 7.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 25
% Syntax : Number of clauses : 91 ( 34 unt; 29 nHn; 91 RR)
% Number of literals : 240 ( 8 equ; 130 neg)
% Maximal clause size : 6 ( 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-2 aty)
% Number of variables : 105 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_86,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-x4br5h20/lgb.p',i_0_86) ).
cnf(i_0_107,negated_conjecture,
occurrence_of(esk21_0,tptp0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-x4br5h20/lgb.p',i_0_107) ).
cnf(i_0_84,plain,
( leaf_occ(X1,X2)
| next_subocc(esk18_1(X1),esk19_1(X1),tptp0)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-x4br5h20/lgb.p',i_0_84) ).
cnf(i_0_83,plain,
( leaf_occ(X1,X2)
| leaf(esk19_1(X1),tptp0)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-x4br5h20/lgb.p',i_0_83) ).
cnf(i_0_88,plain,
( leaf_occ(X1,X2)
| next_subocc(X1,esk17_1(X1),tptp0)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-x4br5h20/lgb.p',i_0_88) ).
cnf(i_0_106,negated_conjecture,
subactivity_occurrence(esk20_0,esk21_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-x4br5h20/lgb.p',i_0_106) ).
cnf(i_0_105,negated_conjecture,
arboreal(esk20_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-x4br5h20/lgb.p',i_0_105) ).
cnf(i_0_104,negated_conjecture,
~ leaf_occ(esk20_0,esk21_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-x4br5h20/lgb.p',i_0_104) ).
cnf(i_0_39,plain,
( min_precedes(X1,X2,X3)
| ~ next_subocc(X1,X2,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-x4br5h20/lgb.p',i_0_39) ).
cnf(i_0_78,plain,
( atomic(X1)
| leaf_occ(X2,esk16_2(X2,X1))
| ~ leaf(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-x4br5h20/lgb.p',i_0_78) ).
cnf(i_0_91,plain,
~ atomic(tptp0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-x4br5h20/lgb.p',i_0_91) ).
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-x4br5h20/lgb.p',i_0_54) ).
cnf(i_0_79,plain,
( atomic(X1)
| occurrence_of(esk16_2(X2,X1),X1)
| ~ leaf(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-x4br5h20/lgb.p',i_0_79) ).
cnf(i_0_65,plain,
( subactivity_occurrence(X1,X2)
| ~ leaf_occ(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-x4br5h20/lgb.p',i_0_65) ).
cnf(i_0_89,plain,
( leaf_occ(X1,X2)
| occurrence_of(esk17_1(X1),tptp3)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-x4br5h20/lgb.p',i_0_89) ).
cnf(i_0_75,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/sandbox/tmp/enigma-theBenchmark.p-x4br5h20/lgb.p',i_0_75) ).
cnf(i_0_10,plain,
( arboreal(X1)
| ~ atomic(X2)
| ~ occurrence_of(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-x4br5h20/lgb.p',i_0_10) ).
cnf(i_0_95,plain,
atomic(tptp3),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-x4br5h20/lgb.p',i_0_95) ).
cnf(i_0_85,plain,
( leaf_occ(X1,X2)
| occurrence_of(esk19_1(X1),tptp2)
| occurrence_of(esk19_1(X1),tptp1)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-x4br5h20/lgb.p',i_0_85) ).
cnf(i_0_26,plain,
( precedes(X1,X2)
| ~ min_precedes(X1,X2,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-x4br5h20/lgb.p',i_0_26) ).
cnf(i_0_69,plain,
( ~ occurrence_of(X1,X2)
| ~ leaf_occ(X3,X1)
| ~ min_precedes(X3,X4,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-x4br5h20/lgb.p',i_0_69) ).
cnf(i_0_16,plain,
( earlier(X1,X2)
| ~ precedes(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-x4br5h20/lgb.p',i_0_16) ).
cnf(i_0_102,negated_conjecture,
( ~ occurrence_of(X1,tptp3)
| ~ occurrence_of(X2,tptp1)
| ~ leaf(X2,tptp0)
| ~ min_precedes(X1,X2,tptp0)
| ~ next_subocc(esk20_0,X1,tptp0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-x4br5h20/lgb.p',i_0_102) ).
cnf(i_0_103,negated_conjecture,
( ~ occurrence_of(X1,tptp3)
| ~ occurrence_of(X2,tptp2)
| ~ leaf(X2,tptp0)
| ~ min_precedes(X1,X2,tptp0)
| ~ next_subocc(esk20_0,X1,tptp0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-x4br5h20/lgb.p',i_0_103) ).
cnf(i_0_7,plain,
( ~ earlier(X1,X2)
| ~ earlier(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-x4br5h20/lgb.p',i_0_7) ).
cnf(c_0_133,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_86 ).
cnf(c_0_134,negated_conjecture,
occurrence_of(esk21_0,tptp0),
i_0_107 ).
cnf(c_0_135,plain,
( leaf_occ(X1,X2)
| next_subocc(esk18_1(X1),esk19_1(X1),tptp0)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0) ),
i_0_84 ).
cnf(c_0_136,plain,
( leaf_occ(X1,X2)
| leaf(esk19_1(X1),tptp0)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0) ),
i_0_83 ).
cnf(c_0_137,plain,
( leaf_occ(X1,X2)
| next_subocc(X1,esk17_1(X1),tptp0)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0) ),
i_0_88 ).
cnf(c_0_138,negated_conjecture,
( next_subocc(esk17_1(X1),esk18_1(X1),tptp0)
| leaf_occ(X1,esk21_0)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,esk21_0) ),
inference(spm,[status(thm)],[c_0_133,c_0_134]) ).
cnf(c_0_139,negated_conjecture,
subactivity_occurrence(esk20_0,esk21_0),
i_0_106 ).
cnf(c_0_140,negated_conjecture,
arboreal(esk20_0),
i_0_105 ).
cnf(c_0_141,negated_conjecture,
~ leaf_occ(esk20_0,esk21_0),
i_0_104 ).
cnf(c_0_142,negated_conjecture,
( next_subocc(esk18_1(X1),esk19_1(X1),tptp0)
| leaf_occ(X1,esk21_0)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,esk21_0) ),
inference(spm,[status(thm)],[c_0_135,c_0_134]) ).
cnf(c_0_143,negated_conjecture,
( leaf(esk19_1(X1),tptp0)
| leaf_occ(X1,esk21_0)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,esk21_0) ),
inference(spm,[status(thm)],[c_0_136,c_0_134]) ).
cnf(c_0_144,negated_conjecture,
( next_subocc(X1,esk17_1(X1),tptp0)
| leaf_occ(X1,esk21_0)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,esk21_0) ),
inference(spm,[status(thm)],[c_0_137,c_0_134]) ).
cnf(c_0_145,plain,
( min_precedes(X1,X2,X3)
| ~ next_subocc(X1,X2,X3) ),
i_0_39 ).
cnf(c_0_146,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(spm,[status(thm)],[c_0_138,c_0_139]),c_0_140])]),c_0_141]) ).
cnf(c_0_147,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(spm,[status(thm)],[c_0_142,c_0_139]),c_0_140])]),c_0_141]) ).
cnf(c_0_148,plain,
( atomic(X1)
| leaf_occ(X2,esk16_2(X2,X1))
| ~ leaf(X2,X1) ),
i_0_78 ).
cnf(c_0_149,negated_conjecture,
leaf(esk19_1(esk20_0),tptp0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_143,c_0_139]),c_0_140])]),c_0_141]) ).
cnf(c_0_150,plain,
~ atomic(tptp0),
i_0_91 ).
cnf(c_0_151,negated_conjecture,
next_subocc(esk20_0,esk17_1(esk20_0),tptp0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_144,c_0_139]),c_0_140])]),c_0_141]) ).
cnf(c_0_152,plain,
( subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,X3)
| ~ subactivity_occurrence(X4,X2)
| ~ min_precedes(X1,X4,X3) ),
i_0_54 ).
cnf(c_0_153,plain,
min_precedes(esk17_1(esk20_0),esk18_1(esk20_0),tptp0),
inference(spm,[status(thm)],[c_0_145,c_0_146]) ).
cnf(c_0_154,plain,
( atomic(X1)
| occurrence_of(esk16_2(X2,X1),X1)
| ~ leaf(X2,X1) ),
i_0_79 ).
cnf(c_0_155,plain,
min_precedes(esk18_1(esk20_0),esk19_1(esk20_0),tptp0),
inference(spm,[status(thm)],[c_0_145,c_0_147]) ).
cnf(c_0_156,plain,
( subactivity_occurrence(X1,X2)
| ~ leaf_occ(X1,X2) ),
i_0_65 ).
cnf(c_0_157,plain,
leaf_occ(esk19_1(esk20_0),esk16_2(esk19_1(esk20_0),tptp0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_148,c_0_149]),c_0_150]) ).
cnf(c_0_158,plain,
( leaf_occ(X1,X2)
| occurrence_of(esk17_1(X1),tptp3)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0) ),
i_0_89 ).
cnf(c_0_159,plain,
min_precedes(esk20_0,esk17_1(esk20_0),tptp0),
inference(spm,[status(thm)],[c_0_145,c_0_151]) ).
cnf(c_0_160,plain,
( subactivity_occurrence(esk17_1(esk20_0),X1)
| ~ occurrence_of(X1,tptp0)
| ~ subactivity_occurrence(esk18_1(esk20_0),X1) ),
inference(spm,[status(thm)],[c_0_152,c_0_153]) ).
cnf(c_0_161,plain,
occurrence_of(esk16_2(esk19_1(esk20_0),tptp0),tptp0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_154,c_0_149]),c_0_150]) ).
cnf(c_0_162,plain,
( subactivity_occurrence(esk18_1(esk20_0),X1)
| ~ occurrence_of(X1,tptp0)
| ~ subactivity_occurrence(esk19_1(esk20_0),X1) ),
inference(spm,[status(thm)],[c_0_152,c_0_155]) ).
cnf(c_0_163,plain,
subactivity_occurrence(esk19_1(esk20_0),esk16_2(esk19_1(esk20_0),tptp0)),
inference(spm,[status(thm)],[c_0_156,c_0_157]) ).
cnf(c_0_164,plain,
( X1 = X2
| min_precedes(X1,X2,X3)
| ~ arboreal(X1)
| ~ occurrence_of(X4,X3)
| ~ subactivity_occurrence(X1,X4)
| ~ leaf_occ(X2,X4) ),
i_0_75 ).
cnf(c_0_165,negated_conjecture,
( occurrence_of(esk17_1(X1),tptp3)
| leaf_occ(X1,esk21_0)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,esk21_0) ),
inference(spm,[status(thm)],[c_0_158,c_0_134]) ).
cnf(c_0_166,plain,
( subactivity_occurrence(esk20_0,X1)
| ~ occurrence_of(X1,tptp0)
| ~ subactivity_occurrence(esk17_1(esk20_0),X1) ),
inference(spm,[status(thm)],[c_0_152,c_0_159]) ).
cnf(c_0_167,plain,
( subactivity_occurrence(esk17_1(esk20_0),esk16_2(esk19_1(esk20_0),tptp0))
| ~ subactivity_occurrence(esk18_1(esk20_0),esk16_2(esk19_1(esk20_0),tptp0)) ),
inference(spm,[status(thm)],[c_0_160,c_0_161]) ).
cnf(c_0_168,plain,
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_162,c_0_161]),c_0_163])]) ).
cnf(c_0_169,plain,
( X1 = esk19_1(esk20_0)
| min_precedes(X1,esk19_1(esk20_0),X2)
| ~ occurrence_of(esk16_2(esk19_1(esk20_0),tptp0),X2)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,esk16_2(esk19_1(esk20_0),tptp0)) ),
inference(spm,[status(thm)],[c_0_164,c_0_157]) ).
cnf(c_0_170,plain,
( arboreal(X1)
| ~ atomic(X2)
| ~ occurrence_of(X1,X2) ),
i_0_10 ).
cnf(c_0_171,negated_conjecture,
occurrence_of(esk17_1(esk20_0),tptp3),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_165,c_0_139]),c_0_140])]),c_0_141]) ).
cnf(c_0_172,plain,
atomic(tptp3),
i_0_95 ).
cnf(c_0_173,plain,
( leaf_occ(X1,X2)
| occurrence_of(esk19_1(X1),tptp2)
| occurrence_of(esk19_1(X1),tptp1)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0) ),
i_0_85 ).
cnf(c_0_174,plain,
( subactivity_occurrence(esk20_0,esk16_2(esk19_1(esk20_0),tptp0))
| ~ subactivity_occurrence(esk17_1(esk20_0),esk16_2(esk19_1(esk20_0),tptp0)) ),
inference(spm,[status(thm)],[c_0_166,c_0_161]) ).
cnf(c_0_175,plain,
subactivity_occurrence(esk17_1(esk20_0),esk16_2(esk19_1(esk20_0),tptp0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_167,c_0_168])]) ).
cnf(c_0_176,plain,
( precedes(X1,X2)
| ~ min_precedes(X1,X2,X3) ),
i_0_26 ).
cnf(c_0_177,plain,
( X1 = esk19_1(esk20_0)
| min_precedes(X1,esk19_1(esk20_0),tptp0)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,esk16_2(esk19_1(esk20_0),tptp0)) ),
inference(spm,[status(thm)],[c_0_169,c_0_161]) ).
cnf(c_0_178,plain,
arboreal(esk17_1(esk20_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_170,c_0_171]),c_0_172])]) ).
cnf(c_0_179,plain,
( ~ occurrence_of(X1,X2)
| ~ leaf_occ(X3,X1)
| ~ min_precedes(X3,X4,X2) ),
i_0_69 ).
cnf(c_0_180,plain,
( occurrence_of(esk19_1(X1),tptp1)
| occurrence_of(esk19_1(X1),tptp2)
| leaf_occ(X1,esk16_2(esk19_1(esk20_0),tptp0))
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,esk16_2(esk19_1(esk20_0),tptp0)) ),
inference(spm,[status(thm)],[c_0_173,c_0_161]) ).
cnf(c_0_181,plain,
subactivity_occurrence(esk20_0,esk16_2(esk19_1(esk20_0),tptp0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_174,c_0_175])]) ).
cnf(c_0_182,plain,
( earlier(X1,X2)
| ~ precedes(X1,X2) ),
i_0_16 ).
cnf(c_0_183,plain,
precedes(esk17_1(esk20_0),esk18_1(esk20_0)),
inference(spm,[status(thm)],[c_0_176,c_0_153]) ).
cnf(c_0_184,negated_conjecture,
( ~ occurrence_of(X1,tptp3)
| ~ occurrence_of(X2,tptp1)
| ~ leaf(X2,tptp0)
| ~ min_precedes(X1,X2,tptp0)
| ~ next_subocc(esk20_0,X1,tptp0) ),
i_0_102 ).
cnf(c_0_185,plain,
( esk17_1(esk20_0) = esk19_1(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_177,c_0_175]),c_0_178])]) ).
cnf(c_0_186,plain,
( ~ occurrence_of(X1,tptp0)
| ~ leaf_occ(esk20_0,X1) ),
inference(spm,[status(thm)],[c_0_179,c_0_159]) ).
cnf(c_0_187,plain,
( occurrence_of(esk19_1(esk20_0),tptp2)
| occurrence_of(esk19_1(esk20_0),tptp1)
| leaf_occ(esk20_0,esk16_2(esk19_1(esk20_0),tptp0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_180,c_0_181]),c_0_140])]) ).
cnf(c_0_188,negated_conjecture,
( ~ occurrence_of(X1,tptp3)
| ~ occurrence_of(X2,tptp2)
| ~ leaf(X2,tptp0)
| ~ min_precedes(X1,X2,tptp0)
| ~ next_subocc(esk20_0,X1,tptp0) ),
i_0_103 ).
cnf(c_0_189,plain,
( ~ earlier(X1,X2)
| ~ earlier(X2,X1) ),
i_0_7 ).
cnf(c_0_190,plain,
earlier(esk17_1(esk20_0),esk18_1(esk20_0)),
inference(spm,[status(thm)],[c_0_182,c_0_183]) ).
cnf(c_0_191,negated_conjecture,
( esk17_1(esk20_0) = esk19_1(esk20_0)
| ~ occurrence_of(esk19_1(esk20_0),tptp1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_184,c_0_185]),c_0_149]),c_0_171]),c_0_151])]) ).
cnf(c_0_192,plain,
( occurrence_of(esk19_1(esk20_0),tptp1)
| occurrence_of(esk19_1(esk20_0),tptp2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_186,c_0_187]),c_0_161])]) ).
cnf(c_0_193,negated_conjecture,
( esk17_1(esk20_0) = esk19_1(esk20_0)
| ~ occurrence_of(esk19_1(esk20_0),tptp2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_188,c_0_185]),c_0_149]),c_0_171]),c_0_151])]) ).
cnf(c_0_194,plain,
precedes(esk18_1(esk20_0),esk19_1(esk20_0)),
inference(spm,[status(thm)],[c_0_176,c_0_155]) ).
cnf(c_0_195,plain,
~ earlier(esk18_1(esk20_0),esk17_1(esk20_0)),
inference(spm,[status(thm)],[c_0_189,c_0_190]) ).
cnf(c_0_196,plain,
esk17_1(esk20_0) = esk19_1(esk20_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_191,c_0_192]),c_0_193]) ).
cnf(c_0_197,plain,
earlier(esk18_1(esk20_0),esk19_1(esk20_0)),
inference(spm,[status(thm)],[c_0_182,c_0_194]) ).
cnf(c_0_198,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_195,c_0_196]),c_0_197])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.11 % Problem : PRO014+3 : TPTP v8.1.0. Released v4.0.0.
% 0.08/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.11/0.33 % Computer : n009.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Mon Jun 13 01:53:39 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 7.35/2.29 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.35/2.29 # No SInE strategy applied
% 7.35/2.29 # Trying AutoSched0 for 150 seconds
% 7.35/2.29 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI
% 7.35/2.29 # and selection function SelectCQArNTNpEqFirst.
% 7.35/2.29 #
% 7.35/2.29 # Preprocessing time : 0.026 s
% 7.35/2.29 # Presaturation interreduction done
% 7.35/2.29
% 7.35/2.29 # Proof found!
% 7.35/2.29 # SZS status Theorem
% 7.35/2.29 # SZS output start CNFRefutation
% See solution above
% 7.35/2.29 # Training examples: 0 positive, 0 negative
% 7.35/2.29
% 7.35/2.29 # -------------------------------------------------
% 7.35/2.29 # User time : 0.112 s
% 7.35/2.29 # System time : 0.007 s
% 7.35/2.29 # Total time : 0.120 s
% 7.35/2.29 # Maximum resident set size: 7128 pages
% 7.35/2.29
%------------------------------------------------------------------------------