Average Error: 0.0 → 0.0
Time: 483.0ms
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 r132034 = x;
        double r132035 = y;
        double r132036 = r132034 * r132035;
        double r132037 = 2.0;
        double r132038 = r132036 / r132037;
        return r132038;
}
↓
double f(double x, double y) {
        double r132039 = x;
        double r132040 = y;
        double r132041 = 2.0;
        double r132042 = r132040 / r132041;
        double r132043 = r132039 * r132042;
        return r132043;
}

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

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

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

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

  4. Applied times-frac0.0

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

  5. Simplified0.0

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

  6. Final simplification0.0

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

Reproduce

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