Start of FORM8 Interpreter for a Formula cliques.frm at Thu May 02 23:18:00 2019


Scanner started

Input program:

# ( \bigwedge_{ v \in V( G ) } ( exactlyone ( x _{ v , i } : 1 \leq i \leq K ) ) ) \& ( \bigwedge_{ 1 \leq i \leq K } \bigwedge_{ \{ u , v \} \notin E( G ) ; u \ne v } \neg ( x _{ u , i } \& x _{ v , i } ) ) #

Scanned program:

1 3 10 8 128 23 24 8 129 5 29 3 15 3 8 130 57 8 128 58 8 131 29 13 44 132 31 8 131 31 8 133 5 5 5 55 3 10 44 132 31 8 131 31 8 133 29 10 59 8 134 58 8 128 27 60 25 8 129 5 7 8 134 36 8 128 29 56 3 8 130 57 8 134 58 8 131 29 55 8 130 57 8 128 58 8 131 29 5 5 1

Identifiers:v, G, x, i, K, u;

Constants:1;

Scanner ended

Parser started


Stack & Word # <•(\bigwedge_{ #i# v \in V( #i# G ) } ( exactlyone ( #i# x _{ #i# v , #i# i } : #c# 1 \leq #i# i \leq #i# K ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #


Stack & Word # <•logicpar\bigwedge_{ #i# v \in V( #i# G ) } ( exactlyone ( #i# x _{ #i# v , #i# i } : #c# 1 \leq #i# i \leq #i# K ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #


Stack & Word # <•logicpar <•\bigwedge_{#i# v \in V( #i# G ) } ( exactlyone ( #i# x _{ #i# v , #i# i } : #c# 1 \leq #i# i \leq #i# K ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #

Stack & Word # <•logicpar <•\bigwedge_{ <•#i#\in V( #i# G ) } ( exactlyone ( #i# x _{ #i# v , #i# i } : #c# 1 \leq #i# i \leq #i# K ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #


Stack & Word # <•logicpar <•\bigwedge_{ <•metavariable\in V( #i# G ) } ( exactlyone ( #i# x _{ #i# v , #i# i } : #c# 1 \leq #i# i \leq #i# K ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #



Stack & Word # <•logicpar <•\bigwedge_{ <•metavariables1\in V( #i# G ) } ( exactlyone ( #i# x _{ #i# v , #i# i } : #c# 1 \leq #i# i \leq #i# K ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #

Parsing tree

metavariables1
v



Stack & Word # <•logicpar <•\bigwedge_{ <•metavariables\in V( #i# G ) } ( exactlyone ( #i# x _{ #i# v , #i# i } : #c# 1 \leq #i# i \leq #i# K ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #


Stack & Word # <•logicpar <•\bigwedge_{ <•metavariables =•\inV( #i# G ) } ( exactlyone ( #i# x _{ #i# v , #i# i } : #c# 1 \leq #i# i \leq #i# K ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #

Stack & Word # <•logicpar <•\bigwedge_{ <•metavariables =•\in =•V(#i# G ) } ( exactlyone ( #i# x _{ #i# v , #i# i } : #c# 1 \leq #i# i \leq #i# K ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #

Stack & Word # <•logicpar <•\bigwedge_{ <•metavariables =•\in =•V( <•#i#) } ( exactlyone ( #i# x _{ #i# v , #i# i } : #c# 1 \leq #i# i \leq #i# K ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #


Stack & Word # <•logicpar <•\bigwedge_{ <•metavariables =•\in =•V( <•graphname) } ( exactlyone ( #i# x _{ #i# v , #i# i } : #c# 1 \leq #i# i \leq #i# K ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #



Stack & Word # <•logicpar <•\bigwedge_{ <•metavariables =•\in =•V( =•graphname1) } ( exactlyone ( #i# x _{ #i# v , #i# i } : #c# 1 \leq #i# i \leq #i# K ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #


Stack & Word # <•logicpar <•\bigwedge_{ <•metavariables =•\in =•V( =•graphname1 =•)} ( exactlyone ( #i# x _{ #i# v , #i# i } : #c# 1 \leq #i# i \leq #i# K ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #


Stack & Word # <•logicpar <•\bigwedge_{ <•limit} ( exactlyone ( #i# x _{ #i# v , #i# i } : #c# 1 \leq #i# i \leq #i# K ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #

Parsing tree

limit
metavariables1
v
G



Stack & Word # <•logicpar <•\bigwedge_{ =•limits} ( exactlyone ( #i# x _{ #i# v , #i# i } : #c# 1 \leq #i# i \leq #i# K ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #

Parsing tree

limits
limit
metavariables1
v
G


Stack & Word # <•logicpar <•\bigwedge_{ =•limits <•}( exactlyone ( #i# x _{ #i# v , #i# i } : #c# 1 \leq #i# i \leq #i# K ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #


Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra( exactlyone ( #i# x _{ #i# v , #i# i } : #c# 1 \leq #i# i \leq #i# K ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #


Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•(exactlyone ( #i# x _{ #i# v , #i# i } : #c# 1 \leq #i# i \leq #i# K ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #


Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicparexactlyone ( #i# x _{ #i# v , #i# i } : #c# 1 \leq #i# i \leq #i# K ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #


Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone( #i# x _{ #i# v , #i# i } : #c# 1 \leq #i# i \leq #i# K ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #

Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone <•(#i# x _{ #i# v , #i# i } : #c# 1 \leq #i# i \leq #i# K ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #


Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar#i# x _{ #i# v , #i# i } : #c# 1 \leq #i# i \leq #i# K ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #


Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar <•#i#_{ #i# v , #i# i } : #c# 1 \leq #i# i \leq #i# K ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #


Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar <•logvar_{ #i# v , #i# i } : #c# 1 \leq #i# i \leq #i# K ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #


Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar <•logvar =•_{#i# v , #i# i } : #c# 1 \leq #i# i \leq #i# K ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #

Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar <•logvar =•_{ <•#i#, #i# i } : #c# 1 \leq #i# i \leq #i# K ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #


Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar <•logvar =•_{ <•metavariable, #i# i } : #c# 1 \leq #i# i \leq #i# K ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #



Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar <•logvar =•_{ <•primary, #i# i } : #c# 1 \leq #i# i \leq #i# K ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #

Parsing tree

primary
v



Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar <•logvar =•_{ <•factor, #i# i } : #c# 1 \leq #i# i \leq #i# K ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #

Parsing tree

factor
primary
v



Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar <•logvar =•_{ <•term, #i# i } : #c# 1 \leq #i# i \leq #i# K ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #

Parsing tree

term
factor
primary
v



Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar <•logvar =•_{ <•expression1, #i# i } : #c# 1 \leq #i# i \leq #i# K ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #

Parsing tree

expression1
term
factor
primary
v



Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar <•logvar =•_{ <•expression, #i# i } : #c# 1 \leq #i# i \leq #i# K ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #



Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar <•logvar =•_{ <•index, #i# i } : #c# 1 \leq #i# i \leq #i# K ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #


Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar <•logvar =•_{ <•index <•,#i# i } : #c# 1 \leq #i# i \leq #i# K ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #


Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar <•logvar =•_{ <•index =•indexkoma#i# i } : #c# 1 \leq #i# i \leq #i# K ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #


Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar <•logvar =•_{ <•index =•indexkoma <•#i#} : #c# 1 \leq #i# i \leq #i# K ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #


Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar <•logvar =•_{ <•index =•indexkoma <•metavariable} : #c# 1 \leq #i# i \leq #i# K ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #



Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar <•logvar =•_{ <•index =•indexkoma <•primary} : #c# 1 \leq #i# i \leq #i# K ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #

Parsing tree

primary
i



Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar <•logvar =•_{ <•index =•indexkoma <•factor} : #c# 1 \leq #i# i \leq #i# K ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #

Parsing tree

factor
primary
i



Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar <•logvar =•_{ <•index =•indexkoma <•term} : #c# 1 \leq #i# i \leq #i# K ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #

Parsing tree

term
factor
primary
i



Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar <•logvar =•_{ <•index =•indexkoma <•expression1} : #c# 1 \leq #i# i \leq #i# K ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #

Parsing tree

expression1
term
factor
primary
i



Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar <•logvar =•_{ <•index =•indexkoma <•expression} : #c# 1 \leq #i# i \leq #i# K ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #



Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar <•logvar =•_{ <•index =•indexkoma <•index} : #c# 1 \leq #i# i \leq #i# K ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #



Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar <•logvar =•_{ <•index =•indexkoma =•indexes1} : #c# 1 \leq #i# i \leq #i# K ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #

Parsing tree

indexes1
expression1
term
factor
primary
i



Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar <•logvar =•_{ <•indexes1} : #c# 1 \leq #i# i \leq #i# K ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #

Parsing tree

indexes1
expression1
term
factor
primary
v
indexkomaindexes1
expression1
term
factor
primary
i



Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar <•logvar =•_{ =•indexes} : #c# 1 \leq #i# i \leq #i# K ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #


Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar <•logvar =•_{ =•indexes =•}: #c# 1 \leq #i# i \leq #i# K ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #


Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar <•literal: #c# 1 \leq #i# i \leq #i# K ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #

Parsing tree

literal
xindexes1
expression1
term
factor
primary
v
indexkomaindexes1
expression1
term
factor
primary
i



Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar <•logterm: #c# 1 \leq #i# i \leq #i# K ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #

Parsing tree

logterm
literal
xindexes1
expression1
term
factor
primary
v
indexkomaindexes1
expression1
term
factor
primary
i



Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar <•clause: #c# 1 \leq #i# i \leq #i# K ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #

Parsing tree

clause
logterm
literal
xindexes1
expression1
term
factor
primary
v
indexkomaindexes1
expression1
term
factor
primary
i



Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar <•leftpart: #c# 1 \leq #i# i \leq #i# K ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #

Parsing tree

leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
v
indexkomaindexes1
expression1
term
factor
primary
i



Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar <•formula: #c# 1 \leq #i# i \leq #i# K ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #

Parsing tree

formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
v
indexkomaindexes1
expression1
term
factor
primary
i



Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar <•bigformula: #c# 1 \leq #i# i \leq #i# K ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #

Parsing tree

bigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
v
indexkomaindexes1
expression1
term
factor
primary
i



Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar =•bigformula1: #c# 1 \leq #i# i \leq #i# K ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #


Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar =•bigformula1 =•:#c# 1 \leq #i# i \leq #i# K ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #

Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar =•bigformula1 =•: <•#c#\leq #i# i \leq #i# K ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #


Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar =•bigformula1 =•: <•primary\leq #i# i \leq #i# K ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #

Parsing tree

primary
1



Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar =•bigformula1 =•: <•factor\leq #i# i \leq #i# K ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #

Parsing tree

factor
primary
1



Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar =•bigformula1 =•: <•term\leq #i# i \leq #i# K ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #

Parsing tree

term
factor
primary
1



Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar =•bigformula1 =•: <•expression1\leq #i# i \leq #i# K ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #

Parsing tree

expression1
term
factor
primary
1



Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar =•bigformula1 =•: <•expression\leq #i# i \leq #i# K ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #



Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar =•bigformula1 =•: <•limexpression\leq #i# i \leq #i# K ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #


Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar =•bigformula1 =•: <•limexpression <•\leq#i# i \leq #i# K ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #


Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel#i# i \leq #i# K ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #

Parsing tree

lessrel


Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel <•#i#\leq #i# K ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #


Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel <•metavariable\leq #i# K ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #



Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel <•metavariables1\leq #i# K ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #

Parsing tree

metavariables1
i



Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel =•metavariables\leq #i# K ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #


Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel =•metavariables <•\leq#i# K ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #


Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel =•metavariables =•lessrel#i# K ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #

Parsing tree

lessrel


Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel =•metavariables =•lessrel <•#i#) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #


Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel =•metavariables =•lessrel <•metavariable) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #



Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel =•metavariables =•lessrel <•primary) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #

Parsing tree

primary
K



Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel =•metavariables =•lessrel <•factor) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #

Parsing tree

factor
primary
K



Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel =•metavariables =•lessrel <•term) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #

Parsing tree

term
factor
primary
K



Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel =•metavariables =•lessrel <•expression1) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #

Parsing tree

expression1
term
factor
primary
K



Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel =•metavariables =•lessrel =•expression) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #



Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar =•bigformula1 =•: <•limit) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #

Parsing tree

limit
expression1
term
factor
primary
1
lessrelmetavariables1
i
lessrelexpression1
term
factor
primary
K



Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar =•bigformula1 =•: =•limits) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #

Parsing tree

limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
i
lessrelexpression1
term
factor
primary
K


Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar =•bigformula1 =•: =•limits =•)) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #


Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•bigformula) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #

Parsing tree

bigformula
prefparbigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
v
indexkomaindexes1
expression1
term
factor
primary
i
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
i
lessrelexpression1
term
factor
primary
K



Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar =•bigformula1) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #


Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar =•bigformula1 =•)) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #


Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•literal) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #

Parsing tree

literal
logicparbigformula
prefparbigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
v
indexkomaindexes1
expression1
term
factor
primary
i
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
i
lessrelexpression1
term
factor
primary
K



Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logterm) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #

Parsing tree

logterm
literal
logicparbigformula
prefparbigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
v
indexkomaindexes1
expression1
term
factor
primary
i
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
i
lessrelexpression1
term
factor
primary
K



Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•clause) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #

Parsing tree

clause
logterm
literal
logicparbigformula
prefparbigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
v
indexkomaindexes1
expression1
term
factor
primary
i
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
i
lessrelexpression1
term
factor
primary
K



Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•leftpart) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #

Parsing tree

leftpart
clause
logterm
literal
logicparbigformula
prefparbigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
v
indexkomaindexes1
expression1
term
factor
primary
i
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
i
lessrelexpression1
term
factor
primary
K



Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•formula) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #

Parsing tree

formula
leftpart
clause
logterm
literal
logicparbigformula
prefparbigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
v
indexkomaindexes1
expression1
term
factor
primary
i
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
i
lessrelexpression1
term
factor
primary
K



Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra =•bigformula) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #

Parsing tree

bigformula
formula
leftpart
clause
logterm
literal
logicparbigformula
prefparbigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
v
indexkomaindexes1
expression1
term
factor
primary
i
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
i
lessrelexpression1
term
factor
primary
K



Stack & Word # <•logicpar <•bigformula) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #

Parsing tree

bigformula
limits
limit
metavariables1
v
G
lbrabigformula
formula
leftpart
clause
logterm
literal
logicparbigformula
prefparbigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
v
indexkomaindexes1
expression1
term
factor
primary
i
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
i
lessrelexpression1
term
factor
primary
K



Stack & Word # <•logicpar =•bigformula1) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #


Stack & Word # <•logicpar =•bigformula1 =•)\& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #


Stack & Word # <•literal\& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #

Parsing tree

literal
logicparbigformula
limits
limit
metavariables1
v
G
lbrabigformula
formula
leftpart
clause
logterm
literal
logicparbigformula
prefparbigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
v
indexkomaindexes1
expression1
term
factor
primary
i
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
i
lessrelexpression1
term
factor
primary
K



Stack & Word # <•logterm\& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #

Parsing tree

logterm
literal
logicparbigformula
limits
limit
metavariables1
v
G
lbrabigformula
formula
leftpart
clause
logterm
literal
logicparbigformula
prefparbigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
v
indexkomaindexes1
expression1
term
factor
primary
i
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
i
lessrelexpression1
term
factor
primary
K


Stack & Word # <•logterm =•\&( \bigwedge_{ #c# 1 \leq #i# i \leq #i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #

Stack & Word # <•logterm =•\& <•(\bigwedge_{ #c# 1 \leq #i# i \leq #i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #


Stack & Word # <•logterm =•\& <•logicpar\bigwedge_{ #c# 1 \leq #i# i \leq #i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #


Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{#c# 1 \leq #i# i \leq #i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #

Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ <•#c#\leq #i# i \leq #i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #


Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ <•primary\leq #i# i \leq #i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #

Parsing tree

primary
1



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ <•factor\leq #i# i \leq #i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #

Parsing tree

factor
primary
1



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ <•term\leq #i# i \leq #i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #

Parsing tree

term
factor
primary
1



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ <•expression1\leq #i# i \leq #i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #

Parsing tree

expression1
term
factor
primary
1



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ <•expression\leq #i# i \leq #i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ <•limexpression\leq #i# i \leq #i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #


Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ <•limexpression <•\leq#i# i \leq #i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #


Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ <•limexpression =•lessrel#i# i \leq #i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #

Parsing tree

lessrel


Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ <•limexpression =•lessrel <•#i#\leq #i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #


Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ <•limexpression =•lessrel <•metavariable\leq #i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ <•limexpression =•lessrel <•metavariables1\leq #i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #

Parsing tree

metavariables1
i



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ <•limexpression =•lessrel =•metavariables\leq #i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #


Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ <•limexpression =•lessrel =•metavariables <•\leq#i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #


Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ <•limexpression =•lessrel =•metavariables =•lessrel#i# K } \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #

Parsing tree

lessrel


Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ <•limexpression =•lessrel =•metavariables =•lessrel <•#i#} \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #


Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ <•limexpression =•lessrel =•metavariables =•lessrel <•metavariable} \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ <•limexpression =•lessrel =•metavariables =•lessrel <•primary} \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #

Parsing tree

primary
K



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ <•limexpression =•lessrel =•metavariables =•lessrel <•factor} \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #

Parsing tree

factor
primary
K



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ <•limexpression =•lessrel =•metavariables =•lessrel <•term} \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #

Parsing tree

term
factor
primary
K



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ <•limexpression =•lessrel =•metavariables =•lessrel <•expression1} \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #

Parsing tree

expression1
term
factor
primary
K



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ <•limexpression =•lessrel =•metavariables =•lessrel =•expression} \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ <•limit} \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #

Parsing tree

limit
expression1
term
factor
primary
1
lessrelmetavariables1
i
lessrelexpression1
term
factor
primary
K



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits} \bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #

Parsing tree

limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
i
lessrelexpression1
term
factor
primary
K


Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits <•}\bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #


Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra\bigwedge_{ \{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #


Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{\{ #i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #

Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ <•\{#i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #


Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ <•graphbra#i# u , #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #


Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ <•graphbra <•#i#, #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #


Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ <•graphbra <•metavariable, #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ <•graphbra =•node, #i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #


Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ <•graphbra =•node <•,#i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #


Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ <•graphbra =•node =•nodekoma#i# v \} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #


Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ <•graphbra =•node =•nodekoma <•#i#\} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #


Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ <•graphbra =•node =•nodekoma <•metavariable\} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ <•graphbra =•node =•nodekoma =•node\} \notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #


Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ <•graphbra =•node =•nodekoma =•node =•\}\notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #


Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ <•arc\notin E( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #


Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ <•arc =•\notinE( #i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #

Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ <•arc =•\notin =•E(#i# G ) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #

Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ <•arc =•\notin =•E( <•#i#) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #


Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ <•arc =•\notin =•E( <•graphname) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ <•arc =•\notin =•E( =•graphname1) ; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #


Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ <•arc =•\notin =•E( =•graphname1 =•); #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #


Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ <•limit; #i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #

Parsing tree

limit
graphbraunodekomavG


Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ <•limit =•;#i# u \ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #

Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ <•limit =•; <•#i#\ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #


Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ <•limit =•; <•metavariable\ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ <•limit =•; <•primary\ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #

Parsing tree

primary
u



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ <•limit =•; <•factor\ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #

Parsing tree

factor
primary
u



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ <•limit =•; <•term\ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #

Parsing tree

term
factor
primary
u



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ <•limit =•; <•expression1\ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #

Parsing tree

expression1
term
factor
primary
u



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ <•limit =•; <•expression\ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ <•limit =•; <•conexpression\ne #i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #


Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ <•limit =•; <•conexpression <•\ne#i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #


Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ <•limit =•; <•conexpression =•relation#i# v } \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #

Parsing tree

relation


Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ <•limit =•; <•conexpression =•relation <•#i#} \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #


Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ <•limit =•; <•conexpression =•relation <•metavariable} \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ <•limit =•; <•conexpression =•relation <•primary} \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #

Parsing tree

primary
v



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ <•limit =•; <•conexpression =•relation <•factor} \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #

Parsing tree

factor
primary
v



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ <•limit =•; <•conexpression =•relation <•term} \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #

Parsing tree

term
factor
primary
v



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ <•limit =•; <•conexpression =•relation <•expression1} \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #

Parsing tree

expression1
term
factor
primary
v



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ <•limit =•; <•conexpression =•relation =•expression} \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ <•limit =•; <•constraint} \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #

Parsing tree

constraint
expression1
term
factor
primary
u
relationexpression1
term
factor
primary
v



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ <•limit =•; <•constraints} \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #

Parsing tree

constraints
constraint
expression1
term
factor
primary
u
relationexpression1
term
factor
primary
v



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ <•limit =•; =•constraints1} \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ =•limits} \neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #

Parsing tree

limits
limit
graphbraunodekomavG
constraints
constraint
expression1
term
factor
primary
u
relationexpression1
term
factor
primary
v


Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ =•limits <•}\neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #


Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ =•limits =•lbra\neg ( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #


Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ =•limits =•lbra <•\neg( #i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #

Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ =•limits =•lbra <•\neg <•(#i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #


Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ =•limits =•lbra <•\neg <•logicpar#i# x _{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #


Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ =•limits =•lbra <•\neg <•logicpar <•#i#_{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #


Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ =•limits =•lbra <•\neg <•logicpar <•logvar_{ #i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #


Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ =•limits =•lbra <•\neg <•logicpar <•logvar =•_{#i# u , #i# i } \& #i# x _{ #i# v , #i# i } ) ) #

Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ =•limits =•lbra <•\neg <•logicpar <•logvar =•_{ <•#i#, #i# i } \& #i# x _{ #i# v , #i# i } ) ) #


Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ =•limits =•lbra <•\neg <•logicpar <•logvar =•_{ <•metavariable, #i# i } \& #i# x _{ #i# v , #i# i } ) ) #



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ =•limits =•lbra <•\neg <•logicpar <•logvar =•_{ <•primary, #i# i } \& #i# x _{ #i# v , #i# i } ) ) #

Parsing tree

primary
u



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ =•limits =•lbra <•\neg <•logicpar <•logvar =•_{ <•factor, #i# i } \& #i# x _{ #i# v , #i# i } ) ) #

Parsing tree

factor
primary
u



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ =•limits =•lbra <•\neg <•logicpar <•logvar =•_{ <•term, #i# i } \& #i# x _{ #i# v , #i# i } ) ) #

Parsing tree

term
factor
primary
u



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ =•limits =•lbra <•\neg <•logicpar <•logvar =•_{ <•expression1, #i# i } \& #i# x _{ #i# v , #i# i } ) ) #

Parsing tree

expression1
term
factor
primary
u



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ =•limits =•lbra <•\neg <•logicpar <•logvar =•_{ <•expression, #i# i } \& #i# x _{ #i# v , #i# i } ) ) #



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ =•limits =•lbra <•\neg <•logicpar <•logvar =•_{ <•index, #i# i } \& #i# x _{ #i# v , #i# i } ) ) #


Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ =•limits =•lbra <•\neg <•logicpar <•logvar =•_{ <•index <•,#i# i } \& #i# x _{ #i# v , #i# i } ) ) #


Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ =•limits =•lbra <•\neg <•logicpar <•logvar =•_{ <•index =•indexkoma#i# i } \& #i# x _{ #i# v , #i# i } ) ) #


Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ =•limits =•lbra <•\neg <•logicpar <•logvar =•_{ <•index =•indexkoma <•#i#} \& #i# x _{ #i# v , #i# i } ) ) #


Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ =•limits =•lbra <•\neg <•logicpar <•logvar =•_{ <•index =•indexkoma <•metavariable} \& #i# x _{ #i# v , #i# i } ) ) #



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ =•limits =•lbra <•\neg <•logicpar <•logvar =•_{ <•index =•indexkoma <•primary} \& #i# x _{ #i# v , #i# i } ) ) #

Parsing tree

primary
i



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ =•limits =•lbra <•\neg <•logicpar <•logvar =•_{ <•index =•indexkoma <•factor} \& #i# x _{ #i# v , #i# i } ) ) #

Parsing tree

factor
primary
i



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ =•limits =•lbra <•\neg <•logicpar <•logvar =•_{ <•index =•indexkoma <•term} \& #i# x _{ #i# v , #i# i } ) ) #

Parsing tree

term
factor
primary
i



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ =•limits =•lbra <•\neg <•logicpar <•logvar =•_{ <•index =•indexkoma <•expression1} \& #i# x _{ #i# v , #i# i } ) ) #

Parsing tree

expression1
term
factor
primary
i



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ =•limits =•lbra <•\neg <•logicpar <•logvar =•_{ <•index =•indexkoma <•expression} \& #i# x _{ #i# v , #i# i } ) ) #



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ =•limits =•lbra <•\neg <•logicpar <•logvar =•_{ <•index =•indexkoma <•index} \& #i# x _{ #i# v , #i# i } ) ) #



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ =•limits =•lbra <•\neg <•logicpar <•logvar =•_{ <•index =•indexkoma =•indexes1} \& #i# x _{ #i# v , #i# i } ) ) #

Parsing tree

indexes1
expression1
term
factor
primary
i



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ =•limits =•lbra <•\neg <•logicpar <•logvar =•_{ <•indexes1} \& #i# x _{ #i# v , #i# i } ) ) #

Parsing tree

indexes1
expression1
term
factor
primary
u
indexkomaindexes1
expression1
term
factor
primary
i



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ =•limits =•lbra <•\neg <•logicpar <•logvar =•_{ =•indexes} \& #i# x _{ #i# v , #i# i } ) ) #


Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ =•limits =•lbra <•\neg <•logicpar <•logvar =•_{ =•indexes =•}\& #i# x _{ #i# v , #i# i } ) ) #


Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ =•limits =•lbra <•\neg <•logicpar <•literal\& #i# x _{ #i# v , #i# i } ) ) #

Parsing tree

literal
xindexes1
expression1
term
factor
primary
u
indexkomaindexes1
expression1
term
factor
primary
i



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ =•limits =•lbra <•\neg <•logicpar <•logterm\& #i# x _{ #i# v , #i# i } ) ) #

Parsing tree

logterm
literal
xindexes1
expression1
term
factor
primary
u
indexkomaindexes1
expression1
term
factor
primary
i


Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ =•limits =•lbra <•\neg <•logicpar <•logterm =•\&#i# x _{ #i# v , #i# i } ) ) #

Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ =•limits =•lbra <•\neg <•logicpar <•logterm =•\& <•#i#_{ #i# v , #i# i } ) ) #


Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ =•limits =•lbra <•\neg <•logicpar <•logterm =•\& <•logvar_{ #i# v , #i# i } ) ) #


Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ =•limits =•lbra <•\neg <•logicpar <•logterm =•\& <•logvar =•_{#i# v , #i# i } ) ) #

Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ =•limits =•lbra <•\neg <•logicpar <•logterm =•\& <•logvar =•_{ <•#i#, #i# i } ) ) #


Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ =•limits =•lbra <•\neg <•logicpar <•logterm =•\& <•logvar =•_{ <•metavariable, #i# i } ) ) #



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ =•limits =•lbra <•\neg <•logicpar <•logterm =•\& <•logvar =•_{ <•primary, #i# i } ) ) #

Parsing tree

primary
v



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ =•limits =•lbra <•\neg <•logicpar <•logterm =•\& <•logvar =•_{ <•factor, #i# i } ) ) #

Parsing tree

factor
primary
v



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ =•limits =•lbra <•\neg <•logicpar <•logterm =•\& <•logvar =•_{ <•term, #i# i } ) ) #

Parsing tree

term
factor
primary
v



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ =•limits =•lbra <•\neg <•logicpar <•logterm =•\& <•logvar =•_{ <•expression1, #i# i } ) ) #

Parsing tree

expression1
term
factor
primary
v



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ =•limits =•lbra <•\neg <•logicpar <•logterm =•\& <•logvar =•_{ <•expression, #i# i } ) ) #



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ =•limits =•lbra <•\neg <•logicpar <•logterm =•\& <•logvar =•_{ <•index, #i# i } ) ) #


Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ =•limits =•lbra <•\neg <•logicpar <•logterm =•\& <•logvar =•_{ <•index <•,#i# i } ) ) #


Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ =•limits =•lbra <•\neg <•logicpar <•logterm =•\& <•logvar =•_{ <•index =•indexkoma#i# i } ) ) #


Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ =•limits =•lbra <•\neg <•logicpar <•logterm =•\& <•logvar =•_{ <•index =•indexkoma <•#i#} ) ) #


Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ =•limits =•lbra <•\neg <•logicpar <•logterm =•\& <•logvar =•_{ <•index =•indexkoma <•metavariable} ) ) #



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ =•limits =•lbra <•\neg <•logicpar <•logterm =•\& <•logvar =•_{ <•index =•indexkoma <•primary} ) ) #

Parsing tree

primary
i



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ =•limits =•lbra <•\neg <•logicpar <•logterm =•\& <•logvar =•_{ <•index =•indexkoma <•factor} ) ) #

Parsing tree

factor
primary
i



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ =•limits =•lbra <•\neg <•logicpar <•logterm =•\& <•logvar =•_{ <•index =•indexkoma <•term} ) ) #

Parsing tree

term
factor
primary
i



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ =•limits =•lbra <•\neg <•logicpar <•logterm =•\& <•logvar =•_{ <•index =•indexkoma <•expression1} ) ) #

Parsing tree

expression1
term
factor
primary
i



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ =•limits =•lbra <•\neg <•logicpar <•logterm =•\& <•logvar =•_{ <•index =•indexkoma <•expression} ) ) #



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ =•limits =•lbra <•\neg <•logicpar <•logterm =•\& <•logvar =•_{ <•index =•indexkoma <•index} ) ) #



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ =•limits =•lbra <•\neg <•logicpar <•logterm =•\& <•logvar =•_{ <•index =•indexkoma =•indexes1} ) ) #

Parsing tree

indexes1
expression1
term
factor
primary
i



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ =•limits =•lbra <•\neg <•logicpar <•logterm =•\& <•logvar =•_{ <•indexes1} ) ) #

Parsing tree

indexes1
expression1
term
factor
primary
v
indexkomaindexes1
expression1
term
factor
primary
i



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ =•limits =•lbra <•\neg <•logicpar <•logterm =•\& <•logvar =•_{ =•indexes} ) ) #


Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ =•limits =•lbra <•\neg <•logicpar <•logterm =•\& <•logvar =•_{ =•indexes =•}) ) #


Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ =•limits =•lbra <•\neg <•logicpar <•logterm =•\& <•literal) ) #

Parsing tree

literal
xindexes1
expression1
term
factor
primary
v
indexkomaindexes1
expression1
term
factor
primary
i



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ =•limits =•lbra <•\neg <•logicpar <•logterm =•\& <•logterm) ) #

Parsing tree

logterm
literal
xindexes1
expression1
term
factor
primary
v
indexkomaindexes1
expression1
term
factor
primary
i



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ =•limits =•lbra <•\neg <•logicpar <•logterm =•\& =•clause) ) #

Parsing tree

clause
logterm
literal
xindexes1
expression1
term
factor
primary
v
indexkomaindexes1
expression1
term
factor
primary
i



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ =•limits =•lbra <•\neg <•logicpar <•clause) ) #

Parsing tree

clause
logterm
literal
xindexes1
expression1
term
factor
primary
u
indexkomaindexes1
expression1
term
factor
primary
i
clause
logterm
literal
xindexes1
expression1
term
factor
primary
v
indexkomaindexes1
expression1
term
factor
primary
i



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ =•limits =•lbra <•\neg <•logicpar <•leftpart) ) #

Parsing tree

leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
u
indexkomaindexes1
expression1
term
factor
primary
i
clause
logterm
literal
xindexes1
expression1
term
factor
primary
v
indexkomaindexes1
expression1
term
factor
primary
i



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ =•limits =•lbra <•\neg <•logicpar <•formula) ) #

Parsing tree

formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
u
indexkomaindexes1
expression1
term
factor
primary
i
clause
logterm
literal
xindexes1
expression1
term
factor
primary
v
indexkomaindexes1
expression1
term
factor
primary
i



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ =•limits =•lbra <•\neg <•logicpar <•bigformula) ) #

Parsing tree

bigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
u
indexkomaindexes1
expression1
term
factor
primary
i
clause
logterm
literal
xindexes1
expression1
term
factor
primary
v
indexkomaindexes1
expression1
term
factor
primary
i



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ =•limits =•lbra <•\neg <•logicpar =•bigformula1) ) #


Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ =•limits =•lbra <•\neg <•logicpar =•bigformula1 =•)) #


Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ =•limits =•lbra <•\neg =•literal) #

Parsing tree

literal
logicparbigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
u
indexkomaindexes1
expression1
term
factor
primary
i
clause
logterm
literal
xindexes1
expression1
term
factor
primary
v
indexkomaindexes1
expression1
term
factor
primary
i



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ =•limits =•lbra <•logterm) #

Parsing tree

logterm
literal
logicparbigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
u
indexkomaindexes1
expression1
term
factor
primary
i
clause
logterm
literal
xindexes1
expression1
term
factor
primary
v
indexkomaindexes1
expression1
term
factor
primary
i



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ =•limits =•lbra <•clause) #

Parsing tree

clause
logterm
literal
logicparbigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
u
indexkomaindexes1
expression1
term
factor
primary
i
clause
logterm
literal
xindexes1
expression1
term
factor
primary
v
indexkomaindexes1
expression1
term
factor
primary
i



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ =•limits =•lbra <•leftpart) #

Parsing tree

leftpart
clause
logterm
literal
logicparbigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
u
indexkomaindexes1
expression1
term
factor
primary
i
clause
logterm
literal
xindexes1
expression1
term
factor
primary
v
indexkomaindexes1
expression1
term
factor
primary
i



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ =•limits =•lbra <•formula) #

Parsing tree

formula
leftpart
clause
logterm
literal
logicparbigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
u
indexkomaindexes1
expression1
term
factor
primary
i
clause
logterm
literal
xindexes1
expression1
term
factor
primary
v
indexkomaindexes1
expression1
term
factor
primary
i



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•\bigwedge_{ =•limits =•lbra =•bigformula) #

Parsing tree

bigformula
formula
leftpart
clause
logterm
literal
logicparbigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
u
indexkomaindexes1
expression1
term
factor
primary
i
clause
logterm
literal
xindexes1
expression1
term
factor
primary
v
indexkomaindexes1
expression1
term
factor
primary
i



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra =•bigformula) #

Parsing tree

bigformula
limits
limit
graphbraunodekomavG
constraints
constraint
expression1
term
factor
primary
u
relationexpression1
term
factor
primary
v
lbrabigformula
formula
leftpart
clause
logterm
literal
logicparbigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
u
indexkomaindexes1
expression1
term
factor
primary
i
clause
logterm
literal
xindexes1
expression1
term
factor
primary
v
indexkomaindexes1
expression1
term
factor
primary
i



Stack & Word # <•logterm =•\& <•logicpar <•bigformula) #

Parsing tree

bigformula
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
i
lessrelexpression1
term
factor
primary
K
lbrabigformula
limits
limit
graphbraunodekomavG
constraints
constraint
expression1
term
factor
primary
u
relationexpression1
term
factor
primary
v
lbrabigformula
formula
leftpart
clause
logterm
literal
logicparbigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
u
indexkomaindexes1
expression1
term
factor
primary
i
clause
logterm
literal
xindexes1
expression1
term
factor
primary
v
indexkomaindexes1
expression1
term
factor
primary
i



Stack & Word # <•logterm =•\& <•logicpar =•bigformula1) #


Stack & Word # <•logterm =•\& <•logicpar =•bigformula1 =•)#


Stack & Word # <•logterm =•\& <•literal#

Parsing tree

literal
logicparbigformula
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
i
lessrelexpression1
term
factor
primary
K
lbrabigformula
limits
limit
graphbraunodekomavG
constraints
constraint
expression1
term
factor
primary
u
relationexpression1
term
factor
primary
v
lbrabigformula
formula
leftpart
clause
logterm
literal
logicparbigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
u
indexkomaindexes1
expression1
term
factor
primary
i
clause
logterm
literal
xindexes1
expression1
term
factor
primary
v
indexkomaindexes1
expression1
term
factor
primary
i



Stack & Word # <•logterm =•\& <•logterm#

Parsing tree

logterm
literal
logicparbigformula
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
i
lessrelexpression1
term
factor
primary
K
lbrabigformula
limits
limit
graphbraunodekomavG
constraints
constraint
expression1
term
factor
primary
u
relationexpression1
term
factor
primary
v
lbrabigformula
formula
leftpart
clause
logterm
literal
logicparbigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
u
indexkomaindexes1
expression1
term
factor
primary
i
clause
logterm
literal
xindexes1
expression1
term
factor
primary
v
indexkomaindexes1
expression1
term
factor
primary
i



Stack & Word # <•logterm =•\& =•clause#

Parsing tree

clause
logterm
literal
logicparbigformula
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
i
lessrelexpression1
term
factor
primary
K
lbrabigformula
limits
limit
graphbraunodekomavG
constraints
constraint
expression1
term
factor
primary
u
relationexpression1
term
factor
primary
v
lbrabigformula
formula
leftpart
clause
logterm
literal
logicparbigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
u
indexkomaindexes1
expression1
term
factor
primary
i
clause
logterm
literal
xindexes1
expression1
term
factor
primary
v
indexkomaindexes1
expression1
term
factor
primary
i



Stack & Word # <•clause#

Parsing tree

clause
logterm
literal
logicparbigformula
limits
limit
metavariables1
v
G
lbrabigformula
formula
leftpart
clause
logterm
literal
logicparbigformula
prefparbigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
v
indexkomaindexes1
expression1
term
factor
primary
i
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
i
lessrelexpression1
term
factor
primary
K
clause
logterm
literal
logicparbigformula
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
i
lessrelexpression1
term
factor
primary
K
lbrabigformula
limits
limit
graphbraunodekomavG
constraints
constraint
expression1
term
factor
primary
u
relationexpression1
term
factor
primary
v
lbrabigformula
formula
leftpart
clause
logterm
literal
logicparbigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
u
indexkomaindexes1
expression1
term
factor
primary
i
clause
logterm
literal
xindexes1
expression1
term
factor
primary
v
indexkomaindexes1
expression1
term
factor
primary
i



Stack & Word # <•leftpart#

Parsing tree

leftpart
clause
logterm
literal
logicparbigformula
limits
limit
metavariables1
v
G
lbrabigformula
formula
leftpart
clause
logterm
literal
logicparbigformula
prefparbigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
v
indexkomaindexes1
expression1
term
factor
primary
i
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
i
lessrelexpression1
term
factor
primary
K
clause
logterm
literal
logicparbigformula
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
i
lessrelexpression1
term
factor
primary
K
lbrabigformula
limits
limit
graphbraunodekomavG
constraints
constraint
expression1
term
factor
primary
u
relationexpression1
term
factor
primary
v
lbrabigformula
formula
leftpart
clause
logterm
literal
logicparbigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
u
indexkomaindexes1
expression1
term
factor
primary
i
clause
logterm
literal
xindexes1
expression1
term
factor
primary
v
indexkomaindexes1
expression1
term
factor
primary
i



Stack & Word # <•formula#

Parsing tree

formula
leftpart
clause
logterm
literal
logicparbigformula
limits
limit
metavariables1
v
G
lbrabigformula
formula
leftpart
clause
logterm
literal
logicparbigformula
prefparbigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
v
indexkomaindexes1
expression1
term
factor
primary
i
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
i
lessrelexpression1
term
factor
primary
K
clause
logterm
literal
logicparbigformula
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
i
lessrelexpression1
term
factor
primary
K
lbrabigformula
limits
limit
graphbraunodekomavG
constraints
constraint
expression1
term
factor
primary
u
relationexpression1
term
factor
primary
v
lbrabigformula
formula
leftpart
clause
logterm
literal
logicparbigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
u
indexkomaindexes1
expression1
term
factor
primary
i
clause
logterm
literal
xindexes1
expression1
term
factor
primary
v
indexkomaindexes1
expression1
term
factor
primary
i



Stack & Word # <•bigformula#

Parsing tree

bigformula
formula
leftpart
clause
logterm
literal
logicparbigformula
limits
limit
metavariables1
v
G
lbrabigformula
formula
leftpart
clause
logterm
literal
logicparbigformula
prefparbigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
v
indexkomaindexes1
expression1
term
factor
primary
i
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
i
lessrelexpression1
term
factor
primary
K
clause
logterm
literal
logicparbigformula
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
i
lessrelexpression1
term
factor
primary
K
lbrabigformula
limits
limit
graphbraunodekomavG
constraints
constraint
expression1
term
factor
primary
u
relationexpression1
term
factor
primary
v
lbrabigformula
formula
leftpart
clause
logterm
literal
logicparbigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
u
indexkomaindexes1
expression1
term
factor
primary
i
clause
logterm
literal
xindexes1
expression1
term
factor
primary
v
indexkomaindexes1
expression1
term
factor
primary
i



Stack & Word # <•metaformula#

Parsing tree

metaformula
bigformula
formula
leftpart
clause
logterm
literal
logicparbigformula
limits
limit
metavariables1
v
G
lbrabigformula
formula
leftpart
clause
logterm
literal
logicparbigformula
prefparbigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
v
indexkomaindexes1
expression1
term
factor
primary
i
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
i
lessrelexpression1
term
factor
primary
K
clause
logterm
literal
logicparbigformula
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
i
lessrelexpression1
term
factor
primary
K
lbrabigformula
limits
limit
graphbraunodekomavG
constraints
constraint
expression1
term
factor
primary
u
relationexpression1
term
factor
primary
v
lbrabigformula
formula
leftpart
clause
logterm
literal
logicparbigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
u
indexkomaindexes1
expression1
term
factor
primary
i
clause
logterm
literal
xindexes1
expression1
term
factor
primary
v
indexkomaindexes1
expression1
term
factor
primary
i



Stack & Word # =•family#

the parsing is completed

Parsing tree

family
metaformula
bigformula
formula
leftpart
clause
logterm
literal
logicparbigformula
limits
limit
metavariables1
v
G
lbrabigformula
formula
leftpart
clause
logterm
literal
logicparbigformula
prefparbigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
v
indexkomaindexes1
expression1
term
factor
primary
i
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
i
lessrelexpression1
term
factor
primary
K
clause
logterm
literal
logicparbigformula
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
i
lessrelexpression1
term
factor
primary
K
lbrabigformula
limits
limit
graphbraunodekomavG
constraints
constraint
expression1
term
factor
primary
u
relationexpression1
term
factor
primary
v
lbrabigformula
formula
leftpart
clause
logterm
literal
logicparbigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
u
indexkomaindexes1
expression1
term
factor
primary
i
clause
logterm
literal
xindexes1
expression1
term
factor
primary
v
indexkomaindexes1
expression1
term
factor
primary
i

Table of constants

c1=1

Table of identifiers

i1=vi2=Gi3=xi4=ii5=Ki6=u

Parser ended

Interpreter ended at Thu May 02 23:18:00 2019