Average Error: 0.6 → 0.5
Time: 3.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 r225974 = a;
        double r225975 = exp(r225974);
        double r225976 = b;
        double r225977 = exp(r225976);
        double r225978 = r225975 + r225977;
        double r225979 = r225975 / r225978;
        return r225979;
}
↓
double f(double a, double b) {
        double r225980 = a;
        double r225981 = exp(r225980);
        double r225982 = b;
        double r225983 = exp(r225982);
        double r225984 = r225981 + r225983;
        double r225985 = log(r225984);
        double r225986 = r225980 - r225985;
        double r225987 = exp(r225986);
        return r225987;
}

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

Derivation

  1. Initial program 0.6

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

  3. Applied add-exp-log0.6

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

  4. Applied div-exp0.5

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

  5. Final simplification0.5

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

Reproduce

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

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

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