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

% Computer : art11.cs.miami.edu
% Model    : i686 i686
% CPU      : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory   : 2006MB
% OS       : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Sun Dec 26 03:52:15 EST 2010

% Result   : Theorem 0.17s
% Output   : CNFRefutation 0.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   18 (   6 unt;   0 def)
%            Number of atoms       :   40 (  18 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   39 (  17   ~;  14   |;   5   &)
%                                         (   3 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    3 (   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   :   18 (   0 sgn  10   !;   4   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(1,conjecture,
    ! [X1,X2] :
      ( set_difference(singleton(X1),X2) = empty_set
    <=> in(X1,X2) ),
    file('/tmp/tmpyd6OHE/sel_SET925+1.p_1',t68_zfmisc_1) ).

fof(6,axiom,
    ! [X1,X2] :
      ( set_difference(singleton(X1),X2) = empty_set
    <=> in(X1,X2) ),
    file('/tmp/tmpyd6OHE/sel_SET925+1.p_1',l36_zfmisc_1) ).

fof(7,negated_conjecture,
    ~ ! [X1,X2] :
        ( set_difference(singleton(X1),X2) = empty_set
      <=> in(X1,X2) ),
    inference(assume_negation,[status(cth)],[1]) ).

fof(10,negated_conjecture,
    ? [X1,X2] :
      ( ( set_difference(singleton(X1),X2) != empty_set
        | ~ in(X1,X2) )
      & ( set_difference(singleton(X1),X2) = empty_set
        | in(X1,X2) ) ),
    inference(fof_nnf,[status(thm)],[7]) ).

fof(11,negated_conjecture,
    ? [X3,X4] :
      ( ( set_difference(singleton(X3),X4) != empty_set
        | ~ in(X3,X4) )
      & ( set_difference(singleton(X3),X4) = empty_set
        | in(X3,X4) ) ),
    inference(variable_rename,[status(thm)],[10]) ).

fof(12,negated_conjecture,
    ( ( set_difference(singleton(esk1_0),esk2_0) != empty_set
      | ~ in(esk1_0,esk2_0) )
    & ( set_difference(singleton(esk1_0),esk2_0) = empty_set
      | in(esk1_0,esk2_0) ) ),
    inference(skolemize,[status(esa)],[11]) ).

cnf(13,negated_conjecture,
    ( in(esk1_0,esk2_0)
    | set_difference(singleton(esk1_0),esk2_0) = empty_set ),
    inference(split_conjunct,[status(thm)],[12]) ).

cnf(14,negated_conjecture,
    ( ~ in(esk1_0,esk2_0)
    | set_difference(singleton(esk1_0),esk2_0) != empty_set ),
    inference(split_conjunct,[status(thm)],[12]) ).

fof(25,plain,
    ! [X1,X2] :
      ( ( set_difference(singleton(X1),X2) != empty_set
        | in(X1,X2) )
      & ( ~ in(X1,X2)
        | set_difference(singleton(X1),X2) = empty_set ) ),
    inference(fof_nnf,[status(thm)],[6]) ).

fof(26,plain,
    ! [X3,X4] :
      ( ( set_difference(singleton(X3),X4) != empty_set
        | in(X3,X4) )
      & ( ~ in(X3,X4)
        | set_difference(singleton(X3),X4) = empty_set ) ),
    inference(variable_rename,[status(thm)],[25]) ).

cnf(27,plain,
    ( set_difference(singleton(X1),X2) = empty_set
    | ~ in(X1,X2) ),
    inference(split_conjunct,[status(thm)],[26]) ).

cnf(28,plain,
    ( in(X1,X2)
    | set_difference(singleton(X1),X2) != empty_set ),
    inference(split_conjunct,[status(thm)],[26]) ).

cnf(31,negated_conjecture,
    set_difference(singleton(esk1_0),esk2_0) != empty_set,
    inference(csr,[status(thm)],[14,28]) ).

cnf(32,negated_conjecture,
    ~ in(esk1_0,esk2_0),
    inference(spm,[status(thm)],[31,27,theory(equality)]) ).

cnf(33,negated_conjecture,
    in(esk1_0,esk2_0),
    inference(sr,[status(thm)],[13,31,theory(equality)]) ).

cnf(35,negated_conjecture,
    $false,
    inference(rw,[status(thm)],[32,33,theory(equality)]) ).

cnf(36,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[35,theory(equality)]) ).

cnf(37,negated_conjecture,
    $false,
    36,
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% /home/graph/tptp/Systems/SInE---0.4/Source/sine.py:10: DeprecationWarning: the sets module is deprecated
%   from sets import Set
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SET/SET925+1.p
% --creating new selector for []
% -running prover on /tmp/tmpyd6OHE/sel_SET925+1.p_1 with time limit 29
% -prover status Theorem
% Problem SET925+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SET/SET925+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SET/SET925+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
% 
%------------------------------------------------------------------------------