Metrics for Diagrams.Solve.Polynomial:cubForm from diagrams-solve-0.1, 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 10 to 8 computations (20% saved)

Precisions

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

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

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.3s (82.9%)

Results

1.2s	8255×	256	valid
0.0ms	1×	256	valid

Precisions

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

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

Operation ival-div, time spent: 83.0ms, 26.0% of total-time

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

Operation const, time spent: 18.0ms, 6.0% of total-time

Bogosity

preprocess151.0ms (9.8%)

Algorithm

1×	egg-herbie

Rules

296×	`fma-neg`
212×	`fma-define`
54×	`distribute-lft-neg-in`
46×	`distribute-lft-in`
42×	`distribute-rgt-in`

FPErrors

Click to see full error table

Example	Example	Subexpression
-	-	`1`
-	-	`2`
-	-	`y`
-	-	`(/.f64 1 2)`
-	-	`(*.f64 (/.f64 1 2) (+.f64 x y))`
-	-	`(+.f64 x y)`
-	-	`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

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	24	141
1	68	133
2	190	133
3	344	133
4	504	133
5	668	133
6	696	133
7	702	133

Stop Event

1×

saturated

Calls

Call 1

Inputs
(*.f64 (/.f64 1 2) (+.f64 x y))
(*.f64 (/.f64 1 2) (+.f64 x y))
(*.f64 (/.f64 1 2) (+.f64 (neg.f64 x) y))
(*.f64 (/.f64 1 2) (+.f64 x (neg.f64 y)))
(neg.f64 (*.f64 (/.f64 1 2) (+.f64 (neg.f64 x) y)))
(neg.f64 (*.f64 (/.f64 1 2) (+.f64 x (neg.f64 y))))
(*.f64 (/.f64 1 2) (+.f64 y x))

Outputs
(*.f64 (/.f64 1 2) (+.f64 x y))
(*.f64 1/2 (+.f64 x y))
(*.f64 (/.f64 1 2) (+.f64 x y))
(*.f64 1/2 (+.f64 x y))
(*.f64 (/.f64 1 2) (+.f64 (neg.f64 x) y))
(*.f64 1/2 (+.f64 y (neg.f64 x)))
(*.f64 1/2 (-.f64 y x))
(*.f64 (/.f64 1 2) (+.f64 x (neg.f64 y)))
(*.f64 1/2 (-.f64 x y))
(neg.f64 (*.f64 (/.f64 1 2) (+.f64 (neg.f64 x) y)))
(*.f64 1/2 (-.f64 x y))
(neg.f64 (*.f64 (/.f64 1 2) (+.f64 x (neg.f64 y))))
(*.f64 1/2 (+.f64 y (neg.f64 x)))
(*.f64 1/2 (-.f64 y x))
(*.f64 (/.f64 1 2) (+.f64 y x))
(*.f64 1/2 (+.f64 x y))

Symmetry

(sort x y)

Compiler

Compiled 58 to 40 computations (31% saved)

Precisions

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

Operation ival-div, time spent: 8.0ms, 41.0% of total-time

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

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

Operation const, time spent: 2.0ms, 10.0% of total-time

eval0.0ms (0%)

Compiler: Compiled 7 to 5 computations (28.6% saved)

prune1.0ms (0.1%)

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	(*.f64 1/2 (+.f64 x y))

Compiler

Compiled 7 to 5 computations (28.6% saved)

localize26.0ms (1.7%)

Compiler: Compiled 14 to 7 computations (50% saved)
Precisions: Click to see histograms. Total time spent on operations: 5.0ms
Operation ival-mult, time spent: 2.0ms, 44.0% of total-time
Operation ival-add, time spent: 2.0ms, 44.0% of total-time
Operation const, time spent: 1.0ms, 22.0% of total-time

eval0.0ms (0%)

Compiler: Compiled 2 to 2 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 1/2 (+.f64 x y))

Compiler

Compiled 21 to 14 computations (33.3% saved)

regimes12.0ms (0.8%)

Accuracy

Total 0b remaining (0%)

Threshold costs 0b (0%)

Counts

2 → 1

Calls

Call 1

Inputs
(*.f64 1/2 (+.f64 x y))
(*.f64 (/.f64 1 2) (+.f64 x y))

Outputs
(*.f64 1/2 (+.f64 x y))

Calls

4 calls:

4.0ms	(*.f64 (/.f64 1 2) (+.f64 x y))
3.0ms	y
3.0ms	(+.f64 x y)
2.0ms	x

Results

Accuracy	Segments	Branch
100.0%	1	`x`
100.0%	1	`y`
100.0%	1	`(*.f64 (/.f64 1 2) (+.f64 x y))`
100.0%	1	`(+.f64 x y)`

Compiler

Compiled 20 to 14 computations (30% saved)

simplify2.0ms (0.1%)

Algorithm

1×	egg-herbie

Rules

2×	`*-commutative`
2×	`+-commutative`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	10	19
1	12	19

Stop Event

1×	done
1×	saturated

Calls

Call 1

Inputs
(*.f64 1/2 (+.f64 x y))

Outputs
(*.f64 1/2 (+.f64 x y))

Compiler

Compiled 7 to 5 computations (28.6% saved)

soundness39.0ms (2.6%)

Rules

296×	`fma-neg`
212×	`fma-define`
54×	`distribute-lft-neg-in`
46×	`distribute-lft-in`
42×	`distribute-rgt-in`

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	24	141
1	68	133
2	190	133
3	344	133
4	504	133
5	668	133
6	696	133
7	702	133

Stop Event

1×

saturated

Compiler

Compiled 14 to 9 computations (35.7% saved)

end0.0ms (0%)

preprocess30.0ms (2%)

Remove: (sort x y)
Compiler: Compiled 74 to 54 computations (27% saved)

analyze0.0ms (0%)

sample1.3s (82.9%)

preprocess151.0ms (9.8%)

eval0.0ms (0%)

prune1.0ms (0.1%)

localize26.0ms (1.7%)

eval0.0ms (0%)

prune1.0ms (0.1%)

regimes12.0ms (0.8%)

simplify2.0ms (0.1%)

soundness39.0ms (2.6%)

end0.0ms (0%)

preprocess30.0ms (2%)

Profiling