Average Error: 0.0 → 0.0
Time: 6.5s
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 r251092 = 200.0;
        double r251093 = x;
        double r251094 = y;
        double r251095 = r251093 - r251094;
        double r251096 = r251092 * r251095;
        return r251096;
}
↓
double f(double x, double y) {
        double r251097 = x;
        double r251098 = 200.0;
        double r251099 = r251097 * r251098;
        double r251100 = y;
        double r251101 = -r251100;
        double r251102 = r251101 * r251098;
        double r251103 = r251099 + r251102;
        return r251103;
}

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