TPTP Problem File: SYN939+1.p
View Solutions
- Solve Problem
%--------------------------------------------------------------------------
% File : SYN939+1 : TPTP v9.0.0. Released v3.1.0.
% Domain : Syntactic
% Problem : Syntactic from Shults
% Version : Especial.
% English :
% Refs : [Shu04] Shults (2004), Email to G. Sutcliffe
% Source : [Shu04]
% Names :
% Status : Theorem
% Rating : 0.07 v9.0.0, 0.00 v8.1.0, 0.07 v7.5.0, 0.05 v7.4.0, 0.00 v5.5.0, 0.08 v5.4.0, 0.09 v5.3.0, 0.13 v5.2.0, 0.07 v5.0.0, 0.05 v4.1.0, 0.06 v4.0.1, 0.11 v4.0.0, 0.10 v3.7.0, 0.00 v3.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 ~; 0 |; 3 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 10 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 3 usr; 0 prp; 1-1 aty)
% Number of functors : 1 ( 1 usr; 0 con; 1-1 aty)
% Number of variables : 5 ( 3 !; 2 ?)
% SPC : FOF_THM_RFO_NEQ
% Comments :
%--------------------------------------------------------------------------
fof(prove_this,conjecture,
! [C,B] :
( ! [Z] : q(f(Z))
=> ? [X,Y] :
( ( p(f(Y))
=> p(X) )
& ( r(Y)
=> ( r(B)
& r(C) ) )
& q(X) ) ) ).
%--------------------------------------------------------------------------