Average Error: 0.0 → 0.0
Time: 695.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 r278671 = 500.0;
        double r278672 = x;
        double r278673 = y;
        double r278674 = r278672 - r278673;
        double r278675 = r278671 * r278674;
        return r278675;
}
↓
double f(double x, double y) {
        double r278676 = 500.0;
        double r278677 = x;
        double r278678 = r278676 * r278677;
        double r278679 = y;
        double r278680 = -r278679;
        double r278681 = r278676 * r278680;
        double r278682 = r278678 + r278681;
        return r278682;
}

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 2020064 +o rules:numerics
(FPCore (x y)
  :name "Data.Colour.CIE:cieLABView from colour-2.3.3, B"
  :precision binary64
  (* 500 (- x y)))