VandenBroeck and Keller, Equation (24)

Percentage Accurate: 99.7% → 99.8%

Time: 8.4s

Alternatives: 11

Speedup: 1.0×

Specification

Math

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

FPCore

(FPCore (B x)
 :precision binary64
 (+ (- (* x (/ 1.0 (tan B)))) (/ 1.0 (sin B))))

C

double code(double B, double x) {
	return -(x * (1.0 / tan(B))) + (1.0 / sin(B));
}

Fortran

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

Java

public static double code(double B, double x) {
	return -(x * (1.0 / Math.tan(B))) + (1.0 / Math.sin(B));
}

Python

def code(B, x):
	return -(x * (1.0 / math.tan(B))) + (1.0 / math.sin(B))

Julia

function code(B, x)
	return Float64(Float64(-Float64(x * Float64(1.0 / tan(B)))) + Float64(1.0 / sin(B)))
end

MATLAB

function tmp = code(B, x)
	tmp = -(x * (1.0 / tan(B))) + (1.0 / sin(B));
end

Wolfram

code[B_, x_] := N[((-N[(x * N[(1.0 / N[Tan[B], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]) + N[(1.0 / N[Sin[B], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Initial Program: 99.7% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (B x)
 :precision binary64
 (+ (- (* x (/ 1.0 (tan B)))) (/ 1.0 (sin B))))

C

double code(double B, double x) {
	return -(x * (1.0 / tan(B))) + (1.0 / sin(B));
}

Fortran

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

Java

public static double code(double B, double x) {
	return -(x * (1.0 / Math.tan(B))) + (1.0 / Math.sin(B));
}

Python

def code(B, x):
	return -(x * (1.0 / math.tan(B))) + (1.0 / math.sin(B))

Julia

function code(B, x)
	return Float64(Float64(-Float64(x * Float64(1.0 / tan(B)))) + Float64(1.0 / sin(B)))
end

MATLAB

function tmp = code(B, x)
	tmp = -(x * (1.0 / tan(B))) + (1.0 / sin(B));
end

Wolfram

code[B_, x_] := N[((-N[(x * N[(1.0 / N[Tan[B], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]) + N[(1.0 / N[Sin[B], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Alternative 1: 99.8% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{1}{\sin B} - \frac{x}{\tan B} \end{array} \]

FPCore

(FPCore (B x) :precision binary64 (- (/ 1.0 (sin B)) (/ x (tan B))))

C

double code(double B, double x) {
	return (1.0 / sin(B)) - (x / tan(B));
}

Fortran

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

Java

public static double code(double B, double x) {
	return (1.0 / Math.sin(B)) - (x / Math.tan(B));
}

Python

def code(B, x):
	return (1.0 / math.sin(B)) - (x / math.tan(B))

Julia

function code(B, x)
	return Float64(Float64(1.0 / sin(B)) - Float64(x / tan(B)))
end

MATLAB

function tmp = code(B, x)
	tmp = (1.0 / sin(B)) - (x / tan(B));
end

Wolfram

code[B_, x_] := N[(N[(1.0 / N[Sin[B], $MachinePrecision]), $MachinePrecision] - N[(x / N[Tan[B], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 99.7%

   \[\left(-x \cdot \frac{1}{\tan B}\right) + \frac{1}{\sin B} \]
2. Step-by-step derivation

   1. distribute-lft-neg-in 99.7%

      \[\leadsto \color{blue}{\left(-x\right) \cdot \frac{1}{\tan B}} + \frac{1}{\sin B} \]

   2. +-commutative 99.7%

      \[\leadsto \color{blue}{\frac{1}{\sin B} + \left(-x\right) \cdot \frac{1}{\tan B}} \]

   3. *-commutative 99.7%

      \[\leadsto \frac{1}{\sin B} + \color{blue}{\frac{1}{\tan B} \cdot \left(-x\right)} \]

   4. remove-double-neg 99.7%

      \[\leadsto \frac{1}{\sin B} + \color{blue}{\left(-\left(-\frac{1}{\tan B}\right)\right)} \cdot \left(-x\right) \]

   5. distribute-frac-neg2 99.7%

      \[\leadsto \frac{1}{\sin B} + \left(-\color{blue}{\frac{1}{-\tan B}}\right) \cdot \left(-x\right) \]

   6. tan-neg 99.7%

      \[\leadsto \frac{1}{\sin B} + \left(-\frac{1}{\color{blue}{\tan \left(-B\right)}}\right) \cdot \left(-x\right) \]

   7. cancel-sign-sub-inv 99.7%

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

   8. *-commutative 99.7%

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

   9. associate-*r/ 99.8%

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

   10. *-rgt-identity 99.8%

       \[\leadsto \frac{1}{\sin B} - \frac{\color{blue}{-x}}{\tan \left(-B\right)} \]

   11. tan-neg 99.8%

       \[\leadsto \frac{1}{\sin B} - \frac{-x}{\color{blue}{-\tan B}} \]

   12. distribute-neg-frac2 99.8%

       \[\leadsto \frac{1}{\sin B} - \color{blue}{\left(-\frac{-x}{\tan B}\right)} \]

   13. distribute-neg-frac 99.8%

       \[\leadsto \frac{1}{\sin B} - \color{blue}{\frac{-\left(-x\right)}{\tan B}} \]

   14. remove-double-neg 99.8%

       \[\leadsto \frac{1}{\sin B} - \frac{\color{blue}{x}}{\tan B} \]

3. Simplified 99.8%

   \[\leadsto \color{blue}{\frac{1}{\sin B} - \frac{x}{\tan B}} \]
4. Add Preprocessing
5. Add Preprocessing

Alternative 2: 98.2% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -3.8 \cdot 10^{-10} \lor \neg \left(x \leq 3.9 \cdot 10^{-13}\right):\\ \;\;\;\;\frac{1 - x}{\tan B}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{1}{\cos B}}{\tan B}\\ \end{array} \end{array} \]

FPCore

(FPCore (B x)
 :precision binary64
 (if (or (<= x -3.8e-10) (not (<= x 3.9e-13)))
   (/ (- 1.0 x) (tan B))
   (/ (/ 1.0 (cos B)) (tan B))))

C

double code(double B, double x) {
	double tmp;
	if ((x <= -3.8e-10) || !(x <= 3.9e-13)) {
		tmp = (1.0 - x) / tan(B);
	} else {
		tmp = (1.0 / cos(B)) / tan(B);
	}
	return tmp;
}

Fortran

real(8) function code(b, x)
    real(8), intent (in) :: b
    real(8), intent (in) :: x
    real(8) :: tmp
    if ((x <= (-3.8d-10)) .or. (.not. (x <= 3.9d-13))) then
        tmp = (1.0d0 - x) / tan(b)
    else
        tmp = (1.0d0 / cos(b)) / tan(b)
    end if
    code = tmp
end function

Java

public static double code(double B, double x) {
	double tmp;
	if ((x <= -3.8e-10) || !(x <= 3.9e-13)) {
		tmp = (1.0 - x) / Math.tan(B);
	} else {
		tmp = (1.0 / Math.cos(B)) / Math.tan(B);
	}
	return tmp;
}

Python

def code(B, x):
	tmp = 0
	if (x <= -3.8e-10) or not (x <= 3.9e-13):
		tmp = (1.0 - x) / math.tan(B)
	else:
		tmp = (1.0 / math.cos(B)) / math.tan(B)
	return tmp

Julia

function code(B, x)
	tmp = 0.0
	if ((x <= -3.8e-10) || !(x <= 3.9e-13))
		tmp = Float64(Float64(1.0 - x) / tan(B));
	else
		tmp = Float64(Float64(1.0 / cos(B)) / tan(B));
	end
	return tmp
end

MATLAB

function tmp_2 = code(B, x)
	tmp = 0.0;
	if ((x <= -3.8e-10) || ~((x <= 3.9e-13)))
		tmp = (1.0 - x) / tan(B);
	else
		tmp = (1.0 / cos(B)) / tan(B);
	end
	tmp_2 = tmp;
end

Wolfram

code[B_, x_] := If[Or[LessEqual[x, -3.8e-10], N[Not[LessEqual[x, 3.9e-13]], $MachinePrecision]], N[(N[(1.0 - x), $MachinePrecision] / N[Tan[B], $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / N[Cos[B], $MachinePrecision]), $MachinePrecision] / N[Tan[B], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -3.7999999999999998e-10 or 3.90000000000000004e-13 < x

   1. Initial program 99.6%

      \[\left(-x \cdot \frac{1}{\tan B}\right) + \frac{1}{\sin B} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. +-commutative 99.6%

         \[\leadsto \color{blue}{\frac{1}{\sin B} + \left(-x \cdot \frac{1}{\tan B}\right)} \]

      2. div-inv 99.8%

         \[\leadsto \frac{1}{\sin B} + \left(-\color{blue}{\frac{x}{\tan B}}\right) \]

      3. sub-neg 99.8%

         \[\leadsto \color{blue}{\frac{1}{\sin B} - \frac{x}{\tan B}} \]

      4. frac-sub 93.0%

         \[\leadsto \color{blue}{\frac{1 \cdot \tan B - \sin B \cdot x}{\sin B \cdot \tan B}} \]

      5. associate-/r* 99.7%

         \[\leadsto \color{blue}{\frac{\frac{1 \cdot \tan B - \sin B \cdot x}{\sin B}}{\tan B}} \]

      6. *-un-lft-identity 99.7%

         \[\leadsto \frac{\frac{\color{blue}{\tan B} - \sin B \cdot x}{\sin B}}{\tan B} \]

      7. *-commutative 99.7%

         \[\leadsto \frac{\frac{\tan B - \color{blue}{x \cdot \sin B}}{\sin B}}{\tan B} \]

   4. Applied egg-rr 99.7%

      \[\leadsto \color{blue}{\frac{\frac{\tan B - x \cdot \sin B}{\sin B}}{\tan B}} \]

   5. Taylor expanded in B around 0 97.4%

      \[\leadsto \frac{\color{blue}{1 - x}}{\tan B} \]

   if -3.7999999999999998e-10 < x < 3.90000000000000004e-13

   1. Initial program 99.7%

      \[\left(-x \cdot \frac{1}{\tan B}\right) + \frac{1}{\sin B} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. +-commutative 99.7%

         \[\leadsto \color{blue}{\frac{1}{\sin B} + \left(-x \cdot \frac{1}{\tan B}\right)} \]

      2. div-inv 99.7%

         \[\leadsto \frac{1}{\sin B} + \left(-\color{blue}{\frac{x}{\tan B}}\right) \]

      3. sub-neg 99.7%

         \[\leadsto \color{blue}{\frac{1}{\sin B} - \frac{x}{\tan B}} \]

      4. frac-sub 78.2%

         \[\leadsto \color{blue}{\frac{1 \cdot \tan B - \sin B \cdot x}{\sin B \cdot \tan B}} \]

      5. associate-/r* 99.8%

         \[\leadsto \color{blue}{\frac{\frac{1 \cdot \tan B - \sin B \cdot x}{\sin B}}{\tan B}} \]

      6. *-un-lft-identity 99.8%

         \[\leadsto \frac{\frac{\color{blue}{\tan B} - \sin B \cdot x}{\sin B}}{\tan B} \]

      7. *-commutative 99.8%

         \[\leadsto \frac{\frac{\tan B - \color{blue}{x \cdot \sin B}}{\sin B}}{\tan B} \]

   4. Applied egg-rr 99.8%

      \[\leadsto \color{blue}{\frac{\frac{\tan B - x \cdot \sin B}{\sin B}}{\tan B}} \]

   5. Taylor expanded in x around 0 99.4%

      \[\leadsto \frac{\color{blue}{\frac{1}{\cos B}}}{\tan B} \]
3. Recombined 2 regimes into one program.

4. Final simplification 98.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -3.8 \cdot 10^{-10} \lor \neg \left(x \leq 3.9 \cdot 10^{-13}\right):\\ \;\;\;\;\frac{1 - x}{\tan B}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{1}{\cos B}}{\tan B}\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 98.3% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -5 \cdot 10^{-10} \lor \neg \left(x \leq 3.9 \cdot 10^{-13}\right):\\ \;\;\;\;\frac{1 - x}{\tan B}\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{\sin B}\\ \end{array} \end{array} \]

FPCore

(FPCore (B x)
 :precision binary64
 (if (or (<= x -5e-10) (not (<= x 3.9e-13)))
   (/ (- 1.0 x) (tan B))
   (/ 1.0 (sin B))))

C

double code(double B, double x) {
	double tmp;
	if ((x <= -5e-10) || !(x <= 3.9e-13)) {
		tmp = (1.0 - x) / tan(B);
	} else {
		tmp = 1.0 / sin(B);
	}
	return tmp;
}

Fortran

real(8) function code(b, x)
    real(8), intent (in) :: b
    real(8), intent (in) :: x
    real(8) :: tmp
    if ((x <= (-5d-10)) .or. (.not. (x <= 3.9d-13))) then
        tmp = (1.0d0 - x) / tan(b)
    else
        tmp = 1.0d0 / sin(b)
    end if
    code = tmp
end function

Java

public static double code(double B, double x) {
	double tmp;
	if ((x <= -5e-10) || !(x <= 3.9e-13)) {
		tmp = (1.0 - x) / Math.tan(B);
	} else {
		tmp = 1.0 / Math.sin(B);
	}
	return tmp;
}

Python

def code(B, x):
	tmp = 0
	if (x <= -5e-10) or not (x <= 3.9e-13):
		tmp = (1.0 - x) / math.tan(B)
	else:
		tmp = 1.0 / math.sin(B)
	return tmp

Julia

function code(B, x)
	tmp = 0.0
	if ((x <= -5e-10) || !(x <= 3.9e-13))
		tmp = Float64(Float64(1.0 - x) / tan(B));
	else
		tmp = Float64(1.0 / sin(B));
	end
	return tmp
end

MATLAB

function tmp_2 = code(B, x)
	tmp = 0.0;
	if ((x <= -5e-10) || ~((x <= 3.9e-13)))
		tmp = (1.0 - x) / tan(B);
	else
		tmp = 1.0 / sin(B);
	end
	tmp_2 = tmp;
end

Wolfram

code[B_, x_] := If[Or[LessEqual[x, -5e-10], N[Not[LessEqual[x, 3.9e-13]], $MachinePrecision]], N[(N[(1.0 - x), $MachinePrecision] / N[Tan[B], $MachinePrecision]), $MachinePrecision], N[(1.0 / N[Sin[B], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -5.00000000000000031e-10 or 3.90000000000000004e-13 < x

   1. Initial program 99.6%

      \[\left(-x \cdot \frac{1}{\tan B}\right) + \frac{1}{\sin B} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. +-commutative 99.6%

         \[\leadsto \color{blue}{\frac{1}{\sin B} + \left(-x \cdot \frac{1}{\tan B}\right)} \]

      2. div-inv 99.8%

         \[\leadsto \frac{1}{\sin B} + \left(-\color{blue}{\frac{x}{\tan B}}\right) \]

      3. sub-neg 99.8%

         \[\leadsto \color{blue}{\frac{1}{\sin B} - \frac{x}{\tan B}} \]

      4. frac-sub 93.0%

         \[\leadsto \color{blue}{\frac{1 \cdot \tan B - \sin B \cdot x}{\sin B \cdot \tan B}} \]

      5. associate-/r* 99.7%

         \[\leadsto \color{blue}{\frac{\frac{1 \cdot \tan B - \sin B \cdot x}{\sin B}}{\tan B}} \]

      6. *-un-lft-identity 99.7%

         \[\leadsto \frac{\frac{\color{blue}{\tan B} - \sin B \cdot x}{\sin B}}{\tan B} \]

      7. *-commutative 99.7%

         \[\leadsto \frac{\frac{\tan B - \color{blue}{x \cdot \sin B}}{\sin B}}{\tan B} \]

   4. Applied egg-rr 99.7%

      \[\leadsto \color{blue}{\frac{\frac{\tan B - x \cdot \sin B}{\sin B}}{\tan B}} \]

   5. Taylor expanded in B around 0 97.4%

      \[\leadsto \frac{\color{blue}{1 - x}}{\tan B} \]

   if -5.00000000000000031e-10 < x < 3.90000000000000004e-13

   1. Initial program 99.7%

      \[\left(-x \cdot \frac{1}{\tan B}\right) + \frac{1}{\sin B} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0 99.4%

      \[\leadsto \color{blue}{\frac{1}{\sin B}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 98.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -5 \cdot 10^{-10} \lor \neg \left(x \leq 3.9 \cdot 10^{-13}\right):\\ \;\;\;\;\frac{1 - x}{\tan B}\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{\sin B}\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 97.7% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1.15 \lor \neg \left(x \leq 1\right):\\ \;\;\;\;\frac{x}{-\tan B}\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{\sin B}\\ \end{array} \end{array} \]

FPCore

(FPCore (B x)
 :precision binary64
 (if (or (<= x -1.15) (not (<= x 1.0))) (/ x (- (tan B))) (/ 1.0 (sin B))))

C

double code(double B, double x) {
	double tmp;
	if ((x <= -1.15) || !(x <= 1.0)) {
		tmp = x / -tan(B);
	} else {
		tmp = 1.0 / sin(B);
	}
	return tmp;
}

Fortran

real(8) function code(b, x)
    real(8), intent (in) :: b
    real(8), intent (in) :: x
    real(8) :: tmp
    if ((x <= (-1.15d0)) .or. (.not. (x <= 1.0d0))) then
        tmp = x / -tan(b)
    else
        tmp = 1.0d0 / sin(b)
    end if
    code = tmp
end function

Java

public static double code(double B, double x) {
	double tmp;
	if ((x <= -1.15) || !(x <= 1.0)) {
		tmp = x / -Math.tan(B);
	} else {
		tmp = 1.0 / Math.sin(B);
	}
	return tmp;
}

Python

def code(B, x):
	tmp = 0
	if (x <= -1.15) or not (x <= 1.0):
		tmp = x / -math.tan(B)
	else:
		tmp = 1.0 / math.sin(B)
	return tmp

Julia

function code(B, x)
	tmp = 0.0
	if ((x <= -1.15) || !(x <= 1.0))
		tmp = Float64(x / Float64(-tan(B)));
	else
		tmp = Float64(1.0 / sin(B));
	end
	return tmp
end

MATLAB

function tmp_2 = code(B, x)
	tmp = 0.0;
	if ((x <= -1.15) || ~((x <= 1.0)))
		tmp = x / -tan(B);
	else
		tmp = 1.0 / sin(B);
	end
	tmp_2 = tmp;
end

Wolfram

code[B_, x_] := If[Or[LessEqual[x, -1.15], N[Not[LessEqual[x, 1.0]], $MachinePrecision]], N[(x / (-N[Tan[B], $MachinePrecision])), $MachinePrecision], N[(1.0 / N[Sin[B], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -1.1499999999999999 or 1 < x

   1. Initial program 99.6%

      \[\left(-x \cdot \frac{1}{\tan B}\right) + \frac{1}{\sin B} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. +-commutative 99.6%

         \[\leadsto \color{blue}{\frac{1}{\sin B} + \left(-x \cdot \frac{1}{\tan B}\right)} \]

      2. div-inv 99.8%

         \[\leadsto \frac{1}{\sin B} + \left(-\color{blue}{\frac{x}{\tan B}}\right) \]

      3. sub-neg 99.8%

         \[\leadsto \color{blue}{\frac{1}{\sin B} - \frac{x}{\tan B}} \]

      4. frac-sub 94.8%

         \[\leadsto \color{blue}{\frac{1 \cdot \tan B - \sin B \cdot x}{\sin B \cdot \tan B}} \]

      5. associate-/r* 99.8%

         \[\leadsto \color{blue}{\frac{\frac{1 \cdot \tan B - \sin B \cdot x}{\sin B}}{\tan B}} \]

      6. *-un-lft-identity 99.8%

         \[\leadsto \frac{\frac{\color{blue}{\tan B} - \sin B \cdot x}{\sin B}}{\tan B} \]

      7. *-commutative 99.8%

         \[\leadsto \frac{\frac{\tan B - \color{blue}{x \cdot \sin B}}{\sin B}}{\tan B} \]

   4. Applied egg-rr 99.8%

      \[\leadsto \color{blue}{\frac{\frac{\tan B - x \cdot \sin B}{\sin B}}{\tan B}} \]

   5. Taylor expanded in x around inf 96.9%

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

      1. neg-mul-1 96.9%

         \[\leadsto \frac{\color{blue}{-x}}{\tan B} \]

   7. Simplified 96.9%

      \[\leadsto \frac{\color{blue}{-x}}{\tan B} \]

   if -1.1499999999999999 < x < 1

   1. Initial program 99.7%

      \[\left(-x \cdot \frac{1}{\tan B}\right) + \frac{1}{\sin B} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0 97.7%

      \[\leadsto \color{blue}{\frac{1}{\sin B}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 97.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -1.15 \lor \neg \left(x \leq 1\right):\\ \;\;\;\;\frac{x}{-\tan B}\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{\sin B}\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 62.8% accurate, 1.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;B \leq 0.072:\\ \;\;\;\;\frac{\left(1 + \left(B \cdot B\right) \cdot \left(0.16666666666666666 + x \cdot 0.3333333333333333\right)\right) - x}{B}\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{\sin B}\\ \end{array} \end{array} \]

FPCore

(FPCore (B x)
 :precision binary64
 (if (<= B 0.072)
   (/
    (- (+ 1.0 (* (* B B) (+ 0.16666666666666666 (* x 0.3333333333333333)))) x)
    B)
   (/ 1.0 (sin B))))

C

double code(double B, double x) {
	double tmp;
	if (B <= 0.072) {
		tmp = ((1.0 + ((B * B) * (0.16666666666666666 + (x * 0.3333333333333333)))) - x) / B;
	} else {
		tmp = 1.0 / sin(B);
	}
	return tmp;
}

Fortran

real(8) function code(b, x)
    real(8), intent (in) :: b
    real(8), intent (in) :: x
    real(8) :: tmp
    if (b <= 0.072d0) then
        tmp = ((1.0d0 + ((b * b) * (0.16666666666666666d0 + (x * 0.3333333333333333d0)))) - x) / b
    else
        tmp = 1.0d0 / sin(b)
    end if
    code = tmp
end function

Java

public static double code(double B, double x) {
	double tmp;
	if (B <= 0.072) {
		tmp = ((1.0 + ((B * B) * (0.16666666666666666 + (x * 0.3333333333333333)))) - x) / B;
	} else {
		tmp = 1.0 / Math.sin(B);
	}
	return tmp;
}

Python

def code(B, x):
	tmp = 0
	if B <= 0.072:
		tmp = ((1.0 + ((B * B) * (0.16666666666666666 + (x * 0.3333333333333333)))) - x) / B
	else:
		tmp = 1.0 / math.sin(B)
	return tmp

Julia

function code(B, x)
	tmp = 0.0
	if (B <= 0.072)
		tmp = Float64(Float64(Float64(1.0 + Float64(Float64(B * B) * Float64(0.16666666666666666 + Float64(x * 0.3333333333333333)))) - x) / B);
	else
		tmp = Float64(1.0 / sin(B));
	end
	return tmp
end

MATLAB

function tmp_2 = code(B, x)
	tmp = 0.0;
	if (B <= 0.072)
		tmp = ((1.0 + ((B * B) * (0.16666666666666666 + (x * 0.3333333333333333)))) - x) / B;
	else
		tmp = 1.0 / sin(B);
	end
	tmp_2 = tmp;
end

Wolfram

code[B_, x_] := If[LessEqual[B, 0.072], N[(N[(N[(1.0 + N[(N[(B * B), $MachinePrecision] * N[(0.16666666666666666 + N[(x * 0.3333333333333333), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - x), $MachinePrecision] / B), $MachinePrecision], N[(1.0 / N[Sin[B], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if B < 0.0719999999999999946

   1. Initial program 99.8%

      \[\left(-x \cdot \frac{1}{\tan B}\right) + \frac{1}{\sin B} \]
   2. Add Preprocessing

   3. Taylor expanded in B around 0 69.8%

      \[\leadsto \color{blue}{\frac{\left(1 + {B}^{2} \cdot \left(0.16666666666666666 + 0.3333333333333333 \cdot x\right)\right) - x}{B}} \]
   4. Step-by-step derivation

      1. unpow2 69.8%

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

   5. Applied egg-rr 69.8%

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

   if 0.0719999999999999946 < B

   1. Initial program 99.3%

      \[\left(-x \cdot \frac{1}{\tan B}\right) + \frac{1}{\sin B} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0 53.0%

      \[\leadsto \color{blue}{\frac{1}{\sin B}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 65.2%

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

Alternative 6: 51.2% accurate, 12.4× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.7%

   \[\left(-x \cdot \frac{1}{\tan B}\right) + \frac{1}{\sin B} \]
2. Add Preprocessing

3. Taylor expanded in B around 0 51.7%

   \[\leadsto \color{blue}{\frac{\left(1 + {B}^{2} \cdot \left(0.16666666666666666 + 0.3333333333333333 \cdot x\right)\right) - x}{B}} \]

4. Taylor expanded in x around 0 51.8%

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

5. Final simplification 51.8%

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

Alternative 7: 51.2% accurate, 14.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.7%

   \[\left(-x \cdot \frac{1}{\tan B}\right) + \frac{1}{\sin B} \]
2. Add Preprocessing

3. Taylor expanded in B around 0 51.7%

   \[\leadsto \color{blue}{\frac{\left(1 + {B}^{2} \cdot \left(0.16666666666666666 + 0.3333333333333333 \cdot x\right)\right) - x}{B}} \]
4. Step-by-step derivation

   1. unpow2 51.7%

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

5. Applied egg-rr 51.7%

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

6. Final simplification 51.7%

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

Alternative 8: 50.2% accurate, 14.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -3.2 \cdot 10^{-5} \lor \neg \left(x \leq 1\right):\\ \;\;\;\;\frac{x}{-B}\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{B}\\ \end{array} \end{array} \]

FPCore

(FPCore (B x)
 :precision binary64
 (if (or (<= x -3.2e-5) (not (<= x 1.0))) (/ x (- B)) (/ 1.0 B)))

C

double code(double B, double x) {
	double tmp;
	if ((x <= -3.2e-5) || !(x <= 1.0)) {
		tmp = x / -B;
	} else {
		tmp = 1.0 / B;
	}
	return tmp;
}

Fortran

real(8) function code(b, x)
    real(8), intent (in) :: b
    real(8), intent (in) :: x
    real(8) :: tmp
    if ((x <= (-3.2d-5)) .or. (.not. (x <= 1.0d0))) then
        tmp = x / -b
    else
        tmp = 1.0d0 / b
    end if
    code = tmp
end function

Java

public static double code(double B, double x) {
	double tmp;
	if ((x <= -3.2e-5) || !(x <= 1.0)) {
		tmp = x / -B;
	} else {
		tmp = 1.0 / B;
	}
	return tmp;
}

Python

def code(B, x):
	tmp = 0
	if (x <= -3.2e-5) or not (x <= 1.0):
		tmp = x / -B
	else:
		tmp = 1.0 / B
	return tmp

Julia

function code(B, x)
	tmp = 0.0
	if ((x <= -3.2e-5) || !(x <= 1.0))
		tmp = Float64(x / Float64(-B));
	else
		tmp = Float64(1.0 / B);
	end
	return tmp
end

MATLAB

function tmp_2 = code(B, x)
	tmp = 0.0;
	if ((x <= -3.2e-5) || ~((x <= 1.0)))
		tmp = x / -B;
	else
		tmp = 1.0 / B;
	end
	tmp_2 = tmp;
end

Wolfram

code[B_, x_] := If[Or[LessEqual[x, -3.2e-5], N[Not[LessEqual[x, 1.0]], $MachinePrecision]], N[(x / (-B)), $MachinePrecision], N[(1.0 / B), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -3.19999999999999986e-5 or 1 < x

   1. Initial program 99.6%

      \[\left(-x \cdot \frac{1}{\tan B}\right) + \frac{1}{\sin B} \]
   2. Add Preprocessing

   3. Taylor expanded in B around 0 55.3%

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

   4. Taylor expanded in x around inf 54.4%

      \[\leadsto \color{blue}{-1 \cdot \frac{x}{B}} \]
   5. Step-by-step derivation

      1. associate-*r/ 54.4%

         \[\leadsto \color{blue}{\frac{-1 \cdot x}{B}} \]

      2. neg-mul-1 54.4%

         \[\leadsto \frac{\color{blue}{-x}}{B} \]

   6. Simplified 54.4%

      \[\leadsto \color{blue}{\frac{-x}{B}} \]

   if -3.19999999999999986e-5 < x < 1

   1. Initial program 99.7%

      \[\left(-x \cdot \frac{1}{\tan B}\right) + \frac{1}{\sin B} \]
   2. Add Preprocessing

   3. Taylor expanded in B around 0 46.6%

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

   4. Taylor expanded in x around 0 45.3%

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

4. Final simplification 50.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -3.2 \cdot 10^{-5} \lor \neg \left(x \leq 1\right):\\ \;\;\;\;\frac{x}{-B}\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{B}\\ \end{array} \]
5. Add Preprocessing

Alternative 9: 51.1% accurate, 42.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

def code(B, x):
	return (1.0 - x) / B

Julia

function code(B, x)
	return Float64(Float64(1.0 - x) / B)
end

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.7%

   \[\left(-x \cdot \frac{1}{\tan B}\right) + \frac{1}{\sin B} \]
2. Add Preprocessing

3. Taylor expanded in B around 0 51.2%

   \[\leadsto \color{blue}{\frac{1 - x}{B}} \]
4. Add Preprocessing

Alternative 10: 27.1% accurate, 70.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

def code(B, x):
	return 1.0 / B

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.7%

   \[\left(-x \cdot \frac{1}{\tan B}\right) + \frac{1}{\sin B} \]
2. Add Preprocessing

3. Taylor expanded in B around 0 51.2%

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

4. Taylor expanded in x around 0 23.0%

   \[\leadsto \color{blue}{\frac{1}{B}} \]
5. Add Preprocessing

Alternative 11: 2.6% accurate, 70.0× speedup

Math

\[\begin{array}{l} \\ \frac{-1}{B} \end{array} \]

FPCore

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

C

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

Fortran

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

Java

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

Python

def code(B, x):
	return -1.0 / B

Julia

function code(B, x)
	return Float64(-1.0 / B)
end

MATLAB

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

Wolfram

code[B_, x_] := N[(-1.0 / B), $MachinePrecision]

Derivation

1. Initial program 99.7%

   \[\left(-x \cdot \frac{1}{\tan B}\right) + \frac{1}{\sin B} \]
2. Add Preprocessing

3. Taylor expanded in x around inf 88.5%

   \[\leadsto \color{blue}{x \cdot \left(\frac{1}{x \cdot \sin B} - \frac{\cos B}{\sin B}\right)} \]
4. Step-by-step derivation

   1. associate-/r* 88.5%

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

5. Simplified 88.5%

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

6. Taylor expanded in B around 0 40.1%

   \[\leadsto x \cdot \color{blue}{\frac{\frac{1}{x} - 1}{B}} \]
7. Step-by-step derivation

   1. frac-2neg 40.1%

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

   2. div-inv 40.1%

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

   3. sub-neg 40.1%

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

   4. metadata-eval 40.1%

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

   5. distribute-neg-in 40.1%

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

   6. frac-2neg 40.1%

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

   7. metadata-eval 40.1%

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

   8. add-sqr-sqrt 20.7%

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

   9. sqrt-unprod 34.3%

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

   10. sqr-neg 34.3%

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

   11. sqrt-unprod 14.4%

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

   12. add-sqr-sqrt 29.7%

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

   13. distribute-frac-neg2 29.7%

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

   14. metadata-eval 29.7%

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

   15. frac-2neg 29.7%

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

   16. metadata-eval 29.7%

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

   17. +-commutative 29.7%

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

8. Applied egg-rr 29.7%

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

   1. associate-*r/ 29.7%

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

   2. *-rgt-identity 29.7%

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

   3. distribute-neg-frac2 29.7%

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

   4. distribute-neg-frac 29.7%

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

   5. neg-mul-1 29.7%

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

   6. distribute-rgt-in 29.7%

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

   7. metadata-eval 29.7%

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

   8. associate-*l/ 29.7%

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

   9. metadata-eval 29.7%

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

10. Simplified 29.7%

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

11. Taylor expanded in x around 0 2.7%

    \[\leadsto \color{blue}{\frac{-1}{B}} \]
12. Add Preprocessing

Reproduce

herbie shell --seed 2024146 
(FPCore (B x)
  :name "VandenBroeck and Keller, Equation (24)"
  :precision binary64
  (+ (- (* x (/ 1.0 (tan B)))) (/ 1.0 (sin B))))