Average Error: 0.6 → 0.5
Time: 2.2s
Precision: binary64
\[\]
↓
\[\]
↓
double code(double a, double b) {
	return ((double) (((double) exp(a)) / ((double) (((double) exp(a)) + ((double) exp(b))))));
}

↓
double code(double a, double b) {
	return ((double) exp(((double) (a - ((double) log(((double) (((double) exp(a)) + ((double) exp(b))))))))));
}

Error
Bits error versus a
Bits error versus b
Try it out
Your Program's Arguments
Results
Enter valid numbers for all inputs
Target
Original0.6
Target0.0
Herbie0.5
\[\]
Derivation
  1. Initial program 0.6
    \[\]
  2. Using strategy rm
  3. Applied add-exp-log0.6
    \[\leadsto \]
  4. Applied div-exp0.5
    \[\leadsto \]
  5. Final simplification0.5
    \[\leadsto \]
Reproduce
herbie shell --seed 2020191 
(FPCore (a b)
  :name "Quotient of sum of exps"
  :precision binary64

  :herbie-target
  (/ 1.0 (+ 1.0 (exp (- b a))))

  (/ (exp a) (+ (exp a) (exp b))))