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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : SYN728+1 : TPTP v8.1.0. Released v2.5.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:56:46 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_1,negated_conjecture,
    ( ~ p(esk3_0,esk3_0)
    | ~ p(g(esk3_0),X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-tyewzhr6/input.p',i_0_1) ).

cnf(i_0_5,negated_conjecture,
    ( p(X1,X1)
    | ~ p(X2,X3) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-tyewzhr6/input.p',i_0_5) ).

cnf(i_0_4,negated_conjecture,
    ( m(X1)
    | p(X1,esk1_1(X1)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-tyewzhr6/input.p',i_0_4) ).

cnf(i_0_2,negated_conjecture,
    ( ~ q(X1)
    | ~ m(g(X1)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-tyewzhr6/input.p',i_0_2) ).

cnf(i_0_3,negated_conjecture,
    ( p(X1,esk1_1(X1))
    | q(f(X1,esk2_1(X1))) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-tyewzhr6/input.p',i_0_3) ).

cnf(c_0_11,negated_conjecture,
    ( ~ p(esk3_0,esk3_0)
    | ~ p(g(esk3_0),X1) ),
    i_0_1 ).

cnf(c_0_12,negated_conjecture,
    ( p(X1,X1)
    | ~ p(X2,X3) ),
    i_0_5 ).

cnf(c_0_13,negated_conjecture,
    ( m(X1)
    | p(X1,esk1_1(X1)) ),
    i_0_4 ).

cnf(c_0_14,negated_conjecture,
    ~ p(g(esk3_0),X1),
    inference(csr,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_15,negated_conjecture,
    ( p(X1,X1)
    | m(X2) ),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_16,negated_conjecture,
    ( ~ q(X1)
    | ~ m(g(X1)) ),
    i_0_2 ).

cnf(c_0_17,negated_conjecture,
    m(X1),
    inference(spm,[status(thm)],[c_0_14,c_0_15]) ).

cnf(c_0_18,negated_conjecture,
    ( p(X1,esk1_1(X1))
    | q(f(X1,esk2_1(X1))) ),
    i_0_3 ).

cnf(c_0_19,negated_conjecture,
    ~ q(X1),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17])]) ).

cnf(c_0_20,negated_conjecture,
    p(X1,esk1_1(X1)),
    inference(sr,[status(thm)],[c_0_18,c_0_19]) ).

cnf(c_0_21,negated_conjecture,
    $false,
    inference(spm,[status(thm)],[c_0_14,c_0_20]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem  : SYN728+1 : TPTP v8.1.0. Released v2.5.0.
% 0.12/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.35  % Computer : n011.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 600
% 0.13/0.35  % DateTime : Tue Jul 12 07:20:14 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.20/0.46  # ENIGMATIC: Selected complete mode:
% 7.40/2.35  # ENIGMATIC: Solved by autoschedule:
% 7.40/2.35  # No SInE strategy applied
% 7.40/2.35  # Trying AutoSched0 for 150 seconds
% 7.40/2.35  # AutoSched0-Mode selected heuristic G_E___092_C01_F1_AE_CS_SP_PS_CO_S0Y
% 7.40/2.35  # and selection function SelectMaxLComplexAvoidPosPred.
% 7.40/2.35  #
% 7.40/2.35  # Preprocessing time       : 0.023 s
% 7.40/2.35  # Presaturation interreduction done
% 7.40/2.35  
% 7.40/2.35  # Proof found!
% 7.40/2.35  # SZS status Theorem
% 7.40/2.35  # SZS output start CNFRefutation
% See solution above
% 7.40/2.35  # Training examples: 0 positive, 0 negative
% 7.40/2.35  
% 7.40/2.35  # -------------------------------------------------
% 7.40/2.35  # User time                : 0.024 s
% 7.40/2.35  # System time              : 0.006 s
% 7.40/2.35  # Total time               : 0.030 s
% 7.40/2.35  # Maximum resident set size: 7120 pages
% 7.40/2.35  
%------------------------------------------------------------------------------