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

View Problem - Process Solution

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

% Computer : n025.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 : Mon Jul 18 16:24:59 EDT 2022

% Result   : Theorem 7.59s 2.38s
% Output   : CNFRefutation 7.59s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :   17
% Syntax   : Number of clauses     :   64 (  24 unt;  10 nHn;  39 RR)
%            Number of literals    :  131 (   0 equ;  62 neg)
%            Maximal clause size   :    5 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-3 aty)
%            Number of functors    :    8 (   8 usr;   1 con; 0-1 aty)
%            Number of variables   :   97 (  17 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_49,plain,
    ( ~ r1(X1)
    | ~ id(X1,X2)
    | ~ r2(X3,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-o6ozmnm1/input.p',i_0_49) ).

cnf(i_0_46,plain,
    ( id(X1,esk18_1(X1))
    | r2(esk19_1(X1),esk20_1(X1)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-o6ozmnm1/input.p',i_0_46) ).

cnf(i_0_44,plain,
    ( r1(esk18_1(X1))
    | r2(esk19_1(X1),esk20_1(X1)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-o6ozmnm1/input.p',i_0_44) ).

cnf(i_0_47,plain,
    ( id(X1,esk18_1(X1))
    | id(X1,esk20_1(X1)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-o6ozmnm1/input.p',i_0_47) ).

cnf(i_0_45,plain,
    ( r1(esk18_1(X1))
    | id(X1,esk20_1(X1)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-o6ozmnm1/input.p',i_0_45) ).

cnf(i_0_52,plain,
    ( r1(X1)
    | ~ r1(X2)
    | ~ id(X1,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-o6ozmnm1/input.p',i_0_52) ).

cnf(i_0_40,plain,
    id(esk15_1(X1),esk17_1(X1)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-o6ozmnm1/input.p',i_0_40) ).

cnf(i_0_39,plain,
    r1(esk17_1(X1)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-o6ozmnm1/input.p',i_0_39) ).

cnf(i_0_48,plain,
    ( id(X1,X2)
    | ~ id(X2,X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-o6ozmnm1/input.p',i_0_48) ).

cnf(i_0_17,plain,
    ( id(X1,esk5_0)
    | ~ r1(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-o6ozmnm1/input.p',i_0_17) ).

cnf(i_0_50,plain,
    ( id(X1,X2)
    | ~ id(X3,X2)
    | ~ id(X1,X3) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-o6ozmnm1/input.p',i_0_50) ).

cnf(i_0_33,plain,
    r1(esk13_1(X1)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-o6ozmnm1/input.p',i_0_33) ).

cnf(i_0_6,plain,
    ( r4(X1,X2,X3)
    | ~ id(X3,X4)
    | ~ id(X2,X5)
    | ~ id(X1,X6)
    | ~ r4(X6,X5,X4) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-o6ozmnm1/input.p',i_0_6) ).

cnf(i_0_41,plain,
    r4(X1,esk16_1(X1),esk15_1(X1)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-o6ozmnm1/input.p',i_0_41) ).

cnf(i_0_42,plain,
    r1(esk16_1(X1)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-o6ozmnm1/input.p',i_0_42) ).

cnf(i_0_53,plain,
    ( r1(X1)
    | ~ r1(X2)
    | ~ id(X2,X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-o6ozmnm1/input.p',i_0_53) ).

cnf(i_0_59,negated_conjecture,
    ( ~ r1(X1)
    | ~ r1(X2)
    | ~ id(X3,X1)
    | ~ r4(X2,X2,X3) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-o6ozmnm1/input.p',i_0_59) ).

cnf(c_0_77,plain,
    ( ~ r1(X1)
    | ~ id(X1,X2)
    | ~ r2(X3,X2) ),
    i_0_49 ).

cnf(c_0_78,plain,
    ( id(X1,esk18_1(X1))
    | r2(esk19_1(X1),esk20_1(X1)) ),
    i_0_46 ).

cnf(c_0_79,plain,
    ( r1(esk18_1(X1))
    | r2(esk19_1(X1),esk20_1(X1)) ),
    i_0_44 ).

cnf(c_0_80,plain,
    ( id(X1,esk18_1(X1))
    | ~ id(X2,esk20_1(X1))
    | ~ r1(X2) ),
    inference(spm,[status(thm)],[c_0_77,c_0_78]) ).

cnf(c_0_81,plain,
    ( id(X1,esk18_1(X1))
    | id(X1,esk20_1(X1)) ),
    i_0_47 ).

cnf(c_0_82,plain,
    ( r1(esk18_1(X1))
    | ~ id(X2,esk20_1(X1))
    | ~ r1(X2) ),
    inference(spm,[status(thm)],[c_0_77,c_0_79]) ).

cnf(c_0_83,plain,
    ( r1(esk18_1(X1))
    | id(X1,esk20_1(X1)) ),
    i_0_45 ).

cnf(c_0_84,plain,
    ( r1(X1)
    | ~ r1(X2)
    | ~ id(X1,X2) ),
    i_0_52 ).

cnf(c_0_85,plain,
    id(esk15_1(X1),esk17_1(X1)),
    i_0_40 ).

cnf(c_0_86,plain,
    r1(esk17_1(X1)),
    i_0_39 ).

cnf(c_0_87,plain,
    ( id(X1,X2)
    | ~ id(X2,X1) ),
    i_0_48 ).

cnf(c_0_88,plain,
    ( id(X1,esk18_1(X1))
    | ~ r1(X1) ),
    inference(spm,[status(thm)],[c_0_80,c_0_81]) ).

cnf(c_0_89,plain,
    ( id(X1,esk5_0)
    | ~ r1(X1) ),
    i_0_17 ).

cnf(c_0_90,plain,
    ( r1(esk18_1(X1))
    | ~ r1(X1) ),
    inference(spm,[status(thm)],[c_0_82,c_0_83]) ).

cnf(c_0_91,plain,
    ( id(X1,X2)
    | ~ id(X3,X2)
    | ~ id(X1,X3) ),
    i_0_50 ).

cnf(c_0_92,plain,
    r1(esk15_1(X1)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_85]),c_0_86])]) ).

cnf(c_0_93,plain,
    ( id(esk18_1(X1),X1)
    | ~ r1(X1) ),
    inference(spm,[status(thm)],[c_0_87,c_0_88]) ).

cnf(c_0_94,plain,
    ( id(esk18_1(X1),esk5_0)
    | ~ r1(X1) ),
    inference(spm,[status(thm)],[c_0_89,c_0_90]) ).

cnf(c_0_95,plain,
    ( id(X1,esk20_1(X2))
    | r1(esk18_1(X2))
    | ~ id(X1,X2) ),
    inference(spm,[status(thm)],[c_0_91,c_0_83]) ).

cnf(c_0_96,plain,
    id(esk15_1(X1),esk5_0),
    inference(spm,[status(thm)],[c_0_89,c_0_92]) ).

cnf(c_0_97,plain,
    ( id(X1,X2)
    | ~ id(X1,esk18_1(X2))
    | ~ r1(X2) ),
    inference(spm,[status(thm)],[c_0_91,c_0_93]) ).

cnf(c_0_98,plain,
    ( id(esk5_0,esk18_1(X1))
    | ~ r1(X1) ),
    inference(spm,[status(thm)],[c_0_87,c_0_94]) ).

cnf(c_0_99,plain,
    ( id(esk15_1(X1),esk20_1(esk5_0))
    | r1(esk18_1(esk5_0)) ),
    inference(spm,[status(thm)],[c_0_95,c_0_96]) ).

cnf(c_0_100,plain,
    r1(esk13_1(X1)),
    i_0_33 ).

cnf(c_0_101,plain,
    ( r4(X1,X2,X3)
    | ~ id(X3,X4)
    | ~ id(X2,X5)
    | ~ id(X1,X6)
    | ~ r4(X6,X5,X4) ),
    i_0_6 ).

cnf(c_0_102,plain,
    r4(X1,esk16_1(X1),esk15_1(X1)),
    i_0_41 ).

cnf(c_0_103,plain,
    r1(esk16_1(X1)),
    i_0_42 ).

cnf(c_0_104,plain,
    ( r1(X1)
    | ~ r1(X2)
    | ~ id(X2,X1) ),
    i_0_53 ).

cnf(c_0_105,plain,
    ( id(X1,esk18_1(X2))
    | ~ id(X1,X2)
    | ~ r1(X2) ),
    inference(spm,[status(thm)],[c_0_91,c_0_88]) ).

cnf(c_0_106,plain,
    ( id(esk5_0,X1)
    | ~ r1(X1) ),
    inference(spm,[status(thm)],[c_0_97,c_0_98]) ).

cnf(c_0_107,plain,
    r1(esk18_1(esk5_0)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_99]),c_0_92])]) ).

cnf(c_0_108,plain,
    id(esk13_1(X1),esk5_0),
    inference(spm,[status(thm)],[c_0_89,c_0_100]) ).

cnf(c_0_109,plain,
    ( r4(X1,X2,X3)
    | ~ id(X3,esk15_1(X4))
    | ~ id(X2,esk16_1(X4))
    | ~ id(X1,X4) ),
    inference(spm,[status(thm)],[c_0_101,c_0_102]) ).

cnf(c_0_110,plain,
    id(esk5_0,esk15_1(X1)),
    inference(spm,[status(thm)],[c_0_87,c_0_96]) ).

cnf(c_0_111,plain,
    id(esk16_1(X1),esk5_0),
    inference(spm,[status(thm)],[c_0_89,c_0_103]) ).

cnf(c_0_112,plain,
    ( r1(esk18_1(X1))
    | ~ id(X2,X1)
    | ~ r1(X2) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_104,c_0_105]),c_0_104]) ).

cnf(c_0_113,plain,
    id(esk5_0,esk18_1(esk5_0)),
    inference(spm,[status(thm)],[c_0_106,c_0_107]) ).

cnf(c_0_114,plain,
    r1(esk5_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_104,c_0_108]),c_0_100])]) ).

cnf(c_0_115,plain,
    ( r4(X1,X2,esk5_0)
    | ~ id(X2,esk16_1(X3))
    | ~ id(X1,X3) ),
    inference(spm,[status(thm)],[c_0_109,c_0_110]) ).

cnf(c_0_116,plain,
    id(esk5_0,esk16_1(X1)),
    inference(spm,[status(thm)],[c_0_87,c_0_111]) ).

cnf(c_0_117,plain,
    r1(esk18_1(esk18_1(esk5_0))),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_112,c_0_113]),c_0_114])]) ).

cnf(c_0_118,plain,
    ( r4(X1,esk5_0,esk5_0)
    | ~ id(X1,X2) ),
    inference(spm,[status(thm)],[c_0_115,c_0_116]) ).

cnf(c_0_119,plain,
    id(esk5_0,esk18_1(esk18_1(esk5_0))),
    inference(spm,[status(thm)],[c_0_106,c_0_117]) ).

cnf(c_0_120,negated_conjecture,
    ( ~ r1(X1)
    | ~ r1(X2)
    | ~ id(X3,X1)
    | ~ r4(X2,X2,X3) ),
    i_0_59 ).

cnf(c_0_121,plain,
    r4(esk5_0,esk5_0,esk5_0),
    inference(spm,[status(thm)],[c_0_118,c_0_119]) ).

cnf(c_0_122,negated_conjecture,
    ~ r1(X1),
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_120,c_0_121]),c_0_114])]),c_0_106]) ).

cnf(c_0_123,plain,
    $false,
    inference(sr,[status(thm)],[c_0_100,c_0_122]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : NUN087+1 : TPTP v8.1.0. Released v7.3.0.
% 0.07/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.14/0.34  % Computer : n025.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 : Thu Jun  2 10:30:31 EDT 2022
% 0.14/0.34  % CPUTime  : 
% 0.21/0.46  # ENIGMATIC: Selected SinE mode:
% 0.21/0.46  # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.46  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.21/0.46  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.21/0.46  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 7.59/2.38  # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN:
% 7.59/2.38  # Version: 2.1pre011
% 7.59/2.38  # Preprocessing time       : 0.016 s
% 7.59/2.38  
% 7.59/2.38  # Proof found!
% 7.59/2.38  # SZS status Theorem
% 7.59/2.38  # SZS output start CNFRefutation
% See solution above
% 7.59/2.38  # Proof object total steps             : 64
% 7.59/2.38  # Proof object clause steps            : 47
% 7.59/2.38  # Proof object formula steps           : 17
% 7.59/2.38  # Proof object conjectures             : 3
% 7.59/2.38  # Proof object clause conjectures      : 2
% 7.59/2.38  # Proof object formula conjectures     : 1
% 7.59/2.38  # Proof object initial clauses used    : 17
% 7.59/2.38  # Proof object initial formulas used   : 17
% 7.59/2.38  # Proof object generating inferences   : 29
% 7.59/2.38  # Proof object simplifying inferences  : 13
% 7.59/2.38  # Training examples: 0 positive, 0 negative
% 7.59/2.38  # Parsed axioms                        : 43
% 7.59/2.38  # Removed by relevancy pruning/SinE    : 0
% 7.59/2.38  # Initial clauses                      : 43
% 7.59/2.38  # Removed in clause preprocessing      : 0
% 7.59/2.38  # Initial clauses in saturation        : 43
% 7.59/2.38  # Processed clauses                    : 304
% 7.59/2.38  # ...of these trivial                  : 16
% 7.59/2.38  # ...subsumed                          : 81
% 7.59/2.38  # ...remaining for further processing  : 207
% 7.59/2.38  # Other redundant clauses eliminated   : 0
% 7.59/2.38  # Clauses deleted for lack of memory   : 0
% 7.59/2.38  # Backward-subsumed                    : 1
% 7.59/2.38  # Backward-rewritten                   : 1
% 7.59/2.38  # Generated clauses                    : 1304
% 7.59/2.38  # ...of the previous two non-trivial   : 1020
% 7.59/2.38  # Contextual simplify-reflections      : 27
% 7.59/2.38  # Paramodulations                      : 1282
% 7.59/2.38  # Factorizations                       : 0
% 7.59/2.38  # Equation resolutions                 : 0
% 7.59/2.38  # Propositional unsat checks           : 0
% 7.59/2.38  # Propositional unsat check successes  : 0
% 7.59/2.38  # Current number of processed clauses  : 183
% 7.59/2.38  #    Positive orientable unit clauses  : 54
% 7.59/2.38  #    Positive unorientable unit clauses: 0
% 7.59/2.38  #    Negative unit clauses             : 21
% 7.59/2.38  #    Non-unit-clauses                  : 108
% 7.59/2.38  # Current number of unprocessed clauses: 687
% 7.59/2.38  # ...number of literals in the above   : 1985
% 7.59/2.38  # Current number of archived formulas  : 0
% 7.59/2.38  # Current number of archived clauses   : 24
% 7.59/2.38  # Clause-clause subsumption calls (NU) : 2934
% 7.59/2.38  # Rec. Clause-clause subsumption calls : 1944
% 7.59/2.38  # Non-unit clause-clause subsumptions  : 78
% 7.59/2.38  # Unit Clause-clause subsumption calls : 787
% 7.59/2.38  # Rewrite failures with RHS unbound    : 0
% 7.59/2.38  # BW rewrite match attempts            : 94
% 7.59/2.38  # BW rewrite match successes           : 1
% 7.59/2.38  # Condensation attempts                : 0
% 7.59/2.38  # Condensation successes               : 0
% 7.59/2.38  # Termbank termtop insertions          : 14934
% 7.59/2.38  
% 7.59/2.38  # -------------------------------------------------
% 7.59/2.38  # User time                : 0.033 s
% 7.59/2.38  # System time              : 0.002 s
% 7.59/2.38  # Total time               : 0.036 s
% 7.59/2.38  # ...preprocessing         : 0.016 s
% 7.59/2.38  # ...main loop             : 0.020 s
% 7.59/2.38  # Maximum resident set size: 7136 pages
% 7.59/2.38  
%------------------------------------------------------------------------------