Average Error: 0.0 → 0.0
Time: 2.7s
Precision: 64
\[\frac{-\left(f + n\right)}{f - n}\]
↓
\[-1 \cdot \frac{f + n}{f - n}\]
\frac{-\left(f + n\right)}{f - n}
↓
-1 \cdot \frac{f + n}{f - n}
double f(double f, double n) {
        double r10370 = f;
        double r10371 = n;
        double r10372 = r10370 + r10371;
        double r10373 = -r10372;
        double r10374 = r10370 - r10371;
        double r10375 = r10373 / r10374;
        return r10375;
}
↓
double f(double f, double n) {
        double r10376 = -1.0;
        double r10377 = f;
        double r10378 = n;
        double r10379 = r10377 + r10378;
        double r10380 = r10377 - r10378;
        double r10381 = r10379 / r10380;
        double r10382 = r10376 * r10381;
        return r10382;
}

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 flip--30.8

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

  4. Applied associate-/r/30.9

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

  5. Simplified0.2

    \[\leadsto \color{blue}{\frac{-1}{f - n}} \cdot \left(f + n\right)\]
  6. Using strategy rm

  7. Applied div-inv0.2

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

  8. Applied associate-*l*0.2

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

  9. Simplified0.0

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

  10. Final simplification0.0

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

Reproduce

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