Average Error: 0.0 → 0.0
Time: 1.3s
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 r258495 = 200.0;
        double r258496 = x;
        double r258497 = y;
        double r258498 = r258496 - r258497;
        double r258499 = r258495 * r258498;
        return r258499;
}

double f(double x, double y) {
        double r258500 = 200.0;
        double r258501 = x;
        double r258502 = r258500 * r258501;
        double r258503 = y;
        double r258504 = -r258503;
        double r258505 = r258500 * r258504;
        double r258506 = r258502 + r258505;
        return r258506;
}

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