Average Error: 0.0 → 0.0
Time: 14.3s
Precision: 64
\[200 \cdot \left(x - y\right)\]
↓
\[200 \cdot x + \left(-y\right) \cdot 200\]
200 \cdot \left(x - y\right)
↓
200 \cdot x + \left(-y\right) \cdot 200
double f(double x, double y) {
        double r151610 = 200.0;
        double r151611 = x;
        double r151612 = y;
        double r151613 = r151611 - r151612;
        double r151614 = r151610 * r151613;
        return r151614;
}
↓
double f(double x, double y) {
        double r151615 = 200.0;
        double r151616 = x;
        double r151617 = r151615 * r151616;
        double r151618 = y;
        double r151619 = -r151618;
        double r151620 = r151619 * r151615;
        double r151621 = r151617 + r151620;
        return r151621;
}

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. Simplified0.0

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

  6. Final simplification0.0

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

Reproduce

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