Average Error: 0.0 → 0.0
Time: 1.8s
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 r313284 = 200.0;
        double r313285 = x;
        double r313286 = y;
        double r313287 = r313285 - r313286;
        double r313288 = r313284 * r313287;
        return r313288;
}

double f(double x, double y) {
        double r313289 = 200.0;
        double r313290 = x;
        double r313291 = r313289 * r313290;
        double r313292 = y;
        double r313293 = -r313292;
        double r313294 = r313289 * r313293;
        double r313295 = r313291 + r313294;
        return r313295;
}

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)))