Average Error: 0.0 → 0.0
Time: 1.6s
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 r205670 = 200.0;
        double r205671 = x;
        double r205672 = y;
        double r205673 = r205671 - r205672;
        double r205674 = r205670 * r205673;
        return r205674;
}
↓
double f(double x, double y) {
        double r205675 = 200.0;
        double r205676 = x;
        double r205677 = r205675 * r205676;
        double r205678 = y;
        double r205679 = -r205678;
        double r205680 = r205675 * r205679;
        double r205681 = r205677 + r205680;
        return r205681;
}

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