Average Error: 0.0 → 0.0
Time: 11.8s
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 r163060 = 500.0;
        double r163061 = x;
        double r163062 = y;
        double r163063 = r163061 - r163062;
        double r163064 = r163060 * r163063;
        return r163064;
}

double f(double x, double y) {
        double r163065 = 500.0;
        double r163066 = x;
        double r163067 = r163065 * r163066;
        double r163068 = y;
        double r163069 = -r163068;
        double r163070 = r163065 * r163069;
        double r163071 = r163067 + r163070;
        return r163071;
}

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