Average Error: 0.0 → 0.0
Time: 12.3s
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 r232391 = 200.0;
        double r232392 = x;
        double r232393 = y;
        double r232394 = r232392 - r232393;
        double r232395 = r232391 * r232394;
        return r232395;
}
↓
double f(double x, double y) {
        double r232396 = 200.0;
        double r232397 = x;
        double r232398 = r232396 * r232397;
        double r232399 = y;
        double r232400 = -r232399;
        double r232401 = r232396 * r232400;
        double r232402 = r232398 + r232401;
        return r232402;
}

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