TSTP Solution File: SEU189+2 by Enigma---0.5.1

View Problem - Process Solution

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

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

% Result   : Theorem 7.82s 2.27s
% Output   : CNFRefutation 7.82s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   17 (   8 unt;   3 nHn;  17 RR)
%            Number of literals    :   30 (  23 equ;  12 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-1 aty)
%            Number of variables   :    4 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_270,lemma,
    ( X1 = empty_set
    | relation_rng(X1) != empty_set
    | ~ relation(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-29mtwi42/lgb.p',i_0_270) ).

cnf(i_0_272,negated_conjecture,
    ( relation_dom(esk50_0) = empty_set
    | relation_rng(esk50_0) = empty_set ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-29mtwi42/lgb.p',i_0_272) ).

cnf(i_0_274,negated_conjecture,
    relation(esk50_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-29mtwi42/lgb.p',i_0_274) ).

cnf(i_0_271,lemma,
    ( X1 = empty_set
    | relation_dom(X1) != empty_set
    | ~ relation(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-29mtwi42/lgb.p',i_0_271) ).

cnf(i_0_273,negated_conjecture,
    ( relation_dom(esk50_0) != empty_set
    | relation_rng(esk50_0) != empty_set ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-29mtwi42/lgb.p',i_0_273) ).

cnf(i_0_267,lemma,
    relation_dom(empty_set) = empty_set,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-29mtwi42/lgb.p',i_0_267) ).

cnf(i_0_266,lemma,
    relation_rng(empty_set) = empty_set,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-29mtwi42/lgb.p',i_0_266) ).

cnf(c_0_282,lemma,
    ( X1 = empty_set
    | relation_rng(X1) != empty_set
    | ~ relation(X1) ),
    i_0_270 ).

cnf(c_0_283,negated_conjecture,
    ( relation_dom(esk50_0) = empty_set
    | relation_rng(esk50_0) = empty_set ),
    i_0_272 ).

cnf(c_0_284,negated_conjecture,
    relation(esk50_0),
    i_0_274 ).

cnf(c_0_285,lemma,
    ( X1 = empty_set
    | relation_dom(X1) != empty_set
    | ~ relation(X1) ),
    i_0_271 ).

cnf(c_0_286,negated_conjecture,
    ( relation_dom(esk50_0) = empty_set
    | esk50_0 = empty_set ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_282,c_0_283]),c_0_284])]) ).

cnf(c_0_287,negated_conjecture,
    ( relation_dom(esk50_0) != empty_set
    | relation_rng(esk50_0) != empty_set ),
    i_0_273 ).

cnf(c_0_288,lemma,
    esk50_0 = empty_set,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_285,c_0_286]),c_0_284])]) ).

cnf(c_0_289,lemma,
    relation_dom(empty_set) = empty_set,
    i_0_267 ).

cnf(c_0_290,lemma,
    relation_rng(empty_set) = empty_set,
    i_0_266 ).

cnf(c_0_291,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_287,c_0_288]),c_0_289]),c_0_288]),c_0_290])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11  % Problem  : SEU189+2 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.11/0.33  % Computer : n005.cluster.edu
% 0.11/0.33  % Model    : x86_64 x86_64
% 0.11/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33  % Memory   : 8042.1875MB
% 0.11/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33  % CPULimit : 300
% 0.11/0.33  % WCLimit  : 600
% 0.11/0.33  % DateTime : Sun Jun 19 12:18:55 EDT 2022
% 0.11/0.33  % CPUTime  : 
% 0.11/0.39  # ENIGMATIC: Selected complete mode:
% 7.82/2.27  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.82/2.27  # No SInE strategy applied
% 7.82/2.27  # Trying AutoSched0 for 150 seconds
% 7.82/2.27  # AutoSched0-Mode selected heuristic G_E___200_B02_F1_SE_CS_SP_PI_S0S
% 7.82/2.27  # and selection function SelectComplexG.
% 7.82/2.27  #
% 7.82/2.27  # Preprocessing time       : 0.023 s
% 7.82/2.27  
% 7.82/2.27  # Proof found!
% 7.82/2.27  # SZS status Theorem
% 7.82/2.27  # SZS output start CNFRefutation
% See solution above
% 7.82/2.27  # Training examples: 0 positive, 0 negative
% 7.82/2.27  
% 7.82/2.27  # -------------------------------------------------
% 7.82/2.27  # User time                : 0.026 s
% 7.82/2.27  # System time              : 0.005 s
% 7.82/2.27  # Total time               : 0.031 s
% 7.82/2.27  # Maximum resident set size: 7128 pages
% 7.82/2.27  
%------------------------------------------------------------------------------