VandenBroeck and Keller, Equation (24)

Percentage Accurate: 99.7% → 99.8%

Time: 9.6s

Alternatives: 12

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.6%

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

   1. +-commutative 99.6%

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

   2. unsub-neg 99.6%

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

   3. associate-*r/ 99.8%

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

   4. *-rgt-identity 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. Final simplification 99.8%

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

Alternative 2: 98.3% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (B x)
 :precision binary64
 (if (or (<= x -2500000000.0) (not (<= x 31.0)))
   (- (/ (cos B) (/ (sin B) x)))
   (/ (- 1.0 x) (sin B))))

C

double code(double B, double x) {
	double tmp;
	if ((x <= -2500000000.0) || !(x <= 31.0)) {
		tmp = -(cos(B) / (sin(B) / x));
	} else {
		tmp = (1.0 - x) / 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 <= (-2500000000.0d0)) .or. (.not. (x <= 31.0d0))) then
        tmp = -(cos(b) / (sin(b) / x))
    else
        tmp = (1.0d0 - x) / sin(b)
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < -2.5e9 or 31 < x

   1. Initial program 99.5%

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

      1. +-commutative 99.5%

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

      2. unsub-neg 99.5%

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

      3. associate-*r/ 99.8%

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

      4. *-rgt-identity 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. Step-by-step derivation

      1. tan-quot 99.7%

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

      2. associate-/r/ 99.8%

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

   5. Applied egg-rr 99.8%

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

   6. Taylor expanded in B around inf 99.7%

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

      1. *-commutative 99.7%

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

      2. div-sub 99.7%

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

      3. *-commutative 99.7%

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

   8. Simplified 99.7%

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

   9. Taylor expanded in x around inf 97.9%

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

       1. neg-mul-1 97.9%

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

       2. associate-/l* 97.7%

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

   11. Simplified 97.7%

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

   if -2.5e9 < x < 31

   1. Initial program 99.7%

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

      1. +-commutative 99.7%

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

      2. unsub-neg 99.7%

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

      3. associate-*r/ 99.8%

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

      4. *-rgt-identity 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. Step-by-step derivation

      1. tan-quot 99.8%

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

      2. associate-/r/ 99.8%

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

   5. Applied egg-rr 99.8%

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

   6. Taylor expanded in B around inf 99.8%

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

      1. *-commutative 99.8%

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

      2. div-sub 99.8%

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

      3. *-commutative 99.8%

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

   8. Simplified 99.8%

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

   9. Taylor expanded in B around 0 98.3%

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

4. Final simplification 98.0%

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

Alternative 3: 98.4% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (B x)
 :precision binary64
 (if (or (<= x -2700000000.0) (not (<= x 31.0)))
   (* (cos B) (/ (- x) (sin B)))
   (/ (- 1.0 x) (sin B))))

C

double code(double B, double x) {
	double tmp;
	if ((x <= -2700000000.0) || !(x <= 31.0)) {
		tmp = cos(B) * (-x / sin(B));
	} else {
		tmp = (1.0 - x) / 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 <= (-2700000000.0d0)) .or. (.not. (x <= 31.0d0))) then
        tmp = cos(b) * (-x / sin(b))
    else
        tmp = (1.0d0 - x) / sin(b)
    end if
    code = tmp
end function

Java

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

Python

def code(B, x):
	tmp = 0
	if (x <= -2700000000.0) or not (x <= 31.0):
		tmp = math.cos(B) * (-x / math.sin(B))
	else:
		tmp = (1.0 - x) / math.sin(B)
	return tmp

Julia

function code(B, x)
	tmp = 0.0
	if ((x <= -2700000000.0) || !(x <= 31.0))
		tmp = Float64(cos(B) * Float64(Float64(-x) / sin(B)));
	else
		tmp = Float64(Float64(1.0 - x) / sin(B));
	end
	return tmp
end

MATLAB

function tmp_2 = code(B, x)
	tmp = 0.0;
	if ((x <= -2700000000.0) || ~((x <= 31.0)))
		tmp = cos(B) * (-x / sin(B));
	else
		tmp = (1.0 - x) / sin(B);
	end
	tmp_2 = tmp;
end

Wolfram

code[B_, x_] := If[Or[LessEqual[x, -2700000000.0], N[Not[LessEqual[x, 31.0]], $MachinePrecision]], N[(N[Cos[B], $MachinePrecision] * N[((-x) / N[Sin[B], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 - x), $MachinePrecision] / N[Sin[B], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -2.7e9 or 31 < x

   1. Initial program 99.5%

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

      1. +-commutative 99.5%

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

      2. unsub-neg 99.5%

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

      3. associate-*r/ 99.8%

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

      4. *-rgt-identity 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. Step-by-step derivation

      1. tan-quot 99.7%

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

      2. associate-/r/ 99.8%

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

   5. Applied egg-rr 99.8%

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

   6. Taylor expanded in x around inf 97.9%

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

      1. mul-1-neg 97.9%

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

      2. associate-*r/ 97.9%

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

      3. distribute-rgt-neg-in 97.9%

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

      4. distribute-neg-frac 97.9%

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

   8. Simplified 97.9%

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

   if -2.7e9 < x < 31

   1. Initial program 99.7%

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

      1. +-commutative 99.7%

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

      2. unsub-neg 99.7%

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

      3. associate-*r/ 99.8%

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

      4. *-rgt-identity 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. Step-by-step derivation

      1. tan-quot 99.8%

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

      2. associate-/r/ 99.8%

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

   5. Applied egg-rr 99.8%

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

   6. Taylor expanded in B around inf 99.8%

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

      1. *-commutative 99.8%

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

      2. div-sub 99.8%

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

      3. *-commutative 99.8%

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

   8. Simplified 99.8%

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

   9. Taylor expanded in B around 0 98.3%

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

4. Final simplification 98.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -2700000000 \lor \neg \left(x \leq 31\right):\\ \;\;\;\;\cos B \cdot \frac{-x}{\sin B}\\ \mathbf{else}:\\ \;\;\;\;\frac{1 - x}{\sin B}\\ \end{array} \]

Alternative 4: 98.4% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -4100000000:\\ \;\;\;\;\cos B \cdot \frac{-x}{\sin B}\\ \mathbf{elif}\;x \leq 31:\\ \;\;\;\;\frac{1 - x}{\sin B}\\ \mathbf{else}:\\ \;\;\;\;\frac{\cos B \cdot \left(-x\right)}{\sin B}\\ \end{array} \end{array} \]

FPCore

(FPCore (B x)
 :precision binary64
 (if (<= x -4100000000.0)
   (* (cos B) (/ (- x) (sin B)))
   (if (<= x 31.0) (/ (- 1.0 x) (sin B)) (/ (* (cos B) (- x)) (sin B)))))

C

double code(double B, double x) {
	double tmp;
	if (x <= -4100000000.0) {
		tmp = cos(B) * (-x / sin(B));
	} else if (x <= 31.0) {
		tmp = (1.0 - x) / sin(B);
	} else {
		tmp = (cos(B) * -x) / 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 <= (-4100000000.0d0)) then
        tmp = cos(b) * (-x / sin(b))
    else if (x <= 31.0d0) then
        tmp = (1.0d0 - x) / sin(b)
    else
        tmp = (cos(b) * -x) / sin(b)
    end if
    code = tmp
end function

Java

public static double code(double B, double x) {
	double tmp;
	if (x <= -4100000000.0) {
		tmp = Math.cos(B) * (-x / Math.sin(B));
	} else if (x <= 31.0) {
		tmp = (1.0 - x) / Math.sin(B);
	} else {
		tmp = (Math.cos(B) * -x) / Math.sin(B);
	}
	return tmp;
}

Python

def code(B, x):
	tmp = 0
	if x <= -4100000000.0:
		tmp = math.cos(B) * (-x / math.sin(B))
	elif x <= 31.0:
		tmp = (1.0 - x) / math.sin(B)
	else:
		tmp = (math.cos(B) * -x) / math.sin(B)
	return tmp

Julia

function code(B, x)
	tmp = 0.0
	if (x <= -4100000000.0)
		tmp = Float64(cos(B) * Float64(Float64(-x) / sin(B)));
	elseif (x <= 31.0)
		tmp = Float64(Float64(1.0 - x) / sin(B));
	else
		tmp = Float64(Float64(cos(B) * Float64(-x)) / sin(B));
	end
	return tmp
end

MATLAB

function tmp_2 = code(B, x)
	tmp = 0.0;
	if (x <= -4100000000.0)
		tmp = cos(B) * (-x / sin(B));
	elseif (x <= 31.0)
		tmp = (1.0 - x) / sin(B);
	else
		tmp = (cos(B) * -x) / sin(B);
	end
	tmp_2 = tmp;
end

Wolfram

code[B_, x_] := If[LessEqual[x, -4100000000.0], N[(N[Cos[B], $MachinePrecision] * N[((-x) / N[Sin[B], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 31.0], N[(N[(1.0 - x), $MachinePrecision] / N[Sin[B], $MachinePrecision]), $MachinePrecision], N[(N[(N[Cos[B], $MachinePrecision] * (-x)), $MachinePrecision] / N[Sin[B], $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if x < -4.1e9

   1. Initial program 99.6%

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

      1. +-commutative 99.6%

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

      2. unsub-neg 99.6%

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

      3. associate-*r/ 99.8%

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

      4. *-rgt-identity 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. Step-by-step derivation

      1. tan-quot 99.8%

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

      2. associate-/r/ 99.8%

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

   5. Applied egg-rr 99.8%

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

   6. Taylor expanded in x around inf 99.3%

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

      1. mul-1-neg 99.3%

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

      2. associate-*r/ 99.4%

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

      3. distribute-rgt-neg-in 99.4%

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

      4. distribute-neg-frac 99.4%

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

   8. Simplified 99.4%

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

   if -4.1e9 < x < 31

   1. Initial program 99.7%

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

      1. +-commutative 99.7%

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

      2. unsub-neg 99.7%

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

      3. associate-*r/ 99.8%

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

      4. *-rgt-identity 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. Step-by-step derivation

      1. tan-quot 99.8%

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

      2. associate-/r/ 99.8%

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

   5. Applied egg-rr 99.8%

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

   6. Taylor expanded in B around inf 99.8%

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

      1. *-commutative 99.8%

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

      2. div-sub 99.8%

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

      3. *-commutative 99.8%

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

   8. Simplified 99.8%

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

   9. Taylor expanded in B around 0 98.3%

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

   if 31 < x

   1. Initial program 99.4%

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

      1. +-commutative 99.4%

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

      2. unsub-neg 99.4%

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

      3. associate-*r/ 99.8%

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

      4. *-rgt-identity 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. Step-by-step derivation

      1. tan-quot 99.7%

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

      2. associate-/r/ 99.7%

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

   5. Applied egg-rr 99.7%

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

   6. Taylor expanded in x around inf 96.4%

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

      1. associate-*r/ 96.4%

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

      2. *-commutative 96.4%

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

      3. neg-mul-1 96.4%

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

      4. *-commutative 96.4%

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

      5. distribute-rgt-neg-in 96.4%

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

   8. Simplified 96.4%

      \[\leadsto \color{blue}{\frac{\cos B \cdot \left(-x\right)}{\sin B}} \]
3. Recombined 3 regimes into one program.

4. Final simplification 98.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -4100000000:\\ \;\;\;\;\cos B \cdot \frac{-x}{\sin B}\\ \mathbf{elif}\;x \leq 31:\\ \;\;\;\;\frac{1 - x}{\sin B}\\ \mathbf{else}:\\ \;\;\;\;\frac{\cos B \cdot \left(-x\right)}{\sin B}\\ \end{array} \]

Alternative 5: 86.0% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1.35 \cdot 10^{+81} \lor \neg \left(x \leq 3.1 \cdot 10^{+124}\right):\\ \;\;\;\;\left(B \cdot 0.16666666666666666 + \frac{1}{B}\right) - \frac{x}{\tan B}\\ \mathbf{else}:\\ \;\;\;\;\frac{1 - x}{\sin B}\\ \end{array} \end{array} \]

FPCore

(FPCore (B x)
 :precision binary64
 (if (or (<= x -1.35e+81) (not (<= x 3.1e+124)))
   (- (+ (* B 0.16666666666666666) (/ 1.0 B)) (/ x (tan B)))
   (/ (- 1.0 x) (sin B))))

C

double code(double B, double x) {
	double tmp;
	if ((x <= -1.35e+81) || !(x <= 3.1e+124)) {
		tmp = ((B * 0.16666666666666666) + (1.0 / B)) - (x / tan(B));
	} else {
		tmp = (1.0 - x) / 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.35d+81)) .or. (.not. (x <= 3.1d+124))) then
        tmp = ((b * 0.16666666666666666d0) + (1.0d0 / b)) - (x / tan(b))
    else
        tmp = (1.0d0 - x) / sin(b)
    end if
    code = tmp
end function

Java

public static double code(double B, double x) {
	double tmp;
	if ((x <= -1.35e+81) || !(x <= 3.1e+124)) {
		tmp = ((B * 0.16666666666666666) + (1.0 / B)) - (x / Math.tan(B));
	} else {
		tmp = (1.0 - x) / Math.sin(B);
	}
	return tmp;
}

Python

def code(B, x):
	tmp = 0
	if (x <= -1.35e+81) or not (x <= 3.1e+124):
		tmp = ((B * 0.16666666666666666) + (1.0 / B)) - (x / math.tan(B))
	else:
		tmp = (1.0 - x) / math.sin(B)
	return tmp

Julia

function code(B, x)
	tmp = 0.0
	if ((x <= -1.35e+81) || !(x <= 3.1e+124))
		tmp = Float64(Float64(Float64(B * 0.16666666666666666) + Float64(1.0 / B)) - Float64(x / tan(B)));
	else
		tmp = Float64(Float64(1.0 - x) / sin(B));
	end
	return tmp
end

MATLAB

function tmp_2 = code(B, x)
	tmp = 0.0;
	if ((x <= -1.35e+81) || ~((x <= 3.1e+124)))
		tmp = ((B * 0.16666666666666666) + (1.0 / B)) - (x / tan(B));
	else
		tmp = (1.0 - x) / sin(B);
	end
	tmp_2 = tmp;
end

Wolfram

code[B_, x_] := If[Or[LessEqual[x, -1.35e+81], N[Not[LessEqual[x, 3.1e+124]], $MachinePrecision]], N[(N[(N[(B * 0.16666666666666666), $MachinePrecision] + N[(1.0 / B), $MachinePrecision]), $MachinePrecision] - N[(x / N[Tan[B], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 - x), $MachinePrecision] / N[Sin[B], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -1.35e81 or 3.1000000000000002e124 < x

   1. Initial program 99.6%

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

      1. +-commutative 99.6%

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

      2. unsub-neg 99.6%

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

      3. associate-*r/ 99.8%

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

      4. *-rgt-identity 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. Taylor expanded in B around 0 76.7%

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

   if -1.35e81 < x < 3.1000000000000002e124

   1. Initial program 99.7%

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

      1. +-commutative 99.7%

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

      2. unsub-neg 99.7%

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

      3. associate-*r/ 99.8%

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

      4. *-rgt-identity 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. Step-by-step derivation

      1. tan-quot 99.8%

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

      2. associate-/r/ 99.8%

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

   5. Applied egg-rr 99.8%

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

   6. Taylor expanded in B around inf 99.8%

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

      1. *-commutative 99.8%

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

      2. div-sub 99.8%

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

      3. *-commutative 99.8%

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

   8. Simplified 99.8%

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

   9. Taylor expanded in B around 0 90.6%

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

4. Final simplification 86.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -1.35 \cdot 10^{+81} \lor \neg \left(x \leq 3.1 \cdot 10^{+124}\right):\\ \;\;\;\;\left(B \cdot 0.16666666666666666 + \frac{1}{B}\right) - \frac{x}{\tan B}\\ \mathbf{else}:\\ \;\;\;\;\frac{1 - x}{\sin B}\\ \end{array} \]

Alternative 6: 75.0% accurate, 2.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{1 - x}{B}\\ \mathbf{if}\;x \leq -6.8 \cdot 10^{-7}:\\ \;\;\;\;B \cdot \left(0.16666666666666666 + x \cdot 0.3333333333333333\right) + t_0\\ \mathbf{elif}\;x \leq 2.6 \cdot 10^{-7}:\\ \;\;\;\;\frac{1}{\sin B}\\ \mathbf{else}:\\ \;\;\;\;B \cdot 0.16666666666666666 + t_0\\ \end{array} \end{array} \]

FPCore

(FPCore (B x)
 :precision binary64
 (let* ((t_0 (/ (- 1.0 x) B)))
   (if (<= x -6.8e-7)
     (+ (* B (+ 0.16666666666666666 (* x 0.3333333333333333))) t_0)
     (if (<= x 2.6e-7) (/ 1.0 (sin B)) (+ (* B 0.16666666666666666) t_0)))))

C

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

Fortran

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

Java

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

Python

def code(B, x):
	t_0 = (1.0 - x) / B
	tmp = 0
	if x <= -6.8e-7:
		tmp = (B * (0.16666666666666666 + (x * 0.3333333333333333))) + t_0
	elif x <= 2.6e-7:
		tmp = 1.0 / math.sin(B)
	else:
		tmp = (B * 0.16666666666666666) + t_0
	return tmp

Julia

function code(B, x)
	t_0 = Float64(Float64(1.0 - x) / B)
	tmp = 0.0
	if (x <= -6.8e-7)
		tmp = Float64(Float64(B * Float64(0.16666666666666666 + Float64(x * 0.3333333333333333))) + t_0);
	elseif (x <= 2.6e-7)
		tmp = Float64(1.0 / sin(B));
	else
		tmp = Float64(Float64(B * 0.16666666666666666) + t_0);
	end
	return tmp
end

MATLAB

function tmp_2 = code(B, x)
	t_0 = (1.0 - x) / B;
	tmp = 0.0;
	if (x <= -6.8e-7)
		tmp = (B * (0.16666666666666666 + (x * 0.3333333333333333))) + t_0;
	elseif (x <= 2.6e-7)
		tmp = 1.0 / sin(B);
	else
		tmp = (B * 0.16666666666666666) + t_0;
	end
	tmp_2 = tmp;
end

Wolfram

code[B_, x_] := Block[{t$95$0 = N[(N[(1.0 - x), $MachinePrecision] / B), $MachinePrecision]}, If[LessEqual[x, -6.8e-7], N[(N[(B * N[(0.16666666666666666 + N[(x * 0.3333333333333333), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + t$95$0), $MachinePrecision], If[LessEqual[x, 2.6e-7], N[(1.0 / N[Sin[B], $MachinePrecision]), $MachinePrecision], N[(N[(B * 0.16666666666666666), $MachinePrecision] + t$95$0), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if x < -6.79999999999999948e-7

   1. Initial program 99.5%

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

      1. distribute-lft-neg-in 99.5%

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

   3. Simplified 99.5%

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

   4. Taylor expanded in B around 0 53.5%

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

      1. +-commutative 53.5%

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

      2. mul-1-neg 53.5%

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

      3. sub-neg 53.5%

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

      4. associate--l+ 53.5%

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

      5. *-commutative 53.5%

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

      6. *-commutative 53.5%

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

      7. div-sub 53.5%

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

   6. Simplified 53.5%

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

   if -6.79999999999999948e-7 < x < 2.59999999999999999e-7

   1. Initial program 99.8%

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

      1. distribute-lft-neg-in 99.8%

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

   3. Simplified 99.8%

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

   4. Taylor expanded in x around 0 98.6%

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

   if 2.59999999999999999e-7 < x

   1. Initial program 99.5%

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

      1. +-commutative 99.5%

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

      2. unsub-neg 99.5%

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

      3. associate-*r/ 99.9%

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

      4. *-rgt-identity 99.9%

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

   3. Simplified 99.9%

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

   4. Taylor expanded in B around 0 72.2%

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

   5. Taylor expanded in B around 0 54.3%

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

      1. associate--l+ 54.3%

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

      2. *-commutative 54.3%

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

      3. sub-div 54.3%

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

   7. Applied egg-rr 54.3%

      \[\leadsto \color{blue}{B \cdot 0.16666666666666666 + \frac{1 - x}{B}} \]
3. Recombined 3 regimes into one program.

4. Final simplification 76.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -6.8 \cdot 10^{-7}:\\ \;\;\;\;B \cdot \left(0.16666666666666666 + x \cdot 0.3333333333333333\right) + \frac{1 - x}{B}\\ \mathbf{elif}\;x \leq 2.6 \cdot 10^{-7}:\\ \;\;\;\;\frac{1}{\sin B}\\ \mathbf{else}:\\ \;\;\;\;B \cdot 0.16666666666666666 + \frac{1 - x}{B}\\ \end{array} \]

Alternative 7: 77.2% accurate, 2.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.6%

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

   1. +-commutative 99.6%

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

   2. unsub-neg 99.6%

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

   3. associate-*r/ 99.8%

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

   4. *-rgt-identity 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. Step-by-step derivation

   1. tan-quot 99.8%

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

   2. associate-/r/ 99.8%

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

5. Applied egg-rr 99.8%

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

6. Taylor expanded in B around inf 99.7%

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

   1. *-commutative 99.7%

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

   2. div-sub 99.7%

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

   3. *-commutative 99.7%

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

8. Simplified 99.7%

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

9. Taylor expanded in B around 0 78.6%

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

10. Final simplification 78.6%

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

Alternative 8: 51.8% accurate, 16.2× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.6%

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

   1. +-commutative 99.6%

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

   2. unsub-neg 99.6%

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

   3. associate-*r/ 99.8%

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

   4. *-rgt-identity 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. Taylor expanded in B around 0 62.1%

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

5. Taylor expanded in B around 0 52.6%

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

   1. *-commutative 52.6%

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

7. Simplified 52.6%

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

8. Taylor expanded in B around 0 52.8%

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

9. Final simplification 52.8%

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

Alternative 9: 50.4% accurate, 25.8× speedup

Math

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

FPCore

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

C

double code(double B, double x) {
	double tmp;
	if ((x <= -1.0) || !(x <= 32.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 <= (-1.0d0)) .or. (.not. (x <= 32.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 <= -1.0) || !(x <= 32.0)) {
		tmp = -x / B;
	} else {
		tmp = 1.0 / B;
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < -1 or 32 < x

   1. Initial program 99.5%

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

      1. distribute-lft-neg-in 99.5%

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

   3. Simplified 99.5%

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

   4. Taylor expanded in B around 0 53.1%

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

      1. mul-1-neg 53.1%

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

      2. sub-neg 53.1%

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

   6. Simplified 53.1%

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

   7. Taylor expanded in x around inf 52.6%

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

      1. neg-mul-1 52.6%

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

      2. distribute-neg-frac 52.6%

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

   9. Simplified 52.6%

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

   if -1 < x < 32

   1. Initial program 99.8%

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

      1. distribute-lft-neg-in 99.8%

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

   3. Simplified 99.8%

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

   4. Taylor expanded in B around 0 52.2%

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

      1. mul-1-neg 52.2%

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

      2. sub-neg 52.2%

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

   6. Simplified 52.2%

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

   7. Taylor expanded in x around 0 51.0%

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

4. Final simplification 51.8%

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

Alternative 10: 51.4% 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.6%

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

   1. distribute-lft-neg-in 99.6%

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

3. Simplified 99.6%

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

4. Taylor expanded in B around 0 52.6%

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

   1. mul-1-neg 52.6%

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

   2. sub-neg 52.6%

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

6. Simplified 52.6%

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

7. Final simplification 52.6%

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

Alternative 11: 3.2% accurate, 70.0× speedup

Math

\[\begin{array}{l} \\ B \cdot 0.16666666666666666 \end{array} \]

FPCore

(FPCore (B x) :precision binary64 (* B 0.16666666666666666))

C

double code(double B, double x) {
	return B * 0.16666666666666666;
}

Fortran

real(8) function code(b, x)
    real(8), intent (in) :: b
    real(8), intent (in) :: x
    code = b * 0.16666666666666666d0
end function

Java

public static double code(double B, double x) {
	return B * 0.16666666666666666;
}

Python

def code(B, x):
	return B * 0.16666666666666666

Julia

function code(B, x)
	return Float64(B * 0.16666666666666666)
end

MATLAB

function tmp = code(B, x)
	tmp = B * 0.16666666666666666;
end

Wolfram

code[B_, x_] := N[(B * 0.16666666666666666), $MachinePrecision]

Derivation

1. Initial program 99.6%

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

   1. +-commutative 99.6%

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

   2. unsub-neg 99.6%

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

   3. associate-*r/ 99.8%

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

   4. *-rgt-identity 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. Taylor expanded in B around 0 62.1%

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

5. Taylor expanded in B around inf 3.1%

   \[\leadsto \color{blue}{0.16666666666666666 \cdot B} \]
6. Step-by-step derivation

   1. *-commutative 3.1%

      \[\leadsto \color{blue}{B \cdot 0.16666666666666666} \]

7. Simplified 3.1%

   \[\leadsto \color{blue}{B \cdot 0.16666666666666666} \]

8. Final simplification 3.1%

   \[\leadsto B \cdot 0.16666666666666666 \]

Alternative 12: 26.9% 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.6%

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

   1. distribute-lft-neg-in 99.6%

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

3. Simplified 99.6%

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

4. Taylor expanded in B around 0 52.6%

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

   1. mul-1-neg 52.6%

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

   2. sub-neg 52.6%

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

6. Simplified 52.6%

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

7. Taylor expanded in x around 0 27.3%

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

8. Final simplification 27.3%

   \[\leadsto \frac{1}{B} \]

Reproduce

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