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

View Problem - Process Solution

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

% Computer : n011.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:23 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_7,negated_conjecture,
    ~ big_i(esk1_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-bmne0hds/input.p',i_0_7) ).

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

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

cnf(i_0_6,plain,
    ( big_f(X1)
    | big_g(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-bmne0hds/input.p',i_0_6) ).

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

cnf(c_0_13,negated_conjecture,
    ~ big_i(esk1_0),
    i_0_7 ).

cnf(c_0_14,plain,
    ( big_h(X1)
    | big_i(X1) ),
    i_0_3 ).

cnf(c_0_15,plain,
    ( ~ big_g(X1)
    | ~ big_h(X1) ),
    i_0_1 ).

cnf(c_0_16,plain,
    ( big_f(X1)
    | big_g(X1) ),
    i_0_6 ).

cnf(c_0_17,plain,
    ( ~ big_f(X1)
    | ~ big_h(X1) ),
    i_0_2 ).

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

cnf(c_0_19,plain,
    ~ big_h(X1),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]) ).

cnf(c_0_20,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[c_0_18,c_0_19]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : SYN060+1 : TPTP v8.1.0. Released v2.0.0.
% 0.03/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n011.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 : Tue Jul 12 06:03:59 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.44  # ENIGMATIC: Selected complete mode:
% 7.40/2.33  # ENIGMATIC: Solved by autoschedule:
% 7.40/2.33  # No SInE strategy applied
% 7.40/2.33  # Trying AutoSched0 for 150 seconds
% 7.40/2.33  # AutoSched0-Mode selected heuristic G_E___200_B07_F1_AE_CS_SP_PI_S0Y
% 7.40/2.33  # and selection function SelectMaxLComplexAvoidPosPred.
% 7.40/2.33  #
% 7.40/2.33  # Preprocessing time       : 0.015 s
% 7.40/2.33  
% 7.40/2.33  # Proof found!
% 7.40/2.33  # SZS status Theorem
% 7.40/2.33  # SZS output start CNFRefutation
% See solution above
% 7.40/2.33  # Training examples: 0 positive, 0 negative
% 7.40/2.33  
% 7.40/2.33  # -------------------------------------------------
% 7.40/2.33  # User time                : 0.016 s
% 7.40/2.33  # System time              : 0.003 s
% 7.40/2.33  # Total time               : 0.019 s
% 7.40/2.33  # Maximum resident set size: 7116 pages
% 7.40/2.33  
%------------------------------------------------------------------------------