Average Error: 0.0 → 0.0
Time: 649.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 r289670 = 500.0;
        double r289671 = x;
        double r289672 = y;
        double r289673 = r289671 - r289672;
        double r289674 = r289670 * r289673;
        return r289674;
}
↓
double f(double x, double y) {
        double r289675 = 500.0;
        double r289676 = x;
        double r289677 = r289675 * r289676;
        double r289678 = y;
        double r289679 = -r289678;
        double r289680 = r289675 * r289679;
        double r289681 = r289677 + r289680;
        return r289681;
}

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