Average Error: 5.7 → 0
Time: 3.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 r166085 = a;
        double r166086 = log(r166085);
        double r166087 = b;
        double r166088 = log(r166087);
        double r166089 = r166086 + r166088;
        double r166090 = exp(r166089);
        return r166090;
}
↓
double f(double a, double b) {
        double r166091 = a;
        double r166092 = b;
        double r166093 = r166091 * r166092;
        return r166093;
}

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. Using strategy rm

  3. Applied exp-sum5.4

    \[\leadsto \color{blue}{e^{\log a} \cdot e^{\log b}}\]

  4. Simplified4.7

    \[\leadsto \color{blue}{a} \cdot e^{\log b}\]

  5. Simplified0

    \[\leadsto a \cdot \color{blue}{b}\]

  6. Final simplification0

    \[\leadsto a \cdot b\]

Reproduce

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

  :herbie-target
  (* a b)

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