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 r236733 = 200.0;
        double r236734 = x;
        double r236735 = y;
        double r236736 = r236734 - r236735;
        double r236737 = r236733 * r236736;
        return r236737;
}
↓
double f(double x, double y) {
        double r236738 = 200.0;
        double r236739 = x;
        double r236740 = r236738 * r236739;
        double r236741 = y;
        double r236742 = -r236741;
        double r236743 = r236738 * r236742;
        double r236744 = r236740 + r236743;
        return r236744;
}

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