Average Error: 0.0 → 0.0
Time: 1.9s
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 r231720 = 200.0;
        double r231721 = x;
        double r231722 = y;
        double r231723 = r231721 - r231722;
        double r231724 = r231720 * r231723;
        return r231724;
}

double f(double x, double y) {
        double r231725 = 200.0;
        double r231726 = x;
        double r231727 = r231725 * r231726;
        double r231728 = y;
        double r231729 = -r231728;
        double r231730 = r231725 * r231729;
        double r231731 = r231727 + r231730;
        return r231731;
}

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