Average Error: 0.0 → 0.0
Time: 12.2s
Precision: 64
\[200 \cdot \left(x - y\right)\]
↓
\[200 \cdot \left(-y\right) + x \cdot 200\]
200 \cdot \left(x - y\right)
↓
200 \cdot \left(-y\right) + x \cdot 200
double f(double x, double y) {
        double r9808765 = 200.0;
        double r9808766 = x;
        double r9808767 = y;
        double r9808768 = r9808766 - r9808767;
        double r9808769 = r9808765 * r9808768;
        return r9808769;
}
↓
double f(double x, double y) {
        double r9808770 = 200.0;
        double r9808771 = y;
        double r9808772 = -r9808771;
        double r9808773 = r9808770 * r9808772;
        double r9808774 = x;
        double r9808775 = r9808774 * r9808770;
        double r9808776 = r9808773 + r9808775;
        return r9808776;
}

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-rgt-in0.0

    \[\leadsto \color{blue}{x \cdot 200 + \left(-y\right) \cdot 200}\]

  5. Final simplification0.0

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

Reproduce

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