Equirectangular approximation to distance on a great circle

Percentage Accurate: 59.2% → 91.5%

Time: 10.4s

Alternatives: 10

Speedup: 7.7×

• 29.9% of points produce a very large (infinite) output. You may want to add a precondition.

Specification

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_1 + \phi_2}{2}\right)\\ R \cdot \sqrt{t\_0 \cdot t\_0 + \left(\phi_1 - \phi_2\right) \cdot \left(\phi_1 - \phi_2\right)} \end{array} \end{array} \]

FPCore

(FPCore (R lambda1 lambda2 phi1 phi2)
 :precision binary64
 (let* ((t_0 (* (- lambda1 lambda2) (cos (/ (+ phi1 phi2) 2.0)))))
   (* R (sqrt (+ (* t_0 t_0) (* (- phi1 phi2) (- phi1 phi2)))))))

C

double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	double t_0 = (lambda1 - lambda2) * cos(((phi1 + phi2) / 2.0));
	return R * sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2))));
}

Fortran

real(8) function code(r, lambda1, lambda2, phi1, phi2)
    real(8), intent (in) :: r
    real(8), intent (in) :: lambda1
    real(8), intent (in) :: lambda2
    real(8), intent (in) :: phi1
    real(8), intent (in) :: phi2
    real(8) :: t_0
    t_0 = (lambda1 - lambda2) * cos(((phi1 + phi2) / 2.0d0))
    code = r * sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2))))
end function

Java

public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	double t_0 = (lambda1 - lambda2) * Math.cos(((phi1 + phi2) / 2.0));
	return R * Math.sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2))));
}

Python

def code(R, lambda1, lambda2, phi1, phi2):
	t_0 = (lambda1 - lambda2) * math.cos(((phi1 + phi2) / 2.0))
	return R * math.sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2))))

Julia

function code(R, lambda1, lambda2, phi1, phi2)
	t_0 = Float64(Float64(lambda1 - lambda2) * cos(Float64(Float64(phi1 + phi2) / 2.0)))
	return Float64(R * sqrt(Float64(Float64(t_0 * t_0) + Float64(Float64(phi1 - phi2) * Float64(phi1 - phi2)))))
end

MATLAB

function tmp = code(R, lambda1, lambda2, phi1, phi2)
	t_0 = (lambda1 - lambda2) * cos(((phi1 + phi2) / 2.0));
	tmp = R * sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2))));
end

Wolfram

code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(N[(lambda1 - lambda2), $MachinePrecision] * N[Cos[N[(N[(phi1 + phi2), $MachinePrecision] / 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, N[(R * N[Sqrt[N[(N[(t$95$0 * t$95$0), $MachinePrecision] + N[(N[(phi1 - phi2), $MachinePrecision] * N[(phi1 - phi2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]

Initial Program: 59.2% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_1 + \phi_2}{2}\right)\\ R \cdot \sqrt{t\_0 \cdot t\_0 + \left(\phi_1 - \phi_2\right) \cdot \left(\phi_1 - \phi_2\right)} \end{array} \end{array} \]

FPCore

(FPCore (R lambda1 lambda2 phi1 phi2)
 :precision binary64
 (let* ((t_0 (* (- lambda1 lambda2) (cos (/ (+ phi1 phi2) 2.0)))))
   (* R (sqrt (+ (* t_0 t_0) (* (- phi1 phi2) (- phi1 phi2)))))))

C

double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	double t_0 = (lambda1 - lambda2) * cos(((phi1 + phi2) / 2.0));
	return R * sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2))));
}

Fortran

real(8) function code(r, lambda1, lambda2, phi1, phi2)
    real(8), intent (in) :: r
    real(8), intent (in) :: lambda1
    real(8), intent (in) :: lambda2
    real(8), intent (in) :: phi1
    real(8), intent (in) :: phi2
    real(8) :: t_0
    t_0 = (lambda1 - lambda2) * cos(((phi1 + phi2) / 2.0d0))
    code = r * sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2))))
end function

Java

public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	double t_0 = (lambda1 - lambda2) * Math.cos(((phi1 + phi2) / 2.0));
	return R * Math.sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2))));
}

Python

def code(R, lambda1, lambda2, phi1, phi2):
	t_0 = (lambda1 - lambda2) * math.cos(((phi1 + phi2) / 2.0))
	return R * math.sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2))))

Julia

function code(R, lambda1, lambda2, phi1, phi2)
	t_0 = Float64(Float64(lambda1 - lambda2) * cos(Float64(Float64(phi1 + phi2) / 2.0)))
	return Float64(R * sqrt(Float64(Float64(t_0 * t_0) + Float64(Float64(phi1 - phi2) * Float64(phi1 - phi2)))))
end

MATLAB

function tmp = code(R, lambda1, lambda2, phi1, phi2)
	t_0 = (lambda1 - lambda2) * cos(((phi1 + phi2) / 2.0));
	tmp = R * sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2))));
end

Wolfram

code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(N[(lambda1 - lambda2), $MachinePrecision] * N[Cos[N[(N[(phi1 + phi2), $MachinePrecision] / 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, N[(R * N[Sqrt[N[(N[(t$95$0 * t$95$0), $MachinePrecision] + N[(N[(phi1 - phi2), $MachinePrecision] * N[(phi1 - phi2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]

Alternative 1: 91.5% accurate, 0.5× speedup

Math

\[\begin{array}{l} [R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\\\ [R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\ \\ \begin{array}{l} t_0 := \cos \left(0.5 \cdot \phi_1\right)\\ \mathbf{if}\;\phi_2 \leq 3.1 \cdot 10^{-5}:\\ \;\;\;\;\mathsf{hypot}\left(t\_0 \cdot \left(\lambda_1 - \lambda_2\right), \phi_1\right) \cdot R\\ \mathbf{else}:\\ \;\;\;\;\mathsf{hypot}\left(\left(\cos \left(0.5 \cdot \phi_2\right) \cdot t\_0 - \sin \left(0.5 \cdot \phi_1\right) \cdot \sin \left(0.5 \cdot \phi_2\right)\right) \cdot \lambda_2, \phi_1 - \phi_2\right) \cdot R\\ \end{array} \end{array} \]

FPCore

NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
 :precision binary64
 (let* ((t_0 (cos (* 0.5 phi1))))
   (if (<= phi2 3.1e-5)
     (* (hypot (* t_0 (- lambda1 lambda2)) phi1) R)
     (*
      (hypot
       (*
        (-
         (* (cos (* 0.5 phi2)) t_0)
         (* (sin (* 0.5 phi1)) (sin (* 0.5 phi2))))
        lambda2)
       (- phi1 phi2))
      R))))

C

assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	double t_0 = cos((0.5 * phi1));
	double tmp;
	if (phi2 <= 3.1e-5) {
		tmp = hypot((t_0 * (lambda1 - lambda2)), phi1) * R;
	} else {
		tmp = hypot((((cos((0.5 * phi2)) * t_0) - (sin((0.5 * phi1)) * sin((0.5 * phi2)))) * lambda2), (phi1 - phi2)) * R;
	}
	return tmp;
}

Java

assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	double t_0 = Math.cos((0.5 * phi1));
	double tmp;
	if (phi2 <= 3.1e-5) {
		tmp = Math.hypot((t_0 * (lambda1 - lambda2)), phi1) * R;
	} else {
		tmp = Math.hypot((((Math.cos((0.5 * phi2)) * t_0) - (Math.sin((0.5 * phi1)) * Math.sin((0.5 * phi2)))) * lambda2), (phi1 - phi2)) * R;
	}
	return tmp;
}

Python

[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2])
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2])
def code(R, lambda1, lambda2, phi1, phi2):
	t_0 = math.cos((0.5 * phi1))
	tmp = 0
	if phi2 <= 3.1e-5:
		tmp = math.hypot((t_0 * (lambda1 - lambda2)), phi1) * R
	else:
		tmp = math.hypot((((math.cos((0.5 * phi2)) * t_0) - (math.sin((0.5 * phi1)) * math.sin((0.5 * phi2)))) * lambda2), (phi1 - phi2)) * R
	return tmp

Julia

R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2])
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2])
function code(R, lambda1, lambda2, phi1, phi2)
	t_0 = cos(Float64(0.5 * phi1))
	tmp = 0.0
	if (phi2 <= 3.1e-5)
		tmp = Float64(hypot(Float64(t_0 * Float64(lambda1 - lambda2)), phi1) * R);
	else
		tmp = Float64(hypot(Float64(Float64(Float64(cos(Float64(0.5 * phi2)) * t_0) - Float64(sin(Float64(0.5 * phi1)) * sin(Float64(0.5 * phi2)))) * lambda2), Float64(phi1 - phi2)) * R);
	end
	return tmp
end

MATLAB

R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
	t_0 = cos((0.5 * phi1));
	tmp = 0.0;
	if (phi2 <= 3.1e-5)
		tmp = hypot((t_0 * (lambda1 - lambda2)), phi1) * R;
	else
		tmp = hypot((((cos((0.5 * phi2)) * t_0) - (sin((0.5 * phi1)) * sin((0.5 * phi2)))) * lambda2), (phi1 - phi2)) * R;
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[Cos[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[phi2, 3.1e-5], N[(N[Sqrt[N[(t$95$0 * N[(lambda1 - lambda2), $MachinePrecision]), $MachinePrecision] ^ 2 + phi1 ^ 2], $MachinePrecision] * R), $MachinePrecision], N[(N[Sqrt[N[(N[(N[(N[Cos[N[(0.5 * phi2), $MachinePrecision]], $MachinePrecision] * t$95$0), $MachinePrecision] - N[(N[Sin[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision] * N[Sin[N[(0.5 * phi2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * lambda2), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision] * R), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if phi2 < 3.10000000000000014e-5

   1. Initial program 63.6%

      \[R \cdot \sqrt{\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_1 + \phi_2}{2}\right)\right) \cdot \left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_1 + \phi_2}{2}\right)\right) + \left(\phi_1 - \phi_2\right) \cdot \left(\phi_1 - \phi_2\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in phi2 around 0

      \[\leadsto R \cdot \color{blue}{\sqrt{{\cos \left(\frac{1}{2} \cdot \phi_1\right)}^{2} \cdot {\left(\lambda_1 - \lambda_2\right)}^{2} + {\phi_1}^{2}}} \]
   4. Step-by-step derivation

      1. unpow2 N/A

         \[\leadsto R \cdot \sqrt{\color{blue}{\left(\cos \left(\frac{1}{2} \cdot \phi_1\right) \cdot \cos \left(\frac{1}{2} \cdot \phi_1\right)\right)} \cdot {\left(\lambda_1 - \lambda_2\right)}^{2} + {\phi_1}^{2}} \]

      2. unpow2 N/A

         \[\leadsto R \cdot \sqrt{\left(\cos \left(\frac{1}{2} \cdot \phi_1\right) \cdot \cos \left(\frac{1}{2} \cdot \phi_1\right)\right) \cdot \color{blue}{\left(\left(\lambda_1 - \lambda_2\right) \cdot \left(\lambda_1 - \lambda_2\right)\right)} + {\phi_1}^{2}} \]

      3. unswap-sqr N/A

         \[\leadsto R \cdot \sqrt{\color{blue}{\left(\cos \left(\frac{1}{2} \cdot \phi_1\right) \cdot \left(\lambda_1 - \lambda_2\right)\right) \cdot \left(\cos \left(\frac{1}{2} \cdot \phi_1\right) \cdot \left(\lambda_1 - \lambda_2\right)\right)} + {\phi_1}^{2}} \]

      4. unpow2 N/A

         \[\leadsto R \cdot \sqrt{\left(\cos \left(\frac{1}{2} \cdot \phi_1\right) \cdot \left(\lambda_1 - \lambda_2\right)\right) \cdot \left(\cos \left(\frac{1}{2} \cdot \phi_1\right) \cdot \left(\lambda_1 - \lambda_2\right)\right) + \color{blue}{\phi_1 \cdot \phi_1}} \]

      5. lower-hypot.f64 N/A

         \[\leadsto R \cdot \color{blue}{\mathsf{hypot}\left(\cos \left(\frac{1}{2} \cdot \phi_1\right) \cdot \left(\lambda_1 - \lambda_2\right), \phi_1\right)} \]

      6. *-commutative N/A

         \[\leadsto R \cdot \mathsf{hypot}\left(\color{blue}{\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{1}{2} \cdot \phi_1\right)}, \phi_1\right) \]

      7. lower-*.f64 N/A

         \[\leadsto R \cdot \mathsf{hypot}\left(\color{blue}{\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{1}{2} \cdot \phi_1\right)}, \phi_1\right) \]

      8. lower--.f64 N/A

         \[\leadsto R \cdot \mathsf{hypot}\left(\color{blue}{\left(\lambda_1 - \lambda_2\right)} \cdot \cos \left(\frac{1}{2} \cdot \phi_1\right), \phi_1\right) \]

      9. lower-cos.f64 N/A

         \[\leadsto R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \color{blue}{\cos \left(\frac{1}{2} \cdot \phi_1\right)}, \phi_1\right) \]

      10. *-commutative N/A

          \[\leadsto R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \color{blue}{\left(\phi_1 \cdot \frac{1}{2}\right)}, \phi_1\right) \]

      11. lower-*.f64 74.3

          \[\leadsto R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \color{blue}{\left(\phi_1 \cdot 0.5\right)}, \phi_1\right) \]

   5. Applied rewrites 74.3%

      \[\leadsto R \cdot \color{blue}{\mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\phi_1 \cdot 0.5\right), \phi_1\right)} \]

   if 3.10000000000000014e-5 < phi2

   1. Initial program 54.1%

      \[R \cdot \sqrt{\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_1 + \phi_2}{2}\right)\right) \cdot \left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_1 + \phi_2}{2}\right)\right) + \left(\phi_1 - \phi_2\right) \cdot \left(\phi_1 - \phi_2\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in lambda1 around 0

      \[\leadsto R \cdot \color{blue}{\sqrt{{\lambda_2}^{2} \cdot {\cos \left(\frac{1}{2} \cdot \left(\phi_1 + \phi_2\right)\right)}^{2} + {\left(\phi_1 - \phi_2\right)}^{2}}} \]
   4. Step-by-step derivation

      1. unpow2 N/A

         \[\leadsto R \cdot \sqrt{\color{blue}{\left(\lambda_2 \cdot \lambda_2\right)} \cdot {\cos \left(\frac{1}{2} \cdot \left(\phi_1 + \phi_2\right)\right)}^{2} + {\left(\phi_1 - \phi_2\right)}^{2}} \]

      2. unpow2 N/A

         \[\leadsto R \cdot \sqrt{\left(\lambda_2 \cdot \lambda_2\right) \cdot \color{blue}{\left(\cos \left(\frac{1}{2} \cdot \left(\phi_1 + \phi_2\right)\right) \cdot \cos \left(\frac{1}{2} \cdot \left(\phi_1 + \phi_2\right)\right)\right)} + {\left(\phi_1 - \phi_2\right)}^{2}} \]

      3. unswap-sqr N/A

         \[\leadsto R \cdot \sqrt{\color{blue}{\left(\lambda_2 \cdot \cos \left(\frac{1}{2} \cdot \left(\phi_1 + \phi_2\right)\right)\right) \cdot \left(\lambda_2 \cdot \cos \left(\frac{1}{2} \cdot \left(\phi_1 + \phi_2\right)\right)\right)} + {\left(\phi_1 - \phi_2\right)}^{2}} \]

      4. unpow2 N/A

         \[\leadsto R \cdot \sqrt{\left(\lambda_2 \cdot \cos \left(\frac{1}{2} \cdot \left(\phi_1 + \phi_2\right)\right)\right) \cdot \left(\lambda_2 \cdot \cos \left(\frac{1}{2} \cdot \left(\phi_1 + \phi_2\right)\right)\right) + \color{blue}{\left(\phi_1 - \phi_2\right) \cdot \left(\phi_1 - \phi_2\right)}} \]

      5. lower-hypot.f64 N/A

         \[\leadsto R \cdot \color{blue}{\mathsf{hypot}\left(\lambda_2 \cdot \cos \left(\frac{1}{2} \cdot \left(\phi_1 + \phi_2\right)\right), \phi_1 - \phi_2\right)} \]

      6. *-commutative N/A

         \[\leadsto R \cdot \mathsf{hypot}\left(\color{blue}{\cos \left(\frac{1}{2} \cdot \left(\phi_1 + \phi_2\right)\right) \cdot \lambda_2}, \phi_1 - \phi_2\right) \]

      7. lower-*.f64 N/A

         \[\leadsto R \cdot \mathsf{hypot}\left(\color{blue}{\cos \left(\frac{1}{2} \cdot \left(\phi_1 + \phi_2\right)\right) \cdot \lambda_2}, \phi_1 - \phi_2\right) \]

      8. lower-cos.f64 N/A

         \[\leadsto R \cdot \mathsf{hypot}\left(\color{blue}{\cos \left(\frac{1}{2} \cdot \left(\phi_1 + \phi_2\right)\right)} \cdot \lambda_2, \phi_1 - \phi_2\right) \]

      9. *-commutative N/A

         \[\leadsto R \cdot \mathsf{hypot}\left(\cos \color{blue}{\left(\left(\phi_1 + \phi_2\right) \cdot \frac{1}{2}\right)} \cdot \lambda_2, \phi_1 - \phi_2\right) \]

      10. lower-*.f64 N/A

          \[\leadsto R \cdot \mathsf{hypot}\left(\cos \color{blue}{\left(\left(\phi_1 + \phi_2\right) \cdot \frac{1}{2}\right)} \cdot \lambda_2, \phi_1 - \phi_2\right) \]

      11. +-commutative N/A

          \[\leadsto R \cdot \mathsf{hypot}\left(\cos \left(\color{blue}{\left(\phi_2 + \phi_1\right)} \cdot \frac{1}{2}\right) \cdot \lambda_2, \phi_1 - \phi_2\right) \]

      12. lower-+.f64 N/A

          \[\leadsto R \cdot \mathsf{hypot}\left(\cos \left(\color{blue}{\left(\phi_2 + \phi_1\right)} \cdot \frac{1}{2}\right) \cdot \lambda_2, \phi_1 - \phi_2\right) \]

      13. lower--.f64 77.2

          \[\leadsto R \cdot \mathsf{hypot}\left(\cos \left(\left(\phi_2 + \phi_1\right) \cdot 0.5\right) \cdot \lambda_2, \color{blue}{\phi_1 - \phi_2}\right) \]

   5. Applied rewrites 77.2%

      \[\leadsto R \cdot \color{blue}{\mathsf{hypot}\left(\cos \left(\left(\phi_2 + \phi_1\right) \cdot 0.5\right) \cdot \lambda_2, \phi_1 - \phi_2\right)} \]
   6. Step-by-step derivation

   7. Applied rewrites 80.5%

      \[\leadsto R \cdot \mathsf{hypot}\left(\left(\cos \left(\phi_2 \cdot 0.5\right) \cdot \cos \left(\phi_1 \cdot 0.5\right) - \sin \left(\phi_2 \cdot 0.5\right) \cdot \sin \left(\phi_1 \cdot 0.5\right)\right) \cdot \lambda_2, \phi_1 - \phi_2\right) \]
3. Recombined 2 regimes into one program.

4. Final simplification 76.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\phi_2 \leq 3.1 \cdot 10^{-5}:\\ \;\;\;\;\mathsf{hypot}\left(\cos \left(0.5 \cdot \phi_1\right) \cdot \left(\lambda_1 - \lambda_2\right), \phi_1\right) \cdot R\\ \mathbf{else}:\\ \;\;\;\;\mathsf{hypot}\left(\left(\cos \left(0.5 \cdot \phi_2\right) \cdot \cos \left(0.5 \cdot \phi_1\right) - \sin \left(0.5 \cdot \phi_1\right) \cdot \sin \left(0.5 \cdot \phi_2\right)\right) \cdot \lambda_2, \phi_1 - \phi_2\right) \cdot R\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 90.1% accurate, 1.2× speedup

Math

\[\begin{array}{l} [R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\\\ [R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\ \\ \begin{array}{l} \mathbf{if}\;\phi_1 \leq -1.35 \cdot 10^{-64}:\\ \;\;\;\;\mathsf{hypot}\left(\cos \left(0.5 \cdot \phi_1\right) \cdot \left(\lambda_1 - \lambda_2\right), \phi_1\right) \cdot R\\ \mathbf{else}:\\ \;\;\;\;\mathsf{hypot}\left(\cos \left(0.5 \cdot \phi_2\right) \cdot \left(\lambda_1 - \lambda_2\right), \phi_2\right) \cdot R\\ \end{array} \end{array} \]

FPCore

NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
 :precision binary64
 (if (<= phi1 -1.35e-64)
   (* (hypot (* (cos (* 0.5 phi1)) (- lambda1 lambda2)) phi1) R)
   (* (hypot (* (cos (* 0.5 phi2)) (- lambda1 lambda2)) phi2) R)))

C

assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	double tmp;
	if (phi1 <= -1.35e-64) {
		tmp = hypot((cos((0.5 * phi1)) * (lambda1 - lambda2)), phi1) * R;
	} else {
		tmp = hypot((cos((0.5 * phi2)) * (lambda1 - lambda2)), phi2) * R;
	}
	return tmp;
}

Java

assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	double tmp;
	if (phi1 <= -1.35e-64) {
		tmp = Math.hypot((Math.cos((0.5 * phi1)) * (lambda1 - lambda2)), phi1) * R;
	} else {
		tmp = Math.hypot((Math.cos((0.5 * phi2)) * (lambda1 - lambda2)), phi2) * R;
	}
	return tmp;
}

Python

[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2])
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2])
def code(R, lambda1, lambda2, phi1, phi2):
	tmp = 0
	if phi1 <= -1.35e-64:
		tmp = math.hypot((math.cos((0.5 * phi1)) * (lambda1 - lambda2)), phi1) * R
	else:
		tmp = math.hypot((math.cos((0.5 * phi2)) * (lambda1 - lambda2)), phi2) * R
	return tmp

Julia

R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2])
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2])
function code(R, lambda1, lambda2, phi1, phi2)
	tmp = 0.0
	if (phi1 <= -1.35e-64)
		tmp = Float64(hypot(Float64(cos(Float64(0.5 * phi1)) * Float64(lambda1 - lambda2)), phi1) * R);
	else
		tmp = Float64(hypot(Float64(cos(Float64(0.5 * phi2)) * Float64(lambda1 - lambda2)), phi2) * R);
	end
	return tmp
end

MATLAB

R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
	tmp = 0.0;
	if (phi1 <= -1.35e-64)
		tmp = hypot((cos((0.5 * phi1)) * (lambda1 - lambda2)), phi1) * R;
	else
		tmp = hypot((cos((0.5 * phi2)) * (lambda1 - lambda2)), phi2) * R;
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi1, -1.35e-64], N[(N[Sqrt[N[(N[Cos[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision] * N[(lambda1 - lambda2), $MachinePrecision]), $MachinePrecision] ^ 2 + phi1 ^ 2], $MachinePrecision] * R), $MachinePrecision], N[(N[Sqrt[N[(N[Cos[N[(0.5 * phi2), $MachinePrecision]], $MachinePrecision] * N[(lambda1 - lambda2), $MachinePrecision]), $MachinePrecision] ^ 2 + phi2 ^ 2], $MachinePrecision] * R), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if phi1 < -1.34999999999999993e-64

   1. Initial program 65.4%

      \[R \cdot \sqrt{\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_1 + \phi_2}{2}\right)\right) \cdot \left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_1 + \phi_2}{2}\right)\right) + \left(\phi_1 - \phi_2\right) \cdot \left(\phi_1 - \phi_2\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in phi2 around 0

      \[\leadsto R \cdot \color{blue}{\sqrt{{\cos \left(\frac{1}{2} \cdot \phi_1\right)}^{2} \cdot {\left(\lambda_1 - \lambda_2\right)}^{2} + {\phi_1}^{2}}} \]
   4. Step-by-step derivation

      1. unpow2 N/A

         \[\leadsto R \cdot \sqrt{\color{blue}{\left(\cos \left(\frac{1}{2} \cdot \phi_1\right) \cdot \cos \left(\frac{1}{2} \cdot \phi_1\right)\right)} \cdot {\left(\lambda_1 - \lambda_2\right)}^{2} + {\phi_1}^{2}} \]

      2. unpow2 N/A

         \[\leadsto R \cdot \sqrt{\left(\cos \left(\frac{1}{2} \cdot \phi_1\right) \cdot \cos \left(\frac{1}{2} \cdot \phi_1\right)\right) \cdot \color{blue}{\left(\left(\lambda_1 - \lambda_2\right) \cdot \left(\lambda_1 - \lambda_2\right)\right)} + {\phi_1}^{2}} \]

      3. unswap-sqr N/A

         \[\leadsto R \cdot \sqrt{\color{blue}{\left(\cos \left(\frac{1}{2} \cdot \phi_1\right) \cdot \left(\lambda_1 - \lambda_2\right)\right) \cdot \left(\cos \left(\frac{1}{2} \cdot \phi_1\right) \cdot \left(\lambda_1 - \lambda_2\right)\right)} + {\phi_1}^{2}} \]

      4. unpow2 N/A

         \[\leadsto R \cdot \sqrt{\left(\cos \left(\frac{1}{2} \cdot \phi_1\right) \cdot \left(\lambda_1 - \lambda_2\right)\right) \cdot \left(\cos \left(\frac{1}{2} \cdot \phi_1\right) \cdot \left(\lambda_1 - \lambda_2\right)\right) + \color{blue}{\phi_1 \cdot \phi_1}} \]

      5. lower-hypot.f64 N/A

         \[\leadsto R \cdot \color{blue}{\mathsf{hypot}\left(\cos \left(\frac{1}{2} \cdot \phi_1\right) \cdot \left(\lambda_1 - \lambda_2\right), \phi_1\right)} \]

      6. *-commutative N/A

         \[\leadsto R \cdot \mathsf{hypot}\left(\color{blue}{\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{1}{2} \cdot \phi_1\right)}, \phi_1\right) \]

      7. lower-*.f64 N/A

         \[\leadsto R \cdot \mathsf{hypot}\left(\color{blue}{\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{1}{2} \cdot \phi_1\right)}, \phi_1\right) \]

      8. lower--.f64 N/A

         \[\leadsto R \cdot \mathsf{hypot}\left(\color{blue}{\left(\lambda_1 - \lambda_2\right)} \cdot \cos \left(\frac{1}{2} \cdot \phi_1\right), \phi_1\right) \]

      9. lower-cos.f64 N/A

         \[\leadsto R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \color{blue}{\cos \left(\frac{1}{2} \cdot \phi_1\right)}, \phi_1\right) \]

      10. *-commutative N/A

          \[\leadsto R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \color{blue}{\left(\phi_1 \cdot \frac{1}{2}\right)}, \phi_1\right) \]

      11. lower-*.f64 77.3

          \[\leadsto R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \color{blue}{\left(\phi_1 \cdot 0.5\right)}, \phi_1\right) \]

   5. Applied rewrites 77.3%

      \[\leadsto R \cdot \color{blue}{\mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\phi_1 \cdot 0.5\right), \phi_1\right)} \]

   if -1.34999999999999993e-64 < phi1

   1. Initial program 59.2%

      \[R \cdot \sqrt{\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_1 + \phi_2}{2}\right)\right) \cdot \left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_1 + \phi_2}{2}\right)\right) + \left(\phi_1 - \phi_2\right) \cdot \left(\phi_1 - \phi_2\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in phi1 around 0

      \[\leadsto R \cdot \color{blue}{\sqrt{{\cos \left(\frac{1}{2} \cdot \phi_2\right)}^{2} \cdot {\left(\lambda_1 - \lambda_2\right)}^{2} + {\phi_2}^{2}}} \]
   4. Step-by-step derivation

      1. unpow2 N/A

         \[\leadsto R \cdot \sqrt{\color{blue}{\left(\cos \left(\frac{1}{2} \cdot \phi_2\right) \cdot \cos \left(\frac{1}{2} \cdot \phi_2\right)\right)} \cdot {\left(\lambda_1 - \lambda_2\right)}^{2} + {\phi_2}^{2}} \]

      2. unpow2 N/A

         \[\leadsto R \cdot \sqrt{\left(\cos \left(\frac{1}{2} \cdot \phi_2\right) \cdot \cos \left(\frac{1}{2} \cdot \phi_2\right)\right) \cdot \color{blue}{\left(\left(\lambda_1 - \lambda_2\right) \cdot \left(\lambda_1 - \lambda_2\right)\right)} + {\phi_2}^{2}} \]

      3. unswap-sqr N/A

         \[\leadsto R \cdot \sqrt{\color{blue}{\left(\cos \left(\frac{1}{2} \cdot \phi_2\right) \cdot \left(\lambda_1 - \lambda_2\right)\right) \cdot \left(\cos \left(\frac{1}{2} \cdot \phi_2\right) \cdot \left(\lambda_1 - \lambda_2\right)\right)} + {\phi_2}^{2}} \]

      4. unpow2 N/A

         \[\leadsto R \cdot \sqrt{\left(\cos \left(\frac{1}{2} \cdot \phi_2\right) \cdot \left(\lambda_1 - \lambda_2\right)\right) \cdot \left(\cos \left(\frac{1}{2} \cdot \phi_2\right) \cdot \left(\lambda_1 - \lambda_2\right)\right) + \color{blue}{\phi_2 \cdot \phi_2}} \]

      5. lower-hypot.f64 N/A

         \[\leadsto R \cdot \color{blue}{\mathsf{hypot}\left(\cos \left(\frac{1}{2} \cdot \phi_2\right) \cdot \left(\lambda_1 - \lambda_2\right), \phi_2\right)} \]

      6. lower-*.f64 N/A

         \[\leadsto R \cdot \mathsf{hypot}\left(\color{blue}{\cos \left(\frac{1}{2} \cdot \phi_2\right) \cdot \left(\lambda_1 - \lambda_2\right)}, \phi_2\right) \]

      7. lower-cos.f64 N/A

         \[\leadsto R \cdot \mathsf{hypot}\left(\color{blue}{\cos \left(\frac{1}{2} \cdot \phi_2\right)} \cdot \left(\lambda_1 - \lambda_2\right), \phi_2\right) \]

      8. *-commutative N/A

         \[\leadsto R \cdot \mathsf{hypot}\left(\cos \color{blue}{\left(\phi_2 \cdot \frac{1}{2}\right)} \cdot \left(\lambda_1 - \lambda_2\right), \phi_2\right) \]

      9. lower-*.f64 N/A

         \[\leadsto R \cdot \mathsf{hypot}\left(\cos \color{blue}{\left(\phi_2 \cdot \frac{1}{2}\right)} \cdot \left(\lambda_1 - \lambda_2\right), \phi_2\right) \]

      10. lower--.f64 81.1

          \[\leadsto R \cdot \mathsf{hypot}\left(\cos \left(\phi_2 \cdot 0.5\right) \cdot \color{blue}{\left(\lambda_1 - \lambda_2\right)}, \phi_2\right) \]

   5. Applied rewrites 81.1%

      \[\leadsto R \cdot \color{blue}{\mathsf{hypot}\left(\cos \left(\phi_2 \cdot 0.5\right) \cdot \left(\lambda_1 - \lambda_2\right), \phi_2\right)} \]
3. Recombined 2 regimes into one program.

4. Final simplification 80.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\phi_1 \leq -1.35 \cdot 10^{-64}:\\ \;\;\;\;\mathsf{hypot}\left(\cos \left(0.5 \cdot \phi_1\right) \cdot \left(\lambda_1 - \lambda_2\right), \phi_1\right) \cdot R\\ \mathbf{else}:\\ \;\;\;\;\mathsf{hypot}\left(\cos \left(0.5 \cdot \phi_2\right) \cdot \left(\lambda_1 - \lambda_2\right), \phi_2\right) \cdot R\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 86.4% accurate, 1.2× speedup

Math

\[\begin{array}{l} [R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\\\ [R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\ \\ \begin{array}{l} t_0 := \cos \left(0.5 \cdot \phi_2\right)\\ \mathbf{if}\;\phi_1 \leq -3.9 \cdot 10^{-39}:\\ \;\;\;\;\mathsf{hypot}\left(t\_0 \cdot \lambda_2, \phi_1 - \phi_2\right) \cdot R\\ \mathbf{else}:\\ \;\;\;\;\mathsf{hypot}\left(t\_0 \cdot \left(\lambda_1 - \lambda_2\right), \phi_2\right) \cdot R\\ \end{array} \end{array} \]

FPCore

NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
 :precision binary64
 (let* ((t_0 (cos (* 0.5 phi2))))
   (if (<= phi1 -3.9e-39)
     (* (hypot (* t_0 lambda2) (- phi1 phi2)) R)
     (* (hypot (* t_0 (- lambda1 lambda2)) phi2) R))))

C

assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	double t_0 = cos((0.5 * phi2));
	double tmp;
	if (phi1 <= -3.9e-39) {
		tmp = hypot((t_0 * lambda2), (phi1 - phi2)) * R;
	} else {
		tmp = hypot((t_0 * (lambda1 - lambda2)), phi2) * R;
	}
	return tmp;
}

Java

assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	double t_0 = Math.cos((0.5 * phi2));
	double tmp;
	if (phi1 <= -3.9e-39) {
		tmp = Math.hypot((t_0 * lambda2), (phi1 - phi2)) * R;
	} else {
		tmp = Math.hypot((t_0 * (lambda1 - lambda2)), phi2) * R;
	}
	return tmp;
}

Python

[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2])
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2])
def code(R, lambda1, lambda2, phi1, phi2):
	t_0 = math.cos((0.5 * phi2))
	tmp = 0
	if phi1 <= -3.9e-39:
		tmp = math.hypot((t_0 * lambda2), (phi1 - phi2)) * R
	else:
		tmp = math.hypot((t_0 * (lambda1 - lambda2)), phi2) * R
	return tmp

Julia

R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2])
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2])
function code(R, lambda1, lambda2, phi1, phi2)
	t_0 = cos(Float64(0.5 * phi2))
	tmp = 0.0
	if (phi1 <= -3.9e-39)
		tmp = Float64(hypot(Float64(t_0 * lambda2), Float64(phi1 - phi2)) * R);
	else
		tmp = Float64(hypot(Float64(t_0 * Float64(lambda1 - lambda2)), phi2) * R);
	end
	return tmp
end

MATLAB

R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
	t_0 = cos((0.5 * phi2));
	tmp = 0.0;
	if (phi1 <= -3.9e-39)
		tmp = hypot((t_0 * lambda2), (phi1 - phi2)) * R;
	else
		tmp = hypot((t_0 * (lambda1 - lambda2)), phi2) * R;
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[Cos[N[(0.5 * phi2), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[phi1, -3.9e-39], N[(N[Sqrt[N[(t$95$0 * lambda2), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision] * R), $MachinePrecision], N[(N[Sqrt[N[(t$95$0 * N[(lambda1 - lambda2), $MachinePrecision]), $MachinePrecision] ^ 2 + phi2 ^ 2], $MachinePrecision] * R), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if phi1 < -3.9000000000000003e-39

   1. Initial program 65.3%

      \[R \cdot \sqrt{\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_1 + \phi_2}{2}\right)\right) \cdot \left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_1 + \phi_2}{2}\right)\right) + \left(\phi_1 - \phi_2\right) \cdot \left(\phi_1 - \phi_2\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in lambda1 around 0

      \[\leadsto R \cdot \color{blue}{\sqrt{{\lambda_2}^{2} \cdot {\cos \left(\frac{1}{2} \cdot \left(\phi_1 + \phi_2\right)\right)}^{2} + {\left(\phi_1 - \phi_2\right)}^{2}}} \]
   4. Step-by-step derivation

      1. unpow2 N/A

         \[\leadsto R \cdot \sqrt{\color{blue}{\left(\lambda_2 \cdot \lambda_2\right)} \cdot {\cos \left(\frac{1}{2} \cdot \left(\phi_1 + \phi_2\right)\right)}^{2} + {\left(\phi_1 - \phi_2\right)}^{2}} \]

      2. unpow2 N/A

         \[\leadsto R \cdot \sqrt{\left(\lambda_2 \cdot \lambda_2\right) \cdot \color{blue}{\left(\cos \left(\frac{1}{2} \cdot \left(\phi_1 + \phi_2\right)\right) \cdot \cos \left(\frac{1}{2} \cdot \left(\phi_1 + \phi_2\right)\right)\right)} + {\left(\phi_1 - \phi_2\right)}^{2}} \]

      3. unswap-sqr N/A

         \[\leadsto R \cdot \sqrt{\color{blue}{\left(\lambda_2 \cdot \cos \left(\frac{1}{2} \cdot \left(\phi_1 + \phi_2\right)\right)\right) \cdot \left(\lambda_2 \cdot \cos \left(\frac{1}{2} \cdot \left(\phi_1 + \phi_2\right)\right)\right)} + {\left(\phi_1 - \phi_2\right)}^{2}} \]

      4. unpow2 N/A

         \[\leadsto R \cdot \sqrt{\left(\lambda_2 \cdot \cos \left(\frac{1}{2} \cdot \left(\phi_1 + \phi_2\right)\right)\right) \cdot \left(\lambda_2 \cdot \cos \left(\frac{1}{2} \cdot \left(\phi_1 + \phi_2\right)\right)\right) + \color{blue}{\left(\phi_1 - \phi_2\right) \cdot \left(\phi_1 - \phi_2\right)}} \]

      5. lower-hypot.f64 N/A

         \[\leadsto R \cdot \color{blue}{\mathsf{hypot}\left(\lambda_2 \cdot \cos \left(\frac{1}{2} \cdot \left(\phi_1 + \phi_2\right)\right), \phi_1 - \phi_2\right)} \]

      6. *-commutative N/A

         \[\leadsto R \cdot \mathsf{hypot}\left(\color{blue}{\cos \left(\frac{1}{2} \cdot \left(\phi_1 + \phi_2\right)\right) \cdot \lambda_2}, \phi_1 - \phi_2\right) \]

      7. lower-*.f64 N/A

         \[\leadsto R \cdot \mathsf{hypot}\left(\color{blue}{\cos \left(\frac{1}{2} \cdot \left(\phi_1 + \phi_2\right)\right) \cdot \lambda_2}, \phi_1 - \phi_2\right) \]

      8. lower-cos.f64 N/A

         \[\leadsto R \cdot \mathsf{hypot}\left(\color{blue}{\cos \left(\frac{1}{2} \cdot \left(\phi_1 + \phi_2\right)\right)} \cdot \lambda_2, \phi_1 - \phi_2\right) \]

      9. *-commutative N/A

         \[\leadsto R \cdot \mathsf{hypot}\left(\cos \color{blue}{\left(\left(\phi_1 + \phi_2\right) \cdot \frac{1}{2}\right)} \cdot \lambda_2, \phi_1 - \phi_2\right) \]

      10. lower-*.f64 N/A

          \[\leadsto R \cdot \mathsf{hypot}\left(\cos \color{blue}{\left(\left(\phi_1 + \phi_2\right) \cdot \frac{1}{2}\right)} \cdot \lambda_2, \phi_1 - \phi_2\right) \]

      11. +-commutative N/A

          \[\leadsto R \cdot \mathsf{hypot}\left(\cos \left(\color{blue}{\left(\phi_2 + \phi_1\right)} \cdot \frac{1}{2}\right) \cdot \lambda_2, \phi_1 - \phi_2\right) \]

      12. lower-+.f64 N/A

          \[\leadsto R \cdot \mathsf{hypot}\left(\cos \left(\color{blue}{\left(\phi_2 + \phi_1\right)} \cdot \frac{1}{2}\right) \cdot \lambda_2, \phi_1 - \phi_2\right) \]

      13. lower--.f64 82.4

          \[\leadsto R \cdot \mathsf{hypot}\left(\cos \left(\left(\phi_2 + \phi_1\right) \cdot 0.5\right) \cdot \lambda_2, \color{blue}{\phi_1 - \phi_2}\right) \]

   5. Applied rewrites 82.4%

      \[\leadsto R \cdot \color{blue}{\mathsf{hypot}\left(\cos \left(\left(\phi_2 + \phi_1\right) \cdot 0.5\right) \cdot \lambda_2, \phi_1 - \phi_2\right)} \]

   6. Taylor expanded in phi1 around 0

      \[\leadsto R \cdot \mathsf{hypot}\left(\cos \left(\frac{1}{2} \cdot \phi_2\right) \cdot \lambda_2, \phi_1 - \phi_2\right) \]
   7. Step-by-step derivation

   8. Applied rewrites 76.8%

      \[\leadsto R \cdot \mathsf{hypot}\left(\cos \left(\phi_2 \cdot 0.5\right) \cdot \lambda_2, \phi_1 - \phi_2\right) \]

   if -3.9000000000000003e-39 < phi1

   1. Initial program 59.3%

      \[R \cdot \sqrt{\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_1 + \phi_2}{2}\right)\right) \cdot \left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_1 + \phi_2}{2}\right)\right) + \left(\phi_1 - \phi_2\right) \cdot \left(\phi_1 - \phi_2\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in phi1 around 0

      \[\leadsto R \cdot \color{blue}{\sqrt{{\cos \left(\frac{1}{2} \cdot \phi_2\right)}^{2} \cdot {\left(\lambda_1 - \lambda_2\right)}^{2} + {\phi_2}^{2}}} \]
   4. Step-by-step derivation

      1. unpow2 N/A

         \[\leadsto R \cdot \sqrt{\color{blue}{\left(\cos \left(\frac{1}{2} \cdot \phi_2\right) \cdot \cos \left(\frac{1}{2} \cdot \phi_2\right)\right)} \cdot {\left(\lambda_1 - \lambda_2\right)}^{2} + {\phi_2}^{2}} \]

      2. unpow2 N/A

         \[\leadsto R \cdot \sqrt{\left(\cos \left(\frac{1}{2} \cdot \phi_2\right) \cdot \cos \left(\frac{1}{2} \cdot \phi_2\right)\right) \cdot \color{blue}{\left(\left(\lambda_1 - \lambda_2\right) \cdot \left(\lambda_1 - \lambda_2\right)\right)} + {\phi_2}^{2}} \]

      3. unswap-sqr N/A

         \[\leadsto R \cdot \sqrt{\color{blue}{\left(\cos \left(\frac{1}{2} \cdot \phi_2\right) \cdot \left(\lambda_1 - \lambda_2\right)\right) \cdot \left(\cos \left(\frac{1}{2} \cdot \phi_2\right) \cdot \left(\lambda_1 - \lambda_2\right)\right)} + {\phi_2}^{2}} \]

      4. unpow2 N/A

         \[\leadsto R \cdot \sqrt{\left(\cos \left(\frac{1}{2} \cdot \phi_2\right) \cdot \left(\lambda_1 - \lambda_2\right)\right) \cdot \left(\cos \left(\frac{1}{2} \cdot \phi_2\right) \cdot \left(\lambda_1 - \lambda_2\right)\right) + \color{blue}{\phi_2 \cdot \phi_2}} \]

      5. lower-hypot.f64 N/A

         \[\leadsto R \cdot \color{blue}{\mathsf{hypot}\left(\cos \left(\frac{1}{2} \cdot \phi_2\right) \cdot \left(\lambda_1 - \lambda_2\right), \phi_2\right)} \]

      6. lower-*.f64 N/A

         \[\leadsto R \cdot \mathsf{hypot}\left(\color{blue}{\cos \left(\frac{1}{2} \cdot \phi_2\right) \cdot \left(\lambda_1 - \lambda_2\right)}, \phi_2\right) \]

      7. lower-cos.f64 N/A

         \[\leadsto R \cdot \mathsf{hypot}\left(\color{blue}{\cos \left(\frac{1}{2} \cdot \phi_2\right)} \cdot \left(\lambda_1 - \lambda_2\right), \phi_2\right) \]

      8. *-commutative N/A

         \[\leadsto R \cdot \mathsf{hypot}\left(\cos \color{blue}{\left(\phi_2 \cdot \frac{1}{2}\right)} \cdot \left(\lambda_1 - \lambda_2\right), \phi_2\right) \]

      9. lower-*.f64 N/A

         \[\leadsto R \cdot \mathsf{hypot}\left(\cos \color{blue}{\left(\phi_2 \cdot \frac{1}{2}\right)} \cdot \left(\lambda_1 - \lambda_2\right), \phi_2\right) \]

      10. lower--.f64 81.4

          \[\leadsto R \cdot \mathsf{hypot}\left(\cos \left(\phi_2 \cdot 0.5\right) \cdot \color{blue}{\left(\lambda_1 - \lambda_2\right)}, \phi_2\right) \]

   5. Applied rewrites 81.4%

      \[\leadsto R \cdot \color{blue}{\mathsf{hypot}\left(\cos \left(\phi_2 \cdot 0.5\right) \cdot \left(\lambda_1 - \lambda_2\right), \phi_2\right)} \]
3. Recombined 2 regimes into one program.

4. Final simplification 80.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\phi_1 \leq -3.9 \cdot 10^{-39}:\\ \;\;\;\;\mathsf{hypot}\left(\cos \left(0.5 \cdot \phi_2\right) \cdot \lambda_2, \phi_1 - \phi_2\right) \cdot R\\ \mathbf{else}:\\ \;\;\;\;\mathsf{hypot}\left(\cos \left(0.5 \cdot \phi_2\right) \cdot \left(\lambda_1 - \lambda_2\right), \phi_2\right) \cdot R\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 83.0% accurate, 1.2× speedup

Math

\[\begin{array}{l} [R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\\\ [R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\ \\ \begin{array}{l} \mathbf{if}\;\lambda_1 \leq -1 \cdot 10^{+112}:\\ \;\;\;\;\mathsf{hypot}\left(\cos \left(0.5 \cdot \phi_1\right) \cdot \lambda_1, \phi_1\right) \cdot R\\ \mathbf{else}:\\ \;\;\;\;\mathsf{hypot}\left(\cos \left(0.5 \cdot \phi_2\right) \cdot \lambda_2, \phi_1 - \phi_2\right) \cdot R\\ \end{array} \end{array} \]

FPCore

NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
 :precision binary64
 (if (<= lambda1 -1e+112)
   (* (hypot (* (cos (* 0.5 phi1)) lambda1) phi1) R)
   (* (hypot (* (cos (* 0.5 phi2)) lambda2) (- phi1 phi2)) R)))

C

assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	double tmp;
	if (lambda1 <= -1e+112) {
		tmp = hypot((cos((0.5 * phi1)) * lambda1), phi1) * R;
	} else {
		tmp = hypot((cos((0.5 * phi2)) * lambda2), (phi1 - phi2)) * R;
	}
	return tmp;
}

Java

assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	double tmp;
	if (lambda1 <= -1e+112) {
		tmp = Math.hypot((Math.cos((0.5 * phi1)) * lambda1), phi1) * R;
	} else {
		tmp = Math.hypot((Math.cos((0.5 * phi2)) * lambda2), (phi1 - phi2)) * R;
	}
	return tmp;
}

Python

[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2])
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2])
def code(R, lambda1, lambda2, phi1, phi2):
	tmp = 0
	if lambda1 <= -1e+112:
		tmp = math.hypot((math.cos((0.5 * phi1)) * lambda1), phi1) * R
	else:
		tmp = math.hypot((math.cos((0.5 * phi2)) * lambda2), (phi1 - phi2)) * R
	return tmp

Julia

R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2])
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2])
function code(R, lambda1, lambda2, phi1, phi2)
	tmp = 0.0
	if (lambda1 <= -1e+112)
		tmp = Float64(hypot(Float64(cos(Float64(0.5 * phi1)) * lambda1), phi1) * R);
	else
		tmp = Float64(hypot(Float64(cos(Float64(0.5 * phi2)) * lambda2), Float64(phi1 - phi2)) * R);
	end
	return tmp
end

MATLAB

R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
	tmp = 0.0;
	if (lambda1 <= -1e+112)
		tmp = hypot((cos((0.5 * phi1)) * lambda1), phi1) * R;
	else
		tmp = hypot((cos((0.5 * phi2)) * lambda2), (phi1 - phi2)) * R;
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[lambda1, -1e+112], N[(N[Sqrt[N[(N[Cos[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision] * lambda1), $MachinePrecision] ^ 2 + phi1 ^ 2], $MachinePrecision] * R), $MachinePrecision], N[(N[Sqrt[N[(N[Cos[N[(0.5 * phi2), $MachinePrecision]], $MachinePrecision] * lambda2), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision] * R), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if lambda1 < -9.9999999999999993e111

   1. Initial program 50.0%

      \[R \cdot \sqrt{\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_1 + \phi_2}{2}\right)\right) \cdot \left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_1 + \phi_2}{2}\right)\right) + \left(\phi_1 - \phi_2\right) \cdot \left(\phi_1 - \phi_2\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in phi2 around 0

      \[\leadsto R \cdot \color{blue}{\sqrt{{\cos \left(\frac{1}{2} \cdot \phi_1\right)}^{2} \cdot {\left(\lambda_1 - \lambda_2\right)}^{2} + {\phi_1}^{2}}} \]
   4. Step-by-step derivation

      1. unpow2 N/A

         \[\leadsto R \cdot \sqrt{\color{blue}{\left(\cos \left(\frac{1}{2} \cdot \phi_1\right) \cdot \cos \left(\frac{1}{2} \cdot \phi_1\right)\right)} \cdot {\left(\lambda_1 - \lambda_2\right)}^{2} + {\phi_1}^{2}} \]

      2. unpow2 N/A

         \[\leadsto R \cdot \sqrt{\left(\cos \left(\frac{1}{2} \cdot \phi_1\right) \cdot \cos \left(\frac{1}{2} \cdot \phi_1\right)\right) \cdot \color{blue}{\left(\left(\lambda_1 - \lambda_2\right) \cdot \left(\lambda_1 - \lambda_2\right)\right)} + {\phi_1}^{2}} \]

      3. unswap-sqr N/A

         \[\leadsto R \cdot \sqrt{\color{blue}{\left(\cos \left(\frac{1}{2} \cdot \phi_1\right) \cdot \left(\lambda_1 - \lambda_2\right)\right) \cdot \left(\cos \left(\frac{1}{2} \cdot \phi_1\right) \cdot \left(\lambda_1 - \lambda_2\right)\right)} + {\phi_1}^{2}} \]

      4. unpow2 N/A

         \[\leadsto R \cdot \sqrt{\left(\cos \left(\frac{1}{2} \cdot \phi_1\right) \cdot \left(\lambda_1 - \lambda_2\right)\right) \cdot \left(\cos \left(\frac{1}{2} \cdot \phi_1\right) \cdot \left(\lambda_1 - \lambda_2\right)\right) + \color{blue}{\phi_1 \cdot \phi_1}} \]

      5. lower-hypot.f64 N/A

         \[\leadsto R \cdot \color{blue}{\mathsf{hypot}\left(\cos \left(\frac{1}{2} \cdot \phi_1\right) \cdot \left(\lambda_1 - \lambda_2\right), \phi_1\right)} \]

      6. *-commutative N/A

         \[\leadsto R \cdot \mathsf{hypot}\left(\color{blue}{\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{1}{2} \cdot \phi_1\right)}, \phi_1\right) \]

      7. lower-*.f64 N/A

         \[\leadsto R \cdot \mathsf{hypot}\left(\color{blue}{\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{1}{2} \cdot \phi_1\right)}, \phi_1\right) \]

      8. lower--.f64 N/A

         \[\leadsto R \cdot \mathsf{hypot}\left(\color{blue}{\left(\lambda_1 - \lambda_2\right)} \cdot \cos \left(\frac{1}{2} \cdot \phi_1\right), \phi_1\right) \]

      9. lower-cos.f64 N/A

         \[\leadsto R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \color{blue}{\cos \left(\frac{1}{2} \cdot \phi_1\right)}, \phi_1\right) \]

      10. *-commutative N/A

          \[\leadsto R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \color{blue}{\left(\phi_1 \cdot \frac{1}{2}\right)}, \phi_1\right) \]

      11. lower-*.f64 68.9

          \[\leadsto R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \color{blue}{\left(\phi_1 \cdot 0.5\right)}, \phi_1\right) \]

   5. Applied rewrites 68.9%

      \[\leadsto R \cdot \color{blue}{\mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\phi_1 \cdot 0.5\right), \phi_1\right)} \]

   6. Taylor expanded in lambda1 around inf

      \[\leadsto R \cdot \mathsf{hypot}\left(\lambda_1 \cdot \cos \left(\frac{1}{2} \cdot \phi_1\right), \phi_1\right) \]
   7. Step-by-step derivation

   8. Applied rewrites 66.8%

      \[\leadsto R \cdot \mathsf{hypot}\left(\cos \left(\phi_1 \cdot 0.5\right) \cdot \lambda_1, \phi_1\right) \]

   if -9.9999999999999993e111 < lambda1

   1. Initial program 63.3%

      \[R \cdot \sqrt{\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_1 + \phi_2}{2}\right)\right) \cdot \left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_1 + \phi_2}{2}\right)\right) + \left(\phi_1 - \phi_2\right) \cdot \left(\phi_1 - \phi_2\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in lambda1 around 0

      \[\leadsto R \cdot \color{blue}{\sqrt{{\lambda_2}^{2} \cdot {\cos \left(\frac{1}{2} \cdot \left(\phi_1 + \phi_2\right)\right)}^{2} + {\left(\phi_1 - \phi_2\right)}^{2}}} \]
   4. Step-by-step derivation

      1. unpow2 N/A

         \[\leadsto R \cdot \sqrt{\color{blue}{\left(\lambda_2 \cdot \lambda_2\right)} \cdot {\cos \left(\frac{1}{2} \cdot \left(\phi_1 + \phi_2\right)\right)}^{2} + {\left(\phi_1 - \phi_2\right)}^{2}} \]

      2. unpow2 N/A

         \[\leadsto R \cdot \sqrt{\left(\lambda_2 \cdot \lambda_2\right) \cdot \color{blue}{\left(\cos \left(\frac{1}{2} \cdot \left(\phi_1 + \phi_2\right)\right) \cdot \cos \left(\frac{1}{2} \cdot \left(\phi_1 + \phi_2\right)\right)\right)} + {\left(\phi_1 - \phi_2\right)}^{2}} \]

      3. unswap-sqr N/A

         \[\leadsto R \cdot \sqrt{\color{blue}{\left(\lambda_2 \cdot \cos \left(\frac{1}{2} \cdot \left(\phi_1 + \phi_2\right)\right)\right) \cdot \left(\lambda_2 \cdot \cos \left(\frac{1}{2} \cdot \left(\phi_1 + \phi_2\right)\right)\right)} + {\left(\phi_1 - \phi_2\right)}^{2}} \]

      4. unpow2 N/A

         \[\leadsto R \cdot \sqrt{\left(\lambda_2 \cdot \cos \left(\frac{1}{2} \cdot \left(\phi_1 + \phi_2\right)\right)\right) \cdot \left(\lambda_2 \cdot \cos \left(\frac{1}{2} \cdot \left(\phi_1 + \phi_2\right)\right)\right) + \color{blue}{\left(\phi_1 - \phi_2\right) \cdot \left(\phi_1 - \phi_2\right)}} \]

      5. lower-hypot.f64 N/A

         \[\leadsto R \cdot \color{blue}{\mathsf{hypot}\left(\lambda_2 \cdot \cos \left(\frac{1}{2} \cdot \left(\phi_1 + \phi_2\right)\right), \phi_1 - \phi_2\right)} \]

      6. *-commutative N/A

         \[\leadsto R \cdot \mathsf{hypot}\left(\color{blue}{\cos \left(\frac{1}{2} \cdot \left(\phi_1 + \phi_2\right)\right) \cdot \lambda_2}, \phi_1 - \phi_2\right) \]

      7. lower-*.f64 N/A

         \[\leadsto R \cdot \mathsf{hypot}\left(\color{blue}{\cos \left(\frac{1}{2} \cdot \left(\phi_1 + \phi_2\right)\right) \cdot \lambda_2}, \phi_1 - \phi_2\right) \]

      8. lower-cos.f64 N/A

         \[\leadsto R \cdot \mathsf{hypot}\left(\color{blue}{\cos \left(\frac{1}{2} \cdot \left(\phi_1 + \phi_2\right)\right)} \cdot \lambda_2, \phi_1 - \phi_2\right) \]

      9. *-commutative N/A

         \[\leadsto R \cdot \mathsf{hypot}\left(\cos \color{blue}{\left(\left(\phi_1 + \phi_2\right) \cdot \frac{1}{2}\right)} \cdot \lambda_2, \phi_1 - \phi_2\right) \]

      10. lower-*.f64 N/A

          \[\leadsto R \cdot \mathsf{hypot}\left(\cos \color{blue}{\left(\left(\phi_1 + \phi_2\right) \cdot \frac{1}{2}\right)} \cdot \lambda_2, \phi_1 - \phi_2\right) \]

      11. +-commutative N/A

          \[\leadsto R \cdot \mathsf{hypot}\left(\cos \left(\color{blue}{\left(\phi_2 + \phi_1\right)} \cdot \frac{1}{2}\right) \cdot \lambda_2, \phi_1 - \phi_2\right) \]

      12. lower-+.f64 N/A

          \[\leadsto R \cdot \mathsf{hypot}\left(\cos \left(\color{blue}{\left(\phi_2 + \phi_1\right)} \cdot \frac{1}{2}\right) \cdot \lambda_2, \phi_1 - \phi_2\right) \]

      13. lower--.f64 86.4

          \[\leadsto R \cdot \mathsf{hypot}\left(\cos \left(\left(\phi_2 + \phi_1\right) \cdot 0.5\right) \cdot \lambda_2, \color{blue}{\phi_1 - \phi_2}\right) \]

   5. Applied rewrites 86.4%

      \[\leadsto R \cdot \color{blue}{\mathsf{hypot}\left(\cos \left(\left(\phi_2 + \phi_1\right) \cdot 0.5\right) \cdot \lambda_2, \phi_1 - \phi_2\right)} \]

   6. Taylor expanded in phi1 around 0

      \[\leadsto R \cdot \mathsf{hypot}\left(\cos \left(\frac{1}{2} \cdot \phi_2\right) \cdot \lambda_2, \phi_1 - \phi_2\right) \]
   7. Step-by-step derivation

   8. Applied rewrites 83.4%

      \[\leadsto R \cdot \mathsf{hypot}\left(\cos \left(\phi_2 \cdot 0.5\right) \cdot \lambda_2, \phi_1 - \phi_2\right) \]
3. Recombined 2 regimes into one program.

4. Final simplification 80.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\lambda_1 \leq -1 \cdot 10^{+112}:\\ \;\;\;\;\mathsf{hypot}\left(\cos \left(0.5 \cdot \phi_1\right) \cdot \lambda_1, \phi_1\right) \cdot R\\ \mathbf{else}:\\ \;\;\;\;\mathsf{hypot}\left(\cos \left(0.5 \cdot \phi_2\right) \cdot \lambda_2, \phi_1 - \phi_2\right) \cdot R\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 80.3% accurate, 1.3× speedup

Math

\[\begin{array}{l} [R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\\\ [R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\ \\ \begin{array}{l} \mathbf{if}\;\phi_2 \leq 1.95 \cdot 10^{+45}:\\ \;\;\;\;\mathsf{hypot}\left(\lambda_1 - \lambda_2, \phi_1\right) \cdot R\\ \mathbf{else}:\\ \;\;\;\;\mathsf{hypot}\left(\cos \left(0.5 \cdot \phi_2\right) \cdot \lambda_2, \phi_2\right) \cdot R\\ \end{array} \end{array} \]

FPCore

NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
 :precision binary64
 (if (<= phi2 1.95e+45)
   (* (hypot (- lambda1 lambda2) phi1) R)
   (* (hypot (* (cos (* 0.5 phi2)) lambda2) phi2) R)))

C

assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	double tmp;
	if (phi2 <= 1.95e+45) {
		tmp = hypot((lambda1 - lambda2), phi1) * R;
	} else {
		tmp = hypot((cos((0.5 * phi2)) * lambda2), phi2) * R;
	}
	return tmp;
}

Java

assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	double tmp;
	if (phi2 <= 1.95e+45) {
		tmp = Math.hypot((lambda1 - lambda2), phi1) * R;
	} else {
		tmp = Math.hypot((Math.cos((0.5 * phi2)) * lambda2), phi2) * R;
	}
	return tmp;
}

Python

[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2])
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2])
def code(R, lambda1, lambda2, phi1, phi2):
	tmp = 0
	if phi2 <= 1.95e+45:
		tmp = math.hypot((lambda1 - lambda2), phi1) * R
	else:
		tmp = math.hypot((math.cos((0.5 * phi2)) * lambda2), phi2) * R
	return tmp

Julia

R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2])
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2])
function code(R, lambda1, lambda2, phi1, phi2)
	tmp = 0.0
	if (phi2 <= 1.95e+45)
		tmp = Float64(hypot(Float64(lambda1 - lambda2), phi1) * R);
	else
		tmp = Float64(hypot(Float64(cos(Float64(0.5 * phi2)) * lambda2), phi2) * R);
	end
	return tmp
end

MATLAB

R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
	tmp = 0.0;
	if (phi2 <= 1.95e+45)
		tmp = hypot((lambda1 - lambda2), phi1) * R;
	else
		tmp = hypot((cos((0.5 * phi2)) * lambda2), phi2) * R;
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, 1.95e+45], N[(N[Sqrt[N[(lambda1 - lambda2), $MachinePrecision] ^ 2 + phi1 ^ 2], $MachinePrecision] * R), $MachinePrecision], N[(N[Sqrt[N[(N[Cos[N[(0.5 * phi2), $MachinePrecision]], $MachinePrecision] * lambda2), $MachinePrecision] ^ 2 + phi2 ^ 2], $MachinePrecision] * R), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if phi2 < 1.95e45

   1. Initial program 64.0%

      \[R \cdot \sqrt{\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_1 + \phi_2}{2}\right)\right) \cdot \left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_1 + \phi_2}{2}\right)\right) + \left(\phi_1 - \phi_2\right) \cdot \left(\phi_1 - \phi_2\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in phi2 around 0

      \[\leadsto R \cdot \color{blue}{\sqrt{{\cos \left(\frac{1}{2} \cdot \phi_1\right)}^{2} \cdot {\left(\lambda_1 - \lambda_2\right)}^{2} + {\phi_1}^{2}}} \]
   4. Step-by-step derivation

      1. unpow2 N/A

         \[\leadsto R \cdot \sqrt{\color{blue}{\left(\cos \left(\frac{1}{2} \cdot \phi_1\right) \cdot \cos \left(\frac{1}{2} \cdot \phi_1\right)\right)} \cdot {\left(\lambda_1 - \lambda_2\right)}^{2} + {\phi_1}^{2}} \]

      2. unpow2 N/A

         \[\leadsto R \cdot \sqrt{\left(\cos \left(\frac{1}{2} \cdot \phi_1\right) \cdot \cos \left(\frac{1}{2} \cdot \phi_1\right)\right) \cdot \color{blue}{\left(\left(\lambda_1 - \lambda_2\right) \cdot \left(\lambda_1 - \lambda_2\right)\right)} + {\phi_1}^{2}} \]

      3. unswap-sqr N/A

         \[\leadsto R \cdot \sqrt{\color{blue}{\left(\cos \left(\frac{1}{2} \cdot \phi_1\right) \cdot \left(\lambda_1 - \lambda_2\right)\right) \cdot \left(\cos \left(\frac{1}{2} \cdot \phi_1\right) \cdot \left(\lambda_1 - \lambda_2\right)\right)} + {\phi_1}^{2}} \]

      4. unpow2 N/A

         \[\leadsto R \cdot \sqrt{\left(\cos \left(\frac{1}{2} \cdot \phi_1\right) \cdot \left(\lambda_1 - \lambda_2\right)\right) \cdot \left(\cos \left(\frac{1}{2} \cdot \phi_1\right) \cdot \left(\lambda_1 - \lambda_2\right)\right) + \color{blue}{\phi_1 \cdot \phi_1}} \]

      5. lower-hypot.f64 N/A

         \[\leadsto R \cdot \color{blue}{\mathsf{hypot}\left(\cos \left(\frac{1}{2} \cdot \phi_1\right) \cdot \left(\lambda_1 - \lambda_2\right), \phi_1\right)} \]

      6. *-commutative N/A

         \[\leadsto R \cdot \mathsf{hypot}\left(\color{blue}{\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{1}{2} \cdot \phi_1\right)}, \phi_1\right) \]

      7. lower-*.f64 N/A

         \[\leadsto R \cdot \mathsf{hypot}\left(\color{blue}{\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{1}{2} \cdot \phi_1\right)}, \phi_1\right) \]

      8. lower--.f64 N/A

         \[\leadsto R \cdot \mathsf{hypot}\left(\color{blue}{\left(\lambda_1 - \lambda_2\right)} \cdot \cos \left(\frac{1}{2} \cdot \phi_1\right), \phi_1\right) \]

      9. lower-cos.f64 N/A

         \[\leadsto R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \color{blue}{\cos \left(\frac{1}{2} \cdot \phi_1\right)}, \phi_1\right) \]

      10. *-commutative N/A

          \[\leadsto R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \color{blue}{\left(\phi_1 \cdot \frac{1}{2}\right)}, \phi_1\right) \]

      11. lower-*.f64 73.9

          \[\leadsto R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \color{blue}{\left(\phi_1 \cdot 0.5\right)}, \phi_1\right) \]

   5. Applied rewrites 73.9%

      \[\leadsto R \cdot \color{blue}{\mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\phi_1 \cdot 0.5\right), \phi_1\right)} \]

   6. Taylor expanded in phi1 around 0

      \[\leadsto R \cdot \mathsf{hypot}\left(\lambda_1 - \lambda_2, \phi_1\right) \]
   7. Step-by-step derivation

   8. Applied rewrites 69.0%

      \[\leadsto R \cdot \mathsf{hypot}\left(\lambda_1 - \lambda_2, \phi_1\right) \]

   if 1.95e45 < phi2

   1. Initial program 51.8%

      \[R \cdot \sqrt{\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_1 + \phi_2}{2}\right)\right) \cdot \left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_1 + \phi_2}{2}\right)\right) + \left(\phi_1 - \phi_2\right) \cdot \left(\phi_1 - \phi_2\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in lambda1 around 0

      \[\leadsto R \cdot \color{blue}{\sqrt{{\lambda_2}^{2} \cdot {\cos \left(\frac{1}{2} \cdot \left(\phi_1 + \phi_2\right)\right)}^{2} + {\left(\phi_1 - \phi_2\right)}^{2}}} \]
   4. Step-by-step derivation

      1. unpow2 N/A

         \[\leadsto R \cdot \sqrt{\color{blue}{\left(\lambda_2 \cdot \lambda_2\right)} \cdot {\cos \left(\frac{1}{2} \cdot \left(\phi_1 + \phi_2\right)\right)}^{2} + {\left(\phi_1 - \phi_2\right)}^{2}} \]

      2. unpow2 N/A

         \[\leadsto R \cdot \sqrt{\left(\lambda_2 \cdot \lambda_2\right) \cdot \color{blue}{\left(\cos \left(\frac{1}{2} \cdot \left(\phi_1 + \phi_2\right)\right) \cdot \cos \left(\frac{1}{2} \cdot \left(\phi_1 + \phi_2\right)\right)\right)} + {\left(\phi_1 - \phi_2\right)}^{2}} \]

      3. unswap-sqr N/A

         \[\leadsto R \cdot \sqrt{\color{blue}{\left(\lambda_2 \cdot \cos \left(\frac{1}{2} \cdot \left(\phi_1 + \phi_2\right)\right)\right) \cdot \left(\lambda_2 \cdot \cos \left(\frac{1}{2} \cdot \left(\phi_1 + \phi_2\right)\right)\right)} + {\left(\phi_1 - \phi_2\right)}^{2}} \]

      4. unpow2 N/A

         \[\leadsto R \cdot \sqrt{\left(\lambda_2 \cdot \cos \left(\frac{1}{2} \cdot \left(\phi_1 + \phi_2\right)\right)\right) \cdot \left(\lambda_2 \cdot \cos \left(\frac{1}{2} \cdot \left(\phi_1 + \phi_2\right)\right)\right) + \color{blue}{\left(\phi_1 - \phi_2\right) \cdot \left(\phi_1 - \phi_2\right)}} \]

      5. lower-hypot.f64 N/A

         \[\leadsto R \cdot \color{blue}{\mathsf{hypot}\left(\lambda_2 \cdot \cos \left(\frac{1}{2} \cdot \left(\phi_1 + \phi_2\right)\right), \phi_1 - \phi_2\right)} \]

      6. *-commutative N/A

         \[\leadsto R \cdot \mathsf{hypot}\left(\color{blue}{\cos \left(\frac{1}{2} \cdot \left(\phi_1 + \phi_2\right)\right) \cdot \lambda_2}, \phi_1 - \phi_2\right) \]

      7. lower-*.f64 N/A

         \[\leadsto R \cdot \mathsf{hypot}\left(\color{blue}{\cos \left(\frac{1}{2} \cdot \left(\phi_1 + \phi_2\right)\right) \cdot \lambda_2}, \phi_1 - \phi_2\right) \]

      8. lower-cos.f64 N/A

         \[\leadsto R \cdot \mathsf{hypot}\left(\color{blue}{\cos \left(\frac{1}{2} \cdot \left(\phi_1 + \phi_2\right)\right)} \cdot \lambda_2, \phi_1 - \phi_2\right) \]

      9. *-commutative N/A

         \[\leadsto R \cdot \mathsf{hypot}\left(\cos \color{blue}{\left(\left(\phi_1 + \phi_2\right) \cdot \frac{1}{2}\right)} \cdot \lambda_2, \phi_1 - \phi_2\right) \]

      10. lower-*.f64 N/A

          \[\leadsto R \cdot \mathsf{hypot}\left(\cos \color{blue}{\left(\left(\phi_1 + \phi_2\right) \cdot \frac{1}{2}\right)} \cdot \lambda_2, \phi_1 - \phi_2\right) \]

      11. +-commutative N/A

          \[\leadsto R \cdot \mathsf{hypot}\left(\cos \left(\color{blue}{\left(\phi_2 + \phi_1\right)} \cdot \frac{1}{2}\right) \cdot \lambda_2, \phi_1 - \phi_2\right) \]

      12. lower-+.f64 N/A

          \[\leadsto R \cdot \mathsf{hypot}\left(\cos \left(\color{blue}{\left(\phi_2 + \phi_1\right)} \cdot \frac{1}{2}\right) \cdot \lambda_2, \phi_1 - \phi_2\right) \]

      13. lower--.f64 79.0

          \[\leadsto R \cdot \mathsf{hypot}\left(\cos \left(\left(\phi_2 + \phi_1\right) \cdot 0.5\right) \cdot \lambda_2, \color{blue}{\phi_1 - \phi_2}\right) \]

   5. Applied rewrites 79.0%

      \[\leadsto R \cdot \color{blue}{\mathsf{hypot}\left(\cos \left(\left(\phi_2 + \phi_1\right) \cdot 0.5\right) \cdot \lambda_2, \phi_1 - \phi_2\right)} \]

   6. Taylor expanded in phi1 around 0

      \[\leadsto R \cdot \sqrt{{\lambda_2}^{2} \cdot {\cos \left(\frac{1}{2} \cdot \phi_2\right)}^{2} + {\phi_2}^{2}} \]
   7. Step-by-step derivation

   8. Applied rewrites 59.7%

      \[\leadsto R \cdot \mathsf{hypot}\left(\cos \left(\phi_2 \cdot 0.5\right) \cdot \lambda_2, \color{blue}{\phi_2}\right) \]
3. Recombined 2 regimes into one program.

4. Final simplification 66.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\phi_2 \leq 1.95 \cdot 10^{+45}:\\ \;\;\;\;\mathsf{hypot}\left(\lambda_1 - \lambda_2, \phi_1\right) \cdot R\\ \mathbf{else}:\\ \;\;\;\;\mathsf{hypot}\left(\cos \left(0.5 \cdot \phi_2\right) \cdot \lambda_2, \phi_2\right) \cdot R\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 79.7% accurate, 2.4× speedup

Math

\[\begin{array}{l} [R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\\\ [R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\ \\ \begin{array}{l} \mathbf{if}\;\phi_2 \leq 5800000:\\ \;\;\;\;\mathsf{hypot}\left(\lambda_1 - \lambda_2, \phi_1\right) \cdot R\\ \mathbf{else}:\\ \;\;\;\;\left(\phi_2 - \phi_1\right) \cdot R\\ \end{array} \end{array} \]

FPCore

NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
 :precision binary64
 (if (<= phi2 5800000.0)
   (* (hypot (- lambda1 lambda2) phi1) R)
   (* (- phi2 phi1) R)))

C

assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	double tmp;
	if (phi2 <= 5800000.0) {
		tmp = hypot((lambda1 - lambda2), phi1) * R;
	} else {
		tmp = (phi2 - phi1) * R;
	}
	return tmp;
}

Java

assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	double tmp;
	if (phi2 <= 5800000.0) {
		tmp = Math.hypot((lambda1 - lambda2), phi1) * R;
	} else {
		tmp = (phi2 - phi1) * R;
	}
	return tmp;
}

Python

[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2])
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2])
def code(R, lambda1, lambda2, phi1, phi2):
	tmp = 0
	if phi2 <= 5800000.0:
		tmp = math.hypot((lambda1 - lambda2), phi1) * R
	else:
		tmp = (phi2 - phi1) * R
	return tmp

Julia

R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2])
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2])
function code(R, lambda1, lambda2, phi1, phi2)
	tmp = 0.0
	if (phi2 <= 5800000.0)
		tmp = Float64(hypot(Float64(lambda1 - lambda2), phi1) * R);
	else
		tmp = Float64(Float64(phi2 - phi1) * R);
	end
	return tmp
end

MATLAB

R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
	tmp = 0.0;
	if (phi2 <= 5800000.0)
		tmp = hypot((lambda1 - lambda2), phi1) * R;
	else
		tmp = (phi2 - phi1) * R;
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, 5800000.0], N[(N[Sqrt[N[(lambda1 - lambda2), $MachinePrecision] ^ 2 + phi1 ^ 2], $MachinePrecision] * R), $MachinePrecision], N[(N[(phi2 - phi1), $MachinePrecision] * R), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if phi2 < 5.8e6

   1. Initial program 63.9%

      \[R \cdot \sqrt{\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_1 + \phi_2}{2}\right)\right) \cdot \left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_1 + \phi_2}{2}\right)\right) + \left(\phi_1 - \phi_2\right) \cdot \left(\phi_1 - \phi_2\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in phi2 around 0

      \[\leadsto R \cdot \color{blue}{\sqrt{{\cos \left(\frac{1}{2} \cdot \phi_1\right)}^{2} \cdot {\left(\lambda_1 - \lambda_2\right)}^{2} + {\phi_1}^{2}}} \]
   4. Step-by-step derivation

      1. unpow2 N/A

         \[\leadsto R \cdot \sqrt{\color{blue}{\left(\cos \left(\frac{1}{2} \cdot \phi_1\right) \cdot \cos \left(\frac{1}{2} \cdot \phi_1\right)\right)} \cdot {\left(\lambda_1 - \lambda_2\right)}^{2} + {\phi_1}^{2}} \]

      2. unpow2 N/A

         \[\leadsto R \cdot \sqrt{\left(\cos \left(\frac{1}{2} \cdot \phi_1\right) \cdot \cos \left(\frac{1}{2} \cdot \phi_1\right)\right) \cdot \color{blue}{\left(\left(\lambda_1 - \lambda_2\right) \cdot \left(\lambda_1 - \lambda_2\right)\right)} + {\phi_1}^{2}} \]

      3. unswap-sqr N/A

         \[\leadsto R \cdot \sqrt{\color{blue}{\left(\cos \left(\frac{1}{2} \cdot \phi_1\right) \cdot \left(\lambda_1 - \lambda_2\right)\right) \cdot \left(\cos \left(\frac{1}{2} \cdot \phi_1\right) \cdot \left(\lambda_1 - \lambda_2\right)\right)} + {\phi_1}^{2}} \]

      4. unpow2 N/A

         \[\leadsto R \cdot \sqrt{\left(\cos \left(\frac{1}{2} \cdot \phi_1\right) \cdot \left(\lambda_1 - \lambda_2\right)\right) \cdot \left(\cos \left(\frac{1}{2} \cdot \phi_1\right) \cdot \left(\lambda_1 - \lambda_2\right)\right) + \color{blue}{\phi_1 \cdot \phi_1}} \]

      5. lower-hypot.f64 N/A

         \[\leadsto R \cdot \color{blue}{\mathsf{hypot}\left(\cos \left(\frac{1}{2} \cdot \phi_1\right) \cdot \left(\lambda_1 - \lambda_2\right), \phi_1\right)} \]

      6. *-commutative N/A

         \[\leadsto R \cdot \mathsf{hypot}\left(\color{blue}{\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{1}{2} \cdot \phi_1\right)}, \phi_1\right) \]

      7. lower-*.f64 N/A

         \[\leadsto R \cdot \mathsf{hypot}\left(\color{blue}{\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{1}{2} \cdot \phi_1\right)}, \phi_1\right) \]

      8. lower--.f64 N/A

         \[\leadsto R \cdot \mathsf{hypot}\left(\color{blue}{\left(\lambda_1 - \lambda_2\right)} \cdot \cos \left(\frac{1}{2} \cdot \phi_1\right), \phi_1\right) \]

      9. lower-cos.f64 N/A

         \[\leadsto R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \color{blue}{\cos \left(\frac{1}{2} \cdot \phi_1\right)}, \phi_1\right) \]

      10. *-commutative N/A

          \[\leadsto R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \color{blue}{\left(\phi_1 \cdot \frac{1}{2}\right)}, \phi_1\right) \]

      11. lower-*.f64 74.4

          \[\leadsto R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \color{blue}{\left(\phi_1 \cdot 0.5\right)}, \phi_1\right) \]

   5. Applied rewrites 74.4%

      \[\leadsto R \cdot \color{blue}{\mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\phi_1 \cdot 0.5\right), \phi_1\right)} \]

   6. Taylor expanded in phi1 around 0

      \[\leadsto R \cdot \mathsf{hypot}\left(\lambda_1 - \lambda_2, \phi_1\right) \]
   7. Step-by-step derivation

   8. Applied rewrites 69.4%

      \[\leadsto R \cdot \mathsf{hypot}\left(\lambda_1 - \lambda_2, \phi_1\right) \]

   if 5.8e6 < phi2

   1. Initial program 52.8%

      \[R \cdot \sqrt{\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_1 + \phi_2}{2}\right)\right) \cdot \left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_1 + \phi_2}{2}\right)\right) + \left(\phi_1 - \phi_2\right) \cdot \left(\phi_1 - \phi_2\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in phi1 around -inf

      \[\leadsto R \cdot \color{blue}{\left(-1 \cdot \left(\phi_1 \cdot \left(1 + -1 \cdot \frac{\phi_2}{\phi_1}\right)\right)\right)} \]
   4. Step-by-step derivation

      1. associate-*r* N/A

         \[\leadsto R \cdot \color{blue}{\left(\left(-1 \cdot \phi_1\right) \cdot \left(1 + -1 \cdot \frac{\phi_2}{\phi_1}\right)\right)} \]

      2. lower-*.f64 N/A

         \[\leadsto R \cdot \color{blue}{\left(\left(-1 \cdot \phi_1\right) \cdot \left(1 + -1 \cdot \frac{\phi_2}{\phi_1}\right)\right)} \]

      3. mul-1-neg N/A

         \[\leadsto R \cdot \left(\color{blue}{\left(\mathsf{neg}\left(\phi_1\right)\right)} \cdot \left(1 + -1 \cdot \frac{\phi_2}{\phi_1}\right)\right) \]

      4. lower-neg.f64 N/A

         \[\leadsto R \cdot \left(\color{blue}{\left(-\phi_1\right)} \cdot \left(1 + -1 \cdot \frac{\phi_2}{\phi_1}\right)\right) \]

      5. mul-1-neg N/A

         \[\leadsto R \cdot \left(\left(-\phi_1\right) \cdot \left(1 + \color{blue}{\left(\mathsf{neg}\left(\frac{\phi_2}{\phi_1}\right)\right)}\right)\right) \]

      6. unsub-neg N/A

         \[\leadsto R \cdot \left(\left(-\phi_1\right) \cdot \color{blue}{\left(1 - \frac{\phi_2}{\phi_1}\right)}\right) \]

      7. lower--.f64 N/A

         \[\leadsto R \cdot \left(\left(-\phi_1\right) \cdot \color{blue}{\left(1 - \frac{\phi_2}{\phi_1}\right)}\right) \]

      8. lower-/.f64 56.2

         \[\leadsto R \cdot \left(\left(-\phi_1\right) \cdot \left(1 - \color{blue}{\frac{\phi_2}{\phi_1}}\right)\right) \]

   5. Applied rewrites 56.2%

      \[\leadsto R \cdot \color{blue}{\left(\left(-\phi_1\right) \cdot \left(1 - \frac{\phi_2}{\phi_1}\right)\right)} \]

   6. Taylor expanded in phi2 around 0

      \[\leadsto R \cdot \left(\phi_2 + \color{blue}{-1 \cdot \phi_1}\right) \]
   7. Step-by-step derivation

   8. Applied rewrites 59.3%

      \[\leadsto R \cdot \left(\phi_2 - \color{blue}{\phi_1}\right) \]
3. Recombined 2 regimes into one program.

4. Final simplification 66.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\phi_2 \leq 5800000:\\ \;\;\;\;\mathsf{hypot}\left(\lambda_1 - \lambda_2, \phi_1\right) \cdot R\\ \mathbf{else}:\\ \;\;\;\;\left(\phi_2 - \phi_1\right) \cdot R\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 67.2% accurate, 7.7× speedup

Math

\[\begin{array}{l} [R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\\\ [R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\ \\ \begin{array}{l} \mathbf{if}\;\lambda_1 - \lambda_2 \leq -5 \cdot 10^{+149}:\\ \;\;\;\;\left(\left(1 - \frac{\lambda_2}{\lambda_1}\right) \cdot \left(-\lambda_1\right)\right) \cdot R\\ \mathbf{else}:\\ \;\;\;\;\left(\phi_2 - \phi_1\right) \cdot R\\ \end{array} \end{array} \]

FPCore

NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
 :precision binary64
 (if (<= (- lambda1 lambda2) -5e+149)
   (* (* (- 1.0 (/ lambda2 lambda1)) (- lambda1)) R)
   (* (- phi2 phi1) R)))

C

assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	double tmp;
	if ((lambda1 - lambda2) <= -5e+149) {
		tmp = ((1.0 - (lambda2 / lambda1)) * -lambda1) * R;
	} else {
		tmp = (phi2 - phi1) * R;
	}
	return tmp;
}

Fortran

NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
    real(8), intent (in) :: r
    real(8), intent (in) :: lambda1
    real(8), intent (in) :: lambda2
    real(8), intent (in) :: phi1
    real(8), intent (in) :: phi2
    real(8) :: tmp
    if ((lambda1 - lambda2) <= (-5d+149)) then
        tmp = ((1.0d0 - (lambda2 / lambda1)) * -lambda1) * r
    else
        tmp = (phi2 - phi1) * r
    end if
    code = tmp
end function

Java

assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	double tmp;
	if ((lambda1 - lambda2) <= -5e+149) {
		tmp = ((1.0 - (lambda2 / lambda1)) * -lambda1) * R;
	} else {
		tmp = (phi2 - phi1) * R;
	}
	return tmp;
}

Python

[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2])
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2])
def code(R, lambda1, lambda2, phi1, phi2):
	tmp = 0
	if (lambda1 - lambda2) <= -5e+149:
		tmp = ((1.0 - (lambda2 / lambda1)) * -lambda1) * R
	else:
		tmp = (phi2 - phi1) * R
	return tmp

Julia

R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2])
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2])
function code(R, lambda1, lambda2, phi1, phi2)
	tmp = 0.0
	if (Float64(lambda1 - lambda2) <= -5e+149)
		tmp = Float64(Float64(Float64(1.0 - Float64(lambda2 / lambda1)) * Float64(-lambda1)) * R);
	else
		tmp = Float64(Float64(phi2 - phi1) * R);
	end
	return tmp
end

MATLAB

R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
	tmp = 0.0;
	if ((lambda1 - lambda2) <= -5e+149)
		tmp = ((1.0 - (lambda2 / lambda1)) * -lambda1) * R;
	else
		tmp = (phi2 - phi1) * R;
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[N[(lambda1 - lambda2), $MachinePrecision], -5e+149], N[(N[(N[(1.0 - N[(lambda2 / lambda1), $MachinePrecision]), $MachinePrecision] * (-lambda1)), $MachinePrecision] * R), $MachinePrecision], N[(N[(phi2 - phi1), $MachinePrecision] * R), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (-.f64 lambda1 lambda2) < -4.9999999999999999e149

   1. Initial program 51.9%

      \[R \cdot \sqrt{\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_1 + \phi_2}{2}\right)\right) \cdot \left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_1 + \phi_2}{2}\right)\right) + \left(\phi_1 - \phi_2\right) \cdot \left(\phi_1 - \phi_2\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in lambda1 around -inf

      \[\leadsto R \cdot \color{blue}{\left(-1 \cdot \left(\lambda_1 \cdot \left(\cos \left(\frac{1}{2} \cdot \left(\phi_1 + \phi_2\right)\right) + -1 \cdot \frac{\lambda_2 \cdot \cos \left(\frac{1}{2} \cdot \left(\phi_1 + \phi_2\right)\right)}{\lambda_1}\right)\right)\right)} \]
   4. Step-by-step derivation

      1. associate-*r* N/A

         \[\leadsto R \cdot \color{blue}{\left(\left(-1 \cdot \lambda_1\right) \cdot \left(\cos \left(\frac{1}{2} \cdot \left(\phi_1 + \phi_2\right)\right) + -1 \cdot \frac{\lambda_2 \cdot \cos \left(\frac{1}{2} \cdot \left(\phi_1 + \phi_2\right)\right)}{\lambda_1}\right)\right)} \]

      2. lower-*.f64 N/A

         \[\leadsto R \cdot \color{blue}{\left(\left(-1 \cdot \lambda_1\right) \cdot \left(\cos \left(\frac{1}{2} \cdot \left(\phi_1 + \phi_2\right)\right) + -1 \cdot \frac{\lambda_2 \cdot \cos \left(\frac{1}{2} \cdot \left(\phi_1 + \phi_2\right)\right)}{\lambda_1}\right)\right)} \]

      3. mul-1-neg N/A

         \[\leadsto R \cdot \left(\color{blue}{\left(\mathsf{neg}\left(\lambda_1\right)\right)} \cdot \left(\cos \left(\frac{1}{2} \cdot \left(\phi_1 + \phi_2\right)\right) + -1 \cdot \frac{\lambda_2 \cdot \cos \left(\frac{1}{2} \cdot \left(\phi_1 + \phi_2\right)\right)}{\lambda_1}\right)\right) \]

      4. lower-neg.f64 N/A

         \[\leadsto R \cdot \left(\color{blue}{\left(-\lambda_1\right)} \cdot \left(\cos \left(\frac{1}{2} \cdot \left(\phi_1 + \phi_2\right)\right) + -1 \cdot \frac{\lambda_2 \cdot \cos \left(\frac{1}{2} \cdot \left(\phi_1 + \phi_2\right)\right)}{\lambda_1}\right)\right) \]

      5. mul-1-neg N/A

         \[\leadsto R \cdot \left(\left(-\lambda_1\right) \cdot \left(\cos \left(\frac{1}{2} \cdot \left(\phi_1 + \phi_2\right)\right) + \color{blue}{\left(\mathsf{neg}\left(\frac{\lambda_2 \cdot \cos \left(\frac{1}{2} \cdot \left(\phi_1 + \phi_2\right)\right)}{\lambda_1}\right)\right)}\right)\right) \]

      6. unsub-neg N/A

         \[\leadsto R \cdot \left(\left(-\lambda_1\right) \cdot \color{blue}{\left(\cos \left(\frac{1}{2} \cdot \left(\phi_1 + \phi_2\right)\right) - \frac{\lambda_2 \cdot \cos \left(\frac{1}{2} \cdot \left(\phi_1 + \phi_2\right)\right)}{\lambda_1}\right)}\right) \]

      7. lower--.f64 N/A

         \[\leadsto R \cdot \left(\left(-\lambda_1\right) \cdot \color{blue}{\left(\cos \left(\frac{1}{2} \cdot \left(\phi_1 + \phi_2\right)\right) - \frac{\lambda_2 \cdot \cos \left(\frac{1}{2} \cdot \left(\phi_1 + \phi_2\right)\right)}{\lambda_1}\right)}\right) \]

      8. lower-cos.f64 N/A

         \[\leadsto R \cdot \left(\left(-\lambda_1\right) \cdot \left(\color{blue}{\cos \left(\frac{1}{2} \cdot \left(\phi_1 + \phi_2\right)\right)} - \frac{\lambda_2 \cdot \cos \left(\frac{1}{2} \cdot \left(\phi_1 + \phi_2\right)\right)}{\lambda_1}\right)\right) \]

      9. *-commutative N/A

         \[\leadsto R \cdot \left(\left(-\lambda_1\right) \cdot \left(\cos \color{blue}{\left(\left(\phi_1 + \phi_2\right) \cdot \frac{1}{2}\right)} - \frac{\lambda_2 \cdot \cos \left(\frac{1}{2} \cdot \left(\phi_1 + \phi_2\right)\right)}{\lambda_1}\right)\right) \]

      10. lower-*.f64 N/A

          \[\leadsto R \cdot \left(\left(-\lambda_1\right) \cdot \left(\cos \color{blue}{\left(\left(\phi_1 + \phi_2\right) \cdot \frac{1}{2}\right)} - \frac{\lambda_2 \cdot \cos \left(\frac{1}{2} \cdot \left(\phi_1 + \phi_2\right)\right)}{\lambda_1}\right)\right) \]

      11. +-commutative N/A

          \[\leadsto R \cdot \left(\left(-\lambda_1\right) \cdot \left(\cos \left(\color{blue}{\left(\phi_2 + \phi_1\right)} \cdot \frac{1}{2}\right) - \frac{\lambda_2 \cdot \cos \left(\frac{1}{2} \cdot \left(\phi_1 + \phi_2\right)\right)}{\lambda_1}\right)\right) \]

      12. lower-+.f64 N/A

          \[\leadsto R \cdot \left(\left(-\lambda_1\right) \cdot \left(\cos \left(\color{blue}{\left(\phi_2 + \phi_1\right)} \cdot \frac{1}{2}\right) - \frac{\lambda_2 \cdot \cos \left(\frac{1}{2} \cdot \left(\phi_1 + \phi_2\right)\right)}{\lambda_1}\right)\right) \]

      13. *-commutative N/A

          \[\leadsto R \cdot \left(\left(-\lambda_1\right) \cdot \left(\cos \left(\left(\phi_2 + \phi_1\right) \cdot \frac{1}{2}\right) - \frac{\color{blue}{\cos \left(\frac{1}{2} \cdot \left(\phi_1 + \phi_2\right)\right) \cdot \lambda_2}}{\lambda_1}\right)\right) \]

      14. associate-/l* N/A

          \[\leadsto R \cdot \left(\left(-\lambda_1\right) \cdot \left(\cos \left(\left(\phi_2 + \phi_1\right) \cdot \frac{1}{2}\right) - \color{blue}{\cos \left(\frac{1}{2} \cdot \left(\phi_1 + \phi_2\right)\right) \cdot \frac{\lambda_2}{\lambda_1}}\right)\right) \]

      15. lower-*.f64 N/A

          \[\leadsto R \cdot \left(\left(-\lambda_1\right) \cdot \left(\cos \left(\left(\phi_2 + \phi_1\right) \cdot \frac{1}{2}\right) - \color{blue}{\cos \left(\frac{1}{2} \cdot \left(\phi_1 + \phi_2\right)\right) \cdot \frac{\lambda_2}{\lambda_1}}\right)\right) \]

   5. Applied rewrites 46.2%

      \[\leadsto R \cdot \color{blue}{\left(\left(-\lambda_1\right) \cdot \left(\cos \left(\left(\phi_2 + \phi_1\right) \cdot 0.5\right) - \cos \left(\left(\phi_2 + \phi_1\right) \cdot 0.5\right) \cdot \frac{\lambda_2}{\lambda_1}\right)\right)} \]

   6. Taylor expanded in phi1 around 0

      \[\leadsto R \cdot \left(\left(-\lambda_1\right) \cdot \left(\cos \left(\frac{1}{2} \cdot \phi_2\right) - \color{blue}{\frac{\lambda_2 \cdot \cos \left(\frac{1}{2} \cdot \phi_2\right)}{\lambda_1}}\right)\right) \]
   7. Step-by-step derivation

   8. Applied rewrites 45.4%

      \[\leadsto R \cdot \left(\left(-\lambda_1\right) \cdot \left(\cos \left(\phi_2 \cdot 0.5\right) - \color{blue}{\lambda_2 \cdot \frac{\cos \left(\phi_2 \cdot 0.5\right)}{\lambda_1}}\right)\right) \]

   9. Taylor expanded in phi2 around 0

      \[\leadsto R \cdot \left(\left(-\lambda_1\right) \cdot \left(1 - \frac{\lambda_2}{\color{blue}{\lambda_1}}\right)\right) \]
   10. Step-by-step derivation

   11. Applied rewrites 57.6%

       \[\leadsto R \cdot \left(\left(-\lambda_1\right) \cdot \left(1 - \frac{\lambda_2}{\color{blue}{\lambda_1}}\right)\right) \]

   if -4.9999999999999999e149 < (-.f64 lambda1 lambda2)

   1. Initial program 64.8%

      \[R \cdot \sqrt{\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_1 + \phi_2}{2}\right)\right) \cdot \left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_1 + \phi_2}{2}\right)\right) + \left(\phi_1 - \phi_2\right) \cdot \left(\phi_1 - \phi_2\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in phi1 around -inf

      \[\leadsto R \cdot \color{blue}{\left(-1 \cdot \left(\phi_1 \cdot \left(1 + -1 \cdot \frac{\phi_2}{\phi_1}\right)\right)\right)} \]
   4. Step-by-step derivation

      1. associate-*r* N/A

         \[\leadsto R \cdot \color{blue}{\left(\left(-1 \cdot \phi_1\right) \cdot \left(1 + -1 \cdot \frac{\phi_2}{\phi_1}\right)\right)} \]

      2. lower-*.f64 N/A

         \[\leadsto R \cdot \color{blue}{\left(\left(-1 \cdot \phi_1\right) \cdot \left(1 + -1 \cdot \frac{\phi_2}{\phi_1}\right)\right)} \]

      3. mul-1-neg N/A

         \[\leadsto R \cdot \left(\color{blue}{\left(\mathsf{neg}\left(\phi_1\right)\right)} \cdot \left(1 + -1 \cdot \frac{\phi_2}{\phi_1}\right)\right) \]

      4. lower-neg.f64 N/A

         \[\leadsto R \cdot \left(\color{blue}{\left(-\phi_1\right)} \cdot \left(1 + -1 \cdot \frac{\phi_2}{\phi_1}\right)\right) \]

      5. mul-1-neg N/A

         \[\leadsto R \cdot \left(\left(-\phi_1\right) \cdot \left(1 + \color{blue}{\left(\mathsf{neg}\left(\frac{\phi_2}{\phi_1}\right)\right)}\right)\right) \]

      6. unsub-neg N/A

         \[\leadsto R \cdot \left(\left(-\phi_1\right) \cdot \color{blue}{\left(1 - \frac{\phi_2}{\phi_1}\right)}\right) \]

      7. lower--.f64 N/A

         \[\leadsto R \cdot \left(\left(-\phi_1\right) \cdot \color{blue}{\left(1 - \frac{\phi_2}{\phi_1}\right)}\right) \]

      8. lower-/.f64 32.1

         \[\leadsto R \cdot \left(\left(-\phi_1\right) \cdot \left(1 - \color{blue}{\frac{\phi_2}{\phi_1}}\right)\right) \]

   5. Applied rewrites 32.1%

      \[\leadsto R \cdot \color{blue}{\left(\left(-\phi_1\right) \cdot \left(1 - \frac{\phi_2}{\phi_1}\right)\right)} \]

   6. Taylor expanded in phi2 around 0

      \[\leadsto R \cdot \left(\phi_2 + \color{blue}{-1 \cdot \phi_1}\right) \]
   7. Step-by-step derivation

   8. Applied rewrites 33.2%

      \[\leadsto R \cdot \left(\phi_2 - \color{blue}{\phi_1}\right) \]
3. Recombined 2 regimes into one program.

4. Final simplification 40.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\lambda_1 - \lambda_2 \leq -5 \cdot 10^{+149}:\\ \;\;\;\;\left(\left(1 - \frac{\lambda_2}{\lambda_1}\right) \cdot \left(-\lambda_1\right)\right) \cdot R\\ \mathbf{else}:\\ \;\;\;\;\left(\phi_2 - \phi_1\right) \cdot R\\ \end{array} \]
5. Add Preprocessing

Alternative 8: 51.6% accurate, 19.9× speedup

Math

\[\begin{array}{l} [R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\\\ [R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\ \\ \begin{array}{l} \mathbf{if}\;\phi_1 \leq -1.15 \cdot 10^{-88}:\\ \;\;\;\;\left(-\phi_1\right) \cdot R\\ \mathbf{else}:\\ \;\;\;\;R \cdot \phi_2\\ \end{array} \end{array} \]

FPCore

NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
 :precision binary64
 (if (<= phi1 -1.15e-88) (* (- phi1) R) (* R phi2)))

C

assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	double tmp;
	if (phi1 <= -1.15e-88) {
		tmp = -phi1 * R;
	} else {
		tmp = R * phi2;
	}
	return tmp;
}

Fortran

NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
    real(8), intent (in) :: r
    real(8), intent (in) :: lambda1
    real(8), intent (in) :: lambda2
    real(8), intent (in) :: phi1
    real(8), intent (in) :: phi2
    real(8) :: tmp
    if (phi1 <= (-1.15d-88)) then
        tmp = -phi1 * r
    else
        tmp = r * phi2
    end if
    code = tmp
end function

Java

assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	double tmp;
	if (phi1 <= -1.15e-88) {
		tmp = -phi1 * R;
	} else {
		tmp = R * phi2;
	}
	return tmp;
}

Python

[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2])
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2])
def code(R, lambda1, lambda2, phi1, phi2):
	tmp = 0
	if phi1 <= -1.15e-88:
		tmp = -phi1 * R
	else:
		tmp = R * phi2
	return tmp

Julia

R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2])
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2])
function code(R, lambda1, lambda2, phi1, phi2)
	tmp = 0.0
	if (phi1 <= -1.15e-88)
		tmp = Float64(Float64(-phi1) * R);
	else
		tmp = Float64(R * phi2);
	end
	return tmp
end

MATLAB

R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
	tmp = 0.0;
	if (phi1 <= -1.15e-88)
		tmp = -phi1 * R;
	else
		tmp = R * phi2;
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi1, -1.15e-88], N[((-phi1) * R), $MachinePrecision], N[(R * phi2), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if phi1 < -1.14999999999999993e-88

   1. Initial program 67.2%

      \[R \cdot \sqrt{\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_1 + \phi_2}{2}\right)\right) \cdot \left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_1 + \phi_2}{2}\right)\right) + \left(\phi_1 - \phi_2\right) \cdot \left(\phi_1 - \phi_2\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in phi1 around -inf

      \[\leadsto R \cdot \color{blue}{\left(-1 \cdot \phi_1\right)} \]
   4. Step-by-step derivation

      1. mul-1-neg N/A

         \[\leadsto R \cdot \color{blue}{\left(\mathsf{neg}\left(\phi_1\right)\right)} \]

      2. lower-neg.f64 49.1

         \[\leadsto R \cdot \color{blue}{\left(-\phi_1\right)} \]

   5. Applied rewrites 49.1%

      \[\leadsto R \cdot \color{blue}{\left(-\phi_1\right)} \]

   if -1.14999999999999993e-88 < phi1

   1. Initial program 58.2%

      \[R \cdot \sqrt{\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_1 + \phi_2}{2}\right)\right) \cdot \left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_1 + \phi_2}{2}\right)\right) + \left(\phi_1 - \phi_2\right) \cdot \left(\phi_1 - \phi_2\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in phi2 around inf

      \[\leadsto \color{blue}{R \cdot \phi_2} \]
   4. Step-by-step derivation

      1. lower-*.f64 19.5

         \[\leadsto \color{blue}{R \cdot \phi_2} \]

   5. Applied rewrites 19.5%

      \[\leadsto \color{blue}{R \cdot \phi_2} \]
3. Recombined 2 regimes into one program.

4. Final simplification 28.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\phi_1 \leq -1.15 \cdot 10^{-88}:\\ \;\;\;\;\left(-\phi_1\right) \cdot R\\ \mathbf{else}:\\ \;\;\;\;R \cdot \phi_2\\ \end{array} \]
5. Add Preprocessing

Alternative 9: 58.1% accurate, 31.0× speedup

Math

\[\begin{array}{l} [R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\\\ [R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\ \\ \left(\phi_2 - \phi_1\right) \cdot R \end{array} \]

FPCore

NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (* (- phi2 phi1) R))

C

assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	return (phi2 - phi1) * R;
}

Fortran

NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
    real(8), intent (in) :: r
    real(8), intent (in) :: lambda1
    real(8), intent (in) :: lambda2
    real(8), intent (in) :: phi1
    real(8), intent (in) :: phi2
    code = (phi2 - phi1) * r
end function

Java

assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	return (phi2 - phi1) * R;
}

Python

[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2])
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2])
def code(R, lambda1, lambda2, phi1, phi2):
	return (phi2 - phi1) * R

Julia

R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2])
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2])
function code(R, lambda1, lambda2, phi1, phi2)
	return Float64(Float64(phi2 - phi1) * R)
end

MATLAB

R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp = code(R, lambda1, lambda2, phi1, phi2)
	tmp = (phi2 - phi1) * R;
end

Wolfram

NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(N[(phi2 - phi1), $MachinePrecision] * R), $MachinePrecision]

Derivation

1. Initial program 60.9%

   \[R \cdot \sqrt{\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_1 + \phi_2}{2}\right)\right) \cdot \left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_1 + \phi_2}{2}\right)\right) + \left(\phi_1 - \phi_2\right) \cdot \left(\phi_1 - \phi_2\right)} \]
2. Add Preprocessing

3. Taylor expanded in phi1 around -inf

   \[\leadsto R \cdot \color{blue}{\left(-1 \cdot \left(\phi_1 \cdot \left(1 + -1 \cdot \frac{\phi_2}{\phi_1}\right)\right)\right)} \]
4. Step-by-step derivation

   1. associate-*r* N/A

      \[\leadsto R \cdot \color{blue}{\left(\left(-1 \cdot \phi_1\right) \cdot \left(1 + -1 \cdot \frac{\phi_2}{\phi_1}\right)\right)} \]

   2. lower-*.f64 N/A

      \[\leadsto R \cdot \color{blue}{\left(\left(-1 \cdot \phi_1\right) \cdot \left(1 + -1 \cdot \frac{\phi_2}{\phi_1}\right)\right)} \]

   3. mul-1-neg N/A

      \[\leadsto R \cdot \left(\color{blue}{\left(\mathsf{neg}\left(\phi_1\right)\right)} \cdot \left(1 + -1 \cdot \frac{\phi_2}{\phi_1}\right)\right) \]

   4. lower-neg.f64 N/A

      \[\leadsto R \cdot \left(\color{blue}{\left(-\phi_1\right)} \cdot \left(1 + -1 \cdot \frac{\phi_2}{\phi_1}\right)\right) \]

   5. mul-1-neg N/A

      \[\leadsto R \cdot \left(\left(-\phi_1\right) \cdot \left(1 + \color{blue}{\left(\mathsf{neg}\left(\frac{\phi_2}{\phi_1}\right)\right)}\right)\right) \]

   6. unsub-neg N/A

      \[\leadsto R \cdot \left(\left(-\phi_1\right) \cdot \color{blue}{\left(1 - \frac{\phi_2}{\phi_1}\right)}\right) \]

   7. lower--.f64 N/A

      \[\leadsto R \cdot \left(\left(-\phi_1\right) \cdot \color{blue}{\left(1 - \frac{\phi_2}{\phi_1}\right)}\right) \]

   8. lower-/.f64 28.6

      \[\leadsto R \cdot \left(\left(-\phi_1\right) \cdot \left(1 - \color{blue}{\frac{\phi_2}{\phi_1}}\right)\right) \]

5. Applied rewrites 28.6%

   \[\leadsto R \cdot \color{blue}{\left(\left(-\phi_1\right) \cdot \left(1 - \frac{\phi_2}{\phi_1}\right)\right)} \]

6. Taylor expanded in phi2 around 0

   \[\leadsto R \cdot \left(\phi_2 + \color{blue}{-1 \cdot \phi_1}\right) \]
7. Step-by-step derivation

8. Applied rewrites 29.4%

   \[\leadsto R \cdot \left(\phi_2 - \color{blue}{\phi_1}\right) \]

9. Final simplification 29.4%

   \[\leadsto \left(\phi_2 - \phi_1\right) \cdot R \]
10. Add Preprocessing

Alternative 10: 31.6% accurate, 46.5× speedup

Math

\[\begin{array}{l} [R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\\\ [R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\ \\ R \cdot \phi_2 \end{array} \]

FPCore

NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (* R phi2))

C

assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	return R * phi2;
}

Fortran

NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
    real(8), intent (in) :: r
    real(8), intent (in) :: lambda1
    real(8), intent (in) :: lambda2
    real(8), intent (in) :: phi1
    real(8), intent (in) :: phi2
    code = r * phi2
end function

Java

assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	return R * phi2;
}

Python

[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2])
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2])
def code(R, lambda1, lambda2, phi1, phi2):
	return R * phi2

Julia

R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2])
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2])
function code(R, lambda1, lambda2, phi1, phi2)
	return Float64(R * phi2)
end

MATLAB

R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp = code(R, lambda1, lambda2, phi1, phi2)
	tmp = R * phi2;
end

Wolfram

NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * phi2), $MachinePrecision]

Derivation

1. Initial program 60.9%

   \[R \cdot \sqrt{\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_1 + \phi_2}{2}\right)\right) \cdot \left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_1 + \phi_2}{2}\right)\right) + \left(\phi_1 - \phi_2\right) \cdot \left(\phi_1 - \phi_2\right)} \]
2. Add Preprocessing

3. Taylor expanded in phi2 around inf

   \[\leadsto \color{blue}{R \cdot \phi_2} \]
4. Step-by-step derivation

   1. lower-*.f64 16.8

      \[\leadsto \color{blue}{R \cdot \phi_2} \]

5. Applied rewrites 16.8%

   \[\leadsto \color{blue}{R \cdot \phi_2} \]
6. Add Preprocessing

Reproduce

herbie shell --seed 2024270 
(FPCore (R lambda1 lambda2 phi1 phi2)
  :name "Equirectangular approximation to distance on a great circle"
  :precision binary64
  (* R (sqrt (+ (* (* (- lambda1 lambda2) (cos (/ (+ phi1 phi2) 2.0))) (* (- lambda1 lambda2) (cos (/ (+ phi1 phi2) 2.0)))) (* (- phi1 phi2) (- phi1 phi2))))))