Metrics for Text.Parsec.Token:makeTokenParser from parsec-3.1.9, B

start0.0ms (0%)

Memory: 0.1MiB live, 0.1MiB allocated; 0ms collecting garbage

analyze0.0ms (0%)

Memory

0.3MiB live, 0.3MiB allocated; 0ms collecting garbage

Algorithm

1×

Search

Probability	Valid	Unknown	Precondition	Infinite	Domain	Can't	Iter
0%	0%	99.9%	0.1%	0%	0%	0%	0
100%	99.9%	0%	0.1%	0%	0%	0%	1

Compiler

Compiled 7 to 7 computations (0% saved)

sample631.0ms (50.4%)

Memory

5.2MiB live, 716.4MiB allocated; 203ms collecting garbage

Samples

381.0ms

8 256×

valid

Precisions

Click to see histograms. Total time spent on operations: 121.0ms

ival-mult: 61.0ms (50.6% of total)

ival-add: 55.0ms (45.6% of total)

adjust: 2.0ms (1.7% of total)

ival-assert: 2.0ms (1.7% of total)

Bogosity

explain47.0ms (3.7%)

Memory

-25.6MiB live, 65.0MiB allocated; 9ms collecting garbage

FPErrors

Click to see full error table

Example	Example	Subexpression
-	-	`y`
-	-	`(*.f64 (+.f64 x y) z)`
-	-	`(+.f64 x y)`
-	-	`z`
-	-	`x`

Confusion

	Predicted +	Predicted -
+	0	0
-	0	256

Precision

0/0

Recall

0/0

Confusion?

	Predicted +	Predicted Maybe	Predicted -
+	0	0	0
-	0	0	256

Precision?

0/0

Recall?

0/0

Freqs

test

number	freq
0	256

Total Confusion?

	Predicted +	Predicted Maybe	Predicted -
+	0	0	0
-	0	0	1

Precision?

0/0

Recall?

0/0

Samples

23.0ms

512×

valid

Compiler

Compiled 31 to 19 computations (38.7% saved)

Precisions

Click to see histograms. Total time spent on operations: 7.0ms

ival-add: 3.0ms (43.3% of total)

ival-mult: 3.0ms (43.3% of total)

ival-true: 0.0ms (0% of total)

adjust: 0.0ms (0% of total)

ival-assert: 0.0ms (0% of total)

preprocess24.0ms (1.9%)

Memory

36.3MiB live, 36.3MiB allocated; 0ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	22	55
1	43	55
2	97	55
3	229	51
4	317	51
5	421	51
6	497	51
7	575	51
8	615	51
9	625	51
0	5	5
0	7	5
1	9	5
2	17	5
3	32	5
4	53	5
5	82	5
6	102	5
7	134	5
8	152	5
9	172	5
10	182	5
0	182	5

Stop Event

1×	iter limit
1×	saturated
1×	iter limit
1×	saturated

Calls

Call 1

Inputs
(*.f64 (+.f64 x y) z)

Outputs
(*.f64 (+.f64 x y) z)
(*.f64 z (+.f64 y x))

Symmetry

(negabs z)

(sort x y)

Compiler

Compiled 5 to 5 computations (0% saved)

eval0.0ms (0%)

Memory: 0.1MiB live, 0.1MiB allocated; 0ms collecting garbage
Compiler: Compiled 0 to 3 computations (-∞% saved)

prune0.0ms (0%)

Memory

0.6MiB live, 0.6MiB allocated; 0ms collecting garbage

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	(*.f64 (+.f64 x y) z)

Compiler

Compiled 5 to 5 computations (0% saved)

series5.0ms (0.4%)

Memory

7.8MiB live, 7.8MiB allocated; 0ms collecting garbage

Counts

5 → 18

Calls

Call 1

Inputs
(*.f64 (+.f64 x y) z)
(+.f64 x y)
x
y
z

Outputs
#s(approx (* (+ x y) z) #s(hole binary64 (* y z)))
#s(approx (* (+ x y) z) #s(hole binary64 (+ (* x z) (* y z))))
#s(approx (+ x y) #s(hole binary64 y))
#s(approx (+ x y) #s(hole binary64 (+ x y)))
#s(approx x #s(hole binary64 x))
#s(approx (* (+ x y) z) #s(hole binary64 (* x z)))
#s(approx (* (+ x y) z) #s(hole binary64 (* x (+ z (/ (* y z) x)))))
#s(approx (+ x y) #s(hole binary64 x))
#s(approx (+ x y) #s(hole binary64 (* x (+ 1 (/ y x)))))
#s(approx (* (+ x y) z) #s(hole binary64 (* -1 (* x (+ (* -1 z) (* -1 (/ (* y z) x)))))))
#s(approx (+ x y) #s(hole binary64 (* -1 (* x (- (* -1 (/ y x)) 1)))))
#s(approx y #s(hole binary64 y))
#s(approx (* (+ x y) z) #s(hole binary64 (* y (+ z (/ (* x z) y)))))
#s(approx (+ x y) #s(hole binary64 (* y (+ 1 (/ x y)))))
#s(approx (* (+ x y) z) #s(hole binary64 (* -1 (* y (+ (* -1 z) (* -1 (/ (* x z) y)))))))
#s(approx (+ x y) #s(hole binary64 (* -1 (* y (- (* -1 (/ x y)) 1)))))
#s(approx (* (+ x y) z) #s(hole binary64 (* z (+ x y))))
#s(approx z #s(hole binary64 z))

Calls

9 calls:

Time	Variable		Point	Expression
1.0ms	x	@	inf	((* (+ x y) z) (+ x y) x y z)
1.0ms	y	@	inf	((* (+ x y) z) (+ x y) x y z)
1.0ms	x	@	-inf	((* (+ x y) z) (+ x y) x y z)
1.0ms	z	@	-inf	((* (+ x y) z) (+ x y) x y z)
1.0ms	y	@	-inf	((* (+ x y) z) (+ x y) x y z)

rewrite162.0ms (13%)

Memory

-23.7MiB live, 154.6MiB allocated; 36ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	60	203
0	61	191
1	280	189
2	2225	189
0	8216	183

Stop Event

1×	iter limit
1×	node limit
1×	iter limit

Counts

23 → 75

Calls

Call 1

Inputs
(*.f64 (+.f64 x y) z)
(+.f64 x y)
x
y
z
#s(approx (* (+ x y) z) #s(hole binary64 (* y z)))
#s(approx (* (+ x y) z) #s(hole binary64 (+ (* x z) (* y z))))
#s(approx (+ x y) #s(hole binary64 y))
#s(approx (+ x y) #s(hole binary64 (+ x y)))
#s(approx x #s(hole binary64 x))
#s(approx (* (+ x y) z) #s(hole binary64 (* x z)))
#s(approx (* (+ x y) z) #s(hole binary64 (* x (+ z (/ (* y z) x)))))
#s(approx (+ x y) #s(hole binary64 x))
#s(approx (+ x y) #s(hole binary64 (* x (+ 1 (/ y x)))))
#s(approx (* (+ x y) z) #s(hole binary64 (* -1 (* x (+ (* -1 z) (* -1 (/ (* y z) x)))))))
#s(approx (+ x y) #s(hole binary64 (* -1 (* x (- (* -1 (/ y x)) 1)))))
#s(approx y #s(hole binary64 y))
#s(approx (* (+ x y) z) #s(hole binary64 (* y (+ z (/ (* x z) y)))))
#s(approx (+ x y) #s(hole binary64 (* y (+ 1 (/ x y)))))
#s(approx (* (+ x y) z) #s(hole binary64 (* -1 (* y (+ (* -1 z) (* -1 (/ (* x z) y)))))))
#s(approx (+ x y) #s(hole binary64 (* -1 (* y (- (* -1 (/ x y)) 1)))))
#s(approx (* (+ x y) z) #s(hole binary64 (* z (+ x y))))
#s(approx z #s(hole binary64 z))

Outputs
(*.f64 (+.f64 y x) z)
(*.f64 z (-.f64 x (neg.f64 y)))
(*.f64 z (+.f64 y x))
(/.f64 (neg.f64 (.f64 (.f64 (+.f64 y x) (-.f64 x y)) z)) (neg.f64 (-.f64 x y)))
(/.f64 (neg.f64 (.f64 (+.f64 (pow.f64 y #s(literal 3 binary64)) (pow.f64 x #s(literal 3 binary64))) z)) (neg.f64 (fma.f64 y (-.f64 y x) (.f64 x x))))
(/.f64 (neg.f64 (.f64 z (.f64 (+.f64 y x) (-.f64 x y)))) (neg.f64 (-.f64 x y)))
(/.f64 (neg.f64 (.f64 z (+.f64 (pow.f64 y #s(literal 3 binary64)) (pow.f64 x #s(literal 3 binary64))))) (neg.f64 (fma.f64 y (-.f64 y x) (.f64 x x))))
(/.f64 (neg.f64 (-.f64 (pow.f64 (.f64 z y) #s(literal 2 binary64)) (pow.f64 (.f64 z x) #s(literal 2 binary64)))) (neg.f64 (-.f64 (.f64 z y) (.f64 z x))))
(/.f64 (neg.f64 (neg.f64 (-.f64 (pow.f64 (.f64 z x) #s(literal 2 binary64)) (pow.f64 (.f64 z y) #s(literal 2 binary64))))) (neg.f64 (neg.f64 (*.f64 z (-.f64 x y)))))
(/.f64 (neg.f64 (neg.f64 (+.f64 (pow.f64 (.f64 z y) #s(literal 3 binary64)) (pow.f64 (.f64 z x) #s(literal 3 binary64))))) (neg.f64 (neg.f64 (fma.f64 (.f64 z y) (-.f64 (.f64 z y) (.f64 z x)) (pow.f64 (.f64 z x) #s(literal 2 binary64))))))
(/.f64 (neg.f64 (-.f64 (pow.f64 (.f64 z x) #s(literal 3 binary64)) (pow.f64 (.f64 z y) #s(literal 3 binary64)))) (neg.f64 (+.f64 (pow.f64 (.f64 z x) #s(literal 2 binary64)) (+.f64 (pow.f64 (.f64 z y) #s(literal 2 binary64)) (.f64 (.f64 z x) (*.f64 (neg.f64 z) y))))))
(/.f64 (-.f64 (.f64 (pow.f64 (.f64 z x) #s(literal 2 binary64)) (.f64 z (-.f64 x y))) (.f64 (.f64 z (-.f64 x y)) (pow.f64 (.f64 z y) #s(literal 2 binary64)))) (.f64 (.f64 z (-.f64 x y)) (*.f64 z (-.f64 x y))))
(/.f64 (fma.f64 (pow.f64 (.f64 z x) #s(literal 3 binary64)) (fma.f64 (.f64 z y) (-.f64 (.f64 z y) (.f64 z x)) (pow.f64 (.f64 z x) #s(literal 2 binary64))) (.f64 (fma.f64 (.f64 z y) (-.f64 (.f64 z y) (.f64 z x)) (pow.f64 (.f64 z x) #s(literal 2 binary64))) (pow.f64 (.f64 z y) #s(literal 3 binary64)))) (.f64 (fma.f64 (.f64 z y) (-.f64 (.f64 z y) (.f64 z x)) (pow.f64 (.f64 z x) #s(literal 2 binary64))) (fma.f64 (.f64 z y) (-.f64 (.f64 z y) (.f64 z x)) (pow.f64 (.f64 z x) #s(literal 2 binary64)))))
(/.f64 (.f64 (.f64 (+.f64 y x) (-.f64 x y)) z) (-.f64 x y))
(/.f64 (.f64 (+.f64 (pow.f64 y #s(literal 3 binary64)) (pow.f64 x #s(literal 3 binary64))) z) (fma.f64 y (-.f64 y x) (.f64 x x)))
(/.f64 (.f64 z (.f64 (+.f64 y x) (-.f64 x y))) (-.f64 x y))
(/.f64 (.f64 z (+.f64 (pow.f64 y #s(literal 3 binary64)) (pow.f64 x #s(literal 3 binary64)))) (fma.f64 y (-.f64 y x) (.f64 x x)))
(/.f64 (-.f64 (pow.f64 (.f64 z y) #s(literal 2 binary64)) (pow.f64 (.f64 z x) #s(literal 2 binary64))) (-.f64 (.f64 z y) (.f64 z x)))
(/.f64 (-.f64 (pow.f64 (.f64 z x) #s(literal 3 binary64)) (pow.f64 (.f64 z y) #s(literal 3 binary64))) (+.f64 (pow.f64 (.f64 z x) #s(literal 2 binary64)) (+.f64 (pow.f64 (.f64 z y) #s(literal 2 binary64)) (.f64 (.f64 z x) (*.f64 (neg.f64 z) y)))))
(/.f64 (neg.f64 (-.f64 (pow.f64 (.f64 z x) #s(literal 2 binary64)) (pow.f64 (.f64 z y) #s(literal 2 binary64)))) (neg.f64 (*.f64 z (-.f64 x y))))
(/.f64 (neg.f64 (+.f64 (pow.f64 (.f64 z y) #s(literal 3 binary64)) (pow.f64 (.f64 z x) #s(literal 3 binary64)))) (neg.f64 (+.f64 (pow.f64 (.f64 z y) #s(literal 2 binary64)) (-.f64 (pow.f64 (.f64 z x) #s(literal 2 binary64)) (.f64 (.f64 (*.f64 z x) y) z)))))
(/.f64 (neg.f64 (+.f64 (pow.f64 (.f64 z y) #s(literal 3 binary64)) (pow.f64 (.f64 z x) #s(literal 3 binary64)))) (neg.f64 (fma.f64 (.f64 z y) (-.f64 (.f64 z y) (.f64 z x)) (pow.f64 (.f64 z x) #s(literal 2 binary64)))))
(/.f64 (-.f64 (pow.f64 (.f64 z x) #s(literal 2 binary64)) (pow.f64 (.f64 z y) #s(literal 2 binary64))) (*.f64 z (-.f64 x y)))
(/.f64 (+.f64 (pow.f64 (.f64 z y) #s(literal 3 binary64)) (pow.f64 (.f64 z x) #s(literal 3 binary64))) (+.f64 (pow.f64 (.f64 z y) #s(literal 2 binary64)) (-.f64 (pow.f64 (.f64 z x) #s(literal 2 binary64)) (.f64 (.f64 (*.f64 z x) y) z))))
(/.f64 (+.f64 (pow.f64 (.f64 z y) #s(literal 3 binary64)) (pow.f64 (.f64 z x) #s(literal 3 binary64))) (fma.f64 (.f64 z y) (-.f64 (.f64 z y) (.f64 z x)) (pow.f64 (.f64 z x) #s(literal 2 binary64))))
(fma.f64 z y (*.f64 z x))
(fma.f64 z x (*.f64 z y))
(fma.f64 y z (*.f64 z x))
(fma.f64 x z (*.f64 z y))
(-.f64 (/.f64 (pow.f64 (.f64 z y) #s(literal 2 binary64)) (-.f64 (.f64 z y) (.f64 z x))) (/.f64 (pow.f64 (.f64 z x) #s(literal 2 binary64)) (-.f64 (.f64 z y) (.f64 z x))))
(-.f64 (/.f64 (pow.f64 (.f64 z x) #s(literal 3 binary64)) (+.f64 (pow.f64 (.f64 z x) #s(literal 2 binary64)) (+.f64 (pow.f64 (.f64 z y) #s(literal 2 binary64)) (.f64 (.f64 z x) (.f64 (neg.f64 z) y))))) (/.f64 (pow.f64 (.f64 z y) #s(literal 3 binary64)) (+.f64 (pow.f64 (.f64 z x) #s(literal 2 binary64)) (+.f64 (pow.f64 (.f64 z y) #s(literal 2 binary64)) (.f64 (.f64 z x) (.f64 (neg.f64 z) y))))))
(-.f64 (/.f64 (pow.f64 (.f64 z x) #s(literal 2 binary64)) (.f64 z (-.f64 x y))) (/.f64 (pow.f64 (.f64 z y) #s(literal 2 binary64)) (.f64 z (-.f64 x y))))
(-.f64 (.f64 z x) (.f64 (neg.f64 z) y))
(-.f64 (.f64 z y) (.f64 (neg.f64 x) z))
(+.f64 (/.f64 (pow.f64 (.f64 z x) #s(literal 3 binary64)) (fma.f64 (.f64 z y) (-.f64 (.f64 z y) (.f64 z x)) (pow.f64 (.f64 z x) #s(literal 2 binary64)))) (/.f64 (pow.f64 (.f64 z y) #s(literal 3 binary64)) (fma.f64 (.f64 z y) (-.f64 (.f64 z y) (.f64 z x)) (pow.f64 (.f64 z x) #s(literal 2 binary64)))))
(+.f64 (.f64 z x) (.f64 z y))
(+.f64 (.f64 z y) (.f64 z x))
(/.f64 (neg.f64 (-.f64 (.f64 y y) (.f64 x x))) (neg.f64 (-.f64 y x)))
(/.f64 (neg.f64 (neg.f64 (*.f64 (+.f64 y x) (-.f64 x y)))) (neg.f64 (neg.f64 (-.f64 x y))))
(/.f64 (neg.f64 (neg.f64 (+.f64 (pow.f64 y #s(literal 3 binary64)) (pow.f64 x #s(literal 3 binary64))))) (neg.f64 (neg.f64 (fma.f64 y (-.f64 y x) (*.f64 x x)))))
(/.f64 (-.f64 (.f64 (.f64 x x) (-.f64 x y)) (.f64 (-.f64 x y) (.f64 y y))) (*.f64 (-.f64 x y) (-.f64 x y)))
(/.f64 (fma.f64 (pow.f64 x #s(literal 3 binary64)) (fma.f64 y (-.f64 y x) (.f64 x x)) (.f64 (fma.f64 y (-.f64 y x) (.f64 x x)) (pow.f64 y #s(literal 3 binary64)))) (.f64 (fma.f64 y (-.f64 y x) (.f64 x x)) (fma.f64 y (-.f64 y x) (.f64 x x))))
(/.f64 (-.f64 (.f64 y y) (.f64 x x)) (-.f64 y x))
(/.f64 (neg.f64 (*.f64 (+.f64 y x) (-.f64 x y))) (neg.f64 (-.f64 x y)))
(/.f64 (neg.f64 (+.f64 (pow.f64 y #s(literal 3 binary64)) (pow.f64 x #s(literal 3 binary64)))) (neg.f64 (fma.f64 y y (-.f64 (.f64 x x) (.f64 y x)))))
(/.f64 (neg.f64 (+.f64 (pow.f64 y #s(literal 3 binary64)) (pow.f64 x #s(literal 3 binary64)))) (neg.f64 (fma.f64 y (-.f64 y x) (*.f64 x x))))
(/.f64 (*.f64 (+.f64 y x) (-.f64 x y)) (-.f64 x y))
(/.f64 (+.f64 (pow.f64 y #s(literal 3 binary64)) (pow.f64 x #s(literal 3 binary64))) (fma.f64 y y (-.f64 (.f64 x x) (.f64 y x))))
(/.f64 (+.f64 (pow.f64 y #s(literal 3 binary64)) (pow.f64 x #s(literal 3 binary64))) (fma.f64 y (-.f64 y x) (*.f64 x x)))
(-.f64 (/.f64 (.f64 y y) (-.f64 y x)) (/.f64 (.f64 x x) (-.f64 y x)))
(-.f64 (/.f64 (.f64 x x) (-.f64 x y)) (/.f64 (.f64 y y) (-.f64 x y)))
(+.f64 (/.f64 (pow.f64 x #s(literal 3 binary64)) (fma.f64 y (-.f64 y x) (.f64 x x))) (/.f64 (pow.f64 y #s(literal 3 binary64)) (fma.f64 y (-.f64 y x) (.f64 x x))))
(+.f64 y x)
(+.f64 x y)
x
y
z
#s(approx (* (+ x y) z) (*.f64 z y))
#s(approx (* (+ x y) z) (*.f64 (+.f64 y x) z))
#s(approx (+ x y) y)
#s(approx (+ x y) (+.f64 y x))
#s(approx x x)
#s(approx (* (+ x y) z) (*.f64 z x))
#s(approx (* (+ x y) z) (*.f64 (fma.f64 (/.f64 z x) y z) x))
#s(approx (+ x y) x)
#s(approx (+ x y) (fma.f64 (/.f64 y x) x x))
#s(approx (* (+ x y) z) (*.f64 (neg.f64 x) (neg.f64 (fma.f64 (/.f64 z x) y z))))
#s(approx (+ x y) (*.f64 (neg.f64 x) (fma.f64 #s(literal -1 binary64) (/.f64 y x) #s(literal -1 binary64))))
#s(approx y y)
#s(approx (* (+ x y) z) (*.f64 (fma.f64 (/.f64 z y) x z) y))
#s(approx (+ x y) (fma.f64 (/.f64 x y) y y))
#s(approx (* (+ x y) z) (*.f64 (neg.f64 y) (neg.f64 (fma.f64 (/.f64 z y) x z))))
#s(approx (+ x y) (*.f64 (neg.f64 y) (fma.f64 (/.f64 x y) #s(literal -1 binary64) #s(literal -1 binary64))))
#s(approx (* (+ x y) z) (*.f64 (+.f64 y x) z))
#s(approx z z)

eval7.0ms (0.5%)

Memory: 15.8MiB live, 15.8MiB allocated; 0ms collecting garbage
Compiler: Compiled 1 297 to 224 computations (82.7% saved)

prune3.0ms (0.2%)

Memory

7.5MiB live, 7.5MiB allocated; 0ms collecting garbage

Pruning

3 alts after pruning (2 fresh and 1 done)

	Pruned	Kept	Total
New	72	2	74
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	72	3	75

Accuracy

100.0%

Counts

75 → 3

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(*.f64 (+.f64 x y) z)
▶	51.6%	(*.f64 #s(approx (+ x y) y) z)
▶	54.6%	(*.f64 #s(approx (+ x y) x) z)

Compiler

Compiled 19 to 17 computations (10.5% saved)

series3.0ms (0.3%)

Memory

6.6MiB live, 6.6MiB allocated; 0ms collecting garbage

Counts

7 → 18

Calls

Call 1

Inputs
(*.f64 #s(approx (+ x y) x) z)
#s(approx (+ x y) x)
x
z
(*.f64 #s(approx (+ x y) y) z)
#s(approx (+ x y) y)
y

Outputs
#s(approx (* (+ x y) z) #s(hole binary64 (* y z)))
#s(approx (* (+ x y) z) #s(hole binary64 (+ (* x z) (* y z))))
#s(approx (+ x y) #s(hole binary64 y))
#s(approx (+ x y) #s(hole binary64 (+ x y)))
#s(approx x #s(hole binary64 x))
#s(approx (* (+ x y) z) #s(hole binary64 (* x z)))
#s(approx (* (+ x y) z) #s(hole binary64 (* x (+ z (/ (* y z) x)))))
#s(approx (+ x y) #s(hole binary64 x))
#s(approx (+ x y) #s(hole binary64 (* x (+ 1 (/ y x)))))
#s(approx (* (+ x y) z) #s(hole binary64 (* -1 (* x (+ (* -1 z) (* -1 (/ (* y z) x)))))))
#s(approx (+ x y) #s(hole binary64 (* -1 (* x (- (* -1 (/ y x)) 1)))))
#s(approx y #s(hole binary64 y))
#s(approx (* (+ x y) z) #s(hole binary64 (* y (+ z (/ (* x z) y)))))
#s(approx (+ x y) #s(hole binary64 (* y (+ 1 (/ x y)))))
#s(approx (* (+ x y) z) #s(hole binary64 (* -1 (* y (+ (* -1 z) (* -1 (/ (* x z) y)))))))
#s(approx (+ x y) #s(hole binary64 (* -1 (* y (- (* -1 (/ x y)) 1)))))
#s(approx (* (+ x y) z) #s(hole binary64 (* z (+ x y))))
#s(approx z #s(hole binary64 z))

Calls

9 calls:

Time	Variable		Point	Expression
1.0ms	y	@	-inf	((* (+ x y) z) (+ x y) x z (* (+ x y) z) (+ x y) y)
0.0ms	z	@	-inf	((* (+ x y) z) (+ x y) x z (* (+ x y) z) (+ x y) y)
0.0ms	x	@	-inf	((* (+ x y) z) (+ x y) x z (* (+ x y) z) (+ x y) y)
0.0ms	z	@	inf	((* (+ x y) z) (+ x y) x z (* (+ x y) z) (+ x y) y)
0.0ms	x	@	inf	((* (+ x y) z) (+ x y) x z (* (+ x y) z) (+ x y) y)

rewrite158.0ms (12.6%)

Memory

-7.4MiB live, 194.3MiB allocated; 40ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	60	219
0	62	207
1	283	205
2	2228	205
0	8221	199

Stop Event

1×	iter limit
1×	node limit
1×	iter limit

Counts

25 → 27

Calls

Call 1

Inputs
(*.f64 #s(approx (+ x y) x) z)
#s(approx (+ x y) x)
x
z
(*.f64 #s(approx (+ x y) y) z)
#s(approx (+ x y) y)
y
#s(approx (* (+ x y) z) #s(hole binary64 (* y z)))
#s(approx (* (+ x y) z) #s(hole binary64 (+ (* x z) (* y z))))
#s(approx (+ x y) #s(hole binary64 y))
#s(approx (+ x y) #s(hole binary64 (+ x y)))
#s(approx x #s(hole binary64 x))
#s(approx (* (+ x y) z) #s(hole binary64 (* x z)))
#s(approx (* (+ x y) z) #s(hole binary64 (* x (+ z (/ (* y z) x)))))
#s(approx (+ x y) #s(hole binary64 x))
#s(approx (+ x y) #s(hole binary64 (* x (+ 1 (/ y x)))))
#s(approx (* (+ x y) z) #s(hole binary64 (* -1 (* x (+ (* -1 z) (* -1 (/ (* y z) x)))))))
#s(approx (+ x y) #s(hole binary64 (* -1 (* x (- (* -1 (/ y x)) 1)))))
#s(approx y #s(hole binary64 y))
#s(approx (* (+ x y) z) #s(hole binary64 (* y (+ z (/ (* x z) y)))))
#s(approx (+ x y) #s(hole binary64 (* y (+ 1 (/ x y)))))
#s(approx (* (+ x y) z) #s(hole binary64 (* -1 (* y (+ (* -1 z) (* -1 (/ (* x z) y)))))))
#s(approx (+ x y) #s(hole binary64 (* -1 (* y (- (* -1 (/ x y)) 1)))))
#s(approx (* (+ x y) z) #s(hole binary64 (* z (+ x y))))
#s(approx z #s(hole binary64 z))

Outputs
(*.f64 z #s(approx (+ x y) x))
(*.f64 #s(approx (+ x y) x) z)
#s(approx (+ x y) x)
x
z
(*.f64 #s(approx (+ x y) y) z)
(*.f64 z #s(approx (+ x y) y))
#s(approx (+ x y) y)
y
#s(approx (* (+ x y) z) (*.f64 z y))
#s(approx (* (+ x y) z) (*.f64 z (+.f64 y x)))
#s(approx (+ x y) y)
#s(approx (+ x y) (+.f64 y x))
#s(approx x x)
#s(approx (* (+ x y) z) (*.f64 z x))
#s(approx (* (+ x y) z) (*.f64 (fma.f64 (/.f64 z x) y z) x))
#s(approx (+ x y) x)
#s(approx (+ x y) (fma.f64 (/.f64 y x) x x))
#s(approx (* (+ x y) z) (*.f64 (neg.f64 x) (neg.f64 (fma.f64 (/.f64 z x) y z))))
#s(approx (+ x y) (*.f64 (neg.f64 x) (fma.f64 #s(literal -1 binary64) (/.f64 y x) #s(literal -1 binary64))))
#s(approx y y)
#s(approx (* (+ x y) z) (*.f64 (fma.f64 (/.f64 z y) x z) y))
#s(approx (+ x y) (fma.f64 (/.f64 x y) y y))
#s(approx (* (+ x y) z) (*.f64 (neg.f64 y) (neg.f64 (fma.f64 (/.f64 z y) x z))))
#s(approx (+ x y) (*.f64 (neg.f64 y) (fma.f64 (/.f64 x y) #s(literal -1 binary64) #s(literal -1 binary64))))
#s(approx (* (+ x y) z) (*.f64 z (+.f64 y x)))
#s(approx z z)

eval2.0ms (0.2%)

Memory: 4.6MiB live, 4.6MiB allocated; 0ms collecting garbage
Compiler: Compiled 258 to 62 computations (76% saved)

prune48.0ms (3.9%)

Memory

-47.9MiB live, 9.5MiB allocated; 10ms collecting garbage

Pruning

3 alts after pruning (0 fresh and 3 done)

	Pruned	Kept	Total
New	26	0	26
Fresh	0	0	0
Picked	0	2	2
Done	0	1	1
Total	26	3	29

Accuracy

100.0%

Counts

29 → 3

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(*.f64 (+.f64 x y) z)
✓	51.6%	(*.f64 #s(approx (+ x y) y) z)
✓	54.6%	(*.f64 #s(approx (+ x y) x) z)

Compiler

Compiled 38 to 27 computations (28.9% saved)

regimes8.0ms (0.7%)

Memory

22.4MiB live, 22.4MiB allocated; 0ms collecting garbage

Counts

3 → 1

Calls

Call 1

Inputs
(*.f64 #s(approx (+ x y) x) z)
(*.f64 #s(approx (+ x y) y) z)
(*.f64 (+.f64 x y) z)

Outputs
(*.f64 (+.f64 x y) z)

Calls

5 calls:

2.0ms	(+.f64 x y)
2.0ms	x
2.0ms	z
2.0ms	y
1.0ms	(*.f64 (+.f64 x y) z)

Results

Accuracy	Segments	Branch
100.0%	1	`(+.f64 x y)`
100.0%	1	`(*.f64 (+.f64 x y) z)`
100.0%	1	`x`
100.0%	1	`y`
100.0%	1	`z`

Compiler

Compiled 11 to 18 computations (-63.6% saved)

regimes7.0ms (0.5%)

Memory

17.2MiB live, 17.2MiB allocated; 0ms collecting garbage

Counts

2 → 2

Calls

Call 1

Inputs
(*.f64 #s(approx (+ x y) x) z)
(*.f64 #s(approx (+ x y) y) z)

Outputs
(*.f64 #s(approx (+ x y) x) z)
(*.f64 #s(approx (+ x y) y) z)

Calls

5 calls:

1.0ms	y
1.0ms	z
1.0ms	x
1.0ms	(+.f64 x y)
1.0ms	(*.f64 (+.f64 x y) z)

Results

Accuracy	Segments	Branch
97.8%	2	`(+.f64 x y)`
97.8%	2	`(*.f64 (+.f64 x y) z)`
83.9%	2	`x`
82.4%	2	`y`
62.2%	2	`z`

Compiler

Compiled 11 to 18 computations (-63.6% saved)

regimes48.0ms (3.8%)

Memory

-29.3MiB live, 14.9MiB allocated; 5ms collecting garbage

Accuracy

Total -0.0b remaining (-0%)

Threshold costs -0b (-0%)

Counts

1 → 1

Calls

Call 1

Inputs
(*.f64 #s(approx (+ x y) x) z)

Outputs
(*.f64 #s(approx (+ x y) x) z)

Calls

5 calls:

44.0ms	(*.f64 (+.f64 x y) z)
1.0ms	(+.f64 x y)
1.0ms	x
1.0ms	y
1.0ms	z

Results

Accuracy	Segments	Branch
54.6%	1	`z`
54.6%	1	`y`
54.6%	1	`x`
54.6%	1	`(+.f64 x y)`
54.6%	1	`(*.f64 (+.f64 x y) z)`

Compiler

Compiled 11 to 18 computations (-63.6% saved)

bsearch0.0ms (0%)

Memory

0.7MiB live, 0.7MiB allocated; 0ms collecting garbage

Algorithm

1×	left-value

Steps

Time	Left	Right
0.0ms	-1.5980745292721949e-307	0.0

Compiler

Compiled 8 to 11 computations (-37.5% saved)

simplify9.0ms (0.7%)

Memory

16.1MiB live, 16.1MiB allocated; 0ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	13	34
1	14	34

Stop Event

1×

saturated

Calls

Call 1

Inputs

(*.f64 (+.f64 x y) z)

(if (<=.f64 (*.f64 (+.f64 x y) z) #s(literal -5060056332682765/50600563326827654588123836679729326762389162441035529589225339506857584891998836722990095925359281123796769466079202977847452184346448369216753349985184627480379356069141590341116726935523304085309941919618186267140501870856173174654525838912289889085202514128089692388083353653807625633046581877161501565826926935273373696 binary64)) (*.f64 #s(approx (+ x y) x) z) (*.f64 #s(approx (+ x y) y) z))

(*.f64 #s(approx (+ x y) x) z)

Outputs

(*.f64 (+.f64 x y) z)

(if (<=.f64 (*.f64 (+.f64 x y) z) #s(literal -5060056332682765/50600563326827654588123836679729326762389162441035529589225339506857584891998836722990095925359281123796769466079202977847452184346448369216753349985184627480379356069141590341116726935523304085309941919618186267140501870856173174654525838912289889085202514128089692388083353653807625633046581877161501565826926935273373696 binary64)) (*.f64 #s(approx (+ x y) x) z) (*.f64 #s(approx (+ x y) y) z))

(*.f64 #s(approx (+ x y) x) z)

derivations62.0ms (5%)

Memory

-20.1MiB live, 69.9MiB allocated; 18ms collecting garbage

Stop Event

1×

done

Compiler

Compiled 34 to 13 computations (61.8% saved)

preprocess26.0ms (2.1%)

Memory

0.2MiB live, 56.1MiB allocated; 9ms collecting garbage

Remove

(sort x y)

(negabs z)

Compiler

Compiled 118 to 76 computations (35.6% saved)

end0.0ms (0%)

Memory: 0.0MiB live, 0.0MiB allocated; 0ms collecting garbage

Iter	Nodes	Cost
0	22	55
1	43	55
2	97	55
3	229	51
4	317	51
5	421	51
6	497	51
7	575	51
8	615	51
9	625	51
0	5	5
0	7	5
1	9	5
2	17	5
3	32	5
4	53	5
5	82	5
6	102	5
7	134	5
8	152	5
9	172	5
10	182	5
0	182	5

Iter	Nodes	Cost
0	22	55
1	43	55
2	97	55
3	229	51
4	317	51
5	421	51
6	497	51
7	575	51
8	615	51
9	625	51
0	5	5
0	7	5
1	9	5
2	17	5
3	32	5
4	53	5
5	82	5
6	102	5
7	134	5
8	152	5
9	172	5
10	182	5
0	182	5

start0.0ms (0%)

analyze0.0ms (0%)

sample631.0ms (50.4%)

explain47.0ms (3.7%)

preprocess24.0ms (1.9%)

eval0.0ms (0%)

prune0.0ms (0%)

series5.0ms (0.4%)

rewrite162.0ms (13%)

eval7.0ms (0.5%)

prune3.0ms (0.2%)

series3.0ms (0.3%)

rewrite158.0ms (12.6%)

eval2.0ms (0.2%)

prune48.0ms (3.9%)

regimes8.0ms (0.7%)

regimes7.0ms (0.5%)

regimes48.0ms (3.8%)

bsearch0.0ms (0%)

simplify9.0ms (0.7%)

derivations62.0ms (5%)

preprocess26.0ms (2.1%)

end0.0ms (0%)

Profiling

Iter	Nodes	Cost
0	22	55
1	43	55
2	97	55
3	229	51
4	317	51
5	421	51
6	497	51
7	575	51
8	615	51
9	625	51
0	5	5
0	7	5
1	9	5
2	17	5
3	32	5
4	53	5
5	82	5
6	102	5
7	134	5
8	152	5
9	172	5
10	182	5
0	182	5