Average Error: 0.0 → 0.0
Time: 13.3s
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 r186803 = 200.0;
        double r186804 = x;
        double r186805 = y;
        double r186806 = r186804 - r186805;
        double r186807 = r186803 * r186806;
        return r186807;
}

double f(double x, double y) {
        double r186808 = 200.0;
        double r186809 = x;
        double r186810 = r186808 * r186809;
        double r186811 = y;
        double r186812 = -r186811;
        double r186813 = r186808 * r186812;
        double r186814 = r186810 + r186813;
        return r186814;
}

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