Average Error: 0.0 → 0.0
Time: 2.1s
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 r175551 = 200.0;
        double r175552 = x;
        double r175553 = y;
        double r175554 = r175552 - r175553;
        double r175555 = r175551 * r175554;
        return r175555;
}
↓
double f(double x, double y) {
        double r175556 = 200.0;
        double r175557 = x;
        double r175558 = r175556 * r175557;
        double r175559 = y;
        double r175560 = -r175559;
        double r175561 = r175556 * r175560;
        double r175562 = r175558 + r175561;
        return r175562;
}

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