Average Error: 0.0 → 0.0
Time: 8.7s
Precision: 64
\[200 \cdot \left(x - y\right)\]
↓
\[x \cdot 200 + \left(-y\right) \cdot 200\]
200 \cdot \left(x - y\right)
↓
x \cdot 200 + \left(-y\right) \cdot 200
double f(double x, double y) {
        double r250457 = 200.0;
        double r250458 = x;
        double r250459 = y;
        double r250460 = r250458 - r250459;
        double r250461 = r250457 * r250460;
        return r250461;
}
↓
double f(double x, double y) {
        double r250462 = x;
        double r250463 = 200.0;
        double r250464 = r250462 * r250463;
        double r250465 = y;
        double r250466 = -r250465;
        double r250467 = r250466 * r250463;
        double r250468 = r250464 + r250467;
        return r250468;
}

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. Simplified0.0

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

  6. Simplified0.0

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

  7. Final simplification0.0

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

Reproduce

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