Average Error: 0.0 → 0.0
Time: 670.0ms
Precision: 64
\[500 \cdot \left(x - y\right)\]
↓
\[500 \cdot x + 500 \cdot \left(-y\right)\]
500 \cdot \left(x - y\right)
↓
500 \cdot x + 500 \cdot \left(-y\right)
double f(double x, double y) {
        double r206738 = 500.0;
        double r206739 = x;
        double r206740 = y;
        double r206741 = r206739 - r206740;
        double r206742 = r206738 * r206741;
        return r206742;
}
↓
double f(double x, double y) {
        double r206743 = 500.0;
        double r206744 = x;
        double r206745 = r206743 * r206744;
        double r206746 = y;
        double r206747 = -r206746;
        double r206748 = r206743 * r206747;
        double r206749 = r206745 + r206748;
        return r206749;
}

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

    \[500 \cdot \left(x - y\right)\]
  2. Using strategy rm

  3. Applied sub-neg0.0

    \[\leadsto 500 \cdot \color{blue}{\left(x + \left(-y\right)\right)}\]

  4. Applied distribute-lft-in0.0

    \[\leadsto \color{blue}{500 \cdot x + 500 \cdot \left(-y\right)}\]

  5. Final simplification0.0

    \[\leadsto 500 \cdot x + 500 \cdot \left(-y\right)\]

Reproduce

herbie shell --seed 2020027 
(FPCore (x y)
  :name "Data.Colour.CIE:cieLABView from colour-2.3.3, B"
  :precision binary64
  (* 500 (- x y)))