Average Error: 0.0 → 0.0
Time: 5.3s
Precision: 64
\[\frac{-\left(f + n\right)}{f - n}\]
↓
\[\frac{1}{\frac{f - n}{-\left(f + n\right)}}\]
\frac{-\left(f + n\right)}{f - n}
↓
\frac{1}{\frac{f - n}{-\left(f + n\right)}}
double f(double f, double n) {
        double r21601 = f;
        double r21602 = n;
        double r21603 = r21601 + r21602;
        double r21604 = -r21603;
        double r21605 = r21601 - r21602;
        double r21606 = r21604 / r21605;
        return r21606;
}
↓
double f(double f, double n) {
        double r21607 = 1.0;
        double r21608 = f;
        double r21609 = n;
        double r21610 = r21608 - r21609;
        double r21611 = r21608 + r21609;
        double r21612 = -r21611;
        double r21613 = r21610 / r21612;
        double r21614 = r21607 / r21613;
        return r21614;
}

Error

Bits error versus f

Bits error versus n

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[\frac{-\left(f + n\right)}{f - n}\]
  2. Using strategy rm

  3. Applied clear-num0.0

    \[\leadsto \color{blue}{\frac{1}{\frac{f - n}{-\left(f + n\right)}}}\]

  4. Final simplification0.0

    \[\leadsto \frac{1}{\frac{f - n}{-\left(f + n\right)}}\]

Reproduce

herbie shell --seed 2020056 +o rules:numerics
(FPCore (f n)
  :name "subtraction fraction"
  :precision binary64
  (/ (- (+ f n)) (- f n)))