TSTP Solution File: SET803+4 by Enigma---0.5.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : SET803+4 : TPTP v8.1.0. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : enigmatic-eprover.py %s %d 1

% Computer : n024.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 00:14:16 EDT 2022

% Result   : Theorem 4.72s 2.43s
% Output   : CNFRefutation 4.72s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   24 (  13 unt;   0 nHn;  24 RR)
%            Number of literals    :   45 (   7 equ;  23 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-3 aty)
%            Number of functors    :    5 (   5 usr;   5 con; 0-0 aty)
%            Number of variables   :   33 (   4 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_3,plain,
    ( apply(X1,X2,X3)
    | ~ member(X2,X4)
    | ~ greatest(X3,X1,X4) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tp9cb4qq/input.p',i_0_3) ).

cnf(i_0_36,negated_conjecture,
    greatest(esk12_0,esk8_0,esk9_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tp9cb4qq/input.p',i_0_36) ).

cnf(i_0_27,plain,
    ( X1 = X2
    | ~ member(X1,X3)
    | ~ apply(X4,X2,X1)
    | ~ max(X2,X4,X3) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tp9cb4qq/input.p',i_0_27) ).

cnf(i_0_4,plain,
    ( member(X1,X2)
    | ~ greatest(X1,X3,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tp9cb4qq/input.p',i_0_4) ).

cnf(i_0_28,plain,
    ( member(X1,X2)
    | ~ max(X1,X3,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tp9cb4qq/input.p',i_0_28) ).

cnf(i_0_38,negated_conjecture,
    max(esk11_0,esk8_0,esk9_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tp9cb4qq/input.p',i_0_38) ).

cnf(i_0_39,negated_conjecture,
    max(esk10_0,esk8_0,esk9_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tp9cb4qq/input.p',i_0_39) ).

cnf(i_0_37,negated_conjecture,
    esk11_0 != esk10_0,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tp9cb4qq/input.p',i_0_37) ).

cnf(c_0_48,plain,
    ( apply(X1,X2,X3)
    | ~ member(X2,X4)
    | ~ greatest(X3,X1,X4) ),
    i_0_3 ).

cnf(c_0_49,negated_conjecture,
    greatest(esk12_0,esk8_0,esk9_0),
    i_0_36 ).

cnf(c_0_50,plain,
    ( X1 = X2
    | ~ member(X1,X3)
    | ~ apply(X4,X2,X1)
    | ~ max(X2,X4,X3) ),
    i_0_27 ).

cnf(c_0_51,negated_conjecture,
    ( apply(esk8_0,X1,esk12_0)
    | ~ member(X1,esk9_0) ),
    inference(spm,[status(thm)],[c_0_48,c_0_49]) ).

cnf(c_0_52,plain,
    ( member(X1,X2)
    | ~ greatest(X1,X3,X2) ),
    i_0_4 ).

cnf(c_0_53,plain,
    ( member(X1,X2)
    | ~ max(X1,X3,X2) ),
    i_0_28 ).

cnf(c_0_54,negated_conjecture,
    max(esk11_0,esk8_0,esk9_0),
    i_0_38 ).

cnf(c_0_55,plain,
    ( esk12_0 = X1
    | ~ member(esk12_0,X2)
    | ~ member(X1,esk9_0)
    | ~ max(X1,esk8_0,X2) ),
    inference(spm,[status(thm)],[c_0_50,c_0_51]) ).

cnf(c_0_56,negated_conjecture,
    member(esk12_0,esk9_0),
    inference(spm,[status(thm)],[c_0_52,c_0_49]) ).

cnf(c_0_57,negated_conjecture,
    member(esk11_0,esk9_0),
    inference(spm,[status(thm)],[c_0_53,c_0_54]) ).

cnf(c_0_58,negated_conjecture,
    esk12_0 = esk11_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_54]),c_0_56]),c_0_57])]) ).

cnf(c_0_59,negated_conjecture,
    max(esk10_0,esk8_0,esk9_0),
    i_0_39 ).

cnf(c_0_60,plain,
    ( esk11_0 = X1
    | ~ member(esk11_0,X2)
    | ~ member(X1,esk9_0)
    | ~ max(X1,esk8_0,X2) ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_55,c_0_58]),c_0_58]) ).

cnf(c_0_61,negated_conjecture,
    member(esk10_0,esk9_0),
    inference(spm,[status(thm)],[c_0_53,c_0_59]) ).

cnf(c_0_62,negated_conjecture,
    esk11_0 != esk10_0,
    i_0_37 ).

cnf(c_0_63,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_59]),c_0_57]),c_0_61])]),c_0_62]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem  : SET803+4 : TPTP v8.1.0. Released v3.2.0.
% 0.12/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.34  % Computer : n024.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 Jul 11 03:51:00 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.45  # ENIGMATIC: Selected SinE mode:
% 0.19/0.46  # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.46  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.19/0.46  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.19/0.46  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 4.72/2.43  # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 4.72/2.43  # Version: 2.1pre011
% 4.72/2.43  # Preprocessing time       : 0.020 s
% 4.72/2.43  
% 4.72/2.43  # Proof found!
% 4.72/2.43  # SZS status Theorem
% 4.72/2.43  # SZS output start CNFRefutation
% See solution above
% 4.72/2.43  # Proof object total steps             : 24
% 4.72/2.43  # Proof object clause steps            : 16
% 4.72/2.43  # Proof object formula steps           : 8
% 4.72/2.43  # Proof object conjectures             : 14
% 4.72/2.43  # Proof object clause conjectures      : 10
% 4.72/2.43  # Proof object formula conjectures     : 4
% 4.72/2.43  # Proof object initial clauses used    : 8
% 4.72/2.43  # Proof object initial formulas used   : 8
% 4.72/2.43  # Proof object generating inferences   : 7
% 4.72/2.43  # Proof object simplifying inferences  : 9
% 4.72/2.43  # Training examples: 0 positive, 0 negative
% 4.72/2.43  # Parsed axioms                        : 112
% 4.72/2.43  # Removed by relevancy pruning/SinE    : 0
% 4.72/2.43  # Initial clauses                      : 112
% 4.72/2.43  # Removed in clause preprocessing      : 0
% 4.72/2.43  # Initial clauses in saturation        : 112
% 4.72/2.43  # Processed clauses                    : 133
% 4.72/2.43  # ...of these trivial                  : 1
% 4.72/2.43  # ...subsumed                          : 0
% 4.72/2.43  # ...remaining for further processing  : 132
% 4.72/2.43  # Other redundant clauses eliminated   : 0
% 4.72/2.43  # Clauses deleted for lack of memory   : 0
% 4.72/2.43  # Backward-subsumed                    : 0
% 4.72/2.43  # Backward-rewritten                   : 7
% 4.72/2.43  # Generated clauses                    : 181
% 4.72/2.43  # ...of the previous two non-trivial   : 176
% 4.72/2.43  # Contextual simplify-reflections      : 0
% 4.72/2.43  # Paramodulations                      : 181
% 4.72/2.43  # Factorizations                       : 0
% 4.72/2.43  # Equation resolutions                 : 0
% 4.72/2.43  # Propositional unsat checks           : 0
% 4.72/2.43  # Propositional unsat check successes  : 0
% 4.72/2.43  # Current number of processed clauses  : 125
% 4.72/2.43  #    Positive orientable unit clauses  : 9
% 4.72/2.43  #    Positive unorientable unit clauses: 0
% 4.72/2.43  #    Negative unit clauses             : 1
% 4.72/2.43  #    Non-unit-clauses                  : 115
% 4.72/2.43  # Current number of unprocessed clauses: 149
% 4.72/2.43  # ...number of literals in the above   : 1016
% 4.72/2.43  # Current number of archived formulas  : 0
% 4.72/2.43  # Current number of archived clauses   : 7
% 4.72/2.43  # Clause-clause subsumption calls (NU) : 4723
% 4.72/2.43  # Rec. Clause-clause subsumption calls : 2122
% 4.72/2.43  # Non-unit clause-clause subsumptions  : 0
% 4.72/2.43  # Unit Clause-clause subsumption calls : 247
% 4.72/2.43  # Rewrite failures with RHS unbound    : 0
% 4.72/2.43  # BW rewrite match attempts            : 1
% 4.72/2.43  # BW rewrite match successes           : 1
% 4.72/2.43  # Condensation attempts                : 0
% 4.72/2.43  # Condensation successes               : 0
% 4.72/2.43  # Termbank termtop insertions          : 7857
% 4.72/2.43  
% 4.72/2.43  # -------------------------------------------------
% 4.72/2.43  # User time                : 0.023 s
% 4.72/2.43  # System time              : 0.007 s
% 4.72/2.43  # Total time               : 0.030 s
% 4.72/2.43  # ...preprocessing         : 0.020 s
% 4.72/2.43  # ...main loop             : 0.010 s
% 4.72/2.43  # Maximum resident set size: 7132 pages
% 4.72/2.43  
%------------------------------------------------------------------------------