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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : ET---2.0
% Problem  : SET900+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_ET %s %d

% Computer : n019.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:55:18 EDT 2022

% Result   : Theorem 0.22s 1.41s
% Output   : CNFRefutation 0.22s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   13 (   3 unt;   0 def)
%            Number of atoms       :   37 (  29 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   49 (  25   ~;  12   |;  12   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   19 (   0 sgn  12   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(t41_zfmisc_1,conjecture,
    ! [X1,X2] :
      ~ ( X1 != singleton(X2)
        & X1 != empty_set
        & ! [X3] :
            ~ ( in(X3,X1)
              & X3 != X2 ) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t41_zfmisc_1) ).

fof(l45_zfmisc_1,axiom,
    ! [X1,X2] :
      ~ ( X1 != singleton(X2)
        & X1 != empty_set
        & ! [X3] :
            ~ ( in(X3,X1)
              & X3 != X2 ) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',l45_zfmisc_1) ).

fof(c_0_2,negated_conjecture,
    ~ ! [X1,X2] :
        ~ ( X1 != singleton(X2)
          & X1 != empty_set
          & ! [X3] :
              ~ ( in(X3,X1)
                & X3 != X2 ) ),
    inference(assume_negation,[status(cth)],[t41_zfmisc_1]) ).

fof(c_0_3,negated_conjecture,
    ! [X6] :
      ( esk1_0 != singleton(esk2_0)
      & esk1_0 != empty_set
      & ( ~ in(X6,esk1_0)
        | X6 = esk2_0 ) ),
    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)],[c_0_2])])])])])]) ).

fof(c_0_4,plain,
    ! [X4,X5] :
      ( ( in(esk3_2(X4,X5),X4)
        | X4 = singleton(X5)
        | X4 = empty_set )
      & ( esk3_2(X4,X5) != X5
        | X4 = singleton(X5)
        | X4 = empty_set ) ),
    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)],[l45_zfmisc_1])])])])])]) ).

cnf(c_0_5,negated_conjecture,
    ( X1 = esk2_0
    | ~ in(X1,esk1_0) ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_6,plain,
    ( X1 = empty_set
    | X1 = singleton(X2)
    | in(esk3_2(X1,X2),X1) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_7,negated_conjecture,
    esk1_0 != empty_set,
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_8,plain,
    ( X1 = empty_set
    | X1 = singleton(X2)
    | esk3_2(X1,X2) != X2 ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_9,negated_conjecture,
    ( esk3_2(esk1_0,X1) = esk2_0
    | singleton(X1) = esk1_0 ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_7]) ).

cnf(c_0_10,negated_conjecture,
    esk1_0 != singleton(esk2_0),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_11,negated_conjecture,
    ( singleton(X1) = esk1_0
    | esk2_0 != X1 ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_7]) ).

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

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