TPTP Problem File: SEV368^5.p
View Solutions
- Solve Problem
%------------------------------------------------------------------------------
% File : SEV368^5 : TPTP v9.0.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 unt; 3 typ; 0 def)
% Number of atoms : 2 ( 0 equ; 0 cnn)
% Maximal formula atoms : 2 ( 2 avg)
% Number of connectives : 4 ( 0 ~; 0 |; 0 &; 3 @)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 4 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 2 ( 2 >; 0 *; 0 +; 0 <<)
% Number of symbols : 3 ( 3 usr; 1 con; 0-1 aty)
% Number of variables : 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
% Mellon University. Distributed under the Creative Commons copyleft
% license: http://creativecommons.org/licenses/by-sa/3.0/
%------------------------------------------------------------------------------
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 ) ) ) ).
%------------------------------------------------------------------------------