Average Error: 0.0 → 0.0
Time: 1.6s
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 r207282 = 200.0;
        double r207283 = x;
        double r207284 = y;
        double r207285 = r207283 - r207284;
        double r207286 = r207282 * r207285;
        return r207286;
}

double f(double x, double y) {
        double r207287 = 200.0;
        double r207288 = x;
        double r207289 = r207287 * r207288;
        double r207290 = y;
        double r207291 = -r207290;
        double r207292 = r207287 * r207291;
        double r207293 = r207289 + r207292;
        return r207293;
}

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