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

View Problem - Process Solution

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

% Computer : n020.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:49:06 EDT 2022

% Result   : Theorem 0.24s 1.41s
% Output   : CNFRefutation 0.24s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   34 (  12 unt;   0 def)
%            Number of atoms       :   92 (  35 equ)
%            Maximal formula atoms :   11 (   2 avg)
%            Number of connectives :   88 (  30   ~;  36   |;  15   &)
%                                         (   3 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   13 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   4 con; 0-2 aty)
%            Number of variables   :   55 (   7 sgn  31   !;   1   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(two_subsets_of_singleton,conjecture,
    ! [X1,X2] :
      ( subclass(X1,singleton(X2))
     => ( X1 = null_class
        | singleton(X2) = X1 ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',two_subsets_of_singleton) ).

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

fof(subclass_defn,axiom,
    ! [X1,X2] :
      ( subclass(X1,X2)
    <=> ! [X3] :
          ( member(X3,X1)
         => member(X3,X2) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET005+0.ax',subclass_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/sandbox/benchmark/Axioms/SET005+0.ax',unordered_pair_defn) ).

fof(regularity,axiom,
    ! [X1] :
      ( X1 != null_class
     => ? [X3] :
          ( member(X3,universal_class)
          & member(X3,X1)
          & disjoint(X3,X1) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET005+0.ax',regularity) ).

fof(extensionality,axiom,
    ! [X1,X2] :
      ( X1 = X2
    <=> ( subclass(X1,X2)
        & subclass(X2,X1) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET005+0.ax',extensionality) ).

fof(c_0_6,negated_conjecture,
    ~ ! [X1,X2] :
        ( subclass(X1,singleton(X2))
       => ( X1 = null_class
          | singleton(X2) = X1 ) ),
    inference(assume_negation,[status(cth)],[two_subsets_of_singleton]) ).

fof(c_0_7,negated_conjecture,
    ( subclass(esk8_0,singleton(esk9_0))
    & esk8_0 != null_class
    & singleton(esk9_0) != esk8_0 ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).

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

fof(c_0_9,plain,
    ! [X4,X5,X6,X4,X5] :
      ( ( ~ subclass(X4,X5)
        | ~ member(X6,X4)
        | member(X6,X5) )
      & ( member(esk1_2(X4,X5),X4)
        | subclass(X4,X5) )
      & ( ~ member(esk1_2(X4,X5),X5)
        | subclass(X4,X5) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[subclass_defn])])])])])])]) ).

cnf(c_0_10,negated_conjecture,
    subclass(esk8_0,singleton(esk9_0)),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

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

fof(c_0_12,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_13,plain,
    ( member(X1,X2)
    | ~ member(X1,X3)
    | ~ subclass(X3,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_14,negated_conjecture,
    subclass(esk8_0,unordered_pair(esk9_0,esk9_0)),
    inference(rw,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_15,plain,
    ( X1 = X3
    | X1 = X2
    | ~ member(X1,unordered_pair(X2,X3)) ),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_16,plain,
    ( subclass(X1,X2)
    | member(esk1_2(X1,X2),X1) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_17,negated_conjecture,
    ( member(X1,unordered_pair(esk9_0,esk9_0))
    | ~ member(X1,esk8_0) ),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

fof(c_0_18,plain,
    ! [X4] :
      ( ( member(esk6_1(X4),universal_class)
        | X4 = null_class )
      & ( member(esk6_1(X4),X4)
        | X4 = null_class )
      & ( disjoint(esk6_1(X4),X4)
        | X4 = null_class ) ),
    inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[regularity])])])])])]) ).

fof(c_0_19,plain,
    ! [X3,X4,X3,X4] :
      ( ( subclass(X3,X4)
        | X3 != X4 )
      & ( subclass(X4,X3)
        | X3 != X4 )
      & ( ~ subclass(X3,X4)
        | ~ subclass(X4,X3)
        | X3 = X4 ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[extensionality])])])])]) ).

cnf(c_0_20,negated_conjecture,
    singleton(esk9_0) != esk8_0,
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_21,plain,
    ( esk1_2(unordered_pair(X1,X2),X3) = X2
    | esk1_2(unordered_pair(X1,X2),X3) = X1
    | subclass(unordered_pair(X1,X2),X3) ),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_22,negated_conjecture,
    ( X1 = esk9_0
    | ~ member(X1,esk8_0) ),
    inference(spm,[status(thm)],[c_0_15,c_0_17]) ).

cnf(c_0_23,plain,
    ( X1 = null_class
    | member(esk6_1(X1),X1) ),
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

cnf(c_0_24,negated_conjecture,
    esk8_0 != null_class,
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_25,plain,
    ( X1 = X2
    | ~ subclass(X2,X1)
    | ~ subclass(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_19]) ).

cnf(c_0_26,negated_conjecture,
    unordered_pair(esk9_0,esk9_0) != esk8_0,
    inference(rw,[status(thm)],[c_0_20,c_0_11]) ).

cnf(c_0_27,plain,
    ( subclass(X1,X2)
    | ~ member(esk1_2(X1,X2),X2) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_28,plain,
    ( esk1_2(unordered_pair(X1,X1),X2) = X1
    | subclass(unordered_pair(X1,X1),X2) ),
    inference(er,[status(thm)],[inference(ef,[status(thm)],[c_0_21])]) ).

cnf(c_0_29,negated_conjecture,
    esk6_1(esk8_0) = esk9_0,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]) ).

cnf(c_0_30,negated_conjecture,
    ~ subclass(unordered_pair(esk9_0,esk9_0),esk8_0),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_14]),c_0_26]) ).

cnf(c_0_31,plain,
    ( subclass(unordered_pair(X1,X1),X2)
    | ~ member(X1,X2) ),
    inference(spm,[status(thm)],[c_0_27,c_0_28]) ).

cnf(c_0_32,negated_conjecture,
    member(esk9_0,esk8_0),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_29]),c_0_24]) ).

cnf(c_0_33,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem  : SET096+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% 0.12/0.13  % Command  : run_ET %s %d
% 0.14/0.34  % Computer : n020.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 600
% 0.14/0.34  % DateTime : Mon Jul 11 03:24:13 EDT 2022
% 0.14/0.34  % CPUTime  : 
% 0.24/1.41  # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.24/1.41  # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.24/1.41  # Preprocessing time       : 0.015 s
% 0.24/1.41  
% 0.24/1.41  # Failure: Out of unprocessed clauses!
% 0.24/1.41  # OLD status GaveUp
% 0.24/1.41  # Parsed axioms                        : 44
% 0.24/1.41  # Removed by relevancy pruning/SinE    : 39
% 0.24/1.41  # Initial clauses                      : 11
% 0.24/1.41  # Removed in clause preprocessing      : 0
% 0.24/1.41  # Initial clauses in saturation        : 11
% 0.24/1.41  # Processed clauses                    : 25
% 0.24/1.41  # ...of these trivial                  : 2
% 0.24/1.41  # ...subsumed                          : 3
% 0.24/1.41  # ...remaining for further processing  : 20
% 0.24/1.41  # Other redundant clauses eliminated   : 2
% 0.24/1.41  # Clauses deleted for lack of memory   : 0
% 0.24/1.41  # Backward-subsumed                    : 0
% 0.24/1.41  # Backward-rewritten                   : 0
% 0.24/1.41  # Generated clauses                    : 17
% 0.24/1.41  # ...of the previous two non-trivial   : 14
% 0.24/1.41  # Contextual simplify-reflections      : 0
% 0.24/1.41  # Paramodulations                      : 15
% 0.24/1.41  # Factorizations                       : 0
% 0.24/1.41  # Equation resolutions                 : 2
% 0.24/1.41  # Current number of processed clauses  : 18
% 0.24/1.41  #    Positive orientable unit clauses  : 4
% 0.24/1.41  #    Positive unorientable unit clauses: 0
% 0.24/1.41  #    Negative unit clauses             : 4
% 0.24/1.41  #    Non-unit-clauses                  : 10
% 0.24/1.41  # Current number of unprocessed clauses: 0
% 0.24/1.41  # ...number of literals in the above   : 0
% 0.24/1.41  # Current number of archived formulas  : 0
% 0.24/1.41  # Current number of archived clauses   : 0
% 0.24/1.41  # Clause-clause subsumption calls (NU) : 11
% 0.24/1.41  # Rec. Clause-clause subsumption calls : 11
% 0.24/1.41  # Non-unit clause-clause subsumptions  : 2
% 0.24/1.41  # Unit Clause-clause subsumption calls : 4
% 0.24/1.41  # Rewrite failures with RHS unbound    : 0
% 0.24/1.41  # BW rewrite match attempts            : 5
% 0.24/1.41  # BW rewrite match successes           : 0
% 0.24/1.41  # Condensation attempts                : 0
% 0.24/1.41  # Condensation successes               : 0
% 0.24/1.41  # Termbank termtop insertions          : 1089
% 0.24/1.41  
% 0.24/1.41  # -------------------------------------------------
% 0.24/1.41  # User time                : 0.012 s
% 0.24/1.41  # System time              : 0.004 s
% 0.24/1.41  # Total time               : 0.016 s
% 0.24/1.41  # Maximum resident set size: 2764 pages
% 0.24/1.41  # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.24/1.41  # Preprocessing time       : 0.019 s
% 0.24/1.41  
% 0.24/1.41  # Proof found!
% 0.24/1.41  # SZS status Theorem
% 0.24/1.41  # SZS output start CNFRefutation
% See solution above
% 0.24/1.41  # Proof object total steps             : 34
% 0.24/1.41  # Proof object clause steps            : 21
% 0.24/1.41  # Proof object formula steps           : 13
% 0.24/1.41  # Proof object conjectures             : 14
% 0.24/1.41  # Proof object clause conjectures      : 11
% 0.24/1.41  # Proof object formula conjectures     : 3
% 0.24/1.41  # Proof object initial clauses used    : 10
% 0.24/1.41  # Proof object initial formulas used   : 6
% 0.24/1.41  # Proof object generating inferences   : 9
% 0.24/1.41  # Proof object simplifying inferences  : 8
% 0.24/1.41  # Training examples: 0 positive, 0 negative
% 0.24/1.41  # Parsed axioms                        : 44
% 0.24/1.41  # Removed by relevancy pruning/SinE    : 0
% 0.24/1.41  # Initial clauses                      : 92
% 0.24/1.41  # Removed in clause preprocessing      : 8
% 0.24/1.41  # Initial clauses in saturation        : 84
% 0.24/1.41  # Processed clauses                    : 6557
% 0.24/1.41  # ...of these trivial                  : 13
% 0.24/1.41  # ...subsumed                          : 4851
% 0.24/1.41  # ...remaining for further processing  : 1693
% 0.24/1.41  # Other redundant clauses eliminated   : 23
% 0.24/1.41  # Clauses deleted for lack of memory   : 0
% 0.24/1.41  # Backward-subsumed                    : 95
% 0.24/1.41  # Backward-rewritten                   : 107
% 0.24/1.41  # Generated clauses                    : 52447
% 0.24/1.41  # ...of the previous two non-trivial   : 47885
% 0.24/1.41  # Contextual simplify-reflections      : 3067
% 0.24/1.41  # Paramodulations                      : 52383
% 0.24/1.41  # Factorizations                       : 39
% 0.24/1.41  # Equation resolutions                 : 25
% 0.24/1.41  # Current number of processed clauses  : 1487
% 0.24/1.41  #    Positive orientable unit clauses  : 99
% 0.24/1.41  #    Positive unorientable unit clauses: 0
% 0.24/1.41  #    Negative unit clauses             : 39
% 0.24/1.41  #    Non-unit-clauses                  : 1349
% 0.24/1.41  # Current number of unprocessed clauses: 39063
% 0.24/1.41  # ...number of literals in the above   : 148874
% 0.24/1.41  # Current number of archived formulas  : 0
% 0.24/1.41  # Current number of archived clauses   : 210
% 0.24/1.41  # Clause-clause subsumption calls (NU) : 708746
% 0.24/1.41  # Rec. Clause-clause subsumption calls : 452648
% 0.24/1.41  # Non-unit clause-clause subsumptions  : 6558
% 0.24/1.41  # Unit Clause-clause subsumption calls : 12372
% 0.24/1.41  # Rewrite failures with RHS unbound    : 0
% 0.24/1.41  # BW rewrite match attempts            : 68
% 0.24/1.41  # BW rewrite match successes           : 21
% 0.24/1.41  # Condensation attempts                : 0
% 0.24/1.41  # Condensation successes               : 0
% 0.24/1.41  # Termbank termtop insertions          : 1298859
% 0.24/1.41  
% 0.24/1.41  # -------------------------------------------------
% 0.24/1.41  # User time                : 0.848 s
% 0.24/1.41  # System time              : 0.023 s
% 0.24/1.41  # Total time               : 0.871 s
% 0.24/1.41  # Maximum resident set size: 41652 pages
% 0.24/23.51  eprover: CPU time limit exceeded, terminating
% 0.24/23.54  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.54  eprover: No such file or directory
% 0.24/23.54  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.54  eprover: No such file or directory
% 0.24/23.54  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.54  eprover: No such file or directory
% 0.24/23.55  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.55  eprover: No such file or directory
% 0.24/23.55  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.55  eprover: No such file or directory
% 0.24/23.55  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.55  eprover: No such file or directory
% 0.24/23.56  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.56  eprover: No such file or directory
% 0.24/23.56  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.56  eprover: No such file or directory
%------------------------------------------------------------------------------