Average Error: 5.6 → 0
Time: 3.7s
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 r79342 = a;
        double r79343 = log(r79342);
        double r79344 = b;
        double r79345 = log(r79344);
        double r79346 = r79343 + r79345;
        double r79347 = exp(r79346);
        return r79347;
}
↓
double f(double a, double b) {
        double r79348 = b;
        double r79349 = a;
        double r79350 = r79348 * r79349;
        return r79350;
}

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

  3. Final simplification0

    \[\leadsto b \cdot a\]

Reproduce

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

  :herbie-target
  (* a b)

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