Average Error: 0.0 → 0.0
Time: 7.5s
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 r240569 = 200.0;
        double r240570 = x;
        double r240571 = y;
        double r240572 = r240570 - r240571;
        double r240573 = r240569 * r240572;
        return r240573;
}
↓
double f(double x, double y) {
        double r240574 = x;
        double r240575 = 200.0;
        double r240576 = r240574 * r240575;
        double r240577 = y;
        double r240578 = -r240577;
        double r240579 = r240575 * r240578;
        double r240580 = r240576 + r240579;
        return r240580;
}

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