TSTP Solution File: SET024+1 by ET---2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : ET---2.0
% Problem  : SET024+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_ET %s %d

% Computer : n015.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:47:56 EDT 2022

% Result   : Theorem 0.21s 1.40s
% Output   : CNFRefutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   14 (   7 unt;   0 def)
%            Number of atoms       :   33 (  10 equ)
%            Maximal formula atoms :   11 (   2 avg)
%            Number of connectives :   32 (  13   ~;  11   |;   5   &)
%                                         (   1 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   13 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :   19 (   5 sgn  13   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(set_in_its_singleton,conjecture,
    ! [X1] :
      ( member(X1,universal_class)
     => member(X1,singleton(X1)) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',set_in_its_singleton) ).

fof(singleton_set_defn,axiom,
    ! [X1] : singleton(X1) = unordered_pair(X1,X1),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',singleton_set_defn) ).

fof(unordered_pair_defn,axiom,
    ! [X3,X1,X2] :
      ( member(X3,unordered_pair(X1,X2))
    <=> ( member(X3,universal_class)
        & ( X3 = X1
          | X3 = X2 ) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',unordered_pair_defn) ).

fof(c_0_3,negated_conjecture,
    ~ ! [X1] :
        ( member(X1,universal_class)
       => member(X1,singleton(X1)) ),
    inference(assume_negation,[status(cth)],[set_in_its_singleton]) ).

fof(c_0_4,negated_conjecture,
    ( member(esk8_0,universal_class)
    & ~ member(esk8_0,singleton(esk8_0)) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).

fof(c_0_5,plain,
    ! [X2] : singleton(X2) = unordered_pair(X2,X2),
    inference(variable_rename,[status(thm)],[singleton_set_defn]) ).

fof(c_0_6,plain,
    ! [X4,X5,X6,X4,X5,X6] :
      ( ( member(X4,universal_class)
        | ~ member(X4,unordered_pair(X5,X6)) )
      & ( X4 = X5
        | X4 = X6
        | ~ member(X4,unordered_pair(X5,X6)) )
      & ( X4 != X5
        | ~ member(X4,universal_class)
        | member(X4,unordered_pair(X5,X6)) )
      & ( X4 != X6
        | ~ member(X4,universal_class)
        | member(X4,unordered_pair(X5,X6)) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[unordered_pair_defn])])])])]) ).

cnf(c_0_7,negated_conjecture,
    ~ member(esk8_0,singleton(esk8_0)),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_8,plain,
    singleton(X1) = unordered_pair(X1,X1),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_9,plain,
    ( member(X1,unordered_pair(X2,X3))
    | ~ member(X1,universal_class)
    | X1 != X3 ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_10,negated_conjecture,
    ~ member(esk8_0,unordered_pair(esk8_0,esk8_0)),
    inference(rw,[status(thm)],[c_0_7,c_0_8]) ).

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

cnf(c_0_12,negated_conjecture,
    member(esk8_0,universal_class),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_13,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem  : SET024+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% 0.11/0.12  % Command  : run_ET %s %d
% 0.12/0.32  % Computer : n015.cluster.edu
% 0.12/0.32  % Model    : x86_64 x86_64
% 0.12/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32  % Memory   : 8042.1875MB
% 0.12/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32  % CPULimit : 300
% 0.12/0.32  % WCLimit  : 600
% 0.12/0.33  % DateTime : Sun Jul 10 09:08:38 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.21/1.40  # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.21/1.40  # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.21/1.40  # Preprocessing time       : 0.014 s
% 0.21/1.40  
% 0.21/1.40  # Failure: Out of unprocessed clauses!
% 0.21/1.40  # OLD status GaveUp
% 0.21/1.40  # Parsed axioms                        : 44
% 0.21/1.40  # Removed by relevancy pruning/SinE    : 43
% 0.21/1.40  # Initial clauses                      : 2
% 0.21/1.40  # Removed in clause preprocessing      : 0
% 0.21/1.40  # Initial clauses in saturation        : 2
% 0.21/1.40  # Processed clauses                    : 2
% 0.21/1.40  # ...of these trivial                  : 0
% 0.21/1.40  # ...subsumed                          : 0
% 0.21/1.40  # ...remaining for further processing  : 2
% 0.21/1.40  # Other redundant clauses eliminated   : 0
% 0.21/1.40  # Clauses deleted for lack of memory   : 0
% 0.21/1.40  # Backward-subsumed                    : 0
% 0.21/1.40  # Backward-rewritten                   : 0
% 0.21/1.40  # Generated clauses                    : 0
% 0.21/1.40  # ...of the previous two non-trivial   : 0
% 0.21/1.40  # Contextual simplify-reflections      : 0
% 0.21/1.40  # Paramodulations                      : 0
% 0.21/1.40  # Factorizations                       : 0
% 0.21/1.40  # Equation resolutions                 : 0
% 0.21/1.40  # Current number of processed clauses  : 2
% 0.21/1.40  #    Positive orientable unit clauses  : 1
% 0.21/1.40  #    Positive unorientable unit clauses: 0
% 0.21/1.40  #    Negative unit clauses             : 1
% 0.21/1.40  #    Non-unit-clauses                  : 0
% 0.21/1.40  # Current number of unprocessed clauses: 0
% 0.21/1.40  # ...number of literals in the above   : 0
% 0.21/1.40  # Current number of archived formulas  : 0
% 0.21/1.40  # Current number of archived clauses   : 0
% 0.21/1.40  # Clause-clause subsumption calls (NU) : 0
% 0.21/1.40  # Rec. Clause-clause subsumption calls : 0
% 0.21/1.40  # Non-unit clause-clause subsumptions  : 0
% 0.21/1.40  # Unit Clause-clause subsumption calls : 0
% 0.21/1.40  # Rewrite failures with RHS unbound    : 0
% 0.21/1.40  # BW rewrite match attempts            : 0
% 0.21/1.40  # BW rewrite match successes           : 0
% 0.21/1.40  # Condensation attempts                : 0
% 0.21/1.40  # Condensation successes               : 0
% 0.21/1.40  # Termbank termtop insertions          : 547
% 0.21/1.40  
% 0.21/1.40  # -------------------------------------------------
% 0.21/1.40  # User time                : 0.010 s
% 0.21/1.40  # System time              : 0.004 s
% 0.21/1.40  # Total time               : 0.014 s
% 0.21/1.40  # Maximum resident set size: 2716 pages
% 0.21/1.40  # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.21/1.40  # Preprocessing time       : 0.019 s
% 0.21/1.40  
% 0.21/1.40  # Proof found!
% 0.21/1.40  # SZS status Theorem
% 0.21/1.40  # SZS output start CNFRefutation
% See solution above
% 0.21/1.40  # Proof object total steps             : 14
% 0.21/1.40  # Proof object clause steps            : 7
% 0.21/1.40  # Proof object formula steps           : 7
% 0.21/1.40  # Proof object conjectures             : 7
% 0.21/1.40  # Proof object clause conjectures      : 4
% 0.21/1.40  # Proof object formula conjectures     : 3
% 0.21/1.40  # Proof object initial clauses used    : 4
% 0.21/1.40  # Proof object initial formulas used   : 3
% 0.21/1.40  # Proof object generating inferences   : 1
% 0.21/1.40  # Proof object simplifying inferences  : 4
% 0.21/1.40  # Training examples: 0 positive, 0 negative
% 0.21/1.40  # Parsed axioms                        : 44
% 0.21/1.40  # Removed by relevancy pruning/SinE    : 0
% 0.21/1.40  # Initial clauses                      : 91
% 0.21/1.40  # Removed in clause preprocessing      : 8
% 0.21/1.40  # Initial clauses in saturation        : 83
% 0.21/1.40  # Processed clauses                    : 91
% 0.21/1.40  # ...of these trivial                  : 0
% 0.21/1.40  # ...subsumed                          : 0
% 0.21/1.40  # ...remaining for further processing  : 91
% 0.21/1.40  # Other redundant clauses eliminated   : 5
% 0.21/1.40  # Clauses deleted for lack of memory   : 0
% 0.21/1.40  # Backward-subsumed                    : 4
% 0.21/1.40  # Backward-rewritten                   : 1
% 0.21/1.40  # Generated clauses                    : 236
% 0.21/1.40  # ...of the previous two non-trivial   : 203
% 0.21/1.40  # Contextual simplify-reflections      : 0
% 0.21/1.40  # Paramodulations                      : 229
% 0.21/1.40  # Factorizations                       : 0
% 0.21/1.40  # Equation resolutions                 : 7
% 0.21/1.40  # Current number of processed clauses  : 82
% 0.21/1.40  #    Positive orientable unit clauses  : 14
% 0.21/1.40  #    Positive unorientable unit clauses: 0
% 0.21/1.40  #    Negative unit clauses             : 2
% 0.21/1.40  #    Non-unit-clauses                  : 66
% 0.21/1.40  # Current number of unprocessed clauses: 170
% 0.21/1.40  # ...number of literals in the above   : 468
% 0.21/1.40  # Current number of archived formulas  : 0
% 0.21/1.40  # Current number of archived clauses   : 13
% 0.21/1.40  # Clause-clause subsumption calls (NU) : 724
% 0.21/1.40  # Rec. Clause-clause subsumption calls : 654
% 0.21/1.40  # Non-unit clause-clause subsumptions  : 4
% 0.21/1.40  # Unit Clause-clause subsumption calls : 71
% 0.21/1.40  # Rewrite failures with RHS unbound    : 0
% 0.21/1.40  # BW rewrite match attempts            : 16
% 0.21/1.40  # BW rewrite match successes           : 1
% 0.21/1.40  # Condensation attempts                : 0
% 0.21/1.40  # Condensation successes               : 0
% 0.21/1.40  # Termbank termtop insertions          : 10780
% 0.21/1.40  
% 0.21/1.40  # -------------------------------------------------
% 0.21/1.40  # User time                : 0.024 s
% 0.21/1.40  # System time              : 0.003 s
% 0.21/1.40  # Total time               : 0.027 s
% 0.21/1.40  # Maximum resident set size: 3368 pages
%------------------------------------------------------------------------------