Show cursor correctly whn loading file

[lyx.git] / lib / examples / beamerlyxexample1.lyx

diff --git a/lib/examples/beamerlyxexample1.lyx b/lib/examples/beamerlyxexample1.lyx
index 9987d3b7e4f3817496c657e9ef8d581e7a28d088..922cee1048d4b2c31b9eb95db34ecd32d451f7c6 100644 (file)
--- a/lib/examples/beamerlyxexample1.lyx
+++ b/lib/examples/beamerlyxexample1.lyx
@@ -1,5 +1,5 @@
-#LyX 2.2 created this file. For more info see http://www.lyx.org/
-\lyxformat 507
+#LyX 2.3 created this file. For more info see http://www.lyx.org/
+\lyxformat 544
 \begin_document
 \begin_header
 \save_transient_properties true
@@ -157,9 +157,9 @@
 \language_package default
 \inputencoding auto
 \fontencoding global
-\font_roman "times" "default"
-\font_sans "default" "default"
-\font_typewriter "default" "default"
+\font_roman "lmodern" "default"
+\font_sans "lmss" "default"
+\font_typewriter "lmtt" "default"
 \font_math "auto" "auto"
 \font_default_family default
 \use_non_tex_fonts false
@@ -167,6 +167,8 @@
 \font_osf false
 \font_sf_scale 100 100
 \font_tt_scale 100 100
+\use_microtype false
+\use_dash_ligatures false
 \graphics default
 \default_output_format default
 \output_sync 0
@@ -176,17 +178,17 @@
 \spacing single
 \use_hyperref false
 \papersize default
-\use_geometry false
+\use_geometry true
 \use_package amsmath 2
 \use_package amssymb 2
-\use_package cancel 0
-\use_package esint 0
+\use_package cancel 1
+\use_package esint 1
 \use_package mathdots 1
-\use_package mathtools 0
+\use_package mathtools 1
 \use_package mhchem 1
-\use_package stackrel 0
-\use_package stmaryrd 0
-\use_package undertilde 0
+\use_package stackrel 1
+\use_package stmaryrd 1
+\use_package undertilde 1
 \cite_engine basic
 \cite_engine_type default
 \biblio_style plain
@@ -196,6 +198,7 @@
 \suppress_date false
 \justification true
 \use_refstyle 0
+\use_minted 0
 \index Index
 \shortcut idx
 \color #008000
@@ -204,7 +207,10 @@
 \tocdepth 2
 \paragraph_separation indent
 \paragraph_indentation default
-\quotes_language english
+\is_math_indent 0
+\math_numbering_side default
+\quotes_style english
+\dynamic_quotes 0
 \papercolumns 1
 \papersides 1
 \paperpagestyle default
@@ -262,10 +268,6 @@ Outline
 \end_inset
 
 
-\begin_inset Separator parbreak
-\end_inset
-
-
 \end_layout
 
 \begin_deeper
@@ -366,17 +368,10 @@ Tournaments Consist of Jousts Between Knights
 \end_inset
 
 
-\begin_inset Separator parbreak
-\end_inset
-
-
 \end_layout
 
 \begin_deeper
 \begin_layout Columns
-\begin_inset Separator parbreak
-\end_inset
-
 
 \end_layout
 
@@ -566,10 +561,6 @@ What is a Tournament?
 \end_inset
 
 
-\begin_inset Separator parbreak
-\end_inset
-
-
 \end_layout
 
 \begin_deeper
@@ -578,6 +569,7 @@ What is a Tournament?
 status open
 
 \begin_layout Plain Layout
+
 1-
 \end_layout
 
@@ -591,6 +583,7 @@ A group of knights.
 status open
 
 \begin_layout Plain Layout
+
 2-
 \end_layout
 
@@ -604,6 +597,7 @@ Every pair has a joust.
 status open
 
 \begin_layout Plain Layout
+
 3-
 \end_layout
 
@@ -616,7 +610,7 @@ In every joust one knight wins.
 \end_deeper
 \end_deeper
 \begin_layout Standard
-\begin_inset Separator parbreak
+\begin_inset Separator plain
 \end_inset
 
 
@@ -633,17 +627,10 @@ Tournaments are Complete Directed Graphs
 \end_inset
 
 
-\begin_inset Separator parbreak
-\end_inset
-
-
 \end_layout
 
 \begin_deeper
 \begin_layout Columns
-\begin_inset Separator parbreak
-\end_inset
-
 
 \end_layout
 
@@ -857,6 +844,7 @@ end{pgfpicture}
 status collapsed
 
 \begin_layout Plain Layout
+
 2-
 \end_layout
 
@@ -871,10 +859,6 @@ tournament
  
 \color inherit
 is a
-\begin_inset Separator parbreak
-\end_inset
-
-
 \end_layout
 
 \begin_deeper
@@ -894,7 +878,7 @@ any two different vertices.
 \end_deeper
 \end_deeper
 \begin_layout Standard
-\begin_inset Separator parbreak
+\begin_inset Separator plain
 \end_inset
 
 
@@ -905,6 +889,7 @@ any two different vertices.
 status collapsed
 
 \begin_layout Plain Layout
+
 +
 \end_layout
 
@@ -921,10 +906,6 @@ Tournaments Arise Naturally in Different Situations
 \end_inset
 
 
-\begin_inset Separator parbreak
-\end_inset
-
-
 \end_layout
 
 \begin_deeper
@@ -939,10 +920,6 @@ Applications in Ordering Theory
 \end_inset
 
 
-\begin_inset Separator parbreak
-\end_inset
-
-
 \end_layout
 
 \begin_deeper
@@ -957,7 +934,7 @@ The comparison relation may be cyclic, however.
 
 \end_deeper
 \begin_layout Standard
-\begin_inset Separator parbreak
+\begin_inset Separator plain
 \end_inset
 
 
@@ -974,10 +951,6 @@ Applications in Sociology
 \end_inset
 
 
-\begin_inset Separator parbreak
-\end_inset
-
-
 \end_layout
 
 \begin_deeper
@@ -992,7 +965,7 @@ Reviewers decide for any two candidates whom they prefer.
 
 \end_deeper
 \begin_layout Standard
-\begin_inset Separator parbreak
+\begin_inset Separator plain
 \end_inset
 
 
@@ -1009,10 +982,6 @@ Applications in Structural Complexity Theory
 \end_inset
 
 
-\begin_inset Separator parbreak
-\end_inset
-
-
 \end_layout
 
 \begin_deeper
@@ -1053,10 +1022,6 @@ status open
 \end_inset
 
 
-\begin_inset Separator parbreak
-\end_inset
-
-
 \end_layout
 
 \begin_deeper
@@ -1074,6 +1039,7 @@ status open
 status open
 
 \begin_layout Plain Layout
+
 1
 \end_layout
 
@@ -1093,6 +1059,7 @@ status open
 status open
 
 \begin_layout Plain Layout
+
 2-3
 \end_layout
 
@@ -1116,6 +1083,7 @@ status open
 status open
 
 \begin_layout Plain Layout
+
 4-5
 \end_layout
 
@@ -1135,6 +1103,7 @@ status open
 status open
 
 \begin_layout Plain Layout
+
 6-7
 \end_layout
 
@@ -1154,6 +1123,7 @@ status open
 status open
 
 \begin_layout Plain Layout
+
 8-9
 \end_layout
 
@@ -1177,6 +1147,7 @@ status open
 status open
 
 \begin_layout Plain Layout
+
 10-
 \end_layout
 
@@ -1193,10 +1164,6 @@ the Approximation Problem
 \end_inset
 
 
-\begin_inset Separator parbreak
-\end_inset
-
-
 \end_layout
 
 \begin_deeper
@@ -1245,6 +1212,7 @@ target
 status open
 
 \begin_layout Plain Layout
+
 only@-9| visible@8-
 \end_layout
 
@@ -1285,6 +1253,7 @@ phantom{p}
 status open
 
 \begin_layout Plain Layout
+
 only@10-
 \end_layout
 
@@ -1327,16 +1296,13 @@ nointerlineskip
 status open
 
 \begin_layout Plain Layout
+
 1,3,5,7,9,11-12
 \end_layout
 
 \end_inset
 
 
-\begin_inset Separator parbreak
-\end_inset
-
-
 \end_layout
 
 \begin_deeper
@@ -1351,10 +1317,6 @@ t,onlytextwidth
 \end_inset
 
 
-\begin_inset Separator parbreak
-\end_inset
-
-
 \end_layout
 
 \begin_deeper
@@ -1367,6 +1329,7 @@ status open
 status open
 
 \begin_layout Plain Layout
+
 1-2
 \end_layout
 
@@ -1428,10 +1391,6 @@ Example Input
 \end_inset
 
 
-\begin_inset Separator parbreak
-\end_inset
-
-
 \end_layout
 
 \begin_deeper
@@ -1774,6 +1733,7 @@ status open
 status open
 
 \begin_layout Plain Layout
+
 3-
 \end_layout
 
@@ -1805,6 +1765,7 @@ column{5cm}
 status collapsed
 
 \begin_layout Plain Layout
+
 only@3-
 \end_layout
 
@@ -1821,10 +1782,6 @@ Example Output
 \end_inset
 
 
-\begin_inset Separator parbreak
-\end_inset
-
-
 \end_layout
 
 \begin_deeper
@@ -2045,16 +2002,13 @@ end{pgfpicture}
 status open
 
 \begin_layout Plain Layout
+
 2,4,6,8,10
 \end_layout
 
 \end_inset
 
 
-\begin_inset Separator parbreak
-\end_inset
-
-
 \end_layout
 
 \begin_deeper
@@ -2069,10 +2023,6 @@ Variants of Path Finding Problems
 \end_inset
 
 
-\begin_inset Separator parbreak
-\end_inset
-
-
 \end_layout
 
 \begin_deeper
@@ -2081,6 +2031,7 @@ Variants of Path Finding Problems
 status open
 
 \begin_layout Plain Layout
+
 2-
 \end_layout
 
@@ -2120,6 +2071,7 @@ Approximation Problem:
 status open
 
 \begin_layout Plain Layout
+
 4-
 \end_layout
 
@@ -2149,6 +2101,7 @@ Problem: Construct a path from
 status open
 
 \begin_layout Plain Layout
+
 6-
 \end_layout
 
@@ -2178,6 +2131,7 @@ Problem: Construct a shortest path from
 status open
 
 \begin_layout Plain Layout
+
 8-
 \end_layout
 
@@ -2215,6 +2169,7 @@ Problem: Is the distance of
 status open
 
 \begin_layout Plain Layout
+
 10-
 \end_layout
 
@@ -2288,10 +2243,6 @@ Logspace Turing Machines
 \end_inset
 
 
-\begin_inset Separator parbreak
-\end_inset
-
-
 \end_layout
 
 \begin_deeper
@@ -2460,7 +2411,7 @@ end{pgfpicture}
 
 \end_deeper
 \begin_layout Standard
-\begin_inset Separator parbreak
+\begin_inset Separator plain
 \end_inset
 
 
@@ -2477,10 +2428,6 @@ Logspace Turing Machines Are Quite Powerful
 \end_inset
 
 
-\begin_inset Separator parbreak
-\end_inset
-
-
 \end_layout
 
 \begin_deeper
@@ -2495,10 +2442,6 @@ Deterministic logspace machines can compute
 \end_inset
 
 
-\begin_inset Separator parbreak
-\end_inset
-
-
 \end_layout
 
 \begin_deeper
@@ -2530,10 +2473,6 @@ Non-deterministic logspace machines can compute
 \end_inset
 
 
-\begin_inset Separator parbreak
-\end_inset
-
-
 \end_layout
 
 \begin_deeper
@@ -2552,7 +2491,7 @@ satisfiability with two literals per clause.
 \end_deeper
 \end_deeper
 \begin_layout Standard
-\begin_inset Separator parbreak
+\begin_inset Separator plain
 \end_inset
 
 
@@ -2563,6 +2502,7 @@ satisfiability with two literals per clause.
 status collapsed
 
 \begin_layout Plain Layout
+
 1
 \end_layout
 
@@ -2589,10 +2529,6 @@ The Complexity Class Hierarchy
 \end_inset
 
 
-\begin_inset Separator parbreak
-\end_inset
-
-
 \end_layout
 
 \begin_deeper
@@ -2981,7 +2917,7 @@ end{pgfpicture}
 
 \end_deeper
 \begin_layout Standard
-\begin_inset Separator parbreak
+\begin_inset Separator plain
 \end_inset
 
 
@@ -3014,10 +2950,6 @@ Limit the Circuit Depth
 \end_inset
 
 
-\begin_inset Separator parbreak
-\end_inset
-
-
 \end_layout
 
 \begin_deeper
@@ -3057,10 +2989,6 @@ t
 \end_inset
 
 
-\begin_inset Separator parbreak
-\end_inset
-
-
 \end_layout
 
 \begin_deeper
@@ -3083,10 +3011,6 @@ Circuit Class
 \end_inset
 
 
-\begin_inset Separator parbreak
-\end_inset
-
-
 \end_layout
 
 \begin_deeper
@@ -3103,9 +3027,6 @@ unbounded fan-in
 
 \end_deeper
 \begin_layout Examples
-\begin_inset Separator parbreak
-\end_inset
-
 
 \end_layout
 
@@ -3148,10 +3069,6 @@ Circuit Class
 \end_inset
 
 
-\begin_inset Separator parbreak
-\end_inset
-
-
 \end_layout
 
 \begin_deeper
@@ -3168,9 +3085,6 @@ bounded fan-in
 
 \end_deeper
 \begin_layout Examples
-\begin_inset Separator parbreak
-\end_inset
-
 
 \end_layout
 
@@ -3220,10 +3134,6 @@ Circuit Class
 \end_inset
 
 
-\begin_inset Separator parbreak
-\end_inset
-
-
 \end_layout
 
 \begin_deeper
@@ -3240,9 +3150,6 @@ bounded fan-in
 
 \end_deeper
 \begin_layout Examples
-\begin_inset Separator parbreak
-\end_inset
-
 
 \end_layout
 
@@ -3262,6 +3169,7 @@ bounded fan-in
 status collapsed
 
 \begin_layout Plain Layout
+
 2
 \end_layout
 
@@ -3289,10 +3197,6 @@ Are Equally Difficult
 \end_inset
 
 
-\begin_inset Separator parbreak
-\end_inset
-
-
 \end_layout
 
 \begin_deeper
@@ -3318,10 +3222,6 @@ Are Equally Difficult
 
 \begin_layout Corollary
 For directed graphs, we can solve
-\begin_inset Separator parbreak
-\end_inset
-
-
 \end_layout
 
 \begin_deeper
@@ -3364,6 +3264,7 @@ the approximation problem in logspace iff
 status collapsed
 
 \begin_layout Plain Layout
+
 3
 \end_layout
 
@@ -3387,10 +3288,6 @@ But Not Trivial
 \end_inset
 
 
-\begin_inset Separator parbreak
-\end_inset
-
-
 \end_layout
 
 \begin_deeper
@@ -3410,7 +3307,7 @@ But Not Trivial
 \end_layout
 
 \begin_layout Standard
-\begin_inset Separator parbreak
+\begin_inset Separator plain
 \end_inset
 
 
@@ -3437,6 +3334,7 @@ But Not Trivial
 status collapsed
 
 \begin_layout Plain Layout
+
 4
 \end_layout
 
@@ -3464,10 +3362,6 @@ Definition of the Tournament Reachability Problem
 \end_inset
 
 
-\begin_inset Separator parbreak
-\end_inset
-
-
 \end_layout
 
 \begin_deeper
@@ -3489,10 +3383,6 @@ contain all triples
 \end_inset
 
  such that
-\begin_inset Separator parbreak
-\end_inset
-
-
 \end_layout
 
 \begin_deeper
@@ -3526,7 +3416,7 @@ there exists a path from
 \end_deeper
 \end_deeper
 \begin_layout Standard
-\begin_inset Separator parbreak
+\begin_inset Separator plain
 \end_inset
 
 
@@ -3543,10 +3433,6 @@ The Tournament Reachability Problem is Very Easy
 \end_inset
 
 
-\begin_inset Separator parbreak
-\end_inset
-
-
 \end_layout
 
 \begin_deeper
@@ -3572,10 +3458,6 @@ Implications
 \end_inset
 
 
-\begin_inset Separator parbreak
-\end_inset
-
-
 \end_layout
 
 \begin_deeper
@@ -3613,6 +3495,7 @@ easier
 status open
 
 \begin_layout Plain Layout
+
 5
 \end_layout
 
@@ -3640,10 +3523,6 @@ the Distance Problem
 \end_inset
 
 
-\begin_inset Separator parbreak
-\end_inset
-
-
 \end_layout
 
 \begin_deeper
@@ -3665,10 +3544,6 @@ contain all tuples
 \end_inset
 
  such that 
-\begin_inset Separator parbreak
-\end_inset
-
-
 \end_layout
 
 \begin_deeper
@@ -3706,7 +3581,7 @@ the distance of
 \end_deeper
 \end_deeper
 \begin_layout Standard
-\begin_inset Separator parbreak
+\begin_inset Separator plain
 \end_inset
 
 
@@ -3723,10 +3598,6 @@ The Tournament Distance Problem is Hard
 \end_inset
 
 
-\begin_inset Separator parbreak
-\end_inset
-
-
 \end_layout
 
 \begin_deeper
@@ -3792,7 +3663,7 @@ in logarithmic space, iff
 
 \end_deeper
 \begin_layout Standard
-\begin_inset Separator parbreak
+\begin_inset Separator plain
 \end_inset
 
 
@@ -3813,10 +3684,6 @@ Proof That
 \end_inset
 
 
-\begin_inset Separator parbreak
-\end_inset
-
-
 \end_layout
 
 \begin_deeper
@@ -3847,10 +3714,6 @@ t,onlytextwidth
 \end_inset
 
 
-\begin_inset Separator parbreak
-\end_inset
-
-
 \end_layout
 
 \begin_deeper
@@ -3895,10 +3758,6 @@ Reduce
 \end_inset
 
 
-\begin_inset Separator parbreak
-\end_inset
-
-
 \end_layout
 
 \begin_deeper
@@ -3907,6 +3766,7 @@ Reduce
 status open
 
 \begin_layout Plain Layout
+
 alert@1
 \end_layout
 
@@ -3928,6 +3788,7 @@ Is input
 status open
 
 \begin_layout Plain Layout
+
 2-| alert@2-8
 \end_layout
 
@@ -3949,6 +3810,7 @@ Map
 status open
 
 \begin_layout Plain Layout
+
 9-| alert@9
 \end_layout
 
@@ -3967,7 +3829,7 @@ Query:
 
 \end_deeper
 \begin_layout Standard
-\begin_inset Separator parbreak
+\begin_inset Separator plain
 \end_inset
 
 
@@ -3988,16 +3850,13 @@ Correctness
 status open
 
 \begin_layout Plain Layout
+
 10-
 \end_layout
 
 \end_inset
 
 
-\begin_inset Separator parbreak
-\end_inset
-
-
 \end_layout
 
 \begin_deeper
@@ -4006,6 +3865,7 @@ status open
 status open
 
 \begin_layout Plain Layout
+
 10-| alert@10-11
 \end_layout
 
@@ -4039,6 +3899,7 @@ a length-3 path in
 status open
 
 \begin_layout Plain Layout
+
 12-| alert@12-13
 \end_layout
 
@@ -5130,6 +4991,7 @@ end{pgfpicture}
 status open
 
 \begin_layout Plain Layout
+
 6
 \end_layout
 
@@ -5153,10 +5015,6 @@ Approximators Compute Paths that Are Nearly As Short As a Shortest Path
 \end_inset
 
 
-\begin_inset Separator parbreak
-\end_inset
-
-
 \end_layout
 
 \begin_deeper
@@ -5174,10 +5032,6 @@ approximation scheme for
  
 \color inherit
 gets as input
-\begin_inset Separator parbreak
-\end_inset
-
-
 \end_layout
 
 \begin_deeper
@@ -5224,7 +5078,7 @@ a path from
 \end_deeper
 \end_deeper
 \begin_layout Standard
-\begin_inset Separator parbreak
+\begin_inset Separator plain
 \end_inset
 
 
@@ -5245,10 +5099,6 @@ the Tournament Shortest Path Problem
 \end_inset
 
 
-\begin_inset Separator parbreak
-\end_inset
-
-
 \end_layout
 
 \begin_deeper
@@ -5308,6 +5158,7 @@ beamergotobutton{More Details}}
 status collapsed
 
 \begin_layout Plain Layout
+
 7
 \end_layout
 
@@ -5354,10 +5205,6 @@ Just a frame with a program code listing
 
 \begin_layout FragileFrame
 This is some program code:
-\begin_inset Separator parbreak
-\end_inset
-
-
 \end_layout
 
 \begin_deeper
@@ -5437,10 +5284,6 @@ Summary
 \end_inset
 
 
-\begin_inset Separator parbreak
-\end_inset
-
-
 \end_layout
 
 \begin_deeper
@@ -5455,10 +5298,6 @@ Summary
 \end_inset
 
 
-\begin_inset Separator parbreak
-\end_inset
-
-
 \end_layout
 
 \begin_deeper
@@ -5529,7 +5368,7 @@ in tournaments is
 
 \end_deeper
 \begin_layout Standard
-\begin_inset Separator parbreak
+\begin_inset Separator plain
 \end_inset
 
 
@@ -5546,10 +5385,6 @@ Outlook
 \end_inset
 
 
-\begin_inset Separator parbreak
-\end_inset
-
-
 \end_layout
 
 \begin_deeper
@@ -5624,10 +5459,6 @@ For Further Reading
 \end_inset
 
 
-\begin_inset Separator parbreak
-\end_inset
-
-
 \end_layout
 
 \begin_deeper
@@ -5651,6 +5482,7 @@ beamertemplatebookbibitems
 \begin_inset CommandInset bibitem
 LatexCommand bibitem
 key "Moon1968"
+literal "true"
 
 \end_inset
 
@@ -5711,6 +5543,7 @@ beamertemplatearticlebibitems
 \begin_inset CommandInset bibitem
 LatexCommand bibitem
 key "NickelsenT2002"
+literal "true"
 
 \end_inset
 
@@ -5757,6 +5590,7 @@ Proc.
 \begin_inset CommandInset bibitem
 LatexCommand bibitem
 key "Tantau2004b"
+literal "true"
 
 \end_inset
 
@@ -5860,10 +5694,6 @@ Definition of Independence Number of a Graph
 \end_inset
 
 
-\begin_inset Separator parbreak
-\end_inset
-
-
 \end_layout
 
 \begin_deeper
@@ -5898,7 +5728,7 @@ Tournaments have independence number 1.
 
 \end_deeper
 \begin_layout Standard
-\begin_inset Separator parbreak
+\begin_inset Separator plain
 \end_inset
 
 
@@ -5919,10 +5749,6 @@ Graphs With Bounded Independence Number
 \end_inset
 
 
-\begin_inset Separator parbreak
-\end_inset
-
-
 \end_layout
 
 \begin_deeper
@@ -5963,7 +5789,7 @@ at most
 \end_layout
 
 \begin_layout Standard
-\begin_inset Separator parbreak
+\begin_inset Separator plain
 \end_inset
 
 
@@ -5999,7 +5825,7 @@ for approximating the shortest path in graphs with independence number at
 \end_layout
 
 \begin_layout Standard
-\begin_inset Separator parbreak
+\begin_inset Separator plain
 \end_inset
 
 
@@ -6053,6 +5879,7 @@ Finding Paths in Undirected Graphs
 status collapsed
 
 \begin_layout Plain Layout
+
 1-2
 \end_layout
 
@@ -6083,10 +5910,6 @@ Is Party Unknown.
 \end_inset
 
 
-\begin_inset Separator parbreak
-\end_inset
-
-
 \end_layout
 
 \begin_deeper
@@ -6103,10 +5926,6 @@ Is Party Unknown.
 
 \begin_layout Corollary
 For undirected graphs, we can solve
-\begin_inset Separator parbreak
-\end_inset
-
-
 \end_layout
 
 \begin_deeper
@@ -6128,6 +5947,7 @@ status open
 status open
 
 \begin_layout Plain Layout
+
 1
 \end_layout
 
@@ -6174,6 +5994,7 @@ status open
 status open
 
 \begin_layout Plain Layout
+
 1
 \end_layout
 
@@ -6242,10 +6063,6 @@ The Approximation Scheme is Optimal
 \end_inset
 
 
-\begin_inset Separator parbreak
-\end_inset
-
-
 \end_layout
 
 \begin_deeper
@@ -6267,9 +6084,6 @@ Suppose there exists an approximation scheme for
 \end_layout
 
 \begin_layout Proof
-\begin_inset Separator parbreak
-\end_inset
-
 
 \end_layout