Average Error: 0.0 → 0.0
Time: 16.8s
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 r134512 = 200.0;
        double r134513 = x;
        double r134514 = y;
        double r134515 = r134513 - r134514;
        double r134516 = r134512 * r134515;
        return r134516;
}

double f(double x, double y) {
        double r134517 = x;
        double r134518 = y;
        double r134519 = r134517 - r134518;
        double r134520 = 200.0;
        double r134521 = r134519 * r134520;
        return r134521;
}

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 *-un-lft-identity0.0

    \[\leadsto \color{blue}{\left(1 \cdot 200\right)} \cdot \left(x - y\right)\]
  4. Applied associate-*l*0.0

    \[\leadsto \color{blue}{1 \cdot \left(200 \cdot \left(x - y\right)\right)}\]
  5. Simplified0.0

    \[\leadsto 1 \cdot \color{blue}{\left(\left(x - y\right) \cdot 200\right)}\]
  6. Final simplification0.0

    \[\leadsto \left(x - y\right) \cdot 200\]

Reproduce

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