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

View Problem - Process Solution

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

% Computer : n024.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 : Tue Jul 19 08:39:44 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_58,plain,
    ( apply(X1,X2) = apply(X3,X2)
    | X1 != relation_dom_restriction(X3,X4)
    | ~ relation(X3)
    | ~ relation(X1)
    | ~ function(X3)
    | ~ function(X1)
    | ~ in(X2,relation_dom(X1)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-oi9d43_m/input.p',i_0_58) ).

cnf(i_0_44,plain,
    ( relation(relation_dom_restriction(X1,X2))
    | ~ relation(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-oi9d43_m/input.p',i_0_44) ).

cnf(i_0_47,plain,
    ( function(relation_dom_restriction(X1,X2))
    | ~ relation(X1)
    | ~ function(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-oi9d43_m/input.p',i_0_47) ).

cnf(i_0_53,negated_conjecture,
    in(esk11_0,relation_dom(relation_dom_restriction(esk12_0,esk10_0))),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-oi9d43_m/input.p',i_0_53) ).

cnf(i_0_54,negated_conjecture,
    function(esk12_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-oi9d43_m/input.p',i_0_54) ).

cnf(i_0_55,negated_conjecture,
    relation(esk12_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-oi9d43_m/input.p',i_0_55) ).

cnf(i_0_52,negated_conjecture,
    apply(relation_dom_restriction(esk12_0,esk10_0),esk11_0) != apply(esk12_0,esk11_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-oi9d43_m/input.p',i_0_52) ).

cnf(c_0_66,plain,
    ( apply(X1,X2) = apply(X3,X2)
    | X1 != relation_dom_restriction(X3,X4)
    | ~ relation(X3)
    | ~ relation(X1)
    | ~ function(X3)
    | ~ function(X1)
    | ~ in(X2,relation_dom(X1)) ),
    i_0_58 ).

cnf(c_0_67,plain,
    ( relation(relation_dom_restriction(X1,X2))
    | ~ relation(X1) ),
    i_0_44 ).

cnf(c_0_68,plain,
    ( function(relation_dom_restriction(X1,X2))
    | ~ relation(X1)
    | ~ function(X1) ),
    i_0_47 ).

cnf(c_0_69,plain,
    ( apply(relation_dom_restriction(X1,X2),X3) = apply(X1,X3)
    | ~ in(X3,relation_dom(relation_dom_restriction(X1,X2)))
    | ~ function(X1)
    | ~ relation(X1) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_66]),c_0_67]),c_0_68]) ).

cnf(c_0_70,negated_conjecture,
    in(esk11_0,relation_dom(relation_dom_restriction(esk12_0,esk10_0))),
    i_0_53 ).

cnf(c_0_71,negated_conjecture,
    function(esk12_0),
    i_0_54 ).

cnf(c_0_72,negated_conjecture,
    relation(esk12_0),
    i_0_55 ).

cnf(c_0_73,negated_conjecture,
    apply(relation_dom_restriction(esk12_0,esk10_0),esk11_0) != apply(esk12_0,esk11_0),
    i_0_52 ).

cnf(c_0_74,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_70]),c_0_71]),c_0_72])]),c_0_73]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : SEU223+1 : TPTP v8.1.0. Released v3.3.0.
% 0.06/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n024.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 : Sun Jun 19 09:46:04 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.19/0.44  # ENIGMATIC: Selected complete mode:
% 8.41/2.45  # ENIGMATIC: Solved by autoschedule:
% 8.41/2.45  # No SInE strategy applied
% 8.41/2.45  # Trying AutoSched0 for 150 seconds
% 8.41/2.45  # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S04AN
% 8.41/2.45  # and selection function SelectComplexExceptUniqMaxHorn.
% 8.41/2.45  #
% 8.41/2.45  # Preprocessing time       : 0.024 s
% 8.41/2.45  # Presaturation interreduction done
% 8.41/2.45  
% 8.41/2.45  # Proof found!
% 8.41/2.45  # SZS status Theorem
% 8.41/2.45  # SZS output start CNFRefutation
% See solution above
% 8.41/2.45  # Training examples: 0 positive, 0 negative
% 8.41/2.45  
% 8.41/2.45  # -------------------------------------------------
% 8.41/2.45  # User time                : 0.027 s
% 8.41/2.45  # System time              : 0.005 s
% 8.41/2.45  # Total time               : 0.032 s
% 8.41/2.45  # Maximum resident set size: 7124 pages
% 8.41/2.45  
%------------------------------------------------------------------------------