Average Error: 5.7 → 0
Time: 3.9s
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 r5943619 = a;
        double r5943620 = log(r5943619);
        double r5943621 = b;
        double r5943622 = log(r5943621);
        double r5943623 = r5943620 + r5943622;
        double r5943624 = exp(r5943623);
        return r5943624;
}
↓
double f(double a, double b) {
        double r5943625 = b;
        double r5943626 = a;
        double r5943627 = r5943625 * r5943626;
        return r5943627;
}

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

  3. Final simplification0

    \[\leadsto b \cdot a\]

Reproduce

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

  :herbie-target
  (* a b)

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