TSTP Solution File: PRO018+1 by Enigma---0.5.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : PRO018+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : enigmatic-eprover.py %s %d 1

% Computer : n007.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:47 EDT 2022

% Result   : Theorem 16.20s 3.55s
% Output   : CNFRefutation 16.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :   24
% Syntax   : Number of clauses     :   87 (  33 unt;  26 nHn;  87 RR)
%            Number of literals    :  190 (  26 equ;  83 neg)
%            Maximal clause size   :    7 (   2 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :   11 (   9 usr;   1 prp; 0-3 aty)
%            Number of functors    :   13 (  13 usr;   7 con; 0-3 aty)
%            Number of variables   :   84 (   8 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-6qj9ek1e/input.p',i_0_72) ).

cnf(i_0_106,negated_conjecture,
    subactivity_occurrence(esk19_0,esk20_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6qj9ek1e/input.p',i_0_106) ).

cnf(i_0_107,negated_conjecture,
    occurrence_of(esk20_0,tptp0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6qj9ek1e/input.p',i_0_107) ).

cnf(i_0_105,negated_conjecture,
    arboreal(esk19_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6qj9ek1e/input.p',i_0_105) ).

cnf(i_0_104,negated_conjecture,
    ~ leaf_occ(esk19_0,esk20_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6qj9ek1e/input.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-6qj9ek1e/input.p',i_0_39) ).

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-6qj9ek1e/input.p',i_0_73) ).

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-6qj9ek1e/input.p',i_0_46) ).

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-6qj9ek1e/input.p',i_0_48) ).

cnf(i_0_10,plain,
    ( arboreal(X1)
    | ~ atomic(X2)
    | ~ occurrence_of(X1,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6qj9ek1e/input.p',i_0_10) ).

cnf(i_0_79,plain,
    atomic(tptp3),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6qj9ek1e/input.p',i_0_79) ).

cnf(i_0_64,plain,
    ( leaf(X1,esk15_2(X1,X2))
    | ~ leaf_occ(X1,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6qj9ek1e/input.p',i_0_64) ).

cnf(i_0_5,plain,
    ( X1 = X2
    | ~ occurrence_of(X3,X2)
    | ~ occurrence_of(X3,X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6qj9ek1e/input.p',i_0_5) ).

cnf(i_0_66,plain,
    ( occurrence_of(X1,esk15_2(X2,X1))
    | ~ leaf_occ(X2,X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6qj9ek1e/input.p',i_0_66) ).

cnf(i_0_34,plain,
    ( ~ leaf(X1,X2)
    | ~ min_precedes(X1,X3,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6qj9ek1e/input.p',i_0_34) ).

cnf(i_0_70,plain,
    ( leaf_occ(X1,X2)
    | min_precedes(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-6qj9ek1e/input.p',i_0_70) ).

cnf(i_0_3,plain,
    ( occurrence_of(X1,esk1_1(X1))
    | ~ activity_occurrence(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6qj9ek1e/input.p',i_0_3) ).

cnf(i_0_67,plain,
    ( X1 = esk17_1(X2)
    | X1 = esk18_1(X2)
    | leaf_occ(X2,X3)
    | ~ arboreal(X2)
    | ~ subactivity_occurrence(X2,X3)
    | ~ occurrence_of(X3,tptp0)
    | ~ min_precedes(esk16_1(X2),X1,tptp0) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6qj9ek1e/input.p',i_0_67) ).

cnf(i_0_71,plain,
    ( leaf_occ(X1,X2)
    | occurrence_of(esk17_1(X1),tptp4)
    | ~ arboreal(X1)
    | ~ subactivity_occurrence(X1,X2)
    | ~ occurrence_of(X2,tptp0) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6qj9ek1e/input.p',i_0_71) ).

cnf(i_0_1,plain,
    ( activity_occurrence(X1)
    | ~ occurrence_of(X1,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6qj9ek1e/input.p',i_0_1) ).

cnf(i_0_69,plain,
    ( leaf_occ(X1,X2)
    | occurrence_of(esk18_1(X1),tptp1)
    | occurrence_of(esk18_1(X1),tptp2)
    | ~ arboreal(X1)
    | ~ subactivity_occurrence(X1,X2)
    | ~ occurrence_of(X2,tptp0) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6qj9ek1e/input.p',i_0_69) ).

cnf(i_0_80,plain,
    tptp4 != tptp3,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6qj9ek1e/input.p',i_0_80) ).

cnf(i_0_84,plain,
    tptp2 != tptp3,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6qj9ek1e/input.p',i_0_84) ).

cnf(i_0_83,plain,
    tptp1 != tptp3,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6qj9ek1e/input.p',i_0_83) ).

cnf(c_0_132,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_133,negated_conjecture,
    subactivity_occurrence(esk19_0,esk20_0),
    i_0_106 ).

cnf(c_0_134,negated_conjecture,
    occurrence_of(esk20_0,tptp0),
    i_0_107 ).

cnf(c_0_135,negated_conjecture,
    arboreal(esk19_0),
    i_0_105 ).

cnf(c_0_136,negated_conjecture,
    ~ leaf_occ(esk19_0,esk20_0),
    i_0_104 ).

cnf(c_0_137,plain,
    ( min_precedes(X1,X2,X3)
    | ~ next_subocc(X1,X2,X3) ),
    i_0_39 ).

cnf(c_0_138,negated_conjecture,
    next_subocc(esk19_0,esk16_1(esk19_0),tptp0),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_132,c_0_133]),c_0_134]),c_0_135])]),c_0_136]) ).

cnf(c_0_139,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_140,plain,
    ( subactivity_occurrence(X1,esk10_3(X2,X3,X1))
    | ~ min_precedes(X3,X1,X2) ),
    i_0_46 ).

cnf(c_0_141,plain,
    min_precedes(esk19_0,esk16_1(esk19_0),tptp0),
    inference(spm,[status(thm)],[c_0_137,c_0_138]) ).

cnf(c_0_142,plain,
    ( occurrence_of(esk10_3(X1,X2,X3),X1)
    | ~ min_precedes(X2,X3,X1) ),
    i_0_48 ).

cnf(c_0_143,plain,
    ( arboreal(X1)
    | ~ atomic(X2)
    | ~ occurrence_of(X1,X2) ),
    i_0_10 ).

cnf(c_0_144,negated_conjecture,
    occurrence_of(esk16_1(esk19_0),tptp3),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_139,c_0_133]),c_0_134]),c_0_135])]),c_0_136]) ).

cnf(c_0_145,plain,
    atomic(tptp3),
    i_0_79 ).

cnf(c_0_146,plain,
    subactivity_occurrence(esk16_1(esk19_0),esk10_3(tptp0,esk19_0,esk16_1(esk19_0))),
    inference(spm,[status(thm)],[c_0_140,c_0_141]) ).

cnf(c_0_147,plain,
    occurrence_of(esk10_3(tptp0,esk19_0,esk16_1(esk19_0)),tptp0),
    inference(spm,[status(thm)],[c_0_142,c_0_141]) ).

cnf(c_0_148,plain,
    arboreal(esk16_1(esk19_0)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_143,c_0_144]),c_0_145])]) ).

cnf(c_0_149,plain,
    ( next_subocc(esk16_1(esk19_0),esk16_1(esk16_1(esk19_0)),tptp0)
    | leaf_occ(esk16_1(esk19_0),esk10_3(tptp0,esk19_0,esk16_1(esk19_0))) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_132,c_0_146]),c_0_147]),c_0_148])]) ).

cnf(c_0_150,plain,
    ( leaf(X1,esk15_2(X1,X2))
    | ~ leaf_occ(X1,X2) ),
    i_0_64 ).

cnf(c_0_151,plain,
    ( leaf_occ(esk16_1(esk19_0),esk10_3(tptp0,esk19_0,esk16_1(esk19_0)))
    | occurrence_of(esk16_1(esk16_1(esk19_0)),tptp3) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_139,c_0_146]),c_0_147]),c_0_148])]) ).

cnf(c_0_152,plain,
    ( X1 = X2
    | ~ occurrence_of(X3,X2)
    | ~ occurrence_of(X3,X1) ),
    i_0_5 ).

cnf(c_0_153,plain,
    ( occurrence_of(X1,esk15_2(X2,X1))
    | ~ leaf_occ(X2,X1) ),
    i_0_66 ).

cnf(c_0_154,plain,
    ( min_precedes(esk16_1(esk19_0),esk16_1(esk16_1(esk19_0)),tptp0)
    | leaf_occ(esk16_1(esk19_0),esk10_3(tptp0,esk19_0,esk16_1(esk19_0))) ),
    inference(spm,[status(thm)],[c_0_137,c_0_149]) ).

cnf(c_0_155,plain,
    ( ~ leaf(X1,X2)
    | ~ min_precedes(X1,X3,X2) ),
    i_0_34 ).

cnf(c_0_156,plain,
    ( leaf(esk16_1(esk19_0),esk15_2(esk16_1(esk19_0),esk10_3(tptp0,esk19_0,esk16_1(esk19_0))))
    | occurrence_of(esk16_1(esk16_1(esk19_0)),tptp3) ),
    inference(spm,[status(thm)],[c_0_150,c_0_151]) ).

cnf(c_0_157,plain,
    ( X1 = tptp0
    | ~ occurrence_of(esk10_3(tptp0,esk19_0,esk16_1(esk19_0)),X1) ),
    inference(spm,[status(thm)],[c_0_152,c_0_147]) ).

cnf(c_0_158,plain,
    ( occurrence_of(esk10_3(tptp0,esk19_0,esk16_1(esk19_0)),esk15_2(esk16_1(esk19_0),esk10_3(tptp0,esk19_0,esk16_1(esk19_0))))
    | occurrence_of(esk16_1(esk16_1(esk19_0)),tptp3) ),
    inference(spm,[status(thm)],[c_0_153,c_0_151]) ).

cnf(c_0_159,plain,
    ( min_precedes(esk16_1(esk19_0),esk16_1(esk16_1(esk19_0)),tptp0)
    | leaf(esk16_1(esk19_0),esk15_2(esk16_1(esk19_0),esk10_3(tptp0,esk19_0,esk16_1(esk19_0)))) ),
    inference(spm,[status(thm)],[c_0_150,c_0_154]) ).

cnf(c_0_160,plain,
    ( min_precedes(esk16_1(esk19_0),esk16_1(esk16_1(esk19_0)),tptp0)
    | occurrence_of(esk10_3(tptp0,esk19_0,esk16_1(esk19_0)),esk15_2(esk16_1(esk19_0),esk10_3(tptp0,esk19_0,esk16_1(esk19_0)))) ),
    inference(spm,[status(thm)],[c_0_153,c_0_154]) ).

cnf(c_0_161,plain,
    ( occurrence_of(esk16_1(esk16_1(esk19_0)),tptp3)
    | ~ min_precedes(esk16_1(esk19_0),X1,esk15_2(esk16_1(esk19_0),esk10_3(tptp0,esk19_0,esk16_1(esk19_0)))) ),
    inference(spm,[status(thm)],[c_0_155,c_0_156]) ).

cnf(c_0_162,plain,
    ( esk15_2(esk16_1(esk19_0),esk10_3(tptp0,esk19_0,esk16_1(esk19_0))) = tptp0
    | occurrence_of(esk16_1(esk16_1(esk19_0)),tptp3) ),
    inference(spm,[status(thm)],[c_0_157,c_0_158]) ).

cnf(c_0_163,plain,
    ( leaf_occ(X1,X2)
    | min_precedes(esk16_1(X1),esk17_1(X1),tptp0)
    | ~ arboreal(X1)
    | ~ subactivity_occurrence(X1,X2)
    | ~ occurrence_of(X2,tptp0) ),
    i_0_70 ).

cnf(c_0_164,plain,
    ( min_precedes(esk16_1(esk19_0),esk16_1(esk16_1(esk19_0)),tptp0)
    | ~ min_precedes(esk16_1(esk19_0),X1,esk15_2(esk16_1(esk19_0),esk10_3(tptp0,esk19_0,esk16_1(esk19_0)))) ),
    inference(spm,[status(thm)],[c_0_155,c_0_159]) ).

cnf(c_0_165,plain,
    ( esk15_2(esk16_1(esk19_0),esk10_3(tptp0,esk19_0,esk16_1(esk19_0))) = tptp0
    | min_precedes(esk16_1(esk19_0),esk16_1(esk16_1(esk19_0)),tptp0) ),
    inference(spm,[status(thm)],[c_0_157,c_0_160]) ).

cnf(c_0_166,plain,
    ( occurrence_of(X1,esk1_1(X1))
    | ~ activity_occurrence(X1) ),
    i_0_3 ).

cnf(c_0_167,plain,
    ( occurrence_of(esk16_1(esk16_1(esk19_0)),tptp3)
    | ~ min_precedes(esk16_1(esk19_0),X1,tptp0) ),
    inference(spm,[status(thm)],[c_0_161,c_0_162]) ).

cnf(c_0_168,negated_conjecture,
    min_precedes(esk16_1(esk19_0),esk17_1(esk19_0),tptp0),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_163,c_0_133]),c_0_134]),c_0_135])]),c_0_136]) ).

cnf(c_0_169,plain,
    ( X1 = esk17_1(X2)
    | X1 = esk18_1(X2)
    | leaf_occ(X2,X3)
    | ~ arboreal(X2)
    | ~ subactivity_occurrence(X2,X3)
    | ~ occurrence_of(X3,tptp0)
    | ~ min_precedes(esk16_1(X2),X1,tptp0) ),
    i_0_67 ).

cnf(c_0_170,plain,
    ( min_precedes(esk16_1(esk19_0),esk16_1(esk16_1(esk19_0)),tptp0)
    | ~ min_precedes(esk16_1(esk19_0),X1,tptp0) ),
    inference(spm,[status(thm)],[c_0_164,c_0_165]) ).

cnf(c_0_171,plain,
    ( leaf_occ(X1,X2)
    | occurrence_of(esk17_1(X1),tptp4)
    | ~ arboreal(X1)
    | ~ subactivity_occurrence(X1,X2)
    | ~ occurrence_of(X2,tptp0) ),
    i_0_71 ).

cnf(c_0_172,plain,
    ( X1 = esk1_1(X2)
    | ~ activity_occurrence(X2)
    | ~ occurrence_of(X2,X1) ),
    inference(spm,[status(thm)],[c_0_152,c_0_166]) ).

cnf(c_0_173,negated_conjecture,
    occurrence_of(esk16_1(esk16_1(esk19_0)),tptp3),
    inference(spm,[status(thm)],[c_0_167,c_0_168]) ).

cnf(c_0_174,plain,
    ( activity_occurrence(X1)
    | ~ occurrence_of(X1,X2) ),
    i_0_1 ).

cnf(c_0_175,negated_conjecture,
    ( X1 = esk17_1(esk19_0)
    | X1 = esk18_1(esk19_0)
    | ~ min_precedes(esk16_1(esk19_0),X1,tptp0) ),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_169,c_0_133]),c_0_134]),c_0_135])]),c_0_136]) ).

cnf(c_0_176,negated_conjecture,
    min_precedes(esk16_1(esk19_0),esk16_1(esk16_1(esk19_0)),tptp0),
    inference(spm,[status(thm)],[c_0_170,c_0_168]) ).

cnf(c_0_177,negated_conjecture,
    occurrence_of(esk17_1(esk19_0),tptp4),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_171,c_0_133]),c_0_134]),c_0_135])]),c_0_136]) ).

cnf(c_0_178,plain,
    ( esk1_1(esk16_1(esk16_1(esk19_0))) = tptp3
    | ~ activity_occurrence(esk16_1(esk16_1(esk19_0))) ),
    inference(spm,[status(thm)],[c_0_172,c_0_173]) ).

cnf(c_0_179,plain,
    activity_occurrence(esk16_1(esk16_1(esk19_0))),
    inference(spm,[status(thm)],[c_0_174,c_0_173]) ).

cnf(c_0_180,negated_conjecture,
    ( esk16_1(esk16_1(esk19_0)) = esk17_1(esk19_0)
    | esk16_1(esk16_1(esk19_0)) = esk18_1(esk19_0) ),
    inference(spm,[status(thm)],[c_0_175,c_0_176]) ).

cnf(c_0_181,negated_conjecture,
    activity_occurrence(esk17_1(esk19_0)),
    inference(spm,[status(thm)],[c_0_174,c_0_177]) ).

cnf(c_0_182,plain,
    ( leaf_occ(X1,X2)
    | occurrence_of(esk18_1(X1),tptp1)
    | occurrence_of(esk18_1(X1),tptp2)
    | ~ arboreal(X1)
    | ~ subactivity_occurrence(X1,X2)
    | ~ occurrence_of(X2,tptp0) ),
    i_0_69 ).

cnf(c_0_183,plain,
    esk1_1(esk16_1(esk16_1(esk19_0))) = tptp3,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_178,c_0_179])]) ).

cnf(c_0_184,negated_conjecture,
    ( esk16_1(esk16_1(esk19_0)) = esk17_1(esk19_0)
    | occurrence_of(esk18_1(esk19_0),tptp3) ),
    inference(spm,[status(thm)],[c_0_173,c_0_180]) ).

cnf(c_0_185,negated_conjecture,
    esk1_1(esk17_1(esk19_0)) = tptp4,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_172,c_0_177]),c_0_181])]) ).

cnf(c_0_186,plain,
    tptp4 != tptp3,
    i_0_80 ).

cnf(c_0_187,negated_conjecture,
    ( occurrence_of(esk18_1(esk19_0),tptp1)
    | occurrence_of(esk18_1(esk19_0),tptp2) ),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_182,c_0_133]),c_0_134]),c_0_135])]),c_0_136]) ).

cnf(c_0_188,plain,
    occurrence_of(esk18_1(esk19_0),tptp3),
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_183,c_0_184]),c_0_185]),c_0_186]) ).

cnf(c_0_189,plain,
    ( X1 = tptp2
    | occurrence_of(esk18_1(esk19_0),tptp1)
    | ~ occurrence_of(esk18_1(esk19_0),X1) ),
    inference(spm,[status(thm)],[c_0_152,c_0_187]) ).

cnf(c_0_190,plain,
    tptp2 != tptp3,
    i_0_84 ).

cnf(c_0_191,plain,
    ( X1 = tptp3
    | ~ occurrence_of(esk18_1(esk19_0),X1) ),
    inference(spm,[status(thm)],[c_0_152,c_0_188]) ).

cnf(c_0_192,plain,
    occurrence_of(esk18_1(esk19_0),tptp1),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_189,c_0_188]),c_0_190]) ).

cnf(c_0_193,plain,
    tptp1 != tptp3,
    i_0_83 ).

cnf(c_0_194,plain,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_191,c_0_192]),c_0_193]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : PRO018+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.35  % Computer : n007.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 600
% 0.13/0.35  % DateTime : Mon Jun 13 01:32:55 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.19/0.46  # ENIGMATIC: Selected complete mode:
% 16.20/3.55  # ENIGMATIC: Solved by Enigma+tptp-cade20-model03-h2e15+lgb-t150-d30-l6400-e0.15+coop-eprover66:
% 16.20/3.55  # ENIGMA: LightGBM model '/export/starexec/sandbox/solver/bin/data/Enigma/tptp-cade20-model03-h2e15/lgb-t150-d30-l6400-e0.15/model.lgb' loaded. (hash_base: 32768; conj_feats: 68; version: 991; iters: 150)
% 16.20/3.55  # Preprocessing time       : 0.884 s
% 16.20/3.55  # Presaturation interreduction done
% 16.20/3.55  
% 16.20/3.55  # Proof found!
% 16.20/3.55  # SZS status Theorem
% 16.20/3.55  # SZS output start CNFRefutation
% See solution above
% 16.20/3.55  # Training examples: 0 positive, 0 negative
% 16.20/3.55  
% 16.20/3.55  # -------------------------------------------------
% 16.20/3.55  # User time                : 0.857 s
% 16.20/3.55  # System time              : 0.128 s
% 16.20/3.55  # Total time               : 0.985 s
% 16.20/3.55  # ...preprocessing         : 0.884 s
% 16.20/3.55  # ...main loop             : 0.101 s
% 16.20/3.55  # Maximum resident set size: 167036 pages
% 16.20/3.55  
%------------------------------------------------------------------------------