%------------------------------------------------------------------------------
% File     : COM150+1 : TPTP v8.2.0. Released v6.4.0.
% Domain   : Computing Theory
% Problem  : Axioms for progress/preservation proof
% Version  : Especial.
% English  : 

% Refs     : [Pie02] Pierce (2002), Programming Languages
%          : [Gre15] Grewe (2015), Email to Geoff Sutcliffe
%          : [GE+15] Grewe et al. (2015), Type Systems for the Masses: Deri
% Source   : [Gre15]
% Names    : 

% Status   : Satisfiable
% Rating   : 1.00 v6.4.0
% Syntax   : Number of formulae    :   60 (   7 unt;   0 def)
%            Number of atoms       :  299 ( 227 equ)
%            Maximal formula atoms :   33 (   4 avg)
%            Number of connectives :  278 (  39   ~;  17   |; 123   &)
%                                         (   0 <=>;  99  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   23 (   8 avg)
%            Maximal term depth    :    5 (   1 avg)
%            Number of predicates  :    8 (   6 usr;   1 prp; 0-3 aty)
%            Number of functors    :   16 (  16 usr;   3 con; 0-3 aty)
%            Number of variables   :  324 ( 256   !;  68   ?)
% SPC      : FOF_SAT_RFO_SEQ

% Comments : Generated by Veritas: https://github.com/stg-tud/type-pragmatics
%------------------------------------------------------------------------------
include('Axioms/COM001+0.ax').
include('Axioms/COM001+1.ax').
%------------------------------------------------------------------------------