expq2 (section 3.11)

Percentage Accurate: 38.1% → 100.0%

Time: 17.4s

Alternatives: 10

Speedup: 68.3×

Specification

\[710 > x\]

Math

\[\begin{array}{l} \\ \frac{e^{x}}{e^{x} - 1} \end{array} \]

FPCore

(FPCore (x) :precision binary64 (/ (exp x) (- (exp x) 1.0)))

C

double code(double x) {
	return exp(x) / (exp(x) - 1.0);
}

Fortran

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

Java

public static double code(double x) {
	return Math.exp(x) / (Math.exp(x) - 1.0);
}

Python

def code(x):
	return math.exp(x) / (math.exp(x) - 1.0)

Julia

function code(x)
	return Float64(exp(x) / Float64(exp(x) - 1.0))
end

MATLAB

function tmp = code(x)
	tmp = exp(x) / (exp(x) - 1.0);
end

Wolfram

code[x_] := N[(N[Exp[x], $MachinePrecision] / N[(N[Exp[x], $MachinePrecision] - 1.0), $MachinePrecision]), $MachinePrecision]

Initial Program: 38.1% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{e^{x}}{e^{x} - 1} \end{array} \]

FPCore

(FPCore (x) :precision binary64 (/ (exp x) (- (exp x) 1.0)))

C

double code(double x) {
	return exp(x) / (exp(x) - 1.0);
}

Fortran

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

Java

public static double code(double x) {
	return Math.exp(x) / (Math.exp(x) - 1.0);
}

Python

def code(x):
	return math.exp(x) / (math.exp(x) - 1.0)

Julia

function code(x)
	return Float64(exp(x) / Float64(exp(x) - 1.0))
end

MATLAB

function tmp = code(x)
	tmp = exp(x) / (exp(x) - 1.0);
end

Wolfram

code[x_] := N[(N[Exp[x], $MachinePrecision] / N[(N[Exp[x], $MachinePrecision] - 1.0), $MachinePrecision]), $MachinePrecision]

Alternative 1: 100.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{e^{x}}{\mathsf{expm1}\left(x\right)} \end{array} \]

FPCore

(FPCore (x) :precision binary64 (/ (exp x) (expm1 x)))

C

double code(double x) {
	return exp(x) / expm1(x);
}

Java

public static double code(double x) {
	return Math.exp(x) / Math.expm1(x);
}

Python

def code(x):
	return math.exp(x) / math.expm1(x)

Julia

function code(x)
	return Float64(exp(x) / expm1(x))
end

Wolfram

code[x_] := N[(N[Exp[x], $MachinePrecision] / N[(Exp[x] - 1), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 34.4%

   \[\frac{e^{x}}{e^{x} - 1} \]
2. Step-by-step derivation

   1. expm1-define 100.0%

      \[\leadsto \frac{e^{x}}{\color{blue}{\mathsf{expm1}\left(x\right)}} \]

3. Simplified 100.0%

   \[\leadsto \color{blue}{\frac{e^{x}}{\mathsf{expm1}\left(x\right)}} \]
4. Add Preprocessing
5. Add Preprocessing

Alternative 2: 100.0% accurate, 2.0× speedup

Math

\[\begin{array}{l} \\ \frac{-1}{\mathsf{expm1}\left(-x\right)} \end{array} \]

FPCore

(FPCore (x) :precision binary64 (/ -1.0 (expm1 (- x))))

C

double code(double x) {
	return -1.0 / expm1(-x);
}

Java

public static double code(double x) {
	return -1.0 / Math.expm1(-x);
}

Python

def code(x):
	return -1.0 / math.expm1(-x)

Julia

function code(x)
	return Float64(-1.0 / expm1(Float64(-x)))
end

Wolfram

code[x_] := N[(-1.0 / N[(Exp[(-x)] - 1), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 34.4%

   \[\frac{e^{x}}{e^{x} - 1} \]
2. Step-by-step derivation

   1. sub-neg 34.4%

      \[\leadsto \frac{e^{x}}{\color{blue}{e^{x} + \left(-1\right)}} \]

   2. +-commutative 34.4%

      \[\leadsto \frac{e^{x}}{\color{blue}{\left(-1\right) + e^{x}}} \]

   3. rgt-mult-inverse 2.8%

      \[\leadsto \frac{e^{x}}{\left(-\color{blue}{e^{x} \cdot \frac{1}{e^{x}}}\right) + e^{x}} \]

   4. exp-neg 2.8%

      \[\leadsto \frac{e^{x}}{\left(-e^{x} \cdot \color{blue}{e^{-x}}\right) + e^{x}} \]

   5. distribute-rgt-neg-out 2.8%

      \[\leadsto \frac{e^{x}}{\color{blue}{e^{x} \cdot \left(-e^{-x}\right)} + e^{x}} \]

   6. *-rgt-identity 2.8%

      \[\leadsto \frac{e^{x}}{e^{x} \cdot \left(-e^{-x}\right) + \color{blue}{e^{x} \cdot 1}} \]

   7. distribute-lft-in 2.8%

      \[\leadsto \frac{e^{x}}{\color{blue}{e^{x} \cdot \left(\left(-e^{-x}\right) + 1\right)}} \]

   8. neg-sub0 2.8%

      \[\leadsto \frac{e^{x}}{e^{x} \cdot \left(\color{blue}{\left(0 - e^{-x}\right)} + 1\right)} \]

   9. associate-+l- 2.8%

      \[\leadsto \frac{e^{x}}{e^{x} \cdot \color{blue}{\left(0 - \left(e^{-x} - 1\right)\right)}} \]

   10. neg-sub0 3.0%

       \[\leadsto \frac{e^{x}}{e^{x} \cdot \color{blue}{\left(-\left(e^{-x} - 1\right)\right)}} \]

   11. associate-/r* 3.0%

       \[\leadsto \color{blue}{\frac{\frac{e^{x}}{e^{x}}}{-\left(e^{-x} - 1\right)}} \]

   12. *-rgt-identity 3.0%

       \[\leadsto \frac{\frac{\color{blue}{e^{x} \cdot 1}}{e^{x}}}{-\left(e^{-x} - 1\right)} \]

   13. associate-*r/ 3.0%

       \[\leadsto \frac{\color{blue}{e^{x} \cdot \frac{1}{e^{x}}}}{-\left(e^{-x} - 1\right)} \]

   14. rgt-mult-inverse 34.6%

       \[\leadsto \frac{\color{blue}{1}}{-\left(e^{-x} - 1\right)} \]

   15. distribute-frac-neg2 34.6%

       \[\leadsto \color{blue}{-\frac{1}{e^{-x} - 1}} \]

   16. distribute-neg-frac 34.6%

       \[\leadsto \color{blue}{\frac{-1}{e^{-x} - 1}} \]

   17. metadata-eval 34.6%

       \[\leadsto \frac{\color{blue}{-1}}{e^{-x} - 1} \]

   18. expm1-define 100.0%

       \[\leadsto \frac{-1}{\color{blue}{\mathsf{expm1}\left(-x\right)}} \]

3. Simplified 100.0%

   \[\leadsto \color{blue}{\frac{-1}{\mathsf{expm1}\left(-x\right)}} \]
4. Add Preprocessing
5. Add Preprocessing

Alternative 3: 98.2% accurate, 2.0× speedup

Math

\[\begin{array}{l} \\ \frac{e^{x}}{x} \end{array} \]

FPCore

(FPCore (x) :precision binary64 (/ (exp x) x))

C

double code(double x) {
	return exp(x) / x;
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    code = exp(x) / x
end function

Java

public static double code(double x) {
	return Math.exp(x) / x;
}

Python

def code(x):
	return math.exp(x) / x

Julia

function code(x)
	return Float64(exp(x) / x)
end

MATLAB

function tmp = code(x)
	tmp = exp(x) / x;
end

Wolfram

code[x_] := N[(N[Exp[x], $MachinePrecision] / x), $MachinePrecision]

Derivation

1. Initial program 34.4%

   \[\frac{e^{x}}{e^{x} - 1} \]
2. Step-by-step derivation

   1. expm1-define 100.0%

      \[\leadsto \frac{e^{x}}{\color{blue}{\mathsf{expm1}\left(x\right)}} \]

3. Simplified 100.0%

   \[\leadsto \color{blue}{\frac{e^{x}}{\mathsf{expm1}\left(x\right)}} \]
4. Add Preprocessing

5. Taylor expanded in x around 0 99.3%

   \[\leadsto \frac{e^{x}}{\color{blue}{x}} \]
6. Add Preprocessing

Alternative 4: 91.6% accurate, 12.1× speedup

Math

\[\begin{array}{l} \\ \frac{-1}{x \cdot \left(x \cdot \left(0.5 + x \cdot \left(x \cdot 0.041666666666666664 - 0.16666666666666666\right)\right) + -1\right)} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (/
  -1.0
  (*
   x
   (+
    (* x (+ 0.5 (* x (- (* x 0.041666666666666664) 0.16666666666666666))))
    -1.0))))

C

double code(double x) {
	return -1.0 / (x * ((x * (0.5 + (x * ((x * 0.041666666666666664) - 0.16666666666666666)))) + -1.0));
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    code = (-1.0d0) / (x * ((x * (0.5d0 + (x * ((x * 0.041666666666666664d0) - 0.16666666666666666d0)))) + (-1.0d0)))
end function

Java

public static double code(double x) {
	return -1.0 / (x * ((x * (0.5 + (x * ((x * 0.041666666666666664) - 0.16666666666666666)))) + -1.0));
}

Python

def code(x):
	return -1.0 / (x * ((x * (0.5 + (x * ((x * 0.041666666666666664) - 0.16666666666666666)))) + -1.0))

Julia

function code(x)
	return Float64(-1.0 / Float64(x * Float64(Float64(x * Float64(0.5 + Float64(x * Float64(Float64(x * 0.041666666666666664) - 0.16666666666666666)))) + -1.0)))
end

MATLAB

function tmp = code(x)
	tmp = -1.0 / (x * ((x * (0.5 + (x * ((x * 0.041666666666666664) - 0.16666666666666666)))) + -1.0));
end

Wolfram

code[x_] := N[(-1.0 / N[(x * N[(N[(x * N[(0.5 + N[(x * N[(N[(x * 0.041666666666666664), $MachinePrecision] - 0.16666666666666666), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 34.4%

   \[\frac{e^{x}}{e^{x} - 1} \]
2. Step-by-step derivation

   1. sub-neg 34.4%

      \[\leadsto \frac{e^{x}}{\color{blue}{e^{x} + \left(-1\right)}} \]

   2. +-commutative 34.4%

      \[\leadsto \frac{e^{x}}{\color{blue}{\left(-1\right) + e^{x}}} \]

   3. rgt-mult-inverse 2.8%

      \[\leadsto \frac{e^{x}}{\left(-\color{blue}{e^{x} \cdot \frac{1}{e^{x}}}\right) + e^{x}} \]

   4. exp-neg 2.8%

      \[\leadsto \frac{e^{x}}{\left(-e^{x} \cdot \color{blue}{e^{-x}}\right) + e^{x}} \]

   5. distribute-rgt-neg-out 2.8%

      \[\leadsto \frac{e^{x}}{\color{blue}{e^{x} \cdot \left(-e^{-x}\right)} + e^{x}} \]

   6. *-rgt-identity 2.8%

      \[\leadsto \frac{e^{x}}{e^{x} \cdot \left(-e^{-x}\right) + \color{blue}{e^{x} \cdot 1}} \]

   7. distribute-lft-in 2.8%

      \[\leadsto \frac{e^{x}}{\color{blue}{e^{x} \cdot \left(\left(-e^{-x}\right) + 1\right)}} \]

   8. neg-sub0 2.8%

      \[\leadsto \frac{e^{x}}{e^{x} \cdot \left(\color{blue}{\left(0 - e^{-x}\right)} + 1\right)} \]

   9. associate-+l- 2.8%

      \[\leadsto \frac{e^{x}}{e^{x} \cdot \color{blue}{\left(0 - \left(e^{-x} - 1\right)\right)}} \]

   10. neg-sub0 3.0%

       \[\leadsto \frac{e^{x}}{e^{x} \cdot \color{blue}{\left(-\left(e^{-x} - 1\right)\right)}} \]

   11. associate-/r* 3.0%

       \[\leadsto \color{blue}{\frac{\frac{e^{x}}{e^{x}}}{-\left(e^{-x} - 1\right)}} \]

   12. *-rgt-identity 3.0%

       \[\leadsto \frac{\frac{\color{blue}{e^{x} \cdot 1}}{e^{x}}}{-\left(e^{-x} - 1\right)} \]

   13. associate-*r/ 3.0%

       \[\leadsto \frac{\color{blue}{e^{x} \cdot \frac{1}{e^{x}}}}{-\left(e^{-x} - 1\right)} \]

   14. rgt-mult-inverse 34.6%

       \[\leadsto \frac{\color{blue}{1}}{-\left(e^{-x} - 1\right)} \]

   15. distribute-frac-neg2 34.6%

       \[\leadsto \color{blue}{-\frac{1}{e^{-x} - 1}} \]

   16. distribute-neg-frac 34.6%

       \[\leadsto \color{blue}{\frac{-1}{e^{-x} - 1}} \]

   17. metadata-eval 34.6%

       \[\leadsto \frac{\color{blue}{-1}}{e^{-x} - 1} \]

   18. expm1-define 100.0%

       \[\leadsto \frac{-1}{\color{blue}{\mathsf{expm1}\left(-x\right)}} \]

3. Simplified 100.0%

   \[\leadsto \color{blue}{\frac{-1}{\mathsf{expm1}\left(-x\right)}} \]
4. Add Preprocessing

5. Taylor expanded in x around 0 89.6%

   \[\leadsto \frac{-1}{\color{blue}{x \cdot \left(x \cdot \left(0.5 + x \cdot \left(0.041666666666666664 \cdot x - 0.16666666666666666\right)\right) - 1\right)}} \]

6. Final simplification 89.6%

   \[\leadsto \frac{-1}{x \cdot \left(x \cdot \left(0.5 + x \cdot \left(x \cdot 0.041666666666666664 - 0.16666666666666666\right)\right) + -1\right)} \]
7. Add Preprocessing

Alternative 5: 91.2% accurate, 13.7× speedup

Math

\[\begin{array}{l} \\ \frac{-1}{x \cdot \left(x \cdot \left(0.5 + x \cdot \left(x \cdot 0.041666666666666664\right)\right) + -1\right)} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (/ -1.0 (* x (+ (* x (+ 0.5 (* x (* x 0.041666666666666664)))) -1.0))))

C

double code(double x) {
	return -1.0 / (x * ((x * (0.5 + (x * (x * 0.041666666666666664)))) + -1.0));
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    code = (-1.0d0) / (x * ((x * (0.5d0 + (x * (x * 0.041666666666666664d0)))) + (-1.0d0)))
end function

Java

public static double code(double x) {
	return -1.0 / (x * ((x * (0.5 + (x * (x * 0.041666666666666664)))) + -1.0));
}

Python

def code(x):
	return -1.0 / (x * ((x * (0.5 + (x * (x * 0.041666666666666664)))) + -1.0))

Julia

function code(x)
	return Float64(-1.0 / Float64(x * Float64(Float64(x * Float64(0.5 + Float64(x * Float64(x * 0.041666666666666664)))) + -1.0)))
end

MATLAB

function tmp = code(x)
	tmp = -1.0 / (x * ((x * (0.5 + (x * (x * 0.041666666666666664)))) + -1.0));
end

Wolfram

code[x_] := N[(-1.0 / N[(x * N[(N[(x * N[(0.5 + N[(x * N[(x * 0.041666666666666664), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 34.4%

   \[\frac{e^{x}}{e^{x} - 1} \]
2. Step-by-step derivation

   1. sub-neg 34.4%

      \[\leadsto \frac{e^{x}}{\color{blue}{e^{x} + \left(-1\right)}} \]

   2. +-commutative 34.4%

      \[\leadsto \frac{e^{x}}{\color{blue}{\left(-1\right) + e^{x}}} \]

   3. rgt-mult-inverse 2.8%

      \[\leadsto \frac{e^{x}}{\left(-\color{blue}{e^{x} \cdot \frac{1}{e^{x}}}\right) + e^{x}} \]

   4. exp-neg 2.8%

      \[\leadsto \frac{e^{x}}{\left(-e^{x} \cdot \color{blue}{e^{-x}}\right) + e^{x}} \]

   5. distribute-rgt-neg-out 2.8%

      \[\leadsto \frac{e^{x}}{\color{blue}{e^{x} \cdot \left(-e^{-x}\right)} + e^{x}} \]

   6. *-rgt-identity 2.8%

      \[\leadsto \frac{e^{x}}{e^{x} \cdot \left(-e^{-x}\right) + \color{blue}{e^{x} \cdot 1}} \]

   7. distribute-lft-in 2.8%

      \[\leadsto \frac{e^{x}}{\color{blue}{e^{x} \cdot \left(\left(-e^{-x}\right) + 1\right)}} \]

   8. neg-sub0 2.8%

      \[\leadsto \frac{e^{x}}{e^{x} \cdot \left(\color{blue}{\left(0 - e^{-x}\right)} + 1\right)} \]

   9. associate-+l- 2.8%

      \[\leadsto \frac{e^{x}}{e^{x} \cdot \color{blue}{\left(0 - \left(e^{-x} - 1\right)\right)}} \]

   10. neg-sub0 3.0%

       \[\leadsto \frac{e^{x}}{e^{x} \cdot \color{blue}{\left(-\left(e^{-x} - 1\right)\right)}} \]

   11. associate-/r* 3.0%

       \[\leadsto \color{blue}{\frac{\frac{e^{x}}{e^{x}}}{-\left(e^{-x} - 1\right)}} \]

   12. *-rgt-identity 3.0%

       \[\leadsto \frac{\frac{\color{blue}{e^{x} \cdot 1}}{e^{x}}}{-\left(e^{-x} - 1\right)} \]

   13. associate-*r/ 3.0%

       \[\leadsto \frac{\color{blue}{e^{x} \cdot \frac{1}{e^{x}}}}{-\left(e^{-x} - 1\right)} \]

   14. rgt-mult-inverse 34.6%

       \[\leadsto \frac{\color{blue}{1}}{-\left(e^{-x} - 1\right)} \]

   15. distribute-frac-neg2 34.6%

       \[\leadsto \color{blue}{-\frac{1}{e^{-x} - 1}} \]

   16. distribute-neg-frac 34.6%

       \[\leadsto \color{blue}{\frac{-1}{e^{-x} - 1}} \]

   17. metadata-eval 34.6%

       \[\leadsto \frac{\color{blue}{-1}}{e^{-x} - 1} \]

   18. expm1-define 100.0%

       \[\leadsto \frac{-1}{\color{blue}{\mathsf{expm1}\left(-x\right)}} \]

3. Simplified 100.0%

   \[\leadsto \color{blue}{\frac{-1}{\mathsf{expm1}\left(-x\right)}} \]
4. Add Preprocessing

5. Taylor expanded in x around 0 89.6%

   \[\leadsto \frac{-1}{\color{blue}{x \cdot \left(x \cdot \left(0.5 + x \cdot \left(0.041666666666666664 \cdot x - 0.16666666666666666\right)\right) - 1\right)}} \]

6. Taylor expanded in x around inf 89.5%

   \[\leadsto \frac{-1}{x \cdot \left(x \cdot \left(0.5 + x \cdot \color{blue}{\left(0.041666666666666664 \cdot x\right)}\right) - 1\right)} \]
7. Step-by-step derivation

   1. *-commutative 89.5%

      \[\leadsto \frac{-1}{x \cdot \left(x \cdot \left(0.5 + x \cdot \color{blue}{\left(x \cdot 0.041666666666666664\right)}\right) - 1\right)} \]

8. Simplified 89.5%

   \[\leadsto \frac{-1}{x \cdot \left(x \cdot \left(0.5 + x \cdot \color{blue}{\left(x \cdot 0.041666666666666664\right)}\right) - 1\right)} \]

9. Final simplification 89.5%

   \[\leadsto \frac{-1}{x \cdot \left(x \cdot \left(0.5 + x \cdot \left(x \cdot 0.041666666666666664\right)\right) + -1\right)} \]
10. Add Preprocessing

Alternative 6: 88.9% accurate, 15.8× speedup

Math

\[\begin{array}{l} \\ \frac{-1}{x \cdot \left(x \cdot \left(0.5 + x \cdot -0.16666666666666666\right) + -1\right)} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (/ -1.0 (* x (+ (* x (+ 0.5 (* x -0.16666666666666666))) -1.0))))

C

double code(double x) {
	return -1.0 / (x * ((x * (0.5 + (x * -0.16666666666666666))) + -1.0));
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    code = (-1.0d0) / (x * ((x * (0.5d0 + (x * (-0.16666666666666666d0)))) + (-1.0d0)))
end function

Java

public static double code(double x) {
	return -1.0 / (x * ((x * (0.5 + (x * -0.16666666666666666))) + -1.0));
}

Python

def code(x):
	return -1.0 / (x * ((x * (0.5 + (x * -0.16666666666666666))) + -1.0))

Julia

function code(x)
	return Float64(-1.0 / Float64(x * Float64(Float64(x * Float64(0.5 + Float64(x * -0.16666666666666666))) + -1.0)))
end

MATLAB

function tmp = code(x)
	tmp = -1.0 / (x * ((x * (0.5 + (x * -0.16666666666666666))) + -1.0));
end

Wolfram

code[x_] := N[(-1.0 / N[(x * N[(N[(x * N[(0.5 + N[(x * -0.16666666666666666), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 34.4%

   \[\frac{e^{x}}{e^{x} - 1} \]
2. Step-by-step derivation

   1. sub-neg 34.4%

      \[\leadsto \frac{e^{x}}{\color{blue}{e^{x} + \left(-1\right)}} \]

   2. +-commutative 34.4%

      \[\leadsto \frac{e^{x}}{\color{blue}{\left(-1\right) + e^{x}}} \]

   3. rgt-mult-inverse 2.8%

      \[\leadsto \frac{e^{x}}{\left(-\color{blue}{e^{x} \cdot \frac{1}{e^{x}}}\right) + e^{x}} \]

   4. exp-neg 2.8%

      \[\leadsto \frac{e^{x}}{\left(-e^{x} \cdot \color{blue}{e^{-x}}\right) + e^{x}} \]

   5. distribute-rgt-neg-out 2.8%

      \[\leadsto \frac{e^{x}}{\color{blue}{e^{x} \cdot \left(-e^{-x}\right)} + e^{x}} \]

   6. *-rgt-identity 2.8%

      \[\leadsto \frac{e^{x}}{e^{x} \cdot \left(-e^{-x}\right) + \color{blue}{e^{x} \cdot 1}} \]

   7. distribute-lft-in 2.8%

      \[\leadsto \frac{e^{x}}{\color{blue}{e^{x} \cdot \left(\left(-e^{-x}\right) + 1\right)}} \]

   8. neg-sub0 2.8%

      \[\leadsto \frac{e^{x}}{e^{x} \cdot \left(\color{blue}{\left(0 - e^{-x}\right)} + 1\right)} \]

   9. associate-+l- 2.8%

      \[\leadsto \frac{e^{x}}{e^{x} \cdot \color{blue}{\left(0 - \left(e^{-x} - 1\right)\right)}} \]

   10. neg-sub0 3.0%

       \[\leadsto \frac{e^{x}}{e^{x} \cdot \color{blue}{\left(-\left(e^{-x} - 1\right)\right)}} \]

   11. associate-/r* 3.0%

       \[\leadsto \color{blue}{\frac{\frac{e^{x}}{e^{x}}}{-\left(e^{-x} - 1\right)}} \]

   12. *-rgt-identity 3.0%

       \[\leadsto \frac{\frac{\color{blue}{e^{x} \cdot 1}}{e^{x}}}{-\left(e^{-x} - 1\right)} \]

   13. associate-*r/ 3.0%

       \[\leadsto \frac{\color{blue}{e^{x} \cdot \frac{1}{e^{x}}}}{-\left(e^{-x} - 1\right)} \]

   14. rgt-mult-inverse 34.6%

       \[\leadsto \frac{\color{blue}{1}}{-\left(e^{-x} - 1\right)} \]

   15. distribute-frac-neg2 34.6%

       \[\leadsto \color{blue}{-\frac{1}{e^{-x} - 1}} \]

   16. distribute-neg-frac 34.6%

       \[\leadsto \color{blue}{\frac{-1}{e^{-x} - 1}} \]

   17. metadata-eval 34.6%

       \[\leadsto \frac{\color{blue}{-1}}{e^{-x} - 1} \]

   18. expm1-define 100.0%

       \[\leadsto \frac{-1}{\color{blue}{\mathsf{expm1}\left(-x\right)}} \]

3. Simplified 100.0%

   \[\leadsto \color{blue}{\frac{-1}{\mathsf{expm1}\left(-x\right)}} \]
4. Add Preprocessing

5. Taylor expanded in x around 0 87.3%

   \[\leadsto \frac{-1}{\color{blue}{x \cdot \left(x \cdot \left(0.5 + -0.16666666666666666 \cdot x\right) - 1\right)}} \]

6. Final simplification 87.3%

   \[\leadsto \frac{-1}{x \cdot \left(x \cdot \left(0.5 + x \cdot -0.16666666666666666\right) + -1\right)} \]
7. Add Preprocessing

Alternative 7: 83.4% accurate, 17.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1.8:\\ \;\;\;\;\frac{-1}{x \cdot \left(x \cdot 0.5\right)}\\ \mathbf{else}:\\ \;\;\;\;0.5 + \frac{1}{x}\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (if (<= x -1.8) (/ -1.0 (* x (* x 0.5))) (+ 0.5 (/ 1.0 x))))

C

double code(double x) {
	double tmp;
	if (x <= -1.8) {
		tmp = -1.0 / (x * (x * 0.5));
	} else {
		tmp = 0.5 + (1.0 / x);
	}
	return tmp;
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    real(8) :: tmp
    if (x <= (-1.8d0)) then
        tmp = (-1.0d0) / (x * (x * 0.5d0))
    else
        tmp = 0.5d0 + (1.0d0 / x)
    end if
    code = tmp
end function

Java

public static double code(double x) {
	double tmp;
	if (x <= -1.8) {
		tmp = -1.0 / (x * (x * 0.5));
	} else {
		tmp = 0.5 + (1.0 / x);
	}
	return tmp;
}

Python

def code(x):
	tmp = 0
	if x <= -1.8:
		tmp = -1.0 / (x * (x * 0.5))
	else:
		tmp = 0.5 + (1.0 / x)
	return tmp

Julia

function code(x)
	tmp = 0.0
	if (x <= -1.8)
		tmp = Float64(-1.0 / Float64(x * Float64(x * 0.5)));
	else
		tmp = Float64(0.5 + Float64(1.0 / x));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x)
	tmp = 0.0;
	if (x <= -1.8)
		tmp = -1.0 / (x * (x * 0.5));
	else
		tmp = 0.5 + (1.0 / x);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_] := If[LessEqual[x, -1.8], N[(-1.0 / N[(x * N[(x * 0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(0.5 + N[(1.0 / x), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -1.80000000000000004

   1. Initial program 100.0%

      \[\frac{e^{x}}{e^{x} - 1} \]
   2. Step-by-step derivation

      1. sub-neg 100.0%

         \[\leadsto \frac{e^{x}}{\color{blue}{e^{x} + \left(-1\right)}} \]

      2. +-commutative 100.0%

         \[\leadsto \frac{e^{x}}{\color{blue}{\left(-1\right) + e^{x}}} \]

      3. rgt-mult-inverse 1.2%

         \[\leadsto \frac{e^{x}}{\left(-\color{blue}{e^{x} \cdot \frac{1}{e^{x}}}\right) + e^{x}} \]

      4. exp-neg 1.2%

         \[\leadsto \frac{e^{x}}{\left(-e^{x} \cdot \color{blue}{e^{-x}}\right) + e^{x}} \]

      5. distribute-rgt-neg-out 1.2%

         \[\leadsto \frac{e^{x}}{\color{blue}{e^{x} \cdot \left(-e^{-x}\right)} + e^{x}} \]

      6. *-rgt-identity 1.2%

         \[\leadsto \frac{e^{x}}{e^{x} \cdot \left(-e^{-x}\right) + \color{blue}{e^{x} \cdot 1}} \]

      7. distribute-lft-in 1.2%

         \[\leadsto \frac{e^{x}}{\color{blue}{e^{x} \cdot \left(\left(-e^{-x}\right) + 1\right)}} \]

      8. neg-sub0 1.2%

         \[\leadsto \frac{e^{x}}{e^{x} \cdot \left(\color{blue}{\left(0 - e^{-x}\right)} + 1\right)} \]

      9. associate-+l- 1.2%

         \[\leadsto \frac{e^{x}}{e^{x} \cdot \color{blue}{\left(0 - \left(e^{-x} - 1\right)\right)}} \]

      10. neg-sub0 1.2%

          \[\leadsto \frac{e^{x}}{e^{x} \cdot \color{blue}{\left(-\left(e^{-x} - 1\right)\right)}} \]

      11. associate-/r* 1.2%

          \[\leadsto \color{blue}{\frac{\frac{e^{x}}{e^{x}}}{-\left(e^{-x} - 1\right)}} \]

      12. *-rgt-identity 1.2%

          \[\leadsto \frac{\frac{\color{blue}{e^{x} \cdot 1}}{e^{x}}}{-\left(e^{-x} - 1\right)} \]

      13. associate-*r/ 1.2%

          \[\leadsto \frac{\color{blue}{e^{x} \cdot \frac{1}{e^{x}}}}{-\left(e^{-x} - 1\right)} \]

      14. rgt-mult-inverse 100.0%

          \[\leadsto \frac{\color{blue}{1}}{-\left(e^{-x} - 1\right)} \]

      15. distribute-frac-neg2 100.0%

          \[\leadsto \color{blue}{-\frac{1}{e^{-x} - 1}} \]

      16. distribute-neg-frac 100.0%

          \[\leadsto \color{blue}{\frac{-1}{e^{-x} - 1}} \]

      17. metadata-eval 100.0%

          \[\leadsto \frac{\color{blue}{-1}}{e^{-x} - 1} \]

      18. expm1-define 100.0%

          \[\leadsto \frac{-1}{\color{blue}{\mathsf{expm1}\left(-x\right)}} \]

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\frac{-1}{\mathsf{expm1}\left(-x\right)}} \]
   4. Add Preprocessing

   5. Taylor expanded in x around 0 50.2%

      \[\leadsto \frac{-1}{\color{blue}{x \cdot \left(0.5 \cdot x - 1\right)}} \]

   6. Taylor expanded in x around inf 50.2%

      \[\leadsto \frac{-1}{x \cdot \color{blue}{\left(0.5 \cdot x\right)}} \]
   7. Step-by-step derivation

      1. *-commutative 50.2%

         \[\leadsto \frac{-1}{x \cdot \color{blue}{\left(x \cdot 0.5\right)}} \]

   8. Simplified 50.2%

      \[\leadsto \frac{-1}{x \cdot \color{blue}{\left(x \cdot 0.5\right)}} \]

   if -1.80000000000000004 < x

   1. Initial program 3.5%

      \[\frac{e^{x}}{e^{x} - 1} \]
   2. Step-by-step derivation

      1. sub-neg 3.5%

         \[\leadsto \frac{e^{x}}{\color{blue}{e^{x} + \left(-1\right)}} \]

      2. +-commutative 3.5%

         \[\leadsto \frac{e^{x}}{\color{blue}{\left(-1\right) + e^{x}}} \]

      3. rgt-mult-inverse 3.5%

         \[\leadsto \frac{e^{x}}{\left(-\color{blue}{e^{x} \cdot \frac{1}{e^{x}}}\right) + e^{x}} \]

      4. exp-neg 3.5%

         \[\leadsto \frac{e^{x}}{\left(-e^{x} \cdot \color{blue}{e^{-x}}\right) + e^{x}} \]

      5. distribute-rgt-neg-out 3.5%

         \[\leadsto \frac{e^{x}}{\color{blue}{e^{x} \cdot \left(-e^{-x}\right)} + e^{x}} \]

      6. *-rgt-identity 3.5%

         \[\leadsto \frac{e^{x}}{e^{x} \cdot \left(-e^{-x}\right) + \color{blue}{e^{x} \cdot 1}} \]

      7. distribute-lft-in 3.5%

         \[\leadsto \frac{e^{x}}{\color{blue}{e^{x} \cdot \left(\left(-e^{-x}\right) + 1\right)}} \]

      8. neg-sub0 3.5%

         \[\leadsto \frac{e^{x}}{e^{x} \cdot \left(\color{blue}{\left(0 - e^{-x}\right)} + 1\right)} \]

      9. associate-+l- 3.5%

         \[\leadsto \frac{e^{x}}{e^{x} \cdot \color{blue}{\left(0 - \left(e^{-x} - 1\right)\right)}} \]

      10. neg-sub0 3.8%

          \[\leadsto \frac{e^{x}}{e^{x} \cdot \color{blue}{\left(-\left(e^{-x} - 1\right)\right)}} \]

      11. associate-/r* 3.8%

          \[\leadsto \color{blue}{\frac{\frac{e^{x}}{e^{x}}}{-\left(e^{-x} - 1\right)}} \]

      12. *-rgt-identity 3.8%

          \[\leadsto \frac{\frac{\color{blue}{e^{x} \cdot 1}}{e^{x}}}{-\left(e^{-x} - 1\right)} \]

      13. associate-*r/ 3.8%

          \[\leadsto \frac{\color{blue}{e^{x} \cdot \frac{1}{e^{x}}}}{-\left(e^{-x} - 1\right)} \]

      14. rgt-mult-inverse 3.8%

          \[\leadsto \frac{\color{blue}{1}}{-\left(e^{-x} - 1\right)} \]

      15. distribute-frac-neg2 3.8%

          \[\leadsto \color{blue}{-\frac{1}{e^{-x} - 1}} \]

      16. distribute-neg-frac 3.8%

          \[\leadsto \color{blue}{\frac{-1}{e^{-x} - 1}} \]

      17. metadata-eval 3.8%

          \[\leadsto \frac{\color{blue}{-1}}{e^{-x} - 1} \]

      18. expm1-define 100.0%

          \[\leadsto \frac{-1}{\color{blue}{\mathsf{expm1}\left(-x\right)}} \]

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\frac{-1}{\mathsf{expm1}\left(-x\right)}} \]
   4. Add Preprocessing

   5. Taylor expanded in x around 0 99.7%

      \[\leadsto \color{blue}{\frac{1 + 0.5 \cdot x}{x}} \]
   6. Step-by-step derivation

      1. *-commutative 99.7%

         \[\leadsto \frac{1 + \color{blue}{x \cdot 0.5}}{x} \]

   7. Simplified 99.7%

      \[\leadsto \color{blue}{\frac{1 + x \cdot 0.5}{x}} \]

   8. Taylor expanded in x around inf 99.7%

      \[\leadsto \color{blue}{0.5 + \frac{1}{x}} \]
   9. Step-by-step derivation

      1. +-commutative 99.7%

         \[\leadsto \color{blue}{\frac{1}{x} + 0.5} \]

   10. Simplified 99.7%

       \[\leadsto \color{blue}{\frac{1}{x} + 0.5} \]
3. Recombined 2 regimes into one program.

4. Final simplification 83.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -1.8:\\ \;\;\;\;\frac{-1}{x \cdot \left(x \cdot 0.5\right)}\\ \mathbf{else}:\\ \;\;\;\;0.5 + \frac{1}{x}\\ \end{array} \]
5. Add Preprocessing

Alternative 8: 88.0% accurate, 18.6× speedup

Math

\[\begin{array}{l} \\ \frac{-1}{x \cdot \left(x \cdot \left(x \cdot -0.16666666666666666\right) + -1\right)} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (/ -1.0 (* x (+ (* x (* x -0.16666666666666666)) -1.0))))

C

double code(double x) {
	return -1.0 / (x * ((x * (x * -0.16666666666666666)) + -1.0));
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    code = (-1.0d0) / (x * ((x * (x * (-0.16666666666666666d0))) + (-1.0d0)))
end function

Java

public static double code(double x) {
	return -1.0 / (x * ((x * (x * -0.16666666666666666)) + -1.0));
}

Python

def code(x):
	return -1.0 / (x * ((x * (x * -0.16666666666666666)) + -1.0))

Julia

function code(x)
	return Float64(-1.0 / Float64(x * Float64(Float64(x * Float64(x * -0.16666666666666666)) + -1.0)))
end

MATLAB

function tmp = code(x)
	tmp = -1.0 / (x * ((x * (x * -0.16666666666666666)) + -1.0));
end

Wolfram

code[x_] := N[(-1.0 / N[(x * N[(N[(x * N[(x * -0.16666666666666666), $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 34.4%

   \[\frac{e^{x}}{e^{x} - 1} \]
2. Step-by-step derivation

   1. sub-neg 34.4%

      \[\leadsto \frac{e^{x}}{\color{blue}{e^{x} + \left(-1\right)}} \]

   2. +-commutative 34.4%

      \[\leadsto \frac{e^{x}}{\color{blue}{\left(-1\right) + e^{x}}} \]

   3. rgt-mult-inverse 2.8%

      \[\leadsto \frac{e^{x}}{\left(-\color{blue}{e^{x} \cdot \frac{1}{e^{x}}}\right) + e^{x}} \]

   4. exp-neg 2.8%

      \[\leadsto \frac{e^{x}}{\left(-e^{x} \cdot \color{blue}{e^{-x}}\right) + e^{x}} \]

   5. distribute-rgt-neg-out 2.8%

      \[\leadsto \frac{e^{x}}{\color{blue}{e^{x} \cdot \left(-e^{-x}\right)} + e^{x}} \]

   6. *-rgt-identity 2.8%

      \[\leadsto \frac{e^{x}}{e^{x} \cdot \left(-e^{-x}\right) + \color{blue}{e^{x} \cdot 1}} \]

   7. distribute-lft-in 2.8%

      \[\leadsto \frac{e^{x}}{\color{blue}{e^{x} \cdot \left(\left(-e^{-x}\right) + 1\right)}} \]

   8. neg-sub0 2.8%

      \[\leadsto \frac{e^{x}}{e^{x} \cdot \left(\color{blue}{\left(0 - e^{-x}\right)} + 1\right)} \]

   9. associate-+l- 2.8%

      \[\leadsto \frac{e^{x}}{e^{x} \cdot \color{blue}{\left(0 - \left(e^{-x} - 1\right)\right)}} \]

   10. neg-sub0 3.0%

       \[\leadsto \frac{e^{x}}{e^{x} \cdot \color{blue}{\left(-\left(e^{-x} - 1\right)\right)}} \]

   11. associate-/r* 3.0%

       \[\leadsto \color{blue}{\frac{\frac{e^{x}}{e^{x}}}{-\left(e^{-x} - 1\right)}} \]

   12. *-rgt-identity 3.0%

       \[\leadsto \frac{\frac{\color{blue}{e^{x} \cdot 1}}{e^{x}}}{-\left(e^{-x} - 1\right)} \]

   13. associate-*r/ 3.0%

       \[\leadsto \frac{\color{blue}{e^{x} \cdot \frac{1}{e^{x}}}}{-\left(e^{-x} - 1\right)} \]

   14. rgt-mult-inverse 34.6%

       \[\leadsto \frac{\color{blue}{1}}{-\left(e^{-x} - 1\right)} \]

   15. distribute-frac-neg2 34.6%

       \[\leadsto \color{blue}{-\frac{1}{e^{-x} - 1}} \]

   16. distribute-neg-frac 34.6%

       \[\leadsto \color{blue}{\frac{-1}{e^{-x} - 1}} \]

   17. metadata-eval 34.6%

       \[\leadsto \frac{\color{blue}{-1}}{e^{-x} - 1} \]

   18. expm1-define 100.0%

       \[\leadsto \frac{-1}{\color{blue}{\mathsf{expm1}\left(-x\right)}} \]

3. Simplified 100.0%

   \[\leadsto \color{blue}{\frac{-1}{\mathsf{expm1}\left(-x\right)}} \]
4. Add Preprocessing

5. Taylor expanded in x around 0 87.3%

   \[\leadsto \frac{-1}{\color{blue}{x \cdot \left(x \cdot \left(0.5 + -0.16666666666666666 \cdot x\right) - 1\right)}} \]

6. Taylor expanded in x around inf 87.1%

   \[\leadsto \frac{-1}{x \cdot \left(x \cdot \color{blue}{\left(-0.16666666666666666 \cdot x\right)} - 1\right)} \]
7. Step-by-step derivation

   1. *-commutative 87.1%

      \[\leadsto \frac{-1}{x \cdot \left(x \cdot \color{blue}{\left(x \cdot -0.16666666666666666\right)} - 1\right)} \]

8. Simplified 87.1%

   \[\leadsto \frac{-1}{x \cdot \left(x \cdot \color{blue}{\left(x \cdot -0.16666666666666666\right)} - 1\right)} \]

9. Final simplification 87.1%

   \[\leadsto \frac{-1}{x \cdot \left(x \cdot \left(x \cdot -0.16666666666666666\right) + -1\right)} \]
10. Add Preprocessing

Alternative 9: 83.4% accurate, 22.8× speedup

Math

\[\begin{array}{l} \\ \frac{-1}{x \cdot \left(x \cdot 0.5 + -1\right)} \end{array} \]

FPCore

(FPCore (x) :precision binary64 (/ -1.0 (* x (+ (* x 0.5) -1.0))))

C

double code(double x) {
	return -1.0 / (x * ((x * 0.5) + -1.0));
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    code = (-1.0d0) / (x * ((x * 0.5d0) + (-1.0d0)))
end function

Java

public static double code(double x) {
	return -1.0 / (x * ((x * 0.5) + -1.0));
}

Python

def code(x):
	return -1.0 / (x * ((x * 0.5) + -1.0))

Julia

function code(x)
	return Float64(-1.0 / Float64(x * Float64(Float64(x * 0.5) + -1.0)))
end

MATLAB

function tmp = code(x)
	tmp = -1.0 / (x * ((x * 0.5) + -1.0));
end

Wolfram

code[x_] := N[(-1.0 / N[(x * N[(N[(x * 0.5), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 34.4%

   \[\frac{e^{x}}{e^{x} - 1} \]
2. Step-by-step derivation

   1. sub-neg 34.4%

      \[\leadsto \frac{e^{x}}{\color{blue}{e^{x} + \left(-1\right)}} \]

   2. +-commutative 34.4%

      \[\leadsto \frac{e^{x}}{\color{blue}{\left(-1\right) + e^{x}}} \]

   3. rgt-mult-inverse 2.8%

      \[\leadsto \frac{e^{x}}{\left(-\color{blue}{e^{x} \cdot \frac{1}{e^{x}}}\right) + e^{x}} \]

   4. exp-neg 2.8%

      \[\leadsto \frac{e^{x}}{\left(-e^{x} \cdot \color{blue}{e^{-x}}\right) + e^{x}} \]

   5. distribute-rgt-neg-out 2.8%

      \[\leadsto \frac{e^{x}}{\color{blue}{e^{x} \cdot \left(-e^{-x}\right)} + e^{x}} \]

   6. *-rgt-identity 2.8%

      \[\leadsto \frac{e^{x}}{e^{x} \cdot \left(-e^{-x}\right) + \color{blue}{e^{x} \cdot 1}} \]

   7. distribute-lft-in 2.8%

      \[\leadsto \frac{e^{x}}{\color{blue}{e^{x} \cdot \left(\left(-e^{-x}\right) + 1\right)}} \]

   8. neg-sub0 2.8%

      \[\leadsto \frac{e^{x}}{e^{x} \cdot \left(\color{blue}{\left(0 - e^{-x}\right)} + 1\right)} \]

   9. associate-+l- 2.8%

      \[\leadsto \frac{e^{x}}{e^{x} \cdot \color{blue}{\left(0 - \left(e^{-x} - 1\right)\right)}} \]

   10. neg-sub0 3.0%

       \[\leadsto \frac{e^{x}}{e^{x} \cdot \color{blue}{\left(-\left(e^{-x} - 1\right)\right)}} \]

   11. associate-/r* 3.0%

       \[\leadsto \color{blue}{\frac{\frac{e^{x}}{e^{x}}}{-\left(e^{-x} - 1\right)}} \]

   12. *-rgt-identity 3.0%

       \[\leadsto \frac{\frac{\color{blue}{e^{x} \cdot 1}}{e^{x}}}{-\left(e^{-x} - 1\right)} \]

   13. associate-*r/ 3.0%

       \[\leadsto \frac{\color{blue}{e^{x} \cdot \frac{1}{e^{x}}}}{-\left(e^{-x} - 1\right)} \]

   14. rgt-mult-inverse 34.6%

       \[\leadsto \frac{\color{blue}{1}}{-\left(e^{-x} - 1\right)} \]

   15. distribute-frac-neg2 34.6%

       \[\leadsto \color{blue}{-\frac{1}{e^{-x} - 1}} \]

   16. distribute-neg-frac 34.6%

       \[\leadsto \color{blue}{\frac{-1}{e^{-x} - 1}} \]

   17. metadata-eval 34.6%

       \[\leadsto \frac{\color{blue}{-1}}{e^{-x} - 1} \]

   18. expm1-define 100.0%

       \[\leadsto \frac{-1}{\color{blue}{\mathsf{expm1}\left(-x\right)}} \]

3. Simplified 100.0%

   \[\leadsto \color{blue}{\frac{-1}{\mathsf{expm1}\left(-x\right)}} \]
4. Add Preprocessing

5. Taylor expanded in x around 0 83.8%

   \[\leadsto \frac{-1}{\color{blue}{x \cdot \left(0.5 \cdot x - 1\right)}} \]

6. Final simplification 83.8%

   \[\leadsto \frac{-1}{x \cdot \left(x \cdot 0.5 + -1\right)} \]
7. Add Preprocessing

Alternative 10: 66.3% accurate, 68.3× speedup

Math

\[\begin{array}{l} \\ \frac{1}{x} \end{array} \]

FPCore

(FPCore (x) :precision binary64 (/ 1.0 x))

C

double code(double x) {
	return 1.0 / x;
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    code = 1.0d0 / x
end function

Java

public static double code(double x) {
	return 1.0 / x;
}

Python

def code(x):
	return 1.0 / x

Julia

function code(x)
	return Float64(1.0 / x)
end

MATLAB

function tmp = code(x)
	tmp = 1.0 / x;
end

Wolfram

code[x_] := N[(1.0 / x), $MachinePrecision]

Derivation

1. Initial program 34.4%

   \[\frac{e^{x}}{e^{x} - 1} \]
2. Step-by-step derivation

   1. sub-neg 34.4%

      \[\leadsto \frac{e^{x}}{\color{blue}{e^{x} + \left(-1\right)}} \]

   2. +-commutative 34.4%

      \[\leadsto \frac{e^{x}}{\color{blue}{\left(-1\right) + e^{x}}} \]

   3. rgt-mult-inverse 2.8%

      \[\leadsto \frac{e^{x}}{\left(-\color{blue}{e^{x} \cdot \frac{1}{e^{x}}}\right) + e^{x}} \]

   4. exp-neg 2.8%

      \[\leadsto \frac{e^{x}}{\left(-e^{x} \cdot \color{blue}{e^{-x}}\right) + e^{x}} \]

   5. distribute-rgt-neg-out 2.8%

      \[\leadsto \frac{e^{x}}{\color{blue}{e^{x} \cdot \left(-e^{-x}\right)} + e^{x}} \]

   6. *-rgt-identity 2.8%

      \[\leadsto \frac{e^{x}}{e^{x} \cdot \left(-e^{-x}\right) + \color{blue}{e^{x} \cdot 1}} \]

   7. distribute-lft-in 2.8%

      \[\leadsto \frac{e^{x}}{\color{blue}{e^{x} \cdot \left(\left(-e^{-x}\right) + 1\right)}} \]

   8. neg-sub0 2.8%

      \[\leadsto \frac{e^{x}}{e^{x} \cdot \left(\color{blue}{\left(0 - e^{-x}\right)} + 1\right)} \]

   9. associate-+l- 2.8%

      \[\leadsto \frac{e^{x}}{e^{x} \cdot \color{blue}{\left(0 - \left(e^{-x} - 1\right)\right)}} \]

   10. neg-sub0 3.0%

       \[\leadsto \frac{e^{x}}{e^{x} \cdot \color{blue}{\left(-\left(e^{-x} - 1\right)\right)}} \]

   11. associate-/r* 3.0%

       \[\leadsto \color{blue}{\frac{\frac{e^{x}}{e^{x}}}{-\left(e^{-x} - 1\right)}} \]

   12. *-rgt-identity 3.0%

       \[\leadsto \frac{\frac{\color{blue}{e^{x} \cdot 1}}{e^{x}}}{-\left(e^{-x} - 1\right)} \]

   13. associate-*r/ 3.0%

       \[\leadsto \frac{\color{blue}{e^{x} \cdot \frac{1}{e^{x}}}}{-\left(e^{-x} - 1\right)} \]

   14. rgt-mult-inverse 34.6%

       \[\leadsto \frac{\color{blue}{1}}{-\left(e^{-x} - 1\right)} \]

   15. distribute-frac-neg2 34.6%

       \[\leadsto \color{blue}{-\frac{1}{e^{-x} - 1}} \]

   16. distribute-neg-frac 34.6%

       \[\leadsto \color{blue}{\frac{-1}{e^{-x} - 1}} \]

   17. metadata-eval 34.6%

       \[\leadsto \frac{\color{blue}{-1}}{e^{-x} - 1} \]

   18. expm1-define 100.0%

       \[\leadsto \frac{-1}{\color{blue}{\mathsf{expm1}\left(-x\right)}} \]

3. Simplified 100.0%

   \[\leadsto \color{blue}{\frac{-1}{\mathsf{expm1}\left(-x\right)}} \]
4. Add Preprocessing

5. Taylor expanded in x around 0 69.3%

   \[\leadsto \color{blue}{\frac{1}{x}} \]
6. Add Preprocessing

Developer Target 1: 100.0% accurate, 2.0× speedup

Math

\[\begin{array}{l} \\ \frac{-1}{\mathsf{expm1}\left(-x\right)} \end{array} \]

FPCore

(FPCore (x) :precision binary64 (/ (- 1.0) (expm1 (- x))))

C

double code(double x) {
	return -1.0 / expm1(-x);
}

Java

public static double code(double x) {
	return -1.0 / Math.expm1(-x);
}

Python

def code(x):
	return -1.0 / math.expm1(-x)

Julia

function code(x)
	return Float64(Float64(-1.0) / expm1(Float64(-x)))
end

Wolfram

code[x_] := N[((-1.0) / N[(Exp[(-x)] - 1), $MachinePrecision]), $MachinePrecision]

Reproduce

herbie shell --seed 2024143 
(FPCore (x)
  :name "expq2 (section 3.11)"
  :precision binary64
  :pre (> 710.0 x)

  :alt
  (! :herbie-platform default (/ (- 1) (expm1 (- x))))

  (/ (exp x) (- (exp x) 1.0)))