Average Error: 0.0 → 0.0
Time: 9.8s
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 r142164 = 200.0;
        double r142165 = x;
        double r142166 = y;
        double r142167 = r142165 - r142166;
        double r142168 = r142164 * r142167;
        return r142168;
}
↓
double f(double x, double y) {
        double r142169 = 200.0;
        double r142170 = x;
        double r142171 = r142169 * r142170;
        double r142172 = y;
        double r142173 = -r142172;
        double r142174 = r142169 * r142173;
        double r142175 = r142171 + r142174;
        return r142175;
}

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