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

View Problem - Process Solution

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

% Computer : n008.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:43 EDT 2022

% Result   : Theorem 7.39s 2.41s
% Output   : CNFRefutation 7.39s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   12
% Syntax   : Number of clauses     :   41 (  15 unt;   6 nHn;  41 RR)
%            Number of literals    :  105 (  20 equ;  63 neg)
%            Maximal clause size   :    7 (   2 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   1 con; 0-2 aty)
%            Number of variables   :   21 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_16,plain,
    ( relation(function_inverse(X1))
    | ~ function(X1)
    | ~ relation(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1d4avfpr/lgb.p',i_0_16) ).

cnf(i_0_75,negated_conjecture,
    function(esk16_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1d4avfpr/lgb.p',i_0_75) ).

cnf(i_0_76,negated_conjecture,
    relation(esk16_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1d4avfpr/lgb.p',i_0_76) ).

cnf(i_0_70,plain,
    ( 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/sandbox/tmp/enigma-theBenchmark.p-1d4avfpr/lgb.p',i_0_70) ).

cnf(i_0_15,plain,
    ( function(function_inverse(X1))
    | ~ function(X1)
    | ~ relation(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1d4avfpr/lgb.p',i_0_15) ).

cnf(i_0_9,plain,
    ( one_to_one(X1)
    | in(esk2_1(X1),relation_dom(X1))
    | ~ function(X1)
    | ~ relation(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1d4avfpr/lgb.p',i_0_9) ).

cnf(i_0_73,negated_conjecture,
    ~ one_to_one(function_inverse(esk16_0)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1d4avfpr/lgb.p',i_0_73) ).

cnf(i_0_74,negated_conjecture,
    one_to_one(esk16_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1d4avfpr/lgb.p',i_0_74) ).

cnf(i_0_10,plain,
    ( one_to_one(X1)
    | in(esk1_1(X1),relation_dom(X1))
    | ~ function(X1)
    | ~ relation(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1d4avfpr/lgb.p',i_0_10) ).

cnf(i_0_8,plain,
    ( apply(X1,esk1_1(X1)) = apply(X1,esk2_1(X1))
    | one_to_one(X1)
    | ~ function(X1)
    | ~ relation(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1d4avfpr/lgb.p',i_0_8) ).

cnf(i_0_72,plain,
    ( apply(X1,apply(function_inverse(X1),X2)) = X2
    | ~ function(X1)
    | ~ relation(X1)
    | ~ one_to_one(X1)
    | ~ in(X2,relation_rng(X1)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1d4avfpr/lgb.p',i_0_72) ).

cnf(i_0_7,plain,
    ( one_to_one(X1)
    | esk1_1(X1) != esk2_1(X1)
    | ~ function(X1)
    | ~ relation(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1d4avfpr/lgb.p',i_0_7) ).

cnf(c_0_89,plain,
    ( relation(function_inverse(X1))
    | ~ function(X1)
    | ~ relation(X1) ),
    i_0_16 ).

cnf(c_0_90,negated_conjecture,
    function(esk16_0),
    i_0_75 ).

cnf(c_0_91,negated_conjecture,
    relation(esk16_0),
    i_0_76 ).

cnf(c_0_92,plain,
    ( relation_rng(X1) = relation_dom(X2)
    | X2 != function_inverse(X1)
    | ~ function(X1)
    | ~ function(X2)
    | ~ relation(X1)
    | ~ relation(X2)
    | ~ one_to_one(X1) ),
    i_0_70 ).

cnf(c_0_93,plain,
    ( function(function_inverse(X1))
    | ~ function(X1)
    | ~ relation(X1) ),
    i_0_15 ).

cnf(c_0_94,plain,
    ( one_to_one(X1)
    | in(esk2_1(X1),relation_dom(X1))
    | ~ function(X1)
    | ~ relation(X1) ),
    i_0_9 ).

cnf(c_0_95,negated_conjecture,
    relation(function_inverse(esk16_0)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_89,c_0_90]),c_0_91])]) ).

cnf(c_0_96,negated_conjecture,
    ~ one_to_one(function_inverse(esk16_0)),
    i_0_73 ).

cnf(c_0_97,plain,
    ( relation_dom(function_inverse(X1)) = relation_rng(X1)
    | ~ relation(X1)
    | ~ function(X1)
    | ~ one_to_one(X1) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_92]),c_0_93]),c_0_89]) ).

cnf(c_0_98,negated_conjecture,
    one_to_one(esk16_0),
    i_0_74 ).

cnf(c_0_99,plain,
    ( one_to_one(X1)
    | in(esk1_1(X1),relation_dom(X1))
    | ~ function(X1)
    | ~ relation(X1) ),
    i_0_10 ).

cnf(c_0_100,negated_conjecture,
    ( in(esk2_1(function_inverse(esk16_0)),relation_dom(function_inverse(esk16_0)))
    | ~ function(function_inverse(esk16_0)) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_94,c_0_95]),c_0_96]) ).

cnf(c_0_101,negated_conjecture,
    relation_dom(function_inverse(esk16_0)) = relation_rng(esk16_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_97,c_0_98]),c_0_91]),c_0_90])]) ).

cnf(c_0_102,plain,
    ( apply(X1,esk1_1(X1)) = apply(X1,esk2_1(X1))
    | one_to_one(X1)
    | ~ function(X1)
    | ~ relation(X1) ),
    i_0_8 ).

cnf(c_0_103,negated_conjecture,
    ( in(esk1_1(function_inverse(esk16_0)),relation_dom(function_inverse(esk16_0)))
    | ~ function(function_inverse(esk16_0)) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_99,c_0_95]),c_0_96]) ).

cnf(c_0_104,plain,
    ( apply(X1,apply(function_inverse(X1),X2)) = X2
    | ~ function(X1)
    | ~ relation(X1)
    | ~ one_to_one(X1)
    | ~ in(X2,relation_rng(X1)) ),
    i_0_72 ).

cnf(c_0_105,negated_conjecture,
    ( in(esk2_1(function_inverse(esk16_0)),relation_rng(esk16_0))
    | ~ function(function_inverse(esk16_0)) ),
    inference(rw,[status(thm)],[c_0_100,c_0_101]) ).

cnf(c_0_106,negated_conjecture,
    ( apply(function_inverse(esk16_0),esk2_1(function_inverse(esk16_0))) = apply(function_inverse(esk16_0),esk1_1(function_inverse(esk16_0)))
    | ~ function(function_inverse(esk16_0)) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_102,c_0_95]),c_0_96]) ).

cnf(c_0_107,negated_conjecture,
    ( in(esk1_1(function_inverse(esk16_0)),relation_rng(esk16_0))
    | ~ function(function_inverse(esk16_0)) ),
    inference(rw,[status(thm)],[c_0_103,c_0_101]) ).

cnf(c_0_108,plain,
    ( one_to_one(X1)
    | esk1_1(X1) != esk2_1(X1)
    | ~ function(X1)
    | ~ relation(X1) ),
    i_0_7 ).

cnf(c_0_109,plain,
    ( apply(esk16_0,apply(function_inverse(esk16_0),esk2_1(function_inverse(esk16_0)))) = esk2_1(function_inverse(esk16_0))
    | ~ function(function_inverse(esk16_0)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_104,c_0_105]),c_0_91]),c_0_90]),c_0_98])]) ).

cnf(c_0_110,plain,
    apply(function_inverse(esk16_0),esk2_1(function_inverse(esk16_0))) = apply(function_inverse(esk16_0),esk1_1(function_inverse(esk16_0))),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_106,c_0_93]),c_0_91]),c_0_90])]) ).

cnf(c_0_111,plain,
    ( apply(esk16_0,apply(function_inverse(esk16_0),esk1_1(function_inverse(esk16_0)))) = esk1_1(function_inverse(esk16_0))
    | ~ function(function_inverse(esk16_0)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_104,c_0_107]),c_0_91]),c_0_90]),c_0_98])]) ).

cnf(c_0_112,negated_conjecture,
    ( esk2_1(function_inverse(esk16_0)) != esk1_1(function_inverse(esk16_0))
    | ~ function(function_inverse(esk16_0)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_96,c_0_108]),c_0_95])]) ).

cnf(c_0_113,plain,
    ( apply(esk16_0,apply(function_inverse(esk16_0),esk1_1(function_inverse(esk16_0)))) = esk2_1(function_inverse(esk16_0))
    | ~ function(function_inverse(esk16_0)) ),
    inference(rw,[status(thm)],[c_0_109,c_0_110]) ).

cnf(c_0_114,plain,
    apply(esk16_0,apply(function_inverse(esk16_0),esk1_1(function_inverse(esk16_0)))) = esk1_1(function_inverse(esk16_0)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_111,c_0_93]),c_0_91]),c_0_90])]) ).

cnf(c_0_115,plain,
    esk2_1(function_inverse(esk16_0)) != esk1_1(function_inverse(esk16_0)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_112,c_0_93]),c_0_91]),c_0_90])]) ).

cnf(c_0_116,plain,
    ~ function(function_inverse(esk16_0)),
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_113,c_0_114]),c_0_115]) ).

cnf(c_0_117,plain,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_116,c_0_93]),c_0_91]),c_0_90])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SEU221+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.34  % Computer : n008.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Sun Jun 19 18:50:09 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.20/0.46  # ENIGMATIC: Selected complete mode:
% 7.39/2.41  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.39/2.41  # No SInE strategy applied
% 7.39/2.41  # Trying AutoSched0 for 150 seconds
% 7.39/2.41  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI
% 7.39/2.41  # and selection function SelectComplexExceptUniqMaxHorn.
% 7.39/2.41  #
% 7.39/2.41  # Preprocessing time       : 0.023 s
% 7.39/2.41  # Presaturation interreduction done
% 7.39/2.41  
% 7.39/2.41  # Proof found!
% 7.39/2.41  # SZS status Theorem
% 7.39/2.41  # SZS output start CNFRefutation
% See solution above
% 7.39/2.41  # Training examples: 0 positive, 0 negative
% 7.39/2.41  
% 7.39/2.41  # -------------------------------------------------
% 7.39/2.41  # User time                : 0.031 s
% 7.39/2.41  # System time              : 0.002 s
% 7.39/2.41  # Total time               : 0.034 s
% 7.39/2.41  # Maximum resident set size: 7124 pages
% 7.39/2.41  
%------------------------------------------------------------------------------