prev next
 File: /TortureTests/Complexity/complex4.xml Author: Design Science, Inc. (D. Doyle, R. Miner) Description: Testing content tags. Sample Rendering: N/A

a + b - c
a b c

x + yz + z
x y z z

x * (y + z) * z
x y z z

sin(a + b)
a b

sin(x(y + z)z)
x y z z

sin(xy)2b
x y 2 b

(x + y) ^ (n - 3)
x y n 3

limit as x goes to a of sin x using <reln>
x x a x

limit as x goes to a of sin x using <apply>
x x a x

limit as x goes to a of sin(x + y) using <reln>
x x a x y

limit as x goes to a of sin(x + y) using <apply>
x x a x y

limit as x goes to a of sin(x + y)2b using <reln>
x x a x y 2 b

limit as x goes to a of sin(x + y)2b using <apply>
x x a x y 2 b

quotient
a b

moment
3 X

selector
1 2 3 4 1

factorial
n

(a + b)!
n m x

inverse function
f

inverse matrix
a A

conjugate
x y

a + b + c
a b c

integral (a + x)dx
x 0 a a x

-1 + 7
1 7

7 + (-1)
7 1

max
x x 0 x 1 x x

lambda sin(x + 1)
x x 1

lambda integral f(x)dx
b x a b f x

compose f and g
f g

compose f and g (x)
f g x

f(g(x))
f g x

composition of f and inverse of f eq identity using <reln>
f f

composition of f and inverse of f eq identity using <apply>
f f

e^x
x

min(x, x not in B, x^2) using <reln>
x x B x 2

min(x, x not in B, x^2) using <apply>
x x B x 2

a mod (b)
a b

ab
a b

gcd(a b, c)
a b c

integral
x 0 a f x

abs(x)
x

tall abs(x)
H K

abs(x + y + z)
x y z

x > 0 and z < 1 as <reln>
x 0 x 1

x > 0 and z < 1 as <apply>
x 0 x 1

a and b
a b

a or b
a b

a xor b
a b

a eq b with <reln> tag
a b

a eq b with <apply> tag
a b

a neq b with <reln> tag
a b

a neq b with <apply> tag
a b

a > b with <reln> tag
a b

a > b with <apply> tag
a b

a < b with <reln> tag
a b

a < b with <apply> tag
a b

a <= b with <reln> tag
a b

a >= b with <apply> tag
a b

a <= b with <reln> tag
a b

a <= b with <apply> tag
a b

set: {b, a, c}
b a c

set with condition
x x 5

list: {b, a, c}
b a c

list: {x|x < 5}
x x 5

A union B
A B

A intersect B
A B

A intersect (B union C)
A B C

integral x in R as <reln>
x R

x in R as <apply>
x R

a in A
a A

a not in A as <reln>
a A

a not in A as <apply>
a A

not a
a

not (a and b)
a b

A -> B (reln)
A B

A -> B (apply)
A B

forall
x x x 0

forall/and/lt/power
p q p Q q Q p q p q 2

forall/exists/and/plus
n n Z n 0 x y z x Z y Z z Z x n y n z n

exists
x f x 0

forall/exists/and/plus
n n Z n 0 x y z x Z y Z z Z x n y n z n

ln a
a

log base 3 of x
3 x

integer
x x D f x

diff
x f x

partialdiff
x 2 y f x y

integral
x a b f x

partialdiff
x n y m x y

divide
a b

divide/plus/minus
a b a b

divide/plus/divide
a b a b

A is subset of B as <reln>
A B

A is subset of B as <apply>
A B

A is proper subset of B as <reln>
A B

A is proper subset of B as <apply>
A B

A is not subset of B as <reln>
A B

A is not subset of B as <apply>
A B

A is not proper subset of B as <reln>
A B

A is not proper subset of B as <apply>
A B

Set difference
A B

Log base 3 of x + y
3 x y

Sum as x goes from a to b of f(x)
x a b f x

sum
x x B f x

product
x a b f x

product
x x B f x

tendsto with <reln>
x 2 a 2

tendsto with <apply>
x 2 a 2

tendsto with <reln>
x y f x y g x y

tendsto with <apply>
x y f x y g x y

mean(X)
X

root(a + b)
n a b

standard deviation
X

variance(X)
X

median(X)
X

mode(X)
X

degree
3 X

vector
1 2 3 x

matrix
0 1 0 0 0 0 1 0 1 0 0 0

determinant
A

transpose
A

semantics
x 5 \sin x + 5

limit
x 0 x

symbol check
4.56 4.56 4 5 4 5 4.56 4.56 π γ

multiset
4.56 4.56 4 5 4 5 4.56 4.56 π γ

tendsto type = "above" with <reln>
x 2 a 2

tendsto type = "above" with <apply>
x 2 a 2

tendsto type = "below" with <reln>
x 2 a 2

tendsto type = "below" with <apply>
x 2 a 2

tendsto type = "two-sided" with <reln>
x 2 a 2

tendsto type = "two-sided" with <apply>
x 2 a 2

type check
x x x y θ v π γ

sin + cos
x x

f(x)
f x

Source Code:

N/A