%------------------------------------------------------------------------------
% File     : SInE---0.4
% Problem  : SEU295+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:55:32 EST 2010

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

% Comments : 
%------------------------------------------------------------------------------
fof(165,axiom,
    ! [X1,X2] :
      ( finite(X1)
     => finite(set_intersection2(X1,X2)) ),
    file('/tmp/tmpPELkwQ/sel_SEU295+2.p_1',fc11_finset_1) ).

fof(240,conjecture,
    ! [X1,X2] :
      ( finite(X1)
     => finite(set_intersection2(X1,X2)) ),
    file('/tmp/tmpPELkwQ/sel_SEU295+2.p_1',t15_finset_1) ).

fof(259,axiom,
    ! [X1,X2] : set_difference(X1,set_difference(X1,X2)) = set_intersection2(X1,X2),
    file('/tmp/tmpPELkwQ/sel_SEU295+2.p_1',t48_xboole_1) ).

fof(399,negated_conjecture,
    ~ ! [X1,X2] :
        ( finite(X1)
       => finite(set_intersection2(X1,X2)) ),
    inference(assume_negation,[status(cth)],[240]) ).

fof(1474,plain,
    ! [X1,X2] :
      ( ~ finite(X1)
      | finite(set_intersection2(X1,X2)) ),
    inference(fof_nnf,[status(thm)],[165]) ).

fof(1475,plain,
    ! [X3,X4] :
      ( ~ finite(X3)
      | finite(set_intersection2(X3,X4)) ),
    inference(variable_rename,[status(thm)],[1474]) ).

cnf(1476,plain,
    ( finite(set_intersection2(X1,X2))
    | ~ finite(X1) ),
    inference(split_conjunct,[status(thm)],[1475]) ).

fof(1868,negated_conjecture,
    ? [X1,X2] :
      ( finite(X1)
      & ~ finite(set_intersection2(X1,X2)) ),
    inference(fof_nnf,[status(thm)],[399]) ).

fof(1869,negated_conjecture,
    ? [X3,X4] :
      ( finite(X3)
      & ~ finite(set_intersection2(X3,X4)) ),
    inference(variable_rename,[status(thm)],[1868]) ).

fof(1870,negated_conjecture,
    ( finite(esk154_0)
    & ~ finite(set_intersection2(esk154_0,esk155_0)) ),
    inference(skolemize,[status(esa)],[1869]) ).

cnf(1871,negated_conjecture,
    ~ finite(set_intersection2(esk154_0,esk155_0)),
    inference(split_conjunct,[status(thm)],[1870]) ).

cnf(1872,negated_conjecture,
    finite(esk154_0),
    inference(split_conjunct,[status(thm)],[1870]) ).

fof(2013,plain,
    ! [X3,X4] : set_difference(X3,set_difference(X3,X4)) = set_intersection2(X3,X4),
    inference(variable_rename,[status(thm)],[259]) ).

cnf(2014,plain,
    set_difference(X1,set_difference(X1,X2)) = set_intersection2(X1,X2),
    inference(split_conjunct,[status(thm)],[2013]) ).

cnf(3142,plain,
    ( finite(set_difference(X1,set_difference(X1,X2)))
    | ~ finite(X1) ),
    inference(rw,[status(thm)],[1476,2014,theory(equality)]),
    [unfolding] ).

cnf(3157,negated_conjecture,
    ~ finite(set_difference(esk154_0,set_difference(esk154_0,esk155_0))),
    inference(rw,[status(thm)],[1871,2014,theory(equality)]),
    [unfolding] ).

cnf(3657,negated_conjecture,
    ~ finite(esk154_0),
    inference(spm,[status(thm)],[3157,3142,theory(equality)]) ).

cnf(3658,negated_conjecture,
    $false,
    inference(rw,[status(thm)],[3657,1872,theory(equality)]) ).

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

cnf(3660,negated_conjecture,
    $false,
    3659,
    [proof] ).

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