%------------------------------------------------------------------------------
% File     : SInE---0.4
% Problem  : SEU158+3 : 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:55:56 EST 2010

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

% Comments : 
%------------------------------------------------------------------------------
fof(2,axiom,
    ! [X1,X2] :
      ( subset(singleton(X1),X2)
    <=> in(X1,X2) ),
    file('/tmp/tmp_VzT7j/sel_SEU158+3.p_1',l2_zfmisc_1) ).

fof(3,conjecture,
    ! [X1,X2] :
      ( subset(singleton(X1),X2)
    <=> in(X1,X2) ),
    file('/tmp/tmp_VzT7j/sel_SEU158+3.p_1',t37_zfmisc_1) ).

fof(7,negated_conjecture,
    ~ ! [X1,X2] :
        ( subset(singleton(X1),X2)
      <=> in(X1,X2) ),
    inference(assume_negation,[status(cth)],[3]) ).

fof(13,plain,
    ! [X1,X2] :
      ( ( ~ subset(singleton(X1),X2)
        | in(X1,X2) )
      & ( ~ in(X1,X2)
        | subset(singleton(X1),X2) ) ),
    inference(fof_nnf,[status(thm)],[2]) ).

fof(14,plain,
    ! [X3,X4] :
      ( ( ~ subset(singleton(X3),X4)
        | in(X3,X4) )
      & ( ~ in(X3,X4)
        | subset(singleton(X3),X4) ) ),
    inference(variable_rename,[status(thm)],[13]) ).

cnf(15,plain,
    ( subset(singleton(X1),X2)
    | ~ in(X1,X2) ),
    inference(split_conjunct,[status(thm)],[14]) ).

cnf(16,plain,
    ( in(X1,X2)
    | ~ subset(singleton(X1),X2) ),
    inference(split_conjunct,[status(thm)],[14]) ).

fof(17,negated_conjecture,
    ? [X1,X2] :
      ( ( ~ subset(singleton(X1),X2)
        | ~ in(X1,X2) )
      & ( subset(singleton(X1),X2)
        | in(X1,X2) ) ),
    inference(fof_nnf,[status(thm)],[7]) ).

fof(18,negated_conjecture,
    ? [X3,X4] :
      ( ( ~ subset(singleton(X3),X4)
        | ~ in(X3,X4) )
      & ( subset(singleton(X3),X4)
        | in(X3,X4) ) ),
    inference(variable_rename,[status(thm)],[17]) ).

fof(19,negated_conjecture,
    ( ( ~ subset(singleton(esk2_0),esk3_0)
      | ~ in(esk2_0,esk3_0) )
    & ( subset(singleton(esk2_0),esk3_0)
      | in(esk2_0,esk3_0) ) ),
    inference(skolemize,[status(esa)],[18]) ).

cnf(20,negated_conjecture,
    ( in(esk2_0,esk3_0)
    | subset(singleton(esk2_0),esk3_0) ),
    inference(split_conjunct,[status(thm)],[19]) ).

cnf(21,negated_conjecture,
    ( ~ in(esk2_0,esk3_0)
    | ~ subset(singleton(esk2_0),esk3_0) ),
    inference(split_conjunct,[status(thm)],[19]) ).

cnf(33,negated_conjecture,
    ~ in(esk2_0,esk3_0),
    inference(csr,[status(thm)],[21,15]) ).

cnf(34,negated_conjecture,
    subset(singleton(esk2_0),esk3_0),
    inference(sr,[status(thm)],[20,33,theory(equality)]) ).

cnf(35,negated_conjecture,
    in(esk2_0,esk3_0),
    inference(spm,[status(thm)],[16,34,theory(equality)]) ).

cnf(36,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[35,33,theory(equality)]) ).

cnf(37,negated_conjecture,
    $false,
    36,
    [proof] ).

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