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

start0.0ms (0%)

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

sample543.0ms (66.7%)

Memory

1.0MiB live, 1 000.6MiB allocated; 87ms collecting garbage

Samples

295.0ms	8 250×	0	valid
0.0ms	4×	2	valid
0.0ms	2×	1	valid

Precisions

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

ival-add: 100.0ms (94.7% of total)

adjust: 3.0ms (2.8% of total)

ival-assert: 3.0ms (2.8% of total)

Bogosity

explain48.0ms (5.9%)

Memory

35.7MiB live, 131.3MiB allocated; 2ms collecting garbage

FPErrors

Click to see full error table

Example	Example	Subexpression
-	-	`(+.f64 (+.f64 x y) z)`
-	-	`y`
-	-	`(+.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

21.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: 6.0ms (87.5% of total)

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

adjust: 0.0ms (0% of total)

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

preprocess16.0ms (2%)

Memory

-9.6MiB live, 40.6MiB allocated; 1ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	22	59
1	47	58
2	84	56
3	127	56
4	133	56
5	145	56
6	146	56
0	5	5
0	7	5
1	11	5
2	18	5
3	20	5
0	20	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

(sort x y z)

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

1.0MiB live, 1.0MiB 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)

series3.0ms (0.4%)

Memory

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

Counts

5 → 23

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 (+ 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))
#s(approx (+ (+ x y) z) #s(hole binary64 (* x (+ 1 (+ (/ y x) (/ 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 (/ (+ y z) x)) 1)))))
#s(approx (+ x y) #s(hole binary64 (* -1 (* x (- (* -1 (/ y x)) 1)))))
#s(approx (+ (+ x y) z) #s(hole binary64 (+ x z)))
#s(approx y #s(hole binary64 y))
#s(approx (+ (+ x y) z) #s(hole binary64 y))
#s(approx (+ (+ x y) z) #s(hole binary64 (* y (+ 1 (+ (/ x y) (/ z y))))))
#s(approx (+ x y) #s(hole binary64 (* y (+ 1 (/ x y)))))
#s(approx (+ (+ x y) z) #s(hole binary64 (* -1 (* y (- (* -1 (/ (+ x z) y)) 1)))))
#s(approx (+ x y) #s(hole binary64 (* -1 (* y (- (* -1 (/ x y)) 1)))))
#s(approx (+ (+ x y) z) #s(hole binary64 (+ x y)))
#s(approx z #s(hole binary64 z))
#s(approx (+ (+ x y) z) #s(hole binary64 z))
#s(approx (+ (+ x y) z) #s(hole binary64 (* z (+ 1 (+ (/ x z) (/ y z))))))
#s(approx (+ (+ x y) z) #s(hole binary64 (* -1 (* z (- (* -1 (/ (+ x y) z)) 1)))))

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)

rewrite161.0ms (19.8%)

Memory

-6.6MiB live, 274.9MiB allocated; 11ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	77	256
0	78	240
1	382	240
2	3821	240
0	8775	235

Stop Event

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

Counts

28 → 58

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 (+ 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))
#s(approx (+ (+ x y) z) #s(hole binary64 (* x (+ 1 (+ (/ y x) (/ 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 (/ (+ y z) x)) 1)))))
#s(approx (+ x y) #s(hole binary64 (* -1 (* x (- (* -1 (/ y x)) 1)))))
#s(approx (+ (+ x y) z) #s(hole binary64 (+ x z)))
#s(approx y #s(hole binary64 y))
#s(approx (+ (+ x y) z) #s(hole binary64 y))
#s(approx (+ (+ x y) z) #s(hole binary64 (* y (+ 1 (+ (/ x y) (/ z y))))))
#s(approx (+ x y) #s(hole binary64 (* y (+ 1 (/ x y)))))
#s(approx (+ (+ x y) z) #s(hole binary64 (* -1 (* y (- (* -1 (/ (+ x z) y)) 1)))))
#s(approx (+ x y) #s(hole binary64 (* -1 (* y (- (* -1 (/ x y)) 1)))))
#s(approx (+ (+ x y) z) #s(hole binary64 (+ x y)))
#s(approx z #s(hole binary64 z))
#s(approx (+ (+ x y) z) #s(hole binary64 z))
#s(approx (+ (+ x y) z) #s(hole binary64 (* z (+ 1 (+ (/ x z) (/ y z))))))
#s(approx (+ (+ x y) z) #s(hole binary64 (* -1 (* z (- (* -1 (/ (+ x y) z)) 1)))))

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

eval6.0ms (0.7%)

Memory: 16.4MiB live, 16.4MiB allocated; 0ms collecting garbage
Compiler: Compiled 795 to 170 computations (78.6% saved)

prune15.0ms (1.9%)

Memory

-11.7MiB live, 35.6MiB allocated; 1ms collecting garbage

Pruning

1 alts after pruning (0 fresh and 1 done)

	Pruned	Kept	Total
New	58	0	58
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	58	1	59

Accuracy

100.0%

Counts

59 → 1

Alt Table

Click to see full alt table

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

Compiler

Compiled 10 to 10 computations (0% saved)

simplify10.0ms (1.2%)

Memory

-30.9MiB live, 23.7MiB allocated; 1ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	5	5

Stop Event

1×

saturated

Calls

Call 1

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

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

derivations0.0ms (0%)

Memory

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

Stop Event

1×

done

Compiler

Compiled 5 to 5 computations (0% saved)

preprocess10.0ms (1.2%)

Memory: 29.9MiB live, 29.9MiB allocated; 0ms collecting garbage
Remove: (sort x y z)
Compiler: Compiled 40 to 40 computations (0% saved)

end0.0ms (0%)

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

Iter	Nodes	Cost
0	22	59
1	47	58
2	84	56
3	127	56
4	133	56
5	145	56
6	146	56
0	5	5
0	7	5
1	11	5
2	18	5
3	20	5
0	20	5

Iter	Nodes	Cost
0	22	59
1	47	58
2	84	56
3	127	56
4	133	56
5	145	56
6	146	56
0	5	5
0	7	5
1	11	5
2	18	5
3	20	5
0	20	5

start0.0ms (0%)

analyze0.0ms (0%)

sample543.0ms (66.7%)

explain48.0ms (5.9%)

preprocess16.0ms (2%)

eval0.0ms (0%)

prune0.0ms (0%)

series3.0ms (0.4%)

rewrite161.0ms (19.8%)

eval6.0ms (0.7%)

prune15.0ms (1.9%)

simplify10.0ms (1.2%)

derivations0.0ms (0%)

preprocess10.0ms (1.2%)

end0.0ms (0%)

Profiling

Iter	Nodes	Cost
0	22	59
1	47	58
2	84	56
3	127	56
4	133	56
5	145	56
6	146	56
0	5	5
0	7	5
1	11	5
2	18	5
3	20	5
0	20	5