## TPTP Problem File: SEV368^5.p

View Solutions - Solve Problem

```%------------------------------------------------------------------------------
% File     : SEV368^5 : TPTP v7.5.0. Released v4.0.0.
% Domain   : Set Theory (GvNB)
% Problem  : TPS problem from GVB-MB-THMS
% Version  : Especial.
% English  :

% Refs     : [Bro09] Brown (2009), Email to Geoff Sutcliffe
% Source   : [Bro09]
% Names    : tps_0600 [Bro09]

% Status   : CounterSatisfiable
% Rating   : 0.00 v4.0.0
% Syntax   : Number of formulae    :    4 (   0 unit;   3 type;   0 defn)
%            Number of atoms       :    5 (   0 equality;   0 variable)
%            Maximal formula depth :    4 (   3 average)
%            Number of connectives :    4 (   0   ~;   0   |;   0   &;   3   @)
%                                         (   0 <=>;   1  =>;   0  <=;   0 <~>)
%                                         (   0  ~|;   0  ~&)
%            Number of type conns  :    2 (   2   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    5 (   3   :;   0   =)
%            Number of variables   :    0 (   0 sgn;   0   !;   0   ?;   0   ^)
%                                         (   0   :;   0  !>;   0  ?*)
%                                         (   0  @-;   0  @+)
% SPC      : TH0_CSA_NEQ_NAR

% Comments : This problem is from the TPS library. Copyright (c) 2009 The TPS
%            project in the Department of Mathematical Sciences at Carnegie
%------------------------------------------------------------------------------
thf(u,type,(
u: \$i )).

thf(cGVB_POWERSET,type,(
cGVB_POWERSET: \$i > \$i )).

thf(cGVB_M,type,(
cGVB_M: \$i > \$o )).

thf(cGVB_C3A,conjecture,
( ( cGVB_M @ u )
=> ( cGVB_M @ ( cGVB_POWERSET @ u ) ) )).

%------------------------------------------------------------------------------
```