Average Error: 0.0 → 0.0
Time: 2.0s
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 r247937 = 200.0;
        double r247938 = x;
        double r247939 = y;
        double r247940 = r247938 - r247939;
        double r247941 = r247937 * r247940;
        return r247941;
}
↓
double f(double x, double y) {
        double r247942 = 200.0;
        double r247943 = x;
        double r247944 = r247942 * r247943;
        double r247945 = y;
        double r247946 = -r247945;
        double r247947 = r247942 * r247946;
        double r247948 = r247944 + r247947;
        return r247948;
}

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