%------------------------------------------------------------------------------
% File     : SInE---0.4
% Problem  : SEU123+1 : TPTP v5.0.0. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : Source/sine.py -e eprover -t %d %s

% Computer : art05.cs.miami.edu
% Model    : i686 i686
% CPU      : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory   : 2018MB
% OS       : Linux 2.6.26.8-57.fc8
% CPULimit : 300s
% DateTime : Sun Dec 26 04:43:09 EST 2010

% Result   : Theorem 0.17s
% Output   : CNFRefutation 0.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   20 (   8 unt;   0 def)
%            Number of atoms       :   47 (  18 equ)
%            Maximal formula atoms :    7 (   2 avg)
%            Number of connectives :   45 (  18   ~;  14   |;  10   &)
%                                         (   1 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :   17 (   1 sgn  12   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(1,axiom,
    ! [X1,X2] :
      ( X1 = X2
    <=> ( subset(X1,X2)
        & subset(X2,X1) ) ),
    file('/tmp/tmpHc4lmZ/sel_SEU123+1.p_1',d10_xboole_0) ).

fof(6,conjecture,
    ! [X1] :
      ( subset(X1,empty_set)
     => X1 = empty_set ),
    file('/tmp/tmpHc4lmZ/sel_SEU123+1.p_1',t3_xboole_1) ).

fof(10,axiom,
    ! [X1] : subset(empty_set,X1),
    file('/tmp/tmpHc4lmZ/sel_SEU123+1.p_1',t2_xboole_1) ).

fof(13,negated_conjecture,
    ~ ! [X1] :
        ( subset(X1,empty_set)
       => X1 = empty_set ),
    inference(assume_negation,[status(cth)],[6]) ).

fof(16,plain,
    ! [X1,X2] :
      ( ( X1 != X2
        | ( subset(X1,X2)
          & subset(X2,X1) ) )
      & ( ~ subset(X1,X2)
        | ~ subset(X2,X1)
        | X1 = X2 ) ),
    inference(fof_nnf,[status(thm)],[1]) ).

fof(17,plain,
    ! [X3,X4] :
      ( ( X3 != X4
        | ( subset(X3,X4)
          & subset(X4,X3) ) )
      & ( ~ subset(X3,X4)
        | ~ subset(X4,X3)
        | X3 = X4 ) ),
    inference(variable_rename,[status(thm)],[16]) ).

fof(18,plain,
    ! [X3,X4] :
      ( ( subset(X3,X4)
        | X3 != X4 )
      & ( subset(X4,X3)
        | X3 != X4 )
      & ( ~ subset(X3,X4)
        | ~ subset(X4,X3)
        | X3 = X4 ) ),
    inference(distribute,[status(thm)],[17]) ).

cnf(19,plain,
    ( X1 = X2
    | ~ subset(X2,X1)
    | ~ subset(X1,X2) ),
    inference(split_conjunct,[status(thm)],[18]) ).

fof(32,negated_conjecture,
    ? [X1] :
      ( subset(X1,empty_set)
      & X1 != empty_set ),
    inference(fof_nnf,[status(thm)],[13]) ).

fof(33,negated_conjecture,
    ? [X2] :
      ( subset(X2,empty_set)
      & X2 != empty_set ),
    inference(variable_rename,[status(thm)],[32]) ).

fof(34,negated_conjecture,
    ( subset(esk2_0,empty_set)
    & esk2_0 != empty_set ),
    inference(skolemize,[status(esa)],[33]) ).

cnf(35,negated_conjecture,
    esk2_0 != empty_set,
    inference(split_conjunct,[status(thm)],[34]) ).

cnf(36,negated_conjecture,
    subset(esk2_0,empty_set),
    inference(split_conjunct,[status(thm)],[34]) ).

fof(46,plain,
    ! [X2] : subset(empty_set,X2),
    inference(variable_rename,[status(thm)],[10]) ).

cnf(47,plain,
    subset(empty_set,X1),
    inference(split_conjunct,[status(thm)],[46]) ).

cnf(56,negated_conjecture,
    ( empty_set = esk2_0
    | ~ subset(empty_set,esk2_0) ),
    inference(spm,[status(thm)],[19,36,theory(equality)]) ).

cnf(58,negated_conjecture,
    ( empty_set = esk2_0
    | $false ),
    inference(rw,[status(thm)],[56,47,theory(equality)]) ).

cnf(59,negated_conjecture,
    empty_set = esk2_0,
    inference(cn,[status(thm)],[58,theory(equality)]) ).

cnf(60,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[59,35,theory(equality)]) ).

cnf(61,negated_conjecture,
    $false,
    60,
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SEU/SEU123+1.p
% --creating new selector for []
% -running prover on /tmp/tmpHc4lmZ/sel_SEU123+1.p_1 with time limit 29
% -prover status Theorem
% Problem SEU123+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SEU/SEU123+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SEU/SEU123+1.p
% Solved 1 out of 1.
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% See solution above
% # SZS output end CNFRefutation
% 
%------------------------------------------------------------------------------