Average Error: 5.6 → 0
Time: 4.4s
Precision: 64
\[e^{\log a + \log b}\]
↓
\[a \cdot b\]
e^{\log a + \log b}
↓
a \cdot b
double f(double a, double b) {
        double r4914761 = a;
        double r4914762 = log(r4914761);
        double r4914763 = b;
        double r4914764 = log(r4914763);
        double r4914765 = r4914762 + r4914764;
        double r4914766 = exp(r4914765);
        return r4914766;
}
↓
double f(double a, double b) {
        double r4914767 = a;
        double r4914768 = b;
        double r4914769 = r4914767 * r4914768;
        return r4914769;
}

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.6
Target0
Herbie0
\[a \cdot b\]

Derivation

  1. Initial program 5.6

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

  2. Simplified0

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

  3. Final simplification0

    \[\leadsto a \cdot b\]

Reproduce

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

  :herbie-target
  (* a b)

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