Average Error: 0.0 → 0.0
Time: 2.8s
Precision: binary64
Cost: 6720
\[x - \left(y \cdot 4\right) \cdot z \]
\[\mathsf{fma}\left(y, z \cdot -4, x\right) \]
(FPCore (x y z) :precision binary64 (- x (* (* y 4.0) z)))
(FPCore (x y z) :precision binary64 (fma y (* z -4.0) x))
double code(double x, double y, double z) {
	return x - ((y * 4.0) * z);
}
double code(double x, double y, double z) {
	return fma(y, (z * -4.0), x);
}
function code(x, y, z)
	return Float64(x - Float64(Float64(y * 4.0) * z))
end
function code(x, y, z)
	return fma(y, Float64(z * -4.0), x)
end
code[x_, y_, z_] := N[(x - N[(N[(y * 4.0), $MachinePrecision] * z), $MachinePrecision]), $MachinePrecision]
code[x_, y_, z_] := N[(y * N[(z * -4.0), $MachinePrecision] + x), $MachinePrecision]
x - \left(y \cdot 4\right) \cdot z
\mathsf{fma}\left(y, z \cdot -4, x\right)

Error

Derivation

  1. Initial program 0.0

    \[x - \left(y \cdot 4\right) \cdot z \]
  2. Simplified0.0

    \[\leadsto \color{blue}{\mathsf{fma}\left(y, z \cdot -4, x\right)} \]
    Proof
    (fma.f64 y (*.f64 z -4) x): 0 points increase in error, 0 points decrease in error
    (fma.f64 y (*.f64 z (Rewrite<= metadata-eval (neg.f64 4))) x): 0 points increase in error, 0 points decrease in error
    (fma.f64 y (Rewrite<= distribute-rgt-neg-in_binary64 (neg.f64 (*.f64 z 4))) x): 0 points increase in error, 0 points decrease in error
    (fma.f64 y (neg.f64 (Rewrite<= *-commutative_binary64 (*.f64 4 z))) x): 0 points increase in error, 0 points decrease in error
    (Rewrite<= fma-def_binary64 (+.f64 (*.f64 y (neg.f64 (*.f64 4 z))) x)): 3 points increase in error, 0 points decrease in error
    (+.f64 (Rewrite<= distribute-rgt-neg-in_binary64 (neg.f64 (*.f64 y (*.f64 4 z)))) x): 0 points increase in error, 0 points decrease in error
    (+.f64 (neg.f64 (Rewrite<= associate-*l*_binary64 (*.f64 (*.f64 y 4) z))) x): 0 points increase in error, 0 points decrease in error
    (+.f64 (Rewrite<= distribute-lft-neg-out_binary64 (*.f64 (neg.f64 (*.f64 y 4)) z)) x): 0 points increase in error, 0 points decrease in error
    (Rewrite<= +-commutative_binary64 (+.f64 x (*.f64 (neg.f64 (*.f64 y 4)) z))): 0 points increase in error, 0 points decrease in error
    (Rewrite<= cancel-sign-sub-inv_binary64 (-.f64 x (*.f64 (*.f64 y 4) z))): 0 points increase in error, 0 points decrease in error
  3. Final simplification0.0

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

Alternatives

Alternative 1
Error17.6
Cost1112
\[\begin{array}{l} t_0 := -4 \cdot \left(y \cdot z\right)\\ \mathbf{if}\;x \leq -3.111140107363299 \cdot 10^{+46}:\\ \;\;\;\;x\\ \mathbf{elif}\;x \leq -3.5672726194906474 \cdot 10^{-112}:\\ \;\;\;\;t_0\\ \mathbf{elif}\;x \leq -7.624069855646129 \cdot 10^{-166}:\\ \;\;\;\;x\\ \mathbf{elif}\;x \leq 2.871355186509439 \cdot 10^{-123}:\\ \;\;\;\;t_0\\ \mathbf{elif}\;x \leq 2.4488349750621556 \cdot 10^{-89}:\\ \;\;\;\;x\\ \mathbf{elif}\;x \leq 4.4490122196599367 \cdot 10^{-35}:\\ \;\;\;\;t_0\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \]
Alternative 2
Error0.0
Cost448
\[x - z \cdot \left(y \cdot 4\right) \]
Alternative 3
Error27.1
Cost64
\[x \]

Error

Reproduce

herbie shell --seed 2022316 
(FPCore (x y z)
  :name "Diagrams.Solve.Polynomial:quadForm from diagrams-solve-0.1, A"
  :precision binary64
  (- x (* (* y 4.0) z)))