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

% Computer : art03.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:47 EST 2010

% Result   : Theorem 0.17s
% Output   : CNFRefutation 0.17s
% 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,conjecture,
    ! [X1,X2,X3] :
      ( ( subset(X1,X2)
        & subset(X2,X3) )
     => subset(X1,X3) ),
    file('/tmp/tmps2dlze/sel_SEU121+1.p_1',t1_xboole_1) ).

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

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

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

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

fof(18,negated_conjecture,
    ( subset(esk1_0,esk2_0)
    & subset(esk2_0,esk3_0)
    & ~ subset(esk1_0,esk3_0) ),
    inference(skolemize,[status(esa)],[17]) ).

cnf(19,negated_conjecture,
    ~ subset(esk1_0,esk3_0),
    inference(split_conjunct,[status(thm)],[18]) ).

cnf(20,negated_conjecture,
    subset(esk2_0,esk3_0),
    inference(split_conjunct,[status(thm)],[18]) ).

cnf(21,negated_conjecture,
    subset(esk1_0,esk2_0),
    inference(split_conjunct,[status(thm)],[18]) ).

fof(40,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(41,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)],[40]) ).

fof(42,plain,
    ! [X4,X5] :
      ( ( ~ subset(X4,X5)
        | ! [X6] :
            ( ~ in(X6,X4)
            | in(X6,X5) ) )
      & ( ( in(esk6_2(X4,X5),X4)
          & ~ in(esk6_2(X4,X5),X5) )
        | subset(X4,X5) ) ),
    inference(skolemize,[status(esa)],[41]) ).

fof(43,plain,
    ! [X4,X5,X6] :
      ( ( ~ in(X6,X4)
        | in(X6,X5)
        | ~ subset(X4,X5) )
      & ( ( in(esk6_2(X4,X5),X4)
          & ~ in(esk6_2(X4,X5),X5) )
        | subset(X4,X5) ) ),
    inference(shift_quantors,[status(thm)],[42]) ).

fof(44,plain,
    ! [X4,X5,X6] :
      ( ( ~ in(X6,X4)
        | in(X6,X5)
        | ~ subset(X4,X5) )
      & ( in(esk6_2(X4,X5),X4)
        | subset(X4,X5) )
      & ( ~ in(esk6_2(X4,X5),X5)
        | subset(X4,X5) ) ),
    inference(distribute,[status(thm)],[43]) ).

cnf(45,plain,
    ( subset(X1,X2)
    | ~ in(esk6_2(X1,X2),X2) ),
    inference(split_conjunct,[status(thm)],[44]) ).

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

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

cnf(58,negated_conjecture,
    ( in(X1,esk2_0)
    | ~ in(X1,esk1_0) ),
    inference(spm,[status(thm)],[47,21,theory(equality)]) ).

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

cnf(74,negated_conjecture,
    ( subset(X1,esk3_0)
    | ~ in(esk6_2(X1,esk3_0),esk2_0) ),
    inference(spm,[status(thm)],[45,59,theory(equality)]) ).

cnf(86,negated_conjecture,
    ( subset(X1,esk3_0)
    | ~ in(esk6_2(X1,esk3_0),esk1_0) ),
    inference(spm,[status(thm)],[74,58,theory(equality)]) ).

cnf(88,negated_conjecture,
    subset(esk1_0,esk3_0),
    inference(spm,[status(thm)],[86,46,theory(equality)]) ).

cnf(89,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[88,19,theory(equality)]) ).

cnf(90,negated_conjecture,
    $false,
    89,
    [proof] ).

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