Average Error: 5.7 → 0
Time: 3.8s
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 r5500476 = a;
        double r5500477 = log(r5500476);
        double r5500478 = b;
        double r5500479 = log(r5500478);
        double r5500480 = r5500477 + r5500479;
        double r5500481 = exp(r5500480);
        return r5500481;
}
↓
double f(double a, double b) {
        double r5500482 = a;
        double r5500483 = b;
        double r5500484 = r5500482 * r5500483;
        return r5500484;
}

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

  :herbie-target
  (* a b)

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