TPTP Problem File: SYN407+1.p
View Solutions
- Solve Problem
%--------------------------------------------------------------------------
% File : SYN407+1 : TPTP v9.0.0. Released v2.0.0.
% Domain : Syntactic
% Problem : Kalish and Montague Problem 241
% Version : Especial.
% English : Laws of alphabetic variance.
% Refs : [KM64] Kalish & Montegue (1964), Logic: Techniques of Formal
% : [Hah94] Haehnle (1994), Email to G. Sutcliffe
% Source : [Hah94]
% Names : kalish241 [Hah94]
% Status : Theorem
% Rating : 0.00 v5.3.0, 0.09 v5.2.0, 0.00 v4.1.0, 0.06 v4.0.1, 0.05 v3.7.0, 0.33 v3.5.0, 0.12 v3.4.0, 0.08 v3.3.0, 0.00 v3.2.0, 0.11 v3.1.0, 0.00 v2.5.0, 0.33 v2.4.0, 0.33 v2.2.1, 0.00 v2.1.0
% Syntax : Number of formulae : 1 ( 0 unt; 0 def)
% Number of atoms : 7 ( 0 equ)
% Maximal formula atoms : 7 ( 7 avg)
% Number of connectives : 6 ( 0 ~; 2 |; 1 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 3 usr; 0 prp; 1-1 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 3 ( 2 !; 1 ?)
% SPC : FOF_THM_EPR_NEQ
% Comments :
%--------------------------------------------------------------------------
fof(kalish241,conjecture,
( ! [X] :
( f(X)
=> ( g(X)
| h(X) ) )
=> ( ! [Y] :
( f(Y)
=> g(Y) )
| ? [Z] :
( f(Z)
& h(Z) ) ) ) ).
%--------------------------------------------------------------------------