Average Error: 0.0 → 0.0
Time: 13.6s
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 r235216 = 200.0;
        double r235217 = x;
        double r235218 = y;
        double r235219 = r235217 - r235218;
        double r235220 = r235216 * r235219;
        return r235220;
}
↓
double f(double x, double y) {
        double r235221 = 200.0;
        double r235222 = x;
        double r235223 = r235221 * r235222;
        double r235224 = y;
        double r235225 = -r235224;
        double r235226 = r235221 * r235225;
        double r235227 = r235223 + r235226;
        return r235227;
}

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