Average Error: 0.0 → 0.0
Time: 10.4s
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 r289402 = 200.0;
        double r289403 = x;
        double r289404 = y;
        double r289405 = r289403 - r289404;
        double r289406 = r289402 * r289405;
        return r289406;
}
↓
double f(double x, double y) {
        double r289407 = x;
        double r289408 = 200.0;
        double r289409 = r289407 * r289408;
        double r289410 = y;
        double r289411 = -r289410;
        double r289412 = r289411 * r289408;
        double r289413 = r289409 + r289412;
        return r289413;
}

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