Average Error: 0.0 → 0.0
Time: 1.5s
Precision: 64
\[200 \cdot \left(x - y\right)\]
↓
\[200 \cdot x + 200 \cdot \left(-y\right)\]
200 \cdot \left(x - y\right)
↓
200 \cdot x + 200 \cdot \left(-y\right)
double f(double x, double y) {
        double r340202 = 200.0;
        double r340203 = x;
        double r340204 = y;
        double r340205 = r340203 - r340204;
        double r340206 = r340202 * r340205;
        return r340206;
}
↓
double f(double x, double y) {
        double r340207 = 200.0;
        double r340208 = x;
        double r340209 = r340207 * r340208;
        double r340210 = y;
        double r340211 = -r340210;
        double r340212 = r340207 * r340211;
        double r340213 = r340209 + r340212;
        return r340213;
}

Error

Bits error versus x

Bits error versus y

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[200 \cdot \left(x - y\right)\]
  2. Using strategy rm

  3. Applied sub-neg0.0

    \[\leadsto 200 \cdot \color{blue}{\left(x + \left(-y\right)\right)}\]

  4. Applied distribute-lft-in0.0

    \[\leadsto \color{blue}{200 \cdot x + 200 \cdot \left(-y\right)}\]

  5. Final simplification0.0

    \[\leadsto 200 \cdot x + 200 \cdot \left(-y\right)\]

Reproduce

herbie shell --seed 2020024 +o rules:numerics
(FPCore (x y)
  :name "Data.Colour.CIE:cieLABView from colour-2.3.3, C"
  :precision binary64
  (* 200 (- x y)))