Average Error: 0.0 → 0.0
Time: 21.4s
Precision: 64
\[200 \cdot \left(x - y\right)\]
↓
\[200 \cdot x + 200 \cdot \left(-y\right)\]
200 \cdot \left(x - y\right)
↓
200 \cdot x + 200 \cdot \left(-y\right)
double f(double x, double y) {
        double r35721444 = 200.0;
        double r35721445 = x;
        double r35721446 = y;
        double r35721447 = r35721445 - r35721446;
        double r35721448 = r35721444 * r35721447;
        return r35721448;
}
↓
double f(double x, double y) {
        double r35721449 = 200.0;
        double r35721450 = x;
        double r35721451 = r35721449 * r35721450;
        double r35721452 = y;
        double r35721453 = -r35721452;
        double r35721454 = r35721449 * r35721453;
        double r35721455 = r35721451 + r35721454;
        return r35721455;
}

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

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

Reproduce

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