Average Error: 0.0 → 0.0
Time: 1.9s
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 r208531 = 200.0;
        double r208532 = x;
        double r208533 = y;
        double r208534 = r208532 - r208533;
        double r208535 = r208531 * r208534;
        return r208535;
}
↓
double f(double x, double y) {
        double r208536 = 200.0;
        double r208537 = x;
        double r208538 = r208536 * r208537;
        double r208539 = y;
        double r208540 = -r208539;
        double r208541 = r208536 * r208540;
        double r208542 = r208538 + r208541;
        return r208542;
}

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