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

View Problem - Process Solution

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

% Computer : n007.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:05 EDT 2022

% Result   : Theorem 7.20s 2.42s
% Output   : CNFRefutation 7.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   12
% Syntax   : Number of clauses     :   32 (  22 unt;   0 nHn;  32 RR)
%            Number of literals    :   71 (   0 equ;  43 neg)
%            Maximal clause size   :    7 (   2 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :    7 (   7 usr;   7 con; 0-0 aty)
%            Number of variables   :   24 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_80,negated_conjecture,
    ( apply(esk16_0,X1,X2)
    | ~ member(X2,esk15_0)
    | ~ member(X1,esk15_0)
    | ~ apply(esk17_0,X1,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t4hsdywc/input.p',i_0_80) ).

cnf(i_0_72,negated_conjecture,
    apply(esk17_0,esk19_0,esk21_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t4hsdywc/input.p',i_0_72) ).

cnf(i_0_74,negated_conjecture,
    member(esk21_0,esk15_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t4hsdywc/input.p',i_0_74) ).

cnf(i_0_76,negated_conjecture,
    member(esk19_0,esk15_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t4hsdywc/input.p',i_0_76) ).

cnf(i_0_57,plain,
    ( apply(X1,X2,X3)
    | ~ member(X3,X4)
    | ~ member(X5,X4)
    | ~ member(X2,X4)
    | ~ pre_order(X1,X4)
    | ~ apply(X1,X5,X3)
    | ~ apply(X1,X2,X5) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t4hsdywc/input.p',i_0_57) ).

cnf(i_0_81,negated_conjecture,
    pre_order(esk16_0,esk15_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t4hsdywc/input.p',i_0_81) ).

cnf(i_0_71,negated_conjecture,
    apply(esk16_0,esk18_0,esk19_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t4hsdywc/input.p',i_0_71) ).

cnf(i_0_79,negated_conjecture,
    ( apply(esk16_0,X1,X2)
    | ~ member(X2,esk15_0)
    | ~ member(X1,esk15_0)
    | ~ apply(esk17_0,X2,X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t4hsdywc/input.p',i_0_79) ).

cnf(i_0_73,negated_conjecture,
    apply(esk17_0,esk18_0,esk20_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t4hsdywc/input.p',i_0_73) ).

cnf(i_0_77,negated_conjecture,
    member(esk18_0,esk15_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t4hsdywc/input.p',i_0_77) ).

cnf(i_0_75,negated_conjecture,
    member(esk20_0,esk15_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t4hsdywc/input.p',i_0_75) ).

cnf(i_0_70,negated_conjecture,
    ~ apply(esk16_0,esk20_0,esk21_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t4hsdywc/input.p',i_0_70) ).

cnf(c_0_94,negated_conjecture,
    ( apply(esk16_0,X1,X2)
    | ~ member(X2,esk15_0)
    | ~ member(X1,esk15_0)
    | ~ apply(esk17_0,X1,X2) ),
    i_0_80 ).

cnf(c_0_95,negated_conjecture,
    apply(esk17_0,esk19_0,esk21_0),
    i_0_72 ).

cnf(c_0_96,negated_conjecture,
    member(esk21_0,esk15_0),
    i_0_74 ).

cnf(c_0_97,negated_conjecture,
    member(esk19_0,esk15_0),
    i_0_76 ).

cnf(c_0_98,plain,
    ( apply(X1,X2,X3)
    | ~ member(X3,X4)
    | ~ member(X5,X4)
    | ~ member(X2,X4)
    | ~ pre_order(X1,X4)
    | ~ apply(X1,X5,X3)
    | ~ apply(X1,X2,X5) ),
    i_0_57 ).

cnf(c_0_99,negated_conjecture,
    apply(esk16_0,esk19_0,esk21_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_94,c_0_95]),c_0_96]),c_0_97])]) ).

cnf(c_0_100,plain,
    ( apply(esk16_0,X1,esk21_0)
    | ~ apply(esk16_0,X1,esk19_0)
    | ~ pre_order(esk16_0,X2)
    | ~ member(esk19_0,X2)
    | ~ member(esk21_0,X2)
    | ~ member(X1,X2) ),
    inference(spm,[status(thm)],[c_0_98,c_0_99]) ).

cnf(c_0_101,negated_conjecture,
    pre_order(esk16_0,esk15_0),
    i_0_81 ).

cnf(c_0_102,negated_conjecture,
    apply(esk16_0,esk18_0,esk19_0),
    i_0_71 ).

cnf(c_0_103,negated_conjecture,
    ( apply(esk16_0,X1,X2)
    | ~ member(X2,esk15_0)
    | ~ member(X1,esk15_0)
    | ~ apply(esk17_0,X2,X1) ),
    i_0_79 ).

cnf(c_0_104,negated_conjecture,
    apply(esk17_0,esk18_0,esk20_0),
    i_0_73 ).

cnf(c_0_105,negated_conjecture,
    member(esk18_0,esk15_0),
    i_0_77 ).

cnf(c_0_106,negated_conjecture,
    member(esk20_0,esk15_0),
    i_0_75 ).

cnf(c_0_107,negated_conjecture,
    ~ apply(esk16_0,esk20_0,esk21_0),
    i_0_70 ).

cnf(c_0_108,negated_conjecture,
    ( apply(esk16_0,X1,esk21_0)
    | ~ apply(esk16_0,X1,esk19_0)
    | ~ member(X1,esk15_0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_100,c_0_101]),c_0_97]),c_0_96])]) ).

cnf(c_0_109,negated_conjecture,
    ( apply(esk16_0,X1,esk19_0)
    | ~ apply(esk16_0,X1,esk18_0)
    | ~ pre_order(esk16_0,X2)
    | ~ member(esk18_0,X2)
    | ~ member(esk19_0,X2)
    | ~ member(X1,X2) ),
    inference(spm,[status(thm)],[c_0_98,c_0_102]) ).

cnf(c_0_110,negated_conjecture,
    apply(esk16_0,esk20_0,esk18_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_103,c_0_104]),c_0_105]),c_0_106])]) ).

cnf(c_0_111,negated_conjecture,
    ~ apply(esk16_0,esk20_0,esk19_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_107,c_0_108]),c_0_106])]) ).

cnf(c_0_112,negated_conjecture,
    ( ~ pre_order(esk16_0,X1)
    | ~ member(esk18_0,X1)
    | ~ member(esk19_0,X1)
    | ~ member(esk20_0,X1) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_109,c_0_110]),c_0_111]) ).

cnf(c_0_113,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_112,c_0_101]),c_0_105]),c_0_97]),c_0_106])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SET776+4 : TPTP v8.1.0. Released v2.2.0.
% 0.07/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.34  % Computer : n007.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 08:24:04 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.46  # ENIGMATIC: Selected SinE mode:
% 0.19/0.46  # Parsing /export/starexec/sandbox2/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
% 7.20/2.42  # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 7.20/2.42  # Version: 2.1pre011
% 7.20/2.42  # Preprocessing time       : 0.012 s
% 7.20/2.42  
% 7.20/2.42  # Proof found!
% 7.20/2.42  # SZS status Theorem
% 7.20/2.42  # SZS output start CNFRefutation
% See solution above
% 7.20/2.42  # Proof object total steps             : 32
% 7.20/2.42  # Proof object clause steps            : 20
% 7.20/2.42  # Proof object formula steps           : 12
% 7.20/2.42  # Proof object conjectures             : 29
% 7.20/2.42  # Proof object clause conjectures      : 18
% 7.20/2.42  # Proof object formula conjectures     : 11
% 7.20/2.42  # Proof object initial clauses used    : 12
% 7.20/2.42  # Proof object initial formulas used   : 12
% 7.20/2.42  # Proof object generating inferences   : 8
% 7.20/2.42  # Proof object simplifying inferences  : 16
% 7.20/2.42  # Training examples: 0 positive, 0 negative
% 7.20/2.42  # Parsed axioms                        : 138
% 7.20/2.42  # Removed by relevancy pruning/SinE    : 0
% 7.20/2.42  # Initial clauses                      : 138
% 7.20/2.42  # Removed in clause preprocessing      : 0
% 7.20/2.42  # Initial clauses in saturation        : 138
% 7.20/2.42  # Processed clauses                    : 256
% 7.20/2.42  # ...of these trivial                  : 10
% 7.20/2.42  # ...subsumed                          : 14
% 7.20/2.42  # ...remaining for further processing  : 232
% 7.20/2.42  # Other redundant clauses eliminated   : 7
% 7.20/2.42  # Clauses deleted for lack of memory   : 0
% 7.20/2.42  # Backward-subsumed                    : 0
% 7.20/2.42  # Backward-rewritten                   : 0
% 7.20/2.42  # Generated clauses                    : 1783
% 7.20/2.42  # ...of the previous two non-trivial   : 1741
% 7.20/2.42  # Contextual simplify-reflections      : 3
% 7.20/2.42  # Paramodulations                      : 1772
% 7.20/2.42  # Factorizations                       : 4
% 7.20/2.42  # Equation resolutions                 : 7
% 7.20/2.42  # Propositional unsat checks           : 0
% 7.20/2.42  # Propositional unsat check successes  : 0
% 7.20/2.42  # Current number of processed clauses  : 229
% 7.20/2.42  #    Positive orientable unit clauses  : 32
% 7.20/2.42  #    Positive unorientable unit clauses: 0
% 7.20/2.42  #    Negative unit clauses             : 28
% 7.20/2.42  #    Non-unit-clauses                  : 169
% 7.20/2.42  # Current number of unprocessed clauses: 1622
% 7.20/2.42  # ...number of literals in the above   : 4586
% 7.20/2.42  # Current number of archived formulas  : 0
% 7.20/2.42  # Current number of archived clauses   : 0
% 7.20/2.42  # Clause-clause subsumption calls (NU) : 7521
% 7.20/2.42  # Rec. Clause-clause subsumption calls : 2651
% 7.20/2.42  # Non-unit clause-clause subsumptions  : 9
% 7.20/2.42  # Unit Clause-clause subsumption calls : 1361
% 7.20/2.42  # Rewrite failures with RHS unbound    : 0
% 7.20/2.42  # BW rewrite match attempts            : 19
% 7.20/2.42  # BW rewrite match successes           : 0
% 7.20/2.42  # Condensation attempts                : 0
% 7.20/2.42  # Condensation successes               : 0
% 7.20/2.42  # Termbank termtop insertions          : 24731
% 7.20/2.42  
% 7.20/2.42  # -------------------------------------------------
% 7.20/2.42  # User time                : 0.033 s
% 7.20/2.42  # System time              : 0.004 s
% 7.20/2.42  # Total time               : 0.037 s
% 7.20/2.42  # ...preprocessing         : 0.012 s
% 7.20/2.42  # ...main loop             : 0.025 s
% 7.20/2.42  # Maximum resident set size: 7132 pages
% 7.20/2.42  
%------------------------------------------------------------------------------