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

% Computer : art07.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:41:45 EST 2010

% Result   : Theorem 0.17s
% Output   : CNFRefutation 0.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   22 (  14 unt;   0 def)
%            Number of atoms       :   30 (  11 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   20 (  12   ~;   6   |;   0   &)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   1 con; 0-1 aty)
%            Number of variables   :    8 (   0 sgn   6   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(1,axiom,
    ! [X1] :
      ( empty(X1)
     => finite(X1) ),
    file('/tmp/tmpRB1oMt/sel_SEU115+1.p_1',cc1_finset_1) ).

fof(20,axiom,
    empty(empty_set),
    file('/tmp/tmpRB1oMt/sel_SEU115+1.p_1',fc1_xboole_0) ).

fof(21,conjecture,
    finite_subsets(empty_set) = singleton(empty_set),
    file('/tmp/tmpRB1oMt/sel_SEU115+1.p_1',t28_finsub_1) ).

fof(22,axiom,
    powerset(empty_set) = singleton(empty_set),
    file('/tmp/tmpRB1oMt/sel_SEU115+1.p_1',t1_zfmisc_1) ).

fof(28,axiom,
    ! [X1] :
      ( finite(X1)
     => finite_subsets(X1) = powerset(X1) ),
    file('/tmp/tmpRB1oMt/sel_SEU115+1.p_1',t27_finsub_1) ).

fof(36,negated_conjecture,
    finite_subsets(empty_set) != singleton(empty_set),
    inference(assume_negation,[status(cth)],[21]) ).

fof(46,negated_conjecture,
    finite_subsets(empty_set) != singleton(empty_set),
    inference(fof_simplification,[status(thm)],[36,theory(equality)]) ).

fof(50,plain,
    ! [X1] :
      ( ~ empty(X1)
      | finite(X1) ),
    inference(fof_nnf,[status(thm)],[1]) ).

fof(51,plain,
    ! [X2] :
      ( ~ empty(X2)
      | finite(X2) ),
    inference(variable_rename,[status(thm)],[50]) ).

cnf(52,plain,
    ( finite(X1)
    | ~ empty(X1) ),
    inference(split_conjunct,[status(thm)],[51]) ).

cnf(127,plain,
    empty(empty_set),
    inference(split_conjunct,[status(thm)],[20]) ).

cnf(128,negated_conjecture,
    finite_subsets(empty_set) != singleton(empty_set),
    inference(split_conjunct,[status(thm)],[46]) ).

cnf(129,plain,
    powerset(empty_set) = singleton(empty_set),
    inference(split_conjunct,[status(thm)],[22]) ).

fof(151,plain,
    ! [X1] :
      ( ~ finite(X1)
      | finite_subsets(X1) = powerset(X1) ),
    inference(fof_nnf,[status(thm)],[28]) ).

fof(152,plain,
    ! [X2] :
      ( ~ finite(X2)
      | finite_subsets(X2) = powerset(X2) ),
    inference(variable_rename,[status(thm)],[151]) ).

cnf(153,plain,
    ( finite_subsets(X1) = powerset(X1)
    | ~ finite(X1) ),
    inference(split_conjunct,[status(thm)],[152]) ).

cnf(179,negated_conjecture,
    powerset(empty_set) != finite_subsets(empty_set),
    inference(rw,[status(thm)],[128,129,theory(equality)]) ).

cnf(236,negated_conjecture,
    ~ finite(empty_set),
    inference(spm,[status(thm)],[179,153,theory(equality)]) ).

cnf(237,negated_conjecture,
    ~ empty(empty_set),
    inference(spm,[status(thm)],[236,52,theory(equality)]) ).

cnf(238,negated_conjecture,
    $false,
    inference(rw,[status(thm)],[237,127,theory(equality)]) ).

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

cnf(240,negated_conjecture,
    $false,
    239,
    [proof] ).

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