Average Error: 0.0 → 0.0
Time: 540.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 r137065 = x;
        double r137066 = y;
        double r137067 = r137065 * r137066;
        double r137068 = 2.0;
        double r137069 = r137067 / r137068;
        return r137069;
}
↓
double f(double x, double y) {
        double r137070 = x;
        double r137071 = y;
        double r137072 = 2.0;
        double r137073 = r137071 / r137072;
        double r137074 = r137070 * r137073;
        return r137074;
}

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 2019347 
(FPCore (x y)
  :name "Numeric.Interval.Internal:scale from intervals-0.7.1, B"
  :precision binary64
  (/ (* x y) 2))