Average Error: 6.0 → 0.1
Time: 6.3s
Precision: binary64
Cost: 6720
\[x + \frac{y \cdot y}{z} \]
↓
\[\mathsf{fma}\left(y, \frac{y}{z}, x\right) \]
(FPCore (x y z) :precision binary64 (+ x (/ (* y y) z)))
↓
(FPCore (x y z) :precision binary64 (fma y (/ y z) x))
double code(double x, double y, double z) {
	return x + ((y * y) / z);
}
↓
double code(double x, double y, double z) {
	return fma(y, (y / z), x);
}

function code(x, y, z)
	return Float64(x + Float64(Float64(y * y) / z))
end
↓
function code(x, y, z)
	return fma(y, Float64(y / z), x)
end

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

x + \frac{y \cdot y}{z}
↓
\mathsf{fma}\left(y, \frac{y}{z}, x\right)

Error

Target

Original6.0
Target0.1
Herbie0.1
\[x + y \cdot \frac{y}{z} \]

Derivation

  1. Initial program 6.0

    \[x + \frac{y \cdot y}{z} \]

  2. Simplified0.1

    \[\leadsto \color{blue}{\mathsf{fma}\left(y, \frac{y}{z}, x\right)} \]
    Proof
    (fma.f64 y (/.f64 y z) x): 0 points increase in error, 0 points decrease in error
    (Rewrite<= fma-def_binary64 (+.f64 (*.f64 y (/.f64 y z)) x)): 2 points increase in error, 0 points decrease in error
    (+.f64 (Rewrite=> associate-*r/_binary64 (/.f64 (*.f64 y y) z)) x): 36 points increase in error, 11 points decrease in error
    (Rewrite<= +-commutative_binary64 (+.f64 x (/.f64 (*.f64 y y) z))): 0 points increase in error, 0 points decrease in error

  3. Final simplification0.1

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

Alternatives

Alternative 1
Error15.2
Cost1096
\[\begin{array}{l} t_0 := \frac{y \cdot y}{z}\\ \mathbf{if}\;t_0 \leq -2.120682854804669 \cdot 10^{-107}:\\ \;\;\;\;t_0\\ \mathbf{elif}\;t_0 \leq 88317817641084.6:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;t_0\\ \end{array} \]
Alternative 2
Error11.1
Cost1096
\[\begin{array}{l} t_0 := \frac{y \cdot y}{z}\\ t_1 := \frac{y}{\frac{z}{y}}\\ \mathbf{if}\;t_0 \leq -2 \cdot 10^{-107}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;t_0 \leq 10^{+14}:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;t_1\\ \end{array} \]
Alternative 3
Error11.1
Cost1096
\[\begin{array}{l} t_0 := \frac{y \cdot y}{z}\\ \mathbf{if}\;t_0 \leq -2 \cdot 10^{-107}:\\ \;\;\;\;y \cdot \frac{y}{z}\\ \mathbf{elif}\;t_0 \leq 10^{+14}:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;\frac{y}{\frac{z}{y}}\\ \end{array} \]
Alternative 4
Error0.1
Cost448
\[x + y \cdot \frac{y}{z} \]
Alternative 5
Error20.7
Cost64
\[x \]

Error

Reproduce

herbie shell --seed 2022316 
(FPCore (x y z)
  :name "Crypto.Random.Test:calculate from crypto-random-0.0.9"
  :precision binary64

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

  (+ x (/ (* y y) z)))