## TPTP Problem File: SEV187^5.p

View Solutions - Solve Problem

```%------------------------------------------------------------------------------
% File     : SEV187^5 : TPTP v7.5.0. Released v4.0.0.
% Domain   : Set Theory (Sets of sets)
% Problem  : TPS problem from CLOS-SYS-THMS
% Version  : Especial.
% English  :

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

% Status   : Theorem
% Rating   : 0.00 v6.2.0, 0.17 v6.1.0, 0.00 v4.0.0
% Syntax   : Number of formulae    :    4 (   0 unit;   3 type;   0 defn)
%            Number of atoms       :    4 (   0 equality;   2 variable)
%            Maximal formula depth :    6 (   3 average)
%            Number of connectives :    3 (   0   ~;   0   |;   0   &;   1   @)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%                                         (   0  ~|;   0  ~&)
%            Number of type conns  :    7 (   7   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    6 (   3   :;   0   =)
%            Number of variables   :    2 (   0 sgn;   2   !;   0   ?;   0   ^)
%                                         (   2   :;   0  !>;   0  ?*)
%                                         (   0  @-;   0  @+)
% SPC      : TH0_THM_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(a_type,type,(
a: \$tType )).

thf(b_type,type,(
b: \$tType )).

thf(c_type,type,(
c: \$tType )).

thf(cCS3_ALL_THM_pme,conjecture,(
! [S: ( a > b > c > \$o ) > \$o] :
( ! [Xx: a > b > c > \$o] :
( ( S @ Xx )
=> \$true )
=> \$true ) )).

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