Average Error: 0.8 → 0.8
Time: 9.6s
Precision: 64
\[\frac{e^{a}}{e^{a} + e^{b}}\]
\[\log \left({\left(e^{e^{a}}\right)}^{\left(\frac{1}{e^{a} + e^{b}}\right)}\right)\]
\frac{e^{a}}{e^{a} + e^{b}}
\log \left({\left(e^{e^{a}}\right)}^{\left(\frac{1}{e^{a} + e^{b}}\right)}\right)
double f(double a, double b) {
        double r114140 = a;
        double r114141 = exp(r114140);
        double r114142 = b;
        double r114143 = exp(r114142);
        double r114144 = r114141 + r114143;
        double r114145 = r114141 / r114144;
        return r114145;
}

double f(double a, double b) {
        double r114146 = a;
        double r114147 = exp(r114146);
        double r114148 = exp(r114147);
        double r114149 = 1.0;
        double r114150 = b;
        double r114151 = exp(r114150);
        double r114152 = r114147 + r114151;
        double r114153 = r114149 / r114152;
        double r114154 = pow(r114148, r114153);
        double r114155 = log(r114154);
        return r114155;
}

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

Derivation

  1. Initial program 0.8

    \[\frac{e^{a}}{e^{a} + e^{b}}\]
  2. Using strategy rm
  3. Applied add-log-exp0.9

    \[\leadsto \color{blue}{\log \left(e^{\frac{e^{a}}{e^{a} + e^{b}}}\right)}\]
  4. Using strategy rm
  5. Applied div-inv0.9

    \[\leadsto \log \left(e^{\color{blue}{e^{a} \cdot \frac{1}{e^{a} + e^{b}}}}\right)\]
  6. Applied exp-prod0.8

    \[\leadsto \log \color{blue}{\left({\left(e^{e^{a}}\right)}^{\left(\frac{1}{e^{a} + e^{b}}\right)}\right)}\]
  7. Final simplification0.8

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

Reproduce

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

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

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