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

View Problem - Process Solution

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

% Computer : n016.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:58:21 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_3,negated_conjecture,
    ( p(f(X1))
    | ~ q(X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-s6lqh_yh/input.p',i_0_3) ).

cnf(i_0_4,negated_conjecture,
    q(f(esk1_0)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-s6lqh_yh/input.p',i_0_4) ).

cnf(i_0_2,negated_conjecture,
    ( r(X1)
    | ~ q(X2)
    | ~ p(X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-s6lqh_yh/input.p',i_0_2) ).

cnf(i_0_1,negated_conjecture,
    ( ~ q(X1)
    | ~ p(X1)
    | ~ r(esk1_0)
    | ~ r(esk2_0) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-s6lqh_yh/input.p',i_0_1) ).

cnf(c_0_9,negated_conjecture,
    ( p(f(X1))
    | ~ q(X2) ),
    i_0_3 ).

cnf(c_0_10,negated_conjecture,
    q(f(esk1_0)),
    i_0_4 ).

cnf(c_0_11,negated_conjecture,
    ( r(X1)
    | ~ q(X2)
    | ~ p(X2) ),
    i_0_2 ).

cnf(c_0_12,negated_conjecture,
    p(f(X1)),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_13,negated_conjecture,
    ( r(X1)
    | ~ q(f(X2)) ),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_14,negated_conjecture,
    ( ~ q(X1)
    | ~ p(X1)
    | ~ r(esk1_0)
    | ~ r(esk2_0) ),
    i_0_1 ).

cnf(c_0_15,negated_conjecture,
    r(X1),
    inference(spm,[status(thm)],[c_0_13,c_0_10]) ).

cnf(c_0_16,negated_conjecture,
    ( ~ p(X1)
    | ~ q(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15]),c_0_15])]) ).

cnf(c_0_17,negated_conjecture,
    ~ q(f(X1)),
    inference(spm,[status(thm)],[c_0_16,c_0_12]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14  % Problem  : SYN941+1 : TPTP v8.1.0. Released v3.1.0.
% 0.08/0.14  % Command  : enigmatic-eprover.py %s %d 1
% 0.15/0.36  % Computer : n016.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit : 300
% 0.15/0.36  % WCLimit  : 600
% 0.15/0.36  % DateTime : Tue Jul 12 06:18:45 EDT 2022
% 0.15/0.36  % CPUTime  : 
% 0.23/0.48  # ENIGMATIC: Selected complete mode:
% 8.24/2.56  # ENIGMATIC: Solved by autoschedule:
% 8.24/2.56  # No SInE strategy applied
% 8.24/2.56  # Trying AutoSched0 for 150 seconds
% 8.24/2.56  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S0Y_ni
% 8.24/2.56  # and selection function SelectMaxLComplexAvoidPosPred.
% 8.24/2.56  #
% 8.24/2.56  # Preprocessing time       : 0.021 s
% 8.24/2.56  # Presaturation interreduction done
% 8.24/2.56  
% 8.24/2.56  # Proof found!
% 8.24/2.56  # SZS status Theorem
% 8.24/2.56  # SZS output start CNFRefutation
% See solution above
% 8.24/2.56  # Training examples: 0 positive, 0 negative
% 8.24/2.56  
% 8.24/2.56  # -------------------------------------------------
% 8.24/2.56  # User time                : 0.021 s
% 8.24/2.56  # System time              : 0.009 s
% 8.24/2.56  # Total time               : 0.030 s
% 8.24/2.56  # Maximum resident set size: 7116 pages
% 8.24/2.56  
%------------------------------------------------------------------------------