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

% Computer : art03.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:14 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(4,conjecture,
    ! [X1] :
      ( subset(X1,empty_set)
     => X1 = empty_set ),
    file('/tmp/tmpQJBked/sel_SEU123+2.p_1',t3_xboole_1) ).

fof(16,axiom,
    ! [X1,X2] :
      ( X1 = X2
    <=> ( subset(X1,X2)
        & subset(X2,X1) ) ),
    file('/tmp/tmpQJBked/sel_SEU123+2.p_1',d10_xboole_0) ).

fof(23,axiom,
    ! [X1] : subset(empty_set,X1),
    file('/tmp/tmpQJBked/sel_SEU123+2.p_1',t2_xboole_1) ).

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

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

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

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

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

cnf(42,negated_conjecture,
    subset(esk2_0,empty_set),
    inference(split_conjunct,[status(thm)],[40]) ).

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

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

fof(89,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)],[88]) ).

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

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

cnf(118,plain,
    subset(empty_set,X1),
    inference(split_conjunct,[status(thm)],[117]) ).

cnf(124,negated_conjecture,
    ( empty_set = esk2_0
    | ~ subset(empty_set,esk2_0) ),
    inference(spm,[status(thm)],[90,42,theory(equality)]) ).

cnf(126,negated_conjecture,
    ( empty_set = esk2_0
    | $false ),
    inference(rw,[status(thm)],[124,118,theory(equality)]) ).

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

cnf(128,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[127,41,theory(equality)]) ).

cnf(129,negated_conjecture,
    $false,
    128,
    [proof] ).

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