Average Error: 0.0 → 0.0
Time: 523.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 r87960 = x;
        double r87961 = y;
        double r87962 = r87960 * r87961;
        double r87963 = 2.0;
        double r87964 = r87962 / r87963;
        return r87964;
}
↓
double f(double x, double y) {
        double r87965 = x;
        double r87966 = y;
        double r87967 = 2.0;
        double r87968 = r87966 / r87967;
        double r87969 = r87965 * r87968;
        return r87969;
}

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