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

View Problem - Process Solution

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

% Computer : n013.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:03 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_89,plain,
    ( member(X1,unordered_pair(X2,X3))
    | X1 != X2
    | ~ member(X1,universal_class) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jbdc3i7o/input.p',i_0_89) ).

cnf(i_0_12,negated_conjecture,
    unordered_pair(esk2_0,esk3_0) = null_class,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jbdc3i7o/input.p',i_0_12) ).

cnf(i_0_13,negated_conjecture,
    member(esk2_0,universal_class),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jbdc3i7o/input.p',i_0_13) ).

cnf(i_0_54,plain,
    ~ member(X1,null_class),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jbdc3i7o/input.p',i_0_54) ).

cnf(c_0_94,plain,
    ( member(X1,unordered_pair(X2,X3))
    | X1 != X2
    | ~ member(X1,universal_class) ),
    i_0_89 ).

cnf(c_0_95,plain,
    ( member(X1,unordered_pair(X1,X2))
    | ~ member(X1,universal_class) ),
    inference(er,[status(thm)],[c_0_94]) ).

cnf(c_0_96,negated_conjecture,
    unordered_pair(esk2_0,esk3_0) = null_class,
    i_0_12 ).

cnf(c_0_97,negated_conjecture,
    member(esk2_0,universal_class),
    i_0_13 ).

cnf(c_0_98,plain,
    ~ member(X1,null_class),
    i_0_54 ).

cnf(c_0_99,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_95,c_0_96]),c_0_97])]),c_0_98]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : SET073+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% 0.03/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.33  % Computer : n013.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 600
% 0.13/0.33  % DateTime : Mon Jul 11 09:24:46 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 0.19/0.44  # ENIGMATIC: Selected SinE mode:
% 0.19/0.45  # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.45  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.19/0.45  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.19/0.45  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 6.70/2.22  # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 6.70/2.22  # Version: 2.1pre011
% 6.70/2.22  # Preprocessing time       : 0.012 s
% 6.70/2.22  
% 6.70/2.22  # Proof found!
% 6.70/2.22  # SZS status Theorem
% 6.70/2.22  # SZS output start CNFRefutation
% See solution above
% 6.70/2.22  # Proof object total steps             : 10
% 6.70/2.22  # Proof object clause steps            : 6
% 6.70/2.22  # Proof object formula steps           : 4
% 6.70/2.22  # Proof object conjectures             : 5
% 6.70/2.22  # Proof object clause conjectures      : 3
% 6.70/2.22  # Proof object formula conjectures     : 2
% 6.70/2.22  # Proof object initial clauses used    : 4
% 6.70/2.22  # Proof object initial formulas used   : 4
% 6.70/2.22  # Proof object generating inferences   : 1
% 6.70/2.22  # Proof object simplifying inferences  : 4
% 6.70/2.22  # Training examples: 0 positive, 0 negative
% 6.70/2.22  # Parsed axioms                        : 83
% 6.70/2.22  # Removed by relevancy pruning/SinE    : 0
% 6.70/2.22  # Initial clauses                      : 83
% 6.70/2.22  # Removed in clause preprocessing      : 0
% 6.70/2.22  # Initial clauses in saturation        : 83
% 6.70/2.22  # Processed clauses                    : 100
% 6.70/2.22  # ...of these trivial                  : 1
% 6.70/2.22  # ...subsumed                          : 3
% 6.70/2.22  # ...remaining for further processing  : 96
% 6.70/2.22  # Other redundant clauses eliminated   : 5
% 6.70/2.22  # Clauses deleted for lack of memory   : 0
% 6.70/2.22  # Backward-subsumed                    : 4
% 6.70/2.22  # Backward-rewritten                   : 2
% 6.70/2.22  # Generated clauses                    : 256
% 6.70/2.22  # ...of the previous two non-trivial   : 223
% 6.70/2.22  # Contextual simplify-reflections      : 0
% 6.70/2.22  # Paramodulations                      : 249
% 6.70/2.22  # Factorizations                       : 0
% 6.70/2.22  # Equation resolutions                 : 7
% 6.70/2.22  # Propositional unsat checks           : 0
% 6.70/2.22  # Propositional unsat check successes  : 0
% 6.70/2.22  # Current number of processed clauses  : 86
% 6.70/2.22  #    Positive orientable unit clauses  : 18
% 6.70/2.22  #    Positive unorientable unit clauses: 0
% 6.70/2.22  #    Negative unit clauses             : 3
% 6.70/2.22  #    Non-unit-clauses                  : 65
% 6.70/2.22  # Current number of unprocessed clauses: 177
% 6.70/2.22  # ...number of literals in the above   : 481
% 6.70/2.22  # Current number of archived formulas  : 0
% 6.70/2.22  # Current number of archived clauses   : 6
% 6.70/2.22  # Clause-clause subsumption calls (NU) : 911
% 6.70/2.22  # Rec. Clause-clause subsumption calls : 818
% 6.70/2.22  # Non-unit clause-clause subsumptions  : 6
% 6.70/2.22  # Unit Clause-clause subsumption calls : 180
% 6.70/2.22  # Rewrite failures with RHS unbound    : 0
% 6.70/2.22  # BW rewrite match attempts            : 15
% 6.70/2.22  # BW rewrite match successes           : 2
% 6.70/2.22  # Condensation attempts                : 0
% 6.70/2.22  # Condensation successes               : 0
% 6.70/2.22  # Termbank termtop insertions          : 7666
% 6.70/2.22  
% 6.70/2.22  # -------------------------------------------------
% 6.70/2.22  # User time                : 0.015 s
% 6.70/2.22  # System time              : 0.003 s
% 6.70/2.22  # Total time               : 0.018 s
% 6.70/2.22  # ...preprocessing         : 0.012 s
% 6.70/2.22  # ...main loop             : 0.005 s
% 6.70/2.22  # Maximum resident set size: 7136 pages
% 6.70/2.22  
%------------------------------------------------------------------------------