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

% Computer : antietam.cs.miami.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Core(TM)2 CPU          6600  @ 2.40GHz @ 2400MHz
% Memory   : 1003MB
% OS       : Linux 2.6.32.26-175.fc12.x86_64
% CPULimit : 300s
% DateTime : Fri Jun 15 08:05:44 EDT 2012

% Result   : Theorem 0.05s
% Output   : CNFRefutation 0.05s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   13 (   3 unt;   0 def)
%            Number of atoms       :   42 (   7 equ)
%            Maximal formula atoms :    6 (   3 avg)
%            Number of connectives :   52 (  23   ~;  15   |;  14   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-1 aty)
%            Number of variables   :   19 (   1 sgn   6   !;   8   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(1,conjecture,
    ! [X1] :
    ? [X2] :
      ( ( member(X2,universal_class)
        & equal(X1,singleton(X2)) )
      | ( ~ ? [X3] :
              ( member(X3,universal_class)
              & equal(X1,singleton(X3)) )
        & equal(X2,X1) ) ),
    file('/tmp/tmpvNtq9b/sel_SET086+1.p_1',member_of_substitution) ).

fof(2,negated_conjecture,
    ~ ! [X1] :
      ? [X2] :
        ( ( member(X2,universal_class)
          & equal(X1,singleton(X2)) )
        | ( ~ ? [X3] :
                ( member(X3,universal_class)
                & equal(X1,singleton(X3)) )
          & equal(X2,X1) ) ),
    inference(assume_negation,[status(cth)],[1]) ).

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

fof(4,negated_conjecture,
    ? [X4] :
    ! [X5] :
      ( ( ~ member(X5,universal_class)
        | ~ equal(X4,singleton(X5)) )
      & ( ? [X6] :
            ( member(X6,universal_class)
            & equal(X4,singleton(X6)) )
        | ~ equal(X5,X4) ) ),
    inference(variable_rename,[status(thm)],[3]) ).

fof(5,negated_conjecture,
    ! [X5] :
      ( ( ~ member(X5,universal_class)
        | ~ equal(esk1_0,singleton(X5)) )
      & ( ( member(esk2_1(X5),universal_class)
          & equal(esk1_0,singleton(esk2_1(X5))) )
        | ~ equal(X5,esk1_0) ) ),
    inference(skolemize,[status(esa)],[4]) ).

fof(6,negated_conjecture,
    ! [X5] :
      ( ( ~ member(X5,universal_class)
        | ~ equal(esk1_0,singleton(X5)) )
      & ( member(esk2_1(X5),universal_class)
        | ~ equal(X5,esk1_0) )
      & ( equal(esk1_0,singleton(esk2_1(X5)))
        | ~ equal(X5,esk1_0) ) ),
    inference(distribute,[status(thm)],[5]) ).

cnf(7,negated_conjecture,
    ( esk1_0 = singleton(esk2_1(X1))
    | X1 != esk1_0 ),
    inference(split_conjunct,[status(thm)],[6]) ).

cnf(8,negated_conjecture,
    ( member(esk2_1(X1),universal_class)
    | X1 != esk1_0 ),
    inference(split_conjunct,[status(thm)],[6]) ).

cnf(9,negated_conjecture,
    ( esk1_0 != singleton(X1)
    | ~ member(X1,universal_class) ),
    inference(split_conjunct,[status(thm)],[6]) ).

cnf(10,negated_conjecture,
    ( singleton(esk2_1(X1)) != esk1_0
    | esk1_0 != X1 ),
    inference(spm,[status(thm)],[9,8,theory(equality)]) ).

cnf(11,negated_conjecture,
    esk1_0 != X1,
    inference(csr,[status(thm)],[10,7]) ).

cnf(12,negated_conjecture,
    $false,
    inference(er,[status(thm)],[11,theory(equality)]) ).

cnf(13,negated_conjecture,
    $false,
    12,
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% /home/graph/tptp/Systems/SInE---0.4/Source/sine.py:10: DeprecationWarning: the sets module is deprecated
%   from sets import Set
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SET/SET086+1.p
% --creating new selector for [SET005+0.ax]
% -running prover on /tmp/tmpvNtq9b/sel_SET086+1.p_1 with time limit 29
% -running prover with command ['/davis/home/graph/tptp/Systems/SInE---0.4/Source/./Source/PROVER/eproof.working', '-s', '-tLPO4', '-xAuto', '-tAuto', '--memory-limit=768', '--tptp3-format', '--cpu-limit=29', '/tmp/tmpvNtq9b/sel_SET086+1.p_1']
% -prover status Theorem
% Problem SET086+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SET/SET086+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SET/SET086+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
% 
%------------------------------------------------------------------------------