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

% Computer : art06.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:58:06 EST 2010

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

% Comments : 
%------------------------------------------------------------------------------
fof(19,axiom,
    ! [X1,X2] :
      ( in(X1,X2)
     => subset(X1,union(X2)) ),
    file('/tmp/tmplGtt1W/sel_SEU163+2.p_1',l50_zfmisc_1) ).

fof(61,conjecture,
    ! [X1,X2] :
      ( in(X1,X2)
     => subset(X1,union(X2)) ),
    file('/tmp/tmplGtt1W/sel_SEU163+2.p_1',t92_zfmisc_1) ).

fof(94,negated_conjecture,
    ~ ! [X1,X2] :
        ( in(X1,X2)
       => subset(X1,union(X2)) ),
    inference(assume_negation,[status(cth)],[61]) ).

fof(161,plain,
    ! [X1,X2] :
      ( ~ in(X1,X2)
      | subset(X1,union(X2)) ),
    inference(fof_nnf,[status(thm)],[19]) ).

fof(162,plain,
    ! [X3,X4] :
      ( ~ in(X3,X4)
      | subset(X3,union(X4)) ),
    inference(variable_rename,[status(thm)],[161]) ).

cnf(163,plain,
    ( subset(X1,union(X2))
    | ~ in(X1,X2) ),
    inference(split_conjunct,[status(thm)],[162]) ).

fof(303,negated_conjecture,
    ? [X1,X2] :
      ( in(X1,X2)
      & ~ subset(X1,union(X2)) ),
    inference(fof_nnf,[status(thm)],[94]) ).

fof(304,negated_conjecture,
    ? [X3,X4] :
      ( in(X3,X4)
      & ~ subset(X3,union(X4)) ),
    inference(variable_rename,[status(thm)],[303]) ).

fof(305,negated_conjecture,
    ( in(esk7_0,esk8_0)
    & ~ subset(esk7_0,union(esk8_0)) ),
    inference(skolemize,[status(esa)],[304]) ).

cnf(306,negated_conjecture,
    ~ subset(esk7_0,union(esk8_0)),
    inference(split_conjunct,[status(thm)],[305]) ).

cnf(307,negated_conjecture,
    in(esk7_0,esk8_0),
    inference(split_conjunct,[status(thm)],[305]) ).

cnf(520,negated_conjecture,
    subset(esk7_0,union(esk8_0)),
    inference(spm,[status(thm)],[163,307,theory(equality)]) ).

cnf(522,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[520,306,theory(equality)]) ).

cnf(523,negated_conjecture,
    $false,
    522,
    [proof] ).

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