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

start0.0ms (0%)

Memory: 0.0MiB live, 0.0MiB allocated

analyze277.0ms (14.5%)

Memory

7.2MiB live, 125.7MiB allocated

Algorithm

1×

Search

Probability	Valid	Unknown	Precondition	Infinite	Domain	Can't	Iter
0%	0%	99.7%	0.3%	0%	0%	0%	0
0%	0%	99.7%	0.3%	0%	0%	0%	1
0%	0%	99.7%	0.3%	0%	0%	0%	2
0%	0%	99.7%	0.3%	0%	0%	0%	3
0%	0%	99.7%	0.3%	0%	0%	0%	4
0%	0%	99.7%	0.3%	0%	0%	0%	5
0%	0%	99.7%	0.3%	0%	0%	0%	6
0%	0%	99.7%	0.3%	0%	0%	0%	7
25%	24.9%	74.7%	0.3%	0%	0%	0%	8
25%	24.9%	74.7%	0.3%	0%	0%	0%	9
25%	24.9%	74.7%	0.3%	0%	0%	0%	10
37.5%	37.4%	62.3%	0.3%	0%	0%	0%	11
37.5%	37.4%	62.3%	0.3%	0%	0%	0%	12

Compiler

Compiled 21 to 20 computations (4.8% saved)

sample31.0ms (1.6%)

Memory

-5.3MiB live, 11.6MiB allocated

Samples

20.0ms

260×

valid

Precisions

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

ival-mult: 8.0ms (65.1% of total)

ival-sub: 1.0ms (8.1% of total)

ival-div: 1.0ms (8.1% of total)

ival-add: 1.0ms (8.1% of total)

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

exact: 0.0ms (0% of total)

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

Bogosity

explain1.4s (70.4%)

Memory

7.2MiB live, 1 083.6MiB allocated

FPErrors

Click to see full error table

Ground Truth	Overpredictions	Example	Example	Subexpression
46	1	(1.4105905577715595e+28 1.6467401740932012e+134 -2.48275569354217e+304 2.8993145339017973e-248 -4.171587165088844e+220 -1.4692956459109399e+113 -1.8374359523952922e+296)	-	`(/.f64 (+.f64 (-.f64 (.f64 (.f64 x #s(literal 9 binary64)) y) (.f64 (.f64 (.f64 z #s(literal 4 binary64)) t) a)) b) (.f64 z c))`
16	0	-	-	`(.f64 (.f64 (*.f64 z #s(literal 4 binary64)) t) a)`
3	0	-	-	`(-.f64 (.f64 (.f64 x #s(literal 9 binary64)) y) (.f64 (.f64 (*.f64 z #s(literal 4 binary64)) t) a))`
1	0	-	-	`(.f64 (.f64 z #s(literal 4 binary64)) t)`
0	0	-	-	`a`
0	0	-	-	`t`
0	0	-	-	`(*.f64 z c)`
0	0	-	-	`(.f64 (.f64 x #s(literal 9 binary64)) y)`
0	0	-	-	`c`
0	0	-	-	`y`
0	0	-	-	`(*.f64 x #s(literal 9 binary64))`
0	0	-	-	`#s(literal 9 binary64)`
0	0	-	-	`#s(literal 4 binary64)`
0	0	-	-	`z`
0	0	-	-	`(*.f64 z #s(literal 4 binary64))`
0	0	-	-	`b`
0	0	-	-	`(+.f64 (-.f64 (.f64 (.f64 x #s(literal 9 binary64)) y) (.f64 (.f64 (*.f64 z #s(literal 4 binary64)) t) a)) b)`
0	0	-	-	`x`

Explanations

Click to see full explanations table

Operator	Subexpression	Explanation	Count
`/.f64`	`(/.f64 (+.f64 (-.f64 (.f64 (.f64 x #s(literal 9 binary64)) y) (.f64 (.f64 (.f64 z #s(literal 4 binary64)) t) a)) b) (.f64 z c))`	o/n	24	0
↳	`(.f64 (.f64 (*.f64 z #s(literal 4 binary64)) t) a)`	overflow	39
↳	`(.f64 (.f64 z #s(literal 4 binary64)) t)`	overflow	29
↳	`(*.f64 z #s(literal 4 binary64))`	overflow	1
↳	`(.f64 (.f64 x #s(literal 9 binary64)) y)`	overflow	34
↳	`(-.f64 (.f64 (.f64 x #s(literal 9 binary64)) y) (.f64 (.f64 (*.f64 z #s(literal 4 binary64)) t) a))`	overflow	68
↳	`(+.f64 (-.f64 (.f64 (.f64 x #s(literal 9 binary64)) y) (.f64 (.f64 (*.f64 z #s(literal 4 binary64)) t) a)) b)`	overflow	68
`/.f64`	`(/.f64 (+.f64 (-.f64 (.f64 (.f64 x #s(literal 9 binary64)) y) (.f64 (.f64 (.f64 z #s(literal 4 binary64)) t) a)) b) (.f64 z c))`	n/o	15	0
↳	`(*.f64 z c)`	overflow	24
`*.f64`	`(.f64 (.f64 (*.f64 z #s(literal 4 binary64)) t) a)`	*no**	8	0
`/.f64`	`(/.f64 (+.f64 (-.f64 (.f64 (.f64 x #s(literal 9 binary64)) y) (.f64 (.f64 (.f64 z #s(literal 4 binary64)) t) a)) b) (.f64 z c))`	o/o	6	0
↳	`(.f64 (.f64 (*.f64 z #s(literal 4 binary64)) t) a)`	overflow	39
↳	`(.f64 (.f64 z #s(literal 4 binary64)) t)`	overflow	29
↳	`(*.f64 z #s(literal 4 binary64))`	overflow	1
↳	`(.f64 (.f64 x #s(literal 9 binary64)) y)`	overflow	34
↳	`(-.f64 (.f64 (.f64 x #s(literal 9 binary64)) y) (.f64 (.f64 (*.f64 z #s(literal 4 binary64)) t) a))`	overflow	68
↳	`(+.f64 (-.f64 (.f64 (.f64 x #s(literal 9 binary64)) y) (.f64 (.f64 (*.f64 z #s(literal 4 binary64)) t) a)) b)`	overflow	68
↳	`(*.f64 z c)`	overflow	24
`-.f64`	`(-.f64 (.f64 (.f64 x #s(literal 9 binary64)) y) (.f64 (.f64 (*.f64 z #s(literal 4 binary64)) t) a))`	nan-rescue	3	0
↳	`(.f64 (.f64 x #s(literal 9 binary64)) y)`	overflow	34
↳	`(.f64 (.f64 (*.f64 z #s(literal 4 binary64)) t) a)`	overflow	39
↳	`(.f64 (.f64 z #s(literal 4 binary64)) t)`	overflow	29
↳	`(*.f64 z #s(literal 4 binary64))`	overflow	1
`/.f64`	`(/.f64 (+.f64 (-.f64 (.f64 (.f64 x #s(literal 9 binary64)) y) (.f64 (.f64 (.f64 z #s(literal 4 binary64)) t) a)) b) (.f64 z c))`	n/u	2	0
↳	`(*.f64 z c)`	underflow	25
`*.f64`	`(.f64 (.f64 z #s(literal 4 binary64)) t)`	*no**	1	0

Confusion

	Predicted +	Predicted -
+	54	0
-	1	201

Precision

0.9818181818181818

Recall

1.0

Confusion?

	Predicted +	Predicted Maybe	Predicted -
+	54	0	0
-	1	0	201

Precision?

0.9818181818181818

Recall?

1.0

2:

4:

8:

16:

32:

64:

128:

256:

512:

1024:

2048:

Freqs

test

number	freq
0	201
1	51
2	4

Total Confusion?

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

Precision?

1.0

Recall?

1.0

Total Time

7.506103515625

Average Time

0.029320716857910156

Samples

287.0ms

3 072×

valid

Compiler

Compiled 3 204 to 888 computations (72.3% saved)

Precisions

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

ival-mult: 101.0ms (67.5% of total)

ival-div: 18.0ms (12% of total)

ival-sub: 12.0ms (8% of total)

ival-add: 12.0ms (8% of total)

exact: 3.0ms (2% of total)

ival-true: 2.0ms (1.3% of total)

ival-assert: 1.0ms (0.7% of total)

preprocess195.0ms (10.2%)

Memory

7.7MiB live, 50.7MiB allocated

Algorithm

1×	egg-herbie

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	182	688
1	640	672
2	1915	665
3	6440	665
0	18	19
0	27	19
1	49	19
2	121	19
3	385	19
4	888	17
5	2184	17
6	4741	17
7	7782	17
0	8138	15

Stop Event

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

Calls

Call 1

Inputs
(/.f64 (+.f64 (-.f64 (.f64 (.f64 x #s(literal 9 binary64)) y) (.f64 (.f64 (.f64 z #s(literal 4 binary64)) t) a)) b) (.f64 z c))

Outputs

(/.f64 (+.f64 (-.f64 (*.f64 (*.f64 x #s(literal 9 binary64)) y) (*.f64 (*.f64 (*.f64 z #s(literal 4 binary64)) t) a)) b) (*.f64 z c))

(/.f64 (fma.f64 (*.f64 #s(literal -4 binary64) a) t (/.f64 (fma.f64 (*.f64 y #s(literal 9 binary64)) x b) z)) c)

Symmetry

(negabs c)

(sort x y)

(sort t a)

Compiler

Compiled 19 to 18 computations (5.3% saved)

eval0.0ms (0%)

Memory: 0.1MiB live, 0.1MiB allocated
Compiler: Compiled 0 to 7 computations (-∞% saved)

prune1.0ms (0%)

Memory

0.6MiB live, 0.6MiB allocated

Alt Table

Click to see full alt table

Status	Accuracy	Program
	79.6%	(/.f64 (+.f64 (-.f64 (.f64 (.f64 x #s(literal 9 binary64)) y) (.f64 (.f64 (.f64 z #s(literal 4 binary64)) t) a)) b) (.f64 z c))

Compiler

Compiled 38 to 36 computations (5.3% saved)

simplify36.0ms (1.9%)

Memory

-11.5MiB live, 18.7MiB allocated

Algorithm

1×	egg-herbie

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	18	19
1	30	19
2	48	19
3	64	19
4	76	19
5	83	19
6	85	19

Stop Event

1×

saturated

Calls

Call 1

Inputs
(/.f64 (+.f64 (-.f64 (.f64 (.f64 x #s(literal 9 binary64)) y) (.f64 (.f64 (.f64 z #s(literal 4 binary64)) t) a)) b) (.f64 z c))

Outputs

(/.f64 (+.f64 (-.f64 (*.f64 (*.f64 x #s(literal 9 binary64)) y) (*.f64 (*.f64 (*.f64 z #s(literal 4 binary64)) t) a)) b) (*.f64 z c))

(/.f64 (+.f64 b (-.f64 (*.f64 y (*.f64 #s(literal 9 binary64) x)) (*.f64 a (*.f64 t (*.f64 #s(literal 4 binary64) z))))) (*.f64 c z))

soundness0.0ms (0%)

Memory

0.2MiB live, 0.2MiB allocated

Stop Event

1×

fuel

Compiler

Compiled 19 to 18 computations (5.3% saved)

preprocess26.0ms (1.4%)

Memory

2.5MiB live, 18.1MiB allocated

Remove

(sort t a)

(sort x y)

(negabs c)

Compiler

Compiled 768 to 400 computations (47.9% saved)

end0.0ms (0%)

Memory: 0.0MiB live, 0.0MiB allocated

start0.0ms (0%)

analyze277.0ms (14.5%)

sample31.0ms (1.6%)

explain1.4s (70.4%)

preprocess195.0ms (10.2%)

eval0.0ms (0%)

prune1.0ms (0%)

simplify36.0ms (1.9%)

soundness0.0ms (0%)

preprocess26.0ms (1.4%)

end0.0ms (0%)

Profiling