Average Error: 0.0 → 0.0
Time: 6.0s
Precision: 64
\[200 \cdot \left(x - y\right)\]
↓
\[200 \cdot \left(x - y\right)\]
200 \cdot \left(x - y\right)
↓
200 \cdot \left(x - y\right)
double f(double x, double y) {
        double r299402 = 200.0;
        double r299403 = x;
        double r299404 = y;
        double r299405 = r299403 - r299404;
        double r299406 = r299402 * r299405;
        return r299406;
}
↓
double f(double x, double y) {
        double r299407 = 200.0;
        double r299408 = x;
        double r299409 = y;
        double r299410 = r299408 - r299409;
        double r299411 = r299407 * r299410;
        return r299411;
}

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. Final simplification0.0

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

Reproduce

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