SQLite format 3@ .  B p--tableisabelle_exportsisabelle_exportsCREATE TABLE "isabelle_exports" ("session_name" TEXT NOT NULL, "theory_name" TEXT NOT NULL, "name" TEXT NOT NULL, "compressed" INTEGER, "body" BLOB, PRIMARY KEY (session_name, theory_name, name))?S-indexsqlite_autoindex_isabelle_exports_1isabelle_exportsh77otableisabelle_session_infoisabelle_session_infoCREATE TABLE "isabelle_session_info" ("session_name" TEXT NOT NULL, "session_timing" BLOB, "command_timings" BLOB, "theory_timings" BLOB, "ml_statistics" BLOB, "task_statistics" BLOB, "errors" BLOB, "sources" TEXT, "input_heaps" TEXT, "output_heap" TEXT, "return_code" INTEGER, PRIMARY KEY (session_name))I]7indexsqlite_autoindex_isabelle_session_info_1isabelle_session_info ;;B7 D, ]% HOL-Quotient_Examples:threads=6elapsed=27.267cpu=43.708gc=2.896factor=1.607zXZִF! M]ŗXf1-q恈N/|p~p%++"yqL^ ?DS^  SBr~'\; ?` >FP,@" R~{cϖ@"î-UbPDnaڦSv4,rZdn%\B'EVS(OѴuCIkEJ FZׅ J`|B^3sݣ`c˦{f $ ׾ b2|lRTeD.6dҨ8-<ٹ1@Hp>b Z6xH:> c(ꂳy? әDߖtK ۇ̄҄lB_R.T<} 1t1=V}v3c|57Y{/'Cʕ-]V{ܬkN(Ẕj ~CiQ_h!IX ZV(sX-߸s(TDk?敽c#R P`H0%WM?Kֺ`SYx]#;WYg ~a#8kZC @6#ݦIRQDmkϞ&upԼg˞}Ѷ gзو9,' kM%62uwZ6<;bsW.ecyH@TVW[7DNi1_p UVŒϝ̔c+WM߅EU,#=#V~gYZ7zXZִF! ]ŗXi%@hNH "@[TT{'{MCqzYxm.=L6\)|+`ֻ7E/۶5NtNF)zA0r>< |Fgm(wP"<)G1Cx]g`VdOP,?îNDNL~ 6tZp1J4K?)6ӾPϚwefyMRaUԉ?§QD7VZ)ׯ}! dd UkuF_mSTD'<͐rVo1}rn Hd%~u#$c7iIt?3,8ɕge_Ѐ]O6Щ<8;<+euVwnpJ}%Dqz>`]]L]YqY5Phc-nCf=D"+Ǯӧq}K\h;@ *nBWE֬q<(24_cSqH/G)jd}#4ppG.@_AٕΞ]9ՂDôeIm؈kP+e 9ǵ:_K#%']8)Q >o$c ?U(MxìILYU{iѕlrNj%隁$&TJo>}Z6H5~x_4=hڇY5jE`$|5~ ࡇdEm#2+US"H+s8Vtӎ=;&<|ۨx78ʂxiB0"EJ _76 0ɴ%(av!|Qu7 Wqq-9YbNV:,=җ1>܋ Li`ZnHX6:4̮nqo2,H[ 扷Բ픮sy^2X]}TwJgWYj8~9'w wx,4Kڑ >D^Mu'Km-Wt.z|Emڌkz1:s: @\*{n}=gJLE-81Ws4m#ᦙWL×fJ5# ǮX5PA+EaL.L{dԨtzyuǤ)X%nOJ.6VX|^HOL-Quotient_ExamplesHOL-Quotient_Examples.Lift_FSetGenerated_Code.MLstructure HOL : sig type 'a equal val eq : 'a equal -> 'a -> 'a -> bool end = struct type 'a equal = {equal : 'a -> 'a -> bool}; val equal = #equal : 'a equal -> 'a -> 'a -> bool; fun eq A_ a b = equal A_ a b; end; (*struct HOL*) structure Set : sig datatype 'a set = Set of 'a list | Coset of 'a list end = struct datatype 'a set = Set of 'a list | Coset of 'a list; end; (*struct Set*) structure List : sig val filter : ('a -> bool) -> 'a list -> 'a list val member : 'a HOL.equal -> 'a list -> 'a -> bool val map : ('a -> 'b) -> 'a list -> 'b list end = struct fun filter p [] = [] | filter p (x :: xs) = (if p x then x :: filter p xs else filter p xs); fun member A_ [] y = false | member A_ (x :: xs) y = HOL.eq A_ x y orelse member A_ xs y; fun map f [] = [] | map f (x21 :: x22) = f x21 :: map f x22; end; (*struct List*) structure Lift_FSet : sig type 'a fset val fmap : ('a -> 'b) -> 'a fset -> 'b fset val fnil : 'a fset val fset : 'a fset -> 'a Set.set val fcons : 'a -> 'a fset -> 'a fset val fappend : 'a fset -> 'a fset -> 'a fset val ffilter : ('a -> bool) -> 'a fset -> 'a fset val fmember : 'a HOL.equal -> 'a -> 'a fset -> bool end = struct datatype 'a fset = Abs_fset of 'a list; fun fmap xa (Abs_fset x) = Abs_fset (List.map xa x); val fnil : 'a fset = Abs_fset []; fun fset (Abs_fset x) = Set.Set x; fun fcons xa (Abs_fset x) = Abs_fset (xa :: x); fun fappend (Abs_fset xa) (Abs_fset x) = Abs_fset (xa @ x); fun ffilter xa (Abs_fset x) = Abs_fset (List.filter xa x); fun fmember A_ xb (Abs_fset xa) = List.member A_ xa xb; end; (*struct Li hJ7I/HOL-Quotient_ExamplesHOL-Quotient_Examples.Lift_SetGenerated_Code.MLL7M/HOL-Quotient_ExamplesHOL-Quotient_Examples.Lift_DListGenerated_Code.MLJ7K/ HOL-Quotient_ExamplesHOL-Quotient_Examples.Lift_FSetGenerated_Code.ML  X X%7K/>HOL-Quotient_ExamplesHOL-Quotient_Examples.Lift_FSetGenerated_Code.MLstructure HOL : sig type 'a equal val eq : 'a equal -> 'a -> 'a -> bool end = struct type 'a equal = {equal : 'a -> 'a -> bool}; val equal = #equal : 'a equal -> 'a -> 'a -> bool; fun eq A_ a b = equal A_ a b; end; (*struct HOL*) structure Set : sig datatype 'a set = Set of 'a list | Coset of 'a list end = struct datatype 'a set = Set of 'a list | Coset of 'a list; end; (*struct Set*) structure List : sig val filter : ('a -> bool) -> 'a list -> 'a list val member : 'a HOL.equal -> 'a list -> 'a -> bool val map : ('a -> 'b) -> 'a list -> 'b list end = struct fun filter p [] = [] | filter p (x :: xs) = (if p x then x :: filter p xs else filter p xs); fun member A_ [] y = false | member A_ (x :: xs) y = HOL.eq A_ x y orelse member A_ xs y; fun map f [] = [] | map f (x21 :: x22) = f x21 :: map f x22; end; (*struct List*) structure Lift_FSet : sig type 'a fset val fmap : ('a -> 'b) -> 'a fset -> 'b fset val fnil : 'a fset val fset : 'a fset -> 'a Set.set val fcons : 'a -> 'a fset -> 'a fset val fappend : 'a fset -> 'a fset -> 'a fset val ffilter : ('a -> bool) -> 'a fset -> 'a fset val fmember : 'a HOL.equal -> 'a -> 'a fset -> bool end = struct datatype 'a fset = Abs_fset of 'a list; fun fmap xa (Abs_fset x) = Abs_fset (List.map xa x); val fnil : 'a fset = Abs_fset []; fun fset (Abs_fset x) = Set.Set x; fun fcons xa (Abs_fset x) = Abs_fset (xa :: x); fun fappend (Abs_fset xa) (Abs_fset x) = Abs_fset (xa @ x); fun ffilter xa (Abs_fset x) = Abs_fset (List.filter xa x); fun fmember A_ xb (Abs_fset xa) = List.member A_ xa xb; end; (*struct Lift_FSet*) yy7M/zHOL-Quotient_ExamplesHOL-Quotient_Examples.Lift_DListGenerated_Code.MLstructure Fun : sig val id : 'a -> 'a end = struct fun id x = (fn xa => xa) x; end; (*struct Fun*) structure HOL : sig type 'a equal val eq : 'a equal -> 'a -> 'a -> bool end = struct type 'a equal = {equal : 'a -> 'a -> bool}; val equal = #equal : 'a equal -> 'a -> 'a -> bool; fun eq A_ a b = equal A_ a b; end; (*struct HOL*) structure Arith : sig datatype nat = Zero_nat | Suc of nat end = struct datatype nat = Zero_nat | Suc of nat; end; (*struct Arith*) structure List : sig val fold : ('a -> 'b -> 'b) -> 'a list -> 'b -> 'b val maps : ('a -> 'b list) -> 'a list -> 'b list val null : 'a list -> bool val foldr : ('a -> 'b -> 'b) -> 'a list -> 'b -> 'b val filter : ('a -> bool) -> 'a list -> 'a list val member : 'a HOL.equal -> 'a list -> 'a -> bool val insert : 'a HOL.equal -> 'a -> 'a list -> 'a list val remdups : 'a HOL.equal -> 'a list -> 'a list val remove1 : 'a HOL.equal -> 'a -> 'a list -> 'a list val map : ('a -> 'b) -> 'a list -> 'b list val size_list : 'a list -> Arith.nat end = struct fun fold f (x :: xs) s = fold f xs (f x s) | fold f [] s = s; fun maps f [] = [] | maps f (x :: xs) = f x @ maps f xs; fun null [] = true | null (x :: xs) = false; fun foldr f [] = Fun.id | foldr f (x :: xs) = f x o foldr f xs; fun filter p [] = [] | filter p (x :: xs) = (if p x then x :: filter p xs else filter p xs); fun member A_ [] y = false | member A_ (x :: xs) y = HOL.eq A_ x y orelse member A_ xs y; fun insert A_ x xs = (if member A_ xs x then xs else x :: xs); fun remdups A_ [] = [] | remdups A_ (x :: xs) = (if member A_ xs x then remdups A_ xs else x :: remdups A_ xs); fun remove1 A_ x [] = [] | remove1 A_ x (y :: xs) = (if HOL.eq A_ x y then xs else y :: remove1 A_ x xs); fun map f [] = [] | map f (x21 :: x22) = f x21 :: map f x22; fun gen_length n (x :: xs) = gen_length (Arith.Suc n) xs | gen_length n [] = n; fun size_list x = gen_length Arith.Zero_nat x; end; (*struct List*) structure Lift_DList : sig type 'a dlist val map : 'a HOL.equal -> ('b -> 'a) -> 'b dlist -> 'a dlist val fold : ('a -> 'b -> 'b) -> 'a dlist -> 'b -> 'b val null : 'a dlist -> bool val empty : 'a dlist val foldr : ('a -> 'b -> 'b) -> 'a dlist -> 'b -> 'b val concat : 'a HOL.equal -> 'a dlist dlist -> 'a dlist val filter : ('a -> bool) -> 'a dlist -> 'a dlist val insert : 'a HOL.equal -> 'a -> 'a dlist -> 'a dlist val length : 'a dlist -> Arith.nat val member : 'a HOL.equal -> 'a dlist -> 'a -> bool val remove : 'a HOL.equal -> 'a -> 'a dlist -> 'a dlist end = struct datatype 'a dlist = Abs_dlist of 'a list; fun list_of_dlist (Abs_dlist x) = x; fun map A_ xb xc = Abs_dlist (List.remdups A_ (List.map xb (list_of_dlist xc))); fun fold x xc = List.fold x (list_of_dlist xc); fun null xa = List.null (list_of_dlist xa); val empty : 'a dlist = Abs_dlist []; fun foldr x xc = List.foldr x (list_of_dlist xc); fun concat A_ xa = Abs_dlist (List.remdups A_ (List.maps list_of_dlist (list_of_dlist xa))); fun filter xb xc = Abs_dlist (List.filter xb (list_of_dlist xc)); fun insert A_ xb xc = Abs_dlist (List.insert A_ xb (list_of_dlist xc)); fun length xa = List.size_list (list_of_dlist xa); fun member A_ xa = List.member A_ (list_of_dlist xa); fun remove A_ xb xc = Abs_dlist (List.remove1 A_ xb (list_of_dlist xc)); end; (*struct Lift_DList*)  K K27I/ZHOL-Quotient_ExamplesHOL-Quotient_Examples.Lift_SetGenerated_Code.MLstructure HOL : sig type 'a equal val eq : 'a equal -> 'a -> 'a -> bool end = struct type 'a equal = {equal : 'a -> 'a -> bool}; val equal = #equal : 'a equal -> 'a -> 'a -> bool; fun eq A_ a b = equal A_ a b; end; (*struct HOL*) structure Orderings : sig type 'a bot val bot_bool : bool bot val bot_fun : 'b bot -> 'a -> 'b end = struct val bot_boola : bool = false; type 'a bot = {bot : 'a}; val bot = #bot : 'a bot -> 'a; val bot_bool = {bot = bot_boola} : bool bot; fun bot_fun B_ x = bot B_; end; (*struct Orderings*) structure Lift_Set : sig type 'a set val empty : 'a set val insert : 'a HOL.equal -> 'a -> 'a set -> 'a set end = struct datatype 'a set = Set of ('a -> bool); val empty : 'a set = Set (Orderings.bot_fun Orderings.bot_bool); fun insert A_ xa (Set x) = Set (fn y => HOL.eq A_ y xa orelse x y); end; (*struct Lift_Set*)