↑ Up

Enigma---0.5.1.THM-CRf.s

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

% Computer : n019.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:38:07 EDT 2022

% Result   : Theorem 7.93s 2.36s
% Output   : CNFRefutation 7.93s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :   11
% Syntax   : Number of clauses     :   29 (  18 unt;   0 nHn;  14 RR)
%            Number of literals    :   64 (  21 equ;  37 neg)
%            Maximal clause size   :    7 (   2 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   1 con; 0-2 aty)
%            Number of variables   :   28 (   8 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_58,plain,
    ( identity_relation(relation_dom(X1)) = X1
    | relation_composition(X2,X1) != X2
    | relation_rng(X2) != relation_dom(X1)
    | ~ function(X1)
    | ~ function(X2)
    | ~ relation(X1)
    | ~ relation(X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-n7s80684/lgb.p',i_0_58) ).

cnf(i_0_21,plain,
    function(identity_relation(X1)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-n7s80684/lgb.p',i_0_21) ).

cnf(i_0_68,plain,
    relation_rng(identity_relation(X1)) = X1,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-n7s80684/lgb.p',i_0_68) ).

cnf(i_0_22,plain,
    relation(identity_relation(X1)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-n7s80684/lgb.p',i_0_22) ).

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

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

cnf(i_0_60,plain,
    one_to_one(identity_relation(X1)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-n7s80684/lgb.p',i_0_60) ).

cnf(i_0_65,plain,
    ( relation_composition(X1,function_inverse(X1)) = identity_relation(relation_dom(X1))
    | ~ function(X1)
    | ~ relation(X1)
    | ~ one_to_one(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-n7s80684/lgb.p',i_0_65) ).

cnf(i_0_69,plain,
    relation_dom(identity_relation(X1)) = X1,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-n7s80684/lgb.p',i_0_69) ).

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

cnf(i_0_66,negated_conjecture,
    function_inverse(identity_relation(esk12_0)) != identity_relation(esk12_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-n7s80684/lgb.p',i_0_66) ).

cnf(c_0_81,plain,
    ( identity_relation(relation_dom(X1)) = X1
    | relation_composition(X2,X1) != X2
    | relation_rng(X2) != relation_dom(X1)
    | ~ function(X1)
    | ~ function(X2)
    | ~ relation(X1)
    | ~ relation(X2) ),
    i_0_58 ).

cnf(c_0_82,plain,
    function(identity_relation(X1)),
    i_0_21 ).

cnf(c_0_83,plain,
    relation_rng(identity_relation(X1)) = X1,
    i_0_68 ).

cnf(c_0_84,plain,
    relation(identity_relation(X1)),
    i_0_22 ).

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

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

cnf(c_0_87,plain,
    one_to_one(identity_relation(X1)),
    i_0_60 ).

cnf(c_0_88,plain,
    ( relation_composition(X1,function_inverse(X1)) = identity_relation(relation_dom(X1))
    | ~ function(X1)
    | ~ relation(X1)
    | ~ one_to_one(X1) ),
    i_0_65 ).

cnf(c_0_89,plain,
    relation_dom(identity_relation(X1)) = X1,
    i_0_69 ).

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

cnf(c_0_91,plain,
    ( identity_relation(relation_dom(X1)) = X1
    | relation_composition(identity_relation(relation_dom(X1)),X1) != identity_relation(relation_dom(X1))
    | ~ relation(X1)
    | ~ function(X1) ),
    inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_82]),c_0_83]),c_0_84])])]) ).

cnf(c_0_92,plain,
    function(function_inverse(identity_relation(X1))),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_85,c_0_82]),c_0_84])]) ).

cnf(c_0_93,plain,
    relation_dom(function_inverse(identity_relation(X1))) = X1,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_82]),c_0_83]),c_0_87]),c_0_84])]) ).

cnf(c_0_94,plain,
    relation_composition(identity_relation(X1),function_inverse(identity_relation(X1))) = identity_relation(X1),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_82]),c_0_89]),c_0_87]),c_0_84])]) ).

cnf(c_0_95,plain,
    relation(function_inverse(identity_relation(X1))),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_82]),c_0_84])]) ).

cnf(c_0_96,negated_conjecture,
    function_inverse(identity_relation(esk12_0)) != identity_relation(esk12_0),
    i_0_66 ).

cnf(c_0_97,plain,
    function_inverse(identity_relation(X1)) = identity_relation(X1),
    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_91,c_0_92]),c_0_93]),c_0_93]),c_0_94]),c_0_93]),c_0_95])]) ).

cnf(c_0_98,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_96,c_0_97])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SEU034+1 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.34  % Computer : n019.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Mon Jun 20 03:25:11 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.20/0.46  # ENIGMATIC: Selected complete mode:
% 7.93/2.36  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.93/2.36  # No SInE strategy applied
% 7.93/2.36  # Trying AutoSched0 for 150 seconds
% 7.93/2.36  # AutoSched0-Mode selected heuristic G_E___208_B00_00_F1_SE_CS_SP_PS_S071I
% 7.93/2.36  # and selection function SelectCQArEqLast.
% 7.93/2.36  #
% 7.93/2.36  # Preprocessing time       : 0.013 s
% 7.93/2.36  # Presaturation interreduction done
% 7.93/2.36  
% 7.93/2.36  # Proof found!
% 7.93/2.36  # SZS status Theorem
% 7.93/2.36  # SZS output start CNFRefutation
% See solution above
% 7.93/2.36  # Training examples: 0 positive, 0 negative
% 7.93/2.36  
% 7.93/2.36  # -------------------------------------------------
% 7.93/2.36  # User time                : 0.019 s
% 7.93/2.36  # System time              : 0.005 s
% 7.93/2.36  # Total time               : 0.024 s
% 7.93/2.36  # Maximum resident set size: 7128 pages
% 7.93/2.36  
%------------------------------------------------------------------------------