TPTP Problem File: SYO366_8.p
View Solutions
- Solve Problem
%------------------------------------------------------------------------------
% File : SYO366_8 : TPTP v9.0.0. Released v8.0.0.
% Domain : Syntactic
% Problem : TPS problem from EXTENSIONALITY
% Version : Especial.
% English :
% Refs :
% Source : [TPTP]
% Names :
% Status : Theorem
% Rating : 0.00 v8.1.0
% Syntax : Number of formulae : 3 ( 0 unt; 2 typ; 0 def)
% Number of atoms : 5 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 2 ( 0 ~; 0 |; 0 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 2 ( 2 avg)
% Maximal term depth : 0 ( 0 avg)
% Number of FOOLs : 2 ( 2 fml; 0 var)
% Number of types : 1 ( 0 usr)
% Number of type conns : 1 ( 1 >; 0 *; 0 +; 0 <<)
% Number of predicates : 3 ( 2 usr; 2 prp; 0-1 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 0 ( 0 !; 0 ?; 0 :)
% SPC : TX0_THM_NEQ_NAR
% Comments : Translated to TXF from the THF version.
%------------------------------------------------------------------------------
tff(cP,type,
cP: $o > $o ).
tff(cA,type,
cA: $o ).
tff(cTRIVEXT4,conjecture,
( cP(( cA
=> cA ))
=> cP($true) ) ).
%------------------------------------------------------------------------------