Average Error: 0.0 → 0.0
Time: 11.5s
Precision: 64
\[200 \cdot \left(x - y\right)\]
↓
\[200 \cdot \left(-y\right) + x \cdot 200\]
200 \cdot \left(x - y\right)
↓
200 \cdot \left(-y\right) + x \cdot 200
double f(double x, double y) {
        double r10623318 = 200.0;
        double r10623319 = x;
        double r10623320 = y;
        double r10623321 = r10623319 - r10623320;
        double r10623322 = r10623318 * r10623321;
        return r10623322;
}
↓
double f(double x, double y) {
        double r10623323 = 200.0;
        double r10623324 = y;
        double r10623325 = -r10623324;
        double r10623326 = r10623323 * r10623325;
        double r10623327 = x;
        double r10623328 = r10623327 * r10623323;
        double r10623329 = r10623326 + r10623328;
        return r10623329;
}

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-rgt-in0.0

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

  5. Final simplification0.0

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

Reproduce

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