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.5MiB live, 0.5MiB 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)

sample526.0ms (25.7%)

Memory

34.1MiB live, 591.8MiB allocated; 120ms collecting garbage

Samples

310.0ms	8 253×	0	valid
0.0ms	3×	1	valid

Precisions

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

ival-add!: 63.0ms (97% of total)

adjust: 1.0ms (1.5% of total)

Bogosity

preprocess21.0ms (1%)

Memory

-12.5MiB live, 34.1MiB allocated; 8ms 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)

series9.0ms (0.4%)

Memory

-30.9MiB live, 15.4MiB allocated; 4ms 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	Expression
1.0ms	x	@	-inf	((+ (+ x y) z) (+ x y) x y z)
0.0ms	x	@	inf	((+ (+ x y) z) (+ x y) x y z)
0.0ms	y	@	-inf	((+ (+ x y) z) (+ x y) x y z)
0.0ms	z	@	-inf	((+ (+ x y) z) (+ x y) x y z)
0.0ms	y	@	inf	((+ (+ x y) z) (+ x y) x y z)

rewrite292.0ms (14.3%)

Memory

39.7MiB live, 227.5MiB allocated; 17ms 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	8126	11
1	13882	11

Stop Event

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

Counts

5 → 21

Calls

Call 1

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

Outputs
(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))
(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

eval3.0ms (0.1%)

Memory: 7.2MiB live, 7.2MiB allocated; 0ms collecting garbage
Compiler: Compiled 156 to 108 computations (30.8% saved)

prune2.0ms (0.1%)

Memory

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

Pruning

3 alts after pruning (2 fresh and 1 done)

	Pruned	Kept	Total
New	32	2	34
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	32	3	35

Accuracy

100.0%

Counts

35 → 3

Alt Table

Click to see full alt table

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

Compiler

Compiled 18 to 18 computations (0% saved)

series8.0ms (0.4%)

Memory

-34.2MiB live, 11.6MiB allocated; 4ms 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	Expression
3.0ms	x	@	inf	((+ (+ x y) z) (+ x z) x z (+ (+ x y) z) (+ x y) y)
0.0ms	x	@	-inf	((+ (+ x y) z) (+ x z) x z (+ (+ x y) z) (+ x y) y)
0.0ms	z	@	-inf	((+ (+ x y) z) (+ x z) x z (+ (+ x y) z) (+ x y) y)
0.0ms	y	@	-inf	((+ (+ x y) z) (+ x z) x z (+ (+ x y) z) (+ x y) y)
0.0ms	z	@	inf	((+ (+ x y) z) (+ x z) x z (+ (+ x y) z) (+ x y) y)

rewrite316.0ms (15.5%)

Memory

28.4MiB live, 212.5MiB allocated; 22ms 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
6	4014	27
0	8090	27
1	13870	27

Stop Event

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

Counts

7 → 16

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))
(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
(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

eval3.0ms (0.1%)

Memory: 7.7MiB live, 7.7MiB allocated; 0ms collecting garbage
Compiler: Compiled 174 to 119 computations (31.6% saved)

prune2.0ms (0.1%)

Memory

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

Pruning

4 alts after pruning (1 fresh and 3 done)

	Pruned	Kept	Total
New	29	1	30
Fresh	0	0	0
Picked	0	2	2
Done	0	1	1
Total	29	4	33

Accuracy

100.0%

Counts

33 → 4

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(+.f64 (+.f64 x y) z)
✓	52.4%	(+.f64 #s(approx (+ x y) y) z)
✓	99.3%	#s(approx (+ (+ x y) z) (+.f64 x z))
▶	51.4%	#s(approx (+ (+ x y) z) #s(approx (+ x z) z))

Compiler

Compiled 26 to 26 computations (0% saved)

series14.0ms (0.7%)

Memory

-38.2MiB live, 14.1MiB allocated; 12ms 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	Expression
0.0ms	z	@	-inf	((+ (+ x y) z) (+ x z) z)
0.0ms	z	@	inf	((+ (+ x y) z) (+ x z) z)
0.0ms	x	@	-inf	((+ (+ x y) z) (+ x z) z)
0.0ms	x	@	inf	((+ (+ x y) z) (+ x z) z)
0.0ms	y	@	-inf	((+ (+ x y) z) (+ x z) z)

rewrite396.0ms (19.3%)

Memory

7.3MiB live, 260.0MiB allocated; 145ms 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	8099	17
1	13857	17

Stop Event

1×	saturated
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: 5.6MiB live, 5.6MiB allocated; 0ms collecting garbage
Compiler: Compiled 109 to 75 computations (31.2% saved)

prune2.0ms (0.1%)

Memory

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

Pruning

6 alts after pruning (3 fresh and 3 done)

	Pruned	Kept	Total
New	13	3	16
Fresh	0	0	0
Picked	0	1	1
Done	1	2	3
Total	14	6	20

Accuracy

100.0%

Counts

20 → 6

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	52.4%	(+.f64 #s(approx (+ x y) y) z)
✓	99.3%	#s(approx (+ (+ x y) z) (+.f64 x z))
▶	49.7%	#s(approx (+ (+ x y) z) (+.f64 x y))
✓	51.4%	#s(approx (+ (+ x y) z) #s(approx (+ x z) z))
▶	4.0%	#s(approx (+ (+ x y) z) y)
▶	48.5%	#s(approx (+ (+ x y) z) x)

Compiler

Compiled 40 to 40 computations (0% saved)

series10.0ms (0.5%)

Memory

-31.5MiB live, 14.3MiB allocated; 5ms 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	Expression
0.0ms	x	@	-inf	((+ (+ x y) z) x (+ (+ x y) z) y (+ (+ x y) z) (+ x y))
0.0ms	y	@	-inf	((+ (+ x y) z) x (+ (+ x y) z) y (+ (+ x y) z) (+ x y))
0.0ms	x	@	inf	((+ (+ x y) z) x (+ (+ x y) z) y (+ (+ x y) z) (+ x y))
0.0ms	y	@	inf	((+ (+ x y) z) x (+ (+ x y) z) y (+ (+ x y) z) (+ x y))
0.0ms	z	@	-inf	((+ (+ x y) z) x (+ (+ x y) z) y (+ (+ x y) z) (+ x y))

rewrite313.0ms (15.3%)

Memory

25.2MiB live, 253.6MiB allocated; 61ms 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	8121	28
1	13878	28

Stop Event

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

Counts

6 → 10

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))
(neg.f64 (-.f64 (neg.f64 y) x))
(-.f64 y (neg.f64 x))
(-.f64 x (neg.f64 y))
(+.f64 y x)
(+.f64 x y)

eval2.0ms (0.1%)

Memory: 5.6MiB live, 5.6MiB allocated; 0ms collecting garbage
Compiler: Compiled 128 to 89 computations (30.5% saved)

prune2.0ms (0.1%)

Memory

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

Pruning

6 alts after pruning (0 fresh and 6 done)

	Pruned	Kept	Total
New	22	0	22
Fresh	0	0	0
Picked	0	3	3
Done	0	3	3
Total	22	6	28

Accuracy

100.0%

Counts

28 → 6

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	52.4%	(+.f64 #s(approx (+ x y) y) z)
✓	99.3%	#s(approx (+ (+ x y) z) (+.f64 x z))
✓	49.7%	#s(approx (+ (+ x y) z) (+.f64 x y))
✓	51.4%	#s(approx (+ (+ x y) z) #s(approx (+ x z) z))
✓	4.0%	#s(approx (+ (+ x y) z) y)
✓	48.5%	#s(approx (+ (+ x y) z) x)

Compiler

Compiled 65 to 57 computations (12.3% saved)

regimes26.0ms (1.3%)

Memory

-21.2MiB live, 33.9MiB allocated; 17ms collecting garbage

Counts

7 → 1

Calls

Call 1

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

5 calls:

15.0ms	x
3.0ms	z
3.0ms	(+.f64 (+.f64 x y) z)
3.0ms	(+.f64 x y)
3.0ms	y

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)

regimes12.0ms (0.6%)

Memory

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

Counts

6 → 1

Calls

Call 1

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 z))

Calls

5 calls:

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

Results

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

Compiler

Compiled 11 to 18 computations (-63.6% saved)

regimes12.0ms (0.6%)

Memory

-27.4MiB live, 20.2MiB allocated; 4ms collecting garbage

Counts

4 → 2

Calls

Call 1

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))

Calls

5 calls:

4.0ms	z
2.0ms	(+.f64 (+.f64 x y) z)
2.0ms	(+.f64 x y)
2.0ms	y
2.0ms	x

Results

Accuracy	Segments	Branch
83.1%	2	`(+.f64 x y)`
98.5%	2	`(+.f64 (+.f64 x y) z)`
82.1%	2	`x`
75.3%	2	`y`
80.3%	2	`z`

Compiler

Compiled 11 to 18 computations (-63.6% saved)

regimes2.0ms (0.1%)

Memory

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

Counts

3 → 2

Calls

Call 1

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))

Calls

1 calls:

2.0ms

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

Results

Accuracy	Segments	Branch
97.9%	2	`(+.f64 (+.f64 x y) z)`

Compiler

Compiled 5 to 5 computations (0% saved)

regimes7.0ms (0.3%)

Memory

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

Accuracy

Total -29.1b remaining (-88.1%)

Threshold costs -29.1b (-88.1%)

Counts

2 → 1

Calls

Call 1

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

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

Calls

5 calls:

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

Results

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

Compiler

Compiled 11 to 18 computations (-63.6% saved)

bsearch0.0ms (0%)

Memory

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

Algorithm

1×	left-value

Steps

Time	Left	Right
0.0ms	-4.462317223233907e-209	2.485432376558402e-207

Compiler

Compiled 8 to 11 computations (-37.5% saved)

bsearch0.0ms (0%)

Memory

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

Algorithm

1×	left-value

Steps

Time	Left	Right
0.0ms	-4.462317223233907e-209	2.485432376558402e-207

Compiler

Compiled 8 to 11 computations (-37.5% saved)

derivations2.0ms (0.1%)

Memory

4.0MiB live, 4.1MiB allocated; 0ms collecting garbage

Stop Event

1×

done

Compiler

Compiled 25 to 18 computations (28% saved)

preprocess65.0ms (3.2%)

Memory: -22.5MiB live, 120.5MiB allocated; 13ms collecting garbage
Compiler: Compiled 132 to 115 computations (12.9% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample526.0ms (25.7%)

preprocess21.0ms (1%)

series9.0ms (0.4%)

rewrite292.0ms (14.3%)

eval3.0ms (0.1%)

prune2.0ms (0.1%)

series8.0ms (0.4%)

rewrite316.0ms (15.5%)

eval3.0ms (0.1%)

prune2.0ms (0.1%)

series14.0ms (0.7%)

rewrite396.0ms (19.3%)

eval2.0ms (0.1%)

prune2.0ms (0.1%)

series10.0ms (0.5%)

rewrite313.0ms (15.3%)

eval2.0ms (0.1%)

prune2.0ms (0.1%)

regimes26.0ms (1.3%)

regimes12.0ms (0.6%)

regimes12.0ms (0.6%)

regimes2.0ms (0.1%)

regimes7.0ms (0.3%)

bsearch0.0ms (0%)

bsearch0.0ms (0%)

derivations2.0ms (0.1%)

preprocess65.0ms (3.2%)

end0.0ms (0%)

Profiling