%------------------------------------------------------------------------------
% File     : SInE---0.4
% Problem  : SET899+1 : TPTP v5.0.0. Released v3.2.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 03:45:05 EST 2010

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

% Comments : 
%------------------------------------------------------------------------------
fof(1,axiom,
    ! [X1,X2,X3] :
      ( subset(X1,X2)
     => ( in(X3,X1)
        | subset(X1,set_difference(X2,singleton(X3))) ) ),
    file('/tmp/tmpoDM8i4/sel_SET899+1.p_1',l3_zfmisc_1) ).

fof(5,conjecture,
    ! [X1,X2,X3] :
      ( subset(X1,X2)
     => ( in(X3,X1)
        | subset(X1,set_difference(X2,singleton(X3))) ) ),
    file('/tmp/tmpoDM8i4/sel_SET899+1.p_1',t40_zfmisc_1) ).

fof(7,negated_conjecture,
    ~ ! [X1,X2,X3] :
        ( subset(X1,X2)
       => ( in(X3,X1)
          | subset(X1,set_difference(X2,singleton(X3))) ) ),
    inference(assume_negation,[status(cth)],[5]) ).

fof(10,plain,
    ! [X1,X2,X3] :
      ( ~ subset(X1,X2)
      | in(X3,X1)
      | subset(X1,set_difference(X2,singleton(X3))) ),
    inference(fof_nnf,[status(thm)],[1]) ).

fof(11,plain,
    ! [X4,X5,X6] :
      ( ~ subset(X4,X5)
      | in(X6,X4)
      | subset(X4,set_difference(X5,singleton(X6))) ),
    inference(variable_rename,[status(thm)],[10]) ).

cnf(12,plain,
    ( subset(X1,set_difference(X2,singleton(X3)))
    | in(X3,X1)
    | ~ subset(X1,X2) ),
    inference(split_conjunct,[status(thm)],[11]) ).

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

fof(23,negated_conjecture,
    ? [X4,X5,X6] :
      ( subset(X4,X5)
      & ~ in(X6,X4)
      & ~ subset(X4,set_difference(X5,singleton(X6))) ),
    inference(variable_rename,[status(thm)],[22]) ).

fof(24,negated_conjecture,
    ( subset(esk3_0,esk4_0)
    & ~ in(esk5_0,esk3_0)
    & ~ subset(esk3_0,set_difference(esk4_0,singleton(esk5_0))) ),
    inference(skolemize,[status(esa)],[23]) ).

cnf(25,negated_conjecture,
    ~ subset(esk3_0,set_difference(esk4_0,singleton(esk5_0))),
    inference(split_conjunct,[status(thm)],[24]) ).

cnf(26,negated_conjecture,
    ~ in(esk5_0,esk3_0),
    inference(split_conjunct,[status(thm)],[24]) ).

cnf(27,negated_conjecture,
    subset(esk3_0,esk4_0),
    inference(split_conjunct,[status(thm)],[24]) ).

cnf(30,negated_conjecture,
    ( in(esk5_0,esk3_0)
    | ~ subset(esk3_0,esk4_0) ),
    inference(spm,[status(thm)],[25,12,theory(equality)]) ).

cnf(31,negated_conjecture,
    ( in(esk5_0,esk3_0)
    | $false ),
    inference(rw,[status(thm)],[30,27,theory(equality)]) ).

cnf(32,negated_conjecture,
    in(esk5_0,esk3_0),
    inference(cn,[status(thm)],[31,theory(equality)]) ).

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

cnf(34,negated_conjecture,
    $false,
    33,
    [proof] ).

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