Average Error: 0.0 → 0.0
Time: 9.8s
Precision: 64
\[200.0 \cdot \left(x - y\right)\]
↓
\[\left(-y\right) \cdot 200.0 + 200.0 \cdot x\]
200.0 \cdot \left(x - y\right)
↓
\left(-y\right) \cdot 200.0 + 200.0 \cdot x
double f(double x, double y) {
        double r15888011 = 200.0;
        double r15888012 = x;
        double r15888013 = y;
        double r15888014 = r15888012 - r15888013;
        double r15888015 = r15888011 * r15888014;
        return r15888015;
}
↓
double f(double x, double y) {
        double r15888016 = y;
        double r15888017 = -r15888016;
        double r15888018 = 200.0;
        double r15888019 = r15888017 * r15888018;
        double r15888020 = x;
        double r15888021 = r15888018 * r15888020;
        double r15888022 = r15888019 + r15888021;
        return r15888022;
}

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

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

  5. Final simplification0.0

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

Reproduce

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