Average Error: 0.0 → 0.0
Time: 1.7s
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 r248532 = 200.0;
        double r248533 = x;
        double r248534 = y;
        double r248535 = r248533 - r248534;
        double r248536 = r248532 * r248535;
        return r248536;
}
↓
double f(double x, double y) {
        double r248537 = 200.0;
        double r248538 = x;
        double r248539 = r248537 * r248538;
        double r248540 = y;
        double r248541 = -r248540;
        double r248542 = r248537 * r248541;
        double r248543 = r248539 + r248542;
        return r248543;
}

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