Average Error: 5.7 → 0
Time: 4.7s
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 r4420150 = a;
        double r4420151 = log(r4420150);
        double r4420152 = b;
        double r4420153 = log(r4420152);
        double r4420154 = r4420151 + r4420153;
        double r4420155 = exp(r4420154);
        return r4420155;
}
↓
double f(double a, double b) {
        double r4420156 = a;
        double r4420157 = b;
        double r4420158 = r4420156 * r4420157;
        return r4420158;
}

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

  :herbie-target
  (* a b)

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