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

% Computer : hopewell.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:19 EDT 2012

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

% Comments : 
%------------------------------------------------------------------------------
fof(3,axiom,
    ! [X2] : equal(singleton(X2),unordered_pair(X2,X2)),
    file('/tmp/tmp7DS3AS/sel_SET077+1.p_4',singleton_set_defn) ).

fof(5,axiom,
    ! [X2,X3] : member(unordered_pair(X2,X3),universal_class),
    file('/tmp/tmp7DS3AS/sel_SET077+1.p_4',unordered_pair) ).

fof(6,conjecture,
    ! [X2] : member(singleton(X2),universal_class),
    file('/tmp/tmp7DS3AS/sel_SET077+1.p_4',singletons_are_sets) ).

fof(7,negated_conjecture,
    ~ ! [X2] : member(singleton(X2),universal_class),
    inference(assume_negation,[status(cth)],[6]) ).

fof(17,plain,
    ! [X3] : equal(singleton(X3),unordered_pair(X3,X3)),
    inference(variable_rename,[status(thm)],[3]) ).

cnf(18,plain,
    singleton(X1) = unordered_pair(X1,X1),
    inference(split_conjunct,[status(thm)],[17]) ).

fof(25,plain,
    ! [X4,X5] : member(unordered_pair(X4,X5),universal_class),
    inference(variable_rename,[status(thm)],[5]) ).

cnf(26,plain,
    member(unordered_pair(X1,X2),universal_class),
    inference(split_conjunct,[status(thm)],[25]) ).

fof(27,negated_conjecture,
    ? [X2] : ~ member(singleton(X2),universal_class),
    inference(fof_nnf,[status(thm)],[7]) ).

fof(28,negated_conjecture,
    ? [X3] : ~ member(singleton(X3),universal_class),
    inference(variable_rename,[status(thm)],[27]) ).

fof(29,negated_conjecture,
    ~ member(singleton(esk1_0),universal_class),
    inference(skolemize,[status(esa)],[28]) ).

cnf(30,negated_conjecture,
    ~ member(singleton(esk1_0),universal_class),
    inference(split_conjunct,[status(thm)],[29]) ).

cnf(32,negated_conjecture,
    ~ member(unordered_pair(esk1_0,esk1_0),universal_class),
    inference(rw,[status(thm)],[30,18,theory(equality)]),
    [unfolding] ).

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

cnf(37,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[36,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/SET/SET077+1.p
% --creating new selector for [SET005+0.ax]
% -running prover on /tmp/tmp7DS3AS/sel_SET077+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/tmp7DS3AS/sel_SET077+1.p_1']
% -prover status CounterSatisfiable
% -running prover on /tmp/tmp7DS3AS/sel_SET077+1.p_2 with time limit 89
% -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=89', '/tmp/tmp7DS3AS/sel_SET077+1.p_2']
% -prover status CounterSatisfiable
% --creating new selector for [SET005+0.ax]
% -running prover on /tmp/tmp7DS3AS/sel_SET077+1.p_3 with time limit 119
% -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=119', '/tmp/tmp7DS3AS/sel_SET077+1.p_3']
% -prover status CounterSatisfiable
% --creating new selector for [SET005+0.ax]
% -running prover on /tmp/tmp7DS3AS/sel_SET077+1.p_4 with time limit 149
% -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=149', '/tmp/tmp7DS3AS/sel_SET077+1.p_4']
% -prover status Theorem
% Problem SET077+1.p solved in phase 3.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SET/SET077+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SET/SET077+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
% 
%------------------------------------------------------------------------------