Average Error: 0.0 → 0.0
Time: 1.7s
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 r289631 = 200.0;
        double r289632 = x;
        double r289633 = y;
        double r289634 = r289632 - r289633;
        double r289635 = r289631 * r289634;
        return r289635;
}
↓
double f(double x, double y) {
        double r289636 = 200.0;
        double r289637 = x;
        double r289638 = r289636 * r289637;
        double r289639 = y;
        double r289640 = -r289639;
        double r289641 = r289636 * r289640;
        double r289642 = r289638 + r289641;
        return r289642;
}

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