Average Error: 0.0 → 0.0
Time: 13.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 r168295 = 200.0;
        double r168296 = x;
        double r168297 = y;
        double r168298 = r168296 - r168297;
        double r168299 = r168295 * r168298;
        return r168299;
}
↓
double f(double x, double y) {
        double r168300 = 200.0;
        double r168301 = x;
        double r168302 = r168300 * r168301;
        double r168303 = y;
        double r168304 = -r168303;
        double r168305 = r168300 * r168304;
        double r168306 = r168302 + r168305;
        return r168306;
}

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)))