TPTP Problem File: PUZ060+1.p

View Solutions - Solve Problem

%------------------------------------------------------------------------------
% File     : PUZ060+1 : TPTP v8.0.0. Released v3.1.0.
% Domain   : Puzzles
% Problem  : Food problems
% Version  : Especial.
% English  :

% Refs     : [Shu04] Shults (2004), Email to G. Sutcliffe
% Source   : [Shu04]
% Names    :

% Status   : Theorem
% Rating   : 0.00 v5.3.0, 0.09 v5.2.0, 0.00 v3.1.0
% Syntax   : Number of formulae    :    1 (   0 unt;   0 def)
%            Number of atoms       :   14 (   0 equ)
%            Maximal formula atoms :   14 (  14 avg)
%            Number of connectives :   13 (   0   ~;   0   |;   8   &)
%                                         (   0 <=>;   5  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   18 (  18 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    5 (   5 usr;   0 prp; 1-2 aty)
%            Number of functors    :    0 (   0 usr;   0 con; --- aty)
%            Number of variables   :   12 (  11   !;   1   ?)
% SPC      : FOF_THM_EPR_NEQ

% Comments :
%------------------------------------------------------------------------------
fof(prove_this,conjecture,
    ! [Peanuts,John,Bill,Sue,Apples,Chicken] :
      ( ( ! [X] :
            ( food(X)
           => likes(John,X) )
        & food(Apples)
        & food(Chicken)
        & ! [X] :
            ( ? [Y] :
                ( eats(Y,X)
                & not_killed_by(Y,X) )
           => food(X) )
        & eats(Bill,Peanuts)
        & alive(Bill)
        & ! [X] :
            ( eats(Bill,X)
           => eats(Sue,X) )
        & ! [Y] :
            ( alive(Y)
           => ! [X] : not_killed_by(Y,X) ) )
     => likes(John,Peanuts) ) ).

%------------------------------------------------------------------------------