Average Error: 5.7 → 0
Time: 4.5s
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 r8875491 = a;
        double r8875492 = log(r8875491);
        double r8875493 = b;
        double r8875494 = log(r8875493);
        double r8875495 = r8875492 + r8875494;
        double r8875496 = exp(r8875495);
        return r8875496;
}
↓
double f(double a, double b) {
        double r8875497 = b;
        double r8875498 = a;
        double r8875499 = r8875497 * r8875498;
        return r8875499;
}

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))))