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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : SYN413+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:52:07 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_2,negated_conjecture,
    ( f(X1,X1)
    | f(X1,esk1_1(X2))
    | ~ f(X1,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-51acwaea/lgb.p',i_0_2) ).

cnf(i_0_1,negated_conjecture,
    f(X1,esk2_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-51acwaea/lgb.p',i_0_1) ).

cnf(i_0_3,negated_conjecture,
    ( ~ f(X1,X1)
    | ~ f(X1,esk1_1(X2)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-51acwaea/lgb.p',i_0_3) ).

cnf(c_0_7,negated_conjecture,
    ( f(X1,X1)
    | f(X1,esk1_1(X2))
    | ~ f(X1,X2) ),
    i_0_2 ).

cnf(c_0_8,negated_conjecture,
    f(X1,esk2_0),
    i_0_1 ).

cnf(c_0_9,negated_conjecture,
    ( f(X1,esk1_1(esk2_0))
    | f(X1,X1) ),
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_10,negated_conjecture,
    ( ~ f(X1,X1)
    | ~ f(X1,esk1_1(X2)) ),
    i_0_3 ).

cnf(c_0_11,negated_conjecture,
    f(esk1_1(esk2_0),esk1_1(esk2_0)),
    inference(ef,[status(thm)],[c_0_9]) ).

cnf(c_0_12,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_11])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SYN413+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 : Mon Jul 11 23:59:29 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.19/0.44  # ENIGMATIC: Selected complete mode:
% 7.43/2.24  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.43/2.24  # No SInE strategy applied
% 7.43/2.24  # Trying AutoSched0 for 150 seconds
% 7.43/2.24  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S003A
% 7.43/2.24  # and selection function PSelectNegativeLiterals.
% 7.43/2.24  #
% 7.43/2.24  # Preprocessing time       : 0.013 s
% 7.43/2.24  # Presaturation interreduction done
% 7.43/2.24  
% 7.43/2.24  # Proof found!
% 7.43/2.24  # SZS status Theorem
% 7.43/2.24  # SZS output start CNFRefutation
% See solution above
% 7.43/2.24  # Training examples: 0 positive, 0 negative
% 7.43/2.24  
% 7.43/2.24  # -------------------------------------------------
% 7.43/2.24  # User time                : 0.015 s
% 7.43/2.24  # System time              : 0.003 s
% 7.43/2.24  # Total time               : 0.017 s
% 7.43/2.24  # Maximum resident set size: 7124 pages
% 7.43/2.24  
%------------------------------------------------------------------------------