Average Error: 0.0 → 0.0
Time: 1.9s
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 r250094 = 200.0;
        double r250095 = x;
        double r250096 = y;
        double r250097 = r250095 - r250096;
        double r250098 = r250094 * r250097;
        return r250098;
}
↓
double f(double x, double y) {
        double r250099 = 200.0;
        double r250100 = x;
        double r250101 = r250099 * r250100;
        double r250102 = y;
        double r250103 = -r250102;
        double r250104 = r250099 * r250103;
        double r250105 = r250101 + r250104;
        return r250105;
}

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