%------------------------------------------------------------------------------
% File     : SInE---0.4
% Problem  : SEU122+1 : 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 04:42:58 EST 2010

% Result   : Theorem 0.17s
% Output   : CNFRefutation 0.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   24 (  12 unt;   0 def)
%            Number of atoms       :   58 (   0 equ)
%            Maximal formula atoms :    7 (   2 avg)
%            Number of connectives :   63 (  29   ~;  21   |;  11   &)
%                                         (   1 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   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-2 aty)
%            Number of variables   :   36 (   2 sgn  26   !;   4   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(3,axiom,
    ! [X1,X2] :
      ~ ( in(X1,X2)
        & empty(X2) ),
    file('/tmp/tmpSRGZ-a/sel_SEU122+1.p_1',t7_boole) ).

fof(5,conjecture,
    ! [X1] : subset(empty_set,X1),
    file('/tmp/tmpSRGZ-a/sel_SEU122+1.p_1',t2_xboole_1) ).

fof(9,axiom,
    ! [X1,X2] :
      ( subset(X1,X2)
    <=> ! [X3] :
          ( in(X3,X1)
         => in(X3,X2) ) ),
    file('/tmp/tmpSRGZ-a/sel_SEU122+1.p_1',d3_tarski) ).

fof(10,axiom,
    empty(empty_set),
    file('/tmp/tmpSRGZ-a/sel_SEU122+1.p_1',fc1_xboole_0) ).

fof(12,negated_conjecture,
    ~ ! [X1] : subset(empty_set,X1),
    inference(assume_negation,[status(cth)],[5]) ).

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

fof(20,plain,
    ! [X3,X4] :
      ( ~ in(X3,X4)
      | ~ empty(X4) ),
    inference(variable_rename,[status(thm)],[19]) ).

cnf(21,plain,
    ( ~ empty(X1)
    | ~ in(X2,X1) ),
    inference(split_conjunct,[status(thm)],[20]) ).

fof(25,negated_conjecture,
    ? [X1] : ~ subset(empty_set,X1),
    inference(fof_nnf,[status(thm)],[12]) ).

fof(26,negated_conjecture,
    ? [X2] : ~ subset(empty_set,X2),
    inference(variable_rename,[status(thm)],[25]) ).

fof(27,negated_conjecture,
    ~ subset(empty_set,esk2_0),
    inference(skolemize,[status(esa)],[26]) ).

cnf(28,negated_conjecture,
    ~ subset(empty_set,esk2_0),
    inference(split_conjunct,[status(thm)],[27]) ).

fof(38,plain,
    ! [X1,X2] :
      ( ( ~ subset(X1,X2)
        | ! [X3] :
            ( ~ in(X3,X1)
            | in(X3,X2) ) )
      & ( ? [X3] :
            ( in(X3,X1)
            & ~ in(X3,X2) )
        | subset(X1,X2) ) ),
    inference(fof_nnf,[status(thm)],[9]) ).

fof(39,plain,
    ! [X4,X5] :
      ( ( ~ subset(X4,X5)
        | ! [X6] :
            ( ~ in(X6,X4)
            | in(X6,X5) ) )
      & ( ? [X7] :
            ( in(X7,X4)
            & ~ in(X7,X5) )
        | subset(X4,X5) ) ),
    inference(variable_rename,[status(thm)],[38]) ).

fof(40,plain,
    ! [X4,X5] :
      ( ( ~ subset(X4,X5)
        | ! [X6] :
            ( ~ in(X6,X4)
            | in(X6,X5) ) )
      & ( ( in(esk4_2(X4,X5),X4)
          & ~ in(esk4_2(X4,X5),X5) )
        | subset(X4,X5) ) ),
    inference(skolemize,[status(esa)],[39]) ).

fof(41,plain,
    ! [X4,X5,X6] :
      ( ( ~ in(X6,X4)
        | in(X6,X5)
        | ~ subset(X4,X5) )
      & ( ( in(esk4_2(X4,X5),X4)
          & ~ in(esk4_2(X4,X5),X5) )
        | subset(X4,X5) ) ),
    inference(shift_quantors,[status(thm)],[40]) ).

fof(42,plain,
    ! [X4,X5,X6] :
      ( ( ~ in(X6,X4)
        | in(X6,X5)
        | ~ subset(X4,X5) )
      & ( in(esk4_2(X4,X5),X4)
        | subset(X4,X5) )
      & ( ~ in(esk4_2(X4,X5),X5)
        | subset(X4,X5) ) ),
    inference(distribute,[status(thm)],[41]) ).

cnf(44,plain,
    ( subset(X1,X2)
    | in(esk4_2(X1,X2),X1) ),
    inference(split_conjunct,[status(thm)],[42]) ).

cnf(46,plain,
    empty(empty_set),
    inference(split_conjunct,[status(thm)],[10]) ).

cnf(52,plain,
    ( subset(X1,X2)
    | ~ empty(X1) ),
    inference(spm,[status(thm)],[21,44,theory(equality)]) ).

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

cnf(59,negated_conjecture,
    $false,
    inference(rw,[status(thm)],[57,46,theory(equality)]) ).

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

cnf(61,negated_conjecture,
    $false,
    60,
    [proof] ).

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