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

start0.0ms (0%)

Memory: 0.0MiB live, 0.0MiB allocated

analyze108.0ms (2.3%)

Memory

0.5MiB live, 47.6MiB allocated

Algorithm

1×

Search

Probability	Valid	Unknown	Precondition	Infinite	Domain	Can't	Iter
0%	0%	99.8%	0.2%	0%	0%	0%	0
0%	0%	99.8%	0.2%	0%	0%	0%	1
0%	0%	99.8%	0.2%	0%	0%	0%	2
0%	0%	99.8%	0.2%	0%	0%	0%	3
0%	0%	99.8%	0.2%	0%	0%	0%	4
0%	0%	99.8%	0.2%	0%	0%	0%	5
50%	49.9%	49.9%	0.2%	0%	0%	0%	6
50%	49.9%	49.9%	0.2%	0%	0%	0%	7
50%	49.9%	49.9%	0.2%	0%	0%	0%	8
50%	49.9%	49.9%	0.2%	0%	0%	0%	9
50%	49.9%	49.9%	0.2%	0%	0%	0%	10
75%	74.8%	24.9%	0.2%	0%	0%	0%	11
75%	74.8%	24.9%	0.2%	0%	0%	0%	12

Compiler

Compiled 15 to 15 computations (0% saved)

sample24.0ms (0.5%)

Memory

1.5MiB live, 8.9MiB allocated

Samples

16.0ms

260×

valid

Precisions

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

ival-mult: 6.0ms (64.8% of total)

ival-div: 2.0ms (21.6% of total)

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

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

exact: 0.0ms (0% of total)

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

Bogosity

explain4.2s (89.2%)

Memory

32.2MiB live, 2 618.6MiB allocated

FPErrors

Click to see full error table

Ground Truth	Example	Example	Subexpression
21	-	-	`(/.f64 (-.f64 (.f64 x y) (.f64 (.f64 z #s(literal 9 binary64)) t)) (.f64 a #s(literal 2 binary64)))`
2	-	-	`(-.f64 (.f64 x y) (.f64 (*.f64 z #s(literal 9 binary64)) t))`
0	-	-	`(*.f64 a #s(literal 2 binary64))`
0	-	-	`a`
0	-	-	`t`
0	-	-	`(.f64 (.f64 z #s(literal 9 binary64)) t)`
0	-	-	`#s(literal 9 binary64)`
0	-	-	`z`
0	-	-	`(*.f64 z #s(literal 9 binary64))`
0	-	-	`(*.f64 x y)`
0	-	-	`#s(literal 2 binary64)`
0	-	-	`y`
0	-	-	`x`

Explanations

Click to see full explanations table

Operator	Subexpression	Explanation	Count
`/.f64`	`(/.f64 (-.f64 (.f64 x y) (.f64 (.f64 z #s(literal 9 binary64)) t)) (.f64 a #s(literal 2 binary64)))`	o/n	18	0
↳	`(.f64 (.f64 z #s(literal 9 binary64)) t)`	overflow	36
↳	`(*.f64 x y)`	overflow	28
↳	`(-.f64 (.f64 x y) (.f64 (*.f64 z #s(literal 9 binary64)) t))`	overflow	60
`/.f64`	`(/.f64 (-.f64 (.f64 x y) (.f64 (.f64 z #s(literal 9 binary64)) t)) (.f64 a #s(literal 2 binary64)))`	u/n	3	0
↳	`(.f64 (.f64 z #s(literal 9 binary64)) t)`	underflow	35
↳	`(*.f64 x y)`	underflow	33
↳	`(-.f64 (.f64 x y) (.f64 (*.f64 z #s(literal 9 binary64)) t))`	underflow	5
`-.f64`	`(-.f64 (.f64 x y) (.f64 (*.f64 z #s(literal 9 binary64)) t))`	nan-rescue	2	0
↳	`(*.f64 x y)`	overflow	28
↳	`(.f64 (.f64 z #s(literal 9 binary64)) t)`	overflow	36

Confusion

	Predicted +	Predicted -
+	23	0
-	0	233

Precision

1.0

Recall

1.0

Confusion?

	Predicted +	Predicted Maybe	Predicted -
+	23	0	0
-	0	0	233

Precision?

1.0

Recall?

1.0

Freqs

test

number	freq
0	233
1	23

Total Confusion?

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

Precision?

1.0

Recall?

1.0

Total Time

20.557861328125

Average Time

0.08030414581298828

Samples

1.6s

23 040×

valid

Compiler

Compiled 6 570 to 2 520 computations (61.6% saved)

Precisions

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

ival-mult: 532.0ms (63.9% of total)

ival-div: 152.0ms (18.3% of total)

ival-sub: 97.0ms (11.7% of total)

exact: 24.0ms (2.9% of total)

ival-true: 19.0ms (2.3% of total)

ival-assert: 9.0ms (1.1% of total)

preprocess326.0ms (7%)

Memory

-2.6MiB live, 19.9MiB allocated

Algorithm

1×	egg-herbie

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	79	275
1	302	260
2	1041	260
3	3864	260
0	13	13
0	19	13
1	35	13
2	110	13
3	321	13
4	857	13
5	1479	13
6	2225	13
7	2905	13
8	4093	13
9	4871	13
10	5520	13
11	5565	13
12	5573	13
13	5573	13
14	6056	13
15	6208	13
16	6208	13
17	6208	13
18	6234	13
19	6234	13
20	6238	13
21	6242	13
22	6242	13
0	6242	12

Stop Event

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

Calls

Call 1

Inputs
(/.f64 (-.f64 (.f64 x y) (.f64 (.f64 z #s(literal 9 binary64)) t)) (.f64 a #s(literal 2 binary64)))

Outputs

(/.f64 (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) (*.f64 a #s(literal 2 binary64)))

(/.f64 (fma.f64 #s(literal -9/2 binary64) (*.f64 t z) (*.f64 #s(literal 1/2 binary64) (*.f64 y x))) a)

Symmetry

(negabs a)

(sort x y)

(sort z t)

Compiler

Compiled 13 to 13 computations (0% saved)

eval0.0ms (0%)

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

prune1.0ms (0%)

Memory

0.5MiB live, 0.5MiB allocated

Alt Table

Click to see full alt table

Status	Accuracy	Program
	91.4%	(/.f64 (-.f64 (.f64 x y) (.f64 (.f64 z #s(literal 9 binary64)) t)) (.f64 a #s(literal 2 binary64)))

Compiler

Compiled 26 to 26 computations (0% saved)

simplify27.0ms (0.6%)

Memory

0.6MiB live, 18.6MiB allocated

Algorithm

1×	egg-herbie

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	13	13
1	22	13
2	40	13
3	50	13
4	58	13
5	61	13

Stop Event

1×

saturated

Calls

Call 1

Inputs
(/.f64 (-.f64 (.f64 x y) (.f64 (.f64 z #s(literal 9 binary64)) t)) (.f64 a #s(literal 2 binary64)))

Outputs

(/.f64 (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) (*.f64 a #s(literal 2 binary64)))

(/.f64 (-.f64 (*.f64 y x) (*.f64 t (*.f64 #s(literal 9 binary64) z))) (*.f64 #s(literal 2 binary64) a))

soundness0.0ms (0%)

Memory

0.2MiB live, 0.2MiB allocated

Stop Event

1×

fuel

Compiler

Compiled 13 to 13 computations (0% saved)

preprocess17.0ms (0.4%)

Memory

3.0MiB live, 10.8MiB allocated

Remove

(sort x y)

(negabs a)

Compiler

Compiled 362 to 330 computations (8.8% saved)

end0.0ms (0%)

Memory: 0.0MiB live, 0.0MiB allocated

start0.0ms (0%)

analyze108.0ms (2.3%)

sample24.0ms (0.5%)

explain4.2s (89.2%)

preprocess326.0ms (7%)

eval0.0ms (0%)

prune1.0ms (0%)

simplify27.0ms (0.6%)

soundness0.0ms (0%)

preprocess17.0ms (0.4%)

end0.0ms (0%)

Profiling