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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : SET117+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : enigmatic-eprover.py %s %d 1

% Computer : n029.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:09:41 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_87,plain,
    member(unordered_pair(X1,X2),universal_class),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6j45s08l/input.p',i_0_87) ).

cnf(i_0_13,negated_conjecture,
    unordered_pair(unordered_pair(first(esk2_0),first(esk2_0)),unordered_pair(first(esk2_0),unordered_pair(second(esk2_0),second(esk2_0)))) = esk2_0,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6j45s08l/input.p',i_0_13) ).

cnf(i_0_12,negated_conjecture,
    ~ member(esk2_0,universal_class),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6j45s08l/input.p',i_0_12) ).

cnf(c_0_91,plain,
    member(unordered_pair(X1,X2),universal_class),
    i_0_87 ).

cnf(c_0_92,negated_conjecture,
    unordered_pair(unordered_pair(first(esk2_0),first(esk2_0)),unordered_pair(first(esk2_0),unordered_pair(second(esk2_0),second(esk2_0)))) = esk2_0,
    i_0_13 ).

cnf(c_0_93,negated_conjecture,
    ~ member(esk2_0,universal_class),
    i_0_12 ).

cnf(c_0_94,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_91,c_0_92]),c_0_93]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem  : SET117+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% 0.12/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.34  % Computer : n029.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 : Sun Jul 10 05:32:02 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.20/0.45  # ENIGMATIC: Selected SinE mode:
% 0.20/0.46  # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.46  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.20/0.46  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.20/0.46  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 8.41/2.55  # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 8.41/2.55  # Version: 2.1pre011
% 8.41/2.55  # Preprocessing time       : 0.025 s
% 8.41/2.55  
% 8.41/2.55  # Proof found!
% 8.41/2.55  # SZS status Theorem
% 8.41/2.55  # SZS output start CNFRefutation
% See solution above
% 8.41/2.55  # Proof object total steps             : 7
% 8.41/2.55  # Proof object clause steps            : 4
% 8.41/2.55  # Proof object formula steps           : 3
% 8.41/2.55  # Proof object conjectures             : 5
% 8.41/2.55  # Proof object clause conjectures      : 3
% 8.41/2.55  # Proof object formula conjectures     : 2
% 8.41/2.55  # Proof object initial clauses used    : 3
% 8.41/2.55  # Proof object initial formulas used   : 3
% 8.41/2.55  # Proof object generating inferences   : 1
% 8.41/2.55  # Proof object simplifying inferences  : 1
% 8.41/2.55  # Training examples: 0 positive, 0 negative
% 8.41/2.55  # Parsed axioms                        : 83
% 8.41/2.55  # Removed by relevancy pruning/SinE    : 0
% 8.41/2.55  # Initial clauses                      : 83
% 8.41/2.55  # Removed in clause preprocessing      : 0
% 8.41/2.55  # Initial clauses in saturation        : 83
% 8.41/2.55  # Processed clauses                    : 21
% 8.41/2.55  # ...of these trivial                  : 0
% 8.41/2.55  # ...subsumed                          : 0
% 8.41/2.55  # ...remaining for further processing  : 21
% 8.41/2.55  # Other redundant clauses eliminated   : 2
% 8.41/2.55  # Clauses deleted for lack of memory   : 0
% 8.41/2.55  # Backward-subsumed                    : 0
% 8.41/2.55  # Backward-rewritten                   : 0
% 8.41/2.55  # Generated clauses                    : 7
% 8.41/2.55  # ...of the previous two non-trivial   : 6
% 8.41/2.55  # Contextual simplify-reflections      : 0
% 8.41/2.55  # Paramodulations                      : 5
% 8.41/2.55  # Factorizations                       : 0
% 8.41/2.55  # Equation resolutions                 : 2
% 8.41/2.55  # Propositional unsat checks           : 0
% 8.41/2.55  # Propositional unsat check successes  : 0
% 8.41/2.55  # Current number of processed clauses  : 19
% 8.41/2.55  #    Positive orientable unit clauses  : 10
% 8.41/2.55  #    Positive unorientable unit clauses: 0
% 8.41/2.55  #    Negative unit clauses             : 2
% 8.41/2.55  #    Non-unit-clauses                  : 7
% 8.41/2.55  # Current number of unprocessed clauses: 68
% 8.41/2.55  # ...number of literals in the above   : 156
% 8.41/2.55  # Current number of archived formulas  : 0
% 8.41/2.55  # Current number of archived clauses   : 0
% 8.41/2.55  # Clause-clause subsumption calls (NU) : 5
% 8.41/2.55  # Rec. Clause-clause subsumption calls : 5
% 8.41/2.55  # Non-unit clause-clause subsumptions  : 0
% 8.41/2.55  # Unit Clause-clause subsumption calls : 1
% 8.41/2.55  # Rewrite failures with RHS unbound    : 0
% 8.41/2.55  # BW rewrite match attempts            : 0
% 8.41/2.55  # BW rewrite match successes           : 0
% 8.41/2.55  # Condensation attempts                : 0
% 8.41/2.55  # Condensation successes               : 0
% 8.41/2.55  # Termbank termtop insertions          : 2133
% 8.41/2.55  
% 8.41/2.55  # -------------------------------------------------
% 8.41/2.55  # User time                : 0.021 s
% 8.41/2.55  # System time              : 0.005 s
% 8.41/2.55  # Total time               : 0.025 s
% 8.41/2.55  # ...preprocessing         : 0.025 s
% 8.41/2.55  # ...main loop             : 0.001 s
% 8.41/2.55  # Maximum resident set size: 7132 pages
% 8.41/2.55  
%------------------------------------------------------------------------------