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

View Problem - Process Solution

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

% Computer : n017.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:41 EDT 2022

% Result   : Theorem 7.53s 2.36s
% Output   : CNFRefutation 7.53s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    9
% Syntax   : Number of clauses     :   22 (   8 unt;   0 nHn;  22 RR)
%            Number of literals    :   58 (  15 equ;  39 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    :    5 (   5 usr;   1 con; 0-1 aty)
%            Number of variables   :   14 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_389,lemma,
    ( relation_rng(X1) = relation_dom(X2)
    | X2 != function_inverse(X1)
    | ~ function(X1)
    | ~ function(X2)
    | ~ relation(X1)
    | ~ relation(X2)
    | ~ one_to_one(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-kcudyem9/lgb.p',i_0_389) ).

cnf(i_0_162,plain,
    ( relation(function_inverse(X1))
    | ~ function(X1)
    | ~ relation(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-kcudyem9/lgb.p',i_0_162) ).

cnf(i_0_161,plain,
    ( function(function_inverse(X1))
    | ~ function(X1)
    | ~ relation(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-kcudyem9/lgb.p',i_0_161) ).

cnf(i_0_391,negated_conjecture,
    ( relation_rng(function_inverse(esk75_0)) != relation_dom(esk75_0)
    | relation_rng(esk75_0) != relation_dom(function_inverse(esk75_0)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-kcudyem9/lgb.p',i_0_391) ).

cnf(i_0_392,negated_conjecture,
    one_to_one(esk75_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-kcudyem9/lgb.p',i_0_392) ).

cnf(i_0_393,negated_conjecture,
    function(esk75_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-kcudyem9/lgb.p',i_0_393) ).

cnf(i_0_394,negated_conjecture,
    relation(esk75_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-kcudyem9/lgb.p',i_0_394) ).

cnf(i_0_338,lemma,
    ( relation_rng(relation_inverse(X1)) = relation_dom(X1)
    | ~ relation(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-kcudyem9/lgb.p',i_0_338) ).

cnf(i_0_153,plain,
    ( relation_inverse(X1) = function_inverse(X1)
    | ~ function(X1)
    | ~ relation(X1)
    | ~ one_to_one(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-kcudyem9/lgb.p',i_0_153) ).

cnf(c_0_404,lemma,
    ( relation_rng(X1) = relation_dom(X2)
    | X2 != function_inverse(X1)
    | ~ function(X1)
    | ~ function(X2)
    | ~ relation(X1)
    | ~ relation(X2)
    | ~ one_to_one(X1) ),
    i_0_389 ).

cnf(c_0_405,plain,
    ( relation(function_inverse(X1))
    | ~ function(X1)
    | ~ relation(X1) ),
    i_0_162 ).

cnf(c_0_406,plain,
    ( function(function_inverse(X1))
    | ~ function(X1)
    | ~ relation(X1) ),
    i_0_161 ).

cnf(c_0_407,negated_conjecture,
    ( relation_rng(function_inverse(esk75_0)) != relation_dom(esk75_0)
    | relation_rng(esk75_0) != relation_dom(function_inverse(esk75_0)) ),
    i_0_391 ).

cnf(c_0_408,lemma,
    ( relation_dom(function_inverse(X1)) = relation_rng(X1)
    | ~ one_to_one(X1)
    | ~ function(X1)
    | ~ relation(X1) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_404]),c_0_405]),c_0_406]) ).

cnf(c_0_409,negated_conjecture,
    one_to_one(esk75_0),
    i_0_392 ).

cnf(c_0_410,negated_conjecture,
    function(esk75_0),
    i_0_393 ).

cnf(c_0_411,negated_conjecture,
    relation(esk75_0),
    i_0_394 ).

cnf(c_0_412,lemma,
    ( relation_rng(relation_inverse(X1)) = relation_dom(X1)
    | ~ relation(X1) ),
    i_0_338 ).

cnf(c_0_413,plain,
    ( relation_inverse(X1) = function_inverse(X1)
    | ~ function(X1)
    | ~ relation(X1)
    | ~ one_to_one(X1) ),
    i_0_153 ).

cnf(c_0_414,negated_conjecture,
    relation_rng(function_inverse(esk75_0)) != relation_dom(esk75_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_407,c_0_408]),c_0_409]),c_0_410]),c_0_411])]) ).

cnf(c_0_415,lemma,
    ( relation_rng(function_inverse(X1)) = relation_dom(X1)
    | ~ one_to_one(X1)
    | ~ function(X1)
    | ~ relation(X1) ),
    inference(spm,[status(thm)],[c_0_412,c_0_413]) ).

cnf(c_0_416,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_414,c_0_415]),c_0_409]),c_0_410]),c_0_411])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11  % Problem  : SEU219+2 : TPTP v8.1.0. Released v3.3.0.
% 0.11/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.11/0.33  % Computer : n017.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 19:31:46 EDT 2022
% 0.11/0.33  % CPUTime  : 
% 0.18/0.44  # ENIGMATIC: Selected complete mode:
% 7.53/2.36  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.53/2.36  # No SInE strategy applied
% 7.53/2.36  # Trying AutoSched0 for 150 seconds
% 7.53/2.36  # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S2S
% 7.53/2.36  # and selection function SelectNewComplexAHP.
% 7.53/2.36  #
% 7.53/2.36  # Preprocessing time       : 0.023 s
% 7.53/2.36  # Presaturation interreduction done
% 7.53/2.36  
% 7.53/2.36  # Proof found!
% 7.53/2.36  # SZS status Theorem
% 7.53/2.36  # SZS output start CNFRefutation
% See solution above
% 7.53/2.36  # Training examples: 0 positive, 0 negative
% 7.53/2.36  
% 7.53/2.36  # -------------------------------------------------
% 7.53/2.36  # User time                : 0.026 s
% 7.53/2.36  # System time              : 0.006 s
% 7.53/2.36  # Total time               : 0.032 s
% 7.53/2.37  # Maximum resident set size: 7120 pages
% 7.53/2.37  
%------------------------------------------------------------------------------