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

View Problem - Process Solution

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

% Computer : n014.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:48:46 EDT 2022

% Result   : Theorem 0.24s 1.42s
% Output   : CNFRefutation 0.24s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   13 (   6 unt;   0 def)
%            Number of atoms       :   32 (  11 equ)
%            Maximal formula atoms :   11 (   2 avg)
%            Number of connectives :   34 (  15   ~;  11   |;   5   &)
%                                         (   1 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   13 (   4 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   :   21 (   6 sgn  15   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
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(corollary1_2,conjecture,
    ! [X1,X2] :
      ( member(X2,universal_class)
     => unordered_pair(X1,X2) != null_class ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',corollary1_2) ).

fof(null_class_defn,axiom,
    ! [X1] : ~ member(X1,null_class),
    file('/export/starexec/sandbox/benchmark/Axioms/SET005+0.ax',null_class_defn) ).

fof(c_0_3,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])])])])]) ).

fof(c_0_4,negated_conjecture,
    ~ ! [X1,X2] :
        ( member(X2,universal_class)
       => unordered_pair(X1,X2) != null_class ),
    inference(assume_negation,[status(cth)],[corollary1_2]) ).

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

fof(c_0_6,negated_conjecture,
    ( member(esk2_0,universal_class)
    & unordered_pair(esk1_0,esk2_0) = null_class ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).

fof(c_0_7,plain,
    ! [X2] : ~ member(X2,null_class),
    inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[null_class_defn])]) ).

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

cnf(c_0_9,negated_conjecture,
    unordered_pair(esk1_0,esk2_0) = null_class,
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_10,negated_conjecture,
    member(esk2_0,universal_class),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_11,plain,
    ~ member(X1,null_class),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : SET074+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% 0.07/0.13  % Command  : run_ET %s %d
% 0.13/0.34  % Computer : n014.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.35  % DateTime : Sat Jul  9 20:52:20 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.24/1.42  # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.24/1.42  # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.24/1.42  # Preprocessing time       : 0.015 s
% 0.24/1.42  
% 0.24/1.42  # Proof found!
% 0.24/1.42  # SZS status Theorem
% 0.24/1.42  # SZS output start CNFRefutation
% See solution above
% 0.24/1.42  # Proof object total steps             : 13
% 0.24/1.42  # Proof object clause steps            : 6
% 0.24/1.42  # Proof object formula steps           : 7
% 0.24/1.42  # Proof object conjectures             : 6
% 0.24/1.42  # Proof object clause conjectures      : 3
% 0.24/1.42  # Proof object formula conjectures     : 3
% 0.24/1.42  # Proof object initial clauses used    : 4
% 0.24/1.42  # Proof object initial formulas used   : 3
% 0.24/1.42  # Proof object generating inferences   : 1
% 0.24/1.42  # Proof object simplifying inferences  : 4
% 0.24/1.42  # Training examples: 0 positive, 0 negative
% 0.24/1.42  # Parsed axioms                        : 44
% 0.24/1.42  # Removed by relevancy pruning/SinE    : 37
% 0.24/1.42  # Initial clauses                      : 13
% 0.24/1.42  # Removed in clause preprocessing      : 2
% 0.24/1.42  # Initial clauses in saturation        : 11
% 0.24/1.42  # Processed clauses                    : 15
% 0.24/1.42  # ...of these trivial                  : 0
% 0.24/1.42  # ...subsumed                          : 2
% 0.24/1.42  # ...remaining for further processing  : 13
% 0.24/1.42  # Other redundant clauses eliminated   : 2
% 0.24/1.42  # Clauses deleted for lack of memory   : 0
% 0.24/1.42  # Backward-subsumed                    : 0
% 0.24/1.42  # Backward-rewritten                   : 0
% 0.24/1.42  # Generated clauses                    : 9
% 0.24/1.42  # ...of the previous two non-trivial   : 5
% 0.24/1.42  # Contextual simplify-reflections      : 0
% 0.24/1.42  # Paramodulations                      : 7
% 0.24/1.42  # Factorizations                       : 0
% 0.24/1.42  # Equation resolutions                 : 2
% 0.24/1.42  # Current number of processed clauses  : 11
% 0.24/1.42  #    Positive orientable unit clauses  : 4
% 0.24/1.42  #    Positive unorientable unit clauses: 0
% 0.24/1.42  #    Negative unit clauses             : 1
% 0.24/1.42  #    Non-unit-clauses                  : 6
% 0.24/1.42  # Current number of unprocessed clauses: 1
% 0.24/1.42  # ...number of literals in the above   : 2
% 0.24/1.42  # Current number of archived formulas  : 0
% 0.24/1.42  # Current number of archived clauses   : 2
% 0.24/1.42  # Clause-clause subsumption calls (NU) : 2
% 0.24/1.42  # Rec. Clause-clause subsumption calls : 2
% 0.24/1.42  # Non-unit clause-clause subsumptions  : 0
% 0.24/1.42  # Unit Clause-clause subsumption calls : 0
% 0.24/1.42  # Rewrite failures with RHS unbound    : 0
% 0.24/1.42  # BW rewrite match attempts            : 0
% 0.24/1.42  # BW rewrite match successes           : 0
% 0.24/1.42  # Condensation attempts                : 0
% 0.24/1.42  # Condensation successes               : 0
% 0.24/1.42  # Termbank termtop insertions          : 1141
% 0.24/1.42  
% 0.24/1.42  # -------------------------------------------------
% 0.24/1.42  # User time                : 0.014 s
% 0.24/1.42  # System time              : 0.002 s
% 0.24/1.42  # Total time               : 0.016 s
% 0.24/1.42  # Maximum resident set size: 2772 pages
%------------------------------------------------------------------------------