Average Error: 0.0 → 0.0
Time: 2.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 r246305 = 200.0;
        double r246306 = x;
        double r246307 = y;
        double r246308 = r246306 - r246307;
        double r246309 = r246305 * r246308;
        return r246309;
}
↓
double f(double x, double y) {
        double r246310 = 200.0;
        double r246311 = x;
        double r246312 = r246310 * r246311;
        double r246313 = y;
        double r246314 = -r246313;
        double r246315 = r246310 * r246314;
        double r246316 = r246312 + r246315;
        return r246316;
}

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