Average Error: 0.0 → 0.0
Time: 2.6s
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 r251457 = 200.0;
        double r251458 = x;
        double r251459 = y;
        double r251460 = r251458 - r251459;
        double r251461 = r251457 * r251460;
        return r251461;
}

double f(double x, double y) {
        double r251462 = 200.0;
        double r251463 = x;
        double r251464 = r251462 * r251463;
        double r251465 = y;
        double r251466 = -r251465;
        double r251467 = r251462 * r251466;
        double r251468 = r251464 + r251467;
        return r251468;
}

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