%------------------------------------------------------------------------------
% File     : SInE---0.4
% Problem  : SEU294+2 : 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 06:54:57 EST 2010

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

% Comments : 
%------------------------------------------------------------------------------
fof(13,axiom,
    ! [X1] :
      ( finite(X1)
     => ! [X2] :
          ( element(X2,powerset(X1))
         => finite(X2) ) ),
    file('/tmp/tmpvGc6e9/sel_SEU294+2.p_1',cc2_finset_1) ).

fof(30,conjecture,
    ! [X1,X2] :
      ( ( subset(X1,X2)
        & finite(X2) )
     => finite(X1) ),
    file('/tmp/tmpvGc6e9/sel_SEU294+2.p_1',t13_finset_1) ).

fof(62,axiom,
    ! [X1,X2] :
      ( element(X1,powerset(X2))
    <=> subset(X1,X2) ),
    file('/tmp/tmpvGc6e9/sel_SEU294+2.p_1',t3_subset) ).

fof(396,negated_conjecture,
    ~ ! [X1,X2] :
        ( ( subset(X1,X2)
          & finite(X2) )
       => finite(X1) ),
    inference(assume_negation,[status(cth)],[30]) ).

fof(513,plain,
    ! [X1] :
      ( ~ finite(X1)
      | ! [X2] :
          ( ~ element(X2,powerset(X1))
          | finite(X2) ) ),
    inference(fof_nnf,[status(thm)],[13]) ).

fof(514,plain,
    ! [X3] :
      ( ~ finite(X3)
      | ! [X4] :
          ( ~ element(X4,powerset(X3))
          | finite(X4) ) ),
    inference(variable_rename,[status(thm)],[513]) ).

fof(515,plain,
    ! [X3,X4] :
      ( ~ element(X4,powerset(X3))
      | finite(X4)
      | ~ finite(X3) ),
    inference(shift_quantors,[status(thm)],[514]) ).

cnf(516,plain,
    ( finite(X2)
    | ~ finite(X1)
    | ~ element(X2,powerset(X1)) ),
    inference(split_conjunct,[status(thm)],[515]) ).

fof(574,negated_conjecture,
    ? [X1,X2] :
      ( subset(X1,X2)
      & finite(X2)
      & ~ finite(X1) ),
    inference(fof_nnf,[status(thm)],[396]) ).

fof(575,negated_conjecture,
    ? [X3,X4] :
      ( subset(X3,X4)
      & finite(X4)
      & ~ finite(X3) ),
    inference(variable_rename,[status(thm)],[574]) ).

fof(576,negated_conjecture,
    ( subset(esk9_0,esk10_0)
    & finite(esk10_0)
    & ~ finite(esk9_0) ),
    inference(skolemize,[status(esa)],[575]) ).

cnf(577,negated_conjecture,
    ~ finite(esk9_0),
    inference(split_conjunct,[status(thm)],[576]) ).

cnf(578,negated_conjecture,
    finite(esk10_0),
    inference(split_conjunct,[status(thm)],[576]) ).

cnf(579,negated_conjecture,
    subset(esk9_0,esk10_0),
    inference(split_conjunct,[status(thm)],[576]) ).

fof(793,plain,
    ! [X1,X2] :
      ( ( ~ element(X1,powerset(X2))
        | subset(X1,X2) )
      & ( ~ subset(X1,X2)
        | element(X1,powerset(X2)) ) ),
    inference(fof_nnf,[status(thm)],[62]) ).

fof(794,plain,
    ! [X3,X4] :
      ( ( ~ element(X3,powerset(X4))
        | subset(X3,X4) )
      & ( ~ subset(X3,X4)
        | element(X3,powerset(X4)) ) ),
    inference(variable_rename,[status(thm)],[793]) ).

cnf(795,plain,
    ( element(X1,powerset(X2))
    | ~ subset(X1,X2) ),
    inference(split_conjunct,[status(thm)],[794]) ).

cnf(3816,plain,
    ( finite(X1)
    | ~ finite(X2)
    | ~ subset(X1,X2) ),
    inference(spm,[status(thm)],[516,795,theory(equality)]) ).

cnf(77738,negated_conjecture,
    ( finite(esk9_0)
    | ~ finite(esk10_0) ),
    inference(spm,[status(thm)],[3816,579,theory(equality)]) ).

cnf(77784,negated_conjecture,
    ( finite(esk9_0)
    | $false ),
    inference(rw,[status(thm)],[77738,578,theory(equality)]) ).

cnf(77785,negated_conjecture,
    finite(esk9_0),
    inference(cn,[status(thm)],[77784,theory(equality)]) ).

cnf(77786,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[77785,577,theory(equality)]) ).

cnf(77787,negated_conjecture,
    $false,
    77786,
    [proof] ).

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