%------------------------------------------------------------------------------
% File     : SInE---0.4
% Problem  : SEU121+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 04:42:52 EST 2010

% Result   : Theorem 0.18s
% Output   : CNFRefutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   24 (   6 unt;   0 def)
%            Number of atoms       :   70 (   0 equ)
%            Maximal formula atoms :    7 (   2 avg)
%            Number of connectives :   73 (  27   ~;  24   |;  18   &)
%                                         (   1 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-2 aty)
%            Number of variables   :   43 (   0 sgn  24   !;   8   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(2,axiom,
    ! [X1,X2] :
      ( subset(X1,X2)
    <=> ! [X3] :
          ( in(X3,X1)
         => in(X3,X2) ) ),
    file('/tmp/tmpm9DWx2/sel_SEU121+2.p_1',d3_tarski) ).

fof(5,conjecture,
    ! [X1,X2,X3] :
      ( ( subset(X1,X2)
        & subset(X2,X3) )
     => subset(X1,X3) ),
    file('/tmp/tmpm9DWx2/sel_SEU121+2.p_1',t1_xboole_1) ).

fof(21,negated_conjecture,
    ~ ! [X1,X2,X3] :
        ( ( subset(X1,X2)
          & subset(X2,X3) )
       => subset(X1,X3) ),
    inference(assume_negation,[status(cth)],[5]) ).

fof(29,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)],[2]) ).

fof(30,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)],[29]) ).

fof(31,plain,
    ! [X4,X5] :
      ( ( ~ subset(X4,X5)
        | ! [X6] :
            ( ~ in(X6,X4)
            | in(X6,X5) ) )
      & ( ( in(esk1_2(X4,X5),X4)
          & ~ in(esk1_2(X4,X5),X5) )
        | subset(X4,X5) ) ),
    inference(skolemize,[status(esa)],[30]) ).

fof(32,plain,
    ! [X4,X5,X6] :
      ( ( ~ in(X6,X4)
        | in(X6,X5)
        | ~ subset(X4,X5) )
      & ( ( in(esk1_2(X4,X5),X4)
          & ~ in(esk1_2(X4,X5),X5) )
        | subset(X4,X5) ) ),
    inference(shift_quantors,[status(thm)],[31]) ).

fof(33,plain,
    ! [X4,X5,X6] :
      ( ( ~ in(X6,X4)
        | in(X6,X5)
        | ~ subset(X4,X5) )
      & ( in(esk1_2(X4,X5),X4)
        | subset(X4,X5) )
      & ( ~ in(esk1_2(X4,X5),X5)
        | subset(X4,X5) ) ),
    inference(distribute,[status(thm)],[32]) ).

cnf(34,plain,
    ( subset(X1,X2)
    | ~ in(esk1_2(X1,X2),X2) ),
    inference(split_conjunct,[status(thm)],[33]) ).

cnf(35,plain,
    ( subset(X1,X2)
    | in(esk1_2(X1,X2),X1) ),
    inference(split_conjunct,[status(thm)],[33]) ).

cnf(36,plain,
    ( in(X3,X2)
    | ~ subset(X1,X2)
    | ~ in(X3,X1) ),
    inference(split_conjunct,[status(thm)],[33]) ).

fof(42,negated_conjecture,
    ? [X1,X2,X3] :
      ( subset(X1,X2)
      & subset(X2,X3)
      & ~ subset(X1,X3) ),
    inference(fof_nnf,[status(thm)],[21]) ).

fof(43,negated_conjecture,
    ? [X4,X5,X6] :
      ( subset(X4,X5)
      & subset(X5,X6)
      & ~ subset(X4,X6) ),
    inference(variable_rename,[status(thm)],[42]) ).

fof(44,negated_conjecture,
    ( subset(esk2_0,esk3_0)
    & subset(esk3_0,esk4_0)
    & ~ subset(esk2_0,esk4_0) ),
    inference(skolemize,[status(esa)],[43]) ).

cnf(45,negated_conjecture,
    ~ subset(esk2_0,esk4_0),
    inference(split_conjunct,[status(thm)],[44]) ).

cnf(46,negated_conjecture,
    subset(esk3_0,esk4_0),
    inference(split_conjunct,[status(thm)],[44]) ).

cnf(47,negated_conjecture,
    subset(esk2_0,esk3_0),
    inference(split_conjunct,[status(thm)],[44]) ).

cnf(123,negated_conjecture,
    ( in(X1,esk3_0)
    | ~ in(X1,esk2_0) ),
    inference(spm,[status(thm)],[36,47,theory(equality)]) ).

cnf(124,negated_conjecture,
    ( in(X1,esk4_0)
    | ~ in(X1,esk3_0) ),
    inference(spm,[status(thm)],[36,46,theory(equality)]) ).

cnf(283,negated_conjecture,
    ( subset(X1,esk4_0)
    | ~ in(esk1_2(X1,esk4_0),esk3_0) ),
    inference(spm,[status(thm)],[34,124,theory(equality)]) ).

cnf(306,negated_conjecture,
    ( subset(X1,esk4_0)
    | ~ in(esk1_2(X1,esk4_0),esk2_0) ),
    inference(spm,[status(thm)],[283,123,theory(equality)]) ).

cnf(324,negated_conjecture,
    subset(esk2_0,esk4_0),
    inference(spm,[status(thm)],[306,35,theory(equality)]) ).

cnf(325,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[324,45,theory(equality)]) ).

cnf(326,negated_conjecture,
    $false,
    325,
    [proof] ).

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