Average Error: 0.1 → 0
Time: 5.0s
Precision: 64
\[\frac{x \cdot y}{2}\]
↓
\[x \cdot \frac{y}{2}\]
\frac{x \cdot y}{2}
↓
x \cdot \frac{y}{2}
double f(double x, double y) {
        double r92908 = x;
        double r92909 = y;
        double r92910 = r92908 * r92909;
        double r92911 = 2.0;
        double r92912 = r92910 / r92911;
        return r92912;
}
↓
double f(double x, double y) {
        double r92913 = x;
        double r92914 = y;
        double r92915 = 2.0;
        double r92916 = r92914 / r92915;
        double r92917 = r92913 * r92916;
        return r92917;
}

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.1

    \[\frac{x \cdot y}{2}\]
  2. Using strategy rm

  3. Applied *-un-lft-identity0.1

    \[\leadsto \frac{x \cdot y}{\color{blue}{1 \cdot 2}}\]

  4. Applied times-frac0

    \[\leadsto \color{blue}{\frac{x}{1} \cdot \frac{y}{2}}\]

  5. Simplified0

    \[\leadsto \color{blue}{x} \cdot \frac{y}{2}\]

  6. Final simplification0

    \[\leadsto x \cdot \frac{y}{2}\]

Reproduce

herbie shell --seed 2019325 
(FPCore (x y)
  :name "Numeric.Interval.Internal:scale from intervals-0.7.1, B"
  :precision binary64
  (/ (* x y) 2))