TSTP Solution File: SEU220+3 by Enigma---0.5.1

View Problem - Process Solution

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

% Computer : n028.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:42 EDT 2022

% Result   : Theorem 8.17s 2.48s
% Output   : CNFRefutation 8.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   25 (  11 unt;   0 nHn;  25 RR)
%            Number of literals    :   77 (  18 equ;  55 neg)
%            Maximal clause size   :    9 (   3 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   2 con; 0-2 aty)
%            Number of variables   :   25 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_68,plain,
    ( X1 = apply(X2,X3)
    | X4 != function_inverse(X2)
    | X3 != apply(X4,X1)
    | ~ function(X4)
    | ~ function(X2)
    | ~ relation(X4)
    | ~ relation(X2)
    | ~ one_to_one(X2)
    | ~ in(X1,relation_rng(X2)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ukht8egg/lgb.p',i_0_68) ).

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

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

cnf(i_0_74,negated_conjecture,
    in(esk16_0,relation_rng(esk17_0)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ukht8egg/lgb.p',i_0_74) ).

cnf(i_0_75,negated_conjecture,
    one_to_one(esk17_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ukht8egg/lgb.p',i_0_75) ).

cnf(i_0_77,negated_conjecture,
    relation(esk17_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ukht8egg/lgb.p',i_0_77) ).

cnf(i_0_76,negated_conjecture,
    function(esk17_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ukht8egg/lgb.p',i_0_76) ).

cnf(i_0_73,negated_conjecture,
    ( apply(esk17_0,apply(function_inverse(esk17_0),esk16_0)) != esk16_0
    | apply(relation_composition(function_inverse(esk17_0),esk17_0),esk16_0) != esk16_0 ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ukht8egg/lgb.p',i_0_73) ).

cnf(i_0_52,plain,
    ( apply(relation_composition(X1,X2),X3) = apply(X2,apply(X1,X3))
    | ~ function(X2)
    | ~ function(X1)
    | ~ relation(X2)
    | ~ relation(X1)
    | ~ in(X3,relation_dom(X1)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ukht8egg/lgb.p',i_0_52) ).

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

cnf(c_0_88,plain,
    ( X1 = apply(X2,X3)
    | X4 != function_inverse(X2)
    | X3 != apply(X4,X1)
    | ~ function(X4)
    | ~ function(X2)
    | ~ relation(X4)
    | ~ relation(X2)
    | ~ one_to_one(X2)
    | ~ in(X1,relation_rng(X2)) ),
    i_0_68 ).

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

cnf(c_0_90,plain,
    ( relation(function_inverse(X1))
    | ~ function(X1)
    | ~ relation(X1) ),
    i_0_8 ).

cnf(c_0_91,plain,
    ( apply(X1,apply(function_inverse(X1),X2)) = X2
    | ~ one_to_one(X1)
    | ~ relation(X1)
    | ~ function(X1)
    | ~ in(X2,relation_rng(X1)) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_88])]),c_0_89]),c_0_90]) ).

cnf(c_0_92,negated_conjecture,
    in(esk16_0,relation_rng(esk17_0)),
    i_0_74 ).

cnf(c_0_93,negated_conjecture,
    one_to_one(esk17_0),
    i_0_75 ).

cnf(c_0_94,negated_conjecture,
    relation(esk17_0),
    i_0_77 ).

cnf(c_0_95,negated_conjecture,
    function(esk17_0),
    i_0_76 ).

cnf(c_0_96,negated_conjecture,
    ( apply(esk17_0,apply(function_inverse(esk17_0),esk16_0)) != esk16_0
    | apply(relation_composition(function_inverse(esk17_0),esk17_0),esk16_0) != esk16_0 ),
    i_0_73 ).

cnf(c_0_97,negated_conjecture,
    apply(esk17_0,apply(function_inverse(esk17_0),esk16_0)) = esk16_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_91,c_0_92]),c_0_93]),c_0_94]),c_0_95])]) ).

cnf(c_0_98,plain,
    ( apply(relation_composition(X1,X2),X3) = apply(X2,apply(X1,X3))
    | ~ function(X2)
    | ~ function(X1)
    | ~ relation(X2)
    | ~ relation(X1)
    | ~ in(X3,relation_dom(X1)) ),
    i_0_52 ).

cnf(c_0_99,plain,
    ( relation_dom(function_inverse(X1)) = relation_rng(X1)
    | ~ function(X1)
    | ~ relation(X1)
    | ~ one_to_one(X1) ),
    i_0_72 ).

cnf(c_0_100,negated_conjecture,
    apply(relation_composition(function_inverse(esk17_0),esk17_0),esk16_0) != esk16_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_96,c_0_97])]) ).

cnf(c_0_101,plain,
    ( apply(relation_composition(function_inverse(X1),X2),X3) = apply(X2,apply(function_inverse(X1),X3))
    | ~ one_to_one(X1)
    | ~ relation(X2)
    | ~ relation(X1)
    | ~ function(X2)
    | ~ function(X1)
    | ~ in(X3,relation_rng(X1)) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_98,c_0_99]),c_0_89]),c_0_90]) ).

cnf(c_0_102,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_100,c_0_101]),c_0_97]),c_0_93]),c_0_94]),c_0_95]),c_0_92])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SEU220+3 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.14/0.34  % Computer : n028.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 600
% 0.14/0.34  % DateTime : Sun Jun 19 03:19:01 EDT 2022
% 0.14/0.34  % CPUTime  : 
% 0.21/0.45  # ENIGMATIC: Selected complete mode:
% 8.17/2.48  # ENIGMATIC: Solved by autoschedule-lgb:
% 8.17/2.48  # No SInE strategy applied
% 8.17/2.48  # Trying AutoSched0 for 150 seconds
% 8.17/2.48  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 8.17/2.48  # and selection function SelectComplexExceptUniqMaxHorn.
% 8.17/2.48  #
% 8.17/2.48  # Preprocessing time       : 0.024 s
% 8.17/2.48  # Presaturation interreduction done
% 8.17/2.48  
% 8.17/2.48  # Proof found!
% 8.17/2.48  # SZS status Theorem
% 8.17/2.48  # SZS output start CNFRefutation
% See solution above
% 8.17/2.48  # Training examples: 0 positive, 0 negative
% 8.17/2.48  
% 8.17/2.48  # -------------------------------------------------
% 8.17/2.48  # User time                : 0.028 s
% 8.17/2.48  # System time              : 0.005 s
% 8.17/2.48  # Total time               : 0.033 s
% 8.17/2.48  # Maximum resident set size: 7124 pages
% 8.17/2.48  
%------------------------------------------------------------------------------