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

Error

Derivation

  1. Initial program 0.0

    \[200 \cdot \left(x - y\right) \]
  2. Taylor expanded in x around 0 0.0

    \[\leadsto \color{blue}{200 \cdot x + -200 \cdot y} \]
  3. Simplified0.0

    \[\leadsto \color{blue}{\mathsf{fma}\left(-200, y, 200 \cdot x\right)} \]
    Proof
    (fma.f64 -200 y (*.f64 200 x)): 0 points increase in error, 0 points decrease in error
    (Rewrite<= fma-def_binary64 (+.f64 (*.f64 -200 y) (*.f64 200 x))): 4 points increase in error, 0 points decrease in error
    (Rewrite=> +-commutative_binary64 (+.f64 (*.f64 200 x) (*.f64 -200 y))): 0 points increase in error, 0 points decrease in error
  4. Final simplification0.0

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

Alternatives

Alternative 1
Error15.5
Cost456
\[\begin{array}{l} \mathbf{if}\;y \leq -1.4384754151455952 \cdot 10^{+33}:\\ \;\;\;\;-200 \cdot y\\ \mathbf{elif}\;y \leq 924047176.096879:\\ \;\;\;\;200 \cdot x\\ \mathbf{else}:\\ \;\;\;\;-200 \cdot y\\ \end{array} \]
Alternative 2
Error0.0
Cost320
\[200 \cdot \left(x - y\right) \]
Alternative 3
Error31.6
Cost192
\[200 \cdot x \]

Error

Reproduce

herbie shell --seed 2022301 
(FPCore (x y)
  :name "Data.Colour.CIE:cieLABView from colour-2.3.3, C"
  :precision binary64
  (* 200.0 (- x y)))