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

% Computer : art05.cs.miami.edu
% Model    : i686 i686
% CPU      : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory   : 2018MB
% OS       : Linux 2.6.26.8-57.fc8
% CPULimit : 300s
% DateTime : Sun Dec 26 08:05:28 EST 2010

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

% Comments : 
%------------------------------------------------------------------------------
fof(201,axiom,
    ! [X1] : boole_POSet(X1) = poset_of_lattice(boole_lattice(X1)),
    file('/tmp/tmpLOVb7C/sel_SEU382+2.p_1',d2_yellow_1) ).

fof(352,axiom,
    ! [X1] : boole_POSet(X1) = incl_POSet(powerset(X1)),
    file('/tmp/tmpLOVb7C/sel_SEU382+2.p_1',t4_yellow_1) ).

fof(451,conjecture,
    ! [X1] : the_carrier(boole_POSet(X1)) = powerset(X1),
    file('/tmp/tmpLOVb7C/sel_SEU382+2.p_1',t4_waybel_7) ).

fof(480,axiom,
    ! [X1] :
      ( the_carrier(incl_POSet(X1)) = X1
      & the_InternalRel(incl_POSet(X1)) = inclusion_order(X1) ),
    file('/tmp/tmpLOVb7C/sel_SEU382+2.p_1',t1_yellow_1) ).

fof(844,negated_conjecture,
    ~ ! [X1] : the_carrier(boole_POSet(X1)) = powerset(X1),
    inference(assume_negation,[status(cth)],[451]) ).

fof(2804,plain,
    ! [X2] : boole_POSet(X2) = poset_of_lattice(boole_lattice(X2)),
    inference(variable_rename,[status(thm)],[201]) ).

cnf(2805,plain,
    boole_POSet(X1) = poset_of_lattice(boole_lattice(X1)),
    inference(split_conjunct,[status(thm)],[2804]) ).

fof(3822,plain,
    ! [X2] : boole_POSet(X2) = incl_POSet(powerset(X2)),
    inference(variable_rename,[status(thm)],[352]) ).

cnf(3823,plain,
    boole_POSet(X1) = incl_POSet(powerset(X1)),
    inference(split_conjunct,[status(thm)],[3822]) ).

fof(4500,negated_conjecture,
    ? [X1] : the_carrier(boole_POSet(X1)) != powerset(X1),
    inference(fof_nnf,[status(thm)],[844]) ).

fof(4501,negated_conjecture,
    ? [X2] : the_carrier(boole_POSet(X2)) != powerset(X2),
    inference(variable_rename,[status(thm)],[4500]) ).

fof(4502,negated_conjecture,
    the_carrier(boole_POSet(esk301_0)) != powerset(esk301_0),
    inference(skolemize,[status(esa)],[4501]) ).

cnf(4503,negated_conjecture,
    the_carrier(boole_POSet(esk301_0)) != powerset(esk301_0),
    inference(split_conjunct,[status(thm)],[4502]) ).

fof(4693,plain,
    ! [X2] :
      ( the_carrier(incl_POSet(X2)) = X2
      & the_InternalRel(incl_POSet(X2)) = inclusion_order(X2) ),
    inference(variable_rename,[status(thm)],[480]) ).

cnf(4695,plain,
    the_carrier(incl_POSet(X1)) = X1,
    inference(split_conjunct,[status(thm)],[4693]) ).

cnf(7498,plain,
    incl_POSet(powerset(X1)) = poset_of_lattice(boole_lattice(X1)),
    inference(rw,[status(thm)],[3823,2805,theory(equality)]),
    [unfolding] ).

cnf(7531,negated_conjecture,
    the_carrier(poset_of_lattice(boole_lattice(esk301_0))) != powerset(esk301_0),
    inference(rw,[status(thm)],[4503,2805,theory(equality)]),
    [unfolding] ).

cnf(8355,plain,
    the_carrier(poset_of_lattice(boole_lattice(X1))) = powerset(X1),
    inference(spm,[status(thm)],[4695,7498,theory(equality)]) ).

cnf(143399,negated_conjecture,
    $false,
    inference(rw,[status(thm)],[7531,8355,theory(equality)]) ).

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

cnf(143401,negated_conjecture,
    $false,
    143400,
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SEU/SEU382+2.p
% --creating new selector for []
% -running prover on /tmp/tmpLOVb7C/sel_SEU382+2.p_1 with time limit 29
% -prover status Theorem
% Problem SEU382+2.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SEU/SEU382+2.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SEU/SEU382+2.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
% 
%------------------------------------------------------------------------------