Average Error: 0.0 → 0.0
Time: 12.3s
Precision: 64
\[200.0 \cdot \left(x - y\right)\]
↓
\[200.0 \cdot \left(-y\right) + x \cdot 200.0\]
200.0 \cdot \left(x - y\right)
↓
200.0 \cdot \left(-y\right) + x \cdot 200.0
double f(double x, double y) {
        double r13473216 = 200.0;
        double r13473217 = x;
        double r13473218 = y;
        double r13473219 = r13473217 - r13473218;
        double r13473220 = r13473216 * r13473219;
        return r13473220;
}
↓
double f(double x, double y) {
        double r13473221 = 200.0;
        double r13473222 = y;
        double r13473223 = -r13473222;
        double r13473224 = r13473221 * r13473223;
        double r13473225 = x;
        double r13473226 = r13473225 * r13473221;
        double r13473227 = r13473224 + r13473226;
        return r13473227;
}

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.0 \cdot \left(x - y\right)\]
  2. Using strategy rm

  3. Applied sub-neg0.0

    \[\leadsto 200.0 \cdot \color{blue}{\left(x + \left(-y\right)\right)}\]

  4. Applied distribute-rgt-in0.0

    \[\leadsto \color{blue}{x \cdot 200.0 + \left(-y\right) \cdot 200.0}\]

  5. Final simplification0.0

    \[\leadsto 200.0 \cdot \left(-y\right) + x \cdot 200.0\]

Reproduce

herbie shell --seed 2019163 +o rules:numerics
(FPCore (x y)
  :name "Data.Colour.CIE:cieLABView from colour-2.3.3, C"
  (* 200.0 (- x y)))