Average Error: 0.0 → 0.0
Time: 25.3s
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 r13032586 = 200.0;
        double r13032587 = x;
        double r13032588 = y;
        double r13032589 = r13032587 - r13032588;
        double r13032590 = r13032586 * r13032589;
        return r13032590;
}
↓
double f(double x, double y) {
        double r13032591 = 200.0;
        double r13032592 = y;
        double r13032593 = -r13032592;
        double r13032594 = r13032591 * r13032593;
        double r13032595 = x;
        double r13032596 = r13032595 * r13032591;
        double r13032597 = r13032594 + r13032596;
        return r13032597;
}

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