Average Error: 0.0 → 0.0
Time: 3.1s
Precision: 64
\[200 \cdot \left(x - y\right)\]
\[\left(x - y\right) \cdot 200\]
200 \cdot \left(x - y\right)
\left(x - y\right) \cdot 200
double f(double x, double y) {
        double r213268 = 200.0;
        double r213269 = x;
        double r213270 = y;
        double r213271 = r213269 - r213270;
        double r213272 = r213268 * r213271;
        return r213272;
}

double f(double x, double y) {
        double r213273 = x;
        double r213274 = y;
        double r213275 = r213273 - r213274;
        double r213276 = 200.0;
        double r213277 = r213275 * r213276;
        return r213277;
}

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 \left(x - y\right) \cdot 200\]

Reproduce

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