VandenBroeck and Keller, Equation (24)

Percentage Accurate: 99.7% → 99.8%

Time: 9.3s

Alternatives: 10

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.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} \]

   2. +-commutative 99.8%

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

   3. cancel-sign-sub-inv 99.8%

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

   4. *-commutative 99.8%

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

   5. *-commutative 99.8%

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

   6. associate-*r/ 99.9%

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

   7. *-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. Final simplification 99.9%

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

Alternative 2: 98.7% accurate, 1.9× speedup

Math

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

FPCore

(FPCore (B x)
 :precision binary64
 (if (or (<= x -21000.0) (not (<= x 5.8)))
   (/ (- 1.0 x) (tan B))
   (+ (/ 1.0 (sin B)) (* x (/ -1.0 B)))))

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < -21000 or 5.79999999999999982 < x

   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. distribute-lft-neg-in 99.7%

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

      4. distribute-rgt-neg-in 99.7%

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

   3. Simplified 99.7%

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

      1. distribute-rgt-neg-out 99.7%

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

      2. div-inv 99.9%

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

      3. sub-neg 99.9%

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

      4. clear-num 99.7%

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

      5. frac-sub 89.7%

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

      6. *-un-lft-identity 89.7%

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

      7. *-commutative 89.7%

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

      8. *-un-lft-identity 89.7%

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

   5. Applied egg-rr 89.7%

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

      1. associate-/r* 99.7%

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

      2. div-sub 99.7%

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

      3. *-inverses 99.7%

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

   7. Simplified 99.7%

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

   8. Taylor expanded in B around 0 98.7%

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

      1. div-sub 88.2%

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

      2. sub-neg 88.2%

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

      3. div-inv 84.4%

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

      4. clear-num 84.4%

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

      5. clear-num 84.6%

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

   10. Applied egg-rr 84.6%

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

       1. neg-mul-1 84.6%

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

       2. distribute-rgt-in 98.9%

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

       3. associate-*l/ 98.9%

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

       4. distribute-rgt-in 98.9%

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

       5. lft-mult-inverse 98.9%

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

       6. neg-mul-1 98.9%

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

       7. sub-neg 98.9%

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

   12. Simplified 98.9%

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

   if -21000 < x < 5.79999999999999982

   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} \]

      2. +-commutative 99.8%

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

      3. distribute-lft-neg-in 99.8%

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

      4. distribute-rgt-neg-in 99.8%

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

   3. Simplified 99.8%

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

   4. Taylor expanded in B around 0 99.0%

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

4. Final simplification 98.9%

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

Alternative 3: 98.8% accurate, 1.9× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < -1.1000000000000001 or 0.93999999999999995 < x

   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. distribute-lft-neg-in 99.7%

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

      4. distribute-rgt-neg-in 99.7%

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

   3. Simplified 99.7%

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

      1. distribute-rgt-neg-out 99.7%

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

      2. div-inv 99.9%

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

      3. sub-neg 99.9%

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

      4. clear-num 99.7%

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

      5. frac-sub 89.1%

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

      6. *-un-lft-identity 89.1%

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

      7. *-commutative 89.1%

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

      8. *-un-lft-identity 89.1%

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

   5. Applied egg-rr 89.1%

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

      1. associate-/r* 99.7%

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

      2. div-sub 99.7%

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

      3. *-inverses 99.7%

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

   7. Simplified 99.7%

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

   8. Taylor expanded in B around 0 98.7%

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

      1. div-sub 88.3%

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

      2. sub-neg 88.3%

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

      3. div-inv 84.5%

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

      4. clear-num 84.5%

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

      5. clear-num 84.7%

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

   10. Applied egg-rr 84.7%

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

       1. neg-mul-1 84.7%

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

       2. distribute-rgt-in 98.9%

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

       3. associate-*l/ 98.9%

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

       4. distribute-rgt-in 98.9%

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

       5. lft-mult-inverse 98.9%

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

       6. neg-mul-1 98.9%

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

       7. sub-neg 98.9%

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

   12. Simplified 98.9%

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

   if -1.1000000000000001 < x < 0.93999999999999995

   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} \]

      2. +-commutative 99.8%

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

      3. cancel-sign-sub-inv 99.8%

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

      4. *-commutative 99.8%

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

      5. *-commutative 99.8%

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

      6. associate-*r/ 99.8%

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

      7. *-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 98.9%

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

4. Final simplification 98.9%

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

Alternative 4: 98.6% accurate, 1.9× speedup

Math

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

FPCore

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

C

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

Python

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

Julia

function code(B, x)
	tmp = 0.0
	if ((x <= -300000000.0) || !(x <= 1.0))
		tmp = Float64(Float64(1.0 - 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 <= -300000000.0) || ~((x <= 1.0)))
		tmp = (1.0 - x) / tan(B);
	else
		tmp = (1.0 - x) / sin(B);
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < -3e8 or 1 < x

   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. distribute-lft-neg-in 99.7%

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

      4. distribute-rgt-neg-in 99.7%

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

   3. Simplified 99.7%

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

      1. distribute-rgt-neg-out 99.7%

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

      2. div-inv 99.9%

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

      3. sub-neg 99.9%

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

      4. clear-num 99.7%

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

      5. frac-sub 90.9%

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

      6. *-un-lft-identity 90.9%

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

      7. *-commutative 90.9%

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

      8. *-un-lft-identity 90.9%

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

   5. Applied egg-rr 90.9%

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

      1. associate-/r* 99.7%

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

      2. div-sub 99.7%

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

      3. *-inverses 99.7%

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

   7. Simplified 99.7%

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

   8. Taylor expanded in B around 0 98.7%

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

      1. div-sub 87.9%

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

      2. sub-neg 87.9%

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

      3. div-inv 84.1%

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

      4. clear-num 84.1%

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

      5. clear-num 84.3%

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

   10. Applied egg-rr 84.3%

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

       1. neg-mul-1 84.3%

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

       2. distribute-rgt-in 98.9%

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

       3. associate-*l/ 98.9%

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

       4. distribute-rgt-in 98.9%

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

       5. lft-mult-inverse 98.9%

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

       6. neg-mul-1 98.9%

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

       7. sub-neg 98.9%

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

   12. Simplified 98.9%

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

   if -3e8 < x < 1

   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} \]

      2. +-commutative 99.8%

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

      3. cancel-sign-sub-inv 99.8%

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

      4. *-commutative 99.8%

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

      5. *-commutative 99.8%

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

      6. associate-*r/ 99.8%

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

      7. *-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{x \cdot \cos B}{\sin B}} \]
   7. Step-by-step derivation

      1. div-sub 99.8%

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

   8. Simplified 99.8%

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

   9. Taylor expanded in B around 0 98.9%

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

4. Final simplification 98.9%

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

Alternative 5: 73.4% accurate, 2.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;B \leq -5.6 \cdot 10^{+34} \lor \neg \left(B \leq 0.315\right):\\ \;\;\;\;\frac{1}{\sin B}\\ \mathbf{else}:\\ \;\;\;\;B \cdot \left(0.16666666666666666 + x \cdot 0.3333333333333333\right) + \frac{1 - x}{B}\\ \end{array} \end{array} \]

FPCore

(FPCore (B x)
 :precision binary64
 (if (or (<= B -5.6e+34) (not (<= B 0.315)))
   (/ 1.0 (sin B))
   (+ (* B (+ 0.16666666666666666 (* x 0.3333333333333333))) (/ (- 1.0 x) B))))

C

double code(double B, double x) {
	double tmp;
	if ((B <= -5.6e+34) || !(B <= 0.315)) {
		tmp = 1.0 / sin(B);
	} else {
		tmp = (B * (0.16666666666666666 + (x * 0.3333333333333333))) + ((1.0 - x) / 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 <= (-5.6d+34)) .or. (.not. (b <= 0.315d0))) then
        tmp = 1.0d0 / sin(b)
    else
        tmp = (b * (0.16666666666666666d0 + (x * 0.3333333333333333d0))) + ((1.0d0 - x) / b)
    end if
    code = tmp
end function

Java

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

Python

def code(B, x):
	tmp = 0
	if (B <= -5.6e+34) or not (B <= 0.315):
		tmp = 1.0 / math.sin(B)
	else:
		tmp = (B * (0.16666666666666666 + (x * 0.3333333333333333))) + ((1.0 - x) / B)
	return tmp

Julia

function code(B, x)
	tmp = 0.0
	if ((B <= -5.6e+34) || !(B <= 0.315))
		tmp = Float64(1.0 / sin(B));
	else
		tmp = Float64(Float64(B * Float64(0.16666666666666666 + Float64(x * 0.3333333333333333))) + Float64(Float64(1.0 - x) / B));
	end
	return tmp
end

MATLAB

function tmp_2 = code(B, x)
	tmp = 0.0;
	if ((B <= -5.6e+34) || ~((B <= 0.315)))
		tmp = 1.0 / sin(B);
	else
		tmp = (B * (0.16666666666666666 + (x * 0.3333333333333333))) + ((1.0 - x) / B);
	end
	tmp_2 = tmp;
end

Wolfram

code[B_, x_] := If[Or[LessEqual[B, -5.6e+34], N[Not[LessEqual[B, 0.315]], $MachinePrecision]], N[(1.0 / N[Sin[B], $MachinePrecision]), $MachinePrecision], N[(N[(B * N[(0.16666666666666666 + N[(x * 0.3333333333333333), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(1.0 - x), $MachinePrecision] / B), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if B < -5.60000000000000016e34 or 0.315000000000000002 < B

   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. distribute-lft-neg-in 99.7%

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

      4. distribute-rgt-neg-in 99.7%

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

   3. Simplified 99.7%

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

   4. Taylor expanded in x around 0 54.7%

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

   if -5.60000000000000016e34 < B < 0.315000000000000002

   1. Initial program 99.9%

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

      1. distribute-lft-neg-in 99.9%

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

      2. +-commutative 99.9%

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

      3. distribute-lft-neg-in 99.9%

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

      4. distribute-rgt-neg-in 99.9%

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

   3. Simplified 99.9%

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

   4. Taylor expanded in B around 0 96.1%

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

      1. +-commutative 96.1%

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

      2. mul-1-neg 96.1%

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

      3. sub-neg 96.1%

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

      4. associate--l+ 96.1%

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

      5. *-commutative 96.1%

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

      6. div-sub 96.1%

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

   6. Simplified 96.1%

      \[\leadsto \color{blue}{B \cdot \left(0.16666666666666666 + x \cdot 0.3333333333333333\right) + \frac{1 - x}{B}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 77.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;B \leq -5.6 \cdot 10^{+34} \lor \neg \left(B \leq 0.315\right):\\ \;\;\;\;\frac{1}{\sin B}\\ \mathbf{else}:\\ \;\;\;\;B \cdot \left(0.16666666666666666 + x \cdot 0.3333333333333333\right) + \frac{1 - x}{B}\\ \end{array} \]

Alternative 6: 76.6% 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.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} \]

   2. +-commutative 99.8%

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

   3. cancel-sign-sub-inv 99.8%

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

   4. *-commutative 99.8%

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

   5. *-commutative 99.8%

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

   6. associate-*r/ 99.9%

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

   7. *-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. 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{x \cdot \cos B}{\sin B}} \]
7. Step-by-step derivation

   1. div-sub 99.8%

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

8. Simplified 99.8%

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

9. Taylor expanded in B around 0 79.2%

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

10. Final simplification 79.2%

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

Alternative 7: 51.7% accurate, 23.3× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

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} \]

   2. +-commutative 99.8%

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

   3. distribute-lft-neg-in 99.8%

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

   4. distribute-rgt-neg-in 99.8%

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

3. Simplified 99.8%

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

4. Taylor expanded in B around 0 77.6%

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

5. Taylor expanded in B around 0 54.7%

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

   1. neg-mul-1 54.7%

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

   2. +-commutative 54.7%

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

   3. associate-+r+ 54.7%

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

   4. +-commutative 54.7%

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

   5. sub-neg 54.7%

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

   6. div-sub 54.7%

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

   7. *-commutative 54.7%

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

7. Simplified 54.7%

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

8. Final simplification 54.7%

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

Alternative 8: 50.5% accurate, 25.8× speedup

Math

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

FPCore

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

C

double code(double B, double x) {
	double tmp;
	if ((x <= -2e-5) || !(x <= 2.4e-5)) {
		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 <= (-2d-5)) .or. (.not. (x <= 2.4d-5))) 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 <= -2e-5) || !(x <= 2.4e-5)) {
		tmp = -x / B;
	} else {
		tmp = 1.0 / B;
	}
	return tmp;
}

Python

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

Julia

function code(B, x)
	tmp = 0.0
	if ((x <= -2e-5) || !(x <= 2.4e-5))
		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 <= -2e-5) || ~((x <= 2.4e-5)))
		tmp = -x / B;
	else
		tmp = 1.0 / B;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < -2.00000000000000016e-5 or 2.4000000000000001e-5 < x

   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. distribute-lft-neg-in 99.7%

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

      4. distribute-rgt-neg-in 99.7%

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

   3. Simplified 99.7%

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

   4. Taylor expanded in B around 0 57.3%

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

      1. neg-mul-1 57.3%

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

      2. sub-neg 57.3%

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

   6. Simplified 57.3%

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

   7. Taylor expanded in x around inf 54.9%

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

      1. neg-mul-1 54.9%

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

      2. distribute-neg-frac 54.9%

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

   9. Simplified 54.9%

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

   if -2.00000000000000016e-5 < x < 2.4000000000000001e-5

   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} \]

      2. +-commutative 99.8%

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

      3. distribute-lft-neg-in 99.8%

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

      4. distribute-rgt-neg-in 99.8%

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

   3. Simplified 99.8%

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

   4. Taylor expanded in B around 0 51.1%

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

      1. neg-mul-1 51.1%

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

      2. sub-neg 51.1%

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

   6. Simplified 51.1%

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

   7. Taylor expanded in x around 0 50.5%

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

4. Final simplification 52.9%

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

Alternative 9: 51.5% 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.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} \]

   2. +-commutative 99.8%

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

   3. distribute-lft-neg-in 99.8%

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

   4. distribute-rgt-neg-in 99.8%

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

3. Simplified 99.8%

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

4. Taylor expanded in B around 0 54.4%

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

   1. neg-mul-1 54.4%

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

   2. sub-neg 54.4%

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

6. Simplified 54.4%

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

7. Final simplification 54.4%

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

Alternative 10: 27.0% 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.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} \]

   2. +-commutative 99.8%

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

   3. distribute-lft-neg-in 99.8%

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

   4. distribute-rgt-neg-in 99.8%

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

3. Simplified 99.8%

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

4. Taylor expanded in B around 0 54.4%

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

   1. neg-mul-1 54.4%

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

   2. sub-neg 54.4%

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

6. Simplified 54.4%

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

7. Taylor expanded in x around 0 25.4%

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

8. Final simplification 25.4%

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

Reproduce

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