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

View Problem - Process Solution

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

% Computer : n013.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 : Sun Jul 17 22:39:50 EDT 2022

% Result   : Theorem 7.46s 2.32s
% Output   : CNFRefutation 7.46s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   21 (   8 unt;   2 nHn;  21 RR)
%            Number of literals    :   45 (   4 equ;  28 neg)
%            Maximal clause size   :    4 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   6 con; 0-1 aty)
%            Number of variables   :   15 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_8,plain,
    ( X1 = dci
    | ~ dive(X2)
    | ~ bad(X1)
    | ~ outcome(X2,X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xnpzhdch/lgb.p',i_0_8) ).

cnf(i_0_11,negated_conjecture,
    bad(esk2_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xnpzhdch/lgb.p',i_0_11) ).

cnf(i_0_12,negated_conjecture,
    outcome(esk1_0,esk2_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xnpzhdch/lgb.p',i_0_12) ).

cnf(i_0_13,negated_conjecture,
    dive(esk1_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xnpzhdch/lgb.p',i_0_13) ).

cnf(i_0_2,plain,
    ( greater(depth(X1),depth_limit)
    | greater(time(X1),time_limit)
    | ~ dive(X1)
    | ~ greater(nitrogen(X1),nitrogen_limit) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xnpzhdch/lgb.p',i_0_2) ).

cnf(i_0_9,plain,
    ( ~ dive(X1)
    | ~ greater(time(X1),time_limit) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xnpzhdch/lgb.p',i_0_9) ).

cnf(i_0_10,plain,
    ( ~ dive(X1)
    | ~ greater(depth(X1),depth_limit) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xnpzhdch/lgb.p',i_0_10) ).

cnf(i_0_5,plain,
    ( greater(nitrogen(X1),nitrogen_limit)
    | ~ dive(X1)
    | ~ outcome(X1,dci) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xnpzhdch/lgb.p',i_0_5) ).

cnf(c_0_22,plain,
    ( X1 = dci
    | ~ dive(X2)
    | ~ bad(X1)
    | ~ outcome(X2,X1) ),
    i_0_8 ).

cnf(c_0_23,negated_conjecture,
    bad(esk2_0),
    i_0_11 ).

cnf(c_0_24,negated_conjecture,
    ( dci = esk2_0
    | ~ dive(X1)
    | ~ outcome(X1,esk2_0) ),
    inference(spm,[status(thm)],[c_0_22,c_0_23]) ).

cnf(c_0_25,negated_conjecture,
    outcome(esk1_0,esk2_0),
    i_0_12 ).

cnf(c_0_26,negated_conjecture,
    dive(esk1_0),
    i_0_13 ).

cnf(c_0_27,plain,
    ( greater(depth(X1),depth_limit)
    | greater(time(X1),time_limit)
    | ~ dive(X1)
    | ~ greater(nitrogen(X1),nitrogen_limit) ),
    i_0_2 ).

cnf(c_0_28,plain,
    ( ~ dive(X1)
    | ~ greater(time(X1),time_limit) ),
    i_0_9 ).

cnf(c_0_29,plain,
    ( ~ dive(X1)
    | ~ greater(depth(X1),depth_limit) ),
    i_0_10 ).

cnf(c_0_30,plain,
    ( greater(nitrogen(X1),nitrogen_limit)
    | ~ dive(X1)
    | ~ outcome(X1,dci) ),
    i_0_5 ).

cnf(c_0_31,negated_conjecture,
    dci = esk2_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26])]) ).

cnf(c_0_32,plain,
    ( ~ dive(X1)
    | ~ greater(nitrogen(X1),nitrogen_limit) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_27,c_0_28]),c_0_29]) ).

cnf(c_0_33,plain,
    ( ~ dive(X1)
    | ~ outcome(X1,esk2_0) ),
    inference(csr,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_31]),c_0_32]) ).

cnf(c_0_34,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_25]),c_0_26])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : MSC017+1 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n013.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 : Fri Jul  1 16:01:46 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.44  # ENIGMATIC: Selected complete mode:
% 7.46/2.32  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.46/2.32  # No SInE strategy applied
% 7.46/2.32  # Trying AutoSched0 for 150 seconds
% 7.46/2.32  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S01BI
% 7.46/2.32  # and selection function PSelectMinOptimalNoXTypePred.
% 7.46/2.32  #
% 7.46/2.32  # Preprocessing time       : 0.023 s
% 7.46/2.32  # Presaturation interreduction done
% 7.46/2.32  
% 7.46/2.32  # Proof found!
% 7.46/2.32  # SZS status Theorem
% 7.46/2.32  # SZS output start CNFRefutation
% See solution above
% 7.46/2.32  # Training examples: 0 positive, 0 negative
% 7.46/2.32  
% 7.46/2.32  # -------------------------------------------------
% 7.46/2.32  # User time                : 0.025 s
% 7.46/2.32  # System time              : 0.005 s
% 7.46/2.32  # Total time               : 0.030 s
% 7.46/2.32  # Maximum resident set size: 7120 pages
% 7.46/2.32  
%------------------------------------------------------------------------------