Average Error: 5.7 → 0
Time: 3.3s
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 r5620978 = a;
        double r5620979 = log(r5620978);
        double r5620980 = b;
        double r5620981 = log(r5620980);
        double r5620982 = r5620979 + r5620981;
        double r5620983 = exp(r5620982);
        return r5620983;
}
↓
double f(double a, double b) {
        double r5620984 = b;
        double r5620985 = a;
        double r5620986 = r5620984 * r5620985;
        return r5620986;
}

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 2019163 
(FPCore (a b)
  :name "Exp of sum of logs"

  :herbie-target
  (* a b)

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