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 r279309 = 200.0;
        double r279310 = x;
        double r279311 = y;
        double r279312 = r279310 - r279311;
        double r279313 = r279309 * r279312;
        return r279313;
}
↓
double f(double x, double y) {
        double r279314 = 200.0;
        double r279315 = x;
        double r279316 = r279314 * r279315;
        double r279317 = y;
        double r279318 = -r279317;
        double r279319 = r279314 * r279318;
        double r279320 = r279316 + r279319;
        return r279320;
}

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