Average Error: 5.7 → 0
Time: 4.4s
Precision: 64
\[e^{\log a + \log b}\]
↓
\[b \cdot a\]
e^{\log a + \log b}
↓
b \cdot a
double f(double a, double b) {
        double r5364052 = a;
        double r5364053 = log(r5364052);
        double r5364054 = b;
        double r5364055 = log(r5364054);
        double r5364056 = r5364053 + r5364055;
        double r5364057 = exp(r5364056);
        return r5364057;
}
↓
double f(double a, double b) {
        double r5364058 = b;
        double r5364059 = a;
        double r5364060 = r5364058 * r5364059;
        return r5364060;
}

Error

Bits error versus a

Bits error versus b

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Target

Original5.7
Target0
Herbie0
\[a \cdot b\]

Derivation

  1. Initial program 5.7

    \[e^{\log a + \log b}\]

  2. Simplified0

    \[\leadsto \color{blue}{b \cdot a}\]

  3. Final simplification0

    \[\leadsto b \cdot a\]

Reproduce

herbie shell --seed 2019170 
(FPCore (a b)
  :name "Exp of sum of logs"

  :herbie-target
  (* a b)

  (exp (+ (log a) (log b))))