Average Error: 5.7 → 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 r6528198 = a;
        double r6528199 = log(r6528198);
        double r6528200 = b;
        double r6528201 = log(r6528200);
        double r6528202 = r6528199 + r6528201;
        double r6528203 = exp(r6528202);
        return r6528203;
}
↓
double f(double a, double b) {
        double r6528204 = a;
        double r6528205 = b;
        double r6528206 = r6528204 * r6528205;
        return r6528206;
}

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}{a \cdot b}\]

  3. Final simplification0

    \[\leadsto a \cdot b\]

Reproduce

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

  :herbie-target
  (* a b)

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