Spherical law of cosines

Percentage Accurate: 73.3% → 93.9%

Time: 26.5s

Alternatives: 30

Speedup: 1.0×

Specification

Math

\[\begin{array}{l} \\ \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right) \cdot R \end{array} \]

FPCore

(FPCore (R lambda1 lambda2 phi1 phi2)
 :precision binary64
 (*
  (acos
   (+
    (* (sin phi1) (sin phi2))
    (* (* (cos phi1) (cos phi2)) (cos (- lambda1 lambda2)))))
  R))

C

double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	return acos(((sin(phi1) * sin(phi2)) + ((cos(phi1) * cos(phi2)) * cos((lambda1 - lambda2))))) * R;
}

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
    code = acos(((sin(phi1) * sin(phi2)) + ((cos(phi1) * cos(phi2)) * cos((lambda1 - lambda2))))) * r
end function

Java

public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	return Math.acos(((Math.sin(phi1) * Math.sin(phi2)) + ((Math.cos(phi1) * Math.cos(phi2)) * Math.cos((lambda1 - lambda2))))) * R;
}

Python

def code(R, lambda1, lambda2, phi1, phi2):
	return math.acos(((math.sin(phi1) * math.sin(phi2)) + ((math.cos(phi1) * math.cos(phi2)) * math.cos((lambda1 - lambda2))))) * R

Julia

function code(R, lambda1, lambda2, phi1, phi2)
	return Float64(acos(Float64(Float64(sin(phi1) * sin(phi2)) + Float64(Float64(cos(phi1) * cos(phi2)) * cos(Float64(lambda1 - lambda2))))) * R)
end

MATLAB

function tmp = code(R, lambda1, lambda2, phi1, phi2)
	tmp = acos(((sin(phi1) * sin(phi2)) + ((cos(phi1) * cos(phi2)) * cos((lambda1 - lambda2))))) * R;
end

Wolfram

code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(N[ArcCos[N[(N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision] + N[(N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision] * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * R), $MachinePrecision]

Initial Program: 73.3% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right) \cdot R \end{array} \]

FPCore

(FPCore (R lambda1 lambda2 phi1 phi2)
 :precision binary64
 (*
  (acos
   (+
    (* (sin phi1) (sin phi2))
    (* (* (cos phi1) (cos phi2)) (cos (- lambda1 lambda2)))))
  R))

C

double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	return acos(((sin(phi1) * sin(phi2)) + ((cos(phi1) * cos(phi2)) * cos((lambda1 - lambda2))))) * R;
}

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
    code = acos(((sin(phi1) * sin(phi2)) + ((cos(phi1) * cos(phi2)) * cos((lambda1 - lambda2))))) * r
end function

Java

public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	return Math.acos(((Math.sin(phi1) * Math.sin(phi2)) + ((Math.cos(phi1) * Math.cos(phi2)) * Math.cos((lambda1 - lambda2))))) * R;
}

Python

def code(R, lambda1, lambda2, phi1, phi2):
	return math.acos(((math.sin(phi1) * math.sin(phi2)) + ((math.cos(phi1) * math.cos(phi2)) * math.cos((lambda1 - lambda2))))) * R

Julia

function code(R, lambda1, lambda2, phi1, phi2)
	return Float64(acos(Float64(Float64(sin(phi1) * sin(phi2)) + Float64(Float64(cos(phi1) * cos(phi2)) * cos(Float64(lambda1 - lambda2))))) * R)
end

MATLAB

function tmp = code(R, lambda1, lambda2, phi1, phi2)
	tmp = acos(((sin(phi1) * sin(phi2)) + ((cos(phi1) * cos(phi2)) * cos((lambda1 - lambda2))))) * R;
end

Wolfram

code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(N[ArcCos[N[(N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision] + N[(N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision] * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * R), $MachinePrecision]

Alternative 1: 93.9% accurate, 0.6× speedup

Math

\[\begin{array}{l} [R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\ \\ \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \cos \phi_2 \cdot \left(\cos \phi_1 \cdot \mathsf{fma}\left(\cos \lambda_2, \cos \lambda_1, \sin \lambda_1 \cdot \sin \lambda_2\right)\right)\right) \cdot R \end{array} \]

FPCore

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
 (*
  (acos
   (+
    (* (sin phi1) (sin phi2))
    (*
     (cos phi2)
     (*
      (cos phi1)
      (fma (cos lambda2) (cos lambda1) (* (sin lambda1) (sin lambda2)))))))
  R))

C

assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	return acos(((sin(phi1) * sin(phi2)) + (cos(phi2) * (cos(phi1) * fma(cos(lambda2), cos(lambda1), (sin(lambda1) * sin(lambda2))))))) * R;
}

Julia

R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2])
function code(R, lambda1, lambda2, phi1, phi2)
	return Float64(acos(Float64(Float64(sin(phi1) * sin(phi2)) + Float64(cos(phi2) * Float64(cos(phi1) * fma(cos(lambda2), cos(lambda1), Float64(sin(lambda1) * sin(lambda2))))))) * R)
end

Wolfram

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[ArcCos[N[(N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[phi2], $MachinePrecision] * N[(N[Cos[phi1], $MachinePrecision] * N[(N[Cos[lambda2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision] + N[(N[Sin[lambda1], $MachinePrecision] * N[Sin[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * R), $MachinePrecision]

Derivation

1. Initial program 75.2%

   \[\cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right) \cdot R \]
2. Add Preprocessing
3. Step-by-step derivation

   1. cos-diff 95.8%

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

   2. distribute-lft-in 95.8%

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

4. Applied egg-rr 95.8%

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

   1. distribute-lft-out 95.8%

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

   2. *-commutative 95.8%

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

   3. associate-*l* 95.8%

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

   4. cos-neg 95.8%

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

   5. *-commutative 95.8%

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

   6. fma-define 95.8%

      \[\leadsto \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \cos \phi_2 \cdot \left(\cos \phi_1 \cdot \color{blue}{\mathsf{fma}\left(\cos \left(-\lambda_2\right), \cos \lambda_1, \sin \lambda_1 \cdot \sin \lambda_2\right)}\right)\right) \cdot R \]

   7. cos-neg 95.8%

      \[\leadsto \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \cos \phi_2 \cdot \left(\cos \phi_1 \cdot \mathsf{fma}\left(\color{blue}{\cos \lambda_2}, \cos \lambda_1, \sin \lambda_1 \cdot \sin \lambda_2\right)\right)\right) \cdot R \]

6. Simplified 95.8%

   \[\leadsto \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \color{blue}{\cos \phi_2 \cdot \left(\cos \phi_1 \cdot \mathsf{fma}\left(\cos \lambda_2, \cos \lambda_1, \sin \lambda_1 \cdot \sin \lambda_2\right)\right)}\right) \cdot R \]
7. Add Preprocessing

Alternative 2: 83.6% accurate, 0.7× speedup

Math

\[\begin{array}{l} [R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\ \\ \begin{array}{l} t_0 := \cos \left(\lambda_1 - \lambda_2\right)\\ t_1 := \sin \phi_1 \cdot \sin \phi_2\\ \mathbf{if}\;\phi_2 \leq -3.5 \cdot 10^{-7}:\\ \;\;\;\;R \cdot \cos^{-1} \left(t\_1 + \mathsf{log1p}\left(\mathsf{expm1}\left(\cos \phi_2 \cdot \left(\cos \phi_1 \cdot t\_0\right)\right)\right)\right)\\ \mathbf{elif}\;\phi_2 \leq 1.65 \cdot 10^{-6}:\\ \;\;\;\;R \cdot \cos^{-1} \left(t\_1 + \cos \phi_1 \cdot \left(\sin \lambda_1 \cdot \sin \lambda_2 + \cos \lambda_2 \cdot \cos \lambda_1\right)\right)\\ \mathbf{else}:\\ \;\;\;\;R \cdot e^{\log \cos^{-1} \left(\mathsf{fma}\left(\cos \phi_2 \cdot \cos \phi_1, t\_0, t\_1\right)\right)}\\ \end{array} \end{array} \]

FPCore

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 (- lambda1 lambda2))) (t_1 (* (sin phi1) (sin phi2))))
   (if (<= phi2 -3.5e-7)
     (* R (acos (+ t_1 (log1p (expm1 (* (cos phi2) (* (cos phi1) t_0)))))))
     (if (<= phi2 1.65e-6)
       (*
        R
        (acos
         (+
          t_1
          (*
           (cos phi1)
           (+
            (* (sin lambda1) (sin lambda2))
            (* (cos lambda2) (cos lambda1)))))))
       (* R (exp (log (acos (fma (* (cos phi2) (cos phi1)) t_0 t_1)))))))))

C

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((lambda1 - lambda2));
	double t_1 = sin(phi1) * sin(phi2);
	double tmp;
	if (phi2 <= -3.5e-7) {
		tmp = R * acos((t_1 + log1p(expm1((cos(phi2) * (cos(phi1) * t_0))))));
	} else if (phi2 <= 1.65e-6) {
		tmp = R * acos((t_1 + (cos(phi1) * ((sin(lambda1) * sin(lambda2)) + (cos(lambda2) * cos(lambda1))))));
	} else {
		tmp = R * exp(log(acos(fma((cos(phi2) * cos(phi1)), t_0, t_1))));
	}
	return tmp;
}

Julia

R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2])
function code(R, lambda1, lambda2, phi1, phi2)
	t_0 = cos(Float64(lambda1 - lambda2))
	t_1 = Float64(sin(phi1) * sin(phi2))
	tmp = 0.0
	if (phi2 <= -3.5e-7)
		tmp = Float64(R * acos(Float64(t_1 + log1p(expm1(Float64(cos(phi2) * Float64(cos(phi1) * t_0)))))));
	elseif (phi2 <= 1.65e-6)
		tmp = Float64(R * acos(Float64(t_1 + Float64(cos(phi1) * Float64(Float64(sin(lambda1) * sin(lambda2)) + Float64(cos(lambda2) * cos(lambda1)))))));
	else
		tmp = Float64(R * exp(log(acos(fma(Float64(cos(phi2) * cos(phi1)), t_0, t_1)))));
	end
	return tmp
end

Wolfram

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[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$1 = N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[phi2, -3.5e-7], N[(R * N[ArcCos[N[(t$95$1 + N[Log[1 + N[(Exp[N[(N[Cos[phi2], $MachinePrecision] * N[(N[Cos[phi1], $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]] - 1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[phi2, 1.65e-6], N[(R * N[ArcCos[N[(t$95$1 + N[(N[Cos[phi1], $MachinePrecision] * N[(N[(N[Sin[lambda1], $MachinePrecision] * N[Sin[lambda2], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[lambda2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[Exp[N[Log[N[ArcCos[N[(N[(N[Cos[phi2], $MachinePrecision] * N[Cos[phi1], $MachinePrecision]), $MachinePrecision] * t$95$0 + t$95$1), $MachinePrecision]], $MachinePrecision]], $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]]

Derivation

1. Split input into 3 regimes

2. if phi2 < -3.49999999999999984e-7

   1. Initial program 83.8%

      \[\cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right) \cdot R \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. log1p-expm1-u 83.8%

         \[\leadsto \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \color{blue}{\mathsf{log1p}\left(\mathsf{expm1}\left(\left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right)\right)}\right) \cdot R \]

      2. *-commutative 83.8%

         \[\leadsto \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \mathsf{log1p}\left(\mathsf{expm1}\left(\color{blue}{\left(\cos \phi_2 \cdot \cos \phi_1\right)} \cdot \cos \left(\lambda_1 - \lambda_2\right)\right)\right)\right) \cdot R \]

      3. associate-*l* 83.8%

         \[\leadsto \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \mathsf{log1p}\left(\mathsf{expm1}\left(\color{blue}{\cos \phi_2 \cdot \left(\cos \phi_1 \cdot \cos \left(\lambda_1 - \lambda_2\right)\right)}\right)\right)\right) \cdot R \]

   4. Applied egg-rr 83.8%

      \[\leadsto \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \color{blue}{\mathsf{log1p}\left(\mathsf{expm1}\left(\cos \phi_2 \cdot \left(\cos \phi_1 \cdot \cos \left(\lambda_1 - \lambda_2\right)\right)\right)\right)}\right) \cdot R \]

   if -3.49999999999999984e-7 < phi2 < 1.65000000000000008e-6

   1. Initial program 71.7%

      \[\cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right) \cdot R \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. cos-diff 92.7%

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

      2. distribute-lft-in 92.7%

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

   4. Applied egg-rr 92.7%

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

      1. distribute-lft-out 92.7%

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

      2. *-commutative 92.7%

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

      3. associate-*l* 92.7%

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

      4. cos-neg 92.7%

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

      5. *-commutative 92.7%

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

      6. fma-define 92.7%

         \[\leadsto \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \cos \phi_2 \cdot \left(\cos \phi_1 \cdot \color{blue}{\mathsf{fma}\left(\cos \left(-\lambda_2\right), \cos \lambda_1, \sin \lambda_1 \cdot \sin \lambda_2\right)}\right)\right) \cdot R \]

      7. cos-neg 92.7%

         \[\leadsto \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \cos \phi_2 \cdot \left(\cos \phi_1 \cdot \mathsf{fma}\left(\color{blue}{\cos \lambda_2}, \cos \lambda_1, \sin \lambda_1 \cdot \sin \lambda_2\right)\right)\right) \cdot R \]

   6. Simplified 92.7%

      \[\leadsto \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \color{blue}{\cos \phi_2 \cdot \left(\cos \phi_1 \cdot \mathsf{fma}\left(\cos \lambda_2, \cos \lambda_1, \sin \lambda_1 \cdot \sin \lambda_2\right)\right)}\right) \cdot R \]

   7. Taylor expanded in phi2 around 0 92.7%

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

   if 1.65000000000000008e-6 < phi2

   1. Initial program 73.3%

      \[\cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right) \cdot R \]

   3. Simplified 73.2%

      \[\leadsto \color{blue}{\cos^{-1} \left(\mathsf{fma}\left(\cos \phi_1, \cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right), \sin \phi_1 \cdot \sin \phi_2\right)\right) \cdot R} \]
   4. Add Preprocessing
   5. Step-by-step derivation

      1. fma-undefine 73.3%

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

      2. associate-*r* 73.3%

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

      3. +-commutative 73.3%

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

      4. add-exp-log 73.4%

         \[\leadsto \color{blue}{e^{\log \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right)}} \cdot R \]

      5. +-commutative 73.4%

         \[\leadsto e^{\log \cos^{-1} \color{blue}{\left(\left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right) + \sin \phi_1 \cdot \sin \phi_2\right)}} \cdot R \]

      6. fma-define 73.4%

         \[\leadsto e^{\log \cos^{-1} \color{blue}{\left(\mathsf{fma}\left(\cos \phi_1 \cdot \cos \phi_2, \cos \left(\lambda_1 - \lambda_2\right), \sin \phi_1 \cdot \sin \phi_2\right)\right)}} \cdot R \]

   6. Applied egg-rr 73.4%

      \[\leadsto \color{blue}{e^{\log \cos^{-1} \left(\mathsf{fma}\left(\cos \phi_1 \cdot \cos \phi_2, \cos \left(\lambda_1 - \lambda_2\right), \sin \phi_1 \cdot \sin \phi_2\right)\right)}} \cdot R \]
3. Recombined 3 regimes into one program.

4. Final simplification 86.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\phi_2 \leq -3.5 \cdot 10^{-7}:\\ \;\;\;\;R \cdot \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \mathsf{log1p}\left(\mathsf{expm1}\left(\cos \phi_2 \cdot \left(\cos \phi_1 \cdot \cos \left(\lambda_1 - \lambda_2\right)\right)\right)\right)\right)\\ \mathbf{elif}\;\phi_2 \leq 1.65 \cdot 10^{-6}:\\ \;\;\;\;R \cdot \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \cos \phi_1 \cdot \left(\sin \lambda_1 \cdot \sin \lambda_2 + \cos \lambda_2 \cdot \cos \lambda_1\right)\right)\\ \mathbf{else}:\\ \;\;\;\;R \cdot e^{\log \cos^{-1} \left(\mathsf{fma}\left(\cos \phi_2 \cdot \cos \phi_1, \cos \left(\lambda_1 - \lambda_2\right), \sin \phi_1 \cdot \sin \phi_2\right)\right)}\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 93.9% accurate, 0.7× speedup

Math

\[\begin{array}{l} [R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\ \\ R \cdot \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_2 \cdot \cos \phi_1\right) \cdot \left(\sin \lambda_1 \cdot \sin \lambda_2 + \cos \lambda_2 \cdot \cos \lambda_1\right)\right) \end{array} \]

FPCore

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
  (acos
   (+
    (* (sin phi1) (sin phi2))
    (*
     (* (cos phi2) (cos phi1))
     (+ (* (sin lambda1) (sin lambda2)) (* (cos lambda2) (cos lambda1))))))))

C

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

Fortran

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 * acos(((sin(phi1) * sin(phi2)) + ((cos(phi2) * cos(phi1)) * ((sin(lambda1) * sin(lambda2)) + (cos(lambda2) * cos(lambda1))))))
end function

Java

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 * Math.acos(((Math.sin(phi1) * Math.sin(phi2)) + ((Math.cos(phi2) * Math.cos(phi1)) * ((Math.sin(lambda1) * Math.sin(lambda2)) + (Math.cos(lambda2) * Math.cos(lambda1))))));
}

Python

[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2])
def code(R, lambda1, lambda2, phi1, phi2):
	return R * math.acos(((math.sin(phi1) * math.sin(phi2)) + ((math.cos(phi2) * math.cos(phi1)) * ((math.sin(lambda1) * math.sin(lambda2)) + (math.cos(lambda2) * math.cos(lambda1))))))

Julia

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

MATLAB

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

Wolfram

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 * N[ArcCos[N[(N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision] + N[(N[(N[Cos[phi2], $MachinePrecision] * N[Cos[phi1], $MachinePrecision]), $MachinePrecision] * N[(N[(N[Sin[lambda1], $MachinePrecision] * N[Sin[lambda2], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[lambda2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 75.2%

   \[\cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right) \cdot R \]
2. Add Preprocessing
3. Step-by-step derivation

   1. cos-diff 95.8%

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

   2. +-commutative 95.8%

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

4. Applied egg-rr 95.8%

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

5. Final simplification 95.8%

   \[\leadsto R \cdot \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_2 \cdot \cos \phi_1\right) \cdot \left(\sin \lambda_1 \cdot \sin \lambda_2 + \cos \lambda_2 \cdot \cos \lambda_1\right)\right) \]
6. Add Preprocessing

Alternative 4: 93.9% accurate, 0.7× speedup

Math

\[\begin{array}{l} [R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\ \\ R \cdot \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \cos \phi_1 \cdot \left(\cos \phi_2 \cdot \left(\sin \lambda_1 \cdot \sin \lambda_2 + \cos \lambda_2 \cdot \cos \lambda_1\right)\right)\right) \end{array} \]

FPCore

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
  (acos
   (+
    (* (sin phi1) (sin phi2))
    (*
     (cos phi1)
     (*
      (cos phi2)
      (+ (* (sin lambda1) (sin lambda2)) (* (cos lambda2) (cos lambda1)))))))))

C

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

Fortran

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 * acos(((sin(phi1) * sin(phi2)) + (cos(phi1) * (cos(phi2) * ((sin(lambda1) * sin(lambda2)) + (cos(lambda2) * cos(lambda1)))))))
end function

Java

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 * Math.acos(((Math.sin(phi1) * Math.sin(phi2)) + (Math.cos(phi1) * (Math.cos(phi2) * ((Math.sin(lambda1) * Math.sin(lambda2)) + (Math.cos(lambda2) * Math.cos(lambda1)))))));
}

Python

[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2])
def code(R, lambda1, lambda2, phi1, phi2):
	return R * math.acos(((math.sin(phi1) * math.sin(phi2)) + (math.cos(phi1) * (math.cos(phi2) * ((math.sin(lambda1) * math.sin(lambda2)) + (math.cos(lambda2) * math.cos(lambda1)))))))

Julia

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

MATLAB

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

Wolfram

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 * N[ArcCos[N[(N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[phi1], $MachinePrecision] * N[(N[Cos[phi2], $MachinePrecision] * N[(N[(N[Sin[lambda1], $MachinePrecision] * N[Sin[lambda2], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[lambda2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 75.2%

   \[\cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right) \cdot R \]
2. Add Preprocessing
3. Step-by-step derivation

   1. cos-diff 95.8%

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

   2. distribute-lft-in 95.8%

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

4. Applied egg-rr 95.8%

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

   1. distribute-lft-out 95.8%

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

   2. *-commutative 95.8%

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

   3. associate-*l* 95.8%

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

   4. cos-neg 95.8%

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

   5. *-commutative 95.8%

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

   6. fma-define 95.8%

      \[\leadsto \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \cos \phi_2 \cdot \left(\cos \phi_1 \cdot \color{blue}{\mathsf{fma}\left(\cos \left(-\lambda_2\right), \cos \lambda_1, \sin \lambda_1 \cdot \sin \lambda_2\right)}\right)\right) \cdot R \]

   7. cos-neg 95.8%

      \[\leadsto \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \cos \phi_2 \cdot \left(\cos \phi_1 \cdot \mathsf{fma}\left(\color{blue}{\cos \lambda_2}, \cos \lambda_1, \sin \lambda_1 \cdot \sin \lambda_2\right)\right)\right) \cdot R \]

6. Simplified 95.8%

   \[\leadsto \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \color{blue}{\cos \phi_2 \cdot \left(\cos \phi_1 \cdot \mathsf{fma}\left(\cos \lambda_2, \cos \lambda_1, \sin \lambda_1 \cdot \sin \lambda_2\right)\right)}\right) \cdot R \]

7. Taylor expanded in phi2 around inf 95.8%

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

8. Final simplification 95.8%

   \[\leadsto R \cdot \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \cos \phi_1 \cdot \left(\cos \phi_2 \cdot \left(\sin \lambda_1 \cdot \sin \lambda_2 + \cos \lambda_2 \cdot \cos \lambda_1\right)\right)\right) \]
9. Add Preprocessing

Alternative 5: 83.6% accurate, 0.7× speedup

Math

\[\begin{array}{l} [R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\ \\ \begin{array}{l} t_0 := \cos \left(\lambda_1 - \lambda_2\right)\\ t_1 := \sin \phi_1 \cdot \sin \phi_2\\ \mathbf{if}\;\phi_2 \leq -3.4 \cdot 10^{-6}:\\ \;\;\;\;R \cdot \cos^{-1} \left(t\_1 + \mathsf{log1p}\left(\mathsf{expm1}\left(\cos \phi_2 \cdot \left(\cos \phi_1 \cdot t\_0\right)\right)\right)\right)\\ \mathbf{elif}\;\phi_2 \leq 3.1 \cdot 10^{-6}:\\ \;\;\;\;R \cdot \cos^{-1} \left(t\_1 + \cos \phi_1 \cdot \left(\sin \lambda_1 \cdot \sin \lambda_2 + \cos \lambda_2 \cdot \cos \lambda_1\right)\right)\\ \mathbf{else}:\\ \;\;\;\;R \cdot \cos^{-1} \left(\sin \phi_2 \cdot \log \left(e^{\sin \phi_1}\right) + \left(\cos \phi_2 \cdot \cos \phi_1\right) \cdot t\_0\right)\\ \end{array} \end{array} \]

FPCore

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 (- lambda1 lambda2))) (t_1 (* (sin phi1) (sin phi2))))
   (if (<= phi2 -3.4e-6)
     (* R (acos (+ t_1 (log1p (expm1 (* (cos phi2) (* (cos phi1) t_0)))))))
     (if (<= phi2 3.1e-6)
       (*
        R
        (acos
         (+
          t_1
          (*
           (cos phi1)
           (+
            (* (sin lambda1) (sin lambda2))
            (* (cos lambda2) (cos lambda1)))))))
       (*
        R
        (acos
         (+
          (* (sin phi2) (log (exp (sin phi1))))
          (* (* (cos phi2) (cos phi1)) t_0))))))))

C

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((lambda1 - lambda2));
	double t_1 = sin(phi1) * sin(phi2);
	double tmp;
	if (phi2 <= -3.4e-6) {
		tmp = R * acos((t_1 + log1p(expm1((cos(phi2) * (cos(phi1) * t_0))))));
	} else if (phi2 <= 3.1e-6) {
		tmp = R * acos((t_1 + (cos(phi1) * ((sin(lambda1) * sin(lambda2)) + (cos(lambda2) * cos(lambda1))))));
	} else {
		tmp = R * acos(((sin(phi2) * log(exp(sin(phi1)))) + ((cos(phi2) * cos(phi1)) * t_0)));
	}
	return tmp;
}

Java

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((lambda1 - lambda2));
	double t_1 = Math.sin(phi1) * Math.sin(phi2);
	double tmp;
	if (phi2 <= -3.4e-6) {
		tmp = R * Math.acos((t_1 + Math.log1p(Math.expm1((Math.cos(phi2) * (Math.cos(phi1) * t_0))))));
	} else if (phi2 <= 3.1e-6) {
		tmp = R * Math.acos((t_1 + (Math.cos(phi1) * ((Math.sin(lambda1) * Math.sin(lambda2)) + (Math.cos(lambda2) * Math.cos(lambda1))))));
	} else {
		tmp = R * Math.acos(((Math.sin(phi2) * Math.log(Math.exp(Math.sin(phi1)))) + ((Math.cos(phi2) * Math.cos(phi1)) * t_0)));
	}
	return tmp;
}

Python

[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2])
def code(R, lambda1, lambda2, phi1, phi2):
	t_0 = math.cos((lambda1 - lambda2))
	t_1 = math.sin(phi1) * math.sin(phi2)
	tmp = 0
	if phi2 <= -3.4e-6:
		tmp = R * math.acos((t_1 + math.log1p(math.expm1((math.cos(phi2) * (math.cos(phi1) * t_0))))))
	elif phi2 <= 3.1e-6:
		tmp = R * math.acos((t_1 + (math.cos(phi1) * ((math.sin(lambda1) * math.sin(lambda2)) + (math.cos(lambda2) * math.cos(lambda1))))))
	else:
		tmp = R * math.acos(((math.sin(phi2) * math.log(math.exp(math.sin(phi1)))) + ((math.cos(phi2) * math.cos(phi1)) * t_0)))
	return tmp

Julia

R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2])
function code(R, lambda1, lambda2, phi1, phi2)
	t_0 = cos(Float64(lambda1 - lambda2))
	t_1 = Float64(sin(phi1) * sin(phi2))
	tmp = 0.0
	if (phi2 <= -3.4e-6)
		tmp = Float64(R * acos(Float64(t_1 + log1p(expm1(Float64(cos(phi2) * Float64(cos(phi1) * t_0)))))));
	elseif (phi2 <= 3.1e-6)
		tmp = Float64(R * acos(Float64(t_1 + Float64(cos(phi1) * Float64(Float64(sin(lambda1) * sin(lambda2)) + Float64(cos(lambda2) * cos(lambda1)))))));
	else
		tmp = Float64(R * acos(Float64(Float64(sin(phi2) * log(exp(sin(phi1)))) + Float64(Float64(cos(phi2) * cos(phi1)) * t_0))));
	end
	return tmp
end

Wolfram

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[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$1 = N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[phi2, -3.4e-6], N[(R * N[ArcCos[N[(t$95$1 + N[Log[1 + N[(Exp[N[(N[Cos[phi2], $MachinePrecision] * N[(N[Cos[phi1], $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]] - 1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[phi2, 3.1e-6], N[(R * N[ArcCos[N[(t$95$1 + N[(N[Cos[phi1], $MachinePrecision] * N[(N[(N[Sin[lambda1], $MachinePrecision] * N[Sin[lambda2], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[lambda2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[(N[Sin[phi2], $MachinePrecision] * N[Log[N[Exp[N[Sin[phi1], $MachinePrecision]], $MachinePrecision]], $MachinePrecision]), $MachinePrecision] + N[(N[(N[Cos[phi2], $MachinePrecision] * N[Cos[phi1], $MachinePrecision]), $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]]

Derivation

1. Split input into 3 regimes

2. if phi2 < -3.40000000000000006e-6

   1. Initial program 83.8%

      \[\cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right) \cdot R \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. log1p-expm1-u 83.8%

         \[\leadsto \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \color{blue}{\mathsf{log1p}\left(\mathsf{expm1}\left(\left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right)\right)}\right) \cdot R \]

      2. *-commutative 83.8%

         \[\leadsto \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \mathsf{log1p}\left(\mathsf{expm1}\left(\color{blue}{\left(\cos \phi_2 \cdot \cos \phi_1\right)} \cdot \cos \left(\lambda_1 - \lambda_2\right)\right)\right)\right) \cdot R \]

      3. associate-*l* 83.8%

         \[\leadsto \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \mathsf{log1p}\left(\mathsf{expm1}\left(\color{blue}{\cos \phi_2 \cdot \left(\cos \phi_1 \cdot \cos \left(\lambda_1 - \lambda_2\right)\right)}\right)\right)\right) \cdot R \]

   4. Applied egg-rr 83.8%

      \[\leadsto \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \color{blue}{\mathsf{log1p}\left(\mathsf{expm1}\left(\cos \phi_2 \cdot \left(\cos \phi_1 \cdot \cos \left(\lambda_1 - \lambda_2\right)\right)\right)\right)}\right) \cdot R \]

   if -3.40000000000000006e-6 < phi2 < 3.1e-6

   1. Initial program 71.7%

      \[\cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right) \cdot R \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. cos-diff 92.7%

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

      2. distribute-lft-in 92.7%

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

   4. Applied egg-rr 92.7%

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

      1. distribute-lft-out 92.7%

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

      2. *-commutative 92.7%

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

      3. associate-*l* 92.7%

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

      4. cos-neg 92.7%

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

      5. *-commutative 92.7%

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

      6. fma-define 92.7%

         \[\leadsto \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \cos \phi_2 \cdot \left(\cos \phi_1 \cdot \color{blue}{\mathsf{fma}\left(\cos \left(-\lambda_2\right), \cos \lambda_1, \sin \lambda_1 \cdot \sin \lambda_2\right)}\right)\right) \cdot R \]

      7. cos-neg 92.7%

         \[\leadsto \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \cos \phi_2 \cdot \left(\cos \phi_1 \cdot \mathsf{fma}\left(\color{blue}{\cos \lambda_2}, \cos \lambda_1, \sin \lambda_1 \cdot \sin \lambda_2\right)\right)\right) \cdot R \]

   6. Simplified 92.7%

      \[\leadsto \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \color{blue}{\cos \phi_2 \cdot \left(\cos \phi_1 \cdot \mathsf{fma}\left(\cos \lambda_2, \cos \lambda_1, \sin \lambda_1 \cdot \sin \lambda_2\right)\right)}\right) \cdot R \]

   7. Taylor expanded in phi2 around 0 92.7%

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

   if 3.1e-6 < phi2

   1. Initial program 73.3%

      \[\cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right) \cdot R \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. add-log-exp 73.3%

         \[\leadsto \cos^{-1} \left(\color{blue}{\log \left(e^{\sin \phi_1}\right)} \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right) \cdot R \]

   4. Applied egg-rr 73.3%

      \[\leadsto \cos^{-1} \left(\color{blue}{\log \left(e^{\sin \phi_1}\right)} \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right) \cdot R \]
3. Recombined 3 regimes into one program.

4. Final simplification 85.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\phi_2 \leq -3.4 \cdot 10^{-6}:\\ \;\;\;\;R \cdot \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \mathsf{log1p}\left(\mathsf{expm1}\left(\cos \phi_2 \cdot \left(\cos \phi_1 \cdot \cos \left(\lambda_1 - \lambda_2\right)\right)\right)\right)\right)\\ \mathbf{elif}\;\phi_2 \leq 3.1 \cdot 10^{-6}:\\ \;\;\;\;R \cdot \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \cos \phi_1 \cdot \left(\sin \lambda_1 \cdot \sin \lambda_2 + \cos \lambda_2 \cdot \cos \lambda_1\right)\right)\\ \mathbf{else}:\\ \;\;\;\;R \cdot \cos^{-1} \left(\sin \phi_2 \cdot \log \left(e^{\sin \phi_1}\right) + \left(\cos \phi_2 \cdot \cos \phi_1\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 83.2% accurate, 0.7× speedup

Math

\[\begin{array}{l} [R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\ \\ \begin{array}{l} t_0 := \cos \left(\lambda_1 - \lambda_2\right)\\ t_1 := \sin \phi_1 \cdot \sin \phi_2\\ \mathbf{if}\;\phi_1 \leq -1.66 \cdot 10^{-6}:\\ \;\;\;\;R \cdot \cos^{-1} \left(t\_1 + \left(\cos \phi_2 \cdot \cos \phi_1\right) \cdot \sqrt[3]{{t\_0}^{3}}\right)\\ \mathbf{elif}\;\phi_1 \leq 2.4 \cdot 10^{-5}:\\ \;\;\;\;R \cdot \cos^{-1} \left(\phi_1 \cdot \sin \phi_2 + \cos \phi_2 \cdot \mathsf{fma}\left(\cos \lambda_2, \cos \lambda_1, \sin \lambda_1 \cdot \sin \lambda_2\right)\right)\\ \mathbf{else}:\\ \;\;\;\;R \cdot \cos^{-1} \left(t\_1 + \cos \phi_1 \cdot \left(\cos \phi_2 \cdot t\_0\right)\right)\\ \end{array} \end{array} \]

FPCore

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 (- lambda1 lambda2))) (t_1 (* (sin phi1) (sin phi2))))
   (if (<= phi1 -1.66e-6)
     (* R (acos (+ t_1 (* (* (cos phi2) (cos phi1)) (cbrt (pow t_0 3.0))))))
     (if (<= phi1 2.4e-5)
       (*
        R
        (acos
         (+
          (* phi1 (sin phi2))
          (*
           (cos phi2)
           (fma
            (cos lambda2)
            (cos lambda1)
            (* (sin lambda1) (sin lambda2)))))))
       (* R (acos (+ t_1 (* (cos phi1) (* (cos phi2) t_0)))))))))

C

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((lambda1 - lambda2));
	double t_1 = sin(phi1) * sin(phi2);
	double tmp;
	if (phi1 <= -1.66e-6) {
		tmp = R * acos((t_1 + ((cos(phi2) * cos(phi1)) * cbrt(pow(t_0, 3.0)))));
	} else if (phi1 <= 2.4e-5) {
		tmp = R * acos(((phi1 * sin(phi2)) + (cos(phi2) * fma(cos(lambda2), cos(lambda1), (sin(lambda1) * sin(lambda2))))));
	} else {
		tmp = R * acos((t_1 + (cos(phi1) * (cos(phi2) * t_0))));
	}
	return tmp;
}

Julia

R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2])
function code(R, lambda1, lambda2, phi1, phi2)
	t_0 = cos(Float64(lambda1 - lambda2))
	t_1 = Float64(sin(phi1) * sin(phi2))
	tmp = 0.0
	if (phi1 <= -1.66e-6)
		tmp = Float64(R * acos(Float64(t_1 + Float64(Float64(cos(phi2) * cos(phi1)) * cbrt((t_0 ^ 3.0))))));
	elseif (phi1 <= 2.4e-5)
		tmp = Float64(R * acos(Float64(Float64(phi1 * sin(phi2)) + Float64(cos(phi2) * fma(cos(lambda2), cos(lambda1), Float64(sin(lambda1) * sin(lambda2)))))));
	else
		tmp = Float64(R * acos(Float64(t_1 + Float64(cos(phi1) * Float64(cos(phi2) * t_0)))));
	end
	return tmp
end

Wolfram

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[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$1 = N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[phi1, -1.66e-6], N[(R * N[ArcCos[N[(t$95$1 + N[(N[(N[Cos[phi2], $MachinePrecision] * N[Cos[phi1], $MachinePrecision]), $MachinePrecision] * N[Power[N[Power[t$95$0, 3.0], $MachinePrecision], 1/3], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[phi1, 2.4e-5], N[(R * N[ArcCos[N[(N[(phi1 * N[Sin[phi2], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[phi2], $MachinePrecision] * N[(N[Cos[lambda2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision] + N[(N[Sin[lambda1], $MachinePrecision] * N[Sin[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(t$95$1 + N[(N[Cos[phi1], $MachinePrecision] * N[(N[Cos[phi2], $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]]

Derivation

1. Split input into 3 regimes

2. if phi1 < -1.65999999999999999e-6

   1. Initial program 74.5%

      \[\cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right) \cdot R \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. add-cbrt-cube 74.5%

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

      2. pow3 74.6%

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

   4. Applied egg-rr 74.6%

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

   if -1.65999999999999999e-6 < phi1 < 2.4000000000000001e-5

   1. Initial program 70.3%

      \[\cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right) \cdot R \]

   3. Simplified 70.3%

      \[\leadsto \color{blue}{\cos^{-1} \left(\mathsf{fma}\left(\cos \phi_1, \cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right), \sin \phi_1 \cdot \sin \phi_2\right)\right) \cdot R} \]
   4. Add Preprocessing

   5. Taylor expanded in phi1 around 0 70.3%

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

      1. cos-diff 92.2%

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

   7. Applied egg-rr 92.2%

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

      1. cos-neg 92.2%

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

      2. *-commutative 92.2%

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

      3. fma-define 92.2%

         \[\leadsto \cos^{-1} \left(\phi_1 \cdot \sin \phi_2 + \cos \phi_2 \cdot \color{blue}{\mathsf{fma}\left(\cos \left(-\lambda_2\right), \cos \lambda_1, \sin \lambda_1 \cdot \sin \lambda_2\right)}\right) \cdot R \]

      4. cos-neg 92.2%

         \[\leadsto \cos^{-1} \left(\phi_1 \cdot \sin \phi_2 + \cos \phi_2 \cdot \mathsf{fma}\left(\color{blue}{\cos \lambda_2}, \cos \lambda_1, \sin \lambda_1 \cdot \sin \lambda_2\right)\right) \cdot R \]

   9. Simplified 92.2%

      \[\leadsto \cos^{-1} \left(\phi_1 \cdot \sin \phi_2 + \cos \phi_2 \cdot \color{blue}{\mathsf{fma}\left(\cos \lambda_2, \cos \lambda_1, \sin \lambda_1 \cdot \sin \lambda_2\right)}\right) \cdot R \]

   if 2.4000000000000001e-5 < phi1

   1. Initial program 85.0%

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

   3. Taylor expanded in phi1 around inf 85.0%

      \[\leadsto \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \color{blue}{\cos \phi_1 \cdot \left(\cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right)\right)}\right) \cdot R \]
3. Recombined 3 regimes into one program.

4. Final simplification 85.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\phi_1 \leq -1.66 \cdot 10^{-6}:\\ \;\;\;\;R \cdot \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_2 \cdot \cos \phi_1\right) \cdot \sqrt[3]{{\cos \left(\lambda_1 - \lambda_2\right)}^{3}}\right)\\ \mathbf{elif}\;\phi_1 \leq 2.4 \cdot 10^{-5}:\\ \;\;\;\;R \cdot \cos^{-1} \left(\phi_1 \cdot \sin \phi_2 + \cos \phi_2 \cdot \mathsf{fma}\left(\cos \lambda_2, \cos \lambda_1, \sin \lambda_1 \cdot \sin \lambda_2\right)\right)\\ \mathbf{else}:\\ \;\;\;\;R \cdot \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \cos \phi_1 \cdot \left(\cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right)\right)\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 83.3% accurate, 0.7× speedup

Math

\[\begin{array}{l} [R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\ \\ \begin{array}{l} t_0 := \cos \left(\lambda_1 - \lambda_2\right)\\ \mathbf{if}\;\phi_1 \leq -3.5 \cdot 10^{-7}:\\ \;\;\;\;R \cdot \cos^{-1} \left(\sin \phi_2 \cdot \log \left(e^{\sin \phi_1}\right) + \left(\cos \phi_2 \cdot \cos \phi_1\right) \cdot t\_0\right)\\ \mathbf{elif}\;\phi_1 \leq 1.4 \cdot 10^{-7}:\\ \;\;\;\;R \cdot \cos^{-1} \left(\phi_1 \cdot \sin \phi_2 + \cos \phi_2 \cdot \mathsf{fma}\left(\cos \lambda_2, \cos \lambda_1, \sin \lambda_1 \cdot \sin \lambda_2\right)\right)\\ \mathbf{else}:\\ \;\;\;\;R \cdot \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \cos \phi_1 \cdot \left(\cos \phi_2 \cdot t\_0\right)\right)\\ \end{array} \end{array} \]

FPCore

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 (- lambda1 lambda2))))
   (if (<= phi1 -3.5e-7)
     (*
      R
      (acos
       (+
        (* (sin phi2) (log (exp (sin phi1))))
        (* (* (cos phi2) (cos phi1)) t_0))))
     (if (<= phi1 1.4e-7)
       (*
        R
        (acos
         (+
          (* phi1 (sin phi2))
          (*
           (cos phi2)
           (fma
            (cos lambda2)
            (cos lambda1)
            (* (sin lambda1) (sin lambda2)))))))
       (*
        R
        (acos
         (+ (* (sin phi1) (sin phi2)) (* (cos phi1) (* (cos phi2) t_0)))))))))

C

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((lambda1 - lambda2));
	double tmp;
	if (phi1 <= -3.5e-7) {
		tmp = R * acos(((sin(phi2) * log(exp(sin(phi1)))) + ((cos(phi2) * cos(phi1)) * t_0)));
	} else if (phi1 <= 1.4e-7) {
		tmp = R * acos(((phi1 * sin(phi2)) + (cos(phi2) * fma(cos(lambda2), cos(lambda1), (sin(lambda1) * sin(lambda2))))));
	} else {
		tmp = R * acos(((sin(phi1) * sin(phi2)) + (cos(phi1) * (cos(phi2) * t_0))));
	}
	return tmp;
}

Julia

R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2])
function code(R, lambda1, lambda2, phi1, phi2)
	t_0 = cos(Float64(lambda1 - lambda2))
	tmp = 0.0
	if (phi1 <= -3.5e-7)
		tmp = Float64(R * acos(Float64(Float64(sin(phi2) * log(exp(sin(phi1)))) + Float64(Float64(cos(phi2) * cos(phi1)) * t_0))));
	elseif (phi1 <= 1.4e-7)
		tmp = Float64(R * acos(Float64(Float64(phi1 * sin(phi2)) + Float64(cos(phi2) * fma(cos(lambda2), cos(lambda1), Float64(sin(lambda1) * sin(lambda2)))))));
	else
		tmp = Float64(R * acos(Float64(Float64(sin(phi1) * sin(phi2)) + Float64(cos(phi1) * Float64(cos(phi2) * t_0)))));
	end
	return tmp
end

Wolfram

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[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[phi1, -3.5e-7], N[(R * N[ArcCos[N[(N[(N[Sin[phi2], $MachinePrecision] * N[Log[N[Exp[N[Sin[phi1], $MachinePrecision]], $MachinePrecision]], $MachinePrecision]), $MachinePrecision] + N[(N[(N[Cos[phi2], $MachinePrecision] * N[Cos[phi1], $MachinePrecision]), $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[phi1, 1.4e-7], N[(R * N[ArcCos[N[(N[(phi1 * N[Sin[phi2], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[phi2], $MachinePrecision] * N[(N[Cos[lambda2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision] + N[(N[Sin[lambda1], $MachinePrecision] * N[Sin[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[phi1], $MachinePrecision] * N[(N[Cos[phi2], $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if phi1 < -3.49999999999999984e-7

   1. Initial program 74.5%

      \[\cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right) \cdot R \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. add-log-exp 74.5%

         \[\leadsto \cos^{-1} \left(\color{blue}{\log \left(e^{\sin \phi_1}\right)} \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right) \cdot R \]

   4. Applied egg-rr 74.5%

      \[\leadsto \cos^{-1} \left(\color{blue}{\log \left(e^{\sin \phi_1}\right)} \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right) \cdot R \]

   if -3.49999999999999984e-7 < phi1 < 1.4000000000000001e-7

   1. Initial program 70.3%

      \[\cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right) \cdot R \]

   3. Simplified 70.3%

      \[\leadsto \color{blue}{\cos^{-1} \left(\mathsf{fma}\left(\cos \phi_1, \cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right), \sin \phi_1 \cdot \sin \phi_2\right)\right) \cdot R} \]
   4. Add Preprocessing

   5. Taylor expanded in phi1 around 0 70.3%

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

      1. cos-diff 92.2%

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

   7. Applied egg-rr 92.2%

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

      1. cos-neg 92.2%

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

      2. *-commutative 92.2%

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

      3. fma-define 92.2%

         \[\leadsto \cos^{-1} \left(\phi_1 \cdot \sin \phi_2 + \cos \phi_2 \cdot \color{blue}{\mathsf{fma}\left(\cos \left(-\lambda_2\right), \cos \lambda_1, \sin \lambda_1 \cdot \sin \lambda_2\right)}\right) \cdot R \]

      4. cos-neg 92.2%

         \[\leadsto \cos^{-1} \left(\phi_1 \cdot \sin \phi_2 + \cos \phi_2 \cdot \mathsf{fma}\left(\color{blue}{\cos \lambda_2}, \cos \lambda_1, \sin \lambda_1 \cdot \sin \lambda_2\right)\right) \cdot R \]

   9. Simplified 92.2%

      \[\leadsto \cos^{-1} \left(\phi_1 \cdot \sin \phi_2 + \cos \phi_2 \cdot \color{blue}{\mathsf{fma}\left(\cos \lambda_2, \cos \lambda_1, \sin \lambda_1 \cdot \sin \lambda_2\right)}\right) \cdot R \]

   if 1.4000000000000001e-7 < phi1

   1. Initial program 85.0%

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

   3. Taylor expanded in phi1 around inf 85.0%

      \[\leadsto \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \color{blue}{\cos \phi_1 \cdot \left(\cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right)\right)}\right) \cdot R \]
3. Recombined 3 regimes into one program.

4. Final simplification 85.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\phi_1 \leq -3.5 \cdot 10^{-7}:\\ \;\;\;\;R \cdot \cos^{-1} \left(\sin \phi_2 \cdot \log \left(e^{\sin \phi_1}\right) + \left(\cos \phi_2 \cdot \cos \phi_1\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right)\\ \mathbf{elif}\;\phi_1 \leq 1.4 \cdot 10^{-7}:\\ \;\;\;\;R \cdot \cos^{-1} \left(\phi_1 \cdot \sin \phi_2 + \cos \phi_2 \cdot \mathsf{fma}\left(\cos \lambda_2, \cos \lambda_1, \sin \lambda_1 \cdot \sin \lambda_2\right)\right)\\ \mathbf{else}:\\ \;\;\;\;R \cdot \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \cos \phi_1 \cdot \left(\cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right)\right)\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 8: 83.3% accurate, 0.7× speedup

Math

\[\begin{array}{l} [R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\ \\ \begin{array}{l} t_0 := \cos \left(\lambda_1 - \lambda_2\right)\\ t_1 := \sin \phi_1 \cdot \sin \phi_2\\ \mathbf{if}\;\phi_1 \leq -8.5 \cdot 10^{-7}:\\ \;\;\;\;R \cdot \cos^{-1} \left(t\_1 + \left(\cos \phi_2 \cdot \cos \phi_1\right) \cdot t\_0\right)\\ \mathbf{elif}\;\phi_1 \leq 6.4 \cdot 10^{-6}:\\ \;\;\;\;R \cdot \cos^{-1} \left(\phi_1 \cdot \sin \phi_2 + \cos \phi_2 \cdot \mathsf{fma}\left(\cos \lambda_2, \cos \lambda_1, \sin \lambda_1 \cdot \sin \lambda_2\right)\right)\\ \mathbf{else}:\\ \;\;\;\;R \cdot \cos^{-1} \left(t\_1 + \cos \phi_1 \cdot \left(\cos \phi_2 \cdot t\_0\right)\right)\\ \end{array} \end{array} \]

FPCore

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 (- lambda1 lambda2))) (t_1 (* (sin phi1) (sin phi2))))
   (if (<= phi1 -8.5e-7)
     (* R (acos (+ t_1 (* (* (cos phi2) (cos phi1)) t_0))))
     (if (<= phi1 6.4e-6)
       (*
        R
        (acos
         (+
          (* phi1 (sin phi2))
          (*
           (cos phi2)
           (fma
            (cos lambda2)
            (cos lambda1)
            (* (sin lambda1) (sin lambda2)))))))
       (* R (acos (+ t_1 (* (cos phi1) (* (cos phi2) t_0)))))))))

C

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((lambda1 - lambda2));
	double t_1 = sin(phi1) * sin(phi2);
	double tmp;
	if (phi1 <= -8.5e-7) {
		tmp = R * acos((t_1 + ((cos(phi2) * cos(phi1)) * t_0)));
	} else if (phi1 <= 6.4e-6) {
		tmp = R * acos(((phi1 * sin(phi2)) + (cos(phi2) * fma(cos(lambda2), cos(lambda1), (sin(lambda1) * sin(lambda2))))));
	} else {
		tmp = R * acos((t_1 + (cos(phi1) * (cos(phi2) * t_0))));
	}
	return tmp;
}

Julia

R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2])
function code(R, lambda1, lambda2, phi1, phi2)
	t_0 = cos(Float64(lambda1 - lambda2))
	t_1 = Float64(sin(phi1) * sin(phi2))
	tmp = 0.0
	if (phi1 <= -8.5e-7)
		tmp = Float64(R * acos(Float64(t_1 + Float64(Float64(cos(phi2) * cos(phi1)) * t_0))));
	elseif (phi1 <= 6.4e-6)
		tmp = Float64(R * acos(Float64(Float64(phi1 * sin(phi2)) + Float64(cos(phi2) * fma(cos(lambda2), cos(lambda1), Float64(sin(lambda1) * sin(lambda2)))))));
	else
		tmp = Float64(R * acos(Float64(t_1 + Float64(cos(phi1) * Float64(cos(phi2) * t_0)))));
	end
	return tmp
end

Wolfram

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[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$1 = N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[phi1, -8.5e-7], N[(R * N[ArcCos[N[(t$95$1 + N[(N[(N[Cos[phi2], $MachinePrecision] * N[Cos[phi1], $MachinePrecision]), $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[phi1, 6.4e-6], N[(R * N[ArcCos[N[(N[(phi1 * N[Sin[phi2], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[phi2], $MachinePrecision] * N[(N[Cos[lambda2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision] + N[(N[Sin[lambda1], $MachinePrecision] * N[Sin[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(t$95$1 + N[(N[Cos[phi1], $MachinePrecision] * N[(N[Cos[phi2], $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]]

Derivation

1. Split input into 3 regimes

2. if phi1 < -8.50000000000000014e-7

   1. Initial program 74.5%

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

   if -8.50000000000000014e-7 < phi1 < 6.3999999999999997e-6

   1. Initial program 70.3%

      \[\cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right) \cdot R \]

   3. Simplified 70.3%

      \[\leadsto \color{blue}{\cos^{-1} \left(\mathsf{fma}\left(\cos \phi_1, \cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right), \sin \phi_1 \cdot \sin \phi_2\right)\right) \cdot R} \]
   4. Add Preprocessing

   5. Taylor expanded in phi1 around 0 70.3%

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

      1. cos-diff 92.2%

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

   7. Applied egg-rr 92.2%

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

      1. cos-neg 92.2%

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

      2. *-commutative 92.2%

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

      3. fma-define 92.2%

         \[\leadsto \cos^{-1} \left(\phi_1 \cdot \sin \phi_2 + \cos \phi_2 \cdot \color{blue}{\mathsf{fma}\left(\cos \left(-\lambda_2\right), \cos \lambda_1, \sin \lambda_1 \cdot \sin \lambda_2\right)}\right) \cdot R \]

      4. cos-neg 92.2%

         \[\leadsto \cos^{-1} \left(\phi_1 \cdot \sin \phi_2 + \cos \phi_2 \cdot \mathsf{fma}\left(\color{blue}{\cos \lambda_2}, \cos \lambda_1, \sin \lambda_1 \cdot \sin \lambda_2\right)\right) \cdot R \]

   9. Simplified 92.2%

      \[\leadsto \cos^{-1} \left(\phi_1 \cdot \sin \phi_2 + \cos \phi_2 \cdot \color{blue}{\mathsf{fma}\left(\cos \lambda_2, \cos \lambda_1, \sin \lambda_1 \cdot \sin \lambda_2\right)}\right) \cdot R \]

   if 6.3999999999999997e-6 < phi1

   1. Initial program 85.0%

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

   3. Taylor expanded in phi1 around inf 85.0%

      \[\leadsto \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \color{blue}{\cos \phi_1 \cdot \left(\cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right)\right)}\right) \cdot R \]
3. Recombined 3 regimes into one program.

4. Final simplification 85.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\phi_1 \leq -8.5 \cdot 10^{-7}:\\ \;\;\;\;R \cdot \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_2 \cdot \cos \phi_1\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right)\\ \mathbf{elif}\;\phi_1 \leq 6.4 \cdot 10^{-6}:\\ \;\;\;\;R \cdot \cos^{-1} \left(\phi_1 \cdot \sin \phi_2 + \cos \phi_2 \cdot \mathsf{fma}\left(\cos \lambda_2, \cos \lambda_1, \sin \lambda_1 \cdot \sin \lambda_2\right)\right)\\ \mathbf{else}:\\ \;\;\;\;R \cdot \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \cos \phi_1 \cdot \left(\cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right)\right)\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 9: 83.2% accurate, 0.8× speedup

Math

\[\begin{array}{l} [R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\ \\ \begin{array}{l} t_0 := \cos \left(\lambda_1 - \lambda_2\right)\\ t_1 := \sin \phi_1 \cdot \sin \phi_2\\ \mathbf{if}\;\phi_1 \leq -9 \cdot 10^{-7}:\\ \;\;\;\;R \cdot \cos^{-1} \left(t\_1 + \left(\cos \phi_2 \cdot \cos \phi_1\right) \cdot t\_0\right)\\ \mathbf{elif}\;\phi_1 \leq 1.75 \cdot 10^{-6}:\\ \;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_2 \cdot \left(\sin \lambda_1 \cdot \sin \lambda_2 + \cos \lambda_2 \cdot \cos \lambda_1\right) + \phi_1 \cdot \sin \phi_2\right)\\ \mathbf{else}:\\ \;\;\;\;R \cdot \cos^{-1} \left(t\_1 + \cos \phi_1 \cdot \left(\cos \phi_2 \cdot t\_0\right)\right)\\ \end{array} \end{array} \]

FPCore

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 (- lambda1 lambda2))) (t_1 (* (sin phi1) (sin phi2))))
   (if (<= phi1 -9e-7)
     (* R (acos (+ t_1 (* (* (cos phi2) (cos phi1)) t_0))))
     (if (<= phi1 1.75e-6)
       (*
        R
        (acos
         (+
          (*
           (cos phi2)
           (+ (* (sin lambda1) (sin lambda2)) (* (cos lambda2) (cos lambda1))))
          (* phi1 (sin phi2)))))
       (* R (acos (+ t_1 (* (cos phi1) (* (cos phi2) t_0)))))))))

C

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((lambda1 - lambda2));
	double t_1 = sin(phi1) * sin(phi2);
	double tmp;
	if (phi1 <= -9e-7) {
		tmp = R * acos((t_1 + ((cos(phi2) * cos(phi1)) * t_0)));
	} else if (phi1 <= 1.75e-6) {
		tmp = R * acos(((cos(phi2) * ((sin(lambda1) * sin(lambda2)) + (cos(lambda2) * cos(lambda1)))) + (phi1 * sin(phi2))));
	} else {
		tmp = R * acos((t_1 + (cos(phi1) * (cos(phi2) * t_0))));
	}
	return tmp;
}

Fortran

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) :: t_0
    real(8) :: t_1
    real(8) :: tmp
    t_0 = cos((lambda1 - lambda2))
    t_1 = sin(phi1) * sin(phi2)
    if (phi1 <= (-9d-7)) then
        tmp = r * acos((t_1 + ((cos(phi2) * cos(phi1)) * t_0)))
    else if (phi1 <= 1.75d-6) then
        tmp = r * acos(((cos(phi2) * ((sin(lambda1) * sin(lambda2)) + (cos(lambda2) * cos(lambda1)))) + (phi1 * sin(phi2))))
    else
        tmp = r * acos((t_1 + (cos(phi1) * (cos(phi2) * t_0))))
    end if
    code = tmp
end function

Java

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((lambda1 - lambda2));
	double t_1 = Math.sin(phi1) * Math.sin(phi2);
	double tmp;
	if (phi1 <= -9e-7) {
		tmp = R * Math.acos((t_1 + ((Math.cos(phi2) * Math.cos(phi1)) * t_0)));
	} else if (phi1 <= 1.75e-6) {
		tmp = R * Math.acos(((Math.cos(phi2) * ((Math.sin(lambda1) * Math.sin(lambda2)) + (Math.cos(lambda2) * Math.cos(lambda1)))) + (phi1 * Math.sin(phi2))));
	} else {
		tmp = R * Math.acos((t_1 + (Math.cos(phi1) * (Math.cos(phi2) * t_0))));
	}
	return tmp;
}

Python

[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2])
def code(R, lambda1, lambda2, phi1, phi2):
	t_0 = math.cos((lambda1 - lambda2))
	t_1 = math.sin(phi1) * math.sin(phi2)
	tmp = 0
	if phi1 <= -9e-7:
		tmp = R * math.acos((t_1 + ((math.cos(phi2) * math.cos(phi1)) * t_0)))
	elif phi1 <= 1.75e-6:
		tmp = R * math.acos(((math.cos(phi2) * ((math.sin(lambda1) * math.sin(lambda2)) + (math.cos(lambda2) * math.cos(lambda1)))) + (phi1 * math.sin(phi2))))
	else:
		tmp = R * math.acos((t_1 + (math.cos(phi1) * (math.cos(phi2) * t_0))))
	return tmp

Julia

R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2])
function code(R, lambda1, lambda2, phi1, phi2)
	t_0 = cos(Float64(lambda1 - lambda2))
	t_1 = Float64(sin(phi1) * sin(phi2))
	tmp = 0.0
	if (phi1 <= -9e-7)
		tmp = Float64(R * acos(Float64(t_1 + Float64(Float64(cos(phi2) * cos(phi1)) * t_0))));
	elseif (phi1 <= 1.75e-6)
		tmp = Float64(R * acos(Float64(Float64(cos(phi2) * Float64(Float64(sin(lambda1) * sin(lambda2)) + Float64(cos(lambda2) * cos(lambda1)))) + Float64(phi1 * sin(phi2)))));
	else
		tmp = Float64(R * acos(Float64(t_1 + Float64(cos(phi1) * Float64(cos(phi2) * t_0)))));
	end
	return tmp
end

MATLAB

R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
	t_0 = cos((lambda1 - lambda2));
	t_1 = sin(phi1) * sin(phi2);
	tmp = 0.0;
	if (phi1 <= -9e-7)
		tmp = R * acos((t_1 + ((cos(phi2) * cos(phi1)) * t_0)));
	elseif (phi1 <= 1.75e-6)
		tmp = R * acos(((cos(phi2) * ((sin(lambda1) * sin(lambda2)) + (cos(lambda2) * cos(lambda1)))) + (phi1 * sin(phi2))));
	else
		tmp = R * acos((t_1 + (cos(phi1) * (cos(phi2) * t_0))));
	end
	tmp_2 = tmp;
end

Wolfram

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[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$1 = N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[phi1, -9e-7], N[(R * N[ArcCos[N[(t$95$1 + N[(N[(N[Cos[phi2], $MachinePrecision] * N[Cos[phi1], $MachinePrecision]), $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[phi1, 1.75e-6], N[(R * N[ArcCos[N[(N[(N[Cos[phi2], $MachinePrecision] * N[(N[(N[Sin[lambda1], $MachinePrecision] * N[Sin[lambda2], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[lambda2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(phi1 * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(t$95$1 + N[(N[Cos[phi1], $MachinePrecision] * N[(N[Cos[phi2], $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]]

Derivation

1. Split input into 3 regimes

2. if phi1 < -8.99999999999999959e-7

   1. Initial program 74.5%

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

   if -8.99999999999999959e-7 < phi1 < 1.74999999999999997e-6

   1. Initial program 70.3%

      \[\cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right) \cdot R \]

   3. Simplified 70.3%

      \[\leadsto \color{blue}{\cos^{-1} \left(\mathsf{fma}\left(\cos \phi_1, \cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right), \sin \phi_1 \cdot \sin \phi_2\right)\right) \cdot R} \]
   4. Add Preprocessing

   5. Taylor expanded in phi1 around 0 70.3%

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

      1. cos-diff 92.2%

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

      2. +-commutative 92.2%

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

   7. Applied egg-rr 92.2%

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

   if 1.74999999999999997e-6 < phi1

   1. Initial program 85.0%

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

   3. Taylor expanded in phi1 around inf 85.0%

      \[\leadsto \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \color{blue}{\cos \phi_1 \cdot \left(\cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right)\right)}\right) \cdot R \]
3. Recombined 3 regimes into one program.

4. Final simplification 85.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\phi_1 \leq -9 \cdot 10^{-7}:\\ \;\;\;\;R \cdot \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_2 \cdot \cos \phi_1\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right)\\ \mathbf{elif}\;\phi_1 \leq 1.75 \cdot 10^{-6}:\\ \;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_2 \cdot \left(\sin \lambda_1 \cdot \sin \lambda_2 + \cos \lambda_2 \cdot \cos \lambda_1\right) + \phi_1 \cdot \sin \phi_2\right)\\ \mathbf{else}:\\ \;\;\;\;R \cdot \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \cos \phi_1 \cdot \left(\cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right)\right)\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 10: 63.6% accurate, 1.0× speedup

Math

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

FPCore

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 (* (sin phi1) (sin phi2))))
   (if (<= lambda1 -6e-5)
     (* R (acos (+ t_0 (* (cos lambda1) (* (cos phi2) (cos phi1))))))
     (* R (acos (+ t_0 (* (cos phi2) (* (cos phi1) (cos lambda2)))))))))

C

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

Fortran

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) :: t_0
    real(8) :: tmp
    t_0 = sin(phi1) * sin(phi2)
    if (lambda1 <= (-6d-5)) then
        tmp = r * acos((t_0 + (cos(lambda1) * (cos(phi2) * cos(phi1)))))
    else
        tmp = r * acos((t_0 + (cos(phi2) * (cos(phi1) * cos(lambda2)))))
    end if
    code = tmp
end function

Java

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.sin(phi1) * Math.sin(phi2);
	double tmp;
	if (lambda1 <= -6e-5) {
		tmp = R * Math.acos((t_0 + (Math.cos(lambda1) * (Math.cos(phi2) * Math.cos(phi1)))));
	} else {
		tmp = R * Math.acos((t_0 + (Math.cos(phi2) * (Math.cos(phi1) * Math.cos(lambda2)))));
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

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

Wolfram

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[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[lambda1, -6e-5], N[(R * N[ArcCos[N[(t$95$0 + N[(N[Cos[lambda1], $MachinePrecision] * N[(N[Cos[phi2], $MachinePrecision] * N[Cos[phi1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(t$95$0 + N[(N[Cos[phi2], $MachinePrecision] * N[(N[Cos[phi1], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if lambda1 < -6.00000000000000015e-5

   1. Initial program 62.7%

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

   3. Taylor expanded in lambda2 around 0 62.7%

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

   if -6.00000000000000015e-5 < lambda1

   1. Initial program 80.1%

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

   3. Taylor expanded in lambda1 around 0 65.8%

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

      1. *-commutative 65.8%

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

      2. associate-*l* 65.8%

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

      3. cos-neg 65.8%

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

   5. Simplified 65.8%

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

4. Final simplification 64.9%

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

Alternative 11: 63.6% accurate, 1.0× speedup

Math

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

FPCore

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 (* (sin phi1) (sin phi2))))
   (if (<= lambda1 -5.8e-5)
     (* R (acos (+ t_0 (* (cos phi1) (* (cos phi2) (cos lambda1))))))
     (* R (acos (+ t_0 (* (cos phi2) (* (cos phi1) (cos lambda2)))))))))

C

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

Fortran

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) :: t_0
    real(8) :: tmp
    t_0 = sin(phi1) * sin(phi2)
    if (lambda1 <= (-5.8d-5)) then
        tmp = r * acos((t_0 + (cos(phi1) * (cos(phi2) * cos(lambda1)))))
    else
        tmp = r * acos((t_0 + (cos(phi2) * (cos(phi1) * cos(lambda2)))))
    end if
    code = tmp
end function

Java

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.sin(phi1) * Math.sin(phi2);
	double tmp;
	if (lambda1 <= -5.8e-5) {
		tmp = R * Math.acos((t_0 + (Math.cos(phi1) * (Math.cos(phi2) * Math.cos(lambda1)))));
	} else {
		tmp = R * Math.acos((t_0 + (Math.cos(phi2) * (Math.cos(phi1) * Math.cos(lambda2)))));
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

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

Wolfram

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[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[lambda1, -5.8e-5], N[(R * N[ArcCos[N[(t$95$0 + N[(N[Cos[phi1], $MachinePrecision] * N[(N[Cos[phi2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(t$95$0 + N[(N[Cos[phi2], $MachinePrecision] * N[(N[Cos[phi1], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if lambda1 < -5.8e-5

   1. Initial program 62.7%

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

   3. Taylor expanded in lambda2 around 0 62.7%

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

   4. Taylor expanded in phi1 around inf 62.7%

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

      1. *-commutative 62.7%

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

      2. associate-*r* 62.7%

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

   6. Simplified 62.7%

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

   if -5.8e-5 < lambda1

   1. Initial program 80.1%

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

   3. Taylor expanded in lambda1 around 0 65.8%

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

      1. *-commutative 65.8%

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

      2. associate-*l* 65.8%

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

      3. cos-neg 65.8%

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

   5. Simplified 65.8%

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

4. Final simplification 64.9%

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

Alternative 12: 63.6% accurate, 1.0× speedup

Math

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

FPCore

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 (* (sin phi1) (sin phi2))))
   (if (<= lambda1 -0.00023)
     (* R (acos (+ t_0 (* (cos phi1) (* (cos phi2) (cos lambda1))))))
     (* R (acos (+ t_0 (* (cos phi1) (* (cos phi2) (cos lambda2)))))))))

C

assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	double t_0 = sin(phi1) * sin(phi2);
	double tmp;
	if (lambda1 <= -0.00023) {
		tmp = R * acos((t_0 + (cos(phi1) * (cos(phi2) * cos(lambda1)))));
	} else {
		tmp = R * acos((t_0 + (cos(phi1) * (cos(phi2) * cos(lambda2)))));
	}
	return tmp;
}

Fortran

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) :: t_0
    real(8) :: tmp
    t_0 = sin(phi1) * sin(phi2)
    if (lambda1 <= (-0.00023d0)) then
        tmp = r * acos((t_0 + (cos(phi1) * (cos(phi2) * cos(lambda1)))))
    else
        tmp = r * acos((t_0 + (cos(phi1) * (cos(phi2) * cos(lambda2)))))
    end if
    code = tmp
end function

Java

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.sin(phi1) * Math.sin(phi2);
	double tmp;
	if (lambda1 <= -0.00023) {
		tmp = R * Math.acos((t_0 + (Math.cos(phi1) * (Math.cos(phi2) * Math.cos(lambda1)))));
	} else {
		tmp = R * Math.acos((t_0 + (Math.cos(phi1) * (Math.cos(phi2) * Math.cos(lambda2)))));
	}
	return tmp;
}

Python

[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2])
def code(R, lambda1, lambda2, phi1, phi2):
	t_0 = math.sin(phi1) * math.sin(phi2)
	tmp = 0
	if lambda1 <= -0.00023:
		tmp = R * math.acos((t_0 + (math.cos(phi1) * (math.cos(phi2) * math.cos(lambda1)))))
	else:
		tmp = R * math.acos((t_0 + (math.cos(phi1) * (math.cos(phi2) * math.cos(lambda2)))))
	return tmp

Julia

R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2])
function code(R, lambda1, lambda2, phi1, phi2)
	t_0 = Float64(sin(phi1) * sin(phi2))
	tmp = 0.0
	if (lambda1 <= -0.00023)
		tmp = Float64(R * acos(Float64(t_0 + Float64(cos(phi1) * Float64(cos(phi2) * cos(lambda1))))));
	else
		tmp = Float64(R * acos(Float64(t_0 + Float64(cos(phi1) * Float64(cos(phi2) * cos(lambda2))))));
	end
	return tmp
end

MATLAB

R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
	t_0 = sin(phi1) * sin(phi2);
	tmp = 0.0;
	if (lambda1 <= -0.00023)
		tmp = R * acos((t_0 + (cos(phi1) * (cos(phi2) * cos(lambda1)))));
	else
		tmp = R * acos((t_0 + (cos(phi1) * (cos(phi2) * cos(lambda2)))));
	end
	tmp_2 = tmp;
end

Wolfram

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[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[lambda1, -0.00023], N[(R * N[ArcCos[N[(t$95$0 + N[(N[Cos[phi1], $MachinePrecision] * N[(N[Cos[phi2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(t$95$0 + N[(N[Cos[phi1], $MachinePrecision] * N[(N[Cos[phi2], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if lambda1 < -2.3000000000000001e-4

   1. Initial program 62.7%

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

   3. Taylor expanded in lambda2 around 0 62.7%

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

   4. Taylor expanded in phi1 around inf 62.7%

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

      1. *-commutative 62.7%

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

      2. associate-*r* 62.7%

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

   6. Simplified 62.7%

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

   if -2.3000000000000001e-4 < lambda1

   1. Initial program 80.1%

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

   3. Taylor expanded in lambda1 around 0 65.8%

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

      1. cos-neg 65.8%

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

   5. Simplified 65.8%

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

4. Final simplification 64.9%

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

Alternative 13: 57.8% accurate, 1.0× speedup

Math

\[\begin{array}{l} [R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\ \\ \begin{array}{l} t_0 := \sin \phi_1 \cdot \sin \phi_2\\ t_1 := \cos \left(\lambda_1 - \lambda_2\right)\\ \mathbf{if}\;\lambda_2 \leq 1.7 \cdot 10^{-7}:\\ \;\;\;\;R \cdot \cos^{-1} \left(t\_0 + \cos \phi_1 \cdot \left(\cos \phi_2 \cdot \cos \lambda_1\right)\right)\\ \mathbf{elif}\;\lambda_2 \leq 6.8 \cdot 10^{+134}:\\ \;\;\;\;R \cdot \cos^{-1} \left(t\_0 + \cos \phi_1 \cdot t\_1\right)\\ \mathbf{else}:\\ \;\;\;\;R \cdot \cos^{-1} \left(t\_0 + \cos \phi_2 \cdot t\_1\right)\\ \end{array} \end{array} \]

FPCore

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 (* (sin phi1) (sin phi2))) (t_1 (cos (- lambda1 lambda2))))
   (if (<= lambda2 1.7e-7)
     (* R (acos (+ t_0 (* (cos phi1) (* (cos phi2) (cos lambda1))))))
     (if (<= lambda2 6.8e+134)
       (* R (acos (+ t_0 (* (cos phi1) t_1))))
       (* R (acos (+ t_0 (* (cos phi2) t_1))))))))

C

assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	double t_0 = sin(phi1) * sin(phi2);
	double t_1 = cos((lambda1 - lambda2));
	double tmp;
	if (lambda2 <= 1.7e-7) {
		tmp = R * acos((t_0 + (cos(phi1) * (cos(phi2) * cos(lambda1)))));
	} else if (lambda2 <= 6.8e+134) {
		tmp = R * acos((t_0 + (cos(phi1) * t_1)));
	} else {
		tmp = R * acos((t_0 + (cos(phi2) * t_1)));
	}
	return tmp;
}

Fortran

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) :: t_0
    real(8) :: t_1
    real(8) :: tmp
    t_0 = sin(phi1) * sin(phi2)
    t_1 = cos((lambda1 - lambda2))
    if (lambda2 <= 1.7d-7) then
        tmp = r * acos((t_0 + (cos(phi1) * (cos(phi2) * cos(lambda1)))))
    else if (lambda2 <= 6.8d+134) then
        tmp = r * acos((t_0 + (cos(phi1) * t_1)))
    else
        tmp = r * acos((t_0 + (cos(phi2) * t_1)))
    end if
    code = tmp
end function

Java

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.sin(phi1) * Math.sin(phi2);
	double t_1 = Math.cos((lambda1 - lambda2));
	double tmp;
	if (lambda2 <= 1.7e-7) {
		tmp = R * Math.acos((t_0 + (Math.cos(phi1) * (Math.cos(phi2) * Math.cos(lambda1)))));
	} else if (lambda2 <= 6.8e+134) {
		tmp = R * Math.acos((t_0 + (Math.cos(phi1) * t_1)));
	} else {
		tmp = R * Math.acos((t_0 + (Math.cos(phi2) * t_1)));
	}
	return tmp;
}

Python

[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2])
def code(R, lambda1, lambda2, phi1, phi2):
	t_0 = math.sin(phi1) * math.sin(phi2)
	t_1 = math.cos((lambda1 - lambda2))
	tmp = 0
	if lambda2 <= 1.7e-7:
		tmp = R * math.acos((t_0 + (math.cos(phi1) * (math.cos(phi2) * math.cos(lambda1)))))
	elif lambda2 <= 6.8e+134:
		tmp = R * math.acos((t_0 + (math.cos(phi1) * t_1)))
	else:
		tmp = R * math.acos((t_0 + (math.cos(phi2) * t_1)))
	return tmp

Julia

R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2])
function code(R, lambda1, lambda2, phi1, phi2)
	t_0 = Float64(sin(phi1) * sin(phi2))
	t_1 = cos(Float64(lambda1 - lambda2))
	tmp = 0.0
	if (lambda2 <= 1.7e-7)
		tmp = Float64(R * acos(Float64(t_0 + Float64(cos(phi1) * Float64(cos(phi2) * cos(lambda1))))));
	elseif (lambda2 <= 6.8e+134)
		tmp = Float64(R * acos(Float64(t_0 + Float64(cos(phi1) * t_1))));
	else
		tmp = Float64(R * acos(Float64(t_0 + Float64(cos(phi2) * t_1))));
	end
	return tmp
end

MATLAB

R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
	t_0 = sin(phi1) * sin(phi2);
	t_1 = cos((lambda1 - lambda2));
	tmp = 0.0;
	if (lambda2 <= 1.7e-7)
		tmp = R * acos((t_0 + (cos(phi1) * (cos(phi2) * cos(lambda1)))));
	elseif (lambda2 <= 6.8e+134)
		tmp = R * acos((t_0 + (cos(phi1) * t_1)));
	else
		tmp = R * acos((t_0 + (cos(phi2) * t_1)));
	end
	tmp_2 = tmp;
end

Wolfram

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[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[lambda2, 1.7e-7], N[(R * N[ArcCos[N[(t$95$0 + N[(N[Cos[phi1], $MachinePrecision] * N[(N[Cos[phi2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[lambda2, 6.8e+134], N[(R * N[ArcCos[N[(t$95$0 + N[(N[Cos[phi1], $MachinePrecision] * t$95$1), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(t$95$0 + N[(N[Cos[phi2], $MachinePrecision] * t$95$1), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]]

Derivation

1. Split input into 3 regimes

2. if lambda2 < 1.69999999999999987e-7

   1. Initial program 80.9%

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

   3. Taylor expanded in lambda2 around 0 69.5%

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

   4. Taylor expanded in phi1 around inf 69.5%

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

      1. *-commutative 69.5%

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

      2. associate-*r* 69.5%

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

   6. Simplified 69.5%

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

   if 1.69999999999999987e-7 < lambda2 < 6.80000000000000035e134

   1. Initial program 59.0%

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

   3. Taylor expanded in phi2 around 0 44.7%

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

      1. *-commutative 44.7%

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

   5. Simplified 44.7%

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

   if 6.80000000000000035e134 < lambda2

   1. Initial program 57.7%

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

   3. Taylor expanded in phi1 around 0 38.9%

      \[\leadsto \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \color{blue}{\cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right)}\right) \cdot R \]
3. Recombined 3 regimes into one program.

4. Final simplification 62.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\lambda_2 \leq 1.7 \cdot 10^{-7}:\\ \;\;\;\;R \cdot \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \cos \phi_1 \cdot \left(\cos \phi_2 \cdot \cos \lambda_1\right)\right)\\ \mathbf{elif}\;\lambda_2 \leq 6.8 \cdot 10^{+134}:\\ \;\;\;\;R \cdot \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \cos \phi_1 \cdot \cos \left(\lambda_1 - \lambda_2\right)\right)\\ \mathbf{else}:\\ \;\;\;\;R \cdot \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right)\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 14: 73.3% accurate, 1.0× speedup

Math

\[\begin{array}{l} [R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\ \\ R \cdot \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_2 \cdot \cos \phi_1\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right) \end{array} \]

FPCore

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
  (acos
   (+
    (* (sin phi1) (sin phi2))
    (* (* (cos phi2) (cos phi1)) (cos (- lambda1 lambda2)))))))

C

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

Fortran

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 * acos(((sin(phi1) * sin(phi2)) + ((cos(phi2) * cos(phi1)) * cos((lambda1 - lambda2)))))
end function

Java

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 * Math.acos(((Math.sin(phi1) * Math.sin(phi2)) + ((Math.cos(phi2) * Math.cos(phi1)) * Math.cos((lambda1 - lambda2)))));
}

Python

[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2])
def code(R, lambda1, lambda2, phi1, phi2):
	return R * math.acos(((math.sin(phi1) * math.sin(phi2)) + ((math.cos(phi2) * math.cos(phi1)) * math.cos((lambda1 - lambda2)))))

Julia

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

MATLAB

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

Wolfram

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 * N[ArcCos[N[(N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision] + N[(N[(N[Cos[phi2], $MachinePrecision] * N[Cos[phi1], $MachinePrecision]), $MachinePrecision] * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 75.2%

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

3. Final simplification 75.2%

   \[\leadsto R \cdot \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_2 \cdot \cos \phi_1\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right) \]
4. Add Preprocessing

Alternative 15: 73.3% accurate, 1.0× speedup

Math

\[\begin{array}{l} [R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\ \\ R \cdot \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \cos \phi_1 \cdot \left(\cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right)\right)\right) \end{array} \]

FPCore

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
  (acos
   (+
    (* (sin phi1) (sin phi2))
    (* (cos phi1) (* (cos phi2) (cos (- lambda1 lambda2))))))))

C

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

Fortran

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 * acos(((sin(phi1) * sin(phi2)) + (cos(phi1) * (cos(phi2) * cos((lambda1 - lambda2))))))
end function

Java

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 * Math.acos(((Math.sin(phi1) * Math.sin(phi2)) + (Math.cos(phi1) * (Math.cos(phi2) * Math.cos((lambda1 - lambda2))))));
}

Python

[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2])
def code(R, lambda1, lambda2, phi1, phi2):
	return R * math.acos(((math.sin(phi1) * math.sin(phi2)) + (math.cos(phi1) * (math.cos(phi2) * math.cos((lambda1 - lambda2))))))

Julia

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

MATLAB

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

Wolfram

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 * N[ArcCos[N[(N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[phi1], $MachinePrecision] * N[(N[Cos[phi2], $MachinePrecision] * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 75.2%

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

3. Taylor expanded in phi1 around inf 75.2%

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

4. Final simplification 75.2%

   \[\leadsto R \cdot \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \cos \phi_1 \cdot \left(\cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right)\right)\right) \]
5. Add Preprocessing

Alternative 16: 57.7% accurate, 1.2× speedup

Math

\[\begin{array}{l} [R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\ \\ \begin{array}{l} t_0 := \cos \left(\lambda_1 - \lambda_2\right)\\ t_1 := \sin \phi_1 \cdot \sin \phi_2\\ \mathbf{if}\;\phi_2 \leq -4.4 \cdot 10^{+79}:\\ \;\;\;\;R \cdot \cos^{-1} \left(t\_1 + \cos \phi_2 \cdot \cos \phi_1\right)\\ \mathbf{elif}\;\phi_2 \leq 1.7 \cdot 10^{-26}:\\ \;\;\;\;R \cdot \cos^{-1} \left(t\_1 + \cos \phi_1 \cdot t\_0\right)\\ \mathbf{else}:\\ \;\;\;\;R \cdot \cos^{-1} \left(t\_1 + \cos \phi_2 \cdot t\_0\right)\\ \end{array} \end{array} \]

FPCore

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 (- lambda1 lambda2))) (t_1 (* (sin phi1) (sin phi2))))
   (if (<= phi2 -4.4e+79)
     (* R (acos (+ t_1 (* (cos phi2) (cos phi1)))))
     (if (<= phi2 1.7e-26)
       (* R (acos (+ t_1 (* (cos phi1) t_0))))
       (* R (acos (+ t_1 (* (cos phi2) t_0))))))))

C

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((lambda1 - lambda2));
	double t_1 = sin(phi1) * sin(phi2);
	double tmp;
	if (phi2 <= -4.4e+79) {
		tmp = R * acos((t_1 + (cos(phi2) * cos(phi1))));
	} else if (phi2 <= 1.7e-26) {
		tmp = R * acos((t_1 + (cos(phi1) * t_0)));
	} else {
		tmp = R * acos((t_1 + (cos(phi2) * t_0)));
	}
	return tmp;
}

Fortran

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) :: t_0
    real(8) :: t_1
    real(8) :: tmp
    t_0 = cos((lambda1 - lambda2))
    t_1 = sin(phi1) * sin(phi2)
    if (phi2 <= (-4.4d+79)) then
        tmp = r * acos((t_1 + (cos(phi2) * cos(phi1))))
    else if (phi2 <= 1.7d-26) then
        tmp = r * acos((t_1 + (cos(phi1) * t_0)))
    else
        tmp = r * acos((t_1 + (cos(phi2) * t_0)))
    end if
    code = tmp
end function

Java

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((lambda1 - lambda2));
	double t_1 = Math.sin(phi1) * Math.sin(phi2);
	double tmp;
	if (phi2 <= -4.4e+79) {
		tmp = R * Math.acos((t_1 + (Math.cos(phi2) * Math.cos(phi1))));
	} else if (phi2 <= 1.7e-26) {
		tmp = R * Math.acos((t_1 + (Math.cos(phi1) * t_0)));
	} else {
		tmp = R * Math.acos((t_1 + (Math.cos(phi2) * t_0)));
	}
	return tmp;
}

Python

[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2])
def code(R, lambda1, lambda2, phi1, phi2):
	t_0 = math.cos((lambda1 - lambda2))
	t_1 = math.sin(phi1) * math.sin(phi2)
	tmp = 0
	if phi2 <= -4.4e+79:
		tmp = R * math.acos((t_1 + (math.cos(phi2) * math.cos(phi1))))
	elif phi2 <= 1.7e-26:
		tmp = R * math.acos((t_1 + (math.cos(phi1) * t_0)))
	else:
		tmp = R * math.acos((t_1 + (math.cos(phi2) * t_0)))
	return tmp

Julia

R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2])
function code(R, lambda1, lambda2, phi1, phi2)
	t_0 = cos(Float64(lambda1 - lambda2))
	t_1 = Float64(sin(phi1) * sin(phi2))
	tmp = 0.0
	if (phi2 <= -4.4e+79)
		tmp = Float64(R * acos(Float64(t_1 + Float64(cos(phi2) * cos(phi1)))));
	elseif (phi2 <= 1.7e-26)
		tmp = Float64(R * acos(Float64(t_1 + Float64(cos(phi1) * t_0))));
	else
		tmp = Float64(R * acos(Float64(t_1 + Float64(cos(phi2) * t_0))));
	end
	return tmp
end

MATLAB

R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
	t_0 = cos((lambda1 - lambda2));
	t_1 = sin(phi1) * sin(phi2);
	tmp = 0.0;
	if (phi2 <= -4.4e+79)
		tmp = R * acos((t_1 + (cos(phi2) * cos(phi1))));
	elseif (phi2 <= 1.7e-26)
		tmp = R * acos((t_1 + (cos(phi1) * t_0)));
	else
		tmp = R * acos((t_1 + (cos(phi2) * t_0)));
	end
	tmp_2 = tmp;
end

Wolfram

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[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$1 = N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[phi2, -4.4e+79], N[(R * N[ArcCos[N[(t$95$1 + N[(N[Cos[phi2], $MachinePrecision] * N[Cos[phi1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[phi2, 1.7e-26], N[(R * N[ArcCos[N[(t$95$1 + N[(N[Cos[phi1], $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(t$95$1 + N[(N[Cos[phi2], $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]]

Derivation

1. Split input into 3 regimes

2. if phi2 < -4.3999999999999998e79

   1. Initial program 84.0%

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

   3. Taylor expanded in lambda2 around 0 60.1%

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

   4. Taylor expanded in lambda1 around 0 41.5%

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

   if -4.3999999999999998e79 < phi2 < 1.70000000000000007e-26

   1. Initial program 73.1%

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

   3. Taylor expanded in phi2 around 0 67.0%

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

      1. *-commutative 67.0%

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

   5. Simplified 67.0%

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

   if 1.70000000000000007e-26 < phi2

   1. Initial program 72.4%

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

   3. Taylor expanded in phi1 around 0 50.6%

      \[\leadsto \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \color{blue}{\cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right)}\right) \cdot R \]
3. Recombined 3 regimes into one program.

4. Final simplification 57.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\phi_2 \leq -4.4 \cdot 10^{+79}:\\ \;\;\;\;R \cdot \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \cos \phi_2 \cdot \cos \phi_1\right)\\ \mathbf{elif}\;\phi_2 \leq 1.7 \cdot 10^{-26}:\\ \;\;\;\;R \cdot \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \cos \phi_1 \cdot \cos \left(\lambda_1 - \lambda_2\right)\right)\\ \mathbf{else}:\\ \;\;\;\;R \cdot \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right)\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 17: 58.4% accurate, 1.2× speedup

Math

\[\begin{array}{l} [R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\ \\ \begin{array}{l} t_0 := \cos \left(\lambda_1 - \lambda_2\right)\\ t_1 := \sin \phi_1 \cdot \sin \phi_2\\ \mathbf{if}\;\phi_2 \leq -0.00185:\\ \;\;\;\;R \cdot \cos^{-1} \left(t\_1 + \cos \phi_2 \cdot \cos \phi_1\right)\\ \mathbf{elif}\;\phi_2 \leq 7.2 \cdot 10^{-20}:\\ \;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_1 \cdot t\_0 + \sin \phi_1 \cdot \phi_2\right)\\ \mathbf{else}:\\ \;\;\;\;R \cdot \cos^{-1} \left(t\_1 + \cos \phi_2 \cdot t\_0\right)\\ \end{array} \end{array} \]

FPCore

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 (- lambda1 lambda2))) (t_1 (* (sin phi1) (sin phi2))))
   (if (<= phi2 -0.00185)
     (* R (acos (+ t_1 (* (cos phi2) (cos phi1)))))
     (if (<= phi2 7.2e-20)
       (* R (acos (+ (* (cos phi1) t_0) (* (sin phi1) phi2))))
       (* R (acos (+ t_1 (* (cos phi2) t_0))))))))

C

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((lambda1 - lambda2));
	double t_1 = sin(phi1) * sin(phi2);
	double tmp;
	if (phi2 <= -0.00185) {
		tmp = R * acos((t_1 + (cos(phi2) * cos(phi1))));
	} else if (phi2 <= 7.2e-20) {
		tmp = R * acos(((cos(phi1) * t_0) + (sin(phi1) * phi2)));
	} else {
		tmp = R * acos((t_1 + (cos(phi2) * t_0)));
	}
	return tmp;
}

Fortran

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) :: t_0
    real(8) :: t_1
    real(8) :: tmp
    t_0 = cos((lambda1 - lambda2))
    t_1 = sin(phi1) * sin(phi2)
    if (phi2 <= (-0.00185d0)) then
        tmp = r * acos((t_1 + (cos(phi2) * cos(phi1))))
    else if (phi2 <= 7.2d-20) then
        tmp = r * acos(((cos(phi1) * t_0) + (sin(phi1) * phi2)))
    else
        tmp = r * acos((t_1 + (cos(phi2) * t_0)))
    end if
    code = tmp
end function

Java

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((lambda1 - lambda2));
	double t_1 = Math.sin(phi1) * Math.sin(phi2);
	double tmp;
	if (phi2 <= -0.00185) {
		tmp = R * Math.acos((t_1 + (Math.cos(phi2) * Math.cos(phi1))));
	} else if (phi2 <= 7.2e-20) {
		tmp = R * Math.acos(((Math.cos(phi1) * t_0) + (Math.sin(phi1) * phi2)));
	} else {
		tmp = R * Math.acos((t_1 + (Math.cos(phi2) * t_0)));
	}
	return tmp;
}

Python

[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2])
def code(R, lambda1, lambda2, phi1, phi2):
	t_0 = math.cos((lambda1 - lambda2))
	t_1 = math.sin(phi1) * math.sin(phi2)
	tmp = 0
	if phi2 <= -0.00185:
		tmp = R * math.acos((t_1 + (math.cos(phi2) * math.cos(phi1))))
	elif phi2 <= 7.2e-20:
		tmp = R * math.acos(((math.cos(phi1) * t_0) + (math.sin(phi1) * phi2)))
	else:
		tmp = R * math.acos((t_1 + (math.cos(phi2) * t_0)))
	return tmp

Julia

R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2])
function code(R, lambda1, lambda2, phi1, phi2)
	t_0 = cos(Float64(lambda1 - lambda2))
	t_1 = Float64(sin(phi1) * sin(phi2))
	tmp = 0.0
	if (phi2 <= -0.00185)
		tmp = Float64(R * acos(Float64(t_1 + Float64(cos(phi2) * cos(phi1)))));
	elseif (phi2 <= 7.2e-20)
		tmp = Float64(R * acos(Float64(Float64(cos(phi1) * t_0) + Float64(sin(phi1) * phi2))));
	else
		tmp = Float64(R * acos(Float64(t_1 + Float64(cos(phi2) * t_0))));
	end
	return tmp
end

MATLAB

R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
	t_0 = cos((lambda1 - lambda2));
	t_1 = sin(phi1) * sin(phi2);
	tmp = 0.0;
	if (phi2 <= -0.00185)
		tmp = R * acos((t_1 + (cos(phi2) * cos(phi1))));
	elseif (phi2 <= 7.2e-20)
		tmp = R * acos(((cos(phi1) * t_0) + (sin(phi1) * phi2)));
	else
		tmp = R * acos((t_1 + (cos(phi2) * t_0)));
	end
	tmp_2 = tmp;
end

Wolfram

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[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$1 = N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[phi2, -0.00185], N[(R * N[ArcCos[N[(t$95$1 + N[(N[Cos[phi2], $MachinePrecision] * N[Cos[phi1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[phi2, 7.2e-20], N[(R * N[ArcCos[N[(N[(N[Cos[phi1], $MachinePrecision] * t$95$0), $MachinePrecision] + N[(N[Sin[phi1], $MachinePrecision] * phi2), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(t$95$1 + N[(N[Cos[phi2], $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]]

Derivation

1. Split input into 3 regimes

2. if phi2 < -0.0018500000000000001

   1. Initial program 83.8%

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

   3. Taylor expanded in lambda2 around 0 61.5%

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

   4. Taylor expanded in lambda1 around 0 40.9%

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

   if -0.0018500000000000001 < phi2 < 7.19999999999999948e-20

   1. Initial program 72.1%

      \[\cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right) \cdot R \]

   3. Simplified 72.1%

      \[\leadsto \color{blue}{\cos^{-1} \left(\mathsf{fma}\left(\cos \phi_1, \cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right), \sin \phi_1 \cdot \sin \phi_2\right)\right) \cdot R} \]
   4. Add Preprocessing

   5. Taylor expanded in phi2 around 0 72.1%

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

   if 7.19999999999999948e-20 < phi2

   1. Initial program 72.4%

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

   3. Taylor expanded in phi1 around 0 50.6%

      \[\leadsto \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \color{blue}{\cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right)}\right) \cdot R \]
3. Recombined 3 regimes into one program.

4. Final simplification 59.0%

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

Alternative 18: 46.6% accurate, 1.2× speedup

Math

\[\begin{array}{l} [R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\ \\ \begin{array}{l} \mathbf{if}\;\phi_2 \leq -0.00037:\\ \;\;\;\;R \cdot \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \cos \phi_2 \cdot \cos \phi_1\right)\\ \mathbf{elif}\;\phi_2 \leq 1.38 \cdot 10^{-8}:\\ \;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_1 \cdot \cos \left(\lambda_1 - \lambda_2\right) + \sin \phi_1 \cdot \phi_2\right)\\ \mathbf{else}:\\ \;\;\;\;{\left({\left(R \cdot \cos^{-1} \left(\cos \phi_2 \cdot \cos \left(\lambda_2 - \lambda_1\right)\right)\right)}^{0.3333333333333333}\right)}^{3}\\ \end{array} \end{array} \]

FPCore

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 -0.00037)
   (* R (acos (+ (* (sin phi1) (sin phi2)) (* (cos phi2) (cos phi1)))))
   (if (<= phi2 1.38e-8)
     (*
      R
      (acos (+ (* (cos phi1) (cos (- lambda1 lambda2))) (* (sin phi1) phi2))))
     (pow
      (pow
       (* R (acos (* (cos phi2) (cos (- lambda2 lambda1)))))
       0.3333333333333333)
      3.0))))

C

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 <= -0.00037) {
		tmp = R * acos(((sin(phi1) * sin(phi2)) + (cos(phi2) * cos(phi1))));
	} else if (phi2 <= 1.38e-8) {
		tmp = R * acos(((cos(phi1) * cos((lambda1 - lambda2))) + (sin(phi1) * phi2)));
	} else {
		tmp = pow(pow((R * acos((cos(phi2) * cos((lambda2 - lambda1))))), 0.3333333333333333), 3.0);
	}
	return tmp;
}

Fortran

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 (phi2 <= (-0.00037d0)) then
        tmp = r * acos(((sin(phi1) * sin(phi2)) + (cos(phi2) * cos(phi1))))
    else if (phi2 <= 1.38d-8) then
        tmp = r * acos(((cos(phi1) * cos((lambda1 - lambda2))) + (sin(phi1) * phi2)))
    else
        tmp = ((r * acos((cos(phi2) * cos((lambda2 - lambda1))))) ** 0.3333333333333333d0) ** 3.0d0
    end if
    code = tmp
end function

Java

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 <= -0.00037) {
		tmp = R * Math.acos(((Math.sin(phi1) * Math.sin(phi2)) + (Math.cos(phi2) * Math.cos(phi1))));
	} else if (phi2 <= 1.38e-8) {
		tmp = R * Math.acos(((Math.cos(phi1) * Math.cos((lambda1 - lambda2))) + (Math.sin(phi1) * phi2)));
	} else {
		tmp = Math.pow(Math.pow((R * Math.acos((Math.cos(phi2) * Math.cos((lambda2 - lambda1))))), 0.3333333333333333), 3.0);
	}
	return tmp;
}

Python

[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2])
def code(R, lambda1, lambda2, phi1, phi2):
	tmp = 0
	if phi2 <= -0.00037:
		tmp = R * math.acos(((math.sin(phi1) * math.sin(phi2)) + (math.cos(phi2) * math.cos(phi1))))
	elif phi2 <= 1.38e-8:
		tmp = R * math.acos(((math.cos(phi1) * math.cos((lambda1 - lambda2))) + (math.sin(phi1) * phi2)))
	else:
		tmp = math.pow(math.pow((R * math.acos((math.cos(phi2) * math.cos((lambda2 - lambda1))))), 0.3333333333333333), 3.0)
	return tmp

Julia

R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2])
function code(R, lambda1, lambda2, phi1, phi2)
	tmp = 0.0
	if (phi2 <= -0.00037)
		tmp = Float64(R * acos(Float64(Float64(sin(phi1) * sin(phi2)) + Float64(cos(phi2) * cos(phi1)))));
	elseif (phi2 <= 1.38e-8)
		tmp = Float64(R * acos(Float64(Float64(cos(phi1) * cos(Float64(lambda1 - lambda2))) + Float64(sin(phi1) * phi2))));
	else
		tmp = (Float64(R * acos(Float64(cos(phi2) * cos(Float64(lambda2 - lambda1))))) ^ 0.3333333333333333) ^ 3.0;
	end
	return tmp
end

MATLAB

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 <= -0.00037)
		tmp = R * acos(((sin(phi1) * sin(phi2)) + (cos(phi2) * cos(phi1))));
	elseif (phi2 <= 1.38e-8)
		tmp = R * acos(((cos(phi1) * cos((lambda1 - lambda2))) + (sin(phi1) * phi2)));
	else
		tmp = ((R * acos((cos(phi2) * cos((lambda2 - lambda1))))) ^ 0.3333333333333333) ^ 3.0;
	end
	tmp_2 = tmp;
end

Wolfram

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, -0.00037], N[(R * N[ArcCos[N[(N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[phi2], $MachinePrecision] * N[Cos[phi1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[phi2, 1.38e-8], N[(R * N[ArcCos[N[(N[(N[Cos[phi1], $MachinePrecision] * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] + N[(N[Sin[phi1], $MachinePrecision] * phi2), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[Power[N[Power[N[(R * N[ArcCos[N[(N[Cos[phi2], $MachinePrecision] * N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], 0.3333333333333333], $MachinePrecision], 3.0], $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if phi2 < -3.6999999999999999e-4

   1. Initial program 83.8%

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

   3. Taylor expanded in lambda2 around 0 61.5%

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

   4. Taylor expanded in lambda1 around 0 40.9%

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

   if -3.6999999999999999e-4 < phi2 < 1.37999999999999995e-8

   1. Initial program 72.1%

      \[\cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right) \cdot R \]

   3. Simplified 72.1%

      \[\leadsto \color{blue}{\cos^{-1} \left(\mathsf{fma}\left(\cos \phi_1, \cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right), \sin \phi_1 \cdot \sin \phi_2\right)\right) \cdot R} \]
   4. Add Preprocessing

   5. Taylor expanded in phi2 around 0 72.1%

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

   if 1.37999999999999995e-8 < phi2

   1. Initial program 72.4%

      \[\cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right) \cdot R \]

   3. Simplified 72.4%

      \[\leadsto \color{blue}{\cos^{-1} \left(\mathsf{fma}\left(\cos \phi_1, \cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right), \sin \phi_1 \cdot \sin \phi_2\right)\right) \cdot R} \]
   4. Add Preprocessing

   5. Taylor expanded in phi1 around 0 42.2%

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

      1. add-cube-cbrt 41.8%

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

      2. pow3 41.7%

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

      3. *-commutative 41.7%

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

      4. +-commutative 41.7%

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

      5. fma-define 41.7%

         \[\leadsto {\left(\sqrt[3]{R \cdot \cos^{-1} \color{blue}{\left(\mathsf{fma}\left(\cos \phi_2, \cos \left(\lambda_1 - \lambda_2\right), \phi_1 \cdot \sin \phi_2\right)\right)}}\right)}^{3} \]

   7. Applied egg-rr 41.7%

      \[\leadsto \color{blue}{{\left(\sqrt[3]{R \cdot \cos^{-1} \left(\mathsf{fma}\left(\cos \phi_2, \cos \left(\lambda_1 - \lambda_2\right), \phi_1 \cdot \sin \phi_2\right)\right)}\right)}^{3}} \]
   8. Step-by-step derivation

      1. pow1/3 15.5%

         \[\leadsto {\color{blue}{\left({\left(R \cdot \cos^{-1} \left(\mathsf{fma}\left(\cos \phi_2, \cos \left(\lambda_1 - \lambda_2\right), \phi_1 \cdot \sin \phi_2\right)\right)\right)}^{0.3333333333333333}\right)}}^{3} \]

   9. Applied egg-rr 15.5%

      \[\leadsto {\color{blue}{\left({\left(R \cdot \cos^{-1} \left(\mathsf{fma}\left(\cos \phi_2, \cos \left(\lambda_1 - \lambda_2\right), \phi_1 \cdot \sin \phi_2\right)\right)\right)}^{0.3333333333333333}\right)}}^{3} \]

   10. Taylor expanded in phi1 around 0 19.7%

       \[\leadsto {\left({\left(R \cdot \cos^{-1} \color{blue}{\left(\cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right)\right)}\right)}^{0.3333333333333333}\right)}^{3} \]
   11. Step-by-step derivation

       1. sub-neg 19.7%

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

       2. neg-mul-1 19.7%

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

       3. neg-mul-1 19.7%

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

       4. remove-double-neg 19.7%

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

       5. mul-1-neg 19.7%

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

       6. distribute-neg-in 19.7%

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

       7. +-commutative 19.7%

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

       8. cos-neg 19.7%

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

       9. mul-1-neg 19.7%

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

       10. unsub-neg 19.7%

           \[\leadsto {\left({\left(R \cdot \cos^{-1} \left(\cos \phi_2 \cdot \cos \color{blue}{\left(\lambda_2 - \lambda_1\right)}\right)\right)}^{0.3333333333333333}\right)}^{3} \]

   12. Simplified 19.7%

       \[\leadsto {\left({\left(R \cdot \cos^{-1} \color{blue}{\left(\cos \phi_2 \cdot \cos \left(\lambda_2 - \lambda_1\right)\right)}\right)}^{0.3333333333333333}\right)}^{3} \]
3. Recombined 3 regimes into one program.

4. Final simplification 51.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\phi_2 \leq -0.00037:\\ \;\;\;\;R \cdot \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \cos \phi_2 \cdot \cos \phi_1\right)\\ \mathbf{elif}\;\phi_2 \leq 1.38 \cdot 10^{-8}:\\ \;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_1 \cdot \cos \left(\lambda_1 - \lambda_2\right) + \sin \phi_1 \cdot \phi_2\right)\\ \mathbf{else}:\\ \;\;\;\;{\left({\left(R \cdot \cos^{-1} \left(\cos \phi_2 \cdot \cos \left(\lambda_2 - \lambda_1\right)\right)\right)}^{0.3333333333333333}\right)}^{3}\\ \end{array} \]
5. Add Preprocessing

Alternative 19: 54.7% accurate, 1.2× speedup

Math

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

FPCore

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 (- lambda1 lambda2))))
   (if (<= phi2 -0.00365)
     (* R (acos (+ (* (sin phi1) (sin phi2)) (* (cos phi2) (cos phi1)))))
     (if (<= phi2 1.7e-26)
       (* R (acos (+ (* (cos phi1) t_0) (* (sin phi1) phi2))))
       (* R (acos (+ (* phi1 (sin phi2)) (* (cos phi2) t_0))))))))

C

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((lambda1 - lambda2));
	double tmp;
	if (phi2 <= -0.00365) {
		tmp = R * acos(((sin(phi1) * sin(phi2)) + (cos(phi2) * cos(phi1))));
	} else if (phi2 <= 1.7e-26) {
		tmp = R * acos(((cos(phi1) * t_0) + (sin(phi1) * phi2)));
	} else {
		tmp = R * acos(((phi1 * sin(phi2)) + (cos(phi2) * t_0)));
	}
	return tmp;
}

Fortran

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) :: t_0
    real(8) :: tmp
    t_0 = cos((lambda1 - lambda2))
    if (phi2 <= (-0.00365d0)) then
        tmp = r * acos(((sin(phi1) * sin(phi2)) + (cos(phi2) * cos(phi1))))
    else if (phi2 <= 1.7d-26) then
        tmp = r * acos(((cos(phi1) * t_0) + (sin(phi1) * phi2)))
    else
        tmp = r * acos(((phi1 * sin(phi2)) + (cos(phi2) * t_0)))
    end if
    code = tmp
end function

Java

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((lambda1 - lambda2));
	double tmp;
	if (phi2 <= -0.00365) {
		tmp = R * Math.acos(((Math.sin(phi1) * Math.sin(phi2)) + (Math.cos(phi2) * Math.cos(phi1))));
	} else if (phi2 <= 1.7e-26) {
		tmp = R * Math.acos(((Math.cos(phi1) * t_0) + (Math.sin(phi1) * phi2)));
	} else {
		tmp = R * Math.acos(((phi1 * Math.sin(phi2)) + (Math.cos(phi2) * t_0)));
	}
	return tmp;
}

Python

[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2])
def code(R, lambda1, lambda2, phi1, phi2):
	t_0 = math.cos((lambda1 - lambda2))
	tmp = 0
	if phi2 <= -0.00365:
		tmp = R * math.acos(((math.sin(phi1) * math.sin(phi2)) + (math.cos(phi2) * math.cos(phi1))))
	elif phi2 <= 1.7e-26:
		tmp = R * math.acos(((math.cos(phi1) * t_0) + (math.sin(phi1) * phi2)))
	else:
		tmp = R * math.acos(((phi1 * math.sin(phi2)) + (math.cos(phi2) * t_0)))
	return tmp

Julia

R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2])
function code(R, lambda1, lambda2, phi1, phi2)
	t_0 = cos(Float64(lambda1 - lambda2))
	tmp = 0.0
	if (phi2 <= -0.00365)
		tmp = Float64(R * acos(Float64(Float64(sin(phi1) * sin(phi2)) + Float64(cos(phi2) * cos(phi1)))));
	elseif (phi2 <= 1.7e-26)
		tmp = Float64(R * acos(Float64(Float64(cos(phi1) * t_0) + Float64(sin(phi1) * phi2))));
	else
		tmp = Float64(R * acos(Float64(Float64(phi1 * sin(phi2)) + Float64(cos(phi2) * t_0))));
	end
	return tmp
end

MATLAB

R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
	t_0 = cos((lambda1 - lambda2));
	tmp = 0.0;
	if (phi2 <= -0.00365)
		tmp = R * acos(((sin(phi1) * sin(phi2)) + (cos(phi2) * cos(phi1))));
	elseif (phi2 <= 1.7e-26)
		tmp = R * acos(((cos(phi1) * t_0) + (sin(phi1) * phi2)));
	else
		tmp = R * acos(((phi1 * sin(phi2)) + (cos(phi2) * t_0)));
	end
	tmp_2 = tmp;
end

Wolfram

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[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[phi2, -0.00365], N[(R * N[ArcCos[N[(N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[phi2], $MachinePrecision] * N[Cos[phi1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[phi2, 1.7e-26], N[(R * N[ArcCos[N[(N[(N[Cos[phi1], $MachinePrecision] * t$95$0), $MachinePrecision] + N[(N[Sin[phi1], $MachinePrecision] * phi2), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[(phi1 * N[Sin[phi2], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[phi2], $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if phi2 < -0.00365000000000000003

   1. Initial program 83.8%

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

   3. Taylor expanded in lambda2 around 0 61.5%

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

   4. Taylor expanded in lambda1 around 0 40.9%

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

   if -0.00365000000000000003 < phi2 < 1.70000000000000007e-26

   1. Initial program 72.1%

      \[\cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right) \cdot R \]

   3. Simplified 72.1%

      \[\leadsto \color{blue}{\cos^{-1} \left(\mathsf{fma}\left(\cos \phi_1, \cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right), \sin \phi_1 \cdot \sin \phi_2\right)\right) \cdot R} \]
   4. Add Preprocessing

   5. Taylor expanded in phi2 around 0 72.1%

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

   if 1.70000000000000007e-26 < phi2

   1. Initial program 72.4%

      \[\cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right) \cdot R \]

   3. Simplified 72.4%

      \[\leadsto \color{blue}{\cos^{-1} \left(\mathsf{fma}\left(\cos \phi_1, \cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right), \sin \phi_1 \cdot \sin \phi_2\right)\right) \cdot R} \]
   4. Add Preprocessing

   5. Taylor expanded in phi1 around 0 42.2%

      \[\leadsto \cos^{-1} \color{blue}{\left(\phi_1 \cdot \sin \phi_2 + \cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right)\right)} \cdot R \]
3. Recombined 3 regimes into one program.

4. Final simplification 57.0%

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

Alternative 20: 52.8% accurate, 1.5× speedup

Math

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

FPCore

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 (- lambda1 lambda2))))
   (if (<= phi1 -0.075)
     (* R (acos (+ (* (cos phi1) t_0) (* (sin phi1) phi2))))
     (* R (acos (+ (* phi1 (sin phi2)) (* (cos phi2) t_0)))))))

C

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((lambda1 - lambda2));
	double tmp;
	if (phi1 <= -0.075) {
		tmp = R * acos(((cos(phi1) * t_0) + (sin(phi1) * phi2)));
	} else {
		tmp = R * acos(((phi1 * sin(phi2)) + (cos(phi2) * t_0)));
	}
	return tmp;
}

Fortran

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) :: t_0
    real(8) :: tmp
    t_0 = cos((lambda1 - lambda2))
    if (phi1 <= (-0.075d0)) then
        tmp = r * acos(((cos(phi1) * t_0) + (sin(phi1) * phi2)))
    else
        tmp = r * acos(((phi1 * sin(phi2)) + (cos(phi2) * t_0)))
    end if
    code = tmp
end function

Java

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((lambda1 - lambda2));
	double tmp;
	if (phi1 <= -0.075) {
		tmp = R * Math.acos(((Math.cos(phi1) * t_0) + (Math.sin(phi1) * phi2)));
	} else {
		tmp = R * Math.acos(((phi1 * Math.sin(phi2)) + (Math.cos(phi2) * t_0)));
	}
	return tmp;
}

Python

[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2])
def code(R, lambda1, lambda2, phi1, phi2):
	t_0 = math.cos((lambda1 - lambda2))
	tmp = 0
	if phi1 <= -0.075:
		tmp = R * math.acos(((math.cos(phi1) * t_0) + (math.sin(phi1) * phi2)))
	else:
		tmp = R * math.acos(((phi1 * math.sin(phi2)) + (math.cos(phi2) * t_0)))
	return tmp

Julia

R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2])
function code(R, lambda1, lambda2, phi1, phi2)
	t_0 = cos(Float64(lambda1 - lambda2))
	tmp = 0.0
	if (phi1 <= -0.075)
		tmp = Float64(R * acos(Float64(Float64(cos(phi1) * t_0) + Float64(sin(phi1) * phi2))));
	else
		tmp = Float64(R * acos(Float64(Float64(phi1 * sin(phi2)) + Float64(cos(phi2) * t_0))));
	end
	return tmp
end

MATLAB

R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
	t_0 = cos((lambda1 - lambda2));
	tmp = 0.0;
	if (phi1 <= -0.075)
		tmp = R * acos(((cos(phi1) * t_0) + (sin(phi1) * phi2)));
	else
		tmp = R * acos(((phi1 * sin(phi2)) + (cos(phi2) * t_0)));
	end
	tmp_2 = tmp;
end

Wolfram

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[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[phi1, -0.075], N[(R * N[ArcCos[N[(N[(N[Cos[phi1], $MachinePrecision] * t$95$0), $MachinePrecision] + N[(N[Sin[phi1], $MachinePrecision] * phi2), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[(phi1 * N[Sin[phi2], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[phi2], $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if phi1 < -0.0749999999999999972

   1. Initial program 74.5%

      \[\cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right) \cdot R \]

   3. Simplified 74.5%

      \[\leadsto \color{blue}{\cos^{-1} \left(\mathsf{fma}\left(\cos \phi_1, \cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right), \sin \phi_1 \cdot \sin \phi_2\right)\right) \cdot R} \]
   4. Add Preprocessing

   5. Taylor expanded in phi2 around 0 40.6%

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

   if -0.0749999999999999972 < phi1

   1. Initial program 75.5%

      \[\cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right) \cdot R \]

   3. Simplified 75.5%

      \[\leadsto \color{blue}{\cos^{-1} \left(\mathsf{fma}\left(\cos \phi_1, \cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right), \sin \phi_1 \cdot \sin \phi_2\right)\right) \cdot R} \]
   4. Add Preprocessing

   5. Taylor expanded in phi1 around 0 47.8%

      \[\leadsto \cos^{-1} \color{blue}{\left(\phi_1 \cdot \sin \phi_2 + \cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right)\right)} \cdot R \]
3. Recombined 2 regimes into one program.

4. Final simplification 45.9%

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

Alternative 21: 37.0% accurate, 1.5× speedup

Math

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

FPCore

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 -3000000000.0)
   (pow (pow (* R (acos (cos (- lambda2 lambda1)))) 0.3333333333333333) 3.0)
   (*
    R
    (acos (+ (* phi1 (sin phi2)) (* (cos phi2) (cos (- lambda1 lambda2))))))))

C

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 <= -3000000000.0) {
		tmp = pow(pow((R * acos(cos((lambda2 - lambda1)))), 0.3333333333333333), 3.0);
	} else {
		tmp = R * acos(((phi1 * sin(phi2)) + (cos(phi2) * cos((lambda1 - lambda2)))));
	}
	return tmp;
}

Fortran

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 <= (-3000000000.0d0)) then
        tmp = ((r * acos(cos((lambda2 - lambda1)))) ** 0.3333333333333333d0) ** 3.0d0
    else
        tmp = r * acos(((phi1 * sin(phi2)) + (cos(phi2) * cos((lambda1 - lambda2)))))
    end if
    code = tmp
end function

Java

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 <= -3000000000.0) {
		tmp = Math.pow(Math.pow((R * Math.acos(Math.cos((lambda2 - lambda1)))), 0.3333333333333333), 3.0);
	} else {
		tmp = R * Math.acos(((phi1 * Math.sin(phi2)) + (Math.cos(phi2) * Math.cos((lambda1 - lambda2)))));
	}
	return tmp;
}

Python

[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2])
def code(R, lambda1, lambda2, phi1, phi2):
	tmp = 0
	if phi1 <= -3000000000.0:
		tmp = math.pow(math.pow((R * math.acos(math.cos((lambda2 - lambda1)))), 0.3333333333333333), 3.0)
	else:
		tmp = R * math.acos(((phi1 * math.sin(phi2)) + (math.cos(phi2) * math.cos((lambda1 - lambda2)))))
	return tmp

Julia

R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2])
function code(R, lambda1, lambda2, phi1, phi2)
	tmp = 0.0
	if (phi1 <= -3000000000.0)
		tmp = (Float64(R * acos(cos(Float64(lambda2 - lambda1)))) ^ 0.3333333333333333) ^ 3.0;
	else
		tmp = Float64(R * acos(Float64(Float64(phi1 * sin(phi2)) + Float64(cos(phi2) * cos(Float64(lambda1 - lambda2))))));
	end
	return tmp
end

MATLAB

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 <= -3000000000.0)
		tmp = ((R * acos(cos((lambda2 - lambda1)))) ^ 0.3333333333333333) ^ 3.0;
	else
		tmp = R * acos(((phi1 * sin(phi2)) + (cos(phi2) * cos((lambda1 - lambda2)))));
	end
	tmp_2 = tmp;
end

Wolfram

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, -3000000000.0], N[Power[N[Power[N[(R * N[ArcCos[N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision]], $MachinePrecision]), $MachinePrecision], 0.3333333333333333], $MachinePrecision], 3.0], $MachinePrecision], N[(R * N[ArcCos[N[(N[(phi1 * N[Sin[phi2], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[phi2], $MachinePrecision] * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if phi1 < -3e9

   1. Initial program 75.3%

      \[\cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right) \cdot R \]

   3. Simplified 75.3%

      \[\leadsto \color{blue}{\cos^{-1} \left(\mathsf{fma}\left(\cos \phi_1, \cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right), \sin \phi_1 \cdot \sin \phi_2\right)\right) \cdot R} \]
   4. Add Preprocessing

   5. Taylor expanded in phi1 around 0 3.7%

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

      1. add-cube-cbrt 3.7%

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

      2. pow3 3.7%

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

      3. *-commutative 3.7%

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

      4. +-commutative 3.7%

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

      5. fma-define 3.7%

         \[\leadsto {\left(\sqrt[3]{R \cdot \cos^{-1} \color{blue}{\left(\mathsf{fma}\left(\cos \phi_2, \cos \left(\lambda_1 - \lambda_2\right), \phi_1 \cdot \sin \phi_2\right)\right)}}\right)}^{3} \]

   7. Applied egg-rr 3.7%

      \[\leadsto \color{blue}{{\left(\sqrt[3]{R \cdot \cos^{-1} \left(\mathsf{fma}\left(\cos \phi_2, \cos \left(\lambda_1 - \lambda_2\right), \phi_1 \cdot \sin \phi_2\right)\right)}\right)}^{3}} \]
   8. Step-by-step derivation

      1. pow1/3 2.0%

         \[\leadsto {\color{blue}{\left({\left(R \cdot \cos^{-1} \left(\mathsf{fma}\left(\cos \phi_2, \cos \left(\lambda_1 - \lambda_2\right), \phi_1 \cdot \sin \phi_2\right)\right)\right)}^{0.3333333333333333}\right)}}^{3} \]

   9. Applied egg-rr 2.0%

      \[\leadsto {\color{blue}{\left({\left(R \cdot \cos^{-1} \left(\mathsf{fma}\left(\cos \phi_2, \cos \left(\lambda_1 - \lambda_2\right), \phi_1 \cdot \sin \phi_2\right)\right)\right)}^{0.3333333333333333}\right)}}^{3} \]

   10. Taylor expanded in phi2 around 0 8.5%

       \[\leadsto {\left({\left(R \cdot \cos^{-1} \color{blue}{\cos \left(\lambda_1 - \lambda_2\right)}\right)}^{0.3333333333333333}\right)}^{3} \]
   11. Step-by-step derivation

       1. sub-neg 8.5%

          \[\leadsto {\left({\left(R \cdot \cos^{-1} \cos \color{blue}{\left(\lambda_1 + \left(-\lambda_2\right)\right)}\right)}^{0.3333333333333333}\right)}^{3} \]

       2. remove-double-neg 8.5%

          \[\leadsto {\left({\left(R \cdot \cos^{-1} \cos \left(\color{blue}{\left(-\left(-\lambda_1\right)\right)} + \left(-\lambda_2\right)\right)\right)}^{0.3333333333333333}\right)}^{3} \]

       3. mul-1-neg 8.5%

          \[\leadsto {\left({\left(R \cdot \cos^{-1} \cos \left(\left(-\color{blue}{-1 \cdot \lambda_1}\right) + \left(-\lambda_2\right)\right)\right)}^{0.3333333333333333}\right)}^{3} \]

       4. distribute-neg-in 8.5%

          \[\leadsto {\left({\left(R \cdot \cos^{-1} \cos \color{blue}{\left(-\left(-1 \cdot \lambda_1 + \lambda_2\right)\right)}\right)}^{0.3333333333333333}\right)}^{3} \]

       5. +-commutative 8.5%

          \[\leadsto {\left({\left(R \cdot \cos^{-1} \cos \left(-\color{blue}{\left(\lambda_2 + -1 \cdot \lambda_1\right)}\right)\right)}^{0.3333333333333333}\right)}^{3} \]

       6. cos-neg 8.5%

          \[\leadsto {\left({\left(R \cdot \cos^{-1} \color{blue}{\cos \left(\lambda_2 + -1 \cdot \lambda_1\right)}\right)}^{0.3333333333333333}\right)}^{3} \]

       7. mul-1-neg 8.5%

          \[\leadsto {\left({\left(R \cdot \cos^{-1} \cos \left(\lambda_2 + \color{blue}{\left(-\lambda_1\right)}\right)\right)}^{0.3333333333333333}\right)}^{3} \]

       8. unsub-neg 8.5%

          \[\leadsto {\left({\left(R \cdot \cos^{-1} \cos \color{blue}{\left(\lambda_2 - \lambda_1\right)}\right)}^{0.3333333333333333}\right)}^{3} \]

   12. Simplified 8.5%

       \[\leadsto {\left({\left(R \cdot \cos^{-1} \color{blue}{\cos \left(\lambda_2 - \lambda_1\right)}\right)}^{0.3333333333333333}\right)}^{3} \]

   if -3e9 < phi1

   1. Initial program 75.2%

      \[\cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right) \cdot R \]

   3. Simplified 75.2%

      \[\leadsto \color{blue}{\cos^{-1} \left(\mathsf{fma}\left(\cos \phi_1, \cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right), \sin \phi_1 \cdot \sin \phi_2\right)\right) \cdot R} \]
   4. Add Preprocessing

   5. Taylor expanded in phi1 around 0 47.6%

      \[\leadsto \cos^{-1} \color{blue}{\left(\phi_1 \cdot \sin \phi_2 + \cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right)\right)} \cdot R \]
3. Recombined 2 regimes into one program.

4. Final simplification 37.7%

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

Alternative 22: 29.7% accurate, 1.5× speedup

Math

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

FPCore

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 (* phi1 (sin phi2))))
   (if (<= lambda2 0.185)
     (* R (acos (+ t_0 (* (cos phi2) (cos lambda1)))))
     (* R (acos (+ t_0 (* (cos phi2) (cos lambda2))))))))

C

assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	double t_0 = phi1 * sin(phi2);
	double tmp;
	if (lambda2 <= 0.185) {
		tmp = R * acos((t_0 + (cos(phi2) * cos(lambda1))));
	} else {
		tmp = R * acos((t_0 + (cos(phi2) * cos(lambda2))));
	}
	return tmp;
}

Fortran

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) :: t_0
    real(8) :: tmp
    t_0 = phi1 * sin(phi2)
    if (lambda2 <= 0.185d0) then
        tmp = r * acos((t_0 + (cos(phi2) * cos(lambda1))))
    else
        tmp = r * acos((t_0 + (cos(phi2) * cos(lambda2))))
    end if
    code = tmp
end function

Java

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 = phi1 * Math.sin(phi2);
	double tmp;
	if (lambda2 <= 0.185) {
		tmp = R * Math.acos((t_0 + (Math.cos(phi2) * Math.cos(lambda1))));
	} else {
		tmp = R * Math.acos((t_0 + (Math.cos(phi2) * Math.cos(lambda2))));
	}
	return tmp;
}

Python

[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2])
def code(R, lambda1, lambda2, phi1, phi2):
	t_0 = phi1 * math.sin(phi2)
	tmp = 0
	if lambda2 <= 0.185:
		tmp = R * math.acos((t_0 + (math.cos(phi2) * math.cos(lambda1))))
	else:
		tmp = R * math.acos((t_0 + (math.cos(phi2) * math.cos(lambda2))))
	return tmp

Julia

R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2])
function code(R, lambda1, lambda2, phi1, phi2)
	t_0 = Float64(phi1 * sin(phi2))
	tmp = 0.0
	if (lambda2 <= 0.185)
		tmp = Float64(R * acos(Float64(t_0 + Float64(cos(phi2) * cos(lambda1)))));
	else
		tmp = Float64(R * acos(Float64(t_0 + Float64(cos(phi2) * cos(lambda2)))));
	end
	return tmp
end

MATLAB

R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
	t_0 = phi1 * sin(phi2);
	tmp = 0.0;
	if (lambda2 <= 0.185)
		tmp = R * acos((t_0 + (cos(phi2) * cos(lambda1))));
	else
		tmp = R * acos((t_0 + (cos(phi2) * cos(lambda2))));
	end
	tmp_2 = tmp;
end

Wolfram

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[(phi1 * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[lambda2, 0.185], N[(R * N[ArcCos[N[(t$95$0 + N[(N[Cos[phi2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(t$95$0 + N[(N[Cos[phi2], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if lambda2 < 0.185

   1. Initial program 80.7%

      \[\cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right) \cdot R \]

   3. Simplified 80.6%

      \[\leadsto \color{blue}{\cos^{-1} \left(\mathsf{fma}\left(\cos \phi_1, \cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right), \sin \phi_1 \cdot \sin \phi_2\right)\right) \cdot R} \]
   4. Add Preprocessing

   5. Taylor expanded in phi1 around 0 38.8%

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

   6. Taylor expanded in lambda2 around 0 32.5%

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

   if 0.185 < lambda2

   1. Initial program 58.2%

      \[\cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right) \cdot R \]

   3. Simplified 58.2%

      \[\leadsto \color{blue}{\cos^{-1} \left(\mathsf{fma}\left(\cos \phi_1, \cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right), \sin \phi_1 \cdot \sin \phi_2\right)\right) \cdot R} \]
   4. Add Preprocessing

   5. Taylor expanded in phi1 around 0 29.0%

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

   6. Taylor expanded in lambda1 around 0 29.3%

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

      1. cos-neg 29.3%

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

   8. Simplified 29.3%

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

4. Final simplification 31.7%

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

Alternative 23: 23.8% accurate, 1.5× speedup

Math

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

FPCore

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 8.0)
   (pow (pow (* R (acos (cos (- lambda2 lambda1)))) 0.3333333333333333) 3.0)
   (* R (acos (+ (* phi1 (sin phi2)) (* (cos phi2) (cos lambda1)))))))

C

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 <= 8.0) {
		tmp = pow(pow((R * acos(cos((lambda2 - lambda1)))), 0.3333333333333333), 3.0);
	} else {
		tmp = R * acos(((phi1 * sin(phi2)) + (cos(phi2) * cos(lambda1))));
	}
	return tmp;
}

Fortran

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 (phi2 <= 8.0d0) then
        tmp = ((r * acos(cos((lambda2 - lambda1)))) ** 0.3333333333333333d0) ** 3.0d0
    else
        tmp = r * acos(((phi1 * sin(phi2)) + (cos(phi2) * cos(lambda1))))
    end if
    code = tmp
end function

Java

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 <= 8.0) {
		tmp = Math.pow(Math.pow((R * Math.acos(Math.cos((lambda2 - lambda1)))), 0.3333333333333333), 3.0);
	} else {
		tmp = R * Math.acos(((phi1 * Math.sin(phi2)) + (Math.cos(phi2) * Math.cos(lambda1))));
	}
	return tmp;
}

Python

[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2])
def code(R, lambda1, lambda2, phi1, phi2):
	tmp = 0
	if phi2 <= 8.0:
		tmp = math.pow(math.pow((R * math.acos(math.cos((lambda2 - lambda1)))), 0.3333333333333333), 3.0)
	else:
		tmp = R * math.acos(((phi1 * math.sin(phi2)) + (math.cos(phi2) * math.cos(lambda1))))
	return tmp

Julia

R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2])
function code(R, lambda1, lambda2, phi1, phi2)
	tmp = 0.0
	if (phi2 <= 8.0)
		tmp = (Float64(R * acos(cos(Float64(lambda2 - lambda1)))) ^ 0.3333333333333333) ^ 3.0;
	else
		tmp = Float64(R * acos(Float64(Float64(phi1 * sin(phi2)) + Float64(cos(phi2) * cos(lambda1)))));
	end
	return tmp
end

MATLAB

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 <= 8.0)
		tmp = ((R * acos(cos((lambda2 - lambda1)))) ^ 0.3333333333333333) ^ 3.0;
	else
		tmp = R * acos(((phi1 * sin(phi2)) + (cos(phi2) * cos(lambda1))));
	end
	tmp_2 = tmp;
end

Wolfram

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, 8.0], N[Power[N[Power[N[(R * N[ArcCos[N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision]], $MachinePrecision]), $MachinePrecision], 0.3333333333333333], $MachinePrecision], 3.0], $MachinePrecision], N[(R * N[ArcCos[N[(N[(phi1 * N[Sin[phi2], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[phi2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if phi2 < 8

   1. Initial program 75.7%

      \[\cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right) \cdot R \]

   3. Simplified 75.7%

      \[\leadsto \color{blue}{\cos^{-1} \left(\mathsf{fma}\left(\cos \phi_1, \cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right), \sin \phi_1 \cdot \sin \phi_2\right)\right) \cdot R} \]
   4. Add Preprocessing

   5. Taylor expanded in phi1 around 0 34.5%

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

      1. add-cube-cbrt 34.2%

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

      2. pow3 34.2%

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

      3. *-commutative 34.2%

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

      4. +-commutative 34.2%

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

      5. fma-define 34.2%

         \[\leadsto {\left(\sqrt[3]{R \cdot \cos^{-1} \color{blue}{\left(\mathsf{fma}\left(\cos \phi_2, \cos \left(\lambda_1 - \lambda_2\right), \phi_1 \cdot \sin \phi_2\right)\right)}}\right)}^{3} \]

   7. Applied egg-rr 34.2%

      \[\leadsto \color{blue}{{\left(\sqrt[3]{R \cdot \cos^{-1} \left(\mathsf{fma}\left(\cos \phi_2, \cos \left(\lambda_1 - \lambda_2\right), \phi_1 \cdot \sin \phi_2\right)\right)}\right)}^{3}} \]
   8. Step-by-step derivation

      1. pow1/3 18.3%

         \[\leadsto {\color{blue}{\left({\left(R \cdot \cos^{-1} \left(\mathsf{fma}\left(\cos \phi_2, \cos \left(\lambda_1 - \lambda_2\right), \phi_1 \cdot \sin \phi_2\right)\right)\right)}^{0.3333333333333333}\right)}}^{3} \]

   9. Applied egg-rr 18.3%

      \[\leadsto {\color{blue}{\left({\left(R \cdot \cos^{-1} \left(\mathsf{fma}\left(\cos \phi_2, \cos \left(\lambda_1 - \lambda_2\right), \phi_1 \cdot \sin \phi_2\right)\right)\right)}^{0.3333333333333333}\right)}}^{3} \]

   10. Taylor expanded in phi2 around 0 14.6%

       \[\leadsto {\left({\left(R \cdot \cos^{-1} \color{blue}{\cos \left(\lambda_1 - \lambda_2\right)}\right)}^{0.3333333333333333}\right)}^{3} \]
   11. Step-by-step derivation

       1. sub-neg 14.6%

          \[\leadsto {\left({\left(R \cdot \cos^{-1} \cos \color{blue}{\left(\lambda_1 + \left(-\lambda_2\right)\right)}\right)}^{0.3333333333333333}\right)}^{3} \]

       2. remove-double-neg 14.6%

          \[\leadsto {\left({\left(R \cdot \cos^{-1} \cos \left(\color{blue}{\left(-\left(-\lambda_1\right)\right)} + \left(-\lambda_2\right)\right)\right)}^{0.3333333333333333}\right)}^{3} \]

       3. mul-1-neg 14.6%

          \[\leadsto {\left({\left(R \cdot \cos^{-1} \cos \left(\left(-\color{blue}{-1 \cdot \lambda_1}\right) + \left(-\lambda_2\right)\right)\right)}^{0.3333333333333333}\right)}^{3} \]

       4. distribute-neg-in 14.6%

          \[\leadsto {\left({\left(R \cdot \cos^{-1} \cos \color{blue}{\left(-\left(-1 \cdot \lambda_1 + \lambda_2\right)\right)}\right)}^{0.3333333333333333}\right)}^{3} \]

       5. +-commutative 14.6%

          \[\leadsto {\left({\left(R \cdot \cos^{-1} \cos \left(-\color{blue}{\left(\lambda_2 + -1 \cdot \lambda_1\right)}\right)\right)}^{0.3333333333333333}\right)}^{3} \]

       6. cos-neg 14.6%

          \[\leadsto {\left({\left(R \cdot \cos^{-1} \color{blue}{\cos \left(\lambda_2 + -1 \cdot \lambda_1\right)}\right)}^{0.3333333333333333}\right)}^{3} \]

       7. mul-1-neg 14.6%

          \[\leadsto {\left({\left(R \cdot \cos^{-1} \cos \left(\lambda_2 + \color{blue}{\left(-\lambda_1\right)}\right)\right)}^{0.3333333333333333}\right)}^{3} \]

       8. unsub-neg 14.6%

          \[\leadsto {\left({\left(R \cdot \cos^{-1} \cos \color{blue}{\left(\lambda_2 - \lambda_1\right)}\right)}^{0.3333333333333333}\right)}^{3} \]

   12. Simplified 14.6%

       \[\leadsto {\left({\left(R \cdot \cos^{-1} \color{blue}{\cos \left(\lambda_2 - \lambda_1\right)}\right)}^{0.3333333333333333}\right)}^{3} \]

   if 8 < phi2

   1. Initial program 73.4%

      \[\cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right) \cdot R \]

   3. Simplified 73.3%

      \[\leadsto \color{blue}{\cos^{-1} \left(\mathsf{fma}\left(\cos \phi_1, \cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right), \sin \phi_1 \cdot \sin \phi_2\right)\right) \cdot R} \]
   4. Add Preprocessing

   5. Taylor expanded in phi1 around 0 43.4%

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

   6. Taylor expanded in lambda2 around 0 36.4%

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

4. Final simplification 19.3%

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

Alternative 24: 24.3% accurate, 1.5× speedup

Math

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

FPCore

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 -4.9e-116)
   (pow (pow (* R (acos (cos (- lambda2 lambda1)))) 0.3333333333333333) 3.0)
   (* R (acos (+ (* (cos phi2) (cos (- lambda1 lambda2))) (* phi1 phi2))))))

C

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 <= -4.9e-116) {
		tmp = pow(pow((R * acos(cos((lambda2 - lambda1)))), 0.3333333333333333), 3.0);
	} else {
		tmp = R * acos(((cos(phi2) * cos((lambda1 - lambda2))) + (phi1 * phi2)));
	}
	return tmp;
}

Fortran

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 <= (-4.9d-116)) then
        tmp = ((r * acos(cos((lambda2 - lambda1)))) ** 0.3333333333333333d0) ** 3.0d0
    else
        tmp = r * acos(((cos(phi2) * cos((lambda1 - lambda2))) + (phi1 * phi2)))
    end if
    code = tmp
end function

Java

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 <= -4.9e-116) {
		tmp = Math.pow(Math.pow((R * Math.acos(Math.cos((lambda2 - lambda1)))), 0.3333333333333333), 3.0);
	} else {
		tmp = R * Math.acos(((Math.cos(phi2) * Math.cos((lambda1 - lambda2))) + (phi1 * phi2)));
	}
	return tmp;
}

Python

[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2])
def code(R, lambda1, lambda2, phi1, phi2):
	tmp = 0
	if phi1 <= -4.9e-116:
		tmp = math.pow(math.pow((R * math.acos(math.cos((lambda2 - lambda1)))), 0.3333333333333333), 3.0)
	else:
		tmp = R * math.acos(((math.cos(phi2) * math.cos((lambda1 - lambda2))) + (phi1 * phi2)))
	return tmp

Julia

R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2])
function code(R, lambda1, lambda2, phi1, phi2)
	tmp = 0.0
	if (phi1 <= -4.9e-116)
		tmp = (Float64(R * acos(cos(Float64(lambda2 - lambda1)))) ^ 0.3333333333333333) ^ 3.0;
	else
		tmp = Float64(R * acos(Float64(Float64(cos(phi2) * cos(Float64(lambda1 - lambda2))) + Float64(phi1 * phi2))));
	end
	return tmp
end

MATLAB

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 <= -4.9e-116)
		tmp = ((R * acos(cos((lambda2 - lambda1)))) ^ 0.3333333333333333) ^ 3.0;
	else
		tmp = R * acos(((cos(phi2) * cos((lambda1 - lambda2))) + (phi1 * phi2)));
	end
	tmp_2 = tmp;
end

Wolfram

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, -4.9e-116], N[Power[N[Power[N[(R * N[ArcCos[N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision]], $MachinePrecision]), $MachinePrecision], 0.3333333333333333], $MachinePrecision], 3.0], $MachinePrecision], N[(R * N[ArcCos[N[(N[(N[Cos[phi2], $MachinePrecision] * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] + N[(phi1 * phi2), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if phi1 < -4.89999999999999977e-116

   1. Initial program 73.7%

      \[\cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right) \cdot R \]

   3. Simplified 73.7%

      \[\leadsto \color{blue}{\cos^{-1} \left(\mathsf{fma}\left(\cos \phi_1, \cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right), \sin \phi_1 \cdot \sin \phi_2\right)\right) \cdot R} \]
   4. Add Preprocessing

   5. Taylor expanded in phi1 around 0 21.9%

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

      1. add-cube-cbrt 21.8%

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

      2. pow3 21.8%

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

      3. *-commutative 21.8%

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

      4. +-commutative 21.8%

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

      5. fma-define 21.8%

         \[\leadsto {\left(\sqrt[3]{R \cdot \cos^{-1} \color{blue}{\left(\mathsf{fma}\left(\cos \phi_2, \cos \left(\lambda_1 - \lambda_2\right), \phi_1 \cdot \sin \phi_2\right)\right)}}\right)}^{3} \]

   7. Applied egg-rr 21.8%

      \[\leadsto \color{blue}{{\left(\sqrt[3]{R \cdot \cos^{-1} \left(\mathsf{fma}\left(\cos \phi_2, \cos \left(\lambda_1 - \lambda_2\right), \phi_1 \cdot \sin \phi_2\right)\right)}\right)}^{3}} \]
   8. Step-by-step derivation

      1. pow1/3 12.3%

         \[\leadsto {\color{blue}{\left({\left(R \cdot \cos^{-1} \left(\mathsf{fma}\left(\cos \phi_2, \cos \left(\lambda_1 - \lambda_2\right), \phi_1 \cdot \sin \phi_2\right)\right)\right)}^{0.3333333333333333}\right)}}^{3} \]

   9. Applied egg-rr 12.3%

      \[\leadsto {\color{blue}{\left({\left(R \cdot \cos^{-1} \left(\mathsf{fma}\left(\cos \phi_2, \cos \left(\lambda_1 - \lambda_2\right), \phi_1 \cdot \sin \phi_2\right)\right)\right)}^{0.3333333333333333}\right)}}^{3} \]

   10. Taylor expanded in phi2 around 0 11.2%

       \[\leadsto {\left({\left(R \cdot \cos^{-1} \color{blue}{\cos \left(\lambda_1 - \lambda_2\right)}\right)}^{0.3333333333333333}\right)}^{3} \]
   11. Step-by-step derivation

       1. sub-neg 11.2%

          \[\leadsto {\left({\left(R \cdot \cos^{-1} \cos \color{blue}{\left(\lambda_1 + \left(-\lambda_2\right)\right)}\right)}^{0.3333333333333333}\right)}^{3} \]

       2. remove-double-neg 11.2%

          \[\leadsto {\left({\left(R \cdot \cos^{-1} \cos \left(\color{blue}{\left(-\left(-\lambda_1\right)\right)} + \left(-\lambda_2\right)\right)\right)}^{0.3333333333333333}\right)}^{3} \]

       3. mul-1-neg 11.2%

          \[\leadsto {\left({\left(R \cdot \cos^{-1} \cos \left(\left(-\color{blue}{-1 \cdot \lambda_1}\right) + \left(-\lambda_2\right)\right)\right)}^{0.3333333333333333}\right)}^{3} \]

       4. distribute-neg-in 11.2%

          \[\leadsto {\left({\left(R \cdot \cos^{-1} \cos \color{blue}{\left(-\left(-1 \cdot \lambda_1 + \lambda_2\right)\right)}\right)}^{0.3333333333333333}\right)}^{3} \]

       5. +-commutative 11.2%

          \[\leadsto {\left({\left(R \cdot \cos^{-1} \cos \left(-\color{blue}{\left(\lambda_2 + -1 \cdot \lambda_1\right)}\right)\right)}^{0.3333333333333333}\right)}^{3} \]

       6. cos-neg 11.2%

          \[\leadsto {\left({\left(R \cdot \cos^{-1} \color{blue}{\cos \left(\lambda_2 + -1 \cdot \lambda_1\right)}\right)}^{0.3333333333333333}\right)}^{3} \]

       7. mul-1-neg 11.2%

          \[\leadsto {\left({\left(R \cdot \cos^{-1} \cos \left(\lambda_2 + \color{blue}{\left(-\lambda_1\right)}\right)\right)}^{0.3333333333333333}\right)}^{3} \]

       8. unsub-neg 11.2%

          \[\leadsto {\left({\left(R \cdot \cos^{-1} \cos \color{blue}{\left(\lambda_2 - \lambda_1\right)}\right)}^{0.3333333333333333}\right)}^{3} \]

   12. Simplified 11.2%

       \[\leadsto {\left({\left(R \cdot \cos^{-1} \color{blue}{\cos \left(\lambda_2 - \lambda_1\right)}\right)}^{0.3333333333333333}\right)}^{3} \]

   if -4.89999999999999977e-116 < phi1

   1. Initial program 76.1%

      \[\cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right) \cdot R \]

   3. Simplified 76.1%

      \[\leadsto \color{blue}{\cos^{-1} \left(\mathsf{fma}\left(\cos \phi_1, \cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right), \sin \phi_1 \cdot \sin \phi_2\right)\right) \cdot R} \]
   4. Add Preprocessing

   5. Taylor expanded in phi1 around 0 44.3%

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

   6. Taylor expanded in phi2 around 0 35.7%

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

4. Final simplification 27.1%

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

Alternative 25: 16.8% accurate, 2.0× speedup

Math

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

FPCore

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 (* phi1 (sin phi2))))
   (if (<= lambda1 -0.0005)
     (* R (acos (+ (cos lambda1) t_0)))
     (* R (acos (+ (cos lambda2) t_0))))))

C

assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	double t_0 = phi1 * sin(phi2);
	double tmp;
	if (lambda1 <= -0.0005) {
		tmp = R * acos((cos(lambda1) + t_0));
	} else {
		tmp = R * acos((cos(lambda2) + t_0));
	}
	return tmp;
}

Fortran

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) :: t_0
    real(8) :: tmp
    t_0 = phi1 * sin(phi2)
    if (lambda1 <= (-0.0005d0)) then
        tmp = r * acos((cos(lambda1) + t_0))
    else
        tmp = r * acos((cos(lambda2) + t_0))
    end if
    code = tmp
end function

Java

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 = phi1 * Math.sin(phi2);
	double tmp;
	if (lambda1 <= -0.0005) {
		tmp = R * Math.acos((Math.cos(lambda1) + t_0));
	} else {
		tmp = R * Math.acos((Math.cos(lambda2) + t_0));
	}
	return tmp;
}

Python

[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2])
def code(R, lambda1, lambda2, phi1, phi2):
	t_0 = phi1 * math.sin(phi2)
	tmp = 0
	if lambda1 <= -0.0005:
		tmp = R * math.acos((math.cos(lambda1) + t_0))
	else:
		tmp = R * math.acos((math.cos(lambda2) + t_0))
	return tmp

Julia

R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2])
function code(R, lambda1, lambda2, phi1, phi2)
	t_0 = Float64(phi1 * sin(phi2))
	tmp = 0.0
	if (lambda1 <= -0.0005)
		tmp = Float64(R * acos(Float64(cos(lambda1) + t_0)));
	else
		tmp = Float64(R * acos(Float64(cos(lambda2) + t_0)));
	end
	return tmp
end

MATLAB

R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
	t_0 = phi1 * sin(phi2);
	tmp = 0.0;
	if (lambda1 <= -0.0005)
		tmp = R * acos((cos(lambda1) + t_0));
	else
		tmp = R * acos((cos(lambda2) + t_0));
	end
	tmp_2 = tmp;
end

Wolfram

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[(phi1 * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[lambda1, -0.0005], N[(R * N[ArcCos[N[(N[Cos[lambda1], $MachinePrecision] + t$95$0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[Cos[lambda2], $MachinePrecision] + t$95$0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if lambda1 < -5.0000000000000001e-4

   1. Initial program 62.7%

      \[\cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right) \cdot R \]

   3. Simplified 62.7%

      \[\leadsto \color{blue}{\cos^{-1} \left(\mathsf{fma}\left(\cos \phi_1, \cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right), \sin \phi_1 \cdot \sin \phi_2\right)\right) \cdot R} \]
   4. Add Preprocessing

   5. Taylor expanded in phi1 around 0 36.2%

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

   6. Taylor expanded in phi2 around 0 22.3%

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

   7. Taylor expanded in lambda1 around inf 22.2%

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

   if -5.0000000000000001e-4 < lambda1

   1. Initial program 80.1%

      \[\cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right) \cdot R \]

   3. Simplified 80.1%

      \[\leadsto \color{blue}{\cos^{-1} \left(\mathsf{fma}\left(\cos \phi_1, \cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right), \sin \phi_1 \cdot \sin \phi_2\right)\right) \cdot R} \]
   4. Add Preprocessing

   5. Taylor expanded in phi1 around 0 36.6%

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

   6. Taylor expanded in phi2 around 0 19.1%

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

   7. Taylor expanded in lambda1 around 0 13.6%

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

      1. cos-neg 27.3%

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

   9. Simplified 13.6%

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

4. Final simplification 16.0%

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

Alternative 26: 25.4% accurate, 2.0× speedup

Math

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

FPCore

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 (acos (+ (* (cos phi2) (cos (- lambda1 lambda2))) (* phi1 phi2)))))

C

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

Fortran

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 * acos(((cos(phi2) * cos((lambda1 - lambda2))) + (phi1 * phi2)))
end function

Java

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 * Math.acos(((Math.cos(phi2) * Math.cos((lambda1 - lambda2))) + (phi1 * phi2)));
}

Python

[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2])
def code(R, lambda1, lambda2, phi1, phi2):
	return R * math.acos(((math.cos(phi2) * math.cos((lambda1 - lambda2))) + (phi1 * phi2)))

Julia

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

MATLAB

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

Wolfram

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 * N[ArcCos[N[(N[(N[Cos[phi2], $MachinePrecision] * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] + N[(phi1 * phi2), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 75.2%

   \[\cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right) \cdot R \]

3. Simplified 75.2%

   \[\leadsto \color{blue}{\cos^{-1} \left(\mathsf{fma}\left(\cos \phi_1, \cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right), \sin \phi_1 \cdot \sin \phi_2\right)\right) \cdot R} \]
4. Add Preprocessing

5. Taylor expanded in phi1 around 0 36.5%

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

6. Taylor expanded in phi2 around 0 26.4%

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

7. Final simplification 26.4%

   \[\leadsto R \cdot \cos^{-1} \left(\cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right) + \phi_1 \cdot \phi_2\right) \]
8. Add Preprocessing

Alternative 27: 20.3% accurate, 2.0× speedup

Math

\[\begin{array}{l} [R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\ \\ R \cdot \cos^{-1} \left(\cos \left(\lambda_1 - \lambda_2\right) + \phi_1 \cdot \sin \phi_2\right) \end{array} \]

FPCore

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 (acos (+ (cos (- lambda1 lambda2)) (* phi1 (sin phi2))))))

C

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

Fortran

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 * acos((cos((lambda1 - lambda2)) + (phi1 * sin(phi2))))
end function

Java

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 * Math.acos((Math.cos((lambda1 - lambda2)) + (phi1 * Math.sin(phi2))));
}

Python

[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2])
def code(R, lambda1, lambda2, phi1, phi2):
	return R * math.acos((math.cos((lambda1 - lambda2)) + (phi1 * math.sin(phi2))))

Julia

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

MATLAB

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

Wolfram

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 * N[ArcCos[N[(N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision] + N[(phi1 * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 75.2%

   \[\cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right) \cdot R \]

3. Simplified 75.2%

   \[\leadsto \color{blue}{\cos^{-1} \left(\mathsf{fma}\left(\cos \phi_1, \cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right), \sin \phi_1 \cdot \sin \phi_2\right)\right) \cdot R} \]
4. Add Preprocessing

5. Taylor expanded in phi1 around 0 36.5%

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

6. Taylor expanded in phi2 around 0 20.0%

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

7. Final simplification 20.0%

   \[\leadsto R \cdot \cos^{-1} \left(\cos \left(\lambda_1 - \lambda_2\right) + \phi_1 \cdot \sin \phi_2\right) \]
8. Add Preprocessing

Alternative 28: 14.7% accurate, 2.9× speedup

Math

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

FPCore

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 (<= lambda2 0.205)
   (* R (acos (+ (cos lambda1) (* phi1 phi2))))
   (* R (acos (+ (cos lambda2) (* phi1 phi2))))))

C

assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	double tmp;
	if (lambda2 <= 0.205) {
		tmp = R * acos((cos(lambda1) + (phi1 * phi2)));
	} else {
		tmp = R * acos((cos(lambda2) + (phi1 * phi2)));
	}
	return tmp;
}

Fortran

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 (lambda2 <= 0.205d0) then
        tmp = r * acos((cos(lambda1) + (phi1 * phi2)))
    else
        tmp = r * acos((cos(lambda2) + (phi1 * phi2)))
    end if
    code = tmp
end function

Java

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 (lambda2 <= 0.205) {
		tmp = R * Math.acos((Math.cos(lambda1) + (phi1 * phi2)));
	} else {
		tmp = R * Math.acos((Math.cos(lambda2) + (phi1 * phi2)));
	}
	return tmp;
}

Python

[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2])
def code(R, lambda1, lambda2, phi1, phi2):
	tmp = 0
	if lambda2 <= 0.205:
		tmp = R * math.acos((math.cos(lambda1) + (phi1 * phi2)))
	else:
		tmp = R * math.acos((math.cos(lambda2) + (phi1 * phi2)))
	return tmp

Julia

R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2])
function code(R, lambda1, lambda2, phi1, phi2)
	tmp = 0.0
	if (lambda2 <= 0.205)
		tmp = Float64(R * acos(Float64(cos(lambda1) + Float64(phi1 * phi2))));
	else
		tmp = Float64(R * acos(Float64(cos(lambda2) + Float64(phi1 * phi2))));
	end
	return tmp
end

MATLAB

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 (lambda2 <= 0.205)
		tmp = R * acos((cos(lambda1) + (phi1 * phi2)));
	else
		tmp = R * acos((cos(lambda2) + (phi1 * phi2)));
	end
	tmp_2 = tmp;
end

Wolfram

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[lambda2, 0.205], N[(R * N[ArcCos[N[(N[Cos[lambda1], $MachinePrecision] + N[(phi1 * phi2), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[Cos[lambda2], $MachinePrecision] + N[(phi1 * phi2), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if lambda2 < 0.204999999999999988

   1. Initial program 80.7%

      \[\cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right) \cdot R \]

   3. Simplified 80.6%

      \[\leadsto \color{blue}{\cos^{-1} \left(\mathsf{fma}\left(\cos \phi_1, \cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right), \sin \phi_1 \cdot \sin \phi_2\right)\right) \cdot R} \]
   4. Add Preprocessing

   5. Taylor expanded in phi1 around 0 38.8%

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

   6. Taylor expanded in phi2 around 0 19.2%

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

   7. Taylor expanded in phi2 around 0 16.8%

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

   8. Taylor expanded in lambda2 around 0 13.3%

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

   if 0.204999999999999988 < lambda2

   1. Initial program 58.2%

      \[\cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right) \cdot R \]

   3. Simplified 58.2%

      \[\leadsto \color{blue}{\cos^{-1} \left(\mathsf{fma}\left(\cos \phi_1, \cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right), \sin \phi_1 \cdot \sin \phi_2\right)\right) \cdot R} \]
   4. Add Preprocessing

   5. Taylor expanded in phi1 around 0 29.0%

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

   6. Taylor expanded in phi2 around 0 22.5%

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

   7. Taylor expanded in phi2 around 0 20.8%

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

   8. Taylor expanded in lambda1 around 0 21.2%

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

      1. cos-neg 29.3%

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

   10. Simplified 21.2%

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

4. Final simplification 15.2%

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

Alternative 29: 18.2% accurate, 2.9× speedup

Math

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

FPCore

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 (acos (+ (cos (- lambda1 lambda2)) (* phi1 phi2)))))

C

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

Fortran

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 * acos((cos((lambda1 - lambda2)) + (phi1 * phi2)))
end function

Java

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 * Math.acos((Math.cos((lambda1 - lambda2)) + (phi1 * phi2)));
}

Python

[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2])
def code(R, lambda1, lambda2, phi1, phi2):
	return R * math.acos((math.cos((lambda1 - lambda2)) + (phi1 * phi2)))

Julia

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

MATLAB

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

Wolfram

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 * N[ArcCos[N[(N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision] + N[(phi1 * phi2), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 75.2%

   \[\cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right) \cdot R \]

3. Simplified 75.2%

   \[\leadsto \color{blue}{\cos^{-1} \left(\mathsf{fma}\left(\cos \phi_1, \cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right), \sin \phi_1 \cdot \sin \phi_2\right)\right) \cdot R} \]
4. Add Preprocessing

5. Taylor expanded in phi1 around 0 36.5%

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

6. Taylor expanded in phi2 around 0 20.0%

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

7. Taylor expanded in phi2 around 0 17.8%

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

8. Final simplification 17.8%

   \[\leadsto R \cdot \cos^{-1} \left(\cos \left(\lambda_1 - \lambda_2\right) + \phi_1 \cdot \phi_2\right) \]
9. Add Preprocessing

Alternative 30: 11.3% accurate, 3.0× speedup

Math

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

FPCore

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 (acos (+ (cos lambda1) (* phi1 phi2)))))

C

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

Fortran

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 * acos((cos(lambda1) + (phi1 * phi2)))
end function

Java

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 * Math.acos((Math.cos(lambda1) + (phi1 * phi2)));
}

Python

[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2])
def code(R, lambda1, lambda2, phi1, phi2):
	return R * math.acos((math.cos(lambda1) + (phi1 * phi2)))

Julia

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

MATLAB

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

Wolfram

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 * N[ArcCos[N[(N[Cos[lambda1], $MachinePrecision] + N[(phi1 * phi2), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 75.2%

   \[\cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right) \cdot R \]

3. Simplified 75.2%

   \[\leadsto \color{blue}{\cos^{-1} \left(\mathsf{fma}\left(\cos \phi_1, \cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right), \sin \phi_1 \cdot \sin \phi_2\right)\right) \cdot R} \]
4. Add Preprocessing

5. Taylor expanded in phi1 around 0 36.5%

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

6. Taylor expanded in phi2 around 0 20.0%

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

7. Taylor expanded in phi2 around 0 17.8%

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

8. Taylor expanded in lambda2 around 0 11.6%

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

9. Final simplification 11.6%

   \[\leadsto R \cdot \cos^{-1} \left(\cos \lambda_1 + \phi_1 \cdot \phi_2\right) \]
10. Add Preprocessing

Reproduce

herbie shell --seed 2024151 
(FPCore (R lambda1 lambda2 phi1 phi2)
  :name "Spherical law of cosines"
  :precision binary64
  (* (acos (+ (* (sin phi1) (sin phi2)) (* (* (cos phi1) (cos phi2)) (cos (- lambda1 lambda2))))) R))