TPTP Problem File: MSC011+1.p

View Solutions - Solve Problem

%------------------------------------------------------------------------------
% File     : MSC011+1 : TPTP v7.5.0. Released v3.2.0.
% Domain   : Miscellaneous
% Problem  : Drinker paradox
% Version  : Especial.
% English  :

% Refs     : [Bez05] Bezem (2005), Email to Geoff Sutcliffe
% Source   : [Bez05]
% Names    : drinker [Bez05]

% Status   : Theorem
% Rating   : 0.00 v5.3.0, 0.09 v5.2.0, 0.00 v3.2.0

% Syntax   : Number of formulae    :    4 (   1 unit)
%            Number of atoms       :    8 (   0 equality)
%            Maximal formula depth :    4 (   3 average)
%            Number of connectives :    4 (   0   ~;   0   |;   2   &)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%                                         (   0  ~|;   0  ~&)
%            Number of predicates  :    4 (   2 propositional; 0-1 arity)
%            Number of functors    :    0 (   0 constant; --- arity)
%            Number of variables   :    3 (   0 sgn;   2   !;   1   ?)
%            Maximal term depth    :    1 (   1 average)
% SPC      : FOF_THM_EPR_NEQ

% Comments :
%------------------------------------------------------------------------------
fof(d_cons,axiom,(
    ! [A] :
      ( ( drunk(A)
        & not_drunk(A) )
     => goal ) )).

fof(neg_phi,axiom,(
    ! [A] :
      ( drunk(A)
      & neg_psi ) )).

fof(neg_psi_ax,axiom,
    ( neg_psi
   => ? [A] : not_drunk(A) )).

fof(goal_to_be_proved,conjecture,(
    goal )).

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