Average Error: 0.0 → 0.0
Time: 8.8s
Precision: 64
\[200 \cdot \left(x - y\right)\]
↓
\[x \cdot 200 + 200 \cdot \left(-y\right)\]
200 \cdot \left(x - y\right)
↓
x \cdot 200 + 200 \cdot \left(-y\right)
double f(double x, double y) {
        double r172802 = 200.0;
        double r172803 = x;
        double r172804 = y;
        double r172805 = r172803 - r172804;
        double r172806 = r172802 * r172805;
        return r172806;
}
↓
double f(double x, double y) {
        double r172807 = x;
        double r172808 = 200.0;
        double r172809 = r172807 * r172808;
        double r172810 = y;
        double r172811 = -r172810;
        double r172812 = r172808 * r172811;
        double r172813 = r172809 + r172812;
        return r172813;
}

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. Final simplification0.0

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

Reproduce

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