Metrics for Diagrams.Solve.Polynomial:cubForm from diagrams-solve-0.1, E

start0.0ms (0%)

Memory: 0.1MiB live, 0.1MiB allocated

analyze1.0ms (0%)

Memory

1.7MiB live, 1.7MiB allocated

Algorithm

1×

Search

Probability	Valid	Unknown	Precondition	Infinite	Domain	Can't	Iter
0%	0%	99.5%	0.5%	0%	0%	0%	0
100%	99.5%	0%	0.5%	0%	0%	0%	1

Compiler

Compiled 33 to 30 computations (9.1% saved)

sample2.1s (69.8%)

Memory

22.7MiB live, 3 003.6MiB allocated

Samples

1.6s

8 256×

valid

Precisions

Click to see histograms. Total time spent on operations: 1.3s

ival-mult: 1.1s (86.5% of total)

ival-sub: 109.0ms (8.6% of total)

ival-add: 38.0ms (3% of total)

exact: 13.0ms (1% of total)

ival-true: 7.0ms (0.6% of total)

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

Bogosity

explain315.0ms (10.3%)

Memory

31.2MiB live, 624.6MiB allocated

FPErrors

Click to see full error table

Ground Truth	Example	Underpredictions	Example	Subexpression
25	-	3	(3.8356566196463e-173 -2.9741712717219913e+23 5.810451531454254e-164 1787893.9294463305 -5.183668564206468e-192 1.9974727401923655e+266 9.369089989184321e+163 1.3443263261777253e+192 5.997679190007209e-264 2.719835040453508e+63)	`(.f64 (.f64 (.f64 (.f64 x #s(literal 18 binary64)) y) z) t)`
21	-	0	-	`(.f64 (.f64 (*.f64 x #s(literal 18 binary64)) y) z)`
6	-	0	-	`(-.f64 (-.f64 (+.f64 (-.f64 (.f64 (.f64 (.f64 (.f64 x #s(literal 18 binary64)) y) z) t) (.f64 (.f64 a #s(literal 4 binary64)) t)) (.f64 b c)) (.f64 (.f64 x #s(literal 4 binary64)) i)) (.f64 (*.f64 j #s(literal 27 binary64)) k))`
4	-	0	-	`(+.f64 (-.f64 (.f64 (.f64 (.f64 (.f64 x #s(literal 18 binary64)) y) z) t) (.f64 (.f64 a #s(literal 4 binary64)) t)) (*.f64 b c))`
4	-	0	-	`(-.f64 (+.f64 (-.f64 (.f64 (.f64 (.f64 (.f64 x #s(literal 18 binary64)) y) z) t) (.f64 (.f64 a #s(literal 4 binary64)) t)) (.f64 b c)) (.f64 (*.f64 x #s(literal 4 binary64)) i))`
2	-	0	-	`(-.f64 (.f64 (.f64 (.f64 (.f64 x #s(literal 18 binary64)) y) z) t) (.f64 (.f64 a #s(literal 4 binary64)) t))`
1	-	0	-	`(.f64 (.f64 a #s(literal 4 binary64)) t)`
1	-	0	-	`(.f64 (.f64 j #s(literal 27 binary64)) k)`
0	-	0	-	`k`
0	-	0	-	`(*.f64 a #s(literal 4 binary64))`
0	-	0	-	`a`
0	-	0	-	`(*.f64 j #s(literal 27 binary64))`
0	-	0	-	`t`
0	-	0	-	`(*.f64 b c)`
0	-	0	-	`c`
0	-	0	-	`y`
0	-	0	-	`i`
0	-	0	-	`(*.f64 x #s(literal 4 binary64))`
0	-	0	-	`#s(literal 27 binary64)`
0	-	0	-	`(.f64 (.f64 x #s(literal 18 binary64)) y)`
0	-	0	-	`z`
0	-	0	-	`#s(literal 4 binary64)`
0	-	0	-	`j`
0	-	0	-	`(*.f64 x #s(literal 18 binary64))`
0	-	0	-	`(.f64 (.f64 x #s(literal 4 binary64)) i)`
0	-	0	-	`#s(literal 18 binary64)`
0	-	0	-	`b`
0	-	0	-	`x`

Explanations

Click to see full explanations table

Operator	Subexpression	Explanation	Count
`*.f64`	`(.f64 (.f64 (*.f64 x #s(literal 18 binary64)) y) z)`	*no**	12	0
`*.f64`	`(.f64 (.f64 (.f64 (.f64 x #s(literal 18 binary64)) y) z) t)`	*no**	9	0
`-.f64`	`(-.f64 (-.f64 (+.f64 (-.f64 (.f64 (.f64 (.f64 (.f64 x #s(literal 18 binary64)) y) z) t) (.f64 (.f64 a #s(literal 4 binary64)) t)) (.f64 b c)) (.f64 (.f64 x #s(literal 4 binary64)) i)) (.f64 (*.f64 j #s(literal 27 binary64)) k))`	nan-rescue	6	0
↳	`(*.f64 b c)`	overflow	31
↳	`(.f64 (.f64 x #s(literal 4 binary64)) i)`	overflow	31
↳	`(.f64 (.f64 (*.f64 x #s(literal 18 binary64)) y) z)`	overflow	37
↳	`(*.f64 x #s(literal 18 binary64))`	overflow	1
↳	`(+.f64 (-.f64 (.f64 (.f64 (.f64 (.f64 x #s(literal 18 binary64)) y) z) t) (.f64 (.f64 a #s(literal 4 binary64)) t)) (*.f64 b c))`	overflow	86
↳	`(.f64 (.f64 a #s(literal 4 binary64)) t)`	overflow	28
↳	`(.f64 (.f64 (.f64 (.f64 x #s(literal 18 binary64)) y) z) t)`	overflow	46
↳	`(-.f64 (.f64 (.f64 (.f64 (.f64 x #s(literal 18 binary64)) y) z) t) (.f64 (.f64 a #s(literal 4 binary64)) t))`	overflow	66
↳	`(.f64 (.f64 x #s(literal 18 binary64)) y)`	overflow	32
↳	`(*.f64 a #s(literal 4 binary64))`	overflow	1
↳	`(-.f64 (+.f64 (-.f64 (.f64 (.f64 (.f64 (.f64 x #s(literal 18 binary64)) y) z) t) (.f64 (.f64 a #s(literal 4 binary64)) t)) (.f64 b c)) (.f64 (*.f64 x #s(literal 4 binary64)) i))`	overflow	105
↳	`(.f64 (.f64 j #s(literal 27 binary64)) k)`	overflow	31
↳	`(*.f64 j #s(literal 27 binary64))`	overflow	2
`-.f64`	`(-.f64 (+.f64 (-.f64 (.f64 (.f64 (.f64 (.f64 x #s(literal 18 binary64)) y) z) t) (.f64 (.f64 a #s(literal 4 binary64)) t)) (.f64 b c)) (.f64 (*.f64 x #s(literal 4 binary64)) i))`	nan-rescue	4	0
↳	`(*.f64 b c)`	overflow	31
↳	`(.f64 (.f64 (*.f64 x #s(literal 18 binary64)) y) z)`	overflow	37
↳	`(*.f64 a #s(literal 4 binary64))`	overflow	1
↳	`(*.f64 x #s(literal 18 binary64))`	overflow	1
↳	`(+.f64 (-.f64 (.f64 (.f64 (.f64 (.f64 x #s(literal 18 binary64)) y) z) t) (.f64 (.f64 a #s(literal 4 binary64)) t)) (*.f64 b c))`	overflow	86
↳	`(.f64 (.f64 a #s(literal 4 binary64)) t)`	overflow	28
↳	`(.f64 (.f64 (.f64 (.f64 x #s(literal 18 binary64)) y) z) t)`	overflow	46
↳	`(-.f64 (.f64 (.f64 (.f64 (.f64 x #s(literal 18 binary64)) y) z) t) (.f64 (.f64 a #s(literal 4 binary64)) t))`	overflow	66
↳	`(.f64 (.f64 x #s(literal 18 binary64)) y)`	overflow	32
↳	`(.f64 (.f64 x #s(literal 4 binary64)) i)`	overflow	31
`+.f64`	`(+.f64 (-.f64 (.f64 (.f64 (.f64 (.f64 x #s(literal 18 binary64)) y) z) t) (.f64 (.f64 a #s(literal 4 binary64)) t)) (*.f64 b c))`	nan-rescue	4	0
↳	`(.f64 (.f64 (*.f64 x #s(literal 18 binary64)) y) z)`	overflow	37
↳	`(*.f64 a #s(literal 4 binary64))`	overflow	1
↳	`(*.f64 x #s(literal 18 binary64))`	overflow	1
↳	`(.f64 (.f64 a #s(literal 4 binary64)) t)`	overflow	28
↳	`(.f64 (.f64 (.f64 (.f64 x #s(literal 18 binary64)) y) z) t)`	overflow	46
↳	`(-.f64 (.f64 (.f64 (.f64 (.f64 x #s(literal 18 binary64)) y) z) t) (.f64 (.f64 a #s(literal 4 binary64)) t))`	overflow	66
↳	`(.f64 (.f64 x #s(literal 18 binary64)) y)`	overflow	32
↳	`(*.f64 b c)`	overflow	31
`-.f64`	`(-.f64 (.f64 (.f64 (.f64 (.f64 x #s(literal 18 binary64)) y) z) t) (.f64 (.f64 a #s(literal 4 binary64)) t))`	nan-rescue	2	0
↳	`(.f64 (.f64 (.f64 (.f64 x #s(literal 18 binary64)) y) z) t)`	overflow	46
↳	`(.f64 (.f64 (*.f64 x #s(literal 18 binary64)) y) z)`	overflow	37
↳	`(.f64 (.f64 x #s(literal 18 binary64)) y)`	overflow	32
↳	`(*.f64 x #s(literal 18 binary64))`	overflow	1
↳	`(.f64 (.f64 a #s(literal 4 binary64)) t)`	overflow	28
↳	`(*.f64 a #s(literal 4 binary64))`	overflow	1
`*.f64`	`(.f64 (.f64 (*.f64 x #s(literal 18 binary64)) y) z)`	*nu**	1	0
`*.f64`	`(.f64 (.f64 j #s(literal 27 binary64)) k)`	*no**	1	0
`*.f64`	`(.f64 (.f64 a #s(literal 4 binary64)) t)`	*no**	1	0

Confusion

	Predicted +	Predicted -
+	32	0
-	3	221

Precision

0.9142857142857143

Recall

1.0

Confusion?

	Predicted +	Predicted Maybe	Predicted -
+	32	0	0
-	3	0	221

Precision?

0.9142857142857143

Recall?

1.0

Freqs

test

number	freq
0	221
1	30
2	5

Total Confusion?

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

Precision?

1.0

Recall?

1.0

Samples

86.0ms

512×

valid

Compiler

Compiled 353 to 88 computations (75.1% saved)

Precisions

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

ival-mult: 38.0ms (79% of total)

ival-sub: 6.0ms (12.5% of total)

ival-add: 2.0ms (4.2% of total)

ival-true: 1.0ms (2.1% of total)

exact: 1.0ms (2.1% of total)

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

preprocess610.0ms (19.9%)

Memory

4.0MiB live, 354.4MiB allocated

Algorithm

1×	egg-herbie

Rules

12 640×	`lower-fma.f64`
12 640×	`lower-fma.f32`
3 040×	`lower-*.f32`
3 018×	`lower-*.f64`
1 390×	`distribute-lft-neg-in`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	427	1917
1	1745	1897
2	6134	1893
0	28	31
0	43	29
1	90	29
2	268	29
3	763	29
4	1902	29
5	3846	29
6	5240	29
7	5703	29
8	5980	29
9	6003	29
10	6021	29
11	6021	29
12	6216	29
13	6239	29
14	6239	29
15	6432	29
16	6432	29
17	6924	29
18	7152	29
19	7152	29
20	7152	29
21	7152	29
22	7152	29
23	7162	29
0	7162	25

Stop Event

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

Compiler

Compiled 31 to 29 computations (6.5% saved)

end0.0ms (0%)

Memory: 0.0MiB live, 0.0MiB allocated

start0.0ms (0%)

analyze1.0ms (0%)

sample2.1s (69.8%)

explain315.0ms (10.3%)

preprocess610.0ms (19.9%)

end0.0ms (0%)

Profiling