Average Error: 0.0 → 0.0
Time: 40.6s
Precision: binary64
Cost: 512
\[\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}
(FPCore (f n) :precision binary64 (/ (- (+ f n)) (- f n)))
↓
(FPCore (f n) :precision binary64 (/ (- (+ f n)) (- f n)))
double code(double f, double n) {
	return -(f + n) / (f - n);
}
↓
double code(double f, double n) {
	return -(f + n) / (f - n);
}

Error

Bits error versus f

Bits error versus n

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs
Alternative 1
Accuracy0.0
Cost576
\[\frac{1}{\frac{n - f}{n + f}}\]

Derivation

  1. Initial program 0.0

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

  3. Applied *-un-lft-identity_binary640.0

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

  4. Final simplification0.0

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

Reproduce

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