Average Error: 5.7 → 0
Time: 4.2s
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 r3747499 = a;
        double r3747500 = log(r3747499);
        double r3747501 = b;
        double r3747502 = log(r3747501);
        double r3747503 = r3747500 + r3747502;
        double r3747504 = exp(r3747503);
        return r3747504;
}
↓
double f(double a, double b) {
        double r3747505 = a;
        double r3747506 = b;
        double r3747507 = r3747505 * r3747506;
        return r3747507;
}

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

  :herbie-target
  (* a b)

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