Hyperbolic tangent

Percentage Accurate: 9.3% → 100.0%
Time: 11.6s
Alternatives: 6
Speedup: 409.0×

Specification

?
\[\begin{array}{l} \\ \begin{array}{l} t_0 := e^{-x}\\ \frac{e^{x} - t\_0}{e^{x} + t\_0} \end{array} \end{array} \]
(FPCore (x)
 :precision binary64
 (let* ((t_0 (exp (- x)))) (/ (- (exp x) t_0) (+ (exp x) t_0))))
double code(double x) {
	double t_0 = exp(-x);
	return (exp(x) - t_0) / (exp(x) + t_0);
}
real(8) function code(x)
    real(8), intent (in) :: x
    real(8) :: t_0
    t_0 = exp(-x)
    code = (exp(x) - t_0) / (exp(x) + t_0)
end function
public static double code(double x) {
	double t_0 = Math.exp(-x);
	return (Math.exp(x) - t_0) / (Math.exp(x) + t_0);
}
def code(x):
	t_0 = math.exp(-x)
	return (math.exp(x) - t_0) / (math.exp(x) + t_0)
function code(x)
	t_0 = exp(Float64(-x))
	return Float64(Float64(exp(x) - t_0) / Float64(exp(x) + t_0))
end
function tmp = code(x)
	t_0 = exp(-x);
	tmp = (exp(x) - t_0) / (exp(x) + t_0);
end
code[x_] := Block[{t$95$0 = N[Exp[(-x)], $MachinePrecision]}, N[(N[(N[Exp[x], $MachinePrecision] - t$95$0), $MachinePrecision] / N[(N[Exp[x], $MachinePrecision] + t$95$0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}

\\
\begin{array}{l}
t_0 := e^{-x}\\
\frac{e^{x} - t\_0}{e^{x} + t\_0}
\end{array}
\end{array}

Sampling outcomes in binary64 precision:

Local Percentage Accuracy vs ?

The average percentage accuracy by input value. Horizontal axis shows value of an input variable; the variable is choosen in the title. Vertical axis is accuracy; higher is better. Red represent the original program, while blue represents Herbie's suggestion. These can be toggled with buttons below the plot. The line is an average while dots represent individual samples.

Accuracy vs Speed?

Herbie found 6 alternatives:

AlternativeAccuracySpeedup
The accuracy (vertical axis) and speed (horizontal axis) of each alternatives. Up and to the right is better. The red square shows the initial program, and each blue circle shows an alternative.The line shows the best available speed-accuracy tradeoffs.

Initial Program: 9.3% accurate, 1.0× speedup?

\[\begin{array}{l} \\ \begin{array}{l} t_0 := e^{-x}\\ \frac{e^{x} - t\_0}{e^{x} + t\_0} \end{array} \end{array} \]
(FPCore (x)
 :precision binary64
 (let* ((t_0 (exp (- x)))) (/ (- (exp x) t_0) (+ (exp x) t_0))))
double code(double x) {
	double t_0 = exp(-x);
	return (exp(x) - t_0) / (exp(x) + t_0);
}
real(8) function code(x)
    real(8), intent (in) :: x
    real(8) :: t_0
    t_0 = exp(-x)
    code = (exp(x) - t_0) / (exp(x) + t_0)
end function
public static double code(double x) {
	double t_0 = Math.exp(-x);
	return (Math.exp(x) - t_0) / (Math.exp(x) + t_0);
}
def code(x):
	t_0 = math.exp(-x)
	return (math.exp(x) - t_0) / (math.exp(x) + t_0)
function code(x)
	t_0 = exp(Float64(-x))
	return Float64(Float64(exp(x) - t_0) / Float64(exp(x) + t_0))
end
function tmp = code(x)
	t_0 = exp(-x);
	tmp = (exp(x) - t_0) / (exp(x) + t_0);
end
code[x_] := Block[{t$95$0 = N[Exp[(-x)], $MachinePrecision]}, N[(N[(N[Exp[x], $MachinePrecision] - t$95$0), $MachinePrecision] / N[(N[Exp[x], $MachinePrecision] + t$95$0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}

\\
\begin{array}{l}
t_0 := e^{-x}\\
\frac{e^{x} - t\_0}{e^{x} + t\_0}
\end{array}
\end{array}

Alternative 1: 100.0% accurate, 4.0× speedup?

\[\begin{array}{l} \\ \tanh x \end{array} \]
(FPCore (x) :precision binary64 (tanh x))
double code(double x) {
	return tanh(x);
}
real(8) function code(x)
    real(8), intent (in) :: x
    code = tanh(x)
end function
public static double code(double x) {
	return Math.tanh(x);
}
def code(x):
	return math.tanh(x)
function code(x)
	return tanh(x)
end
function tmp = code(x)
	tmp = tanh(x);
end
code[x_] := N[Tanh[x], $MachinePrecision]
\begin{array}{l}

\\
\tanh x
\end{array}
Derivation
  1. Initial program 12.6%

    \[\frac{e^{x} - e^{-x}}{e^{x} + e^{-x}} \]
  2. Add Preprocessing
  3. Step-by-step derivation
    1. tanh-undefN/A

      \[\leadsto \tanh x \]
    2. tanh-lowering-tanh.f64100.0%

      \[\leadsto \mathsf{tanh.f64}\left(x\right) \]
  4. Applied egg-rr100.0%

    \[\leadsto \color{blue}{\tanh x} \]
  5. Add Preprocessing

Alternative 2: 97.0% accurate, 27.3× speedup?

\[\begin{array}{l} \\ x + \left(-0.3333333333333333 + \left(x \cdot x\right) \cdot 0.13333333333333333\right) \cdot \left(x \cdot \left(x \cdot x\right)\right) \end{array} \]
(FPCore (x)
 :precision binary64
 (+
  x
  (* (+ -0.3333333333333333 (* (* x x) 0.13333333333333333)) (* x (* x x)))))
double code(double x) {
	return x + ((-0.3333333333333333 + ((x * x) * 0.13333333333333333)) * (x * (x * x)));
}
real(8) function code(x)
    real(8), intent (in) :: x
    code = x + (((-0.3333333333333333d0) + ((x * x) * 0.13333333333333333d0)) * (x * (x * x)))
end function
public static double code(double x) {
	return x + ((-0.3333333333333333 + ((x * x) * 0.13333333333333333)) * (x * (x * x)));
}
def code(x):
	return x + ((-0.3333333333333333 + ((x * x) * 0.13333333333333333)) * (x * (x * x)))
function code(x)
	return Float64(x + Float64(Float64(-0.3333333333333333 + Float64(Float64(x * x) * 0.13333333333333333)) * Float64(x * Float64(x * x))))
end
function tmp = code(x)
	tmp = x + ((-0.3333333333333333 + ((x * x) * 0.13333333333333333)) * (x * (x * x)));
end
code[x_] := N[(x + N[(N[(-0.3333333333333333 + N[(N[(x * x), $MachinePrecision] * 0.13333333333333333), $MachinePrecision]), $MachinePrecision] * N[(x * N[(x * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}

\\
x + \left(-0.3333333333333333 + \left(x \cdot x\right) \cdot 0.13333333333333333\right) \cdot \left(x \cdot \left(x \cdot x\right)\right)
\end{array}
Derivation
  1. Initial program 12.6%

    \[\frac{e^{x} - e^{-x}}{e^{x} + e^{-x}} \]
  2. Step-by-step derivation
    1. div-subN/A

      \[\leadsto \frac{e^{x}}{e^{x} + e^{\mathsf{neg}\left(x\right)}} - \color{blue}{\frac{e^{\mathsf{neg}\left(x\right)}}{e^{x} + e^{\mathsf{neg}\left(x\right)}}} \]
    2. sub-negN/A

      \[\leadsto \frac{e^{x}}{e^{x} + e^{\mathsf{neg}\left(x\right)}} + \color{blue}{\left(\mathsf{neg}\left(\frac{e^{\mathsf{neg}\left(x\right)}}{e^{x} + e^{\mathsf{neg}\left(x\right)}}\right)\right)} \]
    3. +-lowering-+.f64N/A

      \[\leadsto \mathsf{+.f64}\left(\left(\frac{e^{x}}{e^{x} + e^{\mathsf{neg}\left(x\right)}}\right), \color{blue}{\left(\mathsf{neg}\left(\frac{e^{\mathsf{neg}\left(x\right)}}{e^{x} + e^{\mathsf{neg}\left(x\right)}}\right)\right)}\right) \]
  3. Simplified12.9%

    \[\leadsto \color{blue}{\frac{1}{1 + e^{x \cdot -2}} + \frac{1}{-1 - e^{x \cdot 2}}} \]
  4. Add Preprocessing
  5. Taylor expanded in x around 0

    \[\leadsto \color{blue}{x \cdot \left(1 + {x}^{2} \cdot \left(\frac{2}{15} \cdot {x}^{2} - \frac{1}{3}\right)\right)} \]
  6. Step-by-step derivation
    1. *-lowering-*.f64N/A

      \[\leadsto \mathsf{*.f64}\left(x, \color{blue}{\left(1 + {x}^{2} \cdot \left(\frac{2}{15} \cdot {x}^{2} - \frac{1}{3}\right)\right)}\right) \]
    2. +-lowering-+.f64N/A

      \[\leadsto \mathsf{*.f64}\left(x, \mathsf{+.f64}\left(1, \color{blue}{\left({x}^{2} \cdot \left(\frac{2}{15} \cdot {x}^{2} - \frac{1}{3}\right)\right)}\right)\right) \]
    3. *-lowering-*.f64N/A

      \[\leadsto \mathsf{*.f64}\left(x, \mathsf{+.f64}\left(1, \mathsf{*.f64}\left(\left({x}^{2}\right), \color{blue}{\left(\frac{2}{15} \cdot {x}^{2} - \frac{1}{3}\right)}\right)\right)\right) \]
    4. unpow2N/A

      \[\leadsto \mathsf{*.f64}\left(x, \mathsf{+.f64}\left(1, \mathsf{*.f64}\left(\left(x \cdot x\right), \left(\color{blue}{\frac{2}{15} \cdot {x}^{2}} - \frac{1}{3}\right)\right)\right)\right) \]
    5. *-lowering-*.f64N/A

      \[\leadsto \mathsf{*.f64}\left(x, \mathsf{+.f64}\left(1, \mathsf{*.f64}\left(\mathsf{*.f64}\left(x, x\right), \left(\color{blue}{\frac{2}{15} \cdot {x}^{2}} - \frac{1}{3}\right)\right)\right)\right) \]
    6. sub-negN/A

      \[\leadsto \mathsf{*.f64}\left(x, \mathsf{+.f64}\left(1, \mathsf{*.f64}\left(\mathsf{*.f64}\left(x, x\right), \left(\frac{2}{15} \cdot {x}^{2} + \color{blue}{\left(\mathsf{neg}\left(\frac{1}{3}\right)\right)}\right)\right)\right)\right) \]
    7. metadata-evalN/A

      \[\leadsto \mathsf{*.f64}\left(x, \mathsf{+.f64}\left(1, \mathsf{*.f64}\left(\mathsf{*.f64}\left(x, x\right), \left(\frac{2}{15} \cdot {x}^{2} + \frac{-1}{3}\right)\right)\right)\right) \]
    8. +-commutativeN/A

      \[\leadsto \mathsf{*.f64}\left(x, \mathsf{+.f64}\left(1, \mathsf{*.f64}\left(\mathsf{*.f64}\left(x, x\right), \left(\frac{-1}{3} + \color{blue}{\frac{2}{15} \cdot {x}^{2}}\right)\right)\right)\right) \]
    9. +-lowering-+.f64N/A

      \[\leadsto \mathsf{*.f64}\left(x, \mathsf{+.f64}\left(1, \mathsf{*.f64}\left(\mathsf{*.f64}\left(x, x\right), \mathsf{+.f64}\left(\frac{-1}{3}, \color{blue}{\left(\frac{2}{15} \cdot {x}^{2}\right)}\right)\right)\right)\right) \]
    10. *-commutativeN/A

      \[\leadsto \mathsf{*.f64}\left(x, \mathsf{+.f64}\left(1, \mathsf{*.f64}\left(\mathsf{*.f64}\left(x, x\right), \mathsf{+.f64}\left(\frac{-1}{3}, \left({x}^{2} \cdot \color{blue}{\frac{2}{15}}\right)\right)\right)\right)\right) \]
    11. unpow2N/A

      \[\leadsto \mathsf{*.f64}\left(x, \mathsf{+.f64}\left(1, \mathsf{*.f64}\left(\mathsf{*.f64}\left(x, x\right), \mathsf{+.f64}\left(\frac{-1}{3}, \left(\left(x \cdot x\right) \cdot \frac{2}{15}\right)\right)\right)\right)\right) \]
    12. associate-*l*N/A

      \[\leadsto \mathsf{*.f64}\left(x, \mathsf{+.f64}\left(1, \mathsf{*.f64}\left(\mathsf{*.f64}\left(x, x\right), \mathsf{+.f64}\left(\frac{-1}{3}, \left(x \cdot \color{blue}{\left(x \cdot \frac{2}{15}\right)}\right)\right)\right)\right)\right) \]
    13. *-lowering-*.f64N/A

      \[\leadsto \mathsf{*.f64}\left(x, \mathsf{+.f64}\left(1, \mathsf{*.f64}\left(\mathsf{*.f64}\left(x, x\right), \mathsf{+.f64}\left(\frac{-1}{3}, \mathsf{*.f64}\left(x, \color{blue}{\left(x \cdot \frac{2}{15}\right)}\right)\right)\right)\right)\right) \]
    14. *-lowering-*.f6497.8%

      \[\leadsto \mathsf{*.f64}\left(x, \mathsf{+.f64}\left(1, \mathsf{*.f64}\left(\mathsf{*.f64}\left(x, x\right), \mathsf{+.f64}\left(\frac{-1}{3}, \mathsf{*.f64}\left(x, \mathsf{*.f64}\left(x, \color{blue}{\frac{2}{15}}\right)\right)\right)\right)\right)\right) \]
  7. Simplified97.8%

    \[\leadsto \color{blue}{x \cdot \left(1 + \left(x \cdot x\right) \cdot \left(-0.3333333333333333 + x \cdot \left(x \cdot 0.13333333333333333\right)\right)\right)} \]
  8. Step-by-step derivation
    1. +-commutativeN/A

      \[\leadsto x \cdot \left(\left(x \cdot x\right) \cdot \left(\frac{-1}{3} + x \cdot \left(x \cdot \frac{2}{15}\right)\right) + \color{blue}{1}\right) \]
    2. distribute-rgt-inN/A

      \[\leadsto \left(\left(x \cdot x\right) \cdot \left(\frac{-1}{3} + x \cdot \left(x \cdot \frac{2}{15}\right)\right)\right) \cdot x + \color{blue}{1 \cdot x} \]
    3. *-lft-identityN/A

      \[\leadsto \left(\left(x \cdot x\right) \cdot \left(\frac{-1}{3} + x \cdot \left(x \cdot \frac{2}{15}\right)\right)\right) \cdot x + x \]
    4. +-lowering-+.f64N/A

      \[\leadsto \mathsf{+.f64}\left(\left(\left(\left(x \cdot x\right) \cdot \left(\frac{-1}{3} + x \cdot \left(x \cdot \frac{2}{15}\right)\right)\right) \cdot x\right), \color{blue}{x}\right) \]
    5. *-commutativeN/A

      \[\leadsto \mathsf{+.f64}\left(\left(\left(\left(\frac{-1}{3} + x \cdot \left(x \cdot \frac{2}{15}\right)\right) \cdot \left(x \cdot x\right)\right) \cdot x\right), x\right) \]
    6. associate-*l*N/A

      \[\leadsto \mathsf{+.f64}\left(\left(\left(\frac{-1}{3} + x \cdot \left(x \cdot \frac{2}{15}\right)\right) \cdot \left(\left(x \cdot x\right) \cdot x\right)\right), x\right) \]
    7. *-lowering-*.f64N/A

      \[\leadsto \mathsf{+.f64}\left(\mathsf{*.f64}\left(\left(\frac{-1}{3} + x \cdot \left(x \cdot \frac{2}{15}\right)\right), \left(\left(x \cdot x\right) \cdot x\right)\right), x\right) \]
    8. +-lowering-+.f64N/A

      \[\leadsto \mathsf{+.f64}\left(\mathsf{*.f64}\left(\mathsf{+.f64}\left(\frac{-1}{3}, \left(x \cdot \left(x \cdot \frac{2}{15}\right)\right)\right), \left(\left(x \cdot x\right) \cdot x\right)\right), x\right) \]
    9. associate-*r*N/A

      \[\leadsto \mathsf{+.f64}\left(\mathsf{*.f64}\left(\mathsf{+.f64}\left(\frac{-1}{3}, \left(\left(x \cdot x\right) \cdot \frac{2}{15}\right)\right), \left(\left(x \cdot x\right) \cdot x\right)\right), x\right) \]
    10. *-lowering-*.f64N/A

      \[\leadsto \mathsf{+.f64}\left(\mathsf{*.f64}\left(\mathsf{+.f64}\left(\frac{-1}{3}, \mathsf{*.f64}\left(\left(x \cdot x\right), \frac{2}{15}\right)\right), \left(\left(x \cdot x\right) \cdot x\right)\right), x\right) \]
    11. *-lowering-*.f64N/A

      \[\leadsto \mathsf{+.f64}\left(\mathsf{*.f64}\left(\mathsf{+.f64}\left(\frac{-1}{3}, \mathsf{*.f64}\left(\mathsf{*.f64}\left(x, x\right), \frac{2}{15}\right)\right), \left(\left(x \cdot x\right) \cdot x\right)\right), x\right) \]
    12. associate-*r*N/A

      \[\leadsto \mathsf{+.f64}\left(\mathsf{*.f64}\left(\mathsf{+.f64}\left(\frac{-1}{3}, \mathsf{*.f64}\left(\mathsf{*.f64}\left(x, x\right), \frac{2}{15}\right)\right), \left(x \cdot \left(x \cdot x\right)\right)\right), x\right) \]
    13. *-lowering-*.f64N/A

      \[\leadsto \mathsf{+.f64}\left(\mathsf{*.f64}\left(\mathsf{+.f64}\left(\frac{-1}{3}, \mathsf{*.f64}\left(\mathsf{*.f64}\left(x, x\right), \frac{2}{15}\right)\right), \mathsf{*.f64}\left(x, \left(x \cdot x\right)\right)\right), x\right) \]
    14. *-lowering-*.f6497.9%

      \[\leadsto \mathsf{+.f64}\left(\mathsf{*.f64}\left(\mathsf{+.f64}\left(\frac{-1}{3}, \mathsf{*.f64}\left(\mathsf{*.f64}\left(x, x\right), \frac{2}{15}\right)\right), \mathsf{*.f64}\left(x, \mathsf{*.f64}\left(x, x\right)\right)\right), x\right) \]
  9. Applied egg-rr97.9%

    \[\leadsto \color{blue}{\left(-0.3333333333333333 + \left(x \cdot x\right) \cdot 0.13333333333333333\right) \cdot \left(x \cdot \left(x \cdot x\right)\right) + x} \]
  10. Final simplification97.9%

    \[\leadsto x + \left(-0.3333333333333333 + \left(x \cdot x\right) \cdot 0.13333333333333333\right) \cdot \left(x \cdot \left(x \cdot x\right)\right) \]
  11. Add Preprocessing

Alternative 3: 97.0% accurate, 27.3× speedup?

\[\begin{array}{l} \\ x \cdot \left(1 + \left(x \cdot x\right) \cdot \left(-0.3333333333333333 + x \cdot \left(x \cdot 0.13333333333333333\right)\right)\right) \end{array} \]
(FPCore (x)
 :precision binary64
 (*
  x
  (+ 1.0 (* (* x x) (+ -0.3333333333333333 (* x (* x 0.13333333333333333)))))))
double code(double x) {
	return x * (1.0 + ((x * x) * (-0.3333333333333333 + (x * (x * 0.13333333333333333)))));
}
real(8) function code(x)
    real(8), intent (in) :: x
    code = x * (1.0d0 + ((x * x) * ((-0.3333333333333333d0) + (x * (x * 0.13333333333333333d0)))))
end function
public static double code(double x) {
	return x * (1.0 + ((x * x) * (-0.3333333333333333 + (x * (x * 0.13333333333333333)))));
}
def code(x):
	return x * (1.0 + ((x * x) * (-0.3333333333333333 + (x * (x * 0.13333333333333333)))))
function code(x)
	return Float64(x * Float64(1.0 + Float64(Float64(x * x) * Float64(-0.3333333333333333 + Float64(x * Float64(x * 0.13333333333333333))))))
end
function tmp = code(x)
	tmp = x * (1.0 + ((x * x) * (-0.3333333333333333 + (x * (x * 0.13333333333333333)))));
end
code[x_] := N[(x * N[(1.0 + N[(N[(x * x), $MachinePrecision] * N[(-0.3333333333333333 + N[(x * N[(x * 0.13333333333333333), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}

\\
x \cdot \left(1 + \left(x \cdot x\right) \cdot \left(-0.3333333333333333 + x \cdot \left(x \cdot 0.13333333333333333\right)\right)\right)
\end{array}
Derivation
  1. Initial program 12.6%

    \[\frac{e^{x} - e^{-x}}{e^{x} + e^{-x}} \]
  2. Step-by-step derivation
    1. div-subN/A

      \[\leadsto \frac{e^{x}}{e^{x} + e^{\mathsf{neg}\left(x\right)}} - \color{blue}{\frac{e^{\mathsf{neg}\left(x\right)}}{e^{x} + e^{\mathsf{neg}\left(x\right)}}} \]
    2. sub-negN/A

      \[\leadsto \frac{e^{x}}{e^{x} + e^{\mathsf{neg}\left(x\right)}} + \color{blue}{\left(\mathsf{neg}\left(\frac{e^{\mathsf{neg}\left(x\right)}}{e^{x} + e^{\mathsf{neg}\left(x\right)}}\right)\right)} \]
    3. +-lowering-+.f64N/A

      \[\leadsto \mathsf{+.f64}\left(\left(\frac{e^{x}}{e^{x} + e^{\mathsf{neg}\left(x\right)}}\right), \color{blue}{\left(\mathsf{neg}\left(\frac{e^{\mathsf{neg}\left(x\right)}}{e^{x} + e^{\mathsf{neg}\left(x\right)}}\right)\right)}\right) \]
  3. Simplified12.9%

    \[\leadsto \color{blue}{\frac{1}{1 + e^{x \cdot -2}} + \frac{1}{-1 - e^{x \cdot 2}}} \]
  4. Add Preprocessing
  5. Taylor expanded in x around 0

    \[\leadsto \color{blue}{x \cdot \left(1 + {x}^{2} \cdot \left(\frac{2}{15} \cdot {x}^{2} - \frac{1}{3}\right)\right)} \]
  6. Step-by-step derivation
    1. *-lowering-*.f64N/A

      \[\leadsto \mathsf{*.f64}\left(x, \color{blue}{\left(1 + {x}^{2} \cdot \left(\frac{2}{15} \cdot {x}^{2} - \frac{1}{3}\right)\right)}\right) \]
    2. +-lowering-+.f64N/A

      \[\leadsto \mathsf{*.f64}\left(x, \mathsf{+.f64}\left(1, \color{blue}{\left({x}^{2} \cdot \left(\frac{2}{15} \cdot {x}^{2} - \frac{1}{3}\right)\right)}\right)\right) \]
    3. *-lowering-*.f64N/A

      \[\leadsto \mathsf{*.f64}\left(x, \mathsf{+.f64}\left(1, \mathsf{*.f64}\left(\left({x}^{2}\right), \color{blue}{\left(\frac{2}{15} \cdot {x}^{2} - \frac{1}{3}\right)}\right)\right)\right) \]
    4. unpow2N/A

      \[\leadsto \mathsf{*.f64}\left(x, \mathsf{+.f64}\left(1, \mathsf{*.f64}\left(\left(x \cdot x\right), \left(\color{blue}{\frac{2}{15} \cdot {x}^{2}} - \frac{1}{3}\right)\right)\right)\right) \]
    5. *-lowering-*.f64N/A

      \[\leadsto \mathsf{*.f64}\left(x, \mathsf{+.f64}\left(1, \mathsf{*.f64}\left(\mathsf{*.f64}\left(x, x\right), \left(\color{blue}{\frac{2}{15} \cdot {x}^{2}} - \frac{1}{3}\right)\right)\right)\right) \]
    6. sub-negN/A

      \[\leadsto \mathsf{*.f64}\left(x, \mathsf{+.f64}\left(1, \mathsf{*.f64}\left(\mathsf{*.f64}\left(x, x\right), \left(\frac{2}{15} \cdot {x}^{2} + \color{blue}{\left(\mathsf{neg}\left(\frac{1}{3}\right)\right)}\right)\right)\right)\right) \]
    7. metadata-evalN/A

      \[\leadsto \mathsf{*.f64}\left(x, \mathsf{+.f64}\left(1, \mathsf{*.f64}\left(\mathsf{*.f64}\left(x, x\right), \left(\frac{2}{15} \cdot {x}^{2} + \frac{-1}{3}\right)\right)\right)\right) \]
    8. +-commutativeN/A

      \[\leadsto \mathsf{*.f64}\left(x, \mathsf{+.f64}\left(1, \mathsf{*.f64}\left(\mathsf{*.f64}\left(x, x\right), \left(\frac{-1}{3} + \color{blue}{\frac{2}{15} \cdot {x}^{2}}\right)\right)\right)\right) \]
    9. +-lowering-+.f64N/A

      \[\leadsto \mathsf{*.f64}\left(x, \mathsf{+.f64}\left(1, \mathsf{*.f64}\left(\mathsf{*.f64}\left(x, x\right), \mathsf{+.f64}\left(\frac{-1}{3}, \color{blue}{\left(\frac{2}{15} \cdot {x}^{2}\right)}\right)\right)\right)\right) \]
    10. *-commutativeN/A

      \[\leadsto \mathsf{*.f64}\left(x, \mathsf{+.f64}\left(1, \mathsf{*.f64}\left(\mathsf{*.f64}\left(x, x\right), \mathsf{+.f64}\left(\frac{-1}{3}, \left({x}^{2} \cdot \color{blue}{\frac{2}{15}}\right)\right)\right)\right)\right) \]
    11. unpow2N/A

      \[\leadsto \mathsf{*.f64}\left(x, \mathsf{+.f64}\left(1, \mathsf{*.f64}\left(\mathsf{*.f64}\left(x, x\right), \mathsf{+.f64}\left(\frac{-1}{3}, \left(\left(x \cdot x\right) \cdot \frac{2}{15}\right)\right)\right)\right)\right) \]
    12. associate-*l*N/A

      \[\leadsto \mathsf{*.f64}\left(x, \mathsf{+.f64}\left(1, \mathsf{*.f64}\left(\mathsf{*.f64}\left(x, x\right), \mathsf{+.f64}\left(\frac{-1}{3}, \left(x \cdot \color{blue}{\left(x \cdot \frac{2}{15}\right)}\right)\right)\right)\right)\right) \]
    13. *-lowering-*.f64N/A

      \[\leadsto \mathsf{*.f64}\left(x, \mathsf{+.f64}\left(1, \mathsf{*.f64}\left(\mathsf{*.f64}\left(x, x\right), \mathsf{+.f64}\left(\frac{-1}{3}, \mathsf{*.f64}\left(x, \color{blue}{\left(x \cdot \frac{2}{15}\right)}\right)\right)\right)\right)\right) \]
    14. *-lowering-*.f6497.8%

      \[\leadsto \mathsf{*.f64}\left(x, \mathsf{+.f64}\left(1, \mathsf{*.f64}\left(\mathsf{*.f64}\left(x, x\right), \mathsf{+.f64}\left(\frac{-1}{3}, \mathsf{*.f64}\left(x, \mathsf{*.f64}\left(x, \color{blue}{\frac{2}{15}}\right)\right)\right)\right)\right)\right) \]
  7. Simplified97.8%

    \[\leadsto \color{blue}{x \cdot \left(1 + \left(x \cdot x\right) \cdot \left(-0.3333333333333333 + x \cdot \left(x \cdot 0.13333333333333333\right)\right)\right)} \]
  8. Add Preprocessing

Alternative 4: 96.6% accurate, 45.4× speedup?

\[\begin{array}{l} \\ x + -0.3333333333333333 \cdot \left(x \cdot \left(x \cdot x\right)\right) \end{array} \]
(FPCore (x) :precision binary64 (+ x (* -0.3333333333333333 (* x (* x x)))))
double code(double x) {
	return x + (-0.3333333333333333 * (x * (x * x)));
}
real(8) function code(x)
    real(8), intent (in) :: x
    code = x + ((-0.3333333333333333d0) * (x * (x * x)))
end function
public static double code(double x) {
	return x + (-0.3333333333333333 * (x * (x * x)));
}
def code(x):
	return x + (-0.3333333333333333 * (x * (x * x)))
function code(x)
	return Float64(x + Float64(-0.3333333333333333 * Float64(x * Float64(x * x))))
end
function tmp = code(x)
	tmp = x + (-0.3333333333333333 * (x * (x * x)));
end
code[x_] := N[(x + N[(-0.3333333333333333 * N[(x * N[(x * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}

\\
x + -0.3333333333333333 \cdot \left(x \cdot \left(x \cdot x\right)\right)
\end{array}
Derivation
  1. Initial program 12.6%

    \[\frac{e^{x} - e^{-x}}{e^{x} + e^{-x}} \]
  2. Step-by-step derivation
    1. div-subN/A

      \[\leadsto \frac{e^{x}}{e^{x} + e^{\mathsf{neg}\left(x\right)}} - \color{blue}{\frac{e^{\mathsf{neg}\left(x\right)}}{e^{x} + e^{\mathsf{neg}\left(x\right)}}} \]
    2. sub-negN/A

      \[\leadsto \frac{e^{x}}{e^{x} + e^{\mathsf{neg}\left(x\right)}} + \color{blue}{\left(\mathsf{neg}\left(\frac{e^{\mathsf{neg}\left(x\right)}}{e^{x} + e^{\mathsf{neg}\left(x\right)}}\right)\right)} \]
    3. +-lowering-+.f64N/A

      \[\leadsto \mathsf{+.f64}\left(\left(\frac{e^{x}}{e^{x} + e^{\mathsf{neg}\left(x\right)}}\right), \color{blue}{\left(\mathsf{neg}\left(\frac{e^{\mathsf{neg}\left(x\right)}}{e^{x} + e^{\mathsf{neg}\left(x\right)}}\right)\right)}\right) \]
  3. Simplified12.9%

    \[\leadsto \color{blue}{\frac{1}{1 + e^{x \cdot -2}} + \frac{1}{-1 - e^{x \cdot 2}}} \]
  4. Add Preprocessing
  5. Taylor expanded in x around 0

    \[\leadsto \color{blue}{x \cdot \left(1 + \frac{-1}{3} \cdot {x}^{2}\right)} \]
  6. Step-by-step derivation
    1. *-lowering-*.f64N/A

      \[\leadsto \mathsf{*.f64}\left(x, \color{blue}{\left(1 + \frac{-1}{3} \cdot {x}^{2}\right)}\right) \]
    2. +-lowering-+.f64N/A

      \[\leadsto \mathsf{*.f64}\left(x, \mathsf{+.f64}\left(1, \color{blue}{\left(\frac{-1}{3} \cdot {x}^{2}\right)}\right)\right) \]
    3. *-lowering-*.f64N/A

      \[\leadsto \mathsf{*.f64}\left(x, \mathsf{+.f64}\left(1, \mathsf{*.f64}\left(\frac{-1}{3}, \color{blue}{\left({x}^{2}\right)}\right)\right)\right) \]
    4. unpow2N/A

      \[\leadsto \mathsf{*.f64}\left(x, \mathsf{+.f64}\left(1, \mathsf{*.f64}\left(\frac{-1}{3}, \left(x \cdot \color{blue}{x}\right)\right)\right)\right) \]
    5. *-lowering-*.f6497.5%

      \[\leadsto \mathsf{*.f64}\left(x, \mathsf{+.f64}\left(1, \mathsf{*.f64}\left(\frac{-1}{3}, \mathsf{*.f64}\left(x, \color{blue}{x}\right)\right)\right)\right) \]
  7. Simplified97.5%

    \[\leadsto \color{blue}{x \cdot \left(1 + -0.3333333333333333 \cdot \left(x \cdot x\right)\right)} \]
  8. Step-by-step derivation
    1. +-commutativeN/A

      \[\leadsto x \cdot \left(\frac{-1}{3} \cdot \left(x \cdot x\right) + \color{blue}{1}\right) \]
    2. distribute-rgt-inN/A

      \[\leadsto \left(\frac{-1}{3} \cdot \left(x \cdot x\right)\right) \cdot x + \color{blue}{1 \cdot x} \]
    3. *-lft-identityN/A

      \[\leadsto \left(\frac{-1}{3} \cdot \left(x \cdot x\right)\right) \cdot x + x \]
    4. +-lowering-+.f64N/A

      \[\leadsto \mathsf{+.f64}\left(\left(\left(\frac{-1}{3} \cdot \left(x \cdot x\right)\right) \cdot x\right), \color{blue}{x}\right) \]
    5. associate-*l*N/A

      \[\leadsto \mathsf{+.f64}\left(\left(\frac{-1}{3} \cdot \left(\left(x \cdot x\right) \cdot x\right)\right), x\right) \]
    6. *-lowering-*.f64N/A

      \[\leadsto \mathsf{+.f64}\left(\mathsf{*.f64}\left(\frac{-1}{3}, \left(\left(x \cdot x\right) \cdot x\right)\right), x\right) \]
    7. associate-*r*N/A

      \[\leadsto \mathsf{+.f64}\left(\mathsf{*.f64}\left(\frac{-1}{3}, \left(x \cdot \left(x \cdot x\right)\right)\right), x\right) \]
    8. *-lowering-*.f64N/A

      \[\leadsto \mathsf{+.f64}\left(\mathsf{*.f64}\left(\frac{-1}{3}, \mathsf{*.f64}\left(x, \left(x \cdot x\right)\right)\right), x\right) \]
    9. *-lowering-*.f6497.5%

      \[\leadsto \mathsf{+.f64}\left(\mathsf{*.f64}\left(\frac{-1}{3}, \mathsf{*.f64}\left(x, \mathsf{*.f64}\left(x, x\right)\right)\right), x\right) \]
  9. Applied egg-rr97.5%

    \[\leadsto \color{blue}{-0.3333333333333333 \cdot \left(x \cdot \left(x \cdot x\right)\right) + x} \]
  10. Final simplification97.5%

    \[\leadsto x + -0.3333333333333333 \cdot \left(x \cdot \left(x \cdot x\right)\right) \]
  11. Add Preprocessing

Alternative 5: 96.6% accurate, 45.4× speedup?

\[\begin{array}{l} \\ x \cdot \left(1 + -0.3333333333333333 \cdot \left(x \cdot x\right)\right) \end{array} \]
(FPCore (x) :precision binary64 (* x (+ 1.0 (* -0.3333333333333333 (* x x)))))
double code(double x) {
	return x * (1.0 + (-0.3333333333333333 * (x * x)));
}
real(8) function code(x)
    real(8), intent (in) :: x
    code = x * (1.0d0 + ((-0.3333333333333333d0) * (x * x)))
end function
public static double code(double x) {
	return x * (1.0 + (-0.3333333333333333 * (x * x)));
}
def code(x):
	return x * (1.0 + (-0.3333333333333333 * (x * x)))
function code(x)
	return Float64(x * Float64(1.0 + Float64(-0.3333333333333333 * Float64(x * x))))
end
function tmp = code(x)
	tmp = x * (1.0 + (-0.3333333333333333 * (x * x)));
end
code[x_] := N[(x * N[(1.0 + N[(-0.3333333333333333 * N[(x * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}

\\
x \cdot \left(1 + -0.3333333333333333 \cdot \left(x \cdot x\right)\right)
\end{array}
Derivation
  1. Initial program 12.6%

    \[\frac{e^{x} - e^{-x}}{e^{x} + e^{-x}} \]
  2. Step-by-step derivation
    1. div-subN/A

      \[\leadsto \frac{e^{x}}{e^{x} + e^{\mathsf{neg}\left(x\right)}} - \color{blue}{\frac{e^{\mathsf{neg}\left(x\right)}}{e^{x} + e^{\mathsf{neg}\left(x\right)}}} \]
    2. sub-negN/A

      \[\leadsto \frac{e^{x}}{e^{x} + e^{\mathsf{neg}\left(x\right)}} + \color{blue}{\left(\mathsf{neg}\left(\frac{e^{\mathsf{neg}\left(x\right)}}{e^{x} + e^{\mathsf{neg}\left(x\right)}}\right)\right)} \]
    3. +-lowering-+.f64N/A

      \[\leadsto \mathsf{+.f64}\left(\left(\frac{e^{x}}{e^{x} + e^{\mathsf{neg}\left(x\right)}}\right), \color{blue}{\left(\mathsf{neg}\left(\frac{e^{\mathsf{neg}\left(x\right)}}{e^{x} + e^{\mathsf{neg}\left(x\right)}}\right)\right)}\right) \]
  3. Simplified12.9%

    \[\leadsto \color{blue}{\frac{1}{1 + e^{x \cdot -2}} + \frac{1}{-1 - e^{x \cdot 2}}} \]
  4. Add Preprocessing
  5. Taylor expanded in x around 0

    \[\leadsto \color{blue}{x \cdot \left(1 + \frac{-1}{3} \cdot {x}^{2}\right)} \]
  6. Step-by-step derivation
    1. *-lowering-*.f64N/A

      \[\leadsto \mathsf{*.f64}\left(x, \color{blue}{\left(1 + \frac{-1}{3} \cdot {x}^{2}\right)}\right) \]
    2. +-lowering-+.f64N/A

      \[\leadsto \mathsf{*.f64}\left(x, \mathsf{+.f64}\left(1, \color{blue}{\left(\frac{-1}{3} \cdot {x}^{2}\right)}\right)\right) \]
    3. *-lowering-*.f64N/A

      \[\leadsto \mathsf{*.f64}\left(x, \mathsf{+.f64}\left(1, \mathsf{*.f64}\left(\frac{-1}{3}, \color{blue}{\left({x}^{2}\right)}\right)\right)\right) \]
    4. unpow2N/A

      \[\leadsto \mathsf{*.f64}\left(x, \mathsf{+.f64}\left(1, \mathsf{*.f64}\left(\frac{-1}{3}, \left(x \cdot \color{blue}{x}\right)\right)\right)\right) \]
    5. *-lowering-*.f6497.5%

      \[\leadsto \mathsf{*.f64}\left(x, \mathsf{+.f64}\left(1, \mathsf{*.f64}\left(\frac{-1}{3}, \mathsf{*.f64}\left(x, \color{blue}{x}\right)\right)\right)\right) \]
  7. Simplified97.5%

    \[\leadsto \color{blue}{x \cdot \left(1 + -0.3333333333333333 \cdot \left(x \cdot x\right)\right)} \]
  8. Add Preprocessing

Alternative 6: 96.4% accurate, 409.0× speedup?

\[\begin{array}{l} \\ x \end{array} \]
(FPCore (x) :precision binary64 x)
double code(double x) {
	return x;
}
real(8) function code(x)
    real(8), intent (in) :: x
    code = x
end function
public static double code(double x) {
	return x;
}
def code(x):
	return x
function code(x)
	return x
end
function tmp = code(x)
	tmp = x;
end
code[x_] := x
\begin{array}{l}

\\
x
\end{array}
Derivation
  1. Initial program 12.6%

    \[\frac{e^{x} - e^{-x}}{e^{x} + e^{-x}} \]
  2. Step-by-step derivation
    1. div-subN/A

      \[\leadsto \frac{e^{x}}{e^{x} + e^{\mathsf{neg}\left(x\right)}} - \color{blue}{\frac{e^{\mathsf{neg}\left(x\right)}}{e^{x} + e^{\mathsf{neg}\left(x\right)}}} \]
    2. sub-negN/A

      \[\leadsto \frac{e^{x}}{e^{x} + e^{\mathsf{neg}\left(x\right)}} + \color{blue}{\left(\mathsf{neg}\left(\frac{e^{\mathsf{neg}\left(x\right)}}{e^{x} + e^{\mathsf{neg}\left(x\right)}}\right)\right)} \]
    3. +-lowering-+.f64N/A

      \[\leadsto \mathsf{+.f64}\left(\left(\frac{e^{x}}{e^{x} + e^{\mathsf{neg}\left(x\right)}}\right), \color{blue}{\left(\mathsf{neg}\left(\frac{e^{\mathsf{neg}\left(x\right)}}{e^{x} + e^{\mathsf{neg}\left(x\right)}}\right)\right)}\right) \]
  3. Simplified12.9%

    \[\leadsto \color{blue}{\frac{1}{1 + e^{x \cdot -2}} + \frac{1}{-1 - e^{x \cdot 2}}} \]
  4. Add Preprocessing
  5. Taylor expanded in x around 0

    \[\leadsto \color{blue}{x} \]
  6. Step-by-step derivation
    1. Simplified96.5%

      \[\leadsto \color{blue}{x} \]
    2. Add Preprocessing

    Reproduce

    ?
    herbie shell --seed 2024164 
    (FPCore (x)
      :name "Hyperbolic tangent"
      :precision binary64
      (/ (- (exp x) (exp (- x))) (+ (exp x) (exp (- x)))))