Average Error: 0.0 → 0.0
Time: 1.5s
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 r244056 = 200.0;
        double r244057 = x;
        double r244058 = y;
        double r244059 = r244057 - r244058;
        double r244060 = r244056 * r244059;
        return r244060;
}
↓
double f(double x, double y) {
        double r244061 = 200.0;
        double r244062 = x;
        double r244063 = r244061 * r244062;
        double r244064 = y;
        double r244065 = -r244064;
        double r244066 = r244061 * r244065;
        double r244067 = r244063 + r244066;
        return r244067;
}

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