Average Error: 58.3 → 3.9
Time: 24.6s
Precision: 64
Internal Precision: 2368
\[\frac{\varepsilon \cdot \left(e^{\left(a + b\right) \cdot \varepsilon} - 1\right)}{\left(e^{a \cdot \varepsilon} - 1\right) \cdot \left(e^{b \cdot \varepsilon} - 1\right)}\]
\[\begin{array}{l} \mathbf{if}\;b \le 6.258729627493405 \cdot 10^{+168} \lor \neg \left(b \le 2.0109873392712158 \cdot 10^{+275}\right):\\ \;\;\;\;\frac{1}{a} + \frac{1}{b}\\ \mathbf{else}:\\ \;\;\;\;\frac{(e^{\left(b + a\right) \cdot \varepsilon} - 1)^*}{(e^{\varepsilon \cdot b} - 1)^*} \cdot \frac{1}{\frac{(e^{\varepsilon \cdot a} - 1)^*}{\varepsilon}}\\ \end{array}\]

Error

Bits error versus a

Bits error versus b

Bits error versus eps

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Target

Original58.3
Target13.7
Herbie3.9
\[\frac{a + b}{a \cdot b}\]

Derivation

  1. Split input into 2 regimes
  2. if b < 6.258729627493405e+168 or 2.0109873392712158e+275 < b

    1. Initial program 59.0

      \[\frac{\varepsilon \cdot \left(e^{\left(a + b\right) \cdot \varepsilon} - 1\right)}{\left(e^{a \cdot \varepsilon} - 1\right) \cdot \left(e^{b \cdot \varepsilon} - 1\right)}\]
    2. Initial simplification29.0

      \[\leadsto \frac{(e^{\left(a + b\right) \cdot \varepsilon} - 1)^*}{(e^{\varepsilon \cdot b} - 1)^*} \cdot \frac{\varepsilon}{(e^{\varepsilon \cdot a} - 1)^*}\]
    3. Taylor expanded around 0 3.0

      \[\leadsto \color{blue}{\frac{1}{a} + \frac{1}{b}}\]

    if 6.258729627493405e+168 < b < 2.0109873392712158e+275

    1. Initial program 48.5

      \[\frac{\varepsilon \cdot \left(e^{\left(a + b\right) \cdot \varepsilon} - 1\right)}{\left(e^{a \cdot \varepsilon} - 1\right) \cdot \left(e^{b \cdot \varepsilon} - 1\right)}\]
    2. Initial simplification16.6

      \[\leadsto \frac{(e^{\left(a + b\right) \cdot \varepsilon} - 1)^*}{(e^{\varepsilon \cdot b} - 1)^*} \cdot \frac{\varepsilon}{(e^{\varepsilon \cdot a} - 1)^*}\]
    3. Using strategy rm
    4. Applied clear-num16.6

      \[\leadsto \frac{(e^{\left(a + b\right) \cdot \varepsilon} - 1)^*}{(e^{\varepsilon \cdot b} - 1)^*} \cdot \color{blue}{\frac{1}{\frac{(e^{\varepsilon \cdot a} - 1)^*}{\varepsilon}}}\]
  3. Recombined 2 regimes into one program.
  4. Final simplification3.9

    \[\leadsto \begin{array}{l} \mathbf{if}\;b \le 6.258729627493405 \cdot 10^{+168} \lor \neg \left(b \le 2.0109873392712158 \cdot 10^{+275}\right):\\ \;\;\;\;\frac{1}{a} + \frac{1}{b}\\ \mathbf{else}:\\ \;\;\;\;\frac{(e^{\left(b + a\right) \cdot \varepsilon} - 1)^*}{(e^{\varepsilon \cdot b} - 1)^*} \cdot \frac{1}{\frac{(e^{\varepsilon \cdot a} - 1)^*}{\varepsilon}}\\ \end{array}\]

Runtime

Time bar (total: 24.6s)Debug logProfile

BaselineHerbieOracleSpan%
Regimes3.63.90.03.6-6.4%
herbie shell --seed 2018340 +o rules:numerics
(FPCore (a b eps)
  :name "expq3 (problem 3.4.2)"
  :pre (and (< -1 eps) (< eps 1))

  :herbie-target
  (/ (+ a b) (* a b))

  (/ (* eps (- (exp (* (+ a b) eps)) 1)) (* (- (exp (* a eps)) 1) (- (exp (* b eps)) 1))))