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

% Computer : wilderness.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:04:26 EDT 2012

% Result   : Theorem 0.06s
% Output   : CNFRefutation 0.06s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   21 (  14 unt;   0 def)
%            Number of atoms       :   50 (   0 equ)
%            Maximal formula atoms :    7 (   2 avg)
%            Number of connectives :   53 (  24   ~;  17   |;  10   &)
%                                         (   1 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   2 con; 0-2 aty)
%            Number of variables   :   31 (   2 sgn  23   !;   4   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(2,axiom,
    ! [X1] : ~ member(X1,null_class),
    file('/tmp/tmpJ_nXz0/sel_SET062+1.p_1',null_class_defn) ).

fof(3,axiom,
    ! [X1,X2] :
      ( subclass(X1,X2)
    <=> ! [X3] :
          ( member(X3,X1)
         => member(X3,X2) ) ),
    file('/tmp/tmpJ_nXz0/sel_SET062+1.p_1',subclass_defn) ).

fof(5,conjecture,
    ! [X1] : subclass(null_class,X1),
    file('/tmp/tmpJ_nXz0/sel_SET062+1.p_1',null_class_is_subclass) ).

fof(6,negated_conjecture,
    ~ ! [X1] : subclass(null_class,X1),
    inference(assume_negation,[status(cth)],[5]) ).

fof(7,plain,
    ! [X1] : ~ member(X1,null_class),
    inference(fof_simplification,[status(thm)],[2,theory(equality)]) ).

fof(14,plain,
    ! [X2] : ~ member(X2,null_class),
    inference(variable_rename,[status(thm)],[7]) ).

cnf(15,plain,
    ~ member(X1,null_class),
    inference(split_conjunct,[status(thm)],[14]) ).

fof(16,plain,
    ! [X1,X2] :
      ( ( ~ subclass(X1,X2)
        | ! [X3] :
            ( ~ member(X3,X1)
            | member(X3,X2) ) )
      & ( ? [X3] :
            ( member(X3,X1)
            & ~ member(X3,X2) )
        | subclass(X1,X2) ) ),
    inference(fof_nnf,[status(thm)],[3]) ).

fof(17,plain,
    ! [X4,X5] :
      ( ( ~ subclass(X4,X5)
        | ! [X6] :
            ( ~ member(X6,X4)
            | member(X6,X5) ) )
      & ( ? [X7] :
            ( member(X7,X4)
            & ~ member(X7,X5) )
        | subclass(X4,X5) ) ),
    inference(variable_rename,[status(thm)],[16]) ).

fof(18,plain,
    ! [X4,X5] :
      ( ( ~ subclass(X4,X5)
        | ! [X6] :
            ( ~ member(X6,X4)
            | member(X6,X5) ) )
      & ( ( member(esk1_2(X4,X5),X4)
          & ~ member(esk1_2(X4,X5),X5) )
        | subclass(X4,X5) ) ),
    inference(skolemize,[status(esa)],[17]) ).

fof(19,plain,
    ! [X4,X5,X6] :
      ( ( ~ member(X6,X4)
        | member(X6,X5)
        | ~ subclass(X4,X5) )
      & ( ( member(esk1_2(X4,X5),X4)
          & ~ member(esk1_2(X4,X5),X5) )
        | subclass(X4,X5) ) ),
    inference(shift_quantors,[status(thm)],[18]) ).

fof(20,plain,
    ! [X4,X5,X6] :
      ( ( ~ member(X6,X4)
        | member(X6,X5)
        | ~ subclass(X4,X5) )
      & ( member(esk1_2(X4,X5),X4)
        | subclass(X4,X5) )
      & ( ~ member(esk1_2(X4,X5),X5)
        | subclass(X4,X5) ) ),
    inference(distribute,[status(thm)],[19]) ).

cnf(22,plain,
    ( subclass(X1,X2)
    | member(esk1_2(X1,X2),X1) ),
    inference(split_conjunct,[status(thm)],[20]) ).

fof(26,negated_conjecture,
    ? [X1] : ~ subclass(null_class,X1),
    inference(fof_nnf,[status(thm)],[6]) ).

fof(27,negated_conjecture,
    ? [X2] : ~ subclass(null_class,X2),
    inference(variable_rename,[status(thm)],[26]) ).

fof(28,negated_conjecture,
    ~ subclass(null_class,esk2_0),
    inference(skolemize,[status(esa)],[27]) ).

cnf(29,negated_conjecture,
    ~ subclass(null_class,esk2_0),
    inference(split_conjunct,[status(thm)],[28]) ).

cnf(33,plain,
    subclass(null_class,X1),
    inference(spm,[status(thm)],[15,22,theory(equality)]) ).

cnf(38,negated_conjecture,
    $false,
    inference(rw,[status(thm)],[29,33,theory(equality)]) ).

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

cnf(40,negated_conjecture,
    $false,
    39,
    [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/SET062+1.p
% --creating new selector for [SET005+0.ax]
% -running prover on /tmp/tmpJ_nXz0/sel_SET062+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/tmpJ_nXz0/sel_SET062+1.p_1']
% -prover status Theorem
% Problem SET062+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SET/SET062+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SET/SET062+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
% 
%------------------------------------------------------------------------------