Average Error: 0.0 → 0.0
Time: 1.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 r299104 = 200.0;
        double r299105 = x;
        double r299106 = y;
        double r299107 = r299105 - r299106;
        double r299108 = r299104 * r299107;
        return r299108;
}

double f(double x, double y) {
        double r299109 = 200.0;
        double r299110 = x;
        double r299111 = r299109 * r299110;
        double r299112 = y;
        double r299113 = -r299112;
        double r299114 = r299109 * r299113;
        double r299115 = r299111 + r299114;
        return r299115;
}

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