Metrics for Optimisation.CirclePacking:place from circle-packing-0.1.0.4, I

start0.0ms (0%)

Memory: 0.0MiB live, 0.0MiB 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)

sample584.0ms (32.8%)

Memory

-5.8MiB live, 714.6MiB allocated; 224ms collecting garbage

Samples

289.0ms	8 251×	0	valid
0.0ms	4×	1	valid
0.0ms	1×	2	valid

Precisions

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

ival-add!: 79.0ms (97.7% of total)

adjust: 2.0ms (2.5% of total)

Bogosity

preprocess16.0ms (0.9%)

Memory

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

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	22	55
1	63	50
2	193	50
3	305	50

Stop Event

1×

saturated

Alt Table

Click to see full alt table

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

Symmetry

(sort x y z)

Compiler

Compiled 10 to 10 computations (0% saved)

series16.0ms (0.9%)

Memory

-14.0MiB live, 30.1MiB allocated; 14ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	69	207

Stop Event

1×	iter-limit

Counts

5 → 17

Calls

Call 1

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

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

Calls

9 calls:

Time	Variable	Point
6.0ms	y	-inf
1.0ms	z	-inf
0.0ms	x	-inf
0.0ms	x	inf
0.0ms	y	inf

rewrite279.0ms (15.7%)

Memory

14.5MiB live, 202.1MiB allocated; 36ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	5	11
0	7	11
1	47	11
2	151	11
3	490	11
4	859	11
5	1219	11
6	3899	11
0	4294	11

Stop Event

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

Counts

5 → 69

Calls

Call 1

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

Outputs
(*.f64 (-.f64 #s(literal 1 binary64) (/.f64 (neg.f64 x) (+.f64 z y))) (+.f64 z y))
(*.f64 (-.f64 #s(literal 1 binary64) (/.f64 (-.f64 (neg.f64 x) z) y)) y)
(*.f64 (+.f64 #s(literal 1 binary64) (/.f64 y (+.f64 z x))) (+.f64 z x))
(*.f64 (+.f64 #s(literal 1 binary64) (/.f64 x (+.f64 z y))) (+.f64 z y))
(*.f64 (+.f64 #s(literal 1 binary64) (/.f64 (+.f64 z x) y)) y)
(*.f64 (-.f64 #s(literal 1 binary64) (/.f64 (neg.f64 y) (+.f64 z x))) (+.f64 z x))
(*.f64 (-.f64 #s(literal 1 binary64) (/.f64 (-.f64 (neg.f64 y) x) z)) z)
(*.f64 (-.f64 #s(literal 1 binary64) (/.f64 (-.f64 (neg.f64 y) z) x)) x)
(*.f64 (+.f64 #s(literal 1 binary64) (/.f64 (+.f64 y x) z)) z)
(*.f64 (+.f64 #s(literal 1 binary64) (/.f64 (+.f64 z y) x)) x)
(*.f64 (-.f64 #s(literal 1 binary64) (/.f64 (neg.f64 z) (+.f64 y x))) (+.f64 y x))
(*.f64 (+.f64 #s(literal 1 binary64) (/.f64 z (+.f64 y x))) (+.f64 y x))
(/.f64 (-.f64 (.f64 (+.f64 z y) (+.f64 z y)) (.f64 (neg.f64 x) (neg.f64 x))) (+.f64 (+.f64 z y) (neg.f64 x)))
(/.f64 (-.f64 (.f64 y y) (.f64 (-.f64 (neg.f64 x) z) (-.f64 (neg.f64 x) z))) (+.f64 y (-.f64 (neg.f64 x) z)))
(/.f64 (-.f64 (pow.f64 (+.f64 z y) #s(literal 3 binary64)) (pow.f64 (neg.f64 x) #s(literal 3 binary64))) (fma.f64 (+.f64 z y) (+.f64 z y) (fma.f64 (neg.f64 x) (neg.f64 x) (*.f64 (+.f64 z y) (neg.f64 x)))))
(/.f64 (-.f64 (pow.f64 y #s(literal 3 binary64)) (pow.f64 (-.f64 (neg.f64 x) z) #s(literal 3 binary64))) (fma.f64 y y (fma.f64 (-.f64 (neg.f64 x) z) (-.f64 (neg.f64 x) z) (*.f64 y (-.f64 (neg.f64 x) z)))))
(/.f64 (-.f64 (.f64 (+.f64 z x) (+.f64 z x)) (.f64 y y)) (-.f64 (+.f64 z x) y))
(/.f64 (-.f64 (.f64 (+.f64 z y) (+.f64 z y)) (.f64 x x)) (-.f64 (+.f64 z y) x))
(/.f64 (-.f64 (.f64 y y) (.f64 (+.f64 z x) (+.f64 z x))) (-.f64 y (+.f64 z x)))
(/.f64 (-.f64 (.f64 (+.f64 z x) (+.f64 z x)) (.f64 (neg.f64 y) (neg.f64 y))) (+.f64 (+.f64 z x) (neg.f64 y)))
(/.f64 (-.f64 (.f64 z z) (.f64 (-.f64 (neg.f64 y) x) (-.f64 (neg.f64 y) x))) (+.f64 z (-.f64 (neg.f64 y) x)))
(/.f64 (-.f64 (.f64 x x) (.f64 (-.f64 (neg.f64 y) z) (-.f64 (neg.f64 y) z))) (+.f64 x (-.f64 (neg.f64 y) z)))
(/.f64 (+.f64 (pow.f64 (+.f64 z x) #s(literal 3 binary64)) (pow.f64 y #s(literal 3 binary64))) (fma.f64 (+.f64 z x) (+.f64 z x) (-.f64 (.f64 y y) (.f64 (+.f64 z x) y))))
(/.f64 (+.f64 (pow.f64 (+.f64 z y) #s(literal 3 binary64)) (pow.f64 x #s(literal 3 binary64))) (fma.f64 (+.f64 z y) (+.f64 z y) (-.f64 (.f64 x x) (.f64 (+.f64 z y) x))))
(/.f64 (+.f64 (pow.f64 y #s(literal 3 binary64)) (pow.f64 (+.f64 z x) #s(literal 3 binary64))) (fma.f64 y y (-.f64 (.f64 (+.f64 z x) (+.f64 z x)) (.f64 y (+.f64 z x)))))
(/.f64 (-.f64 (pow.f64 (+.f64 z x) #s(literal 3 binary64)) (pow.f64 (neg.f64 y) #s(literal 3 binary64))) (fma.f64 (+.f64 z x) (+.f64 z x) (fma.f64 (neg.f64 y) (neg.f64 y) (*.f64 (+.f64 z x) (neg.f64 y)))))
(/.f64 (-.f64 (pow.f64 z #s(literal 3 binary64)) (pow.f64 (-.f64 (neg.f64 y) x) #s(literal 3 binary64))) (fma.f64 z z (fma.f64 (-.f64 (neg.f64 y) x) (-.f64 (neg.f64 y) x) (*.f64 z (-.f64 (neg.f64 y) x)))))
(/.f64 (-.f64 (pow.f64 x #s(literal 3 binary64)) (pow.f64 (-.f64 (neg.f64 y) z) #s(literal 3 binary64))) (fma.f64 x x (fma.f64 (-.f64 (neg.f64 y) z) (-.f64 (neg.f64 y) z) (*.f64 x (-.f64 (neg.f64 y) z)))))
(/.f64 (-.f64 (.f64 z z) (.f64 (+.f64 y x) (+.f64 y x))) (-.f64 z (+.f64 y x)))
(/.f64 (-.f64 (.f64 x x) (.f64 (+.f64 z y) (+.f64 z y))) (-.f64 x (+.f64 z y)))
(/.f64 (-.f64 (.f64 (+.f64 y x) (+.f64 y x)) (.f64 (neg.f64 z) (neg.f64 z))) (+.f64 (+.f64 y x) (neg.f64 z)))
(/.f64 (+.f64 (pow.f64 z #s(literal 3 binary64)) (pow.f64 (+.f64 y x) #s(literal 3 binary64))) (fma.f64 z z (-.f64 (.f64 (+.f64 y x) (+.f64 y x)) (.f64 z (+.f64 y x)))))
(/.f64 (+.f64 (pow.f64 x #s(literal 3 binary64)) (pow.f64 (+.f64 z y) #s(literal 3 binary64))) (fma.f64 x x (-.f64 (.f64 (+.f64 z y) (+.f64 z y)) (.f64 x (+.f64 z y)))))
(/.f64 (-.f64 (pow.f64 (+.f64 y x) #s(literal 3 binary64)) (pow.f64 (neg.f64 z) #s(literal 3 binary64))) (fma.f64 (+.f64 y x) (+.f64 y x) (fma.f64 (neg.f64 z) (neg.f64 z) (*.f64 (+.f64 y x) (neg.f64 z)))))
(/.f64 (-.f64 (.f64 (+.f64 y x) (+.f64 y x)) (.f64 z z)) (-.f64 (+.f64 y x) z))
(/.f64 (+.f64 (pow.f64 (+.f64 y x) #s(literal 3 binary64)) (pow.f64 z #s(literal 3 binary64))) (fma.f64 (+.f64 y x) (+.f64 y x) (-.f64 (.f64 z z) (.f64 (+.f64 y x) z))))
(neg.f64 (-.f64 (-.f64 (neg.f64 y) x) z))
(-.f64 (+.f64 z x) (neg.f64 y))
(-.f64 (+.f64 z y) (neg.f64 x))
(-.f64 z (-.f64 (neg.f64 y) x))
(-.f64 (+.f64 y x) (neg.f64 z))
(-.f64 y (-.f64 (neg.f64 x) z))
(-.f64 x (-.f64 (neg.f64 y) z))
(+.f64 (+.f64 z x) y)
(+.f64 (+.f64 z y) x)
(+.f64 z (+.f64 y x))
(+.f64 (+.f64 y x) z)
(+.f64 y (+.f64 z x))
(+.f64 x (+.f64 z y))
(*.f64 (-.f64 #s(literal 1 binary64) (/.f64 (neg.f64 x) y)) y)
(*.f64 (+.f64 #s(literal 1 binary64) (/.f64 x y)) y)
(*.f64 (-.f64 #s(literal 1 binary64) (/.f64 (neg.f64 y) x)) x)
(*.f64 (+.f64 #s(literal 1 binary64) (/.f64 y x)) x)
(/.f64 (-.f64 (.f64 y y) (.f64 (neg.f64 x) (neg.f64 x))) (+.f64 y (neg.f64 x)))
(/.f64 (-.f64 (pow.f64 y #s(literal 3 binary64)) (pow.f64 (neg.f64 x) #s(literal 3 binary64))) (fma.f64 y y (fma.f64 (neg.f64 x) (neg.f64 x) (*.f64 y (neg.f64 x)))))
(/.f64 (-.f64 (.f64 y y) (.f64 x x)) (-.f64 y x))
(/.f64 (-.f64 (.f64 x x) (.f64 (neg.f64 y) (neg.f64 y))) (+.f64 x (neg.f64 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 x #s(literal 3 binary64)) (pow.f64 (neg.f64 y) #s(literal 3 binary64))) (fma.f64 x x (fma.f64 (neg.f64 y) (neg.f64 y) (*.f64 x (neg.f64 y)))))
(/.f64 (-.f64 (.f64 x x) (.f64 y y)) (-.f64 x y))
(/.f64 (+.f64 (pow.f64 x #s(literal 3 binary64)) (pow.f64 y #s(literal 3 binary64))) (fma.f64 x x (-.f64 (.f64 y y) (.f64 x y))))
(neg.f64 (-.f64 (neg.f64 y) x))
(-.f64 y (neg.f64 x))
(-.f64 x (neg.f64 y))
(+.f64 y x)
(+.f64 x y)
x
y
z

eval34.0ms (1.9%)

Memory: -19.8MiB live, 25.7MiB allocated; 6ms collecting garbage
Compiler: Compiled 1 184 to 317 computations (73.2% saved)

prune2.0ms (0.1%)

Memory

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

Pruning

3 alts after pruning (2 fresh and 1 done)

	Pruned	Kept	Total
New	80	2	82
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	80	3	83

Accuracy

100.0%

Counts

83 → 3

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(+.f64 (+.f64 x y) z)
▶	52.0%	(+.f64 #s(approx (+ x y) y) z)
▶	97.1%	#s(approx (+ (+ x y) z) (+.f64 x z))

Compiler

Compiled 21 to 18 computations (14.3% saved)

series6.0ms (0.3%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	85	259

Stop Event

1×	iter-limit

Counts

7 → 21

Calls

Call 1

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

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

Calls

9 calls:

Time	Variable	Point
0.0ms	x	-inf
0.0ms	z	-inf
0.0ms	y	-inf
0.0ms	x	inf
0.0ms	z	inf

rewrite126.0ms (7.1%)

Memory

-14.2MiB live, 137.7MiB allocated; 43ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	9	27
0	11	27
1	79	27
2	232	27
3	586	27
4	974	27
5	1334	27
0	4014	27

Stop Event

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

Counts

7 → 40

Calls

Call 1

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

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

eval6.0ms (0.3%)

Memory: 18.4MiB live, 18.4MiB allocated; 0ms collecting garbage
Compiler: Compiled 922 to 228 computations (75.3% saved)

prune5.0ms (0.3%)

Memory

-39.8MiB live, 6.2MiB allocated; 4ms collecting garbage

Pruning

4 alts after pruning (1 fresh and 3 done)

	Pruned	Kept	Total
New	53	1	54
Fresh	0	0	0
Picked	0	2	2
Done	0	1	1
Total	53	4	57

Accuracy

100.0%

Counts

57 → 4

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(+.f64 (+.f64 x y) z)
✓	52.0%	(+.f64 #s(approx (+ x y) y) z)
✓	97.1%	#s(approx (+ (+ x y) z) (+.f64 x z))
▶	49.4%	#s(approx (+ (+ x y) z) #s(approx (+ x z) z))

Compiler

Compiled 32 to 26 computations (18.8% saved)

series4.0ms (0.2%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	69	215

Stop Event

1×	iter-limit

Counts

3 → 17

Calls

Call 1

Inputs
#s(approx (+ (+ x y) z) #s(approx (+ x z) z))
#s(approx (+ x z) z)
z

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

Calls

9 calls:

Time	Variable	Point
0.0ms	z	-inf
0.0ms	z	inf
0.0ms	x	-inf
0.0ms	x	inf
0.0ms	y	-inf

rewrite284.0ms (16%)

Memory

13.6MiB live, 153.4MiB allocated; 24ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	8	17
0	8	17
1	61	17
2	187	17
3	496	17
4	843	17
5	1192	17
6	3872	17
0	4267	17

Stop Event

1×	iter-limit
1×	node-limit
1×	saturated

Counts

3 → 3

Calls

Call 1

Inputs
#s(approx (+ (+ x y) z) #s(approx (+ x z) z))
#s(approx (+ x z) z)
z

Outputs
#s(approx (+ (+ x y) z) #s(approx (+ x z) z))
#s(approx (+ x z) z)
z

eval2.0ms (0.1%)

Memory: 2.9MiB live, 2.9MiB allocated; 0ms collecting garbage
Compiler: Compiled 240 to 75 computations (68.8% saved)

prune2.0ms (0.1%)

Memory

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

Pruning

7 alts after pruning (3 fresh and 4 done)

	Pruned	Kept	Total
New	13	3	16
Fresh	0	0	0
Picked	0	1	1
Done	0	3	3
Total	13	7	20

Accuracy

100.0%

Counts

20 → 7

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(+.f64 (+.f64 x y) z)
✓	52.0%	(+.f64 #s(approx (+ x y) y) z)
✓	97.1%	#s(approx (+ (+ x y) z) (+.f64 x z))
▶	50.8%	#s(approx (+ (+ x y) z) (+.f64 x y))
✓	49.4%	#s(approx (+ (+ x y) z) #s(approx (+ x z) z))
▶	4.6%	#s(approx (+ (+ x y) z) y)
▶	48.6%	#s(approx (+ (+ x y) z) x)

Compiler

Compiled 55 to 45 computations (18.2% saved)

series6.0ms (0.3%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	69	211

Stop Event

1×	iter-limit

Counts

6 → 17

Calls

Call 1

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

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

Calls

9 calls:

Time	Variable	Point
0.0ms	x	-inf
0.0ms	y	-inf
0.0ms	x	inf
0.0ms	y	inf
0.0ms	z	-inf

rewrite262.0ms (14.7%)

Memory

-20.8MiB live, 119.5MiB allocated; 22ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	9	28
0	10	28
1	50	28
2	154	28
3	485	28
4	854	28
5	1214	28
6	3894	28
0	4289	28

Stop Event

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

Counts

6 → 22

Calls

Call 1

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

Outputs
#s(approx (+ (+ x y) z) x)
x
#s(approx (+ (+ x y) z) y)
y
#s(approx (+ (+ x y) z) (+.f64 y x))
(*.f64 (-.f64 #s(literal 1 binary64) (/.f64 (neg.f64 x) y)) y)
(*.f64 (+.f64 #s(literal 1 binary64) (/.f64 x y)) y)
(*.f64 (-.f64 #s(literal 1 binary64) (/.f64 (neg.f64 y) x)) x)
(*.f64 (+.f64 #s(literal 1 binary64) (/.f64 y x)) x)
(/.f64 (-.f64 (.f64 y y) (.f64 (neg.f64 x) (neg.f64 x))) (+.f64 y (neg.f64 x)))
(/.f64 (-.f64 (pow.f64 y #s(literal 3 binary64)) (pow.f64 (neg.f64 x) #s(literal 3 binary64))) (fma.f64 y y (fma.f64 (neg.f64 x) (neg.f64 x) (*.f64 y (neg.f64 x)))))
(/.f64 (-.f64 (.f64 y y) (.f64 x x)) (-.f64 y x))
(/.f64 (-.f64 (.f64 x x) (.f64 (neg.f64 y) (neg.f64 y))) (+.f64 x (neg.f64 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 x #s(literal 3 binary64)) (pow.f64 (neg.f64 y) #s(literal 3 binary64))) (fma.f64 x x (fma.f64 (neg.f64 y) (neg.f64 y) (*.f64 x (neg.f64 y)))))
(/.f64 (-.f64 (.f64 x x) (.f64 y y)) (-.f64 x y))
(/.f64 (+.f64 (pow.f64 x #s(literal 3 binary64)) (pow.f64 y #s(literal 3 binary64))) (fma.f64 x x (-.f64 (.f64 y y) (.f64 x y))))
(neg.f64 (-.f64 (neg.f64 y) x))
(-.f64 y (neg.f64 x))
(-.f64 x (neg.f64 y))
(+.f64 y x)
(+.f64 x y)

eval3.0ms (0.2%)

Memory: 9.4MiB live, 9.4MiB allocated; 0ms collecting garbage
Compiler: Compiled 534 to 150 computations (71.9% saved)

prune2.0ms (0.1%)

Memory

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

Pruning

7 alts after pruning (0 fresh and 7 done)

	Pruned	Kept	Total
New	34	0	34
Fresh	0	0	0
Picked	0	3	3
Done	0	4	4
Total	34	7	41

Accuracy

100.0%

Counts

41 → 7

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(+.f64 (+.f64 x y) z)
✓	52.0%	(+.f64 #s(approx (+ x y) y) z)
✓	97.1%	#s(approx (+ (+ x y) z) (+.f64 x z))
✓	50.8%	#s(approx (+ (+ x y) z) (+.f64 x y))
✓	49.4%	#s(approx (+ (+ x y) z) #s(approx (+ x z) z))
✓	4.6%	#s(approx (+ (+ x y) z) y)
✓	48.6%	#s(approx (+ (+ x y) z) x)

Compiler

Compiled 55 to 45 computations (18.2% saved)

regimes71.0ms (4%)

Memory

0.6MiB live, 193.7MiB allocated; 16ms collecting garbage

Accuracy

Total -29.1b remaining (-73.2%)

Threshold costs -29.1b (-73.2%)

Counts

2 → 1

3 → 2

4 → 2

5 → 1

6 → 2

7 → 1

Calls

Call 1

Inputs
#s(approx (+ (+ x y) z) x)
#s(approx (+ (+ x y) z) y)

Outputs
#s(approx (+ (+ x y) z) x)

Call 2

Inputs
#s(approx (+ (+ x y) z) x)
#s(approx (+ (+ x y) z) y)
#s(approx (+ (+ x y) z) #s(approx (+ x z) z))

Outputs
#s(approx (+ (+ x y) z) x)
#s(approx (+ (+ x y) z) #s(approx (+ x z) z))

Call 3

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

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

Call 4

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

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

Call 5

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

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

Call 6

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

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

Calls

26 calls:

11.0ms	y
6.0ms	y
5.0ms	y
3.0ms	(+.f64 (+.f64 x y) z)
3.0ms	x

Results

Accuracy	Segments	Branch
48.6%	1	`y`
48.6%	1	`x`
48.6%	1	`(+.f64 x y)`
48.6%	1	`z`
48.6%	1	`(+.f64 (+.f64 x y) z)`
96.1%	2	`(+.f64 (+.f64 x y) z)`
80.2%	2	`(+.f64 x y)`
97.2%	2	`(+.f64 (+.f64 x y) z)`
78.3%	2	`x`
77.4%	2	`y`
82.4%	2	`z`
97.1%	1	`x`
97.1%	1	`y`
97.1%	1	`z`
97.1%	1	`(+.f64 x y)`
97.1%	1	`(+.f64 (+.f64 x y) z)`
98.7%	2	`(+.f64 x y)`
98.9%	2	`(+.f64 (+.f64 x y) z)`
97.1%	1	`x`
97.1%	1	`y`
97.1%	1	`z`
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 115 to 112 computations (2.6% saved)

bsearch1.0ms (0%)

Memory

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

Algorithm

1×	left-value

Steps

Time	Left	Right
0.0ms	-9.874712711973603e-225	1.949878037945224e-213

Compiler

Compiled 8 to 11 computations (-37.5% saved)

bsearch0.0ms (0%)

Memory

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

Algorithm

1×	left-value

Steps

Time	Left	Right
0.0ms	-9.874712711973603e-225	1.949878037945224e-213

Compiler

Compiled 8 to 11 computations (-37.5% saved)

bsearch0.0ms (0%)

Memory

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

Algorithm

1×	left-value

Steps

Time	Left	Right
0.0ms	-9.874712711973603e-225	1.949878037945224e-213

Compiler

Compiled 8 to 11 computations (-37.5% saved)

derivations5.0ms (0.3%)

Memory

-34.8MiB live, 11.4MiB allocated; 4ms collecting garbage

Stop Event

1×

done

Compiler

Compiled 99 to 21 computations (78.8% saved)

preprocess64.0ms (3.6%)

Memory: 13.3MiB live, 211.7MiB allocated; 32ms collecting garbage
Compiler: Compiled 302 to 144 computations (52.3% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample584.0ms (32.8%)

preprocess16.0ms (0.9%)

series16.0ms (0.9%)

rewrite279.0ms (15.7%)

eval34.0ms (1.9%)

prune2.0ms (0.1%)

series6.0ms (0.3%)

rewrite126.0ms (7.1%)

eval6.0ms (0.3%)

prune5.0ms (0.3%)

series4.0ms (0.2%)

rewrite284.0ms (16%)

eval2.0ms (0.1%)

prune2.0ms (0.1%)

series6.0ms (0.3%)

rewrite262.0ms (14.7%)

eval3.0ms (0.2%)

prune2.0ms (0.1%)

regimes71.0ms (4%)

bsearch1.0ms (0%)

bsearch0.0ms (0%)

bsearch0.0ms (0%)

derivations5.0ms (0.3%)

preprocess64.0ms (3.6%)

end0.0ms (0%)

Profiling