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

View Problem - Process Solution

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

% Computer : n022.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 09:17:06 EDT 2022

% Result   : Theorem 0.22s 1.40s
% Output   : CNFRefutation 0.22s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   13 (   6 unt;   0 def)
%            Number of atoms       :   34 (  22 equ)
%            Maximal formula atoms :   12 (   2 avg)
%            Number of connectives :   39 (  18   ~;  14   |;   4   &)
%                                         (   3 <=>;   0  =>;   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;   2 con; 0-2 aty)
%            Number of variables   :   24 (   6 sgn  16   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(d1_tarski,axiom,
    ! [X1,X2] :
      ( X2 = singleton(X1)
    <=> ! [X3] :
          ( in(X3,X2)
        <=> X3 = X1 ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d1_tarski) ).

fof(l1_zfmisc_1,conjecture,
    ! [X1] : singleton(X1) != empty_set,
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',l1_zfmisc_1) ).

fof(d1_xboole_0,axiom,
    ! [X1] :
      ( X1 = empty_set
    <=> ! [X2] : ~ in(X2,X1) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d1_xboole_0) ).

fof(c_0_3,plain,
    ! [X4,X5,X6,X6,X4,X5] :
      ( ( ~ in(X6,X5)
        | X6 = X4
        | X5 != singleton(X4) )
      & ( X6 != X4
        | in(X6,X5)
        | X5 != singleton(X4) )
      & ( ~ in(esk3_2(X4,X5),X5)
        | esk3_2(X4,X5) != X4
        | X5 = singleton(X4) )
      & ( in(esk3_2(X4,X5),X5)
        | esk3_2(X4,X5) = X4
        | X5 = singleton(X4) ) ),
    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)],[d1_tarski])])])])])])]) ).

fof(c_0_4,negated_conjecture,
    ~ ! [X1] : singleton(X1) != empty_set,
    inference(assume_negation,[status(cth)],[l1_zfmisc_1]) ).

cnf(c_0_5,plain,
    ( in(X3,X1)
    | X1 != singleton(X2)
    | X3 != X2 ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

fof(c_0_6,negated_conjecture,
    singleton(esk1_0) = empty_set,
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).

fof(c_0_7,plain,
    ! [X3,X4,X3] :
      ( ( X3 != empty_set
        | ~ in(X4,X3) )
      & ( in(esk2_1(X3),X3)
        | X3 = empty_set ) ),
    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)],[inference(fof_simplification,[status(thm)],[d1_xboole_0])])])])])])]) ).

cnf(c_0_8,plain,
    ( in(X1,X2)
    | X2 != singleton(X1) ),
    inference(er,[status(thm)],[c_0_5]) ).

cnf(c_0_9,negated_conjecture,
    singleton(esk1_0) = empty_set,
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_10,plain,
    ( ~ in(X1,X2)
    | X2 != empty_set ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_11,negated_conjecture,
    X1 != empty_set,
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SEU143+1 : TPTP v8.1.0. Released v3.3.0.
% 0.11/0.12  % Command  : run_ET %s %d
% 0.12/0.33  % Computer : n022.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 : Mon Jun 20 09:35:46 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.22/1.40  # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.22/1.40  # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.22/1.40  # Preprocessing time       : 0.014 s
% 0.22/1.40  
% 0.22/1.40  # Proof found!
% 0.22/1.40  # SZS status Theorem
% 0.22/1.40  # SZS output start CNFRefutation
% See solution above
% 0.22/1.40  # Proof object total steps             : 13
% 0.22/1.40  # Proof object clause steps            : 6
% 0.22/1.40  # Proof object formula steps           : 7
% 0.22/1.40  # Proof object conjectures             : 6
% 0.22/1.40  # Proof object clause conjectures      : 3
% 0.22/1.40  # Proof object formula conjectures     : 3
% 0.22/1.40  # Proof object initial clauses used    : 3
% 0.22/1.40  # Proof object initial formulas used   : 3
% 0.22/1.40  # Proof object generating inferences   : 1
% 0.22/1.40  # Proof object simplifying inferences  : 3
% 0.22/1.40  # Training examples: 0 positive, 0 negative
% 0.22/1.40  # Parsed axioms                        : 9
% 0.22/1.40  # Removed by relevancy pruning/SinE    : 2
% 0.22/1.40  # Initial clauses                      : 11
% 0.22/1.40  # Removed in clause preprocessing      : 0
% 0.22/1.40  # Initial clauses in saturation        : 11
% 0.22/1.40  # Processed clauses                    : 17
% 0.22/1.40  # ...of these trivial                  : 0
% 0.22/1.40  # ...subsumed                          : 0
% 0.22/1.40  # ...remaining for further processing  : 17
% 0.22/1.40  # Other redundant clauses eliminated   : 1
% 0.22/1.40  # Clauses deleted for lack of memory   : 0
% 0.22/1.40  # Backward-subsumed                    : 0
% 0.22/1.40  # Backward-rewritten                   : 0
% 0.22/1.40  # Generated clauses                    : 18
% 0.22/1.40  # ...of the previous two non-trivial   : 13
% 0.22/1.40  # Contextual simplify-reflections      : 1
% 0.22/1.40  # Paramodulations                      : 11
% 0.22/1.40  # Factorizations                       : 0
% 0.22/1.40  # Equation resolutions                 : 5
% 0.22/1.40  # Current number of processed clauses  : 14
% 0.22/1.40  #    Positive orientable unit clauses  : 2
% 0.22/1.40  #    Positive unorientable unit clauses: 0
% 0.22/1.40  #    Negative unit clauses             : 2
% 0.22/1.40  #    Non-unit-clauses                  : 10
% 0.22/1.40  # Current number of unprocessed clauses: 6
% 0.22/1.40  # ...number of literals in the above   : 13
% 0.22/1.40  # Current number of archived formulas  : 0
% 0.22/1.40  # Current number of archived clauses   : 2
% 0.22/1.40  # Clause-clause subsumption calls (NU) : 3
% 0.22/1.40  # Rec. Clause-clause subsumption calls : 3
% 0.22/1.40  # Non-unit clause-clause subsumptions  : 1
% 0.22/1.40  # Unit Clause-clause subsumption calls : 2
% 0.22/1.40  # Rewrite failures with RHS unbound    : 0
% 0.22/1.40  # BW rewrite match attempts            : 0
% 0.22/1.40  # BW rewrite match successes           : 0
% 0.22/1.40  # Condensation attempts                : 0
% 0.22/1.40  # Condensation successes               : 0
% 0.22/1.40  # Termbank termtop insertions          : 601
% 0.22/1.40  
% 0.22/1.40  # -------------------------------------------------
% 0.22/1.40  # User time                : 0.012 s
% 0.22/1.40  # System time              : 0.003 s
% 0.22/1.40  # Total time               : 0.015 s
% 0.22/1.40  # Maximum resident set size: 2764 pages
%------------------------------------------------------------------------------