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 r3960053 = a;
        double r3960054 = log(r3960053);
        double r3960055 = b;
        double r3960056 = log(r3960055);
        double r3960057 = r3960054 + r3960056;
        double r3960058 = exp(r3960057);
        return r3960058;
}
↓
double f(double a, double b) {
        double r3960059 = a;
        double r3960060 = b;
        double r3960061 = r3960059 * r3960060;
        return r3960061;
}

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

  :herbie-target
  (* a b)

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