TSTP Solution File: NUN059+2 by Enigma---0.5.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : NUN059+2 : TPTP v8.1.0. Bugfixed v7.4.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 : Mon Jul 18 16:24:52 EDT 2022

% Result   : Theorem 6.89s 2.26s
% Output   : CNFRefutation 6.89s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   26 (  19 unt;   0 nHn;   9 RR)
%            Number of literals    :   42 (   7 equ;  22 neg)
%            Maximal clause size   :    5 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :    5 (   5 usr;   1 con; 0-2 aty)
%            Number of variables   :   50 (  10 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_40,negated_conjecture,
    ( X1 != X2
    | ~ r3(X3,X4,X2)
    | ~ r4(X5,X5,X3)
    | ~ r4(X6,X6,X4)
    | ~ r4(X7,X7,X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hbkw9qup/input.p',i_0_40) ).

cnf(i_0_8,plain,
    ( X1 = esk5_0
    | ~ r1(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hbkw9qup/input.p',i_0_8) ).

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

cnf(i_0_10,plain,
    r4(X1,X2,esk9_2(X1,X2)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hbkw9qup/input.p',i_0_10) ).

cnf(i_0_25,plain,
    r3(X1,esk13_1(X1),X1),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hbkw9qup/input.p',i_0_25) ).

cnf(i_0_32,plain,
    r1(esk15_1(X1)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hbkw9qup/input.p',i_0_32) ).

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

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

cnf(c_0_49,negated_conjecture,
    ( X1 != X2
    | ~ r3(X3,X4,X2)
    | ~ r4(X5,X5,X3)
    | ~ r4(X6,X6,X4)
    | ~ r4(X7,X7,X1) ),
    i_0_40 ).

cnf(c_0_50,plain,
    ( X1 = esk5_0
    | ~ r1(X1) ),
    i_0_8 ).

cnf(c_0_51,plain,
    r1(esk13_1(X1)),
    i_0_26 ).

cnf(c_0_52,negated_conjecture,
    ( ~ r4(X1,X1,X2)
    | ~ r4(X3,X3,X4)
    | ~ r4(X5,X5,X6)
    | ~ r3(X6,X4,X2) ),
    inference(er,[status(thm)],[c_0_49]) ).

cnf(c_0_53,plain,
    r4(X1,X2,esk9_2(X1,X2)),
    i_0_10 ).

cnf(c_0_54,plain,
    r3(X1,esk13_1(X1),X1),
    i_0_25 ).

cnf(c_0_55,plain,
    esk13_1(X1) = esk5_0,
    inference(spm,[status(thm)],[c_0_50,c_0_51]) ).

cnf(c_0_56,plain,
    ( ~ r4(X1,X1,X2)
    | ~ r4(X3,X3,X4)
    | ~ r3(X4,X2,esk9_2(X5,X5)) ),
    inference(spm,[status(thm)],[c_0_52,c_0_53]) ).

cnf(c_0_57,plain,
    r3(X1,esk5_0,X1),
    inference(rw,[status(thm)],[c_0_54,c_0_55]) ).

cnf(c_0_58,plain,
    r1(esk15_1(X1)),
    i_0_32 ).

cnf(c_0_59,plain,
    r1(esk16_1(X1)),
    i_0_34 ).

cnf(c_0_60,plain,
    ( ~ r4(X1,X1,esk9_2(X2,X2))
    | ~ r4(X3,X3,esk5_0) ),
    inference(spm,[status(thm)],[c_0_56,c_0_57]) ).

cnf(c_0_61,plain,
    r4(X1,esk16_1(X1),esk15_1(X1)),
    i_0_33 ).

cnf(c_0_62,plain,
    esk15_1(X1) = esk5_0,
    inference(spm,[status(thm)],[c_0_50,c_0_58]) ).

cnf(c_0_63,plain,
    esk16_1(X1) = esk5_0,
    inference(spm,[status(thm)],[c_0_50,c_0_59]) ).

cnf(c_0_64,plain,
    ~ r4(X1,X1,esk5_0),
    inference(spm,[status(thm)],[c_0_60,c_0_53]) ).

cnf(c_0_65,plain,
    r4(X1,esk5_0,esk5_0),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_61,c_0_62]),c_0_63]) ).

cnf(c_0_66,plain,
    $false,
    inference(spm,[status(thm)],[c_0_64,c_0_65]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : NUN059+2 : TPTP v8.1.0. Bugfixed v7.4.0.
% 0.03/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n028.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Thu Jun  2 07:59:25 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.44  # ENIGMATIC: Selected SinE mode:
% 0.18/0.44  # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.44  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.18/0.44  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.18/0.44  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 6.89/2.26  # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN:
% 6.89/2.26  # Version: 2.1pre011
% 6.89/2.26  # Preprocessing time       : 0.010 s
% 6.89/2.26  
% 6.89/2.26  # Proof found!
% 6.89/2.26  # SZS status Theorem
% 6.89/2.26  # SZS output start CNFRefutation
% See solution above
% 6.89/2.26  # Proof object total steps             : 26
% 6.89/2.26  # Proof object clause steps            : 18
% 6.89/2.26  # Proof object formula steps           : 8
% 6.89/2.26  # Proof object conjectures             : 3
% 6.89/2.26  # Proof object clause conjectures      : 2
% 6.89/2.26  # Proof object formula conjectures     : 1
% 6.89/2.26  # Proof object initial clauses used    : 8
% 6.89/2.26  # Proof object initial formulas used   : 8
% 6.89/2.26  # Proof object generating inferences   : 7
% 6.89/2.26  # Proof object simplifying inferences  : 4
% 6.89/2.26  # Training examples: 0 positive, 0 negative
% 6.89/2.26  # Parsed axioms                        : 28
% 6.89/2.26  # Removed by relevancy pruning/SinE    : 0
% 6.89/2.26  # Initial clauses                      : 28
% 6.89/2.26  # Removed in clause preprocessing      : 0
% 6.89/2.26  # Initial clauses in saturation        : 28
% 6.89/2.26  # Processed clauses                    : 54
% 6.89/2.26  # ...of these trivial                  : 0
% 6.89/2.26  # ...subsumed                          : 0
% 6.89/2.26  # ...remaining for further processing  : 54
% 6.89/2.26  # Other redundant clauses eliminated   : 3
% 6.89/2.26  # Clauses deleted for lack of memory   : 0
% 6.89/2.26  # Backward-subsumed                    : 0
% 6.89/2.26  # Backward-rewritten                   : 5
% 6.89/2.26  # Generated clauses                    : 60
% 6.89/2.26  # ...of the previous two non-trivial   : 59
% 6.89/2.26  # Contextual simplify-reflections      : 0
% 6.89/2.26  # Paramodulations                      : 54
% 6.89/2.26  # Factorizations                       : 0
% 6.89/2.26  # Equation resolutions                 : 6
% 6.89/2.26  # Propositional unsat checks           : 0
% 6.89/2.26  # Propositional unsat check successes  : 0
% 6.89/2.26  # Current number of processed clauses  : 46
% 6.89/2.26  #    Positive orientable unit clauses  : 18
% 6.89/2.26  #    Positive unorientable unit clauses: 0
% 6.89/2.26  #    Negative unit clauses             : 7
% 6.89/2.26  #    Non-unit-clauses                  : 21
% 6.89/2.26  # Current number of unprocessed clauses: 30
% 6.89/2.26  # ...number of literals in the above   : 55
% 6.89/2.26  # Current number of archived formulas  : 0
% 6.89/2.26  # Current number of archived clauses   : 5
% 6.89/2.26  # Clause-clause subsumption calls (NU) : 95
% 6.89/2.26  # Rec. Clause-clause subsumption calls : 63
% 6.89/2.26  # Non-unit clause-clause subsumptions  : 0
% 6.89/2.26  # Unit Clause-clause subsumption calls : 75
% 6.89/2.26  # Rewrite failures with RHS unbound    : 0
% 6.89/2.26  # BW rewrite match attempts            : 22
% 6.89/2.26  # BW rewrite match successes           : 3
% 6.89/2.26  # Condensation attempts                : 0
% 6.89/2.26  # Condensation successes               : 0
% 6.89/2.26  # Termbank termtop insertions          : 882
% 6.89/2.26  
% 6.89/2.26  # -------------------------------------------------
% 6.89/2.26  # User time                : 0.006 s
% 6.89/2.26  # System time              : 0.005 s
% 6.89/2.26  # Total time               : 0.011 s
% 6.89/2.26  # ...preprocessing         : 0.010 s
% 6.89/2.26  # ...main loop             : 0.001 s
% 6.89/2.26  # Maximum resident set size: 7136 pages
% 6.89/2.26  
%------------------------------------------------------------------------------