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

View Problem - Process Solution

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

% Computer : n004.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 : Thu Jul 21 04:49:24 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_4,plain,
    ( big_h(X1)
    | ~ big_k(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-x8r_9j1r/input.p',i_0_4) ).

cnf(i_0_6,negated_conjecture,
    big_k(esk1_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-x8r_9j1r/input.p',i_0_6) ).

cnf(i_0_5,negated_conjecture,
    ~ big_j(esk1_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-x8r_9j1r/input.p',i_0_5) ).

cnf(i_0_3,plain,
    ( big_j(X1)
    | ~ big_h(X1)
    | ~ big_i(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-x8r_9j1r/input.p',i_0_3) ).

cnf(i_0_1,plain,
    ( big_i(X1)
    | ~ big_f(X1)
    | ~ big_h(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-x8r_9j1r/input.p',i_0_1) ).

cnf(i_0_7,negated_conjecture,
    big_f(esk1_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-x8r_9j1r/input.p',i_0_7) ).

cnf(c_0_14,plain,
    ( big_h(X1)
    | ~ big_k(X1) ),
    i_0_4 ).

cnf(c_0_15,negated_conjecture,
    big_k(esk1_0),
    i_0_6 ).

cnf(c_0_16,negated_conjecture,
    ~ big_j(esk1_0),
    i_0_5 ).

cnf(c_0_17,plain,
    ( big_j(X1)
    | ~ big_h(X1)
    | ~ big_i(X1) ),
    i_0_3 ).

cnf(c_0_18,negated_conjecture,
    big_h(esk1_0),
    inference(spm,[status(thm)],[c_0_14,c_0_15]) ).

cnf(c_0_19,plain,
    ( big_i(X1)
    | ~ big_f(X1)
    | ~ big_h(X1) ),
    i_0_1 ).

cnf(c_0_20,negated_conjecture,
    big_f(esk1_0),
    i_0_7 ).

cnf(c_0_21,negated_conjecture,
    ~ big_i(esk1_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]) ).

cnf(c_0_22,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_18])]),c_0_21]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.09  % Problem  : SYN062+1 : TPTP v8.1.0. Released v2.0.0.
% 0.02/0.09  % Command  : enigmatic-eprover.py %s %d 1
% 0.08/0.29  % Computer : n004.cluster.edu
% 0.08/0.29  % Model    : x86_64 x86_64
% 0.08/0.29  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.29  % Memory   : 8042.1875MB
% 0.08/0.29  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.08/0.29  % CPULimit : 300
% 0.08/0.29  % WCLimit  : 600
% 0.08/0.29  % DateTime : Mon Jul 11 19:24:24 EDT 2022
% 0.08/0.29  % CPUTime  : 
% 0.13/0.38  # ENIGMATIC: Selected complete mode:
% 10.39/2.81  # ENIGMATIC: Solved by autoschedule:
% 10.39/2.81  # No SInE strategy applied
% 10.39/2.81  # Trying AutoSched0 for 150 seconds
% 10.39/2.81  # AutoSched0-Mode selected heuristic G_E___200_C45_F1_SE_CS_SP_PI_CO_S0V
% 10.39/2.81  # and selection function PSelectComplexExceptRRHorn.
% 10.39/2.81  #
% 10.39/2.81  # Preprocessing time       : 0.023 s
% 10.39/2.81  
% 10.39/2.81  # Proof found!
% 10.39/2.81  # SZS status Theorem
% 10.39/2.81  # SZS output start CNFRefutation
% See solution above
% 10.39/2.81  # Training examples: 0 positive, 0 negative
% 10.39/2.81  
% 10.39/2.81  # -------------------------------------------------
% 10.39/2.81  # User time                : 0.024 s
% 10.39/2.81  # System time              : 0.004 s
% 10.39/2.81  # Total time               : 0.028 s
% 10.39/2.81  # Maximum resident set size: 7120 pages
% 10.39/2.81  
%------------------------------------------------------------------------------