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

% Computer : n014.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:42 EDT 2022

% Result   : Theorem 7.75s 2.39s
% Output   : CNFRefutation 7.75s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   11
% Syntax   : Number of clauses     :   36 (  12 unt;   6 nHn;  30 RR)
%            Number of literals    :   66 (   8 equ;  28 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    7 (   5 usr;   1 prp; 0-3 aty)
%            Number of functors    :    9 (   9 usr;   4 con; 0-2 aty)
%            Number of variables   :   43 (   6 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_61,plain,
    ( leaf_occ(esk15_1(X1),X1)
    | ~ occurrence_of(X1,tptp0) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7thdttj6/input.p',i_0_61) ).

cnf(i_0_96,negated_conjecture,
    occurrence_of(esk16_0,tptp0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7thdttj6/input.p',i_0_96) ).

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

cnf(i_0_37,plain,
    ( occurrence_of(X1,esk9_2(X2,X1))
    | ~ leaf_occ(X2,X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7thdttj6/input.p',i_0_37) ).

cnf(i_0_92,negated_conjecture,
    ( occurrence_of(X1,tptp1)
    | min_precedes(X2,esk18_2(X2,X1),tptp0)
    | ~ leaf_occ(X1,esk16_0) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7thdttj6/input.p',i_0_92) ).

cnf(i_0_83,negated_conjecture,
    ( occurrence_of(X1,tptp2)
    | min_precedes(X2,esk17_2(X2,X1),tptp0)
    | ~ leaf_occ(X1,esk16_0) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7thdttj6/input.p',i_0_83) ).

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

cnf(i_0_35,plain,
    ( leaf(X1,esk9_2(X1,X2))
    | ~ leaf_occ(X1,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7thdttj6/input.p',i_0_35) ).

cnf(i_0_20,plain,
    ( occurrence_of(X1,esk5_1(X1))
    | ~ activity_occurrence(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7thdttj6/input.p',i_0_20) ).

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

cnf(i_0_79,plain,
    tptp2 != tptp1,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7thdttj6/input.p',i_0_79) ).

cnf(c_0_108,plain,
    ( leaf_occ(esk15_1(X1),X1)
    | ~ occurrence_of(X1,tptp0) ),
    i_0_61 ).

cnf(c_0_109,negated_conjecture,
    occurrence_of(esk16_0,tptp0),
    i_0_96 ).

cnf(c_0_110,plain,
    ( X1 = X2
    | ~ occurrence_of(X3,X2)
    | ~ occurrence_of(X3,X1) ),
    i_0_15 ).

cnf(c_0_111,plain,
    ( occurrence_of(X1,esk9_2(X2,X1))
    | ~ leaf_occ(X2,X1) ),
    i_0_37 ).

cnf(c_0_112,negated_conjecture,
    leaf_occ(esk15_1(esk16_0),esk16_0),
    inference(spm,[status(thm)],[c_0_108,c_0_109]) ).

cnf(c_0_113,negated_conjecture,
    ( occurrence_of(X1,tptp1)
    | min_precedes(X2,esk18_2(X2,X1),tptp0)
    | ~ leaf_occ(X1,esk16_0) ),
    i_0_92 ).

cnf(c_0_114,negated_conjecture,
    ( X1 = tptp0
    | ~ occurrence_of(esk16_0,X1) ),
    inference(spm,[status(thm)],[c_0_110,c_0_109]) ).

cnf(c_0_115,plain,
    occurrence_of(esk16_0,esk9_2(esk15_1(esk16_0),esk16_0)),
    inference(spm,[status(thm)],[c_0_111,c_0_112]) ).

cnf(c_0_116,negated_conjecture,
    ( occurrence_of(X1,tptp2)
    | min_precedes(X2,esk17_2(X2,X1),tptp0)
    | ~ leaf_occ(X1,esk16_0) ),
    i_0_83 ).

cnf(c_0_117,plain,
    ( ~ leaf(X1,X2)
    | ~ min_precedes(X1,X3,X2) ),
    i_0_29 ).

cnf(c_0_118,negated_conjecture,
    ( min_precedes(X1,esk18_2(X1,esk15_1(esk16_0)),tptp0)
    | occurrence_of(esk15_1(esk16_0),tptp1) ),
    inference(spm,[status(thm)],[c_0_113,c_0_112]) ).

cnf(c_0_119,plain,
    ( leaf(X1,esk9_2(X1,X2))
    | ~ leaf_occ(X1,X2) ),
    i_0_35 ).

cnf(c_0_120,negated_conjecture,
    esk9_2(esk15_1(esk16_0),esk16_0) = tptp0,
    inference(spm,[status(thm)],[c_0_114,c_0_115]) ).

cnf(c_0_121,negated_conjecture,
    ( min_precedes(X1,esk17_2(X1,esk15_1(esk16_0)),tptp0)
    | occurrence_of(esk15_1(esk16_0),tptp2) ),
    inference(spm,[status(thm)],[c_0_116,c_0_112]) ).

cnf(c_0_122,plain,
    ( occurrence_of(X1,esk5_1(X1))
    | ~ activity_occurrence(X1) ),
    i_0_20 ).

cnf(c_0_123,plain,
    ( activity_occurrence(X1)
    | ~ occurrence_of(X1,X2) ),
    i_0_5 ).

cnf(c_0_124,plain,
    ( occurrence_of(esk15_1(esk16_0),tptp1)
    | ~ leaf(X1,tptp0) ),
    inference(spm,[status(thm)],[c_0_117,c_0_118]) ).

cnf(c_0_125,plain,
    leaf(esk15_1(esk16_0),tptp0),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_119,c_0_112]),c_0_120]) ).

cnf(c_0_126,plain,
    ( occurrence_of(esk15_1(esk16_0),tptp2)
    | ~ leaf(X1,tptp0) ),
    inference(spm,[status(thm)],[c_0_117,c_0_121]) ).

cnf(c_0_127,plain,
    ( X1 = esk5_1(X2)
    | ~ occurrence_of(X2,X1) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_110,c_0_122]),c_0_123]) ).

cnf(c_0_128,plain,
    occurrence_of(esk15_1(esk16_0),tptp1),
    inference(spm,[status(thm)],[c_0_124,c_0_125]) ).

cnf(c_0_129,plain,
    occurrence_of(esk15_1(esk16_0),tptp2),
    inference(spm,[status(thm)],[c_0_126,c_0_125]) ).

cnf(c_0_130,plain,
    esk5_1(esk15_1(esk16_0)) = tptp1,
    inference(spm,[status(thm)],[c_0_127,c_0_128]) ).

cnf(c_0_131,plain,
    tptp2 != tptp1,
    i_0_79 ).

cnf(c_0_132,plain,
    $false,
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_127,c_0_129]),c_0_130]),c_0_131]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : PRO011+4 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.34  % Computer : n014.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Mon Jun 13 03:23:39 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.19/0.45  # ENIGMATIC: Selected complete mode:
% 7.75/2.39  # ENIGMATIC: Solved by autoschedule:
% 7.75/2.39  # No SInE strategy applied
% 7.75/2.39  # Trying AutoSched0 for 150 seconds
% 7.75/2.39  # AutoSched0-Mode selected heuristic G_E___008_C18_F1_PI_SE_CS_SP_CO_S4S
% 7.75/2.39  # and selection function SelectNewComplexAHPNS.
% 7.75/2.39  #
% 7.75/2.39  # Preprocessing time       : 0.025 s
% 7.75/2.39  
% 7.75/2.39  # Proof found!
% 7.75/2.39  # SZS status Theorem
% 7.75/2.39  # SZS output start CNFRefutation
% See solution above
% 7.75/2.39  # Training examples: 0 positive, 0 negative
% 7.75/2.39  
% 7.75/2.39  # -------------------------------------------------
% 7.75/2.39  # User time                : 0.041 s
% 7.75/2.39  # System time              : 0.008 s
% 7.75/2.39  # Total time               : 0.049 s
% 7.75/2.39  # Maximum resident set size: 7124 pages
% 7.75/2.39  
%------------------------------------------------------------------------------