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 r4656057 = a;
        double r4656058 = log(r4656057);
        double r4656059 = b;
        double r4656060 = log(r4656059);
        double r4656061 = r4656058 + r4656060;
        double r4656062 = exp(r4656061);
        return r4656062;
}
↓
double f(double a, double b) {
        double r4656063 = a;
        double r4656064 = b;
        double r4656065 = r4656063 * r4656064;
        return r4656065;
}

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

  :herbie-target
  (* a b)

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