↑ Up

Enigma---0.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : SEU220+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : enigmatic-eprover.py %s %d 1

% Computer : n015.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.52s 2.47s
% Output   : CNFRefutation 8.52s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   26 (  11 unt;   0 nHn;  26 RR)
%            Number of literals    :   75 (  16 equ;  54 neg)
%            Maximal clause size   :    9 (   2 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   :   22 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_10,plain,
    ( function(function_inverse(X1))
    | ~ function(X1)
    | ~ relation(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-23ackrwl/input.p',i_0_10) ).

cnf(i_0_73,negated_conjecture,
    relation(esk15_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-23ackrwl/input.p',i_0_73) ).

cnf(i_0_72,negated_conjecture,
    function(esk15_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-23ackrwl/input.p',i_0_72) ).

cnf(i_0_69,negated_conjecture,
    ( apply(esk15_0,apply(function_inverse(esk15_0),esk14_0)) != esk14_0
    | apply(relation_composition(function_inverse(esk15_0),esk15_0),esk14_0) != esk14_0 ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-23ackrwl/input.p',i_0_69) ).

cnf(i_0_51,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/sandbox2/tmp/enigma-theBenchmark.p-23ackrwl/input.p',i_0_51) ).

cnf(i_0_64,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/sandbox2/tmp/enigma-theBenchmark.p-23ackrwl/input.p',i_0_64) ).

cnf(i_0_11,plain,
    ( relation(function_inverse(X1))
    | ~ function(X1)
    | ~ relation(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-23ackrwl/input.p',i_0_11) ).

cnf(i_0_70,negated_conjecture,
    in(esk14_0,relation_rng(esk15_0)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-23ackrwl/input.p',i_0_70) ).

cnf(i_0_71,negated_conjecture,
    one_to_one(esk15_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-23ackrwl/input.p',i_0_71) ).

cnf(i_0_68,plain,
    ( relation_dom(function_inverse(X1)) = relation_rng(X1)
    | ~ function(X1)
    | ~ relation(X1)
    | ~ one_to_one(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-23ackrwl/input.p',i_0_68) ).

cnf(c_0_84,plain,
    ( function(function_inverse(X1))
    | ~ function(X1)
    | ~ relation(X1) ),
    i_0_10 ).

cnf(c_0_85,negated_conjecture,
    relation(esk15_0),
    i_0_73 ).

cnf(c_0_86,negated_conjecture,
    function(esk15_0),
    i_0_72 ).

cnf(c_0_87,negated_conjecture,
    ( apply(esk15_0,apply(function_inverse(esk15_0),esk14_0)) != esk14_0
    | apply(relation_composition(function_inverse(esk15_0),esk15_0),esk14_0) != esk14_0 ),
    i_0_69 ).

cnf(c_0_88,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_51 ).

cnf(c_0_89,negated_conjecture,
    function(function_inverse(esk15_0)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_85]),c_0_86])]) ).

cnf(c_0_90,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_64 ).

cnf(c_0_91,plain,
    ( relation(function_inverse(X1))
    | ~ function(X1)
    | ~ relation(X1) ),
    i_0_11 ).

cnf(c_0_92,negated_conjecture,
    ( apply(esk15_0,apply(function_inverse(esk15_0),esk14_0)) != esk14_0
    | ~ in(esk14_0,relation_dom(function_inverse(esk15_0)))
    | ~ relation(function_inverse(esk15_0)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_88]),c_0_85]),c_0_86])]),c_0_89])]) ).

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

cnf(c_0_94,negated_conjecture,
    in(esk14_0,relation_rng(esk15_0)),
    i_0_70 ).

cnf(c_0_95,negated_conjecture,
    one_to_one(esk15_0),
    i_0_71 ).

cnf(c_0_96,plain,
    ( ~ in(esk14_0,relation_dom(function_inverse(esk15_0)))
    | ~ relation(function_inverse(esk15_0)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_92,c_0_93]),c_0_94]),c_0_95]),c_0_85]),c_0_86])]) ).

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

cnf(c_0_98,plain,
    ~ relation(function_inverse(esk15_0)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_96,c_0_97]),c_0_94]),c_0_95]),c_0_85]),c_0_86])]) ).

cnf(c_0_99,plain,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_98,c_0_91]),c_0_85]),c_0_86])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : SEU220+1 : TPTP v8.1.0. Released v3.3.0.
% 0.10/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.33  % Computer : n015.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 600
% 0.13/0.33  % DateTime : Mon Jun 20 01:45:02 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 0.19/0.44  # ENIGMATIC: Selected complete mode:
% 8.52/2.47  # ENIGMATIC: Solved by autoschedule:
% 8.52/2.47  # No SInE strategy applied
% 8.52/2.47  # Trying AutoSched0 for 150 seconds
% 8.52/2.47  # AutoSched0-Mode selected heuristic G_E___207_C01_F1_SE_CS_SP_PI_S0Y
% 8.52/2.47  # and selection function SelectMaxLComplexAvoidPosPred.
% 8.52/2.47  #
% 8.52/2.47  # Preprocessing time       : 0.014 s
% 8.52/2.47  
% 8.52/2.47  # Proof found!
% 8.52/2.47  # SZS status Theorem
% 8.52/2.47  # SZS output start CNFRefutation
% See solution above
% 8.52/2.47  # Training examples: 0 positive, 0 negative
% 8.52/2.47  
% 8.52/2.47  # -------------------------------------------------
% 8.52/2.47  # User time                : 0.016 s
% 8.52/2.47  # System time              : 0.008 s
% 8.52/2.47  # Total time               : 0.024 s
% 8.52/2.47  # Maximum resident set size: 7116 pages
% 8.52/2.47  
%------------------------------------------------------------------------------