Start of FORM8 Interpreter for a Formula queens.frm at Sun Apr 21 10:25:01 2019


Scanner started

Input program:

# ( \bigwedge_{ 1 \leq i \leq n } ( exactlyone ( x _{ i , j } : 1 \leq j \leq n ) ) ) \& ( \bigwedge_{ 1 \leq k \leq n } ( atmostone ( x _{ i , i - k + 1 } : k \leq i \leq n ) ) ) \& ( \bigwedge_{ 1 \leq k \leq n } ( atmostone ( x _{ i , k + i - 1 } : 1 \leq i \leq n - k + 1 ) ) ) \& ( \bigwedge_{ 1 \leq k \leq n } ( atmostone ( x _{ i , n - k - i + 2 } : 1 \leq i \leq n - k + 1 ) ) ) \& ( \bigwedge_{ 1 \leq k \leq n } ( atmostone ( x _{ i , n - i + k } : k \leq i \leq n ) ) ) \& ( \bigwedge_{ 1 \leq i \leq n } ( exactlyone ( x _{ j , i } : 1 \leq j \leq n ) ) ) #

Scanned program:

1 3 10 44 128 31 8 129 31 8 130 29 3 15 3 8 131 57 8 129 58 8 132 29 13 44 128 31 8 132 31 8 130 5 5 5 55 3 10 44 128 31 8 133 31 8 130 29 3 16 3 8 131 57 8 129 58 8 129 40 8 133 39 44 128 29 13 8 133 31 8 129 31 8 130 5 5 5 55 3 10 44 128 31 8 133 31 8 130 29 3 16 3 8 131 57 8 129 58 8 133 39 8 129 40 44 128 29 13 44 128 31 8 129 31 8 130 40 8 133 39 44 128 5 5 5 55 3 10 44 128 31 8 133 31 8 130 29 3 16 3 8 131 57 8 129 58 8 130 40 8 133 40 8 129 39 44 134 29 13 44 128 31 8 129 31 8 130 40 8 133 39 44 128 5 5 5 55 3 10 44 128 31 8 133 31 8 130 29 3 16 3 8 131 57 8 129 58 8 130 40 8 129 39 8 133 29 13 8 133 31 8 129 31 8 130 5 5 5 55 3 10 44 128 31 8 129 31 8 130 29 3 15 3 8 131 57 8 132 58 8 129 29 13 44 128 31 8 132 31 8 130 5 5 5 1

Identifiers:i, n, x, j, k;

Constants:1, 2;

Scanner ended

Parser started


Stack & Word # <•(\bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# i , #i# j } : #c# 1 \leq #i# j \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logicpar\bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# i , #i# j } : #c# 1 \leq #i# j \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logicpar <•\bigwedge_{#c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# i , #i# j } : #c# 1 \leq #i# j \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Stack & Word # <•logicpar <•\bigwedge_{ <•#c#\leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# i , #i# j } : #c# 1 \leq #i# j \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logicpar <•\bigwedge_{ <•primary\leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# i , #i# j } : #c# 1 \leq #i# j \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

primary
1



Stack & Word # <•logicpar <•\bigwedge_{ <•factor\leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# i , #i# j } : #c# 1 \leq #i# j \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

factor
primary
1



Stack & Word # <•logicpar <•\bigwedge_{ <•term\leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# i , #i# j } : #c# 1 \leq #i# j \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

term
factor
primary
1



Stack & Word # <•logicpar <•\bigwedge_{ <•expression1\leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# i , #i# j } : #c# 1 \leq #i# j \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

expression1
term
factor
primary
1



Stack & Word # <•logicpar <•\bigwedge_{ <•expression\leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# i , #i# j } : #c# 1 \leq #i# j \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #



Stack & Word # <•logicpar <•\bigwedge_{ <•limexpression\leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# i , #i# j } : #c# 1 \leq #i# j \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logicpar <•\bigwedge_{ <•limexpression <•\leq#i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# i , #i# j } : #c# 1 \leq #i# j \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logicpar <•\bigwedge_{ <•limexpression =•lessrel#i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# i , #i# j } : #c# 1 \leq #i# j \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

lessrel


Stack & Word # <•logicpar <•\bigwedge_{ <•limexpression =•lessrel <•#i#\leq #i# n } ( exactlyone ( #i# x _{ #i# i , #i# j } : #c# 1 \leq #i# j \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logicpar <•\bigwedge_{ <•limexpression =•lessrel <•metavariable\leq #i# n } ( exactlyone ( #i# x _{ #i# i , #i# j } : #c# 1 \leq #i# j \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #



Stack & Word # <•logicpar <•\bigwedge_{ <•limexpression =•lessrel <•metavariables1\leq #i# n } ( exactlyone ( #i# x _{ #i# i , #i# j } : #c# 1 \leq #i# j \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

metavariables1
i



Stack & Word # <•logicpar <•\bigwedge_{ <•limexpression =•lessrel =•metavariables\leq #i# n } ( exactlyone ( #i# x _{ #i# i , #i# j } : #c# 1 \leq #i# j \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logicpar <•\bigwedge_{ <•limexpression =•lessrel =•metavariables <•\leq#i# n } ( exactlyone ( #i# x _{ #i# i , #i# j } : #c# 1 \leq #i# j \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logicpar <•\bigwedge_{ <•limexpression =•lessrel =•metavariables =•lessrel#i# n } ( exactlyone ( #i# x _{ #i# i , #i# j } : #c# 1 \leq #i# j \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

lessrel


Stack & Word # <•logicpar <•\bigwedge_{ <•limexpression =•lessrel =•metavariables =•lessrel <•#i#} ( exactlyone ( #i# x _{ #i# i , #i# j } : #c# 1 \leq #i# j \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logicpar <•\bigwedge_{ <•limexpression =•lessrel =•metavariables =•lessrel <•metavariable} ( exactlyone ( #i# x _{ #i# i , #i# j } : #c# 1 \leq #i# j \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #



Stack & Word # <•logicpar <•\bigwedge_{ <•limexpression =•lessrel =•metavariables =•lessrel <•primary} ( exactlyone ( #i# x _{ #i# i , #i# j } : #c# 1 \leq #i# j \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

primary
n



Stack & Word # <•logicpar <•\bigwedge_{ <•limexpression =•lessrel =•metavariables =•lessrel <•factor} ( exactlyone ( #i# x _{ #i# i , #i# j } : #c# 1 \leq #i# j \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

factor
primary
n



Stack & Word # <•logicpar <•\bigwedge_{ <•limexpression =•lessrel =•metavariables =•lessrel <•term} ( exactlyone ( #i# x _{ #i# i , #i# j } : #c# 1 \leq #i# j \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

term
factor
primary
n



Stack & Word # <•logicpar <•\bigwedge_{ <•limexpression =•lessrel =•metavariables =•lessrel <•expression1} ( exactlyone ( #i# x _{ #i# i , #i# j } : #c# 1 \leq #i# j \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

expression1
term
factor
primary
n



Stack & Word # <•logicpar <•\bigwedge_{ <•limexpression =•lessrel =•metavariables =•lessrel =•expression} ( exactlyone ( #i# x _{ #i# i , #i# j } : #c# 1 \leq #i# j \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #



Stack & Word # <•logicpar <•\bigwedge_{ <•limit} ( exactlyone ( #i# x _{ #i# i , #i# j } : #c# 1 \leq #i# j \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

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



Stack & Word # <•logicpar <•\bigwedge_{ =•limits} ( exactlyone ( #i# x _{ #i# i , #i# j } : #c# 1 \leq #i# j \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

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


Stack & Word # <•logicpar <•\bigwedge_{ =•limits <•}( exactlyone ( #i# x _{ #i# i , #i# j } : #c# 1 \leq #i# j \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra( exactlyone ( #i# x _{ #i# i , #i# j } : #c# 1 \leq #i# j \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•(exactlyone ( #i# x _{ #i# i , #i# j } : #c# 1 \leq #i# j \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicparexactlyone ( #i# x _{ #i# i , #i# j } : #c# 1 \leq #i# j \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone( #i# x _{ #i# i , #i# j } : #c# 1 \leq #i# j \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone <•(#i# x _{ #i# i , #i# j } : #c# 1 \leq #i# j \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar#i# x _{ #i# i , #i# j } : #c# 1 \leq #i# j \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar <•#i#_{ #i# i , #i# j } : #c# 1 \leq #i# j \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar <•logvar_{ #i# i , #i# j } : #c# 1 \leq #i# j \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar <•logvar =•_{#i# i , #i# j } : #c# 1 \leq #i# j \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar <•logvar =•_{ <•#i#, #i# j } : #c# 1 \leq #i# j \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar <•logvar =•_{ <•metavariable, #i# j } : #c# 1 \leq #i# j \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #



Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar <•logvar =•_{ <•primary, #i# j } : #c# 1 \leq #i# j \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

primary
i



Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar <•logvar =•_{ <•factor, #i# j } : #c# 1 \leq #i# j \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

factor
primary
i



Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar <•logvar =•_{ <•term, #i# j } : #c# 1 \leq #i# j \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

term
factor
primary
i



Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar <•logvar =•_{ <•expression1, #i# j } : #c# 1 \leq #i# j \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

expression1
term
factor
primary
i



Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar <•logvar =•_{ <•expression, #i# j } : #c# 1 \leq #i# j \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #



Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar <•logvar =•_{ <•index, #i# j } : #c# 1 \leq #i# j \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar <•logvar =•_{ <•index <•,#i# j } : #c# 1 \leq #i# j \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar <•logvar =•_{ <•index =•indexkoma#i# j } : #c# 1 \leq #i# j \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar <•logvar =•_{ <•index =•indexkoma <•#i#} : #c# 1 \leq #i# j \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar <•logvar =•_{ <•index =•indexkoma <•metavariable} : #c# 1 \leq #i# j \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #



Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar <•logvar =•_{ <•index =•indexkoma <•primary} : #c# 1 \leq #i# j \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

primary
j



Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar <•logvar =•_{ <•index =•indexkoma <•factor} : #c# 1 \leq #i# j \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

factor
primary
j



Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar <•logvar =•_{ <•index =•indexkoma <•term} : #c# 1 \leq #i# j \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

term
factor
primary
j



Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar <•logvar =•_{ <•index =•indexkoma <•expression1} : #c# 1 \leq #i# j \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

expression1
term
factor
primary
j



Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar <•logvar =•_{ <•index =•indexkoma <•expression} : #c# 1 \leq #i# j \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #



Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar <•logvar =•_{ <•index =•indexkoma <•index} : #c# 1 \leq #i# j \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #



Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar <•logvar =•_{ <•index =•indexkoma =•indexes1} : #c# 1 \leq #i# j \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

indexes1
expression1
term
factor
primary
j



Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar <•logvar =•_{ <•indexes1} : #c# 1 \leq #i# j \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

indexes1
expression1
term
factor
primary
i
indexkomaindexes1
expression1
term
factor
primary
j



Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar <•logvar =•_{ =•indexes} : #c# 1 \leq #i# j \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar <•logvar =•_{ =•indexes =•}: #c# 1 \leq #i# j \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar <•literal: #c# 1 \leq #i# j \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

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



Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar <•logterm: #c# 1 \leq #i# j \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

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



Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar <•clause: #c# 1 \leq #i# j \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

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



Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar <•leftpart: #c# 1 \leq #i# j \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

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



Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar <•formula: #c# 1 \leq #i# j \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

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



Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar <•bigformula: #c# 1 \leq #i# j \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

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



Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar =•bigformula1: #c# 1 \leq #i# j \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar =•bigformula1 =•:#c# 1 \leq #i# j \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar =•bigformula1 =•: <•#c#\leq #i# j \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar =•bigformula1 =•: <•primary\leq #i# j \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

primary
1



Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar =•bigformula1 =•: <•factor\leq #i# j \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

factor
primary
1



Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar =•bigformula1 =•: <•term\leq #i# j \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

term
factor
primary
1



Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar =•bigformula1 =•: <•expression1\leq #i# j \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

expression1
term
factor
primary
1



Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar =•bigformula1 =•: <•expression\leq #i# j \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #



Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar =•bigformula1 =•: <•limexpression\leq #i# j \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar =•bigformula1 =•: <•limexpression <•\leq#i# j \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel#i# j \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

lessrel


Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel <•#i#\leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel <•metavariable\leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #



Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel <•metavariables1\leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

metavariables1
j



Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel =•metavariables\leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel =•metavariables <•\leq#i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel =•metavariables =•lessrel#i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

lessrel


Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel =•metavariables =•lessrel <•#i#) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel =•metavariables =•lessrel <•metavariable) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #



Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel =•metavariables =•lessrel <•primary) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

primary
n



Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel =•metavariables =•lessrel <•factor) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

factor
primary
n



Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel =•metavariables =•lessrel <•term) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

term
factor
primary
n



Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel =•metavariables =•lessrel <•expression1) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

expression1
term
factor
primary
n



Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel =•metavariables =•lessrel =•expression) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #



Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar =•bigformula1 =•: <•limit) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

limit
expression1
term
factor
primary
1
lessrelmetavariables1
j
lessrelexpression1
term
factor
primary
n



Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar =•bigformula1 =•: =•limits) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
j
lessrelexpression1
term
factor
primary
n


Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar =•bigformula1 =•: =•limits =•)) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•bigformula) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

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



Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar =•bigformula1) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar =•bigformula1 =•)) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•literal) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

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



Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•logterm) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

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



Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•clause) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

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



Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•leftpart) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

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



Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra <•formula) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

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



Stack & Word # <•logicpar <•\bigwedge_{ =•limits =•lbra =•bigformula) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

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



Stack & Word # <•logicpar <•bigformula) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

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



Stack & Word # <•logicpar =•bigformula1) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logicpar =•bigformula1 =•)\& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•literal\& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

literal
logicparbigformula
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
i
lessrelexpression1
term
factor
primary
n
lbrabigformula
formula
leftpart
clause
logterm
literal
logicparbigformula
prefparbigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
i
indexkomaindexes1
expression1
term
factor
primary
j
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
j
lessrelexpression1
term
factor
primary
n



Stack & Word # <•logterm\& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

logterm
literal
logicparbigformula
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
i
lessrelexpression1
term
factor
primary
n
lbrabigformula
formula
leftpart
clause
logterm
literal
logicparbigformula
prefparbigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
i
indexkomaindexes1
expression1
term
factor
primary
j
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
j
lessrelexpression1
term
factor
primary
n


Stack & Word # <•logterm =•\&( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Stack & Word # <•logterm =•\& <•(\bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logicpar\bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{#c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ <•#c#\leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ <•primary\leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

primary
1



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ <•factor\leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

factor
primary
1



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ <•term\leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

term
factor
primary
1



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ <•expression1\leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

expression1
term
factor
primary
1



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ <•expression\leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ <•limexpression\leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ <•limexpression <•\leq#i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ <•limexpression =•lessrel#i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

lessrel


Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ <•limexpression =•lessrel <•#i#\leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ <•limexpression =•lessrel <•metavariable\leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ <•limexpression =•lessrel <•metavariables1\leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

metavariables1
k



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ <•limexpression =•lessrel =•metavariables\leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ <•limexpression =•lessrel =•metavariables <•\leq#i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ <•limexpression =•lessrel =•metavariables =•lessrel#i# n } ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

lessrel


Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ <•limexpression =•lessrel =•metavariables =•lessrel <•#i#} ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ <•limexpression =•lessrel =•metavariables =•lessrel <•metavariable} ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ <•limexpression =•lessrel =•metavariables =•lessrel <•primary} ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

primary
n



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ <•limexpression =•lessrel =•metavariables =•lessrel <•factor} ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

factor
primary
n



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ <•limexpression =•lessrel =•metavariables =•lessrel <•term} ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

term
factor
primary
n



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ <•limexpression =•lessrel =•metavariables =•lessrel <•expression1} ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

expression1
term
factor
primary
n



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ <•limexpression =•lessrel =•metavariables =•lessrel =•expression} ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ <•limit} ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

limit
expression1
term
factor
primary
1
lessrelmetavariables1
k
lessrelexpression1
term
factor
primary
n



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits} ( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
k
lessrelexpression1
term
factor
primary
n


Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits <•}( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra( atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•(atmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicparatmostone ( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone( #i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone <•(#i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar#i# x _{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•#i#_{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar_{ #i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{#i# i , #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•#i#, #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•metavariable, #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•primary, #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

primary
i



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•factor, #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

factor
primary
i



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•term, #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

term
factor
primary
i



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•expression1, #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

expression1
term
factor
primary
i



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•expression, #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•index, #i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•index <•,#i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•index =•indexkoma#i# i - #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•index =•indexkoma <•#i#- #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•index =•indexkoma <•metavariable- #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•index =•indexkoma <•primary- #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

primary
i



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•index =•indexkoma <•factor- #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

factor
primary
i



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•index =•indexkoma <•term- #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

term
factor
primary
i



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•index =•indexkoma <•expression1- #i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

expression1
term
factor
primary
i


Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•index =•indexkoma <•expression1 =•-#i# k + #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•index =•indexkoma <•expression1 =•- <•#i#+ #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•index =•indexkoma <•expression1 =•- <•metavariable+ #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•index =•indexkoma <•expression1 =•- <•primary+ #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

primary
k



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•index =•indexkoma <•expression1 =•- <•factor+ #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

factor
primary
k



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•index =•indexkoma <•expression1 =•- =•term+ #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

term
factor
primary
k



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•index =•indexkoma <•expression1+ #c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

expression1
expression1
term
factor
primary
i
term
factor
primary
k


Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•index =•indexkoma <•expression1 =•+#c# 1 } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•index =•indexkoma <•expression1 =•+ <•#c#} : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•index =•indexkoma <•expression1 =•+ <•primary} : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

primary
1



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•index =•indexkoma <•expression1 =•+ <•factor} : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

factor
primary
1



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•index =•indexkoma <•expression1 =•+ =•term} : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

term
factor
primary
1



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•index =•indexkoma <•expression1} : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

expression1
expression1
expression1
term
factor
primary
i
term
factor
primary
k
term
factor
primary
1



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•index =•indexkoma <•expression} : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•index =•indexkoma <•index} : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•index =•indexkoma =•indexes1} : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

indexes1
expression1
expression1
expression1
term
factor
primary
i
term
factor
primary
k
term
factor
primary
1



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•indexes1} : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

indexes1
expression1
term
factor
primary
i
indexkomaindexes1
expression1
expression1
expression1
term
factor
primary
i
term
factor
primary
k
term
factor
primary
1



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ =•indexes} : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ =•indexes =•}: #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•literal: #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

literal
xindexes1
expression1
term
factor
primary
i
indexkomaindexes1
expression1
expression1
expression1
term
factor
primary
i
term
factor
primary
k
term
factor
primary
1



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logterm: #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

logterm
literal
xindexes1
expression1
term
factor
primary
i
indexkomaindexes1
expression1
expression1
expression1
term
factor
primary
i
term
factor
primary
k
term
factor
primary
1



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•clause: #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

clause
logterm
literal
xindexes1
expression1
term
factor
primary
i
indexkomaindexes1
expression1
expression1
expression1
term
factor
primary
i
term
factor
primary
k
term
factor
primary
1



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•leftpart: #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
i
indexkomaindexes1
expression1
expression1
expression1
term
factor
primary
i
term
factor
primary
k
term
factor
primary
1



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•formula: #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

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



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•bigformula: #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

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



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1: #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•:#i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•#i#\leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•metavariable\leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•primary\leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

primary
k



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•factor\leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

factor
primary
k



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•term\leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

term
factor
primary
k



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•expression1\leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

expression1
term
factor
primary
k



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•expression\leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•limexpression\leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•limexpression <•\leq#i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel#i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

lessrel


Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel <•#i#\leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel <•metavariable\leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel <•metavariables1\leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

metavariables1
i



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel =•metavariables\leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel =•metavariables <•\leq#i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel =•metavariables =•lessrel#i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

lessrel


Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel =•metavariables =•lessrel <•#i#) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel =•metavariables =•lessrel <•metavariable) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel =•metavariables =•lessrel <•primary) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

primary
n



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel =•metavariables =•lessrel <•factor) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

factor
primary
n



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel =•metavariables =•lessrel <•term) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

term
factor
primary
n



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel =•metavariables =•lessrel <•expression1) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

expression1
term
factor
primary
n



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel =•metavariables =•lessrel =•expression) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•limit) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

limit
expression1
term
factor
primary
k
lessrelmetavariables1
i
lessrelexpression1
term
factor
primary
n



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: =•limits) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

limits
limit
expression1
term
factor
primary
k
lessrelmetavariables1
i
lessrelexpression1
term
factor
primary
n


Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: =•limits =•)) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•bigformula) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

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



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar =•bigformula1) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar =•bigformula1 =•)) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•literal) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

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



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logterm) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

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



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•clause) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

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



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•leftpart) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

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



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•formula) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

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



Stack & Word # <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra =•bigformula) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

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



Stack & Word # <•logterm =•\& <•logicpar <•bigformula) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

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



Stack & Word # <•logterm =•\& <•logicpar =•bigformula1) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logicpar =•bigformula1 =•)\& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•literal\& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

literal
logicparbigformula
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
k
lessrelexpression1
term
factor
primary
n
lbrabigformula
formula
leftpart
clause
logterm
literal
logicparbigformula
prefparbigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
i
indexkomaindexes1
expression1
expression1
expression1
term
factor
primary
i
term
factor
primary
k
term
factor
primary
1
limits
limit
expression1
term
factor
primary
k
lessrelmetavariables1
i
lessrelexpression1
term
factor
primary
n



Stack & Word # <•logterm =•\& <•logterm\& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

logterm
literal
logicparbigformula
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
k
lessrelexpression1
term
factor
primary
n
lbrabigformula
formula
leftpart
clause
logterm
literal
logicparbigformula
prefparbigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
i
indexkomaindexes1
expression1
expression1
expression1
term
factor
primary
i
term
factor
primary
k
term
factor
primary
1
limits
limit
expression1
term
factor
primary
k
lessrelmetavariables1
i
lessrelexpression1
term
factor
primary
n


Stack & Word # <•logterm =•\& <•logterm =•\&( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Stack & Word # <•logterm =•\& <•logterm =•\& <•(\bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar\bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{#c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ <•#c#\leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ <•primary\leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

primary
1



Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ <•factor\leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

factor
primary
1



Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ <•term\leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

term
factor
primary
1



Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ <•expression1\leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

expression1
term
factor
primary
1



Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ <•expression\leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #



Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ <•limexpression\leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ <•limexpression <•\leq#i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ <•limexpression =•lessrel#i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

lessrel


Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ <•limexpression =•lessrel <•#i#\leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ <•limexpression =•lessrel <•metavariable\leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #



Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ <•limexpression =•lessrel <•metavariables1\leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

metavariables1
k



Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ <•limexpression =•lessrel =•metavariables\leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ <•limexpression =•lessrel =•metavariables <•\leq#i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ <•limexpression =•lessrel =•metavariables =•lessrel#i# n } ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

lessrel


Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ <•limexpression =•lessrel =•metavariables =•lessrel <•#i#} ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ <•limexpression =•lessrel =•metavariables =•lessrel <•metavariable} ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #



Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ <•limexpression =•lessrel =•metavariables =•lessrel <•primary} ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

primary
n



Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ <•limexpression =•lessrel =•metavariables =•lessrel <•factor} ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

factor
primary
n



Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ <•limexpression =•lessrel =•metavariables =•lessrel <•term} ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

term
factor
primary
n



Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ <•limexpression =•lessrel =•metavariables =•lessrel <•expression1} ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

expression1
term
factor
primary
n



Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ <•limexpression =•lessrel =•metavariables =•lessrel =•expression} ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #



Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ <•limit} ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

limit
expression1
term
factor
primary
1
lessrelmetavariables1
k
lessrelexpression1
term
factor
primary
n



Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits} ( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
k
lessrelexpression1
term
factor
primary
n


Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits <•}( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra( atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•(atmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicparatmostone ( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone( #i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone <•(#i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar#i# x _{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•#i#_{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar_{ #i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{#i# i , #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•#i#, #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•metavariable, #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #



Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•primary, #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

primary
i



Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•factor, #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

factor
primary
i



Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•term, #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

term
factor
primary
i



Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•expression1, #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

expression1
term
factor
primary
i



Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•expression, #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #



Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•index, #i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•index <•,#i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•index =•indexkoma#i# k + #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•index =•indexkoma <•#i#+ #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•index =•indexkoma <•metavariable+ #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #



Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•index =•indexkoma <•primary+ #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

primary
k



Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•index =•indexkoma <•factor+ #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

factor
primary
k



Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•index =•indexkoma <•term+ #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

term
factor
primary
k



Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•index =•indexkoma <•expression1+ #i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

expression1
term
factor
primary
k


Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•index =•indexkoma <•expression1 =•+#i# i - #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•index =•indexkoma <•expression1 =•+ <•#i#- #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•index =•indexkoma <•expression1 =•+ <•metavariable- #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #



Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•index =•indexkoma <•expression1 =•+ <•primary- #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

primary
i



Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•index =•indexkoma <•expression1 =•+ <•factor- #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

factor
primary
i



Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•index =•indexkoma <•expression1 =•+ =•term- #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

term
factor
primary
i



Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•index =•indexkoma <•expression1- #c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

expression1
expression1
term
factor
primary
k
term
factor
primary
i


Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•index =•indexkoma <•expression1 =•-#c# 1 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•index =•indexkoma <•expression1 =•- <•#c#} : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•index =•indexkoma <•expression1 =•- <•primary} : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

primary
1



Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•index =•indexkoma <•expression1 =•- <•factor} : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

factor
primary
1



Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•index =•indexkoma <•expression1 =•- =•term} : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

term
factor
primary
1



Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•index =•indexkoma <•expression1} : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

expression1
expression1
expression1
term
factor
primary
k
term
factor
primary
i
term
factor
primary
1



Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•index =•indexkoma <•expression} : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #



Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•index =•indexkoma <•index} : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #



Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•index =•indexkoma =•indexes1} : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

indexes1
expression1
expression1
expression1
term
factor
primary
k
term
factor
primary
i
term
factor
primary
1



Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•indexes1} : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

indexes1
expression1
term
factor
primary
i
indexkomaindexes1
expression1
expression1
expression1
term
factor
primary
k
term
factor
primary
i
term
factor
primary
1



Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ =•indexes} : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ =•indexes =•}: #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•literal: #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

literal
xindexes1
expression1
term
factor
primary
i
indexkomaindexes1
expression1
expression1
expression1
term
factor
primary
k
term
factor
primary
i
term
factor
primary
1



Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logterm: #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

logterm
literal
xindexes1
expression1
term
factor
primary
i
indexkomaindexes1
expression1
expression1
expression1
term
factor
primary
k
term
factor
primary
i
term
factor
primary
1



Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•clause: #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

clause
logterm
literal
xindexes1
expression1
term
factor
primary
i
indexkomaindexes1
expression1
expression1
expression1
term
factor
primary
k
term
factor
primary
i
term
factor
primary
1



Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•leftpart: #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
i
indexkomaindexes1
expression1
expression1
expression1
term
factor
primary
k
term
factor
primary
i
term
factor
primary
1



Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•formula: #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

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



Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•bigformula: #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

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



Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1: #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•:#c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•#c#\leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•primary\leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

primary
1



Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•factor\leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

factor
primary
1



Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•term\leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

term
factor
primary
1



Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•expression1\leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

expression1
term
factor
primary
1



Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•expression\leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #



Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•limexpression\leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•limexpression <•\leq#i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel#i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

lessrel


Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel <•#i#\leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel <•metavariable\leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #



Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel <•metavariables1\leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

metavariables1
i



Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel =•metavariables\leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel =•metavariables <•\leq#i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel =•metavariables =•lessrel#i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

lessrel


Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel =•metavariables =•lessrel <•#i#- #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel =•metavariables =•lessrel <•metavariable- #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #



Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel =•metavariables =•lessrel <•primary- #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

primary
n



Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel =•metavariables =•lessrel <•factor- #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

factor
primary
n



Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel =•metavariables =•lessrel <•term- #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

term
factor
primary
n



Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel =•metavariables =•lessrel <•expression1- #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

expression1
term
factor
primary
n


Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel =•metavariables =•lessrel <•expression1 =•-#i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel =•metavariables =•lessrel <•expression1 =•- <•#i#+ #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel =•metavariables =•lessrel <•expression1 =•- <•metavariable+ #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #



Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel =•metavariables =•lessrel <•expression1 =•- <•primary+ #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

primary
k



Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel =•metavariables =•lessrel <•expression1 =•- <•factor+ #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

factor
primary
k



Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel =•metavariables =•lessrel <•expression1 =•- =•term+ #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

term
factor
primary
k



Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel =•metavariables =•lessrel <•expression1+ #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

expression1
expression1
term
factor
primary
n
term
factor
primary
k


Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel =•metavariables =•lessrel <•expression1 =•+#c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel =•metavariables =•lessrel <•expression1 =•+ <•#c#) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel =•metavariables =•lessrel <•expression1 =•+ <•primary) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

primary
1



Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel =•metavariables =•lessrel <•expression1 =•+ <•factor) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

factor
primary
1



Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel =•metavariables =•lessrel <•expression1 =•+ =•term) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

term
factor
primary
1



Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel =•metavariables =•lessrel <•expression1) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

expression1
expression1
expression1
term
factor
primary
n
term
factor
primary
k
term
factor
primary
1



Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel =•metavariables =•lessrel =•expression) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #



Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•limit) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

limit
expression1
term
factor
primary
1
lessrelmetavariables1
i
lessrelexpression1
expression1
expression1
term
factor
primary
n
term
factor
primary
k
term
factor
primary
1



Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: =•limits) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
i
lessrelexpression1
expression1
expression1
term
factor
primary
n
term
factor
primary
k
term
factor
primary
1


Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: =•limits =•)) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•bigformula) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

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



Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar =•bigformula1) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar =•bigformula1 =•)) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•literal) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

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



Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logterm) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

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



Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•clause) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

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



Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•leftpart) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

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



Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•formula) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

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



Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra =•bigformula) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

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



Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar <•bigformula) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

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



Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar =•bigformula1) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logicpar =•bigformula1 =•)\& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•literal\& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

literal
logicparbigformula
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
k
lessrelexpression1
term
factor
primary
n
lbrabigformula
formula
leftpart
clause
logterm
literal
logicparbigformula
prefparbigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
i
indexkomaindexes1
expression1
expression1
expression1
term
factor
primary
k
term
factor
primary
i
term
factor
primary
1
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
i
lessrelexpression1
expression1
expression1
term
factor
primary
n
term
factor
primary
k
term
factor
primary
1



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm\& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

logterm
literal
logicparbigformula
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
k
lessrelexpression1
term
factor
primary
n
lbrabigformula
formula
leftpart
clause
logterm
literal
logicparbigformula
prefparbigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
i
indexkomaindexes1
expression1
expression1
expression1
term
factor
primary
k
term
factor
primary
i
term
factor
primary
1
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
i
lessrelexpression1
expression1
expression1
term
factor
primary
n
term
factor
primary
k
term
factor
primary
1


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\&( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•(\bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar\bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{#c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ <•#c#\leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ <•primary\leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

primary
1



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ <•factor\leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

factor
primary
1



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ <•term\leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

term
factor
primary
1



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ <•expression1\leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

expression1
term
factor
primary
1



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ <•expression\leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ <•limexpression\leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ <•limexpression <•\leq#i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ <•limexpression =•lessrel#i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

lessrel


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ <•limexpression =•lessrel <•#i#\leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ <•limexpression =•lessrel <•metavariable\leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ <•limexpression =•lessrel <•metavariables1\leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

metavariables1
k



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ <•limexpression =•lessrel =•metavariables\leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ <•limexpression =•lessrel =•metavariables <•\leq#i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ <•limexpression =•lessrel =•metavariables =•lessrel#i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

lessrel


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ <•limexpression =•lessrel =•metavariables =•lessrel <•#i#} ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ <•limexpression =•lessrel =•metavariables =•lessrel <•metavariable} ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ <•limexpression =•lessrel =•metavariables =•lessrel <•primary} ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

primary
n



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ <•limexpression =•lessrel =•metavariables =•lessrel <•factor} ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

factor
primary
n



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ <•limexpression =•lessrel =•metavariables =•lessrel <•term} ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

term
factor
primary
n



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ <•limexpression =•lessrel =•metavariables =•lessrel <•expression1} ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

expression1
term
factor
primary
n



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ <•limexpression =•lessrel =•metavariables =•lessrel =•expression} ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ <•limit} ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

limit
expression1
term
factor
primary
1
lessrelmetavariables1
k
lessrelexpression1
term
factor
primary
n



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits} ( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
k
lessrelexpression1
term
factor
primary
n


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits <•}( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra( atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•(atmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicparatmostone ( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone( #i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone <•(#i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar#i# x _{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•#i#_{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar_{ #i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{#i# i , #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•#i#, #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•metavariable, #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•primary, #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

primary
i



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•factor, #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

factor
primary
i



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•term, #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

term
factor
primary
i



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•expression1, #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

expression1
term
factor
primary
i



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•expression, #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•index, #i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•index <•,#i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•index =•indexkoma#i# n - #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•index =•indexkoma <•#i#- #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•index =•indexkoma <•metavariable- #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•index =•indexkoma <•primary- #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

primary
n



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•index =•indexkoma <•factor- #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

factor
primary
n



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•index =•indexkoma <•term- #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

term
factor
primary
n



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•index =•indexkoma <•expression1- #i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

expression1
term
factor
primary
n


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•index =•indexkoma <•expression1 =•-#i# k - #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•index =•indexkoma <•expression1 =•- <•#i#- #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•index =•indexkoma <•expression1 =•- <•metavariable- #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•index =•indexkoma <•expression1 =•- <•primary- #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

primary
k



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•index =•indexkoma <•expression1 =•- <•factor- #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

factor
primary
k



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•index =•indexkoma <•expression1 =•- =•term- #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

term
factor
primary
k



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•index =•indexkoma <•expression1- #i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

expression1
expression1
term
factor
primary
n
term
factor
primary
k


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•index =•indexkoma <•expression1 =•-#i# i + #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•index =•indexkoma <•expression1 =•- <•#i#+ #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•index =•indexkoma <•expression1 =•- <•metavariable+ #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•index =•indexkoma <•expression1 =•- <•primary+ #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

primary
i



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•index =•indexkoma <•expression1 =•- <•factor+ #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

factor
primary
i



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•index =•indexkoma <•expression1 =•- =•term+ #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

term
factor
primary
i



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•index =•indexkoma <•expression1+ #c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

expression1
expression1
expression1
term
factor
primary
n
term
factor
primary
k
term
factor
primary
i


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•index =•indexkoma <•expression1 =•+#c# 2 } : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•index =•indexkoma <•expression1 =•+ <•#c#} : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•index =•indexkoma <•expression1 =•+ <•primary} : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

primary
2



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•index =•indexkoma <•expression1 =•+ <•factor} : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

factor
primary
2



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•index =•indexkoma <•expression1 =•+ =•term} : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

term
factor
primary
2



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•index =•indexkoma <•expression1} : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

expression1
expression1
expression1
expression1
term
factor
primary
n
term
factor
primary
k
term
factor
primary
i
term
factor
primary
2



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•index =•indexkoma <•expression} : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•index =•indexkoma <•index} : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•index =•indexkoma =•indexes1} : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

indexes1
expression1
expression1
expression1
expression1
term
factor
primary
n
term
factor
primary
k
term
factor
primary
i
term
factor
primary
2



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•indexes1} : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

indexes1
expression1
term
factor
primary
i
indexkomaindexes1
expression1
expression1
expression1
expression1
term
factor
primary
n
term
factor
primary
k
term
factor
primary
i
term
factor
primary
2



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ =•indexes} : #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ =•indexes =•}: #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•literal: #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

literal
xindexes1
expression1
term
factor
primary
i
indexkomaindexes1
expression1
expression1
expression1
expression1
term
factor
primary
n
term
factor
primary
k
term
factor
primary
i
term
factor
primary
2



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logterm: #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

logterm
literal
xindexes1
expression1
term
factor
primary
i
indexkomaindexes1
expression1
expression1
expression1
expression1
term
factor
primary
n
term
factor
primary
k
term
factor
primary
i
term
factor
primary
2



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•clause: #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

clause
logterm
literal
xindexes1
expression1
term
factor
primary
i
indexkomaindexes1
expression1
expression1
expression1
expression1
term
factor
primary
n
term
factor
primary
k
term
factor
primary
i
term
factor
primary
2



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•leftpart: #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
i
indexkomaindexes1
expression1
expression1
expression1
expression1
term
factor
primary
n
term
factor
primary
k
term
factor
primary
i
term
factor
primary
2



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•formula: #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
i
indexkomaindexes1
expression1
expression1
expression1
expression1
term
factor
primary
n
term
factor
primary
k
term
factor
primary
i
term
factor
primary
2



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•bigformula: #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

bigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
i
indexkomaindexes1
expression1
expression1
expression1
expression1
term
factor
primary
n
term
factor
primary
k
term
factor
primary
i
term
factor
primary
2



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1: #c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•:#c# 1 \leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•#c#\leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•primary\leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

primary
1



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•factor\leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

factor
primary
1



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•term\leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

term
factor
primary
1



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•expression1\leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

expression1
term
factor
primary
1



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•expression\leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•limexpression\leq #i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•limexpression <•\leq#i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel#i# i \leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

lessrel


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel <•#i#\leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel <•metavariable\leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel <•metavariables1\leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

metavariables1
i



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel =•metavariables\leq #i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel =•metavariables <•\leq#i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel =•metavariables =•lessrel#i# n - #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

lessrel


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel =•metavariables =•lessrel <•#i#- #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel =•metavariables =•lessrel <•metavariable- #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel =•metavariables =•lessrel <•primary- #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

primary
n



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel =•metavariables =•lessrel <•factor- #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

factor
primary
n



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel =•metavariables =•lessrel <•term- #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

term
factor
primary
n



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel =•metavariables =•lessrel <•expression1- #i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

expression1
term
factor
primary
n


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel =•metavariables =•lessrel <•expression1 =•-#i# k + #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel =•metavariables =•lessrel <•expression1 =•- <•#i#+ #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel =•metavariables =•lessrel <•expression1 =•- <•metavariable+ #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel =•metavariables =•lessrel <•expression1 =•- <•primary+ #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

primary
k



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel =•metavariables =•lessrel <•expression1 =•- <•factor+ #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

factor
primary
k



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel =•metavariables =•lessrel <•expression1 =•- =•term+ #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

term
factor
primary
k



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel =•metavariables =•lessrel <•expression1+ #c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

expression1
expression1
term
factor
primary
n
term
factor
primary
k


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel =•metavariables =•lessrel <•expression1 =•+#c# 1 ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel =•metavariables =•lessrel <•expression1 =•+ <•#c#) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel =•metavariables =•lessrel <•expression1 =•+ <•primary) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

primary
1



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel =•metavariables =•lessrel <•expression1 =•+ <•factor) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

factor
primary
1



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel =•metavariables =•lessrel <•expression1 =•+ =•term) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

term
factor
primary
1



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel =•metavariables =•lessrel <•expression1) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

expression1
expression1
expression1
term
factor
primary
n
term
factor
primary
k
term
factor
primary
1



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel =•metavariables =•lessrel =•expression) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•limit) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

limit
expression1
term
factor
primary
1
lessrelmetavariables1
i
lessrelexpression1
expression1
expression1
term
factor
primary
n
term
factor
primary
k
term
factor
primary
1



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: =•limits) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
i
lessrelexpression1
expression1
expression1
term
factor
primary
n
term
factor
primary
k
term
factor
primary
1


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: =•limits =•)) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•bigformula) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

bigformula
prefparbigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
i
indexkomaindexes1
expression1
expression1
expression1
expression1
term
factor
primary
n
term
factor
primary
k
term
factor
primary
i
term
factor
primary
2
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
i
lessrelexpression1
expression1
expression1
term
factor
primary
n
term
factor
primary
k
term
factor
primary
1



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar =•bigformula1) ) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar =•bigformula1 =•)) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•literal) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

literal
logicparbigformula
prefparbigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
i
indexkomaindexes1
expression1
expression1
expression1
expression1
term
factor
primary
n
term
factor
primary
k
term
factor
primary
i
term
factor
primary
2
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
i
lessrelexpression1
expression1
expression1
term
factor
primary
n
term
factor
primary
k
term
factor
primary
1



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logterm) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

logterm
literal
logicparbigformula
prefparbigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
i
indexkomaindexes1
expression1
expression1
expression1
expression1
term
factor
primary
n
term
factor
primary
k
term
factor
primary
i
term
factor
primary
2
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
i
lessrelexpression1
expression1
expression1
term
factor
primary
n
term
factor
primary
k
term
factor
primary
1



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•clause) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

clause
logterm
literal
logicparbigformula
prefparbigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
i
indexkomaindexes1
expression1
expression1
expression1
expression1
term
factor
primary
n
term
factor
primary
k
term
factor
primary
i
term
factor
primary
2
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
i
lessrelexpression1
expression1
expression1
term
factor
primary
n
term
factor
primary
k
term
factor
primary
1



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•leftpart) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

leftpart
clause
logterm
literal
logicparbigformula
prefparbigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
i
indexkomaindexes1
expression1
expression1
expression1
expression1
term
factor
primary
n
term
factor
primary
k
term
factor
primary
i
term
factor
primary
2
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
i
lessrelexpression1
expression1
expression1
term
factor
primary
n
term
factor
primary
k
term
factor
primary
1



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•formula) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

formula
leftpart
clause
logterm
literal
logicparbigformula
prefparbigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
i
indexkomaindexes1
expression1
expression1
expression1
expression1
term
factor
primary
n
term
factor
primary
k
term
factor
primary
i
term
factor
primary
2
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
i
lessrelexpression1
expression1
expression1
term
factor
primary
n
term
factor
primary
k
term
factor
primary
1



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra =•bigformula) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

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



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•bigformula) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

bigformula
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
k
lessrelexpression1
term
factor
primary
n
lbrabigformula
formula
leftpart
clause
logterm
literal
logicparbigformula
prefparbigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
i
indexkomaindexes1
expression1
expression1
expression1
expression1
term
factor
primary
n
term
factor
primary
k
term
factor
primary
i
term
factor
primary
2
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
i
lessrelexpression1
expression1
expression1
term
factor
primary
n
term
factor
primary
k
term
factor
primary
1



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar =•bigformula1) \& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar =•bigformula1 =•)\& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•literal\& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

literal
logicparbigformula
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
k
lessrelexpression1
term
factor
primary
n
lbrabigformula
formula
leftpart
clause
logterm
literal
logicparbigformula
prefparbigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
i
indexkomaindexes1
expression1
expression1
expression1
expression1
term
factor
primary
n
term
factor
primary
k
term
factor
primary
i
term
factor
primary
2
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
i
lessrelexpression1
expression1
expression1
term
factor
primary
n
term
factor
primary
k
term
factor
primary
1



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm\& ( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

logterm
literal
logicparbigformula
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
k
lessrelexpression1
term
factor
primary
n
lbrabigformula
formula
leftpart
clause
logterm
literal
logicparbigformula
prefparbigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
i
indexkomaindexes1
expression1
expression1
expression1
expression1
term
factor
primary
n
term
factor
primary
k
term
factor
primary
i
term
factor
primary
2
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
i
lessrelexpression1
expression1
expression1
term
factor
primary
n
term
factor
primary
k
term
factor
primary
1


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\&( \bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•(\bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar\bigwedge_{ #c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{#c# 1 \leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ <•#c#\leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ <•primary\leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

primary
1



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ <•factor\leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

factor
primary
1



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ <•term\leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

term
factor
primary
1



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ <•expression1\leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

expression1
term
factor
primary
1



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ <•expression\leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ <•limexpression\leq #i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ <•limexpression <•\leq#i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ <•limexpression =•lessrel#i# k \leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

lessrel


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ <•limexpression =•lessrel <•#i#\leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ <•limexpression =•lessrel <•metavariable\leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ <•limexpression =•lessrel <•metavariables1\leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

metavariables1
k



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ <•limexpression =•lessrel =•metavariables\leq #i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ <•limexpression =•lessrel =•metavariables <•\leq#i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ <•limexpression =•lessrel =•metavariables =•lessrel#i# n } ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

lessrel


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ <•limexpression =•lessrel =•metavariables =•lessrel <•#i#} ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ <•limexpression =•lessrel =•metavariables =•lessrel <•metavariable} ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ <•limexpression =•lessrel =•metavariables =•lessrel <•primary} ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

primary
n



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ <•limexpression =•lessrel =•metavariables =•lessrel <•factor} ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

factor
primary
n



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ <•limexpression =•lessrel =•metavariables =•lessrel <•term} ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

term
factor
primary
n



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ <•limexpression =•lessrel =•metavariables =•lessrel <•expression1} ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

expression1
term
factor
primary
n



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ <•limexpression =•lessrel =•metavariables =•lessrel =•expression} ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ <•limit} ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

limit
expression1
term
factor
primary
1
lessrelmetavariables1
k
lessrelexpression1
term
factor
primary
n



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits} ( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
k
lessrelexpression1
term
factor
primary
n


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits <•}( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra( atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•(atmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicparatmostone ( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone( #i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone <•(#i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar#i# x _{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•#i#_{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar_{ #i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{#i# i , #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•#i#, #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•metavariable, #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•primary, #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

primary
i



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•factor, #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

factor
primary
i



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•term, #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

term
factor
primary
i



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•expression1, #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

expression1
term
factor
primary
i



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•expression, #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•index, #i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•index <•,#i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•index =•indexkoma#i# n - #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•index =•indexkoma <•#i#- #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•index =•indexkoma <•metavariable- #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•index =•indexkoma <•primary- #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

primary
n



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•index =•indexkoma <•factor- #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

factor
primary
n



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•index =•indexkoma <•term- #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

term
factor
primary
n



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•index =•indexkoma <•expression1- #i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

expression1
term
factor
primary
n


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•index =•indexkoma <•expression1 =•-#i# i + #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•index =•indexkoma <•expression1 =•- <•#i#+ #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•index =•indexkoma <•expression1 =•- <•metavariable+ #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•index =•indexkoma <•expression1 =•- <•primary+ #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

primary
i



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•index =•indexkoma <•expression1 =•- <•factor+ #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

factor
primary
i



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•index =•indexkoma <•expression1 =•- =•term+ #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

term
factor
primary
i



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•index =•indexkoma <•expression1+ #i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

expression1
expression1
term
factor
primary
n
term
factor
primary
i


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•index =•indexkoma <•expression1 =•+#i# k } : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•index =•indexkoma <•expression1 =•+ <•#i#} : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•index =•indexkoma <•expression1 =•+ <•metavariable} : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•index =•indexkoma <•expression1 =•+ <•primary} : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

primary
k



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•index =•indexkoma <•expression1 =•+ <•factor} : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

factor
primary
k



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•index =•indexkoma <•expression1 =•+ =•term} : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

term
factor
primary
k



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•index =•indexkoma <•expression1} : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

expression1
expression1
expression1
term
factor
primary
n
term
factor
primary
i
term
factor
primary
k



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•index =•indexkoma <•expression} : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•index =•indexkoma <•index} : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•index =•indexkoma =•indexes1} : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

indexes1
expression1
expression1
expression1
term
factor
primary
n
term
factor
primary
i
term
factor
primary
k



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ <•indexes1} : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

indexes1
expression1
term
factor
primary
i
indexkomaindexes1
expression1
expression1
expression1
term
factor
primary
n
term
factor
primary
i
term
factor
primary
k



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ =•indexes} : #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logvar =•_{ =•indexes =•}: #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•literal: #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

literal
xindexes1
expression1
term
factor
primary
i
indexkomaindexes1
expression1
expression1
expression1
term
factor
primary
n
term
factor
primary
i
term
factor
primary
k



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•logterm: #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

logterm
literal
xindexes1
expression1
term
factor
primary
i
indexkomaindexes1
expression1
expression1
expression1
term
factor
primary
n
term
factor
primary
i
term
factor
primary
k



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•clause: #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

clause
logterm
literal
xindexes1
expression1
term
factor
primary
i
indexkomaindexes1
expression1
expression1
expression1
term
factor
primary
n
term
factor
primary
i
term
factor
primary
k



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•leftpart: #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
i
indexkomaindexes1
expression1
expression1
expression1
term
factor
primary
n
term
factor
primary
i
term
factor
primary
k



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•formula: #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

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



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar <•bigformula: #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

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



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1: #i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•:#i# k \leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•#i#\leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•metavariable\leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•primary\leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

primary
k



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•factor\leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

factor
primary
k



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•term\leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

term
factor
primary
k



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•expression1\leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

expression1
term
factor
primary
k



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•expression\leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•limexpression\leq #i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•limexpression <•\leq#i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel#i# i \leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

lessrel


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel <•#i#\leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel <•metavariable\leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel <•metavariables1\leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

metavariables1
i



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel =•metavariables\leq #i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel =•metavariables <•\leq#i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel =•metavariables =•lessrel#i# n ) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

lessrel


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel =•metavariables =•lessrel <•#i#) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel =•metavariables =•lessrel <•metavariable) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel =•metavariables =•lessrel <•primary) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

primary
n



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel =•metavariables =•lessrel <•factor) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

factor
primary
n



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel =•metavariables =•lessrel <•term) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

term
factor
primary
n



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel =•metavariables =•lessrel <•expression1) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

expression1
term
factor
primary
n



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel =•metavariables =•lessrel =•expression) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: <•limit) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

limit
expression1
term
factor
primary
k
lessrelmetavariables1
i
lessrelexpression1
term
factor
primary
n



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: =•limits) ) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

limits
limit
expression1
term
factor
primary
k
lessrelmetavariables1
i
lessrelexpression1
term
factor
primary
n


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•atmostone =•prefpar =•bigformula1 =•: =•limits =•)) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•bigformula) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

bigformula
prefparbigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
i
indexkomaindexes1
expression1
expression1
expression1
term
factor
primary
n
term
factor
primary
i
term
factor
primary
k
limits
limit
expression1
term
factor
primary
k
lessrelmetavariables1
i
lessrelexpression1
term
factor
primary
n



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar =•bigformula1) ) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar =•bigformula1 =•)) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•literal) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

literal
logicparbigformula
prefparbigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
i
indexkomaindexes1
expression1
expression1
expression1
term
factor
primary
n
term
factor
primary
i
term
factor
primary
k
limits
limit
expression1
term
factor
primary
k
lessrelmetavariables1
i
lessrelexpression1
term
factor
primary
n



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logterm) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

logterm
literal
logicparbigformula
prefparbigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
i
indexkomaindexes1
expression1
expression1
expression1
term
factor
primary
n
term
factor
primary
i
term
factor
primary
k
limits
limit
expression1
term
factor
primary
k
lessrelmetavariables1
i
lessrelexpression1
term
factor
primary
n



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•clause) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

clause
logterm
literal
logicparbigformula
prefparbigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
i
indexkomaindexes1
expression1
expression1
expression1
term
factor
primary
n
term
factor
primary
i
term
factor
primary
k
limits
limit
expression1
term
factor
primary
k
lessrelmetavariables1
i
lessrelexpression1
term
factor
primary
n



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•leftpart) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

leftpart
clause
logterm
literal
logicparbigformula
prefparbigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
i
indexkomaindexes1
expression1
expression1
expression1
term
factor
primary
n
term
factor
primary
i
term
factor
primary
k
limits
limit
expression1
term
factor
primary
k
lessrelmetavariables1
i
lessrelexpression1
term
factor
primary
n



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•formula) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

formula
leftpart
clause
logterm
literal
logicparbigformula
prefparbigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
i
indexkomaindexes1
expression1
expression1
expression1
term
factor
primary
n
term
factor
primary
i
term
factor
primary
k
limits
limit
expression1
term
factor
primary
k
lessrelmetavariables1
i
lessrelexpression1
term
factor
primary
n



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra =•bigformula) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

bigformula
formula
leftpart
clause
logterm
literal
logicparbigformula
prefparbigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
i
indexkomaindexes1
expression1
expression1
expression1
term
factor
primary
n
term
factor
primary
i
term
factor
primary
k
limits
limit
expression1
term
factor
primary
k
lessrelmetavariables1
i
lessrelexpression1
term
factor
primary
n



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•bigformula) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

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



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar =•bigformula1) \& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar =•bigformula1 =•)\& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•literal\& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

literal
logicparbigformula
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
k
lessrelexpression1
term
factor
primary
n
lbrabigformula
formula
leftpart
clause
logterm
literal
logicparbigformula
prefparbigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
i
indexkomaindexes1
expression1
expression1
expression1
term
factor
primary
n
term
factor
primary
i
term
factor
primary
k
limits
limit
expression1
term
factor
primary
k
lessrelmetavariables1
i
lessrelexpression1
term
factor
primary
n



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm\& ( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

logterm
literal
logicparbigformula
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
k
lessrelexpression1
term
factor
primary
n
lbrabigformula
formula
leftpart
clause
logterm
literal
logicparbigformula
prefparbigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
i
indexkomaindexes1
expression1
expression1
expression1
term
factor
primary
n
term
factor
primary
i
term
factor
primary
k
limits
limit
expression1
term
factor
primary
k
lessrelmetavariables1
i
lessrelexpression1
term
factor
primary
n


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\&( \bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•(\bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar\bigwedge_{ #c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{#c# 1 \leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ <•#c#\leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ <•primary\leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

primary
1



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ <•factor\leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

factor
primary
1



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ <•term\leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

term
factor
primary
1



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ <•expression1\leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

expression1
term
factor
primary
1



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ <•expression\leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ <•limexpression\leq #i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ <•limexpression <•\leq#i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ <•limexpression =•lessrel#i# i \leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

lessrel


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ <•limexpression =•lessrel <•#i#\leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ <•limexpression =•lessrel <•metavariable\leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ <•limexpression =•lessrel <•metavariables1\leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

metavariables1
i



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ <•limexpression =•lessrel =•metavariables\leq #i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ <•limexpression =•lessrel =•metavariables <•\leq#i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ <•limexpression =•lessrel =•metavariables =•lessrel#i# n } ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

lessrel


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ <•limexpression =•lessrel =•metavariables =•lessrel <•#i#} ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ <•limexpression =•lessrel =•metavariables =•lessrel <•metavariable} ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ <•limexpression =•lessrel =•metavariables =•lessrel <•primary} ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

primary
n



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ <•limexpression =•lessrel =•metavariables =•lessrel <•factor} ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

factor
primary
n



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ <•limexpression =•lessrel =•metavariables =•lessrel <•term} ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

term
factor
primary
n



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ <•limexpression =•lessrel =•metavariables =•lessrel <•expression1} ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

expression1
term
factor
primary
n



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ <•limexpression =•lessrel =•metavariables =•lessrel =•expression} ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ <•limit} ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

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



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits} ( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

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


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits <•}( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra( exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•(exactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicparexactlyone ( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone( #i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone <•(#i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar#i# x _{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar <•#i#_{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar <•logvar_{ #i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar <•logvar =•_{#i# j , #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar <•logvar =•_{ <•#i#, #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar <•logvar =•_{ <•metavariable, #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar <•logvar =•_{ <•primary, #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

primary
j



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar <•logvar =•_{ <•factor, #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

factor
primary
j



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar <•logvar =•_{ <•term, #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

term
factor
primary
j



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar <•logvar =•_{ <•expression1, #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

expression1
term
factor
primary
j



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar <•logvar =•_{ <•expression, #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar <•logvar =•_{ <•index, #i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar <•logvar =•_{ <•index <•,#i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar <•logvar =•_{ <•index =•indexkoma#i# i } : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar <•logvar =•_{ <•index =•indexkoma <•#i#} : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar <•logvar =•_{ <•index =•indexkoma <•metavariable} : #c# 1 \leq #i# j \leq #i# n ) ) ) #



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar <•logvar =•_{ <•index =•indexkoma <•primary} : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

primary
i



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar <•logvar =•_{ <•index =•indexkoma <•factor} : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

factor
primary
i



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar <•logvar =•_{ <•index =•indexkoma <•term} : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

term
factor
primary
i



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar <•logvar =•_{ <•index =•indexkoma <•expression1} : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

expression1
term
factor
primary
i



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar <•logvar =•_{ <•index =•indexkoma <•expression} : #c# 1 \leq #i# j \leq #i# n ) ) ) #



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar <•logvar =•_{ <•index =•indexkoma <•index} : #c# 1 \leq #i# j \leq #i# n ) ) ) #



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar <•logvar =•_{ <•index =•indexkoma =•indexes1} : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

indexes1
expression1
term
factor
primary
i



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar <•logvar =•_{ <•indexes1} : #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

indexes1
expression1
term
factor
primary
j
indexkomaindexes1
expression1
term
factor
primary
i



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar <•logvar =•_{ =•indexes} : #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar <•logvar =•_{ =•indexes =•}: #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar <•literal: #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

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



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar <•logterm: #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

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



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar <•clause: #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

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



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar <•leftpart: #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

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



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar <•formula: #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

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



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar <•bigformula: #c# 1 \leq #i# j \leq #i# n ) ) ) #

Parsing tree

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



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar =•bigformula1: #c# 1 \leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar =•bigformula1 =•:#c# 1 \leq #i# j \leq #i# n ) ) ) #

Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar =•bigformula1 =•: <•#c#\leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar =•bigformula1 =•: <•primary\leq #i# j \leq #i# n ) ) ) #

Parsing tree

primary
1



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar =•bigformula1 =•: <•factor\leq #i# j \leq #i# n ) ) ) #

Parsing tree

factor
primary
1



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar =•bigformula1 =•: <•term\leq #i# j \leq #i# n ) ) ) #

Parsing tree

term
factor
primary
1



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar =•bigformula1 =•: <•expression1\leq #i# j \leq #i# n ) ) ) #

Parsing tree

expression1
term
factor
primary
1



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar =•bigformula1 =•: <•expression\leq #i# j \leq #i# n ) ) ) #



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar =•bigformula1 =•: <•limexpression\leq #i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar =•bigformula1 =•: <•limexpression <•\leq#i# j \leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel#i# j \leq #i# n ) ) ) #

Parsing tree

lessrel


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel <•#i#\leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel <•metavariable\leq #i# n ) ) ) #



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel <•metavariables1\leq #i# n ) ) ) #

Parsing tree

metavariables1
j



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel =•metavariables\leq #i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel =•metavariables <•\leq#i# n ) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel =•metavariables =•lessrel#i# n ) ) ) #

Parsing tree

lessrel


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel =•metavariables =•lessrel <•#i#) ) ) #


Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel =•metavariables =•lessrel <•metavariable) ) ) #



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel =•metavariables =•lessrel <•primary) ) ) #

Parsing tree

primary
n



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel =•metavariables =•lessrel <•factor) ) ) #

Parsing tree

factor
primary
n



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel =•metavariables =•lessrel <•term) ) ) #

Parsing tree

term
factor
primary
n



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel =•metavariables =•lessrel <•expression1) ) ) #

Parsing tree

expression1
term
factor
primary
n



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar =•bigformula1 =•: <•limexpression =•lessrel =•metavariables =•lessrel =•expression) ) ) #



Stack & Word # <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logterm =•\& <•logicpar <•\bigwedge_{ =•limits =•lbra <•logicpar <•exactlyone =•prefpar =•bigformula1 =•: <•limit) ) ) #

Parsing tree

limit
expression1
term
factor
primary
1
lessrelmetavariables1
j
lessrelexpression1
term
factor
primary
n



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

Parsing tree

limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
j
lessrelexpression1
term
factor
primary
n


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


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

Parsing tree

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



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


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


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

Parsing tree

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



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

Parsing tree

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



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

Parsing tree

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



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

Parsing tree

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



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

Parsing tree

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



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

Parsing tree

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



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

Parsing tree

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



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


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


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

Parsing tree

literal
logicparbigformula
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
i
lessrelexpression1
term
factor
primary
n
lbrabigformula
formula
leftpart
clause
logterm
literal
logicparbigformula
prefparbigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
j
indexkomaindexes1
expression1
term
factor
primary
i
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
j
lessrelexpression1
term
factor
primary
n



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

Parsing tree

logterm
literal
logicparbigformula
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
i
lessrelexpression1
term
factor
primary
n
lbrabigformula
formula
leftpart
clause
logterm
literal
logicparbigformula
prefparbigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
j
indexkomaindexes1
expression1
term
factor
primary
i
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
j
lessrelexpression1
term
factor
primary
n



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

Parsing tree

clause
logterm
literal
logicparbigformula
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
i
lessrelexpression1
term
factor
primary
n
lbrabigformula
formula
leftpart
clause
logterm
literal
logicparbigformula
prefparbigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
j
indexkomaindexes1
expression1
term
factor
primary
i
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
j
lessrelexpression1
term
factor
primary
n



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

Parsing tree

clause
logterm
literal
logicparbigformula
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
k
lessrelexpression1
term
factor
primary
n
lbrabigformula
formula
leftpart
clause
logterm
literal
logicparbigformula
prefparbigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
i
indexkomaindexes1
expression1
expression1
expression1
term
factor
primary
n
term
factor
primary
i
term
factor
primary
k
limits
limit
expression1
term
factor
primary
k
lessrelmetavariables1
i
lessrelexpression1
term
factor
primary
n
clause
logterm
literal
logicparbigformula
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
i
lessrelexpression1
term
factor
primary
n
lbrabigformula
formula
leftpart
clause
logterm
literal
logicparbigformula
prefparbigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
j
indexkomaindexes1
expression1
term
factor
primary
i
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
j
lessrelexpression1
term
factor
primary
n



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

Parsing tree

clause
logterm
literal
logicparbigformula
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
k
lessrelexpression1
term
factor
primary
n
lbrabigformula
formula
leftpart
clause
logterm
literal
logicparbigformula
prefparbigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
i
indexkomaindexes1
expression1
expression1
expression1
expression1
term
factor
primary
n
term
factor
primary
k
term
factor
primary
i
term
factor
primary
2
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
i
lessrelexpression1
expression1
expression1
term
factor
primary
n
term
factor
primary
k
term
factor
primary
1
clause
logterm
literal
logicparbigformula
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
k
lessrelexpression1
term
factor
primary
n
lbrabigformula
formula
leftpart
clause
logterm
literal
logicparbigformula
prefparbigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
i
indexkomaindexes1
expression1
expression1
expression1
term
factor
primary
n
term
factor
primary
i
term
factor
primary
k
limits
limit
expression1
term
factor
primary
k
lessrelmetavariables1
i
lessrelexpression1
term
factor
primary
n
clause
logterm
literal
logicparbigformula
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
i
lessrelexpression1
term
factor
primary
n
lbrabigformula
formula
leftpart
clause
logterm
literal
logicparbigformula
prefparbigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
j
indexkomaindexes1
expression1
term
factor
primary
i
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
j
lessrelexpression1
term
factor
primary
n



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

Parsing tree

clause
logterm
literal
logicparbigformula
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
k
lessrelexpression1
term
factor
primary
n
lbrabigformula
formula
leftpart
clause
logterm
literal
logicparbigformula
prefparbigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
i
indexkomaindexes1
expression1
expression1
expression1
term
factor
primary
k
term
factor
primary
i
term
factor
primary
1
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
i
lessrelexpression1
expression1
expression1
term
factor
primary
n
term
factor
primary
k
term
factor
primary
1
clause
logterm
literal
logicparbigformula
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
k
lessrelexpression1
term
factor
primary
n
lbrabigformula
formula
leftpart
clause
logterm
literal
logicparbigformula
prefparbigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
i
indexkomaindexes1
expression1
expression1
expression1
expression1
term
factor
primary
n
term
factor
primary
k
term
factor
primary
i
term
factor
primary
2
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
i
lessrelexpression1
expression1
expression1
term
factor
primary
n
term
factor
primary
k
term
factor
primary
1
clause
logterm
literal
logicparbigformula
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
k
lessrelexpression1
term
factor
primary
n
lbrabigformula
formula
leftpart
clause
logterm
literal
logicparbigformula
prefparbigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
i
indexkomaindexes1
expression1
expression1
expression1
term
factor
primary
n
term
factor
primary
i
term
factor
primary
k
limits
limit
expression1
term
factor
primary
k
lessrelmetavariables1
i
lessrelexpression1
term
factor
primary
n
clause
logterm
literal
logicparbigformula
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
i
lessrelexpression1
term
factor
primary
n
lbrabigformula
formula
leftpart
clause
logterm
literal
logicparbigformula
prefparbigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
j
indexkomaindexes1
expression1
term
factor
primary
i
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
j
lessrelexpression1
term
factor
primary
n



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

Parsing tree

clause
logterm
literal
logicparbigformula
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
k
lessrelexpression1
term
factor
primary
n
lbrabigformula
formula
leftpart
clause
logterm
literal
logicparbigformula
prefparbigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
i
indexkomaindexes1
expression1
expression1
expression1
term
factor
primary
i
term
factor
primary
k
term
factor
primary
1
limits
limit
expression1
term
factor
primary
k
lessrelmetavariables1
i
lessrelexpression1
term
factor
primary
n
clause
logterm
literal
logicparbigformula
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
k
lessrelexpression1
term
factor
primary
n
lbrabigformula
formula
leftpart
clause
logterm
literal
logicparbigformula
prefparbigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
i
indexkomaindexes1
expression1
expression1
expression1
term
factor
primary
k
term
factor
primary
i
term
factor
primary
1
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
i
lessrelexpression1
expression1
expression1
term
factor
primary
n
term
factor
primary
k
term
factor
primary
1
clause
logterm
literal
logicparbigformula
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
k
lessrelexpression1
term
factor
primary
n
lbrabigformula
formula
leftpart
clause
logterm
literal
logicparbigformula
prefparbigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
i
indexkomaindexes1
expression1
expression1
expression1
expression1
term
factor
primary
n
term
factor
primary
k
term
factor
primary
i
term
factor
primary
2
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
i
lessrelexpression1
expression1
expression1
term
factor
primary
n
term
factor
primary
k
term
factor
primary
1
clause
logterm
literal
logicparbigformula
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
k
lessrelexpression1
term
factor
primary
n
lbrabigformula
formula
leftpart
clause
logterm
literal
logicparbigformula
prefparbigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
i
indexkomaindexes1
expression1
expression1
expression1
term
factor
primary
n
term
factor
primary
i
term
factor
primary
k
limits
limit
expression1
term
factor
primary
k
lessrelmetavariables1
i
lessrelexpression1
term
factor
primary
n
clause
logterm
literal
logicparbigformula
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
i
lessrelexpression1
term
factor
primary
n
lbrabigformula
formula
leftpart
clause
logterm
literal
logicparbigformula
prefparbigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
j
indexkomaindexes1
expression1
term
factor
primary
i
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
j
lessrelexpression1
term
factor
primary
n



Stack & Word # <•clause#

Parsing tree

clause
logterm
literal
logicparbigformula
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
i
lessrelexpression1
term
factor
primary
n
lbrabigformula
formula
leftpart
clause
logterm
literal
logicparbigformula
prefparbigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
i
indexkomaindexes1
expression1
term
factor
primary
j
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
j
lessrelexpression1
term
factor
primary
n
clause
logterm
literal
logicparbigformula
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
k
lessrelexpression1
term
factor
primary
n
lbrabigformula
formula
leftpart
clause
logterm
literal
logicparbigformula
prefparbigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
i
indexkomaindexes1
expression1
expression1
expression1
term
factor
primary
i
term
factor
primary
k
term
factor
primary
1
limits
limit
expression1
term
factor
primary
k
lessrelmetavariables1
i
lessrelexpression1
term
factor
primary
n
clause
logterm
literal
logicparbigformula
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
k
lessrelexpression1
term
factor
primary
n
lbrabigformula
formula
leftpart
clause
logterm
literal
logicparbigformula
prefparbigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
i
indexkomaindexes1
expression1
expression1
expression1
term
factor
primary
k
term
factor
primary
i
term
factor
primary
1
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
i
lessrelexpression1
expression1
expression1
term
factor
primary
n
term
factor
primary
k
term
factor
primary
1
clause
logterm
literal
logicparbigformula
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
k
lessrelexpression1
term
factor
primary
n
lbrabigformula
formula
leftpart
clause
logterm
literal
logicparbigformula
prefparbigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
i
indexkomaindexes1
expression1
expression1
expression1
expression1
term
factor
primary
n
term
factor
primary
k
term
factor
primary
i
term
factor
primary
2
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
i
lessrelexpression1
expression1
expression1
term
factor
primary
n
term
factor
primary
k
term
factor
primary
1
clause
logterm
literal
logicparbigformula
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
k
lessrelexpression1
term
factor
primary
n
lbrabigformula
formula
leftpart
clause
logterm
literal
logicparbigformula
prefparbigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
i
indexkomaindexes1
expression1
expression1
expression1
term
factor
primary
n
term
factor
primary
i
term
factor
primary
k
limits
limit
expression1
term
factor
primary
k
lessrelmetavariables1
i
lessrelexpression1
term
factor
primary
n
clause
logterm
literal
logicparbigformula
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
i
lessrelexpression1
term
factor
primary
n
lbrabigformula
formula
leftpart
clause
logterm
literal
logicparbigformula
prefparbigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
j
indexkomaindexes1
expression1
term
factor
primary
i
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
j
lessrelexpression1
term
factor
primary
n



Stack & Word # <•leftpart#

Parsing tree

leftpart
clause
logterm
literal
logicparbigformula
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
i
lessrelexpression1
term
factor
primary
n
lbrabigformula
formula
leftpart
clause
logterm
literal
logicparbigformula
prefparbigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
i
indexkomaindexes1
expression1
term
factor
primary
j
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
j
lessrelexpression1
term
factor
primary
n
clause
logterm
literal
logicparbigformula
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
k
lessrelexpression1
term
factor
primary
n
lbrabigformula
formula
leftpart
clause
logterm
literal
logicparbigformula
prefparbigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
i
indexkomaindexes1
expression1
expression1
expression1
term
factor
primary
i
term
factor
primary
k
term
factor
primary
1
limits
limit
expression1
term
factor
primary
k
lessrelmetavariables1
i
lessrelexpression1
term
factor
primary
n
clause
logterm
literal
logicparbigformula
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
k
lessrelexpression1
term
factor
primary
n
lbrabigformula
formula
leftpart
clause
logterm
literal
logicparbigformula
prefparbigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
i
indexkomaindexes1
expression1
expression1
expression1
term
factor
primary
k
term
factor
primary
i
term
factor
primary
1
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
i
lessrelexpression1
expression1
expression1
term
factor
primary
n
term
factor
primary
k
term
factor
primary
1
clause
logterm
literal
logicparbigformula
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
k
lessrelexpression1
term
factor
primary
n
lbrabigformula
formula
leftpart
clause
logterm
literal
logicparbigformula
prefparbigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
i
indexkomaindexes1
expression1
expression1
expression1
expression1
term
factor
primary
n
term
factor
primary
k
term
factor
primary
i
term
factor
primary
2
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
i
lessrelexpression1
expression1
expression1
term
factor
primary
n
term
factor
primary
k
term
factor
primary
1
clause
logterm
literal
logicparbigformula
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
k
lessrelexpression1
term
factor
primary
n
lbrabigformula
formula
leftpart
clause
logterm
literal
logicparbigformula
prefparbigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
i
indexkomaindexes1
expression1
expression1
expression1
term
factor
primary
n
term
factor
primary
i
term
factor
primary
k
limits
limit
expression1
term
factor
primary
k
lessrelmetavariables1
i
lessrelexpression1
term
factor
primary
n
clause
logterm
literal
logicparbigformula
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
i
lessrelexpression1
term
factor
primary
n
lbrabigformula
formula
leftpart
clause
logterm
literal
logicparbigformula
prefparbigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
j
indexkomaindexes1
expression1
term
factor
primary
i
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
j
lessrelexpression1
term
factor
primary
n



Stack & Word # <•formula#

Parsing tree

formula
leftpart
clause
logterm
literal
logicparbigformula
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
i
lessrelexpression1
term
factor
primary
n
lbrabigformula
formula
leftpart
clause
logterm
literal
logicparbigformula
prefparbigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
i
indexkomaindexes1
expression1
term
factor
primary
j
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
j
lessrelexpression1
term
factor
primary
n
clause
logterm
literal
logicparbigformula
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
k
lessrelexpression1
term
factor
primary
n
lbrabigformula
formula
leftpart
clause
logterm
literal
logicparbigformula
prefparbigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
i
indexkomaindexes1
expression1
expression1
expression1
term
factor
primary
i
term
factor
primary
k
term
factor
primary
1
limits
limit
expression1
term
factor
primary
k
lessrelmetavariables1
i
lessrelexpression1
term
factor
primary
n
clause
logterm
literal
logicparbigformula
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
k
lessrelexpression1
term
factor
primary
n
lbrabigformula
formula
leftpart
clause
logterm
literal
logicparbigformula
prefparbigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
i
indexkomaindexes1
expression1
expression1
expression1
term
factor
primary
k
term
factor
primary
i
term
factor
primary
1
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
i
lessrelexpression1
expression1
expression1
term
factor
primary
n
term
factor
primary
k
term
factor
primary
1
clause
logterm
literal
logicparbigformula
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
k
lessrelexpression1
term
factor
primary
n
lbrabigformula
formula
leftpart
clause
logterm
literal
logicparbigformula
prefparbigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
i
indexkomaindexes1
expression1
expression1
expression1
expression1
term
factor
primary
n
term
factor
primary
k
term
factor
primary
i
term
factor
primary
2
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
i
lessrelexpression1
expression1
expression1
term
factor
primary
n
term
factor
primary
k
term
factor
primary
1
clause
logterm
literal
logicparbigformula
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
k
lessrelexpression1
term
factor
primary
n
lbrabigformula
formula
leftpart
clause
logterm
literal
logicparbigformula
prefparbigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
i
indexkomaindexes1
expression1
expression1
expression1
term
factor
primary
n
term
factor
primary
i
term
factor
primary
k
limits
limit
expression1
term
factor
primary
k
lessrelmetavariables1
i
lessrelexpression1
term
factor
primary
n
clause
logterm
literal
logicparbigformula
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
i
lessrelexpression1
term
factor
primary
n
lbrabigformula
formula
leftpart
clause
logterm
literal
logicparbigformula
prefparbigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
j
indexkomaindexes1
expression1
term
factor
primary
i
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
j
lessrelexpression1
term
factor
primary
n



Stack & Word # <•bigformula#

Parsing tree

bigformula
formula
leftpart
clause
logterm
literal
logicparbigformula
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
i
lessrelexpression1
term
factor
primary
n
lbrabigformula
formula
leftpart
clause
logterm
literal
logicparbigformula
prefparbigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
i
indexkomaindexes1
expression1
term
factor
primary
j
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
j
lessrelexpression1
term
factor
primary
n
clause
logterm
literal
logicparbigformula
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
k
lessrelexpression1
term
factor
primary
n
lbrabigformula
formula
leftpart
clause
logterm
literal
logicparbigformula
prefparbigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
i
indexkomaindexes1
expression1
expression1
expression1
term
factor
primary
i
term
factor
primary
k
term
factor
primary
1
limits
limit
expression1
term
factor
primary
k
lessrelmetavariables1
i
lessrelexpression1
term
factor
primary
n
clause
logterm
literal
logicparbigformula
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
k
lessrelexpression1
term
factor
primary
n
lbrabigformula
formula
leftpart
clause
logterm
literal
logicparbigformula
prefparbigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
i
indexkomaindexes1
expression1
expression1
expression1
term
factor
primary
k
term
factor
primary
i
term
factor
primary
1
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
i
lessrelexpression1
expression1
expression1
term
factor
primary
n
term
factor
primary
k
term
factor
primary
1
clause
logterm
literal
logicparbigformula
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
k
lessrelexpression1
term
factor
primary
n
lbrabigformula
formula
leftpart
clause
logterm
literal
logicparbigformula
prefparbigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
i
indexkomaindexes1
expression1
expression1
expression1
expression1
term
factor
primary
n
term
factor
primary
k
term
factor
primary
i
term
factor
primary
2
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
i
lessrelexpression1
expression1
expression1
term
factor
primary
n
term
factor
primary
k
term
factor
primary
1
clause
logterm
literal
logicparbigformula
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
k
lessrelexpression1
term
factor
primary
n
lbrabigformula
formula
leftpart
clause
logterm
literal
logicparbigformula
prefparbigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
i
indexkomaindexes1
expression1
expression1
expression1
term
factor
primary
n
term
factor
primary
i
term
factor
primary
k
limits
limit
expression1
term
factor
primary
k
lessrelmetavariables1
i
lessrelexpression1
term
factor
primary
n
clause
logterm
literal
logicparbigformula
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
i
lessrelexpression1
term
factor
primary
n
lbrabigformula
formula
leftpart
clause
logterm
literal
logicparbigformula
prefparbigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
j
indexkomaindexes1
expression1
term
factor
primary
i
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
j
lessrelexpression1
term
factor
primary
n



Stack & Word # <•metaformula#

Parsing tree

metaformula
bigformula
formula
leftpart
clause
logterm
literal
logicparbigformula
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
i
lessrelexpression1
term
factor
primary
n
lbrabigformula
formula
leftpart
clause
logterm
literal
logicparbigformula
prefparbigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
i
indexkomaindexes1
expression1
term
factor
primary
j
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
j
lessrelexpression1
term
factor
primary
n
clause
logterm
literal
logicparbigformula
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
k
lessrelexpression1
term
factor
primary
n
lbrabigformula
formula
leftpart
clause
logterm
literal
logicparbigformula
prefparbigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
i
indexkomaindexes1
expression1
expression1
expression1
term
factor
primary
i
term
factor
primary
k
term
factor
primary
1
limits
limit
expression1
term
factor
primary
k
lessrelmetavariables1
i
lessrelexpression1
term
factor
primary
n
clause
logterm
literal
logicparbigformula
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
k
lessrelexpression1
term
factor
primary
n
lbrabigformula
formula
leftpart
clause
logterm
literal
logicparbigformula
prefparbigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
i
indexkomaindexes1
expression1
expression1
expression1
term
factor
primary
k
term
factor
primary
i
term
factor
primary
1
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
i
lessrelexpression1
expression1
expression1
term
factor
primary
n
term
factor
primary
k
term
factor
primary
1
clause
logterm
literal
logicparbigformula
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
k
lessrelexpression1
term
factor
primary
n
lbrabigformula
formula
leftpart
clause
logterm
literal
logicparbigformula
prefparbigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
i
indexkomaindexes1
expression1
expression1
expression1
expression1
term
factor
primary
n
term
factor
primary
k
term
factor
primary
i
term
factor
primary
2
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
i
lessrelexpression1
expression1
expression1
term
factor
primary
n
term
factor
primary
k
term
factor
primary
1
clause
logterm
literal
logicparbigformula
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
k
lessrelexpression1
term
factor
primary
n
lbrabigformula
formula
leftpart
clause
logterm
literal
logicparbigformula
prefparbigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
i
indexkomaindexes1
expression1
expression1
expression1
term
factor
primary
n
term
factor
primary
i
term
factor
primary
k
limits
limit
expression1
term
factor
primary
k
lessrelmetavariables1
i
lessrelexpression1
term
factor
primary
n
clause
logterm
literal
logicparbigformula
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
i
lessrelexpression1
term
factor
primary
n
lbrabigformula
formula
leftpart
clause
logterm
literal
logicparbigformula
prefparbigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
j
indexkomaindexes1
expression1
term
factor
primary
i
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
j
lessrelexpression1
term
factor
primary
n



Stack & Word # =•family#

the parsing is completed

Parsing tree

family
metaformula
bigformula
formula
leftpart
clause
logterm
literal
logicparbigformula
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
i
lessrelexpression1
term
factor
primary
n
lbrabigformula
formula
leftpart
clause
logterm
literal
logicparbigformula
prefparbigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
i
indexkomaindexes1
expression1
term
factor
primary
j
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
j
lessrelexpression1
term
factor
primary
n
clause
logterm
literal
logicparbigformula
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
k
lessrelexpression1
term
factor
primary
n
lbrabigformula
formula
leftpart
clause
logterm
literal
logicparbigformula
prefparbigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
i
indexkomaindexes1
expression1
expression1
expression1
term
factor
primary
i
term
factor
primary
k
term
factor
primary
1
limits
limit
expression1
term
factor
primary
k
lessrelmetavariables1
i
lessrelexpression1
term
factor
primary
n
clause
logterm
literal
logicparbigformula
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
k
lessrelexpression1
term
factor
primary
n
lbrabigformula
formula
leftpart
clause
logterm
literal
logicparbigformula
prefparbigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
i
indexkomaindexes1
expression1
expression1
expression1
term
factor
primary
k
term
factor
primary
i
term
factor
primary
1
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
i
lessrelexpression1
expression1
expression1
term
factor
primary
n
term
factor
primary
k
term
factor
primary
1
clause
logterm
literal
logicparbigformula
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
k
lessrelexpression1
term
factor
primary
n
lbrabigformula
formula
leftpart
clause
logterm
literal
logicparbigformula
prefparbigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
i
indexkomaindexes1
expression1
expression1
expression1
expression1
term
factor
primary
n
term
factor
primary
k
term
factor
primary
i
term
factor
primary
2
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
i
lessrelexpression1
expression1
expression1
term
factor
primary
n
term
factor
primary
k
term
factor
primary
1
clause
logterm
literal
logicparbigformula
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
k
lessrelexpression1
term
factor
primary
n
lbrabigformula
formula
leftpart
clause
logterm
literal
logicparbigformula
prefparbigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
i
indexkomaindexes1
expression1
expression1
expression1
term
factor
primary
n
term
factor
primary
i
term
factor
primary
k
limits
limit
expression1
term
factor
primary
k
lessrelmetavariables1
i
lessrelexpression1
term
factor
primary
n
clause
logterm
literal
logicparbigformula
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
i
lessrelexpression1
term
factor
primary
n
lbrabigformula
formula
leftpart
clause
logterm
literal
logicparbigformula
prefparbigformula
formula
leftpart
clause
logterm
literal
xindexes1
expression1
term
factor
primary
j
indexkomaindexes1
expression1
term
factor
primary
i
limits
limit
expression1
term
factor
primary
1
lessrelmetavariables1
j
lessrelexpression1
term
factor
primary
n

Table of constants

c1=1c2=2

Table of identifiers

i1=ii2=ni3=xi4=ji5=k

Parser ended

Interpreter ended at Sun Apr 21 10:25:01 2019