Average Error: 0.7 → 0.6
Time: 13.8s
Precision: 64
\[\frac{e^{a}}{e^{a} + e^{b}}\]
↓
\[e^{a - \log \left(e^{a} + e^{b}\right)}\]
\frac{e^{a}}{e^{a} + e^{b}}
↓
e^{a - \log \left(e^{a} + e^{b}\right)}
double f(double a, double b) {
        double r83190 = a;
        double r83191 = exp(r83190);
        double r83192 = b;
        double r83193 = exp(r83192);
        double r83194 = r83191 + r83193;
        double r83195 = r83191 / r83194;
        return r83195;
}
↓
double f(double a, double b) {
        double r83196 = a;
        double r83197 = exp(r83196);
        double r83198 = b;
        double r83199 = exp(r83198);
        double r83200 = r83197 + r83199;
        double r83201 = log(r83200);
        double r83202 = r83196 - r83201;
        double r83203 = exp(r83202);
        return r83203;
}

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.7
Target0.0
Herbie0.6
\[\frac{1}{1 + e^{b - a}}\]

Derivation

  1. Initial program 0.7

    \[\frac{e^{a}}{e^{a} + e^{b}}\]
  2. Using strategy rm

  3. Applied add-exp-log0.7

    \[\leadsto \frac{e^{a}}{\color{blue}{e^{\log \left(e^{a} + e^{b}\right)}}}\]

  4. Applied div-exp0.6

    \[\leadsto \color{blue}{e^{a - \log \left(e^{a} + e^{b}\right)}}\]

  5. Final simplification0.6

    \[\leadsto e^{a - \log \left(e^{a} + e^{b}\right)}\]

Reproduce

herbie shell --seed 2019325 
(FPCore (a b)
  :name "Quotient of sum of exps"
  :precision binary64

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

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