↑ Up

Enigma---0.5.1.THM-CRf.s

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

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

% Result   : Theorem 8.98s 2.47s
% Output   : CNFRefutation 8.98s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :   17
% Syntax   : Number of clauses     :   59 (  17 unt;  16 nHn;  42 RR)
%            Number of literals    :  176 (  78 equ;  94 neg)
%            Maximal clause size   :    7 (   2 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   3 con; 0-2 aty)
%            Number of variables   :   83 (  11 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_68,plain,
    ( in(X1,relation_dom(X2))
    | ~ function(X2)
    | ~ relation(X2)
    | ~ in(unordered_pair(unordered_pair(X1,X3),singleton(X1)),X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jnyb591v/input.p',i_0_68) ).

cnf(i_0_4,plain,
    unordered_pair(X1,X2) = unordered_pair(X2,X1),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jnyb591v/input.p',i_0_4) ).

cnf(i_0_6,plain,
    ( X1 = identity_relation(X2)
    | in(esk1_2(X2,X1),X2)
    | in(unordered_pair(unordered_pair(esk1_2(X2,X1),esk2_2(X2,X1)),singleton(esk1_2(X2,X1))),X1)
    | ~ relation(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jnyb591v/input.p',i_0_6) ).

cnf(i_0_7,plain,
    ( X1 = identity_relation(X2)
    | esk1_2(X2,X1) != esk2_2(X2,X1)
    | ~ relation(X1)
    | ~ in(esk1_2(X2,X1),X2)
    | ~ in(unordered_pair(unordered_pair(esk1_2(X2,X1),esk2_2(X2,X1)),singleton(esk1_2(X2,X1))),X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jnyb591v/input.p',i_0_7) ).

cnf(i_0_14,plain,
    ( in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),X3)
    | X2 != apply(X3,X1)
    | ~ function(X3)
    | ~ relation(X3)
    | ~ in(X1,relation_dom(X3)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jnyb591v/input.p',i_0_14) ).

cnf(i_0_60,negated_conjecture,
    relation(esk11_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jnyb591v/input.p',i_0_60) ).

cnf(i_0_59,negated_conjecture,
    function(esk11_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jnyb591v/input.p',i_0_59) ).

cnf(i_0_67,plain,
    ( X1 = apply(X2,X3)
    | ~ function(X2)
    | ~ relation(X2)
    | ~ in(unordered_pair(unordered_pair(X3,X1),singleton(X3)),X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jnyb591v/input.p',i_0_67) ).

cnf(i_0_5,plain,
    ( X1 = identity_relation(X2)
    | esk1_2(X2,X1) = esk2_2(X2,X1)
    | in(unordered_pair(unordered_pair(esk1_2(X2,X1),esk2_2(X2,X1)),singleton(esk1_2(X2,X1))),X1)
    | ~ relation(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jnyb591v/input.p',i_0_5) ).

cnf(i_0_56,negated_conjecture,
    ( identity_relation(esk10_0) = esk11_0
    | relation_dom(esk11_0) = esk10_0 ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jnyb591v/input.p',i_0_56) ).

cnf(i_0_55,negated_conjecture,
    ( identity_relation(esk10_0) = esk11_0
    | apply(esk11_0,X1) = X1
    | ~ in(X1,esk10_0) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jnyb591v/input.p',i_0_55) ).

cnf(i_0_9,plain,
    ( X1 = X2
    | X3 != identity_relation(X4)
    | ~ relation(X3)
    | ~ in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),X3) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jnyb591v/input.p',i_0_9) ).

cnf(i_0_63,plain,
    relation_dom(identity_relation(X1)) = X1,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jnyb591v/input.p',i_0_63) ).

cnf(i_0_23,plain,
    relation(identity_relation(X1)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jnyb591v/input.p',i_0_23) ).

cnf(i_0_31,plain,
    function(identity_relation(X1)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jnyb591v/input.p',i_0_31) ).

cnf(i_0_57,negated_conjecture,
    ( identity_relation(esk10_0) != esk11_0
    | relation_dom(esk11_0) != esk10_0
    | apply(esk11_0,esk12_0) != esk12_0 ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jnyb591v/input.p',i_0_57) ).

cnf(i_0_58,negated_conjecture,
    ( in(esk12_0,esk10_0)
    | identity_relation(esk10_0) != esk11_0
    | relation_dom(esk11_0) != esk10_0 ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jnyb591v/input.p',i_0_58) ).

cnf(c_0_86,plain,
    ( in(X1,relation_dom(X2))
    | ~ function(X2)
    | ~ relation(X2)
    | ~ in(unordered_pair(unordered_pair(X1,X3),singleton(X1)),X2) ),
    i_0_68 ).

cnf(c_0_87,plain,
    unordered_pair(X1,X2) = unordered_pair(X2,X1),
    i_0_4 ).

cnf(c_0_88,plain,
    ( X1 = identity_relation(X2)
    | in(esk1_2(X2,X1),X2)
    | in(unordered_pair(unordered_pair(esk1_2(X2,X1),esk2_2(X2,X1)),singleton(esk1_2(X2,X1))),X1)
    | ~ relation(X1) ),
    i_0_6 ).

cnf(c_0_89,plain,
    ( in(X1,relation_dom(X2))
    | ~ in(unordered_pair(singleton(X1),unordered_pair(X1,X3)),X2)
    | ~ relation(X2)
    | ~ function(X2) ),
    inference(spm,[status(thm)],[c_0_86,c_0_87]) ).

cnf(c_0_90,plain,
    ( X1 = identity_relation(X2)
    | in(unordered_pair(singleton(esk1_2(X2,X1)),unordered_pair(esk1_2(X2,X1),esk2_2(X2,X1))),X1)
    | in(esk1_2(X2,X1),X2)
    | ~ relation(X1) ),
    inference(rw,[status(thm)],[c_0_88,c_0_87]) ).

cnf(c_0_91,plain,
    ( X1 = identity_relation(X2)
    | esk1_2(X2,X1) != esk2_2(X2,X1)
    | ~ relation(X1)
    | ~ in(esk1_2(X2,X1),X2)
    | ~ in(unordered_pair(unordered_pair(esk1_2(X2,X1),esk2_2(X2,X1)),singleton(esk1_2(X2,X1))),X1) ),
    i_0_7 ).

cnf(c_0_92,plain,
    ( in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),X3)
    | X2 != apply(X3,X1)
    | ~ function(X3)
    | ~ relation(X3)
    | ~ in(X1,relation_dom(X3)) ),
    i_0_14 ).

cnf(c_0_93,plain,
    ( X1 = identity_relation(X2)
    | in(esk1_2(X2,X1),relation_dom(X1))
    | in(esk1_2(X2,X1),X2)
    | ~ relation(X1)
    | ~ function(X1) ),
    inference(spm,[status(thm)],[c_0_89,c_0_90]) ).

cnf(c_0_94,negated_conjecture,
    relation(esk11_0),
    i_0_60 ).

cnf(c_0_95,negated_conjecture,
    function(esk11_0),
    i_0_59 ).

cnf(c_0_96,plain,
    ( X1 = identity_relation(X2)
    | esk2_2(X2,X1) != esk1_2(X2,X1)
    | ~ in(unordered_pair(singleton(esk1_2(X2,X1)),unordered_pair(esk1_2(X2,X1),esk2_2(X2,X1))),X1)
    | ~ in(esk1_2(X2,X1),X2)
    | ~ relation(X1) ),
    inference(rw,[status(thm)],[c_0_91,c_0_87]) ).

cnf(c_0_97,plain,
    ( in(unordered_pair(singleton(X1),unordered_pair(X1,X2)),X3)
    | X2 != apply(X3,X1)
    | ~ in(X1,relation_dom(X3))
    | ~ relation(X3)
    | ~ function(X3) ),
    inference(spm,[status(thm)],[c_0_92,c_0_87]) ).

cnf(c_0_98,negated_conjecture,
    ( identity_relation(X1) = esk11_0
    | in(esk1_2(X1,esk11_0),relation_dom(esk11_0))
    | in(esk1_2(X1,esk11_0),X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_93,c_0_94]),c_0_95])]) ).

cnf(c_0_99,plain,
    ( X1 = identity_relation(X2)
    | apply(X1,esk1_2(X2,X1)) != esk2_2(X2,X1)
    | esk2_2(X2,X1) != esk1_2(X2,X1)
    | ~ in(esk1_2(X2,X1),relation_dom(X1))
    | ~ in(esk1_2(X2,X1),X2)
    | ~ relation(X1)
    | ~ function(X1) ),
    inference(spm,[status(thm)],[c_0_96,c_0_97]) ).

cnf(c_0_100,negated_conjecture,
    ( identity_relation(relation_dom(esk11_0)) = esk11_0
    | in(esk1_2(relation_dom(esk11_0),esk11_0),relation_dom(esk11_0)) ),
    inference(ef,[status(thm)],[c_0_98]) ).

cnf(c_0_101,plain,
    ( X1 = apply(X2,X3)
    | ~ function(X2)
    | ~ relation(X2)
    | ~ in(unordered_pair(unordered_pair(X3,X1),singleton(X3)),X2) ),
    i_0_67 ).

cnf(c_0_102,plain,
    ( X1 = identity_relation(X2)
    | esk1_2(X2,X1) = esk2_2(X2,X1)
    | in(unordered_pair(unordered_pair(esk1_2(X2,X1),esk2_2(X2,X1)),singleton(esk1_2(X2,X1))),X1)
    | ~ relation(X1) ),
    i_0_5 ).

cnf(c_0_103,negated_conjecture,
    ( identity_relation(relation_dom(esk11_0)) = esk11_0
    | apply(esk11_0,esk1_2(relation_dom(esk11_0),esk11_0)) != esk2_2(relation_dom(esk11_0),esk11_0)
    | esk2_2(relation_dom(esk11_0),esk11_0) != esk1_2(relation_dom(esk11_0),esk11_0) ),
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_99,c_0_100]),c_0_94]),c_0_95])]),c_0_100]) ).

cnf(c_0_104,negated_conjecture,
    ( identity_relation(esk10_0) = esk11_0
    | relation_dom(esk11_0) = esk10_0 ),
    i_0_56 ).

cnf(c_0_105,plain,
    ( X1 = apply(X2,X3)
    | ~ in(unordered_pair(singleton(X3),unordered_pair(X3,X1)),X2)
    | ~ relation(X2)
    | ~ function(X2) ),
    inference(spm,[status(thm)],[c_0_101,c_0_87]) ).

cnf(c_0_106,plain,
    ( esk2_2(X1,X2) = esk1_2(X1,X2)
    | X2 = identity_relation(X1)
    | in(unordered_pair(singleton(esk1_2(X1,X2)),unordered_pair(esk1_2(X1,X2),esk2_2(X1,X2))),X2)
    | ~ relation(X2) ),
    inference(rw,[status(thm)],[c_0_102,c_0_87]) ).

cnf(c_0_107,negated_conjecture,
    ( identity_relation(esk10_0) = esk11_0
    | apply(esk11_0,esk1_2(esk10_0,esk11_0)) != esk2_2(esk10_0,esk11_0)
    | esk2_2(esk10_0,esk11_0) != esk1_2(esk10_0,esk11_0) ),
    inference(spm,[status(thm)],[c_0_103,c_0_104]) ).

cnf(c_0_108,negated_conjecture,
    ( identity_relation(esk10_0) = esk11_0
    | apply(esk11_0,X1) = X1
    | ~ in(X1,esk10_0) ),
    i_0_55 ).

cnf(c_0_109,negated_conjecture,
    ( identity_relation(esk10_0) = esk11_0
    | in(esk1_2(esk10_0,esk11_0),esk10_0) ),
    inference(spm,[status(thm)],[c_0_100,c_0_104]) ).

cnf(c_0_110,plain,
    ( apply(X1,esk1_2(X2,X1)) = esk2_2(X2,X1)
    | esk2_2(X2,X1) = esk1_2(X2,X1)
    | X1 = identity_relation(X2)
    | ~ relation(X1)
    | ~ function(X1) ),
    inference(spm,[status(thm)],[c_0_105,c_0_106]) ).

cnf(c_0_111,plain,
    ( X1 = X2
    | X3 != identity_relation(X4)
    | ~ relation(X3)
    | ~ in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),X3) ),
    i_0_9 ).

cnf(c_0_112,negated_conjecture,
    ( identity_relation(esk10_0) = esk11_0
    | esk2_2(esk10_0,esk11_0) != esk1_2(esk10_0,esk11_0) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_107,c_0_108]),c_0_109]) ).

cnf(c_0_113,negated_conjecture,
    ( esk2_2(X1,esk11_0) = esk1_2(X1,esk11_0)
    | identity_relation(esk10_0) = esk11_0
    | identity_relation(X1) = esk11_0
    | ~ in(esk1_2(X1,esk11_0),esk10_0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_108,c_0_110]),c_0_94]),c_0_95])]) ).

cnf(c_0_114,plain,
    ( X1 = X2
    | X2 != apply(X3,X1)
    | X3 != identity_relation(X4)
    | ~ in(X1,relation_dom(X3))
    | ~ relation(X3)
    | ~ function(X3) ),
    inference(spm,[status(thm)],[c_0_111,c_0_92]) ).

cnf(c_0_115,plain,
    relation_dom(identity_relation(X1)) = X1,
    i_0_63 ).

cnf(c_0_116,negated_conjecture,
    identity_relation(esk10_0) = esk11_0,
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_112,c_0_113]),c_0_109]) ).

cnf(c_0_117,plain,
    ( apply(X1,X2) = X2
    | X1 != identity_relation(X3)
    | ~ in(X2,relation_dom(X1))
    | ~ relation(X1)
    | ~ function(X1) ),
    inference(er,[status(thm)],[c_0_114]) ).

cnf(c_0_118,plain,
    relation(identity_relation(X1)),
    i_0_23 ).

cnf(c_0_119,plain,
    function(identity_relation(X1)),
    i_0_31 ).

cnf(c_0_120,negated_conjecture,
    ( identity_relation(esk10_0) != esk11_0
    | relation_dom(esk11_0) != esk10_0
    | apply(esk11_0,esk12_0) != esk12_0 ),
    i_0_57 ).

cnf(c_0_121,plain,
    relation_dom(esk11_0) = esk10_0,
    inference(spm,[status(thm)],[c_0_115,c_0_116]) ).

cnf(c_0_122,plain,
    ( apply(identity_relation(X1),X2) = X2
    | ~ in(X2,X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_117]),c_0_115]),c_0_118]),c_0_119])]) ).

cnf(c_0_123,negated_conjecture,
    ( in(esk12_0,esk10_0)
    | identity_relation(esk10_0) != esk11_0
    | relation_dom(esk11_0) != esk10_0 ),
    i_0_58 ).

cnf(c_0_124,negated_conjecture,
    apply(esk11_0,esk12_0) != esk12_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_120,c_0_116])]),c_0_121])]) ).

cnf(c_0_125,plain,
    ( apply(esk11_0,X1) = X1
    | ~ in(X1,esk10_0) ),
    inference(spm,[status(thm)],[c_0_122,c_0_116]) ).

cnf(c_0_126,negated_conjecture,
    in(esk12_0,esk10_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_123,c_0_116])]),c_0_121])]) ).

cnf(c_0_127,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_124,c_0_125]),c_0_126])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SEU216+1 : TPTP v8.1.0. Released v3.3.0.
% 0.11/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.33  % Computer : n004.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 : Sun Jun 19 06:50:10 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.19/0.45  # ENIGMATIC: Selected complete mode:
% 8.98/2.47  # ENIGMATIC: Solved by autoschedule:
% 8.98/2.47  # No SInE strategy applied
% 8.98/2.47  # Trying AutoSched0 for 150 seconds
% 8.98/2.47  # AutoSched0-Mode selected heuristic G_E___302_C18_F1_URBAN_S0Y
% 8.98/2.47  # and selection function SelectMaxLComplexAvoidPosPred.
% 8.98/2.47  #
% 8.98/2.47  # Preprocessing time       : 0.013 s
% 8.98/2.47  
% 8.98/2.47  # Proof found!
% 8.98/2.47  # SZS status Theorem
% 8.98/2.47  # SZS output start CNFRefutation
% See solution above
% 8.98/2.47  # Training examples: 0 positive, 0 negative
% 8.98/2.47  
% 8.98/2.47  # -------------------------------------------------
% 8.98/2.47  # User time                : 0.221 s
% 8.98/2.47  # System time              : 0.007 s
% 8.98/2.47  # Total time               : 0.228 s
% 8.98/2.47  # Maximum resident set size: 7120 pages
% 8.98/2.47  
%------------------------------------------------------------------------------