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

% Computer : fort-sumter.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:07 EDT 2012

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

% Comments : 
%------------------------------------------------------------------------------
fof(1,axiom,
    ! [X1,X2] :
      ( equal(X1,X2)
    <=> ( subclass(X1,X2)
        & subclass(X2,X1) ) ),
    file('/tmp/tmpuy_0Bg/sel_SET054+1.p_1',extensionality) ).

fof(4,conjecture,
    ! [X1] : subclass(X1,X1),
    file('/tmp/tmpuy_0Bg/sel_SET054+1.p_1',reflexivity_of_subclass) ).

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

fof(6,plain,
    ! [X1,X2] :
      ( ( ~ equal(X1,X2)
        | ( subclass(X1,X2)
          & subclass(X2,X1) ) )
      & ( ~ subclass(X1,X2)
        | ~ subclass(X2,X1)
        | equal(X1,X2) ) ),
    inference(fof_nnf,[status(thm)],[1]) ).

fof(7,plain,
    ! [X3,X4] :
      ( ( ~ equal(X3,X4)
        | ( subclass(X3,X4)
          & subclass(X4,X3) ) )
      & ( ~ subclass(X3,X4)
        | ~ subclass(X4,X3)
        | equal(X3,X4) ) ),
    inference(variable_rename,[status(thm)],[6]) ).

fof(8,plain,
    ! [X3,X4] :
      ( ( subclass(X3,X4)
        | ~ equal(X3,X4) )
      & ( subclass(X4,X3)
        | ~ equal(X3,X4) )
      & ( ~ subclass(X3,X4)
        | ~ subclass(X4,X3)
        | equal(X3,X4) ) ),
    inference(distribute,[status(thm)],[7]) ).

cnf(10,plain,
    ( subclass(X2,X1)
    | X1 != X2 ),
    inference(split_conjunct,[status(thm)],[8]) ).

fof(22,negated_conjecture,
    ? [X1] : ~ subclass(X1,X1),
    inference(fof_nnf,[status(thm)],[5]) ).

fof(23,negated_conjecture,
    ? [X2] : ~ subclass(X2,X2),
    inference(variable_rename,[status(thm)],[22]) ).

fof(24,negated_conjecture,
    ~ subclass(esk2_0,esk2_0),
    inference(skolemize,[status(esa)],[23]) ).

cnf(25,negated_conjecture,
    ~ subclass(esk2_0,esk2_0),
    inference(split_conjunct,[status(thm)],[24]) ).

cnf(26,plain,
    subclass(X1,X1),
    inference(er,[status(thm)],[10,theory(equality)]) ).

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

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

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