Average Error: 0.0 → 0.0
Time: 13.7s
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 r150394 = 200.0;
        double r150395 = x;
        double r150396 = y;
        double r150397 = r150395 - r150396;
        double r150398 = r150394 * r150397;
        return r150398;
}
↓
double f(double x, double y) {
        double r150399 = 200.0;
        double r150400 = x;
        double r150401 = r150399 * r150400;
        double r150402 = y;
        double r150403 = -r150402;
        double r150404 = r150399 * r150403;
        double r150405 = r150401 + r150404;
        return r150405;
}

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 2019325 
(FPCore (x y)
  :name "Data.Colour.CIE:cieLABView from colour-2.3.3, C"
  :precision binary64
  (* 200 (- x y)))