%------------------------------------------------------------------------------
% File     : SInE---0.4
% Problem  : SET046+1 : TPTP v5.0.0. Released v2.0.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 02:39:33 EST 2010

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

% Comments : 
%------------------------------------------------------------------------------
fof(1,conjecture,
    ~ ? [X1] :
      ! [X2] :
        ( element(X2,X1)
      <=> ~ ? [X3] :
              ( element(X2,X3)
              & element(X3,X2) ) ),
    file('/tmp/tmp76bEHL/sel_SET046+1.p_1',pel42) ).

fof(2,negated_conjecture,
    ~ ~ ? [X1] :
        ! [X2] :
          ( element(X2,X1)
        <=> ~ ? [X3] :
                ( element(X2,X3)
                & element(X3,X2) ) ),
    inference(assume_negation,[status(cth)],[1]) ).

fof(3,negated_conjecture,
    ? [X1] :
    ! [X2] :
      ( ( ~ element(X2,X1)
        | ! [X3] :
            ( ~ element(X2,X3)
            | ~ element(X3,X2) ) )
      & ( ? [X3] :
            ( element(X2,X3)
            & element(X3,X2) )
        | element(X2,X1) ) ),
    inference(fof_nnf,[status(thm)],[2]) ).

fof(4,negated_conjecture,
    ? [X4] :
    ! [X5] :
      ( ( ~ element(X5,X4)
        | ! [X6] :
            ( ~ element(X5,X6)
            | ~ element(X6,X5) ) )
      & ( ? [X7] :
            ( element(X5,X7)
            & element(X7,X5) )
        | element(X5,X4) ) ),
    inference(variable_rename,[status(thm)],[3]) ).

fof(5,negated_conjecture,
    ! [X5] :
      ( ( ~ element(X5,esk1_0)
        | ! [X6] :
            ( ~ element(X5,X6)
            | ~ element(X6,X5) ) )
      & ( ( element(X5,esk2_1(X5))
          & element(esk2_1(X5),X5) )
        | element(X5,esk1_0) ) ),
    inference(skolemize,[status(esa)],[4]) ).

fof(6,negated_conjecture,
    ! [X5,X6] :
      ( ( ~ element(X5,X6)
        | ~ element(X6,X5)
        | ~ element(X5,esk1_0) )
      & ( ( element(X5,esk2_1(X5))
          & element(esk2_1(X5),X5) )
        | element(X5,esk1_0) ) ),
    inference(shift_quantors,[status(thm)],[5]) ).

fof(7,negated_conjecture,
    ! [X5,X6] :
      ( ( ~ element(X5,X6)
        | ~ element(X6,X5)
        | ~ element(X5,esk1_0) )
      & ( element(X5,esk2_1(X5))
        | element(X5,esk1_0) )
      & ( element(esk2_1(X5),X5)
        | element(X5,esk1_0) ) ),
    inference(distribute,[status(thm)],[6]) ).

cnf(8,negated_conjecture,
    ( element(X1,esk1_0)
    | element(esk2_1(X1),X1) ),
    inference(split_conjunct,[status(thm)],[7]) ).

cnf(9,negated_conjecture,
    ( element(X1,esk1_0)
    | element(X1,esk2_1(X1)) ),
    inference(split_conjunct,[status(thm)],[7]) ).

cnf(10,negated_conjecture,
    ( ~ element(X1,esk1_0)
    | ~ element(X2,X1)
    | ~ element(X1,X2) ),
    inference(split_conjunct,[status(thm)],[7]) ).

cnf(11,negated_conjecture,
    ( element(esk1_0,esk1_0)
    | ~ element(X1,esk2_1(esk1_0))
    | ~ element(esk2_1(esk1_0),X1) ),
    inference(spm,[status(thm)],[10,8,theory(equality)]) ).

cnf(12,negated_conjecture,
    ( element(esk1_0,esk1_0)
    | ~ element(esk2_1(esk1_0),esk1_0) ),
    inference(spm,[status(thm)],[11,9,theory(equality)]) ).

cnf(14,negated_conjecture,
    element(esk1_0,esk1_0),
    inference(csr,[status(thm)],[12,8]) ).

cnf(15,negated_conjecture,
    ( ~ element(X1,esk1_0)
    | ~ element(esk1_0,X1) ),
    inference(spm,[status(thm)],[10,14,theory(equality)]) ).

cnf(17,negated_conjecture,
    ~ element(esk1_0,esk1_0),
    inference(spm,[status(thm)],[15,14,theory(equality)]) ).

cnf(19,negated_conjecture,
    $false,
    inference(rw,[status(thm)],[17,14,theory(equality)]) ).

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

cnf(21,negated_conjecture,
    $false,
    20,
    [proof] ).

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