Average Error: 5.7 → 0
Time: 5.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 r6985361 = a;
        double r6985362 = log(r6985361);
        double r6985363 = b;
        double r6985364 = log(r6985363);
        double r6985365 = r6985362 + r6985364;
        double r6985366 = exp(r6985365);
        return r6985366;
}
↓
double f(double a, double b) {
        double r6985367 = b;
        double r6985368 = a;
        double r6985369 = r6985367 * r6985368;
        return r6985369;
}

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

  :herbie-target
  (* a b)

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