Average Error: 0.0 → 0.0
Time: 7.8s
Precision: 64
\[200 \cdot \left(x - y\right)\]
\[x \cdot 200 + \left(-y\right) \cdot 200\]
200 \cdot \left(x - y\right)
x \cdot 200 + \left(-y\right) \cdot 200
double f(double x, double y) {
        double r20065302 = 200.0;
        double r20065303 = x;
        double r20065304 = y;
        double r20065305 = r20065303 - r20065304;
        double r20065306 = r20065302 * r20065305;
        return r20065306;
}

double f(double x, double y) {
        double r20065307 = x;
        double r20065308 = 200.0;
        double r20065309 = r20065307 * r20065308;
        double r20065310 = y;
        double r20065311 = -r20065310;
        double r20065312 = r20065311 * r20065308;
        double r20065313 = r20065309 + r20065312;
        return r20065313;
}

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-rgt-in0.0

    \[\leadsto \color{blue}{x \cdot 200 + \left(-y\right) \cdot 200}\]
  5. Final simplification0.0

    \[\leadsto x \cdot 200 + \left(-y\right) \cdot 200\]

Reproduce

herbie shell --seed 2019174 
(FPCore (x y)
  :name "Data.Colour.CIE:cieLABView from colour-2.3.3, C"
  (* 200.0 (- x y)))