%------------------------------------------------------------------------------
% File     : SWW469+1 : TPTP v8.2.0. Released v5.3.0.
% Domain   : Software Verification
% Problem  : Hoare's Logic with Procedures line 112, 100 axioms selected
% Version  : Especial.
% English  :

% Refs     : [BN10]  Boehme & Nipkow (2010), Sledgehammer: Judgement Day
%          : [Bla11] Blanchette (2011), Email to Geoff Sutcliffe
% Source   : [Bla11]
% Names    : hoare_100_fofmg_l112 [Bla11]

% Status   : Theorem
% Rating   : 0.03 v7.1.0, 0.04 v7.0.0, 0.03 v6.4.0, 0.04 v6.3.0, 0.00 v6.2.0, 0.08 v6.1.0, 0.07 v6.0.0, 0.00 v5.3.0
% Syntax   : Number of formulae    :    7 (   5 unt;   0 def)
%            Number of atoms       :   12 (   2 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :    8 (   3   ~;   0   |;   2   &)
%                                         (   1 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   3 prp; 0-2 aty)
%            Number of functors    :    2 (   2 usr;   1 con; 0-1 aty)
%            Number of variables   :    4 (   2   !;   2   ?)
% SPC      : FOF_THM_RFO_SEQ

% Comments : This file was generated by Isabelle (most likely Sledgehammer)
%            2011-08-09 15:17:50
%          : Encoded with monomorphized guards.
%------------------------------------------------------------------------------
%----Explicit typings (1)
fof(gsy_c_HOL_Oundefined_000tc__Com__Ostate,axiom,
    is_state(undefined_state(state)) ).

%----Relevant facts (4)
fof(fact_0_state__not__singleton__def,axiom,
    ( hoare_165779456gleton
  <=> ? [S,T] :
        ( is_state(S)
        & is_state(T)
        & S != T ) ) ).

fof(fact_1_induct__false__def,axiom,
    ~ induct_false ).

fof(fact_2_induct__trueI,axiom,
    induct_true ).

fof(fact_3_induct__true__def,axiom,
    induct_true ).

%----Conjectures (2)
fof(conj_0,hypothesis,
    hoare_165779456gleton ).

fof(conj_1,conjecture,
    ! [T] :
      ( is_state(T)
     => ~ ! [S] :
            ( is_state(S)
           => S = T ) ) ).

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