Average Error: 0.0 → 0.0
Time: 1.8s
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 r269566 = 200.0;
        double r269567 = x;
        double r269568 = y;
        double r269569 = r269567 - r269568;
        double r269570 = r269566 * r269569;
        return r269570;
}

double f(double x, double y) {
        double r269571 = 200.0;
        double r269572 = x;
        double r269573 = r269571 * r269572;
        double r269574 = y;
        double r269575 = -r269574;
        double r269576 = r269571 * r269575;
        double r269577 = r269573 + r269576;
        return r269577;
}

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