Average Error: 0.0 → 0.0
Time: 1.4s
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 r258336 = 200.0;
        double r258337 = x;
        double r258338 = y;
        double r258339 = r258337 - r258338;
        double r258340 = r258336 * r258339;
        return r258340;
}

double f(double x, double y) {
        double r258341 = 200.0;
        double r258342 = x;
        double r258343 = r258341 * r258342;
        double r258344 = y;
        double r258345 = -r258344;
        double r258346 = r258341 * r258345;
        double r258347 = r258343 + r258346;
        return r258347;
}

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