Metrics for Graphics.Rasterific.QuadraticFormula:discriminant from Rasterific-0.6.1

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 9 computations (30.8% saved)

sample5.1s (96.5%)

Results

1.1s	8256×	valid-rival
850.0ms	8254×	valid-sollya
10.0ms	2×	exit-sollya

Bogosity

preprocess134.0ms (2.5%)

Algorithm

1×	egg-herbie

Rules

425×	`fma-define`
210×	`fma-neg`
96×	`distribute-lft-neg-in`
94×	`associate-r`
94×	`cancel-sign-sub-inv`

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	38	435
1	116	375
2	284	375
3	713	375
4	1184	375
5	1616	375
6	1710	375
7	1718	375
8	1718	375

Stop Event

1×

saturated

Calls

Call 1

Inputs
(-.f64 (.f64 x x) (.f64 (*.f64 y #s(literal 4 binary64)) z))
(-.f64 (.f64 x x) (.f64 (*.f64 y #s(literal 4 binary64)) z))
(-.f64 (.f64 (neg.f64 x) (neg.f64 x)) (.f64 (*.f64 y #s(literal 4 binary64)) z))
(-.f64 (.f64 x x) (.f64 (*.f64 (neg.f64 y) #s(literal 4 binary64)) z))
(-.f64 (.f64 x x) (.f64 (*.f64 y #s(literal 4 binary64)) (neg.f64 z)))
(neg.f64 (-.f64 (.f64 (neg.f64 x) (neg.f64 x)) (.f64 (*.f64 y #s(literal 4 binary64)) z)))
(neg.f64 (-.f64 (.f64 x x) (.f64 (*.f64 (neg.f64 y) #s(literal 4 binary64)) z)))
(neg.f64 (-.f64 (.f64 x x) (.f64 (*.f64 y #s(literal 4 binary64)) (neg.f64 z))))
(-.f64 (.f64 y y) (.f64 (*.f64 x #s(literal 4 binary64)) z))
(-.f64 (.f64 z z) (.f64 (*.f64 y #s(literal 4 binary64)) x))
(-.f64 (.f64 x x) (.f64 (*.f64 z #s(literal 4 binary64)) y))

Outputs
(-.f64 (.f64 x x) (.f64 (*.f64 y #s(literal 4 binary64)) z))
(fma.f64 x x (.f64 (.f64 y #s(literal 4 binary64)) (neg.f64 z)))
(fma.f64 x x (.f64 y (.f64 z #s(literal -4 binary64))))
(-.f64 (.f64 x x) (.f64 (*.f64 y #s(literal 4 binary64)) z))
(fma.f64 x x (.f64 (.f64 y #s(literal 4 binary64)) (neg.f64 z)))
(fma.f64 x x (.f64 y (.f64 z #s(literal -4 binary64))))
(-.f64 (.f64 (neg.f64 x) (neg.f64 x)) (.f64 (*.f64 y #s(literal 4 binary64)) z))
(fma.f64 x x (.f64 (.f64 y #s(literal 4 binary64)) (neg.f64 z)))
(fma.f64 x x (.f64 y (.f64 z #s(literal -4 binary64))))
(-.f64 (.f64 x x) (.f64 (*.f64 (neg.f64 y) #s(literal 4 binary64)) z))
(-.f64 (.f64 x x) (.f64 z (neg.f64 (*.f64 y #s(literal 4 binary64)))))
(fma.f64 x x (.f64 y (.f64 #s(literal 4 binary64) z)))
(fma.f64 x x (.f64 (.f64 y #s(literal 4 binary64)) z))
(-.f64 (.f64 x x) (.f64 (*.f64 y #s(literal 4 binary64)) (neg.f64 z)))
(-.f64 (.f64 x x) (.f64 z (neg.f64 (*.f64 y #s(literal 4 binary64)))))
(fma.f64 x x (.f64 y (.f64 #s(literal 4 binary64) z)))
(fma.f64 x x (.f64 (.f64 y #s(literal 4 binary64)) z))
(neg.f64 (-.f64 (.f64 (neg.f64 x) (neg.f64 x)) (.f64 (*.f64 y #s(literal 4 binary64)) z)))
(neg.f64 (fma.f64 x x (.f64 (.f64 y #s(literal 4 binary64)) (neg.f64 z))))
(neg.f64 (fma.f64 x x (.f64 y (.f64 z #s(literal -4 binary64)))))
(-.f64 (.f64 (.f64 y #s(literal 4 binary64)) z) (*.f64 x x))
(neg.f64 (-.f64 (.f64 x x) (.f64 (*.f64 (neg.f64 y) #s(literal 4 binary64)) z)))
(neg.f64 (-.f64 (.f64 x x) (.f64 z (neg.f64 (*.f64 y #s(literal 4 binary64))))))
(neg.f64 (fma.f64 x x (.f64 y (.f64 #s(literal 4 binary64) z))))
(-.f64 (.f64 y (.f64 z #s(literal -4 binary64))) (*.f64 x x))
(neg.f64 (-.f64 (.f64 x x) (.f64 (*.f64 y #s(literal 4 binary64)) (neg.f64 z))))
(neg.f64 (-.f64 (.f64 x x) (.f64 z (neg.f64 (*.f64 y #s(literal 4 binary64))))))
(neg.f64 (fma.f64 x x (.f64 y (.f64 #s(literal 4 binary64) z))))
(-.f64 (.f64 y (.f64 z #s(literal -4 binary64))) (*.f64 x x))
(-.f64 (.f64 y y) (.f64 (*.f64 x #s(literal 4 binary64)) z))
(-.f64 (.f64 y y) (.f64 z (*.f64 x #s(literal 4 binary64))))
(fma.f64 y y (.f64 x (.f64 z #s(literal -4 binary64))))
(fma.f64 x (.f64 z #s(literal -4 binary64)) (.f64 y y))
(-.f64 (.f64 z z) (.f64 (*.f64 y #s(literal 4 binary64)) x))
(-.f64 (.f64 z z) (.f64 y (*.f64 x #s(literal 4 binary64))))
(fma.f64 z z (.f64 x (.f64 y #s(literal -4 binary64))))
(fma.f64 y (.f64 x #s(literal -4 binary64)) (.f64 z z))
(-.f64 (.f64 x x) (.f64 (*.f64 z #s(literal 4 binary64)) y))
(fma.f64 x x (.f64 (.f64 y #s(literal 4 binary64)) (neg.f64 z)))
(fma.f64 x x (.f64 y (.f64 z #s(literal -4 binary64))))

Symmetry

(abs x)

(sort y z)

Compiler

Compiled 12 to 8 computations (33.3% saved)

eval0.0ms (0%)

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

prune2.0ms (0%)

Alt Table

Click to see full alt table

Status	Accuracy	Program
	99.2%	(-.f64 (.f64 x x) (.f64 (*.f64 y #s(literal 4 binary64)) z))

Compiler

Compiled 24 to 16 computations (33.3% saved)

simplify4.0ms (0.1%)

Algorithm

1×	egg-herbie

Rules

7×	`*-commutative`
6×	`sub-neg`
6×	`+-commutative`
5×	`neg-sub0`
5×	`neg-mul-1`

Iterations

Useful iterations: 0 (0.0ms)

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

Stop Event

1×

saturated

Calls

Call 1

Inputs
(-.f64 (.f64 x x) (.f64 (*.f64 y #s(literal 4 binary64)) z))

Outputs
(-.f64 (.f64 x x) (.f64 (*.f64 y #s(literal 4 binary64)) z))

soundness1.0ms (0%)

Stop Event

1×

fuel

Compiler

Compiled 12 to 8 computations (33.3% saved)

preprocess41.0ms (0.8%)

Remove

(sort y z)

(abs x)

Compiler

Compiled 144 to 96 computations (33.3% saved)

Graphics.Rasterific.QuadraticFormula:discriminant from Rasterific-0.6.1

analyze1.0ms (0%)

sample5.1s (96.5%)

preprocess134.0ms (2.5%)

eval0.0ms (0%)

prune2.0ms (0%)

simplify4.0ms (0.1%)

soundness1.0ms (0%)

preprocess41.0ms (0.8%)

end0.0ms (0%)

Profiling