Average Error: 0.0 → 0.0
Time: 10.0s
Precision: 64
\[\frac{-\left(f + n\right)}{f - n}\]
↓
\[\frac{-\left(f + n\right)}{f - n}\]
\frac{-\left(f + n\right)}{f - n}
↓
\frac{-\left(f + n\right)}{f - n}
double f(double f, double n) {
        double r19664 = f;
        double r19665 = n;
        double r19666 = r19664 + r19665;
        double r19667 = -r19666;
        double r19668 = r19664 - r19665;
        double r19669 = r19667 / r19668;
        return r19669;
}
↓
double f(double f, double n) {
        double r19670 = f;
        double r19671 = n;
        double r19672 = r19670 + r19671;
        double r19673 = -r19672;
        double r19674 = r19670 - r19671;
        double r19675 = r19673 / r19674;
        return r19675;
}

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 *-un-lft-identity0.0

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

  4. Applied distribute-lft-neg-in0.0

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

  5. Applied associate-/l*0.0

    \[\leadsto \color{blue}{\frac{-1}{\frac{f - n}{f + n}}}\]

  6. Final simplification0.0

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

Reproduce

herbie shell --seed 2019298 
(FPCore (f n)
  :name "subtraction fraction"
  :precision binary64
  (/ (- (+ f n)) (- f n)))