Metrics for Diagrams.Solve.Polynomial:quartForm from diagrams-solve-0.1, D

analyze1.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 13 to 10 computations (23.1% saved)

sample5.6s (95.1%)

Results

774.0ms	8255×	0	valid-sollya
1.4s	8255×	0	valid-rival

Bogosity

preprocess196.0ms (3.3%)

Algorithm

1×	egg-herbie

Rules

661×	`fma-define`
378×	`fma-neg`
86×	`unsub-neg`
83×	`distribute-lft-neg-in`
79×	`associate-r`

Iterations

Useful iterations: 2 (0.0ms)

Iter	Nodes	Cost
0	41	398
1	83	342
2	171	330
3	373	330
4	780	330
5	1448	330
6	2207	330
7	2262	330
8	2268	330
9	2268	330

Stop Event

1×

saturated

Calls

Call 1

Inputs
(-.f64 (/.f64 (*.f64 x y) #s(literal 2 binary64)) (/.f64 z #s(literal 8 binary64)))
(-.f64 (/.f64 (*.f64 x y) #s(literal 2 binary64)) (/.f64 z #s(literal 8 binary64)))
(-.f64 (/.f64 (*.f64 (neg.f64 x) y) #s(literal 2 binary64)) (/.f64 z #s(literal 8 binary64)))
(-.f64 (/.f64 (*.f64 x (neg.f64 y)) #s(literal 2 binary64)) (/.f64 z #s(literal 8 binary64)))
(-.f64 (/.f64 (*.f64 x y) #s(literal 2 binary64)) (/.f64 (neg.f64 z) #s(literal 8 binary64)))
(neg.f64 (-.f64 (/.f64 (*.f64 (neg.f64 x) y) #s(literal 2 binary64)) (/.f64 z #s(literal 8 binary64))))
(neg.f64 (-.f64 (/.f64 (*.f64 x (neg.f64 y)) #s(literal 2 binary64)) (/.f64 z #s(literal 8 binary64))))
(neg.f64 (-.f64 (/.f64 (*.f64 x y) #s(literal 2 binary64)) (/.f64 (neg.f64 z) #s(literal 8 binary64))))
(-.f64 (/.f64 (*.f64 y x) #s(literal 2 binary64)) (/.f64 z #s(literal 8 binary64)))
(-.f64 (/.f64 (*.f64 z y) #s(literal 2 binary64)) (/.f64 x #s(literal 8 binary64)))
(-.f64 (/.f64 (*.f64 x z) #s(literal 2 binary64)) (/.f64 y #s(literal 8 binary64)))

Outputs
(-.f64 (/.f64 (*.f64 x y) #s(literal 2 binary64)) (/.f64 z #s(literal 8 binary64)))
(-.f64 (*.f64 x (/.f64 y #s(literal 2 binary64))) (/.f64 z #s(literal 8 binary64)))
(fma.f64 y (/.f64 x #s(literal 2 binary64)) (/.f64 z #s(literal -8 binary64)))
(fma.f64 y (/.f64 x #s(literal 2 binary64)) (*.f64 z #s(literal -1/8 binary64)))
(fma.f64 x (.f64 y #s(literal 1/2 binary64)) (.f64 z #s(literal -1/8 binary64)))
(-.f64 (/.f64 (*.f64 x y) #s(literal 2 binary64)) (/.f64 z #s(literal 8 binary64)))
(-.f64 (*.f64 x (/.f64 y #s(literal 2 binary64))) (/.f64 z #s(literal 8 binary64)))
(fma.f64 y (/.f64 x #s(literal 2 binary64)) (/.f64 z #s(literal -8 binary64)))
(fma.f64 y (/.f64 x #s(literal 2 binary64)) (*.f64 z #s(literal -1/8 binary64)))
(fma.f64 x (.f64 y #s(literal 1/2 binary64)) (.f64 z #s(literal -1/8 binary64)))
(-.f64 (/.f64 (*.f64 (neg.f64 x) y) #s(literal 2 binary64)) (/.f64 z #s(literal 8 binary64)))
(-.f64 (*.f64 x (/.f64 (neg.f64 y) #s(literal 2 binary64))) (/.f64 z #s(literal 8 binary64)))
(neg.f64 (fma.f64 y (/.f64 x #s(literal 2 binary64)) (/.f64 z #s(literal 8 binary64))))
(fma.f64 x (.f64 y #s(literal -1/2 binary64)) (.f64 z #s(literal -1/8 binary64)))
(-.f64 (/.f64 (*.f64 x (neg.f64 y)) #s(literal 2 binary64)) (/.f64 z #s(literal 8 binary64)))
(-.f64 (*.f64 x (/.f64 (neg.f64 y) #s(literal 2 binary64))) (/.f64 z #s(literal 8 binary64)))
(neg.f64 (fma.f64 y (/.f64 x #s(literal 2 binary64)) (/.f64 z #s(literal 8 binary64))))
(fma.f64 x (.f64 y #s(literal -1/2 binary64)) (.f64 z #s(literal -1/8 binary64)))
(-.f64 (/.f64 (*.f64 x y) #s(literal 2 binary64)) (/.f64 (neg.f64 z) #s(literal 8 binary64)))
(-.f64 (*.f64 x (/.f64 y #s(literal 2 binary64))) (/.f64 (neg.f64 z) #s(literal 8 binary64)))
(fma.f64 y (/.f64 x #s(literal 2 binary64)) (/.f64 z #s(literal 8 binary64)))
(fma.f64 y (/.f64 x #s(literal 2 binary64)) (*.f64 z #s(literal 1/8 binary64)))
(fma.f64 y (.f64 x #s(literal 1/2 binary64)) (.f64 z #s(literal 1/8 binary64)))
(neg.f64 (-.f64 (/.f64 (*.f64 (neg.f64 x) y) #s(literal 2 binary64)) (/.f64 z #s(literal 8 binary64))))
(-.f64 (*.f64 x (/.f64 y #s(literal 2 binary64))) (/.f64 (neg.f64 z) #s(literal 8 binary64)))
(fma.f64 y (/.f64 x #s(literal 2 binary64)) (/.f64 z #s(literal 8 binary64)))
(fma.f64 y (/.f64 x #s(literal 2 binary64)) (*.f64 z #s(literal 1/8 binary64)))
(fma.f64 y (.f64 x #s(literal 1/2 binary64)) (.f64 z #s(literal 1/8 binary64)))
(neg.f64 (-.f64 (/.f64 (*.f64 x (neg.f64 y)) #s(literal 2 binary64)) (/.f64 z #s(literal 8 binary64))))
(-.f64 (*.f64 x (/.f64 y #s(literal 2 binary64))) (/.f64 (neg.f64 z) #s(literal 8 binary64)))
(fma.f64 y (/.f64 x #s(literal 2 binary64)) (/.f64 z #s(literal 8 binary64)))
(fma.f64 y (/.f64 x #s(literal 2 binary64)) (*.f64 z #s(literal 1/8 binary64)))
(fma.f64 y (.f64 x #s(literal 1/2 binary64)) (.f64 z #s(literal 1/8 binary64)))
(neg.f64 (-.f64 (/.f64 (*.f64 x y) #s(literal 2 binary64)) (/.f64 (neg.f64 z) #s(literal 8 binary64))))
(-.f64 (*.f64 x (/.f64 (neg.f64 y) #s(literal 2 binary64))) (/.f64 z #s(literal 8 binary64)))
(neg.f64 (fma.f64 y (/.f64 x #s(literal 2 binary64)) (/.f64 z #s(literal 8 binary64))))
(fma.f64 x (.f64 y #s(literal -1/2 binary64)) (.f64 z #s(literal -1/8 binary64)))
(-.f64 (/.f64 (*.f64 y x) #s(literal 2 binary64)) (/.f64 z #s(literal 8 binary64)))
(-.f64 (*.f64 x (/.f64 y #s(literal 2 binary64))) (/.f64 z #s(literal 8 binary64)))
(fma.f64 y (/.f64 x #s(literal 2 binary64)) (/.f64 z #s(literal -8 binary64)))
(fma.f64 y (/.f64 x #s(literal 2 binary64)) (*.f64 z #s(literal -1/8 binary64)))
(fma.f64 x (.f64 y #s(literal 1/2 binary64)) (.f64 z #s(literal -1/8 binary64)))
(-.f64 (/.f64 (*.f64 z y) #s(literal 2 binary64)) (/.f64 x #s(literal 8 binary64)))
(-.f64 (*.f64 z (/.f64 y #s(literal 2 binary64))) (/.f64 x #s(literal 8 binary64)))
(fma.f64 z (/.f64 y #s(literal 2 binary64)) (/.f64 x #s(literal -8 binary64)))
(fma.f64 y (/.f64 z #s(literal 2 binary64)) (*.f64 x #s(literal -1/8 binary64)))
(fma.f64 y (.f64 z #s(literal 1/2 binary64)) (.f64 x #s(literal -1/8 binary64)))
(-.f64 (/.f64 (*.f64 x z) #s(literal 2 binary64)) (/.f64 y #s(literal 8 binary64)))
(-.f64 (*.f64 x (/.f64 z #s(literal 2 binary64))) (/.f64 y #s(literal 8 binary64)))
(fma.f64 x (/.f64 z #s(literal 2 binary64)) (/.f64 y #s(literal -8 binary64)))
(fma.f64 x (/.f64 z #s(literal 2 binary64)) (*.f64 y #s(literal -1/8 binary64)))
(fma.f64 x (.f64 z #s(literal 1/2 binary64)) (.f64 y #s(literal -1/8 binary64)))

Symmetry

(sort x y)

Compiler

Compiled 12 to 9 computations (25% saved)

eval0.0ms (0%)

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

prune3.0ms (0.1%)

Alt Table

Click to see full alt table

Status	Accuracy	Program
	100.0%	(-.f64 (/.f64 (*.f64 x y) #s(literal 2 binary64)) (/.f64 z #s(literal 8 binary64)))

Compiler

Compiled 24 to 18 computations (25% saved)

simplify8.0ms (0.1%)

Algorithm

1×	egg-herbie

Rules

4×	`sub-neg`
4×	`*-commutative`
4×	`+-commutative`
3×	`neg-sub0`
3×	`neg-mul-1`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	15	34
1	19	34
2	28	34
3	34	34
4	39	34
5	41	34

Stop Event

1×

saturated

Calls

Call 1

Inputs
(-.f64 (/.f64 (*.f64 x y) #s(literal 2 binary64)) (/.f64 z #s(literal 8 binary64)))

Outputs
(-.f64 (/.f64 (*.f64 x y) #s(literal 2 binary64)) (/.f64 z #s(literal 8 binary64)))

soundness2.0ms (0%)

Stop Event

1×

fuel

Compiler

Compiled 12 to 9 computations (25% saved)

preprocess78.0ms (1.3%)

Remove: (sort x y)
Compiler: Compiled 96 to 72 computations (25% saved)

Diagrams.Solve.Polynomial:quartForm from diagrams-solve-0.1, D

analyze1.0ms (0%)

sample5.6s (95.1%)

preprocess196.0ms (3.3%)

eval0.0ms (0%)

prune3.0ms (0.1%)

simplify8.0ms (0.1%)

soundness2.0ms (0%)

preprocess78.0ms (1.3%)

end0.0ms (0%)

Profiling