Average Error: 0.0 → 0.0
Time: 32.4s
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 r12496297 = 200.0;
        double r12496298 = x;
        double r12496299 = y;
        double r12496300 = r12496298 - r12496299;
        double r12496301 = r12496297 * r12496300;
        return r12496301;
}
↓
double f(double x, double y) {
        double r12496302 = 200.0;
        double r12496303 = y;
        double r12496304 = -r12496303;
        double r12496305 = r12496302 * r12496304;
        double r12496306 = x;
        double r12496307 = r12496306 * r12496302;
        double r12496308 = r12496305 + r12496307;
        return r12496308;
}

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