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

% Computer : art01.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:55:09 EST 2010

% Result   : Theorem 0.27s
% Output   : CNFRefutation 0.27s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   23 (   7 unt;   0 def)
%            Number of atoms       :   53 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   49 (  19   ~;  15   |;  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   :   26 (   0 sgn  18   !;   4   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(9,conjecture,
    ! [X1,X2] :
      ( ( subset(X1,X2)
        & finite(X2) )
     => finite(X1) ),
    file('/tmp/tmpClF3nq/sel_SEU294+3.p_1',t13_finset_1) ).

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

fof(34,axiom,
    ! [X1] :
      ( finite(X1)
     => ! [X2] :
          ( element(X2,powerset(X1))
         => finite(X2) ) ),
    file('/tmp/tmpClF3nq/sel_SEU294+3.p_1',cc2_finset_1) ).

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

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

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

fof(101,negated_conjecture,
    ( subset(esk5_0,esk6_0)
    & finite(esk6_0)
    & ~ finite(esk5_0) ),
    inference(skolemize,[status(esa)],[100]) ).

cnf(102,negated_conjecture,
    ~ finite(esk5_0),
    inference(split_conjunct,[status(thm)],[101]) ).

cnf(103,negated_conjecture,
    finite(esk6_0),
    inference(split_conjunct,[status(thm)],[101]) ).

cnf(104,negated_conjecture,
    subset(esk5_0,esk6_0),
    inference(split_conjunct,[status(thm)],[101]) ).

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

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

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

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

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

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

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

cnf(340,negated_conjecture,
    element(esk5_0,powerset(esk6_0)),
    inference(spm,[status(thm)],[212,104,theory(equality)]) ).

cnf(543,negated_conjecture,
    ( finite(esk5_0)
    | ~ finite(esk6_0) ),
    inference(spm,[status(thm)],[229,340,theory(equality)]) ).

cnf(550,negated_conjecture,
    ( finite(esk5_0)
    | $false ),
    inference(rw,[status(thm)],[543,103,theory(equality)]) ).

cnf(551,negated_conjecture,
    finite(esk5_0),
    inference(cn,[status(thm)],[550,theory(equality)]) ).

cnf(552,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[551,102,theory(equality)]) ).

cnf(553,negated_conjecture,
    $false,
    552,
    [proof] ).

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