TSTP Solution File: PRO012+2 by Enigma---0.5.1

View Problem - Process Solution

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

% Computer : n024.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.54s 2.29s
% Output   : CNFRefutation 7.54s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    9
% Syntax   : Number of clauses     :   28 (  10 unt;   3 nHn;  28 RR)
%            Number of literals    :   58 (   0 equ;  33 neg)
%            Maximal clause size   :    4 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :    8 (   8 usr;   5 con; 0-1 aty)
%            Number of variables   :   27 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_65,plain,
    ( min_precedes(esk16_1(X1),esk17_1(X1),tptp0)
    | ~ occurrence_of(X1,tptp0) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-rixhsnj4/lgb.p',i_0_65) ).

cnf(i_0_85,negated_conjecture,
    occurrence_of(esk18_0,tptp0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-rixhsnj4/lgb.p',i_0_85) ).

cnf(i_0_1,plain,
    ( min_precedes(X1,X2,X3)
    | ~ min_precedes(X4,X2,X3)
    | ~ min_precedes(X1,X4,X3) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-rixhsnj4/lgb.p',i_0_1) ).

cnf(i_0_67,plain,
    ( min_precedes(esk15_1(X1),esk16_1(X1),tptp0)
    | ~ occurrence_of(X1,tptp0) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-rixhsnj4/lgb.p',i_0_67) ).

cnf(i_0_69,plain,
    ( root_occ(esk15_1(X1),X1)
    | ~ occurrence_of(X1,tptp0) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-rixhsnj4/lgb.p',i_0_69) ).

cnf(i_0_70,plain,
    ( occurrence_of(esk15_1(X1),tptp3)
    | ~ occurrence_of(X1,tptp0) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-rixhsnj4/lgb.p',i_0_70) ).

cnf(i_0_66,plain,
    ( occurrence_of(esk17_1(X1),tptp2)
    | occurrence_of(esk17_1(X1),tptp1)
    | ~ occurrence_of(X1,tptp0) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-rixhsnj4/lgb.p',i_0_66) ).

cnf(i_0_84,negated_conjecture,
    ( ~ occurrence_of(X1,tptp3)
    | ~ occurrence_of(X2,tptp2)
    | ~ root_occ(X1,esk18_0)
    | ~ min_precedes(X1,X2,tptp0) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-rixhsnj4/lgb.p',i_0_84) ).

cnf(i_0_83,negated_conjecture,
    ( ~ occurrence_of(X1,tptp3)
    | ~ occurrence_of(X2,tptp1)
    | ~ root_occ(X1,esk18_0)
    | ~ min_precedes(X1,X2,tptp0) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-rixhsnj4/lgb.p',i_0_83) ).

cnf(c_0_95,plain,
    ( min_precedes(esk16_1(X1),esk17_1(X1),tptp0)
    | ~ occurrence_of(X1,tptp0) ),
    i_0_65 ).

cnf(c_0_96,negated_conjecture,
    occurrence_of(esk18_0,tptp0),
    i_0_85 ).

cnf(c_0_97,plain,
    ( min_precedes(X1,X2,X3)
    | ~ min_precedes(X4,X2,X3)
    | ~ min_precedes(X1,X4,X3) ),
    i_0_1 ).

cnf(c_0_98,negated_conjecture,
    min_precedes(esk16_1(esk18_0),esk17_1(esk18_0),tptp0),
    inference(spm,[status(thm)],[c_0_95,c_0_96]) ).

cnf(c_0_99,plain,
    ( min_precedes(esk15_1(X1),esk16_1(X1),tptp0)
    | ~ occurrence_of(X1,tptp0) ),
    i_0_67 ).

cnf(c_0_100,negated_conjecture,
    ( min_precedes(X1,esk17_1(esk18_0),tptp0)
    | ~ min_precedes(X1,esk16_1(esk18_0),tptp0) ),
    inference(spm,[status(thm)],[c_0_97,c_0_98]) ).

cnf(c_0_101,negated_conjecture,
    min_precedes(esk15_1(esk18_0),esk16_1(esk18_0),tptp0),
    inference(spm,[status(thm)],[c_0_99,c_0_96]) ).

cnf(c_0_102,plain,
    ( root_occ(esk15_1(X1),X1)
    | ~ occurrence_of(X1,tptp0) ),
    i_0_69 ).

cnf(c_0_103,plain,
    ( occurrence_of(esk15_1(X1),tptp3)
    | ~ occurrence_of(X1,tptp0) ),
    i_0_70 ).

cnf(c_0_104,plain,
    ( occurrence_of(esk17_1(X1),tptp2)
    | occurrence_of(esk17_1(X1),tptp1)
    | ~ occurrence_of(X1,tptp0) ),
    i_0_66 ).

cnf(c_0_105,negated_conjecture,
    ( ~ occurrence_of(X1,tptp3)
    | ~ occurrence_of(X2,tptp2)
    | ~ root_occ(X1,esk18_0)
    | ~ min_precedes(X1,X2,tptp0) ),
    i_0_84 ).

cnf(c_0_106,negated_conjecture,
    min_precedes(esk15_1(esk18_0),esk17_1(esk18_0),tptp0),
    inference(spm,[status(thm)],[c_0_100,c_0_101]) ).

cnf(c_0_107,negated_conjecture,
    root_occ(esk15_1(esk18_0),esk18_0),
    inference(spm,[status(thm)],[c_0_102,c_0_96]) ).

cnf(c_0_108,negated_conjecture,
    occurrence_of(esk15_1(esk18_0),tptp3),
    inference(spm,[status(thm)],[c_0_103,c_0_96]) ).

cnf(c_0_109,negated_conjecture,
    ( ~ occurrence_of(X1,tptp3)
    | ~ occurrence_of(X2,tptp1)
    | ~ root_occ(X1,esk18_0)
    | ~ min_precedes(X1,X2,tptp0) ),
    i_0_83 ).

cnf(c_0_110,negated_conjecture,
    ( occurrence_of(esk17_1(esk18_0),tptp1)
    | occurrence_of(esk17_1(esk18_0),tptp2) ),
    inference(spm,[status(thm)],[c_0_104,c_0_96]) ).

cnf(c_0_111,negated_conjecture,
    ~ occurrence_of(esk17_1(esk18_0),tptp2),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_105,c_0_106]),c_0_107]),c_0_108])]) ).

cnf(c_0_112,negated_conjecture,
    ~ occurrence_of(esk17_1(esk18_0),tptp1),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_109,c_0_106]),c_0_107]),c_0_108])]) ).

cnf(c_0_113,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_110,c_0_111]),c_0_112]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : PRO012+2 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n024.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Mon Jun 13 03:20:50 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.20/0.45  # ENIGMATIC: Selected complete mode:
% 7.54/2.29  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.54/2.29  # No SInE strategy applied
% 7.54/2.29  # Trying AutoSched0 for 150 seconds
% 7.54/2.29  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI
% 7.54/2.29  # and selection function SelectCQArNTNpEqFirst.
% 7.54/2.29  #
% 7.54/2.29  # Preprocessing time       : 0.024 s
% 7.54/2.29  # Presaturation interreduction done
% 7.54/2.29  
% 7.54/2.29  # Proof found!
% 7.54/2.29  # SZS status Theorem
% 7.54/2.29  # SZS output start CNFRefutation
% See solution above
% 7.54/2.29  # Training examples: 0 positive, 0 negative
% 7.54/2.29  
% 7.54/2.29  # -------------------------------------------------
% 7.54/2.29  # User time                : 0.038 s
% 7.54/2.29  # System time              : 0.004 s
% 7.54/2.29  # Total time               : 0.042 s
% 7.54/2.29  # Maximum resident set size: 7124 pages
% 7.54/2.29  
%------------------------------------------------------------------------------