Data.Random.Distribution.Normal:normalTail from random-fu-0.2.6.2

Average Accuracy: 100.0% → 100.0%

Time: 1.6s

Precision: binary64

Cost: 6720

Math

\[\left(x \cdot x + y\right) + y \]

↓

\[\mathsf{fma}\left(x, x, y + y\right) \]

FPCore

(FPCore (x y) :precision binary64 (+ (+ (* x x) y) y))

↓

(FPCore (x y) :precision binary64 (fma x x (+ y y)))

C

double code(double x, double y) {
	return ((x * x) + y) + y;
}

↓

double code(double x, double y) {
	return fma(x, x, (y + y));
}

Julia

function code(x, y)
	return Float64(Float64(Float64(x * x) + y) + y)
end

↓

function code(x, y)
	return fma(x, x, Float64(y + y))
end

Wolfram

code[x_, y_] := N[(N[(N[(x * x), $MachinePrecision] + y), $MachinePrecision] + y), $MachinePrecision]

↓

code[x_, y_] := N[(x * x + N[(y + y), $MachinePrecision]), $MachinePrecision]

Target

Original	100.0%
Target	100.0%
Herbie	100.0%

\[\left(y + y\right) + x \cdot x \]

Derivation

1. Initial program 100.0%

   \[\left(x \cdot x + y\right) + y \]

2. Simplified 100.0%

   \[\leadsto \color{blue}{\mathsf{fma}\left(x, x, y + y\right)} \]
   Proof

   [Start] 100.0	\[ \left(x \cdot x + y\right) + y \]
   associate-+l+ [=>] 100.0	\[ \color{blue}{x \cdot x + \left(y + y\right)} \]
   fma-def [=>] 100.0	\[ \color{blue}{\mathsf{fma}\left(x, x, y + y\right)} \]

3. Final simplification 100.0%

   \[\leadsto \mathsf{fma}\left(x, x, y + y\right) \]

Alternatives

Alternative 1
Accuracy	80.9%
Cost	973

\[\begin{array}{l} \mathbf{if}\;x \cdot x \leq 2 \cdot 10^{-65} \lor \neg \left(x \cdot x \leq 3.4 \cdot 10^{+37}\right) \land x \cdot x \leq 4 \cdot 10^{+101}:\\ \;\;\;\;y + y\\ \mathbf{else}:\\ \;\;\;\;x \cdot x\\ \end{array} \]

Alternative 2
Accuracy	100.0%
Cost	448

\[y + \left(y + x \cdot x\right) \]

Alternative 3
Accuracy	35.9%
Cost	192

\[x \cdot x \]

Reproduce

herbie shell --seed 2023138 
(FPCore (x y)
  :name "Data.Random.Distribution.Normal:normalTail from random-fu-0.2.6.2"
  :precision binary64

  :herbie-target
  (+ (+ y y) (* x x))

  (+ (+ (* x x) y) y))