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

analyze0.0ms (0%)

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 11 to 8 computations (27.3% saved)

Precisions

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

Operation ival-add, time spent: 0.0ms, 0.0% of total-time

Operation ival-mult, time spent: 0.0ms, 0.0% of total-time

Operation const, time spent: 0.0ms, 0.0% of total-time

sample1.4s (72.9%)

Results

1.0s	6575×	256	valid
271.0ms	1680×	256	infinite
0.0ms	1×	256	valid

Precisions

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

Operation ival-add, time spent: 115.0ms, 58.0% of total-time

Operation ival-mult, time spent: 69.0ms, 35.0% of total-time

Operation const, time spent: 15.0ms, 8.0% of total-time

Bogosity

preprocess438.0ms (23.4%)

Algorithm

1×	egg-herbie

Rules

2564×	`fma-neg`
818×	`unsub-neg`
747×	`fma-define`
332×	`distribute-lft-in`
320×	`distribute-rgt-in`

FPErrors

Click to see full error table

Example	Example	Subexpression
-	-	`x`
-	-	`z`
-	-	`(+.f64 x y)`
-	-	`#s(literal 1 binary64)`
-	-	`y`
-	-	`(*.f64 (+.f64 x y) (+.f64 z #s(literal 1 binary64)))`
-	-	`(+.f64 z #s(literal 1 binary64))`

Iterations

Useful iterations: 2 (0.0ms)

Iter	Nodes	Cost
0	34	328
1	120	312
2	449	308
3	1443	308
4	3917	308
5	5374	308
6	6275	308
7	6394	308
8	6404	308
9	6409	308
10	6484	308
11	6520	308
12	6520	308

Stop Event

1×	node limit

Calls

Call 1

Inputs
(*.f64 (+.f64 x y) (+.f64 z #s(literal 1 binary64)))
(*.f64 (+.f64 x y) (+.f64 z #s(literal 1 binary64)))
(*.f64 (+.f64 (neg.f64 x) y) (+.f64 z #s(literal 1 binary64)))
(*.f64 (+.f64 x (neg.f64 y)) (+.f64 z #s(literal 1 binary64)))
(*.f64 (+.f64 x y) (+.f64 (neg.f64 z) #s(literal 1 binary64)))
(neg.f64 (*.f64 (+.f64 (neg.f64 x) y) (+.f64 z #s(literal 1 binary64))))
(neg.f64 (*.f64 (+.f64 x (neg.f64 y)) (+.f64 z #s(literal 1 binary64))))
(neg.f64 (*.f64 (+.f64 x y) (+.f64 (neg.f64 z) #s(literal 1 binary64))))
(*.f64 (+.f64 y x) (+.f64 z #s(literal 1 binary64)))
(*.f64 (+.f64 z y) (+.f64 x #s(literal 1 binary64)))
(*.f64 (+.f64 x z) (+.f64 y #s(literal 1 binary64)))

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

Symmetry

(sort x y)

Compiler

Compiled 52 to 29 computations (44.2% saved)

Precisions

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

Operation ival-add, time spent: 78.0ms, 94.0% of total-time

Operation ival-mult, time spent: 4.0ms, 5.0% of total-time

Operation const, time spent: 1.0ms, 1.0% of total-time

eval0.0ms (0%)

Compiler: Compiled 3 to 3 computations (0% saved)

prune1.0ms (0%)

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	(*.f64 (+.f64 x y) (+.f64 z #s(literal 1 binary64)))

Compiler

Compiled 10 to 7 computations (30% saved)

localize36.0ms (1.9%)

Compiler: Compiled 21 to 11 computations (47.6% saved)
Precisions: Click to see histograms. Total time spent on operations: 7.0ms
Operation ival-add, time spent: 5.0ms, 68.0% of total-time
Operation ival-mult, time spent: 2.0ms, 27.0% of total-time
Operation const, time spent: 1.0ms, 14.0% of total-time

eval0.0ms (0%)

Compiler: Compiled 3 to 3 computations (0% saved)

prune1.0ms (0.1%)

Pruning

1 alts after pruning (0 fresh and 1 done)

	Kept	Total
New	0	0
Fresh	0	0
Picked	1	1
Done	0	0
Total	1	1

Accuracy

100.0%

Counts

1 → 1

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(*.f64 (+.f64 x y) (+.f64 z #s(literal 1 binary64)))

Compiler

Compiled 20 to 14 computations (30% saved)

simplify2.0ms (0.1%)

Algorithm

1×	egg-herbie

Rules

3×	`1-exp`
2×	`+-commutative`
1×	`*-commutative`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	13	28
1	22	28

Stop Event

1×	done
1×	saturated

Calls

Call 1

Inputs
(*.f64 (+.f64 x y) (+.f64 z #s(literal 1 binary64)))

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

Compiler

Compiled 10 to 7 computations (30% saved)

soundness0.0ms (0%)

end0.0ms (0%)

preprocess27.0ms (1.5%)

Remove: (sort x y)
Compiler: Compiled 80 to 56 computations (30% saved)

analyze0.0ms (0%)

sample1.4s (72.9%)

preprocess438.0ms (23.4%)

eval0.0ms (0%)

prune1.0ms (0%)

localize36.0ms (1.9%)

eval0.0ms (0%)

prune1.0ms (0.1%)

simplify2.0ms (0.1%)

soundness0.0ms (0%)

end0.0ms (0%)

preprocess27.0ms (1.5%)

Profiling