Average Error: 0.0 → 0.0
Time: 5.8s
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 r336516 = 200.0;
        double r336517 = x;
        double r336518 = y;
        double r336519 = r336517 - r336518;
        double r336520 = r336516 * r336519;
        return r336520;
}
↓
double f(double x, double y) {
        double r336521 = 200.0;
        double r336522 = x;
        double r336523 = y;
        double r336524 = r336522 - r336523;
        double r336525 = r336521 * r336524;
        return r336525;
}

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)))