Average Error: 0.0 → 0.0
Time: 12.6s
Precision: 64
\[200.0 \cdot \left(x - y\right)\]
\[200.0 \cdot \left(-y\right) + x \cdot 200.0\]
200.0 \cdot \left(x - y\right)
200.0 \cdot \left(-y\right) + x \cdot 200.0
double f(double x, double y) {
        double r14230985 = 200.0;
        double r14230986 = x;
        double r14230987 = y;
        double r14230988 = r14230986 - r14230987;
        double r14230989 = r14230985 * r14230988;
        return r14230989;
}

double f(double x, double y) {
        double r14230990 = 200.0;
        double r14230991 = y;
        double r14230992 = -r14230991;
        double r14230993 = r14230990 * r14230992;
        double r14230994 = x;
        double r14230995 = r14230994 * r14230990;
        double r14230996 = r14230993 + r14230995;
        return r14230996;
}

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.0 \cdot \left(x - y\right)\]
  2. Using strategy rm
  3. Applied sub-neg0.0

    \[\leadsto 200.0 \cdot \color{blue}{\left(x + \left(-y\right)\right)}\]
  4. Applied distribute-rgt-in0.0

    \[\leadsto \color{blue}{x \cdot 200.0 + \left(-y\right) \cdot 200.0}\]
  5. Final simplification0.0

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

Reproduce

herbie shell --seed 2019163 
(FPCore (x y)
  :name "Data.Colour.CIE:cieLABView from colour-2.3.3, C"
  (* 200.0 (- x y)))