exp2 (problem 3.3.7)

Percentage Accurate: 77.1% → 100.0%

Time: 8.5s

Precision: binary64

Cost: 39940

• 50.1% of points produce a very large (infinite) output. You may want to add a precondition.

Math

\[\left(e^{x} - 2\right) + e^{-x} \]

↓

\[\begin{array}{l} \mathbf{if}\;\left(e^{x} - 2\right) + e^{-x} \leq 0.0005:\\ \;\;\;\;0.002777777777777778 \cdot {x}^{6} + \left({x}^{2} + \left(0.08333333333333333 \cdot {x}^{4} + 4.96031746031746 \cdot 10^{-5} \cdot {x}^{8}\right)\right)\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \cosh x - 2\\ \end{array} \]

FPCore

(FPCore (x) :precision binary64 (+ (- (exp x) 2.0) (exp (- x))))

↓

(FPCore (x)
 :precision binary64
 (if (<= (+ (- (exp x) 2.0) (exp (- x))) 0.0005)
   (+
    (* 0.002777777777777778 (pow x 6.0))
    (+
     (pow x 2.0)
     (+
      (* 0.08333333333333333 (pow x 4.0))
      (* 4.96031746031746e-5 (pow x 8.0)))))
   (- (* 2.0 (cosh x)) 2.0)))

C

double code(double x) {
	return (exp(x) - 2.0) + exp(-x);
}

↓

double code(double x) {
	double tmp;
	if (((exp(x) - 2.0) + exp(-x)) <= 0.0005) {
		tmp = (0.002777777777777778 * pow(x, 6.0)) + (pow(x, 2.0) + ((0.08333333333333333 * pow(x, 4.0)) + (4.96031746031746e-5 * pow(x, 8.0))));
	} else {
		tmp = (2.0 * cosh(x)) - 2.0;
	}
	return tmp;
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    code = (exp(x) - 2.0d0) + exp(-x)
end function

↓

real(8) function code(x)
    real(8), intent (in) :: x
    real(8) :: tmp
    if (((exp(x) - 2.0d0) + exp(-x)) <= 0.0005d0) then
        tmp = (0.002777777777777778d0 * (x ** 6.0d0)) + ((x ** 2.0d0) + ((0.08333333333333333d0 * (x ** 4.0d0)) + (4.96031746031746d-5 * (x ** 8.0d0))))
    else
        tmp = (2.0d0 * cosh(x)) - 2.0d0
    end if
    code = tmp
end function

Java

public static double code(double x) {
	return (Math.exp(x) - 2.0) + Math.exp(-x);
}

↓

public static double code(double x) {
	double tmp;
	if (((Math.exp(x) - 2.0) + Math.exp(-x)) <= 0.0005) {
		tmp = (0.002777777777777778 * Math.pow(x, 6.0)) + (Math.pow(x, 2.0) + ((0.08333333333333333 * Math.pow(x, 4.0)) + (4.96031746031746e-5 * Math.pow(x, 8.0))));
	} else {
		tmp = (2.0 * Math.cosh(x)) - 2.0;
	}
	return tmp;
}

Python

def code(x):
	return (math.exp(x) - 2.0) + math.exp(-x)

↓

def code(x):
	tmp = 0
	if ((math.exp(x) - 2.0) + math.exp(-x)) <= 0.0005:
		tmp = (0.002777777777777778 * math.pow(x, 6.0)) + (math.pow(x, 2.0) + ((0.08333333333333333 * math.pow(x, 4.0)) + (4.96031746031746e-5 * math.pow(x, 8.0))))
	else:
		tmp = (2.0 * math.cosh(x)) - 2.0
	return tmp

Julia

function code(x)
	return Float64(Float64(exp(x) - 2.0) + exp(Float64(-x)))
end

↓

function code(x)
	tmp = 0.0
	if (Float64(Float64(exp(x) - 2.0) + exp(Float64(-x))) <= 0.0005)
		tmp = Float64(Float64(0.002777777777777778 * (x ^ 6.0)) + Float64((x ^ 2.0) + Float64(Float64(0.08333333333333333 * (x ^ 4.0)) + Float64(4.96031746031746e-5 * (x ^ 8.0)))));
	else
		tmp = Float64(Float64(2.0 * cosh(x)) - 2.0);
	end
	return tmp
end

MATLAB

function tmp = code(x)
	tmp = (exp(x) - 2.0) + exp(-x);
end

↓

function tmp_2 = code(x)
	tmp = 0.0;
	if (((exp(x) - 2.0) + exp(-x)) <= 0.0005)
		tmp = (0.002777777777777778 * (x ^ 6.0)) + ((x ^ 2.0) + ((0.08333333333333333 * (x ^ 4.0)) + (4.96031746031746e-5 * (x ^ 8.0))));
	else
		tmp = (2.0 * cosh(x)) - 2.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_] := N[(N[(N[Exp[x], $MachinePrecision] - 2.0), $MachinePrecision] + N[Exp[(-x)], $MachinePrecision]), $MachinePrecision]

↓

code[x_] := If[LessEqual[N[(N[(N[Exp[x], $MachinePrecision] - 2.0), $MachinePrecision] + N[Exp[(-x)], $MachinePrecision]), $MachinePrecision], 0.0005], N[(N[(0.002777777777777778 * N[Power[x, 6.0], $MachinePrecision]), $MachinePrecision] + N[(N[Power[x, 2.0], $MachinePrecision] + N[(N[(0.08333333333333333 * N[Power[x, 4.0], $MachinePrecision]), $MachinePrecision] + N[(4.96031746031746e-5 * N[Power[x, 8.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(2.0 * N[Cosh[x], $MachinePrecision]), $MachinePrecision] - 2.0), $MachinePrecision]]

Target

Original	77.1%
Target	100.0%
Herbie	100.0%

\[4 \cdot {\sinh \left(\frac{x}{2}\right)}^{2} \]

Derivation

1. Split input into 2 regimes

2. if (+.f64 (-.f64 (exp.f64 x) 2) (exp.f64 (neg.f64 x))) < 5.0000000000000001e-4

   1. Initial program 49.3%

      \[\left(e^{x} - 2\right) + e^{-x} \]

   2. Simplified 49.2%

      \[\leadsto \color{blue}{e^{x} + \left(e^{-x} + -2\right)} \]
      Step-by-step derivation

      [Start] 49.3%	\[ \left(e^{x} - 2\right) + e^{-x} \]
      associate-+l- [=>] 49.2%	\[ \color{blue}{e^{x} - \left(2 - e^{-x}\right)} \]
      sub-neg [=>] 49.2%	\[ \color{blue}{e^{x} + \left(-\left(2 - e^{-x}\right)\right)} \]
      sub-neg [=>] 49.2%	\[ e^{x} + \left(-\color{blue}{\left(2 + \left(-e^{-x}\right)\right)}\right) \]
      +-commutative [=>] 49.2%	\[ e^{x} + \left(-\color{blue}{\left(\left(-e^{-x}\right) + 2\right)}\right) \]
      distribute-neg-in [=>] 49.2%	\[ e^{x} + \color{blue}{\left(\left(-\left(-e^{-x}\right)\right) + \left(-2\right)\right)} \]
      remove-double-neg [=>] 49.2%	\[ e^{x} + \left(\color{blue}{e^{-x}} + \left(-2\right)\right) \]
      metadata-eval [=>] 49.2%	\[ e^{x} + \left(e^{-x} + \color{blue}{-2}\right) \]

   3. Taylor expanded in x around 0 100.0%

      \[\leadsto \color{blue}{0.002777777777777778 \cdot {x}^{6} + \left({x}^{2} + \left(0.08333333333333333 \cdot {x}^{4} + 4.96031746031746 \cdot 10^{-5} \cdot {x}^{8}\right)\right)} \]

   if 5.0000000000000001e-4 < (+.f64 (-.f64 (exp.f64 x) 2) (exp.f64 (neg.f64 x)))

   1. Initial program 100.0%

      \[\left(e^{x} - 2\right) + e^{-x} \]

   2. Simplified 100.0%

      \[\leadsto \color{blue}{e^{x} + \left(e^{-x} + -2\right)} \]
      Step-by-step derivation

      [Start] 100.0%	\[ \left(e^{x} - 2\right) + e^{-x} \]
      associate-+l- [=>] 100.0%	\[ \color{blue}{e^{x} - \left(2 - e^{-x}\right)} \]
      sub-neg [=>] 100.0%	\[ \color{blue}{e^{x} + \left(-\left(2 - e^{-x}\right)\right)} \]
      sub-neg [=>] 100.0%	\[ e^{x} + \left(-\color{blue}{\left(2 + \left(-e^{-x}\right)\right)}\right) \]
      +-commutative [=>] 100.0%	\[ e^{x} + \left(-\color{blue}{\left(\left(-e^{-x}\right) + 2\right)}\right) \]
      distribute-neg-in [=>] 100.0%	\[ e^{x} + \color{blue}{\left(\left(-\left(-e^{-x}\right)\right) + \left(-2\right)\right)} \]
      remove-double-neg [=>] 100.0%	\[ e^{x} + \left(\color{blue}{e^{-x}} + \left(-2\right)\right) \]
      metadata-eval [=>] 100.0%	\[ e^{x} + \left(e^{-x} + \color{blue}{-2}\right) \]

   3. Applied egg-rr 100.0%

      \[\leadsto \color{blue}{2 \cdot \cosh x - 2} \]
      Step-by-step derivation

      [Start] 100.0%	\[ e^{x} + \left(e^{-x} + -2\right) \]
      associate-+r+ [=>] 100.0%	\[ \color{blue}{\left(e^{x} + e^{-x}\right) + -2} \]
      cosh-undef [=>] 100.0%	\[ \color{blue}{2 \cdot \cosh x} + -2 \]
      fma-def [=>] 100.0%	\[ \color{blue}{\mathsf{fma}\left(2, \cosh x, -2\right)} \]
      metadata-eval [<=] 100.0%	\[ \mathsf{fma}\left(2, \cosh x, \color{blue}{-2}\right) \]
      fma-neg [<=] 100.0%	\[ \color{blue}{2 \cdot \cosh x - 2} \]

3. Recombined 2 regimes into one program.

4. Final simplification 100.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\left(e^{x} - 2\right) + e^{-x} \leq 0.0005:\\ \;\;\;\;0.002777777777777778 \cdot {x}^{6} + \left({x}^{2} + \left(0.08333333333333333 \cdot {x}^{4} + 4.96031746031746 \cdot 10^{-5} \cdot {x}^{8}\right)\right)\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \cosh x - 2\\ \end{array} \]

Alternatives

Alternative 1
Accuracy	100.0%
Cost	39940

\[\begin{array}{l} \mathbf{if}\;\left(e^{x} - 2\right) + e^{-x} \leq 0.0005:\\ \;\;\;\;0.002777777777777778 \cdot {x}^{6} + \left({x}^{2} + \left(0.08333333333333333 \cdot {x}^{4} + 4.96031746031746 \cdot 10^{-5} \cdot {x}^{8}\right)\right)\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \cosh x - 2\\ \end{array} \]

Alternative 2
Accuracy	100.0%
Cost	26884

\[\begin{array}{l} \mathbf{if}\;\left(e^{x} - 2\right) + e^{-x} \leq 0.0005:\\ \;\;\;\;\left(0.002777777777777778 \cdot {x}^{6} + 0.08333333333333333 \cdot {x}^{4}\right) + x \cdot x\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \cosh x - 2\\ \end{array} \]

Alternative 3
Accuracy	99.7%
Cost	26436

\[\begin{array}{l} t_0 := e^{-x}\\ \mathbf{if}\;\left(e^{x} - 2\right) + t_0 \leq 2 \cdot 10^{-11}:\\ \;\;\;\;0.08333333333333333 \cdot {x}^{4} + x \cdot x\\ \mathbf{else}:\\ \;\;\;\;e^{x} + \left(t_0 + -2\right)\\ \end{array} \]

Alternative 4
Accuracy	99.8%
Cost	7176

\[\begin{array}{l} \mathbf{if}\;x \leq -0.0058:\\ \;\;\;\;2 \cdot \cosh x - 2\\ \mathbf{elif}\;x \leq 2.6:\\ \;\;\;\;0.08333333333333333 \cdot {x}^{4} + x \cdot x\\ \mathbf{else}:\\ \;\;\;\;\mathsf{expm1}\left(x\right)\\ \end{array} \]

Alternative 5
Accuracy	99.5%
Cost	6852

\[\begin{array}{l} \mathbf{if}\;x \leq -0.000205:\\ \;\;\;\;2 \cdot \cosh x - 2\\ \mathbf{elif}\;x \leq 1.65:\\ \;\;\;\;x \cdot x\\ \mathbf{else}:\\ \;\;\;\;\mathsf{expm1}\left(x\right)\\ \end{array} \]

Alternative 6
Accuracy	95.1%
Cost	6788

\[\begin{array}{l} \mathbf{if}\;x \leq -4.4:\\ \;\;\;\;0.002777777777777778 \cdot {x}^{6}\\ \mathbf{elif}\;x \leq 1.65:\\ \;\;\;\;x \cdot x\\ \mathbf{else}:\\ \;\;\;\;\mathsf{expm1}\left(x\right)\\ \end{array} \]

Alternative 7
Accuracy	87.1%
Cost	6596

\[\begin{array}{l} \mathbf{if}\;x \leq 1.65:\\ \;\;\;\;x \cdot x\\ \mathbf{else}:\\ \;\;\;\;\mathsf{expm1}\left(x\right)\\ \end{array} \]

Alternative 8
Accuracy	75.4%
Cost	192

\[x \cdot x \]

Alternative 9
Accuracy	4.4%
Cost	64

\[x \]

Reproduce

herbie shell --seed 2023263 
(FPCore (x)
  :name "exp2 (problem 3.3.7)"
  :precision binary64

  :herbie-target
  (* 4.0 (pow (sinh (/ x 2.0)) 2.0))

  (+ (- (exp x) 2.0) (exp (- x))))