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

% Computer : art04.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 03:00:26 EST 2010

% Result   : Theorem 0.24s
% Output   : CNFRefutation 0.24s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   17 (  13 unt;   0 def)
%            Number of atoms       :   25 (  13 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   18 (  10   ~;   5   |;   2   &)
%                                         (   1 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   2 con; 0-2 aty)
%            Number of variables   :   16 (   0 sgn  10   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(3,conjecture,
    ! [X1] : difference(X1,X1) = empty_set,
    file('/tmp/tmpYe4Upm/sel_SET602+3.p_1',prove_self_difference_is_empty_set) ).

fof(5,axiom,
    ! [X1,X2] :
      ( difference(X1,X2) = empty_set
    <=> subset(X1,X2) ),
    file('/tmp/tmpYe4Upm/sel_SET602+3.p_1',difference_empty_set) ).

fof(7,axiom,
    ! [X1] : subset(X1,X1),
    file('/tmp/tmpYe4Upm/sel_SET602+3.p_1',reflexivity_of_subset) ).

fof(9,negated_conjecture,
    ~ ! [X1] : difference(X1,X1) = empty_set,
    inference(assume_negation,[status(cth)],[3]) ).

fof(27,negated_conjecture,
    ? [X1] : difference(X1,X1) != empty_set,
    inference(fof_nnf,[status(thm)],[9]) ).

fof(28,negated_conjecture,
    ? [X2] : difference(X2,X2) != empty_set,
    inference(variable_rename,[status(thm)],[27]) ).

fof(29,negated_conjecture,
    difference(esk3_0,esk3_0) != empty_set,
    inference(skolemize,[status(esa)],[28]) ).

cnf(30,negated_conjecture,
    difference(esk3_0,esk3_0) != empty_set,
    inference(split_conjunct,[status(thm)],[29]) ).

fof(37,plain,
    ! [X1,X2] :
      ( ( difference(X1,X2) != empty_set
        | subset(X1,X2) )
      & ( ~ subset(X1,X2)
        | difference(X1,X2) = empty_set ) ),
    inference(fof_nnf,[status(thm)],[5]) ).

fof(38,plain,
    ! [X3,X4] :
      ( ( difference(X3,X4) != empty_set
        | subset(X3,X4) )
      & ( ~ subset(X3,X4)
        | difference(X3,X4) = empty_set ) ),
    inference(variable_rename,[status(thm)],[37]) ).

cnf(39,plain,
    ( difference(X1,X2) = empty_set
    | ~ subset(X1,X2) ),
    inference(split_conjunct,[status(thm)],[38]) ).

fof(47,plain,
    ! [X2] : subset(X2,X2),
    inference(variable_rename,[status(thm)],[7]) ).

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

cnf(61,plain,
    difference(X1,X1) = empty_set,
    inference(spm,[status(thm)],[39,48,theory(equality)]) ).

cnf(85,negated_conjecture,
    $false,
    inference(rw,[status(thm)],[30,61,theory(equality)]) ).

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

cnf(87,negated_conjecture,
    $false,
    86,
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SET/SET602+3.p
% --creating new selector for []
% -running prover on /tmp/tmpYe4Upm/sel_SET602+3.p_1 with time limit 29
% -prover status Theorem
% Problem SET602+3.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SET/SET602+3.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SET/SET602+3.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
% 
%------------------------------------------------------------------------------