Average Error: 0.0 → 0.0
Time: 13.3s
Precision: 64
\[200.0 \cdot \left(x - y\right)\]
↓
\[200.0 \cdot \left(-y\right) + x \cdot 200.0\]
200.0 \cdot \left(x - y\right)
↓
200.0 \cdot \left(-y\right) + x \cdot 200.0
double f(double x, double y) {
        double r9328006 = 200.0;
        double r9328007 = x;
        double r9328008 = y;
        double r9328009 = r9328007 - r9328008;
        double r9328010 = r9328006 * r9328009;
        return r9328010;
}
↓
double f(double x, double y) {
        double r9328011 = 200.0;
        double r9328012 = y;
        double r9328013 = -r9328012;
        double r9328014 = r9328011 * r9328013;
        double r9328015 = x;
        double r9328016 = r9328015 * r9328011;
        double r9328017 = r9328014 + r9328016;
        return r9328017;
}

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.0 \cdot \left(x - y\right)\]
  2. Using strategy rm

  3. Applied sub-neg0.0

    \[\leadsto 200.0 \cdot \color{blue}{\left(x + \left(-y\right)\right)}\]

  4. Applied distribute-rgt-in0.0

    \[\leadsto \color{blue}{x \cdot 200.0 + \left(-y\right) \cdot 200.0}\]

  5. Final simplification0.0

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

Reproduce

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