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

% Computer : art11.cs.miami.edu
% Model    : i686 i686
% CPU      : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory   : 2006MB
% OS       : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Sun Dec 26 04:57:35 EST 2010

% Result   : Theorem 0.20s
% Output   : CNFRefutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   21 (   9 unt;   0 def)
%            Number of atoms       :   33 (  31 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   23 (  11   ~;   6   |;   3   &)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   36 (   4 sgn  19   !;   6   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(1,axiom,
    ! [X1,X2,X3] :
      ( singleton(X1) = unordered_pair(X2,X3)
     => X1 = X2 ),
    file('/tmp/tmp9nJLxs/sel_SEU150+1.p_1',t8_zfmisc_1) ).

fof(3,axiom,
    ! [X1,X2] : unordered_pair(X1,X2) = unordered_pair(X2,X1),
    file('/tmp/tmp9nJLxs/sel_SEU150+1.p_1',commutativity_k2_tarski) ).

fof(4,conjecture,
    ! [X1,X2,X3] :
      ( singleton(X1) = unordered_pair(X2,X3)
     => X2 = X3 ),
    file('/tmp/tmp9nJLxs/sel_SEU150+1.p_1',t9_zfmisc_1) ).

fof(6,negated_conjecture,
    ~ ! [X1,X2,X3] :
        ( singleton(X1) = unordered_pair(X2,X3)
       => X2 = X3 ),
    inference(assume_negation,[status(cth)],[4]) ).

fof(7,plain,
    ! [X1,X2,X3] :
      ( singleton(X1) != unordered_pair(X2,X3)
      | X1 = X2 ),
    inference(fof_nnf,[status(thm)],[1]) ).

fof(8,plain,
    ! [X4,X5,X6] :
      ( singleton(X4) != unordered_pair(X5,X6)
      | X4 = X5 ),
    inference(variable_rename,[status(thm)],[7]) ).

cnf(9,plain,
    ( X1 = X2
    | singleton(X1) != unordered_pair(X2,X3) ),
    inference(split_conjunct,[status(thm)],[8]) ).

fof(11,plain,
    ! [X3,X4] : unordered_pair(X3,X4) = unordered_pair(X4,X3),
    inference(variable_rename,[status(thm)],[3]) ).

cnf(12,plain,
    unordered_pair(X1,X2) = unordered_pair(X2,X1),
    inference(split_conjunct,[status(thm)],[11]) ).

fof(13,negated_conjecture,
    ? [X1,X2,X3] :
      ( singleton(X1) = unordered_pair(X2,X3)
      & X2 != X3 ),
    inference(fof_nnf,[status(thm)],[6]) ).

fof(14,negated_conjecture,
    ? [X4,X5,X6] :
      ( singleton(X4) = unordered_pair(X5,X6)
      & X5 != X6 ),
    inference(variable_rename,[status(thm)],[13]) ).

fof(15,negated_conjecture,
    ( singleton(esk1_0) = unordered_pair(esk2_0,esk3_0)
    & esk2_0 != esk3_0 ),
    inference(skolemize,[status(esa)],[14]) ).

cnf(16,negated_conjecture,
    esk2_0 != esk3_0,
    inference(split_conjunct,[status(thm)],[15]) ).

cnf(17,negated_conjecture,
    singleton(esk1_0) = unordered_pair(esk2_0,esk3_0),
    inference(split_conjunct,[status(thm)],[15]) ).

cnf(19,negated_conjecture,
    ( esk1_0 = X1
    | unordered_pair(X1,X2) != unordered_pair(esk2_0,esk3_0) ),
    inference(spm,[status(thm)],[9,17,theory(equality)]) ).

cnf(22,negated_conjecture,
    esk1_0 = esk2_0,
    inference(er,[status(thm)],[19,theory(equality)]) ).

cnf(26,negated_conjecture,
    ( esk2_0 = X1
    | unordered_pair(X1,X2) != unordered_pair(esk2_0,esk3_0) ),
    inference(rw,[status(thm)],[19,22,theory(equality)]) ).

cnf(29,negated_conjecture,
    ( esk2_0 = X1
    | unordered_pair(X2,X1) != unordered_pair(esk2_0,esk3_0) ),
    inference(spm,[status(thm)],[26,12,theory(equality)]) ).

cnf(34,negated_conjecture,
    esk2_0 = esk3_0,
    inference(er,[status(thm)],[29,theory(equality)]) ).

cnf(37,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[34,16,theory(equality)]) ).

cnf(38,negated_conjecture,
    $false,
    37,
    [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/SEU/SEU150+1.p
% --creating new selector for []
% -running prover on /tmp/tmp9nJLxs/sel_SEU150+1.p_1 with time limit 29
% -prover status Theorem
% Problem SEU150+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SEU/SEU150+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SEU/SEU150+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
% 
%------------------------------------------------------------------------------