Average Error: 60.3 → 3.5
Time: 14.1s
Precision: binary64
Cost: 7236
\[-1 < \varepsilon \land \varepsilon < 1\]
\[ \begin{array}{c}[a, b] = \mathsf{sort}([a, b])\\ \end{array} \]
\[\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} t_0 := \frac{b + a}{a}\\ \mathbf{if}\;b \leq -1.6 \cdot 10^{+17}:\\ \;\;\;\;t_0 \cdot \frac{\varepsilon}{\mathsf{expm1}\left(b \cdot \varepsilon\right)}\\ \mathbf{elif}\;b \leq 3.3 \cdot 10^{-99}:\\ \;\;\;\;\frac{t_0}{b}\\ \mathbf{elif}\;b \leq 1.55 \cdot 10^{+227}:\\ \;\;\;\;\frac{\frac{b + a}{b}}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{\varepsilon}{\mathsf{expm1}\left(a \cdot \varepsilon\right)}\\ \end{array} \]
(FPCore (a b eps)
 :precision binary64
 (/
  (* eps (- (exp (* (+ a b) eps)) 1.0))
  (* (- (exp (* a eps)) 1.0) (- (exp (* b eps)) 1.0))))
(FPCore (a b eps)
 :precision binary64
 (let* ((t_0 (/ (+ b a) a)))
   (if (<= b -1.6e+17)
     (* t_0 (/ eps (expm1 (* b eps))))
     (if (<= b 3.3e-99)
       (/ t_0 b)
       (if (<= b 1.55e+227) (/ (/ (+ b a) b) a) (/ eps (expm1 (* a eps))))))))
double code(double a, double b, double eps) {
	return (eps * (exp(((a + b) * eps)) - 1.0)) / ((exp((a * eps)) - 1.0) * (exp((b * eps)) - 1.0));
}
double code(double a, double b, double eps) {
	double t_0 = (b + a) / a;
	double tmp;
	if (b <= -1.6e+17) {
		tmp = t_0 * (eps / expm1((b * eps)));
	} else if (b <= 3.3e-99) {
		tmp = t_0 / b;
	} else if (b <= 1.55e+227) {
		tmp = ((b + a) / b) / a;
	} else {
		tmp = eps / expm1((a * eps));
	}
	return tmp;
}
public static double code(double a, double b, double eps) {
	return (eps * (Math.exp(((a + b) * eps)) - 1.0)) / ((Math.exp((a * eps)) - 1.0) * (Math.exp((b * eps)) - 1.0));
}
public static double code(double a, double b, double eps) {
	double t_0 = (b + a) / a;
	double tmp;
	if (b <= -1.6e+17) {
		tmp = t_0 * (eps / Math.expm1((b * eps)));
	} else if (b <= 3.3e-99) {
		tmp = t_0 / b;
	} else if (b <= 1.55e+227) {
		tmp = ((b + a) / b) / a;
	} else {
		tmp = eps / Math.expm1((a * eps));
	}
	return tmp;
}
def code(a, b, eps):
	return (eps * (math.exp(((a + b) * eps)) - 1.0)) / ((math.exp((a * eps)) - 1.0) * (math.exp((b * eps)) - 1.0))
def code(a, b, eps):
	t_0 = (b + a) / a
	tmp = 0
	if b <= -1.6e+17:
		tmp = t_0 * (eps / math.expm1((b * eps)))
	elif b <= 3.3e-99:
		tmp = t_0 / b
	elif b <= 1.55e+227:
		tmp = ((b + a) / b) / a
	else:
		tmp = eps / math.expm1((a * eps))
	return tmp
function code(a, b, eps)
	return Float64(Float64(eps * Float64(exp(Float64(Float64(a + b) * eps)) - 1.0)) / Float64(Float64(exp(Float64(a * eps)) - 1.0) * Float64(exp(Float64(b * eps)) - 1.0)))
end
function code(a, b, eps)
	t_0 = Float64(Float64(b + a) / a)
	tmp = 0.0
	if (b <= -1.6e+17)
		tmp = Float64(t_0 * Float64(eps / expm1(Float64(b * eps))));
	elseif (b <= 3.3e-99)
		tmp = Float64(t_0 / b);
	elseif (b <= 1.55e+227)
		tmp = Float64(Float64(Float64(b + a) / b) / a);
	else
		tmp = Float64(eps / expm1(Float64(a * eps)));
	end
	return tmp
end
code[a_, b_, eps_] := N[(N[(eps * N[(N[Exp[N[(N[(a + b), $MachinePrecision] * eps), $MachinePrecision]], $MachinePrecision] - 1.0), $MachinePrecision]), $MachinePrecision] / N[(N[(N[Exp[N[(a * eps), $MachinePrecision]], $MachinePrecision] - 1.0), $MachinePrecision] * N[(N[Exp[N[(b * eps), $MachinePrecision]], $MachinePrecision] - 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
code[a_, b_, eps_] := Block[{t$95$0 = N[(N[(b + a), $MachinePrecision] / a), $MachinePrecision]}, If[LessEqual[b, -1.6e+17], N[(t$95$0 * N[(eps / N[(Exp[N[(b * eps), $MachinePrecision]] - 1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 3.3e-99], N[(t$95$0 / b), $MachinePrecision], If[LessEqual[b, 1.55e+227], N[(N[(N[(b + a), $MachinePrecision] / b), $MachinePrecision] / a), $MachinePrecision], N[(eps / N[(Exp[N[(a * eps), $MachinePrecision]] - 1), $MachinePrecision]), $MachinePrecision]]]]]
\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}
t_0 := \frac{b + a}{a}\\
\mathbf{if}\;b \leq -1.6 \cdot 10^{+17}:\\
\;\;\;\;t_0 \cdot \frac{\varepsilon}{\mathsf{expm1}\left(b \cdot \varepsilon\right)}\\

\mathbf{elif}\;b \leq 3.3 \cdot 10^{-99}:\\
\;\;\;\;\frac{t_0}{b}\\

\mathbf{elif}\;b \leq 1.55 \cdot 10^{+227}:\\
\;\;\;\;\frac{\frac{b + a}{b}}{a}\\

\mathbf{else}:\\
\;\;\;\;\frac{\varepsilon}{\mathsf{expm1}\left(a \cdot \varepsilon\right)}\\


\end{array}

Error

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Target

Original60.3
Target15.4
Herbie3.5
\[\frac{a + b}{a \cdot b} \]

Derivation

  1. Split input into 4 regimes
  2. if b < -1.6e17

    1. Initial program 43.7

      \[\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. Simplified0.9

      \[\leadsto \color{blue}{\frac{\mathsf{expm1}\left(\varepsilon \cdot \left(a + b\right)\right)}{\mathsf{expm1}\left(\varepsilon \cdot a\right)} \cdot \frac{\varepsilon}{\mathsf{expm1}\left(\varepsilon \cdot b\right)}} \]
      Proof
      (*.f64 (/.f64 (expm1.f64 (*.f64 eps (+.f64 a b))) (expm1.f64 (*.f64 eps a))) (/.f64 eps (expm1.f64 (*.f64 eps b)))): 0 points increase in error, 0 points decrease in error
      (*.f64 (/.f64 (expm1.f64 (Rewrite<= *-commutative_binary64 (*.f64 (+.f64 a b) eps))) (expm1.f64 (*.f64 eps a))) (/.f64 eps (expm1.f64 (*.f64 eps b)))): 0 points increase in error, 0 points decrease in error
      (*.f64 (/.f64 (Rewrite<= expm1-def_binary64 (-.f64 (exp.f64 (*.f64 (+.f64 a b) eps)) 1)) (expm1.f64 (*.f64 eps a))) (/.f64 eps (expm1.f64 (*.f64 eps b)))): 108 points increase in error, 0 points decrease in error
      (*.f64 (/.f64 (-.f64 (exp.f64 (*.f64 (+.f64 a b) eps)) 1) (expm1.f64 (Rewrite<= *-commutative_binary64 (*.f64 a eps)))) (/.f64 eps (expm1.f64 (*.f64 eps b)))): 0 points increase in error, 0 points decrease in error
      (*.f64 (/.f64 (-.f64 (exp.f64 (*.f64 (+.f64 a b) eps)) 1) (Rewrite<= expm1-def_binary64 (-.f64 (exp.f64 (*.f64 a eps)) 1))) (/.f64 eps (expm1.f64 (*.f64 eps b)))): 122 points increase in error, 7 points decrease in error
      (*.f64 (/.f64 (-.f64 (exp.f64 (*.f64 (+.f64 a b) eps)) 1) (-.f64 (exp.f64 (*.f64 a eps)) 1)) (/.f64 eps (expm1.f64 (Rewrite<= *-commutative_binary64 (*.f64 b eps))))): 0 points increase in error, 0 points decrease in error
      (*.f64 (/.f64 (-.f64 (exp.f64 (*.f64 (+.f64 a b) eps)) 1) (-.f64 (exp.f64 (*.f64 a eps)) 1)) (/.f64 eps (Rewrite<= expm1-def_binary64 (-.f64 (exp.f64 (*.f64 b eps)) 1)))): 28 points increase in error, 0 points decrease in error
      (Rewrite<= times-frac_binary64 (/.f64 (*.f64 (-.f64 (exp.f64 (*.f64 (+.f64 a b) eps)) 1) eps) (*.f64 (-.f64 (exp.f64 (*.f64 a eps)) 1) (-.f64 (exp.f64 (*.f64 b eps)) 1)))): 1 points increase in error, 0 points decrease in error
      (/.f64 (Rewrite<= *-commutative_binary64 (*.f64 eps (-.f64 (exp.f64 (*.f64 (+.f64 a b) eps)) 1))) (*.f64 (-.f64 (exp.f64 (*.f64 a eps)) 1) (-.f64 (exp.f64 (*.f64 b eps)) 1))): 0 points increase in error, 0 points decrease in error
    3. Taylor expanded in eps around 0 1.6

      \[\leadsto \color{blue}{\frac{a + b}{a}} \cdot \frac{\varepsilon}{\mathsf{expm1}\left(\varepsilon \cdot b\right)} \]
    4. Simplified1.6

      \[\leadsto \color{blue}{\frac{b + a}{a}} \cdot \frac{\varepsilon}{\mathsf{expm1}\left(\varepsilon \cdot b\right)} \]
      Proof
      (/.f64 (+.f64 b a) a): 0 points increase in error, 0 points decrease in error
      (/.f64 (Rewrite=> +-commutative_binary64 (+.f64 a b)) a): 0 points increase in error, 0 points decrease in error

    if -1.6e17 < b < 3.29999999999999986e-99

    1. Initial program 64.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. Simplified41.0

      \[\leadsto \color{blue}{\frac{\varepsilon}{\mathsf{expm1}\left(\varepsilon \cdot a\right)} \cdot \frac{\mathsf{expm1}\left(\varepsilon \cdot \left(a + b\right)\right)}{\mathsf{expm1}\left(\varepsilon \cdot b\right)}} \]
      Proof
      (*.f64 (/.f64 eps (expm1.f64 (*.f64 eps a))) (/.f64 (expm1.f64 (*.f64 eps (+.f64 a b))) (expm1.f64 (*.f64 eps b)))): 0 points increase in error, 0 points decrease in error
      (*.f64 (/.f64 eps (expm1.f64 (Rewrite<= *-commutative_binary64 (*.f64 a eps)))) (/.f64 (expm1.f64 (*.f64 eps (+.f64 a b))) (expm1.f64 (*.f64 eps b)))): 0 points increase in error, 0 points decrease in error
      (*.f64 (/.f64 eps (Rewrite<= expm1-def_binary64 (-.f64 (exp.f64 (*.f64 a eps)) 1))) (/.f64 (expm1.f64 (*.f64 eps (+.f64 a b))) (expm1.f64 (*.f64 eps b)))): 131 points increase in error, 0 points decrease in error
      (*.f64 (/.f64 eps (-.f64 (exp.f64 (*.f64 a eps)) 1)) (/.f64 (expm1.f64 (Rewrite<= *-commutative_binary64 (*.f64 (+.f64 a b) eps))) (expm1.f64 (*.f64 eps b)))): 0 points increase in error, 0 points decrease in error
      (*.f64 (/.f64 eps (-.f64 (exp.f64 (*.f64 a eps)) 1)) (/.f64 (Rewrite<= expm1-def_binary64 (-.f64 (exp.f64 (*.f64 (+.f64 a b) eps)) 1)) (expm1.f64 (*.f64 eps b)))): 0 points increase in error, 7 points decrease in error
      (*.f64 (/.f64 eps (-.f64 (exp.f64 (*.f64 a eps)) 1)) (/.f64 (-.f64 (exp.f64 (*.f64 (+.f64 a b) eps)) 1) (expm1.f64 (Rewrite<= *-commutative_binary64 (*.f64 b eps))))): 0 points increase in error, 0 points decrease in error
      (*.f64 (/.f64 eps (-.f64 (exp.f64 (*.f64 a eps)) 1)) (/.f64 (-.f64 (exp.f64 (*.f64 (+.f64 a b) eps)) 1) (Rewrite<= expm1-def_binary64 (-.f64 (exp.f64 (*.f64 b eps)) 1)))): 26 points increase in error, 0 points decrease in error
      (Rewrite<= times-frac_binary64 (/.f64 (*.f64 eps (-.f64 (exp.f64 (*.f64 (+.f64 a b) eps)) 1)) (*.f64 (-.f64 (exp.f64 (*.f64 a eps)) 1) (-.f64 (exp.f64 (*.f64 b eps)) 1)))): 1 points increase in error, 1 points decrease in error
    3. Applied egg-rr49.1

      \[\leadsto \frac{\varepsilon}{\mathsf{expm1}\left(\varepsilon \cdot a\right)} \cdot \color{blue}{\mathsf{expm1}\left(\mathsf{log1p}\left(\frac{\mathsf{expm1}\left(\varepsilon \cdot \left(a + b\right)\right)}{\mathsf{expm1}\left(\varepsilon \cdot b\right)}\right)\right)} \]
    4. Taylor expanded in eps around 0 20.6

      \[\leadsto \color{blue}{\frac{a + b}{a \cdot b}} \]
    5. Simplified0.1

      \[\leadsto \color{blue}{\frac{\frac{a + b}{a}}{b}} \]
      Proof
      (/.f64 (/.f64 (+.f64 a b) a) b): 0 points increase in error, 0 points decrease in error
      (Rewrite<= associate-/r*_binary64 (/.f64 (+.f64 a b) (*.f64 a b))): 90 points increase in error, 36 points decrease in error

    if 3.29999999999999986e-99 < b < 1.5499999999999999e227

    1. Initial program 60.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. Simplified35.8

      \[\leadsto \color{blue}{\mathsf{expm1}\left(\varepsilon \cdot \left(a + b\right)\right) \cdot \frac{\varepsilon}{\mathsf{expm1}\left(\varepsilon \cdot a\right) \cdot \mathsf{expm1}\left(\varepsilon \cdot b\right)}} \]
      Proof
      (*.f64 (expm1.f64 (*.f64 eps (+.f64 a b))) (/.f64 eps (*.f64 (expm1.f64 (*.f64 eps a)) (expm1.f64 (*.f64 eps b))))): 0 points increase in error, 0 points decrease in error
      (*.f64 (expm1.f64 (Rewrite<= *-commutative_binary64 (*.f64 (+.f64 a b) eps))) (/.f64 eps (*.f64 (expm1.f64 (*.f64 eps a)) (expm1.f64 (*.f64 eps b))))): 0 points increase in error, 0 points decrease in error
      (*.f64 (Rewrite<= expm1-def_binary64 (-.f64 (exp.f64 (*.f64 (+.f64 a b) eps)) 1)) (/.f64 eps (*.f64 (expm1.f64 (*.f64 eps a)) (expm1.f64 (*.f64 eps b))))): 54 points increase in error, 2 points decrease in error
      (*.f64 (-.f64 (exp.f64 (*.f64 (+.f64 a b) eps)) 1) (/.f64 eps (*.f64 (expm1.f64 (Rewrite<= *-commutative_binary64 (*.f64 a eps))) (expm1.f64 (*.f64 eps b))))): 0 points increase in error, 0 points decrease in error
      (*.f64 (-.f64 (exp.f64 (*.f64 (+.f64 a b) eps)) 1) (/.f64 eps (*.f64 (Rewrite<= expm1-def_binary64 (-.f64 (exp.f64 (*.f64 a eps)) 1)) (expm1.f64 (*.f64 eps b))))): 72 points increase in error, 5 points decrease in error
      (*.f64 (-.f64 (exp.f64 (*.f64 (+.f64 a b) eps)) 1) (/.f64 eps (*.f64 (-.f64 (exp.f64 (*.f64 a eps)) 1) (expm1.f64 (Rewrite<= *-commutative_binary64 (*.f64 b eps)))))): 0 points increase in error, 0 points decrease in error
      (*.f64 (-.f64 (exp.f64 (*.f64 (+.f64 a b) eps)) 1) (/.f64 eps (*.f64 (-.f64 (exp.f64 (*.f64 a eps)) 1) (Rewrite<= expm1-def_binary64 (-.f64 (exp.f64 (*.f64 b eps)) 1))))): 28 points increase in error, 0 points decrease in error
      (Rewrite=> associate-*r/_binary64 (/.f64 (*.f64 (-.f64 (exp.f64 (*.f64 (+.f64 a b) eps)) 1) eps) (*.f64 (-.f64 (exp.f64 (*.f64 a eps)) 1) (-.f64 (exp.f64 (*.f64 b eps)) 1)))): 0 points increase in error, 0 points decrease in error
      (/.f64 (Rewrite<= *-commutative_binary64 (*.f64 eps (-.f64 (exp.f64 (*.f64 (+.f64 a b) eps)) 1))) (*.f64 (-.f64 (exp.f64 (*.f64 a eps)) 1) (-.f64 (exp.f64 (*.f64 b eps)) 1))): 0 points increase in error, 0 points decrease in error
    3. Taylor expanded in eps around 0 7.5

      \[\leadsto \color{blue}{\frac{a + b}{a \cdot b}} \]
    4. Simplified3.9

      \[\leadsto \color{blue}{\frac{\frac{a + b}{b}}{a}} \]
      Proof
      (/.f64 (/.f64 (+.f64 a b) b) a): 0 points increase in error, 0 points decrease in error
      (Rewrite<= associate-/r*_binary64 (/.f64 (+.f64 a b) (*.f64 b a))): 85 points increase in error, 46 points decrease in error
      (/.f64 (+.f64 a b) (Rewrite<= *-commutative_binary64 (*.f64 a b))): 0 points increase in error, 0 points decrease in error

    if 1.5499999999999999e227 < b

    1. Initial program 49.6

      \[\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. Simplified18.2

      \[\leadsto \color{blue}{\frac{\varepsilon}{\mathsf{expm1}\left(\varepsilon \cdot a\right)} \cdot \frac{\mathsf{expm1}\left(\varepsilon \cdot \left(a + b\right)\right)}{\mathsf{expm1}\left(\varepsilon \cdot b\right)}} \]
      Proof
      (*.f64 (/.f64 eps (expm1.f64 (*.f64 eps a))) (/.f64 (expm1.f64 (*.f64 eps (+.f64 a b))) (expm1.f64 (*.f64 eps b)))): 0 points increase in error, 0 points decrease in error
      (*.f64 (/.f64 eps (expm1.f64 (Rewrite<= *-commutative_binary64 (*.f64 a eps)))) (/.f64 (expm1.f64 (*.f64 eps (+.f64 a b))) (expm1.f64 (*.f64 eps b)))): 0 points increase in error, 0 points decrease in error
      (*.f64 (/.f64 eps (Rewrite<= expm1-def_binary64 (-.f64 (exp.f64 (*.f64 a eps)) 1))) (/.f64 (expm1.f64 (*.f64 eps (+.f64 a b))) (expm1.f64 (*.f64 eps b)))): 131 points increase in error, 0 points decrease in error
      (*.f64 (/.f64 eps (-.f64 (exp.f64 (*.f64 a eps)) 1)) (/.f64 (expm1.f64 (Rewrite<= *-commutative_binary64 (*.f64 (+.f64 a b) eps))) (expm1.f64 (*.f64 eps b)))): 0 points increase in error, 0 points decrease in error
      (*.f64 (/.f64 eps (-.f64 (exp.f64 (*.f64 a eps)) 1)) (/.f64 (Rewrite<= expm1-def_binary64 (-.f64 (exp.f64 (*.f64 (+.f64 a b) eps)) 1)) (expm1.f64 (*.f64 eps b)))): 0 points increase in error, 7 points decrease in error
      (*.f64 (/.f64 eps (-.f64 (exp.f64 (*.f64 a eps)) 1)) (/.f64 (-.f64 (exp.f64 (*.f64 (+.f64 a b) eps)) 1) (expm1.f64 (Rewrite<= *-commutative_binary64 (*.f64 b eps))))): 0 points increase in error, 0 points decrease in error
      (*.f64 (/.f64 eps (-.f64 (exp.f64 (*.f64 a eps)) 1)) (/.f64 (-.f64 (exp.f64 (*.f64 (+.f64 a b) eps)) 1) (Rewrite<= expm1-def_binary64 (-.f64 (exp.f64 (*.f64 b eps)) 1)))): 26 points increase in error, 0 points decrease in error
      (Rewrite<= times-frac_binary64 (/.f64 (*.f64 eps (-.f64 (exp.f64 (*.f64 (+.f64 a b) eps)) 1)) (*.f64 (-.f64 (exp.f64 (*.f64 a eps)) 1) (-.f64 (exp.f64 (*.f64 b eps)) 1)))): 1 points increase in error, 1 points decrease in error
    3. Taylor expanded in a around 0 19.1

      \[\leadsto \frac{\varepsilon}{\mathsf{expm1}\left(\varepsilon \cdot a\right)} \cdot \color{blue}{1} \]
  3. Recombined 4 regimes into one program.
  4. Final simplification3.5

    \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq -1.6 \cdot 10^{+17}:\\ \;\;\;\;\frac{b + a}{a} \cdot \frac{\varepsilon}{\mathsf{expm1}\left(b \cdot \varepsilon\right)}\\ \mathbf{elif}\;b \leq 3.3 \cdot 10^{-99}:\\ \;\;\;\;\frac{\frac{b + a}{a}}{b}\\ \mathbf{elif}\;b \leq 1.55 \cdot 10^{+227}:\\ \;\;\;\;\frac{\frac{b + a}{b}}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{\varepsilon}{\mathsf{expm1}\left(a \cdot \varepsilon\right)}\\ \end{array} \]

Alternatives

Alternative 1
Error4.3
Cost6984
\[\begin{array}{l} \mathbf{if}\;b \leq 3.5 \cdot 10^{-99}:\\ \;\;\;\;\frac{\frac{b + a}{a}}{b}\\ \mathbf{elif}\;b \leq 1.2 \cdot 10^{+227}:\\ \;\;\;\;\frac{\frac{b + a}{b}}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{\varepsilon}{\mathsf{expm1}\left(a \cdot \varepsilon\right)}\\ \end{array} \]
Alternative 2
Error9.8
Cost712
\[\begin{array}{l} \mathbf{if}\;b \leq 1.15 \cdot 10^{-137}:\\ \;\;\;\;\frac{1}{b}\\ \mathbf{elif}\;b \leq 9.5 \cdot 10^{+172}:\\ \;\;\;\;\frac{b + a}{b \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{a}\\ \end{array} \]
Alternative 3
Error5.4
Cost580
\[\begin{array}{l} \mathbf{if}\;b \leq 1.06 \cdot 10^{+119}:\\ \;\;\;\;\frac{\frac{b + a}{a}}{b}\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{a}\\ \end{array} \]
Alternative 4
Error3.7
Cost580
\[\begin{array}{l} \mathbf{if}\;b \leq 3.5 \cdot 10^{-99}:\\ \;\;\;\;\frac{\frac{b + a}{a}}{b}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{b + a}{b}}{a}\\ \end{array} \]
Alternative 5
Error14.4
Cost324
\[\begin{array}{l} \mathbf{if}\;b \leq 8.5 \cdot 10^{-98}:\\ \;\;\;\;\frac{1}{b}\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{a}\\ \end{array} \]
Alternative 6
Error33.1
Cost192
\[\frac{1}{a} \]

Error

Reproduce

herbie shell --seed 2022329 
(FPCore (a b eps)
  :name "expq3 (problem 3.4.2)"
  :precision binary64
  :pre (and (< -1.0 eps) (< eps 1.0))

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

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