Spherical law of cosines

Percentage Accurate: 74.1% → 96.5%

Time: 28.5s

Alternatives: 25

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: 74.1% 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: 96.5% accurate, 0.4× 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 \phi_1 \cdot \cos \phi_2\\ \mathbf{if}\;\cos^{-1} \left(t\_0 + t\_1 \cdot \cos \left(\lambda_1 - \lambda_2\right)\right) \leq 5 \cdot 10^{-5}:\\ \;\;\;\;\left(\lambda_2 - \lambda_1\right) \cdot R\\ \mathbf{else}:\\ \;\;\;\;R \cdot \cos^{-1} \left(t\_0 + t\_1 \cdot \mathsf{fma}\left(\cos \lambda_2, \cos \lambda_1, \sin \lambda_1 \cdot \sin \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))) (t_1 (* (cos phi1) (cos phi2))))
   (if (<= (acos (+ t_0 (* t_1 (cos (- lambda1 lambda2))))) 5e-5)
     (* (- lambda2 lambda1) R)
     (*
      R
      (acos
       (+
        t_0
        (*
         t_1
         (fma
          (cos lambda2)
          (cos lambda1)
          (* (sin lambda1) (sin 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 t_1 = cos(phi1) * cos(phi2);
	double tmp;
	if (acos((t_0 + (t_1 * cos((lambda1 - lambda2))))) <= 5e-5) {
		tmp = (lambda2 - lambda1) * R;
	} else {
		tmp = R * acos((t_0 + (t_1 * fma(cos(lambda2), cos(lambda1), (sin(lambda1) * sin(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))
	t_1 = Float64(cos(phi1) * cos(phi2))
	tmp = 0.0
	if (acos(Float64(t_0 + Float64(t_1 * cos(Float64(lambda1 - lambda2))))) <= 5e-5)
		tmp = Float64(Float64(lambda2 - lambda1) * R);
	else
		tmp = Float64(R * acos(Float64(t_0 + Float64(t_1 * fma(cos(lambda2), cos(lambda1), Float64(sin(lambda1) * sin(lambda2)))))));
	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[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[ArcCos[N[(t$95$0 + N[(t$95$1 * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], 5e-5], N[(N[(lambda2 - lambda1), $MachinePrecision] * R), $MachinePrecision], N[(R * N[ArcCos[N[(t$95$0 + N[(t$95$1 * N[(N[Cos[lambda2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision] + N[(N[Sin[lambda1], $MachinePrecision] * N[Sin[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 2 regimes

2. if (acos.f64 (+.f64 (*.f64 (sin.f64 phi1) (sin.f64 phi2)) (*.f64 (*.f64 (cos.f64 phi1) (cos.f64 phi2)) (cos.f64 (-.f64 lambda1 lambda2))))) < 5.00000000000000024e-5

   1. Initial program 26.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 26.7%

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

   5. Taylor expanded in phi2 around 0 26.7%

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

      1. sub-neg 26.7%

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

      2. remove-double-neg 26.7%

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

      3. mul-1-neg 26.7%

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

      4. distribute-neg-in 26.7%

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

      5. +-commutative 26.7%

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

      6. cos-neg 26.7%

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

      7. mul-1-neg 26.7%

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

      8. unsub-neg 26.7%

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

   7. Simplified 26.7%

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

   8. Taylor expanded in phi1 around 0 26.7%

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

   9. Taylor expanded in lambda2 around 0 44.6%

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

   if 5.00000000000000024e-5 < (acos.f64 (+.f64 (*.f64 (sin.f64 phi1) (sin.f64 phi2)) (*.f64 (*.f64 (cos.f64 phi1) (cos.f64 phi2)) (cos.f64 (-.f64 lambda1 lambda2)))))

   1. Initial program 78.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. Step-by-step derivation

      1. cos-diff 98.9%

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

   4. Applied egg-rr 98.9%

      \[\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 \]
   5. Step-by-step derivation

      1. cos-neg 98.9%

         \[\leadsto \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \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 98.9%

         \[\leadsto \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \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 98.9%

         \[\leadsto \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \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 98.9%

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

   6. Simplified 98.9%

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

4. Final simplification 96.2%

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

Alternative 2: 96.5% accurate, 0.4× 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}\;\cos^{-1} \left(t\_0 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right) \leq 5 \cdot 10^{-5}:\\ \;\;\;\;\left(\lambda_2 - \lambda_1\right) \cdot R\\ \mathbf{else}:\\ \;\;\;\;R \cdot \cos^{-1} \left(t\_0 + \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} \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 (<=
        (acos (+ t_0 (* (* (cos phi1) (cos phi2)) (cos (- lambda1 lambda2)))))
        5e-5)
     (* (- lambda2 lambda1) R)
     (*
      R
      (acos
       (+
        t_0
        (*
         (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) {
	double t_0 = sin(phi1) * sin(phi2);
	double tmp;
	if (acos((t_0 + ((cos(phi1) * cos(phi2)) * cos((lambda1 - lambda2))))) <= 5e-5) {
		tmp = (lambda2 - lambda1) * R;
	} else {
		tmp = R * acos((t_0 + (cos(phi1) * (cos(phi2) * ((sin(lambda1) * sin(lambda2)) + (cos(lambda2) * 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) :: t_0
    real(8) :: tmp
    t_0 = sin(phi1) * sin(phi2)
    if (acos((t_0 + ((cos(phi1) * cos(phi2)) * cos((lambda1 - lambda2))))) <= 5d-5) then
        tmp = (lambda2 - lambda1) * r
    else
        tmp = r * acos((t_0 + (cos(phi1) * (cos(phi2) * ((sin(lambda1) * sin(lambda2)) + (cos(lambda2) * 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 t_0 = Math.sin(phi1) * Math.sin(phi2);
	double tmp;
	if (Math.acos((t_0 + ((Math.cos(phi1) * Math.cos(phi2)) * Math.cos((lambda1 - lambda2))))) <= 5e-5) {
		tmp = (lambda2 - lambda1) * R;
	} else {
		tmp = R * Math.acos((t_0 + (Math.cos(phi1) * (Math.cos(phi2) * ((Math.sin(lambda1) * Math.sin(lambda2)) + (Math.cos(lambda2) * Math.cos(lambda1)))))));
	}
	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 math.acos((t_0 + ((math.cos(phi1) * math.cos(phi2)) * math.cos((lambda1 - lambda2))))) <= 5e-5:
		tmp = (lambda2 - lambda1) * R
	else:
		tmp = R * math.acos((t_0 + (math.cos(phi1) * (math.cos(phi2) * ((math.sin(lambda1) * math.sin(lambda2)) + (math.cos(lambda2) * math.cos(lambda1)))))))
	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 (acos(Float64(t_0 + Float64(Float64(cos(phi1) * cos(phi2)) * cos(Float64(lambda1 - lambda2))))) <= 5e-5)
		tmp = Float64(Float64(lambda2 - lambda1) * R);
	else
		tmp = Float64(R * acos(Float64(t_0 + Float64(cos(phi1) * Float64(cos(phi2) * Float64(Float64(sin(lambda1) * sin(lambda2)) + Float64(cos(lambda2) * 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)
	t_0 = sin(phi1) * sin(phi2);
	tmp = 0.0;
	if (acos((t_0 + ((cos(phi1) * cos(phi2)) * cos((lambda1 - lambda2))))) <= 5e-5)
		tmp = (lambda2 - lambda1) * R;
	else
		tmp = R * acos((t_0 + (cos(phi1) * (cos(phi2) * ((sin(lambda1) * sin(lambda2)) + (cos(lambda2) * 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_] := Block[{t$95$0 = N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[ArcCos[N[(t$95$0 + N[(N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision] * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], 5e-5], N[(N[(lambda2 - lambda1), $MachinePrecision] * R), $MachinePrecision], N[(R * N[ArcCos[N[(t$95$0 + 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. Split input into 2 regimes

2. if (acos.f64 (+.f64 (*.f64 (sin.f64 phi1) (sin.f64 phi2)) (*.f64 (*.f64 (cos.f64 phi1) (cos.f64 phi2)) (cos.f64 (-.f64 lambda1 lambda2))))) < 5.00000000000000024e-5

   1. Initial program 26.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 26.7%

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

   5. Taylor expanded in phi2 around 0 26.7%

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

      1. sub-neg 26.7%

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

      2. remove-double-neg 26.7%

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

      3. mul-1-neg 26.7%

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

      4. distribute-neg-in 26.7%

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

      5. +-commutative 26.7%

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

      6. cos-neg 26.7%

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

      7. mul-1-neg 26.7%

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

      8. unsub-neg 26.7%

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

   7. Simplified 26.7%

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

   8. Taylor expanded in phi1 around 0 26.7%

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

   9. Taylor expanded in lambda2 around 0 44.6%

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

   if 5.00000000000000024e-5 < (acos.f64 (+.f64 (*.f64 (sin.f64 phi1) (sin.f64 phi2)) (*.f64 (*.f64 (cos.f64 phi1) (cos.f64 phi2)) (cos.f64 (-.f64 lambda1 lambda2)))))

   1. Initial program 78.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. Step-by-step derivation

      1. cos-diff 98.9%

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

   4. Applied egg-rr 98.9%

      \[\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 \]
   5. Step-by-step derivation

      1. cos-neg 98.9%

         \[\leadsto \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \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 98.9%

         \[\leadsto \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \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 98.9%

         \[\leadsto \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \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 98.9%

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

   6. Simplified 98.9%

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

   7. Taylor expanded in phi1 around 0 98.9%

      \[\leadsto \color{blue}{\cos^{-1} \left(\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) + \sin \phi_1 \cdot \sin \phi_2\right)} \cdot R \]
3. Recombined 2 regimes into one program.

4. Final simplification 96.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\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) \leq 5 \cdot 10^{-5}:\\ \;\;\;\;\left(\lambda_2 - \lambda_1\right) \cdot R\\ \mathbf{else}:\\ \;\;\;\;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} \]
5. Add Preprocessing

Alternative 3: 83.9% 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 := \sin \phi_1 \cdot \sin \phi_2\\ \mathbf{if}\;\phi_1 \leq -0.14:\\ \;\;\;\;R \cdot \cos^{-1} \left(\mathsf{fma}\left(\cos \phi_1, \cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right), t\_0\right)\right)\\ \mathbf{elif}\;\phi_1 \leq 5.2 \cdot 10^{-21}:\\ \;\;\;\;R \cdot \cos^{-1} \left(\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) + \phi_1 \cdot \sin \phi_2\right)\\ \mathbf{else}:\\ \;\;\;\;R \cdot \left(\pi \cdot 0.5 - \sin^{-1} \left(t\_0 + \cos \phi_1 \cdot \left(\cos \phi_2 \cdot \cos \left(\lambda_2 - \lambda_1\right)\right)\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 (<= phi1 -0.14)
     (* R (acos (fma (cos phi1) (* (cos phi2) (cos (- lambda1 lambda2))) t_0)))
     (if (<= phi1 5.2e-21)
       (*
        R
        (acos
         (+
          (*
           (cos phi1)
           (*
            (cos phi2)
            (+
             (* (sin lambda1) (sin lambda2))
             (* (cos lambda2) (cos lambda1)))))
          (* phi1 (sin phi2)))))
       (*
        R
        (-
         (* PI 0.5)
         (asin
          (+
           t_0
           (* (cos phi1) (* (cos phi2) (cos (- lambda2 lambda1))))))))))))

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 (phi1 <= -0.14) {
		tmp = R * acos(fma(cos(phi1), (cos(phi2) * cos((lambda1 - lambda2))), t_0));
	} else if (phi1 <= 5.2e-21) {
		tmp = R * acos(((cos(phi1) * (cos(phi2) * ((sin(lambda1) * sin(lambda2)) + (cos(lambda2) * cos(lambda1))))) + (phi1 * sin(phi2))));
	} else {
		tmp = R * ((((double) M_PI) * 0.5) - asin((t_0 + (cos(phi1) * (cos(phi2) * cos((lambda2 - lambda1)))))));
	}
	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 (phi1 <= -0.14)
		tmp = Float64(R * acos(fma(cos(phi1), Float64(cos(phi2) * cos(Float64(lambda1 - lambda2))), t_0)));
	elseif (phi1 <= 5.2e-21)
		tmp = Float64(R * acos(Float64(Float64(cos(phi1) * Float64(cos(phi2) * Float64(Float64(sin(lambda1) * sin(lambda2)) + Float64(cos(lambda2) * cos(lambda1))))) + Float64(phi1 * sin(phi2)))));
	else
		tmp = Float64(R * Float64(Float64(pi * 0.5) - asin(Float64(t_0 + Float64(cos(phi1) * Float64(cos(phi2) * cos(Float64(lambda2 - lambda1))))))));
	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[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[phi1, -0.14], N[(R * N[ArcCos[N[(N[Cos[phi1], $MachinePrecision] * N[(N[Cos[phi2], $MachinePrecision] * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] + t$95$0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[phi1, 5.2e-21], N[(R * N[ArcCos[N[(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] + N[(phi1 * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[(N[(Pi * 0.5), $MachinePrecision] - N[ArcSin[N[(t$95$0 + N[(N[Cos[phi1], $MachinePrecision] * N[(N[Cos[phi2], $MachinePrecision] * N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if phi1 < -0.14000000000000001

   1. Initial program 79.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 \]

   3. Simplified 79.9%

      \[\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

   if -0.14000000000000001 < phi1 < 5.20000000000000035e-21

   1. Initial program 68.6%

      \[\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 90.3%

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

   4. Applied egg-rr 90.3%

      \[\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 \]
   5. Step-by-step derivation

      1. cos-neg 90.3%

         \[\leadsto \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \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 90.3%

         \[\leadsto \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \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 90.3%

         \[\leadsto \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \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 90.3%

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

   6. Simplified 90.3%

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

   7. Taylor expanded in phi1 around 0 90.3%

      \[\leadsto \color{blue}{\cos^{-1} \left(\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) + \sin \phi_1 \cdot \sin \phi_2\right)} \cdot R \]

   8. Taylor expanded in phi1 around 0 90.3%

      \[\leadsto \cos^{-1} \left(\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) + \color{blue}{\phi_1 \cdot \sin \phi_2}\right) \cdot R \]

   if 5.20000000000000035e-21 < phi1

   1. Initial program 82.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. acos-asin 82.3%

         \[\leadsto \color{blue}{\left(\frac{\pi}{2} - \sin^{-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)\right)} \cdot R \]

      2. sub-neg 82.3%

         \[\leadsto \color{blue}{\left(\frac{\pi}{2} + \left(-\sin^{-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)\right)\right)} \cdot R \]

      3. div-inv 82.3%

         \[\leadsto \left(\color{blue}{\pi \cdot \frac{1}{2}} + \left(-\sin^{-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)\right)\right) \cdot R \]

      4. metadata-eval 82.3%

         \[\leadsto \left(\pi \cdot \color{blue}{0.5} + \left(-\sin^{-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)\right)\right) \cdot R \]

      5. +-commutative 82.3%

         \[\leadsto \left(\pi \cdot 0.5 + \left(-\sin^{-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)}\right)\right) \cdot R \]

      6. *-commutative 82.3%

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

      7. fma-define 82.4%

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

   4. Applied egg-rr 82.4%

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

      1. sub-neg 82.4%

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

      2. fma-define 82.3%

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

      3. *-commutative 82.3%

         \[\leadsto \left(\pi \cdot 0.5 - \sin^{-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)\right) \cdot R \]

      4. associate-*r* 82.3%

         \[\leadsto \left(\pi \cdot 0.5 - \sin^{-1} \left(\color{blue}{\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)\right) \cdot R \]

      5. fma-define 82.4%

         \[\leadsto \left(\pi \cdot 0.5 - \sin^{-1} \color{blue}{\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)}\right) \cdot R \]

   6. Simplified 82.4%

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

   7. Taylor expanded in phi1 around 0 82.3%

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

4. Final simplification 85.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\phi_1 \leq -0.14:\\ \;\;\;\;R \cdot \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)\\ \mathbf{elif}\;\phi_1 \leq 5.2 \cdot 10^{-21}:\\ \;\;\;\;R \cdot \cos^{-1} \left(\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) + \phi_1 \cdot \sin \phi_2\right)\\ \mathbf{else}:\\ \;\;\;\;R \cdot \left(\pi \cdot 0.5 - \sin^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \cos \phi_1 \cdot \left(\cos \phi_2 \cdot \cos \left(\lambda_2 - \lambda_1\right)\right)\right)\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 83.7% 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 := \sin \phi_1 \cdot \sin \phi_2\\ \mathbf{if}\;\phi_2 \leq -5.8 \cdot 10^{-12}:\\ \;\;\;\;R \cdot \cos^{-1} \left(\mathsf{fma}\left(\cos \phi_1, \cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right), t\_0\right)\right)\\ \mathbf{elif}\;\phi_2 \leq 2.4 \cdot 10^{-9}:\\ \;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_1 \cdot \mathsf{fma}\left(\cos \lambda_2, \cos \lambda_1, \sin \lambda_1 \cdot \sin \lambda_2\right)\right)\\ \mathbf{else}:\\ \;\;\;\;R \cdot \left(\pi \cdot 0.5 + \left(\cos^{-1} \left(\mathsf{fma}\left(\cos \phi_1 \cdot \cos \phi_2, \cos \left(\lambda_2 - \lambda_1\right), t\_0\right)\right) - \frac{\pi}{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 (<= phi2 -5.8e-12)
     (* R (acos (fma (cos phi1) (* (cos phi2) (cos (- lambda1 lambda2))) t_0)))
     (if (<= phi2 2.4e-9)
       (*
        R
        (acos
         (*
          (cos phi1)
          (fma (cos lambda2) (cos lambda1) (* (sin lambda1) (sin lambda2))))))
       (*
        R
        (+
         (* PI 0.5)
         (-
          (acos (fma (* (cos phi1) (cos phi2)) (cos (- lambda2 lambda1)) t_0))
          (/ PI 2.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 = sin(phi1) * sin(phi2);
	double tmp;
	if (phi2 <= -5.8e-12) {
		tmp = R * acos(fma(cos(phi1), (cos(phi2) * cos((lambda1 - lambda2))), t_0));
	} else if (phi2 <= 2.4e-9) {
		tmp = R * acos((cos(phi1) * fma(cos(lambda2), cos(lambda1), (sin(lambda1) * sin(lambda2)))));
	} else {
		tmp = R * ((((double) M_PI) * 0.5) + (acos(fma((cos(phi1) * cos(phi2)), cos((lambda2 - lambda1)), t_0)) - (((double) M_PI) / 2.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(sin(phi1) * sin(phi2))
	tmp = 0.0
	if (phi2 <= -5.8e-12)
		tmp = Float64(R * acos(fma(cos(phi1), Float64(cos(phi2) * cos(Float64(lambda1 - lambda2))), t_0)));
	elseif (phi2 <= 2.4e-9)
		tmp = Float64(R * acos(Float64(cos(phi1) * fma(cos(lambda2), cos(lambda1), Float64(sin(lambda1) * sin(lambda2))))));
	else
		tmp = Float64(R * Float64(Float64(pi * 0.5) + Float64(acos(fma(Float64(cos(phi1) * cos(phi2)), cos(Float64(lambda2 - lambda1)), t_0)) - Float64(pi / 2.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[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[phi2, -5.8e-12], N[(R * N[ArcCos[N[(N[Cos[phi1], $MachinePrecision] * N[(N[Cos[phi2], $MachinePrecision] * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] + t$95$0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[phi2, 2.4e-9], N[(R * N[ArcCos[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], N[(R * N[(N[(Pi * 0.5), $MachinePrecision] + N[(N[ArcCos[N[(N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision] * N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision] + t$95$0), $MachinePrecision]], $MachinePrecision] - N[(Pi / 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if phi2 < -5.8000000000000003e-12

   1. Initial program 82.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 82.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

   if -5.8000000000000003e-12 < phi2 < 2.4e-9

   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(\sin \phi_1, \sin \phi_2, \cos \phi_1 \cdot \left(\cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right)\right)\right)\right) \cdot R} \]
   4. Add Preprocessing

   5. Taylor expanded in phi2 around 0 72.3%

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

      1. sub-neg 72.3%

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

      2. remove-double-neg 72.3%

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

      3. mul-1-neg 72.3%

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

      4. distribute-neg-in 72.3%

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

      5. +-commutative 72.3%

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

      6. cos-neg 72.3%

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

      7. mul-1-neg 72.3%

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

      8. unsub-neg 72.3%

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

   7. Simplified 72.3%

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

      1. cos-diff 91.6%

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

      2. *-commutative 91.6%

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

   9. Applied egg-rr 91.6%

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

       1. fma-define 91.6%

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

   11. Simplified 91.6%

       \[\leadsto \cos^{-1} \left(\cos \phi_1 \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.4e-9 < phi2

   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 \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. acos-asin 75.4%

         \[\leadsto \color{blue}{\left(\frac{\pi}{2} - \sin^{-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)\right)} \cdot R \]

      2. sub-neg 75.4%

         \[\leadsto \color{blue}{\left(\frac{\pi}{2} + \left(-\sin^{-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)\right)\right)} \cdot R \]

      3. div-inv 75.4%

         \[\leadsto \left(\color{blue}{\pi \cdot \frac{1}{2}} + \left(-\sin^{-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)\right)\right) \cdot R \]

      4. metadata-eval 75.4%

         \[\leadsto \left(\pi \cdot \color{blue}{0.5} + \left(-\sin^{-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)\right)\right) \cdot R \]

      5. +-commutative 75.4%

         \[\leadsto \left(\pi \cdot 0.5 + \left(-\sin^{-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)}\right)\right) \cdot R \]

      6. *-commutative 75.4%

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

      7. fma-define 75.4%

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

   4. Applied egg-rr 75.4%

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

      1. sub-neg 75.4%

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

      2. fma-define 75.4%

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

      3. *-commutative 75.4%

         \[\leadsto \left(\pi \cdot 0.5 - \sin^{-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)\right) \cdot R \]

      4. associate-*r* 75.4%

         \[\leadsto \left(\pi \cdot 0.5 - \sin^{-1} \left(\color{blue}{\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)\right) \cdot R \]

      5. fma-define 75.3%

         \[\leadsto \left(\pi \cdot 0.5 - \sin^{-1} \color{blue}{\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)}\right) \cdot R \]

   6. Simplified 75.3%

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

      1. asin-acos 75.6%

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

      2. fma-undefine 75.6%

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

      3. cos-diff 99.1%

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

      4. *-commutative 99.1%

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

      5. fma-undefine 99.1%

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

      6. associate-*l* 99.1%

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

      7. fma-undefine 99.1%

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

      8. *-commutative 99.1%

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

      9. cos-diff 75.6%

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

      10. fma-define 75.6%

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

   8. Applied egg-rr 75.6%

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

4. Final simplification 85.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\phi_2 \leq -5.8 \cdot 10^{-12}:\\ \;\;\;\;R \cdot \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)\\ \mathbf{elif}\;\phi_2 \leq 2.4 \cdot 10^{-9}:\\ \;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_1 \cdot \mathsf{fma}\left(\cos \lambda_2, \cos \lambda_1, \sin \lambda_1 \cdot \sin \lambda_2\right)\right)\\ \mathbf{else}:\\ \;\;\;\;R \cdot \left(\pi \cdot 0.5 + \left(\cos^{-1} \left(\mathsf{fma}\left(\cos \phi_1 \cdot \cos \phi_2, \cos \left(\lambda_2 - \lambda_1\right), \sin \phi_1 \cdot \sin \phi_2\right)\right) - \frac{\pi}{2}\right)\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 83.0% accurate, 0.9× 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 -1 \cdot 10^{-8} \lor \neg \left(\phi_2 \leq 1.15 \cdot 10^{-53}\right):\\ \;\;\;\;R \cdot \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)\\ \mathbf{else}:\\ \;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_1 \cdot \mathsf{fma}\left(\cos \lambda_2, \cos \lambda_1, \sin \lambda_1 \cdot \sin \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 (or (<= phi2 -1e-8) (not (<= phi2 1.15e-53)))
   (*
    R
    (acos
     (fma
      (cos phi1)
      (* (cos phi2) (cos (- lambda1 lambda2)))
      (* (sin phi1) (sin phi2)))))
   (*
    R
    (acos
     (*
      (cos phi1)
      (fma (cos lambda2) (cos lambda1) (* (sin lambda1) (sin 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 ((phi2 <= -1e-8) || !(phi2 <= 1.15e-53)) {
		tmp = R * acos(fma(cos(phi1), (cos(phi2) * cos((lambda1 - lambda2))), (sin(phi1) * sin(phi2))));
	} else {
		tmp = R * acos((cos(phi1) * fma(cos(lambda2), cos(lambda1), (sin(lambda1) * sin(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 ((phi2 <= -1e-8) || !(phi2 <= 1.15e-53))
		tmp = Float64(R * acos(fma(cos(phi1), Float64(cos(phi2) * cos(Float64(lambda1 - lambda2))), Float64(sin(phi1) * sin(phi2)))));
	else
		tmp = Float64(R * acos(Float64(cos(phi1) * fma(cos(lambda2), cos(lambda1), Float64(sin(lambda1) * sin(lambda2))))));
	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_] := If[Or[LessEqual[phi2, -1e-8], N[Not[LessEqual[phi2, 1.15e-53]], $MachinePrecision]], N[(R * N[ArcCos[N[(N[Cos[phi1], $MachinePrecision] * N[(N[Cos[phi2], $MachinePrecision] * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] + N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[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]]

Derivation

1. Split input into 2 regimes

2. if phi2 < -1e-8 or 1.1500000000000001e-53 < phi2

   1. Initial program 79.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 79.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

   if -1e-8 < phi2 < 1.1500000000000001e-53

   1. Initial program 71.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 \]

   3. Simplified 71.9%

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

   5. Taylor expanded in phi2 around 0 71.9%

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

      1. sub-neg 71.9%

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

      2. remove-double-neg 71.9%

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

      3. mul-1-neg 71.9%

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

      4. distribute-neg-in 71.9%

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

      5. +-commutative 71.9%

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

      6. cos-neg 71.9%

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

      7. mul-1-neg 71.9%

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

      8. unsub-neg 71.9%

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

   7. Simplified 71.9%

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

      1. cos-diff 92.7%

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

      2. *-commutative 92.7%

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

   9. Applied egg-rr 92.7%

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

       1. fma-define 92.7%

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

   11. Simplified 92.7%

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

4. Final simplification 85.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\phi_2 \leq -1 \cdot 10^{-8} \lor \neg \left(\phi_2 \leq 1.15 \cdot 10^{-53}\right):\\ \;\;\;\;R \cdot \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)\\ \mathbf{else}:\\ \;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_1 \cdot \mathsf{fma}\left(\cos \lambda_2, \cos \lambda_1, \sin \lambda_1 \cdot \sin \lambda_2\right)\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 82.9% accurate, 0.9× speedup

Math

\[\begin{array}{l} [R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\ \\ \begin{array}{l} t_0 := \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\\ t_1 := \sin \phi_1 \cdot \sin \phi_2\\ \mathbf{if}\;\phi_2 \leq -1.85 \cdot 10^{-7}:\\ \;\;\;\;\cos^{-1} \left(t\_1 + t\_0\right) \cdot R\\ \mathbf{elif}\;\phi_2 \leq 1.15 \cdot 10^{-53}:\\ \;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_1 \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\_0 + \left(\left(t\_1 + 1\right) + -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 phi1) (cos phi2)) (cos (- lambda1 lambda2))))
        (t_1 (* (sin phi1) (sin phi2))))
   (if (<= phi2 -1.85e-7)
     (* (acos (+ t_1 t_0)) R)
     (if (<= phi2 1.15e-53)
       (*
        R
        (acos
         (*
          (cos phi1)
          (fma (cos lambda2) (cos lambda1) (* (sin lambda1) (sin lambda2))))))
       (* R (acos (+ t_0 (+ (+ t_1 1.0) -1.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(phi1) * cos(phi2)) * cos((lambda1 - lambda2));
	double t_1 = sin(phi1) * sin(phi2);
	double tmp;
	if (phi2 <= -1.85e-7) {
		tmp = acos((t_1 + t_0)) * R;
	} else if (phi2 <= 1.15e-53) {
		tmp = R * acos((cos(phi1) * fma(cos(lambda2), cos(lambda1), (sin(lambda1) * sin(lambda2)))));
	} else {
		tmp = R * acos((t_0 + ((t_1 + 1.0) + -1.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(Float64(cos(phi1) * cos(phi2)) * cos(Float64(lambda1 - lambda2)))
	t_1 = Float64(sin(phi1) * sin(phi2))
	tmp = 0.0
	if (phi2 <= -1.85e-7)
		tmp = Float64(acos(Float64(t_1 + t_0)) * R);
	elseif (phi2 <= 1.15e-53)
		tmp = Float64(R * acos(Float64(cos(phi1) * fma(cos(lambda2), cos(lambda1), Float64(sin(lambda1) * sin(lambda2))))));
	else
		tmp = Float64(R * acos(Float64(t_0 + Float64(Float64(t_1 + 1.0) + -1.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[(N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision] * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[phi2, -1.85e-7], N[(N[ArcCos[N[(t$95$1 + t$95$0), $MachinePrecision]], $MachinePrecision] * R), $MachinePrecision], If[LessEqual[phi2, 1.15e-53], N[(R * N[ArcCos[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], N[(R * N[ArcCos[N[(t$95$0 + N[(N[(t$95$1 + 1.0), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]]

Derivation

1. Split input into 3 regimes

2. if phi2 < -1.85000000000000002e-7

   1. Initial program 83.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

   if -1.85000000000000002e-7 < phi2 < 1.1500000000000001e-53

   1. Initial program 71.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 71.4%

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

   5. Taylor expanded in phi2 around 0 71.4%

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

      1. sub-neg 71.4%

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

      2. remove-double-neg 71.4%

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

      3. mul-1-neg 71.4%

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

      4. distribute-neg-in 71.4%

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

      5. +-commutative 71.4%

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

      6. cos-neg 71.4%

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

      7. mul-1-neg 71.4%

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

      8. unsub-neg 71.4%

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

   7. Simplified 71.4%

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

      1. cos-diff 92.7%

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

      2. *-commutative 92.7%

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

   9. Applied egg-rr 92.7%

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

       1. fma-define 92.7%

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

   11. Simplified 92.7%

       \[\leadsto \cos^{-1} \left(\cos \phi_1 \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.1500000000000001e-53 < phi2

   1. Initial program 75.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. Step-by-step derivation

      1. expm1-log1p-u 75.8%

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

      2. expm1-undefine 75.8%

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

   4. Applied egg-rr 75.8%

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

      1. sub-neg 75.8%

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

      2. log1p-undefine 75.8%

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

      3. rem-exp-log 75.8%

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

      4. metadata-eval 75.8%

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

   6. Applied egg-rr 75.8%

      \[\leadsto \cos^{-1} \left(\color{blue}{\left(\left(1 + \sin \phi_1 \cdot \sin \phi_2\right) + -1\right)} + \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.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\phi_2 \leq -1.85 \cdot 10^{-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\\ \mathbf{elif}\;\phi_2 \leq 1.15 \cdot 10^{-53}:\\ \;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_1 \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(\left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right) + \left(\left(\sin \phi_1 \cdot \sin \phi_2 + 1\right) + -1\right)\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 82.9% 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 := \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\\ t_1 := \sin \phi_1 \cdot \sin \phi_2\\ \mathbf{if}\;\phi_2 \leq -4 \cdot 10^{-10}:\\ \;\;\;\;\cos^{-1} \left(t\_1 + t\_0\right) \cdot R\\ \mathbf{elif}\;\phi_2 \leq 1.15 \cdot 10^{-53}:\\ \;\;\;\;R \cdot \cos^{-1} \left(\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(t\_0 + \left(\left(t\_1 + 1\right) + -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 phi1) (cos phi2)) (cos (- lambda1 lambda2))))
        (t_1 (* (sin phi1) (sin phi2))))
   (if (<= phi2 -4e-10)
     (* (acos (+ t_1 t_0)) R)
     (if (<= phi2 1.15e-53)
       (*
        R
        (acos
         (*
          (cos phi1)
          (+
           (* (sin lambda1) (sin lambda2))
           (* (cos lambda2) (cos lambda1))))))
       (* R (acos (+ t_0 (+ (+ t_1 1.0) -1.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(phi1) * cos(phi2)) * cos((lambda1 - lambda2));
	double t_1 = sin(phi1) * sin(phi2);
	double tmp;
	if (phi2 <= -4e-10) {
		tmp = acos((t_1 + t_0)) * R;
	} else if (phi2 <= 1.15e-53) {
		tmp = R * acos((cos(phi1) * ((sin(lambda1) * sin(lambda2)) + (cos(lambda2) * cos(lambda1)))));
	} else {
		tmp = R * acos((t_0 + ((t_1 + 1.0) + -1.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(phi1) * cos(phi2)) * cos((lambda1 - lambda2))
    t_1 = sin(phi1) * sin(phi2)
    if (phi2 <= (-4d-10)) then
        tmp = acos((t_1 + t_0)) * r
    else if (phi2 <= 1.15d-53) then
        tmp = r * acos((cos(phi1) * ((sin(lambda1) * sin(lambda2)) + (cos(lambda2) * cos(lambda1)))))
    else
        tmp = r * acos((t_0 + ((t_1 + 1.0d0) + (-1.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 t_0 = (Math.cos(phi1) * Math.cos(phi2)) * Math.cos((lambda1 - lambda2));
	double t_1 = Math.sin(phi1) * Math.sin(phi2);
	double tmp;
	if (phi2 <= -4e-10) {
		tmp = Math.acos((t_1 + t_0)) * R;
	} else if (phi2 <= 1.15e-53) {
		tmp = R * Math.acos((Math.cos(phi1) * ((Math.sin(lambda1) * Math.sin(lambda2)) + (Math.cos(lambda2) * Math.cos(lambda1)))));
	} else {
		tmp = R * Math.acos((t_0 + ((t_1 + 1.0) + -1.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(phi1) * math.cos(phi2)) * math.cos((lambda1 - lambda2))
	t_1 = math.sin(phi1) * math.sin(phi2)
	tmp = 0
	if phi2 <= -4e-10:
		tmp = math.acos((t_1 + t_0)) * R
	elif phi2 <= 1.15e-53:
		tmp = R * math.acos((math.cos(phi1) * ((math.sin(lambda1) * math.sin(lambda2)) + (math.cos(lambda2) * math.cos(lambda1)))))
	else:
		tmp = R * math.acos((t_0 + ((t_1 + 1.0) + -1.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(Float64(cos(phi1) * cos(phi2)) * cos(Float64(lambda1 - lambda2)))
	t_1 = Float64(sin(phi1) * sin(phi2))
	tmp = 0.0
	if (phi2 <= -4e-10)
		tmp = Float64(acos(Float64(t_1 + t_0)) * R);
	elseif (phi2 <= 1.15e-53)
		tmp = Float64(R * acos(Float64(cos(phi1) * Float64(Float64(sin(lambda1) * sin(lambda2)) + Float64(cos(lambda2) * cos(lambda1))))));
	else
		tmp = Float64(R * acos(Float64(t_0 + Float64(Float64(t_1 + 1.0) + -1.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(phi1) * cos(phi2)) * cos((lambda1 - lambda2));
	t_1 = sin(phi1) * sin(phi2);
	tmp = 0.0;
	if (phi2 <= -4e-10)
		tmp = acos((t_1 + t_0)) * R;
	elseif (phi2 <= 1.15e-53)
		tmp = R * acos((cos(phi1) * ((sin(lambda1) * sin(lambda2)) + (cos(lambda2) * cos(lambda1)))));
	else
		tmp = R * acos((t_0 + ((t_1 + 1.0) + -1.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[(N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision] * N[Cos[N[(lambda1 - lambda2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[phi2, -4e-10], N[(N[ArcCos[N[(t$95$1 + t$95$0), $MachinePrecision]], $MachinePrecision] * R), $MachinePrecision], If[LessEqual[phi2, 1.15e-53], N[(R * N[ArcCos[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], N[(R * N[ArcCos[N[(t$95$0 + N[(N[(t$95$1 + 1.0), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]]

Derivation

1. Split input into 3 regimes

2. if phi2 < -4.00000000000000015e-10

   1. Initial program 82.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

   if -4.00000000000000015e-10 < phi2 < 1.1500000000000001e-53

   1. Initial program 71.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 \]

   3. Simplified 71.9%

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

   5. Taylor expanded in phi2 around 0 71.9%

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

      1. sub-neg 71.9%

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

      2. remove-double-neg 71.9%

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

      3. mul-1-neg 71.9%

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

      4. distribute-neg-in 71.9%

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

      5. +-commutative 71.9%

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

      6. cos-neg 71.9%

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

      7. mul-1-neg 71.9%

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

      8. unsub-neg 71.9%

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

   7. Simplified 71.9%

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

      1. cos-diff 92.7%

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

      2. *-commutative 92.7%

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

   9. Applied egg-rr 92.7%

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

   if 1.1500000000000001e-53 < phi2

   1. Initial program 75.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. Step-by-step derivation

      1. expm1-log1p-u 75.8%

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

      2. expm1-undefine 75.8%

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

   4. Applied egg-rr 75.8%

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

      1. sub-neg 75.8%

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

      2. log1p-undefine 75.8%

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

      3. rem-exp-log 75.8%

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

      4. metadata-eval 75.8%

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

   6. Applied egg-rr 75.8%

      \[\leadsto \cos^{-1} \left(\color{blue}{\left(\left(1 + \sin \phi_1 \cdot \sin \phi_2\right) + -1\right)} + \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.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\phi_2 \leq -4 \cdot 10^{-10}:\\ \;\;\;\;\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\\ \mathbf{elif}\;\phi_2 \leq 1.15 \cdot 10^{-53}:\\ \;\;\;\;R \cdot \cos^{-1} \left(\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(\left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \left(\lambda_1 - \lambda_2\right) + \left(\left(\sin \phi_1 \cdot \sin \phi_2 + 1\right) + -1\right)\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 8: 82.9% accurate, 1.0× 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 -9 \cdot 10^{-7} \lor \neg \left(\phi_2 \leq 1.15 \cdot 10^{-53}\right):\\ \;\;\;\;\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\\ \mathbf{else}:\\ \;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_1 \cdot \left(\sin \lambda_1 \cdot \sin \lambda_2 + \cos \lambda_2 \cdot \cos \lambda_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
 (if (or (<= phi2 -9e-7) (not (<= phi2 1.15e-53)))
   (*
    (acos
     (+
      (* (sin phi1) (sin phi2))
      (* (* (cos phi1) (cos phi2)) (cos (- lambda1 lambda2)))))
    R)
   (*
    R
    (acos
     (*
      (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) {
	double tmp;
	if ((phi2 <= -9e-7) || !(phi2 <= 1.15e-53)) {
		tmp = acos(((sin(phi1) * sin(phi2)) + ((cos(phi1) * cos(phi2)) * cos((lambda1 - lambda2))))) * R;
	} else {
		tmp = R * acos((cos(phi1) * ((sin(lambda1) * sin(lambda2)) + (cos(lambda2) * 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 <= (-9d-7)) .or. (.not. (phi2 <= 1.15d-53))) then
        tmp = acos(((sin(phi1) * sin(phi2)) + ((cos(phi1) * cos(phi2)) * cos((lambda1 - lambda2))))) * r
    else
        tmp = r * acos((cos(phi1) * ((sin(lambda1) * sin(lambda2)) + (cos(lambda2) * 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 <= -9e-7) || !(phi2 <= 1.15e-53)) {
		tmp = Math.acos(((Math.sin(phi1) * Math.sin(phi2)) + ((Math.cos(phi1) * Math.cos(phi2)) * Math.cos((lambda1 - lambda2))))) * R;
	} else {
		tmp = R * Math.acos((Math.cos(phi1) * ((Math.sin(lambda1) * Math.sin(lambda2)) + (Math.cos(lambda2) * 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 <= -9e-7) or not (phi2 <= 1.15e-53):
		tmp = math.acos(((math.sin(phi1) * math.sin(phi2)) + ((math.cos(phi1) * math.cos(phi2)) * math.cos((lambda1 - lambda2))))) * R
	else:
		tmp = R * math.acos((math.cos(phi1) * ((math.sin(lambda1) * math.sin(lambda2)) + (math.cos(lambda2) * 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 <= -9e-7) || !(phi2 <= 1.15e-53))
		tmp = Float64(acos(Float64(Float64(sin(phi1) * sin(phi2)) + Float64(Float64(cos(phi1) * cos(phi2)) * cos(Float64(lambda1 - lambda2))))) * R);
	else
		tmp = Float64(R * acos(Float64(cos(phi1) * Float64(Float64(sin(lambda1) * sin(lambda2)) + Float64(cos(lambda2) * 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 <= -9e-7) || ~((phi2 <= 1.15e-53)))
		tmp = acos(((sin(phi1) * sin(phi2)) + ((cos(phi1) * cos(phi2)) * cos((lambda1 - lambda2))))) * R;
	else
		tmp = R * acos((cos(phi1) * ((sin(lambda1) * sin(lambda2)) + (cos(lambda2) * 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[Or[LessEqual[phi2, -9e-7], N[Not[LessEqual[phi2, 1.15e-53]], $MachinePrecision]], 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], N[(R * N[ArcCos[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]]

Derivation

1. Split input into 2 regimes

2. if phi2 < -8.99999999999999959e-7 or 1.1500000000000001e-53 < phi2

   1. Initial program 79.6%

      \[\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 < phi2 < 1.1500000000000001e-53

   1. Initial program 71.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 71.4%

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

   5. Taylor expanded in phi2 around 0 71.4%

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

      1. sub-neg 71.4%

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

      2. remove-double-neg 71.4%

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

      3. mul-1-neg 71.4%

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

      4. distribute-neg-in 71.4%

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

      5. +-commutative 71.4%

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

      6. cos-neg 71.4%

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

      7. mul-1-neg 71.4%

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

      8. unsub-neg 71.4%

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

   7. Simplified 71.4%

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

      1. cos-diff 92.7%

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

      2. *-commutative 92.7%

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

   9. Applied egg-rr 92.7%

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

4. Final simplification 85.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\phi_2 \leq -9 \cdot 10^{-7} \lor \neg \left(\phi_2 \leq 1.15 \cdot 10^{-53}\right):\\ \;\;\;\;\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\\ \mathbf{else}:\\ \;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_1 \cdot \left(\sin \lambda_1 \cdot \sin \lambda_2 + \cos \lambda_2 \cdot \cos \lambda_1\right)\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 9: 74.5% accurate, 1.0× 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 -1.45 \cdot 10^{-6} \lor \neg \left(\phi_2 \leq 1.28 \cdot 10^{-8}\right):\\ \;\;\;\;R \cdot \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_1 \cdot \cos \phi_2\right) \cdot \cos \lambda_1\right)\\ \mathbf{else}:\\ \;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_1 \cdot \left(\sin \lambda_1 \cdot \sin \lambda_2 + \cos \lambda_2 \cdot \cos \lambda_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
 (if (or (<= phi2 -1.45e-6) (not (<= phi2 1.28e-8)))
   (*
    R
    (acos
     (+
      (* (sin phi1) (sin phi2))
      (* (* (cos phi1) (cos phi2)) (cos lambda1)))))
   (*
    R
    (acos
     (*
      (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) {
	double tmp;
	if ((phi2 <= -1.45e-6) || !(phi2 <= 1.28e-8)) {
		tmp = R * acos(((sin(phi1) * sin(phi2)) + ((cos(phi1) * cos(phi2)) * cos(lambda1))));
	} else {
		tmp = R * acos((cos(phi1) * ((sin(lambda1) * sin(lambda2)) + (cos(lambda2) * 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 <= (-1.45d-6)) .or. (.not. (phi2 <= 1.28d-8))) then
        tmp = r * acos(((sin(phi1) * sin(phi2)) + ((cos(phi1) * cos(phi2)) * cos(lambda1))))
    else
        tmp = r * acos((cos(phi1) * ((sin(lambda1) * sin(lambda2)) + (cos(lambda2) * 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 <= -1.45e-6) || !(phi2 <= 1.28e-8)) {
		tmp = R * Math.acos(((Math.sin(phi1) * Math.sin(phi2)) + ((Math.cos(phi1) * Math.cos(phi2)) * Math.cos(lambda1))));
	} else {
		tmp = R * Math.acos((Math.cos(phi1) * ((Math.sin(lambda1) * Math.sin(lambda2)) + (Math.cos(lambda2) * 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 <= -1.45e-6) or not (phi2 <= 1.28e-8):
		tmp = R * math.acos(((math.sin(phi1) * math.sin(phi2)) + ((math.cos(phi1) * math.cos(phi2)) * math.cos(lambda1))))
	else:
		tmp = R * math.acos((math.cos(phi1) * ((math.sin(lambda1) * math.sin(lambda2)) + (math.cos(lambda2) * 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 <= -1.45e-6) || !(phi2 <= 1.28e-8))
		tmp = Float64(R * acos(Float64(Float64(sin(phi1) * sin(phi2)) + Float64(Float64(cos(phi1) * cos(phi2)) * cos(lambda1)))));
	else
		tmp = Float64(R * acos(Float64(cos(phi1) * Float64(Float64(sin(lambda1) * sin(lambda2)) + Float64(cos(lambda2) * 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 <= -1.45e-6) || ~((phi2 <= 1.28e-8)))
		tmp = R * acos(((sin(phi1) * sin(phi2)) + ((cos(phi1) * cos(phi2)) * cos(lambda1))));
	else
		tmp = R * acos((cos(phi1) * ((sin(lambda1) * sin(lambda2)) + (cos(lambda2) * 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[Or[LessEqual[phi2, -1.45e-6], N[Not[LessEqual[phi2, 1.28e-8]], $MachinePrecision]], N[(R * 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[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[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]]

Derivation

1. Split input into 2 regimes

2. if phi2 < -1.4500000000000001e-6 or 1.28000000000000005e-8 < phi2

   1. Initial program 79.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 57.6%

      \[\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 -1.4500000000000001e-6 < phi2 < 1.28000000000000005e-8

   1. Initial program 71.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 \]

   3. Simplified 71.9%

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

   5. Taylor expanded in phi2 around 0 71.9%

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

      1. sub-neg 71.9%

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

      2. remove-double-neg 71.9%

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

      3. mul-1-neg 71.9%

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

      4. distribute-neg-in 71.9%

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

      5. +-commutative 71.9%

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

      6. cos-neg 71.9%

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

      7. mul-1-neg 71.9%

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

      8. unsub-neg 71.9%

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

   7. Simplified 71.9%

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

      1. cos-diff 91.6%

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

      2. *-commutative 91.6%

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

   9. Applied egg-rr 91.6%

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

4. Final simplification 74.8%

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

Alternative 10: 76.4% 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 := \cos \phi_1 \cdot \cos \phi_2\\ t_1 := \sin \phi_1 \cdot \sin \phi_2\\ \mathbf{if}\;\lambda_1 \leq -7.5 \cdot 10^{-6}:\\ \;\;\;\;R \cdot \cos^{-1} \left(t\_1 + t\_0 \cdot \cos \lambda_1\right)\\ \mathbf{elif}\;\lambda_1 \leq 8.2 \cdot 10^{-5}:\\ \;\;\;\;R \cdot \cos^{-1} \left(t\_1 + t\_0 \cdot \cos \lambda_2\right)\\ \mathbf{else}:\\ \;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_1 \cdot \left(\sin \lambda_1 \cdot \sin \lambda_2 + \cos \lambda_2 \cdot \cos \lambda_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 phi1) (cos phi2))) (t_1 (* (sin phi1) (sin phi2))))
   (if (<= lambda1 -7.5e-6)
     (* R (acos (+ t_1 (* t_0 (cos lambda1)))))
     (if (<= lambda1 8.2e-5)
       (* R (acos (+ t_1 (* t_0 (cos lambda2)))))
       (*
        R
        (acos
         (*
          (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) {
	double t_0 = cos(phi1) * cos(phi2);
	double t_1 = sin(phi1) * sin(phi2);
	double tmp;
	if (lambda1 <= -7.5e-6) {
		tmp = R * acos((t_1 + (t_0 * cos(lambda1))));
	} else if (lambda1 <= 8.2e-5) {
		tmp = R * acos((t_1 + (t_0 * cos(lambda2))));
	} else {
		tmp = R * acos((cos(phi1) * ((sin(lambda1) * sin(lambda2)) + (cos(lambda2) * 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) :: t_0
    real(8) :: t_1
    real(8) :: tmp
    t_0 = cos(phi1) * cos(phi2)
    t_1 = sin(phi1) * sin(phi2)
    if (lambda1 <= (-7.5d-6)) then
        tmp = r * acos((t_1 + (t_0 * cos(lambda1))))
    else if (lambda1 <= 8.2d-5) then
        tmp = r * acos((t_1 + (t_0 * cos(lambda2))))
    else
        tmp = r * acos((cos(phi1) * ((sin(lambda1) * sin(lambda2)) + (cos(lambda2) * 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 t_0 = Math.cos(phi1) * Math.cos(phi2);
	double t_1 = Math.sin(phi1) * Math.sin(phi2);
	double tmp;
	if (lambda1 <= -7.5e-6) {
		tmp = R * Math.acos((t_1 + (t_0 * Math.cos(lambda1))));
	} else if (lambda1 <= 8.2e-5) {
		tmp = R * Math.acos((t_1 + (t_0 * Math.cos(lambda2))));
	} else {
		tmp = R * Math.acos((Math.cos(phi1) * ((Math.sin(lambda1) * Math.sin(lambda2)) + (Math.cos(lambda2) * Math.cos(lambda1)))));
	}
	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(phi1) * math.cos(phi2)
	t_1 = math.sin(phi1) * math.sin(phi2)
	tmp = 0
	if lambda1 <= -7.5e-6:
		tmp = R * math.acos((t_1 + (t_0 * math.cos(lambda1))))
	elif lambda1 <= 8.2e-5:
		tmp = R * math.acos((t_1 + (t_0 * math.cos(lambda2))))
	else:
		tmp = R * math.acos((math.cos(phi1) * ((math.sin(lambda1) * math.sin(lambda2)) + (math.cos(lambda2) * math.cos(lambda1)))))
	return tmp

Julia

R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2])
function code(R, lambda1, lambda2, phi1, phi2)
	t_0 = Float64(cos(phi1) * cos(phi2))
	t_1 = Float64(sin(phi1) * sin(phi2))
	tmp = 0.0
	if (lambda1 <= -7.5e-6)
		tmp = Float64(R * acos(Float64(t_1 + Float64(t_0 * cos(lambda1)))));
	elseif (lambda1 <= 8.2e-5)
		tmp = Float64(R * acos(Float64(t_1 + Float64(t_0 * cos(lambda2)))));
	else
		tmp = Float64(R * acos(Float64(cos(phi1) * Float64(Float64(sin(lambda1) * sin(lambda2)) + Float64(cos(lambda2) * 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)
	t_0 = cos(phi1) * cos(phi2);
	t_1 = sin(phi1) * sin(phi2);
	tmp = 0.0;
	if (lambda1 <= -7.5e-6)
		tmp = R * acos((t_1 + (t_0 * cos(lambda1))));
	elseif (lambda1 <= 8.2e-5)
		tmp = R * acos((t_1 + (t_0 * cos(lambda2))));
	else
		tmp = R * acos((cos(phi1) * ((sin(lambda1) * sin(lambda2)) + (cos(lambda2) * 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_] := Block[{t$95$0 = N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[lambda1, -7.5e-6], N[(R * N[ArcCos[N[(t$95$1 + N[(t$95$0 * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[lambda1, 8.2e-5], N[(R * N[ArcCos[N[(t$95$1 + N[(t$95$0 * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[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]]]]]

Derivation

1. Split input into 3 regimes

2. if lambda1 < -7.50000000000000019e-6

   1. Initial program 64.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 lambda2 around 0 63.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 -7.50000000000000019e-6 < lambda1 < 8.20000000000000009e-5

   1. Initial program 91.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 lambda1 around 0 91.0%

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

      1. cos-neg 91.0%

         \[\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_2}\right) \cdot R \]

   5. Simplified 91.0%

      \[\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_2}\right) \cdot R \]

   if 8.20000000000000009e-5 < lambda1

   1. Initial program 54.6%

      \[\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 54.6%

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

   5. Taylor expanded in phi2 around 0 40.4%

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

      1. sub-neg 40.4%

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

      2. remove-double-neg 40.4%

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

      3. mul-1-neg 40.4%

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

      4. distribute-neg-in 40.4%

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

      5. +-commutative 40.4%

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

      6. cos-neg 40.4%

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

      7. mul-1-neg 40.4%

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

      8. unsub-neg 40.4%

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

   7. Simplified 40.4%

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

      1. cos-diff 64.4%

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

      2. *-commutative 64.4%

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

   9. Applied egg-rr 64.4%

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

4. Final simplification 78.0%

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

Alternative 11: 60.3% accurate, 1.0× 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 1.65:\\ \;\;\;\;R \cdot \cos^{-1} \left(\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(\cos \phi_2 \cdot \cos \left(\lambda_2 - \lambda_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
 (if (<= phi2 1.65)
   (*
    R
    (acos
     (*
      (cos phi1)
      (+ (* (sin lambda1) (sin lambda2)) (* (cos lambda2) (cos lambda1))))))
   (* R (acos (* (cos phi2) (cos (- lambda2 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 <= 1.65) {
		tmp = R * acos((cos(phi1) * ((sin(lambda1) * sin(lambda2)) + (cos(lambda2) * cos(lambda1)))));
	} else {
		tmp = R * acos((cos(phi2) * cos((lambda2 - 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 <= 1.65d0) then
        tmp = r * acos((cos(phi1) * ((sin(lambda1) * sin(lambda2)) + (cos(lambda2) * cos(lambda1)))))
    else
        tmp = r * acos((cos(phi2) * cos((lambda2 - 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 <= 1.65) {
		tmp = R * Math.acos((Math.cos(phi1) * ((Math.sin(lambda1) * Math.sin(lambda2)) + (Math.cos(lambda2) * Math.cos(lambda1)))));
	} else {
		tmp = R * Math.acos((Math.cos(phi2) * Math.cos((lambda2 - 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 <= 1.65:
		tmp = R * math.acos((math.cos(phi1) * ((math.sin(lambda1) * math.sin(lambda2)) + (math.cos(lambda2) * math.cos(lambda1)))))
	else:
		tmp = R * math.acos((math.cos(phi2) * math.cos((lambda2 - 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 <= 1.65)
		tmp = Float64(R * acos(Float64(cos(phi1) * Float64(Float64(sin(lambda1) * sin(lambda2)) + Float64(cos(lambda2) * cos(lambda1))))));
	else
		tmp = Float64(R * acos(Float64(cos(phi2) * cos(Float64(lambda2 - 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 <= 1.65)
		tmp = R * acos((cos(phi1) * ((sin(lambda1) * sin(lambda2)) + (cos(lambda2) * cos(lambda1)))));
	else
		tmp = R * acos((cos(phi2) * cos((lambda2 - 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, 1.65], N[(R * N[ArcCos[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], N[(R * N[ArcCos[N[(N[Cos[phi2], $MachinePrecision] * N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if phi2 < 1.6499999999999999

   1. Initial program 75.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 \]

   3. Simplified 75.8%

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

   5. Taylor expanded in phi2 around 0 53.8%

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

      1. sub-neg 53.8%

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

      2. remove-double-neg 53.8%

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

      3. mul-1-neg 53.8%

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

      4. distribute-neg-in 53.8%

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

      5. +-commutative 53.8%

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

      6. cos-neg 53.8%

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

      7. mul-1-neg 53.8%

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

      8. unsub-neg 53.8%

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

   7. Simplified 53.8%

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

      1. cos-diff 66.7%

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

      2. *-commutative 66.7%

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

   9. Applied egg-rr 66.7%

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

   if 1.6499999999999999 < phi2

   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(\sin \phi_1, \sin \phi_2, \cos \phi_1 \cdot \left(\cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right)\right)\right)\right) \cdot R} \]
   4. Add Preprocessing

   5. Taylor expanded in phi1 around 0 50.1%

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

      1. sub-neg 50.1%

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

      2. neg-mul-1 50.1%

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

      3. neg-mul-1 50.1%

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

      4. remove-double-neg 50.1%

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

      5. mul-1-neg 50.1%

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

      6. distribute-neg-in 50.1%

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

      7. +-commutative 50.1%

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

      8. cos-neg 50.1%

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

      9. mul-1-neg 50.1%

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

      10. unsub-neg 50.1%

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

   7. Simplified 50.1%

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

4. Final simplification 63.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\phi_2 \leq 1.65:\\ \;\;\;\;R \cdot \cos^{-1} \left(\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(\cos \phi_2 \cdot \cos \left(\lambda_2 - \lambda_1\right)\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 12: 50.3% 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_2 - \lambda_1\right)\\ \mathbf{if}\;\phi_2 \leq 1.65:\\ \;\;\;\;R \cdot \log \left(e^{\cos^{-1} \left(\cos \phi_1 \cdot t\_0\right)}\right)\\ \mathbf{else}:\\ \;\;\;\;R \cdot \cos^{-1} \left(\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 (- lambda2 lambda1))))
   (if (<= phi2 1.65)
     (* R (log (exp (acos (* (cos phi1) t_0)))))
     (* R (acos (* (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((lambda2 - lambda1));
	double tmp;
	if (phi2 <= 1.65) {
		tmp = R * log(exp(acos((cos(phi1) * t_0))));
	} else {
		tmp = R * acos((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((lambda2 - lambda1))
    if (phi2 <= 1.65d0) then
        tmp = r * log(exp(acos((cos(phi1) * t_0))))
    else
        tmp = r * acos((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((lambda2 - lambda1));
	double tmp;
	if (phi2 <= 1.65) {
		tmp = R * Math.log(Math.exp(Math.acos((Math.cos(phi1) * t_0))));
	} else {
		tmp = R * Math.acos((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((lambda2 - lambda1))
	tmp = 0
	if phi2 <= 1.65:
		tmp = R * math.log(math.exp(math.acos((math.cos(phi1) * t_0))))
	else:
		tmp = R * math.acos((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(lambda2 - lambda1))
	tmp = 0.0
	if (phi2 <= 1.65)
		tmp = Float64(R * log(exp(acos(Float64(cos(phi1) * t_0)))));
	else
		tmp = Float64(R * acos(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((lambda2 - lambda1));
	tmp = 0.0;
	if (phi2 <= 1.65)
		tmp = R * log(exp(acos((cos(phi1) * t_0))));
	else
		tmp = R * acos((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[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[phi2, 1.65], N[(R * N[Log[N[Exp[N[ArcCos[N[(N[Cos[phi1], $MachinePrecision] * t$95$0), $MachinePrecision]], $MachinePrecision]], $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[Cos[phi2], $MachinePrecision] * t$95$0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if phi2 < 1.6499999999999999

   1. Initial program 75.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 \]

   3. Simplified 75.8%

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

   5. Taylor expanded in phi2 around 0 53.8%

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

      1. sub-neg 53.8%

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

      2. remove-double-neg 53.8%

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

      3. mul-1-neg 53.8%

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

      4. distribute-neg-in 53.8%

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

      5. +-commutative 53.8%

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

      6. cos-neg 53.8%

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

      7. mul-1-neg 53.8%

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

      8. unsub-neg 53.8%

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

   7. Simplified 53.8%

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

      1. add-log-exp 53.8%

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

   9. Applied egg-rr 53.8%

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

   if 1.6499999999999999 < phi2

   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(\sin \phi_1, \sin \phi_2, \cos \phi_1 \cdot \left(\cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right)\right)\right)\right) \cdot R} \]
   4. Add Preprocessing

   5. Taylor expanded in phi1 around 0 50.1%

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

      1. sub-neg 50.1%

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

      2. neg-mul-1 50.1%

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

      3. neg-mul-1 50.1%

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

      4. remove-double-neg 50.1%

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

      5. mul-1-neg 50.1%

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

      6. distribute-neg-in 50.1%

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

      7. +-commutative 50.1%

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

      8. cos-neg 50.1%

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

      9. mul-1-neg 50.1%

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

      10. unsub-neg 50.1%

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

   7. Simplified 50.1%

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

4. Final simplification 53.0%

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

Alternative 13: 50.3% accurate, 1.9× 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_2 - \lambda_1\right)\\ \mathbf{if}\;\phi_2 \leq 1.65:\\ \;\;\;\;R \cdot \left(\frac{\pi}{2} - \sin^{-1} \left(\cos \phi_1 \cdot t\_0\right)\right)\\ \mathbf{else}:\\ \;\;\;\;R \cdot \cos^{-1} \left(\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 (- lambda2 lambda1))))
   (if (<= phi2 1.65)
     (* R (- (/ PI 2.0) (asin (* (cos phi1) t_0))))
     (* R (acos (* (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((lambda2 - lambda1));
	double tmp;
	if (phi2 <= 1.65) {
		tmp = R * ((((double) M_PI) / 2.0) - asin((cos(phi1) * t_0)));
	} else {
		tmp = R * acos((cos(phi2) * 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((lambda2 - lambda1));
	double tmp;
	if (phi2 <= 1.65) {
		tmp = R * ((Math.PI / 2.0) - Math.asin((Math.cos(phi1) * t_0)));
	} else {
		tmp = R * Math.acos((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((lambda2 - lambda1))
	tmp = 0
	if phi2 <= 1.65:
		tmp = R * ((math.pi / 2.0) - math.asin((math.cos(phi1) * t_0)))
	else:
		tmp = R * math.acos((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(lambda2 - lambda1))
	tmp = 0.0
	if (phi2 <= 1.65)
		tmp = Float64(R * Float64(Float64(pi / 2.0) - asin(Float64(cos(phi1) * t_0))));
	else
		tmp = Float64(R * acos(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((lambda2 - lambda1));
	tmp = 0.0;
	if (phi2 <= 1.65)
		tmp = R * ((pi / 2.0) - asin((cos(phi1) * t_0)));
	else
		tmp = R * acos((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[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[phi2, 1.65], N[(R * N[(N[(Pi / 2.0), $MachinePrecision] - N[ArcSin[N[(N[Cos[phi1], $MachinePrecision] * t$95$0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[Cos[phi2], $MachinePrecision] * t$95$0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if phi2 < 1.6499999999999999

   1. Initial program 75.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 \]

   3. Simplified 75.8%

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

   5. Taylor expanded in phi2 around 0 53.8%

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

      1. sub-neg 53.8%

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

      2. remove-double-neg 53.8%

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

      3. mul-1-neg 53.8%

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

      4. distribute-neg-in 53.8%

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

      5. +-commutative 53.8%

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

      6. cos-neg 53.8%

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

      7. mul-1-neg 53.8%

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

      8. unsub-neg 53.8%

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

   7. Simplified 53.8%

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

      1. acos-asin 53.8%

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

   9. Applied egg-rr 53.8%

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

   if 1.6499999999999999 < phi2

   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(\sin \phi_1, \sin \phi_2, \cos \phi_1 \cdot \left(\cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right)\right)\right)\right) \cdot R} \]
   4. Add Preprocessing

   5. Taylor expanded in phi1 around 0 50.1%

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

      1. sub-neg 50.1%

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

      2. neg-mul-1 50.1%

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

      3. neg-mul-1 50.1%

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

      4. remove-double-neg 50.1%

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

      5. mul-1-neg 50.1%

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

      6. distribute-neg-in 50.1%

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

      7. +-commutative 50.1%

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

      8. cos-neg 50.1%

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

      9. mul-1-neg 50.1%

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

      10. unsub-neg 50.1%

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

   7. Simplified 50.1%

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

4. Final simplification 53.0%

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

Alternative 14: 48.4% accurate, 2.0× 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 1.65:\\ \;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_1 \cdot \cos \left(\lambda_2 - \lambda_1\right)\right)\\ \mathbf{else}:\\ \;\;\;\;R \cdot \cos^{-1} \left(\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 1.65)
   (* R (acos (* (cos phi1) (cos (- lambda2 lambda1)))))
   (* R (acos (* (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 <= 1.65) {
		tmp = R * acos((cos(phi1) * cos((lambda2 - lambda1))));
	} else {
		tmp = R * acos((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 <= 1.65d0) then
        tmp = r * acos((cos(phi1) * cos((lambda2 - lambda1))))
    else
        tmp = r * acos((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 <= 1.65) {
		tmp = R * Math.acos((Math.cos(phi1) * Math.cos((lambda2 - lambda1))));
	} else {
		tmp = R * Math.acos((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 <= 1.65:
		tmp = R * math.acos((math.cos(phi1) * math.cos((lambda2 - lambda1))))
	else:
		tmp = R * math.acos((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 <= 1.65)
		tmp = Float64(R * acos(Float64(cos(phi1) * cos(Float64(lambda2 - lambda1)))));
	else
		tmp = Float64(R * acos(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 <= 1.65)
		tmp = R * acos((cos(phi1) * cos((lambda2 - lambda1))));
	else
		tmp = R * acos((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, 1.65], N[(R * N[ArcCos[N[(N[Cos[phi1], $MachinePrecision] * N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[Cos[phi2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if phi2 < 1.6499999999999999

   1. Initial program 75.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 \]

   3. Simplified 75.8%

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

   5. Taylor expanded in phi2 around 0 53.8%

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

      1. sub-neg 53.8%

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

      2. remove-double-neg 53.8%

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

      3. mul-1-neg 53.8%

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

      4. distribute-neg-in 53.8%

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

      5. +-commutative 53.8%

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

      6. cos-neg 53.8%

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

      7. mul-1-neg 53.8%

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

      8. unsub-neg 53.8%

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

   7. Simplified 53.8%

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

   if 1.6499999999999999 < phi2

   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 lambda2 around 0 53.4%

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

   6. Taylor expanded in phi1 around 0 38.8%

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

      1. *-commutative 38.8%

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

   8. Simplified 38.8%

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

4. Final simplification 50.5%

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

Alternative 15: 50.3% 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 := \cos \left(\lambda_2 - \lambda_1\right)\\ \mathbf{if}\;\phi_2 \leq 1.65:\\ \;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_1 \cdot t\_0\right)\\ \mathbf{else}:\\ \;\;\;\;R \cdot \cos^{-1} \left(\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 (- lambda2 lambda1))))
   (if (<= phi2 1.65)
     (* R (acos (* (cos phi1) t_0)))
     (* R (acos (* (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((lambda2 - lambda1));
	double tmp;
	if (phi2 <= 1.65) {
		tmp = R * acos((cos(phi1) * t_0));
	} else {
		tmp = R * acos((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((lambda2 - lambda1))
    if (phi2 <= 1.65d0) then
        tmp = r * acos((cos(phi1) * t_0))
    else
        tmp = r * acos((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((lambda2 - lambda1));
	double tmp;
	if (phi2 <= 1.65) {
		tmp = R * Math.acos((Math.cos(phi1) * t_0));
	} else {
		tmp = R * Math.acos((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((lambda2 - lambda1))
	tmp = 0
	if phi2 <= 1.65:
		tmp = R * math.acos((math.cos(phi1) * t_0))
	else:
		tmp = R * math.acos((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(lambda2 - lambda1))
	tmp = 0.0
	if (phi2 <= 1.65)
		tmp = Float64(R * acos(Float64(cos(phi1) * t_0)));
	else
		tmp = Float64(R * acos(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((lambda2 - lambda1));
	tmp = 0.0;
	if (phi2 <= 1.65)
		tmp = R * acos((cos(phi1) * t_0));
	else
		tmp = R * acos((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[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[phi2, 1.65], N[(R * N[ArcCos[N[(N[Cos[phi1], $MachinePrecision] * t$95$0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[Cos[phi2], $MachinePrecision] * t$95$0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if phi2 < 1.6499999999999999

   1. Initial program 75.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 \]

   3. Simplified 75.8%

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

   5. Taylor expanded in phi2 around 0 53.8%

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

      1. sub-neg 53.8%

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

      2. remove-double-neg 53.8%

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

      3. mul-1-neg 53.8%

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

      4. distribute-neg-in 53.8%

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

      5. +-commutative 53.8%

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

      6. cos-neg 53.8%

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

      7. mul-1-neg 53.8%

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

      8. unsub-neg 53.8%

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

   7. Simplified 53.8%

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

   if 1.6499999999999999 < phi2

   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(\sin \phi_1, \sin \phi_2, \cos \phi_1 \cdot \left(\cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right)\right)\right)\right) \cdot R} \]
   4. Add Preprocessing

   5. Taylor expanded in phi1 around 0 50.1%

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

      1. sub-neg 50.1%

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

      2. neg-mul-1 50.1%

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

      3. neg-mul-1 50.1%

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

      4. remove-double-neg 50.1%

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

      5. mul-1-neg 50.1%

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

      6. distribute-neg-in 50.1%

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

      7. +-commutative 50.1%

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

      8. cos-neg 50.1%

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

      9. mul-1-neg 50.1%

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

      10. unsub-neg 50.1%

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

   7. Simplified 50.1%

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

4. Final simplification 53.0%

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

Alternative 16: 38.0% accurate, 2.0× 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.00285:\\ \;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_1 \cdot \cos \lambda_1\right)\\ \mathbf{else}:\\ \;\;\;\;R \cdot \cos^{-1} \cos \lambda_2\\ \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.00285)
   (* R (acos (* (cos phi1) (cos lambda1))))
   (* R (acos (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 tmp;
	if (lambda2 <= 0.00285) {
		tmp = R * acos((cos(phi1) * cos(lambda1)));
	} else {
		tmp = R * acos(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) :: tmp
    if (lambda2 <= 0.00285d0) then
        tmp = r * acos((cos(phi1) * cos(lambda1)))
    else
        tmp = r * acos(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 tmp;
	if (lambda2 <= 0.00285) {
		tmp = R * Math.acos((Math.cos(phi1) * Math.cos(lambda1)));
	} else {
		tmp = R * Math.acos(Math.cos(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 lambda2 <= 0.00285:
		tmp = R * math.acos((math.cos(phi1) * math.cos(lambda1)))
	else:
		tmp = R * math.acos(math.cos(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 (lambda2 <= 0.00285)
		tmp = Float64(R * acos(Float64(cos(phi1) * cos(lambda1))));
	else
		tmp = Float64(R * acos(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)
	tmp = 0.0;
	if (lambda2 <= 0.00285)
		tmp = R * acos((cos(phi1) * cos(lambda1)));
	else
		tmp = R * acos(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_] := If[LessEqual[lambda2, 0.00285], N[(R * N[ArcCos[N[(N[Cos[phi1], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[Cos[lambda2], $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if lambda2 < 0.0028500000000000001

   1. Initial program 81.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 81.5%

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

   5. Taylor expanded in phi2 around 0 46.6%

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

      1. sub-neg 46.6%

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

      2. remove-double-neg 46.6%

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

      3. mul-1-neg 46.6%

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

      4. distribute-neg-in 46.6%

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

      5. +-commutative 46.6%

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

      6. cos-neg 46.6%

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

      7. mul-1-neg 46.6%

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

      8. unsub-neg 46.6%

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

   7. Simplified 46.6%

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

   8. Taylor expanded in lambda2 around 0 39.3%

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

      1. cos-neg 17.4%

         \[\leadsto \cos^{-1} \color{blue}{\cos \lambda_1} \cdot R \]

   10. Simplified 39.3%

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

   if 0.0028500000000000001 < lambda2

   1. Initial program 61.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 61.7%

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

   5. Taylor expanded in phi2 around 0 43.9%

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

      1. sub-neg 43.9%

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

      2. remove-double-neg 43.9%

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

      3. mul-1-neg 43.9%

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

      4. distribute-neg-in 43.9%

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

      5. +-commutative 43.9%

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

      6. cos-neg 43.9%

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

      7. mul-1-neg 43.9%

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

      8. unsub-neg 43.9%

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

   7. Simplified 43.9%

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

   8. Taylor expanded in phi1 around 0 31.1%

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

   9. Taylor expanded in lambda1 around 0 31.3%

      \[\leadsto \cos^{-1} \color{blue}{\cos \lambda_2} \cdot R \]
3. Recombined 2 regimes into one program.

4. Final simplification 37.0%

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

Alternative 17: 42.8% accurate, 2.0× 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 3.6 \cdot 10^{-18}:\\ \;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_1 \cdot \cos \lambda_1\right)\\ \mathbf{else}:\\ \;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_1 \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
 (if (<= lambda2 3.6e-18)
   (* R (acos (* (cos phi1) (cos lambda1))))
   (* R (acos (* (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 tmp;
	if (lambda2 <= 3.6e-18) {
		tmp = R * acos((cos(phi1) * cos(lambda1)));
	} else {
		tmp = R * acos((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) :: tmp
    if (lambda2 <= 3.6d-18) then
        tmp = r * acos((cos(phi1) * cos(lambda1)))
    else
        tmp = r * acos((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 tmp;
	if (lambda2 <= 3.6e-18) {
		tmp = R * Math.acos((Math.cos(phi1) * Math.cos(lambda1)));
	} else {
		tmp = R * Math.acos((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):
	tmp = 0
	if lambda2 <= 3.6e-18:
		tmp = R * math.acos((math.cos(phi1) * math.cos(lambda1)))
	else:
		tmp = R * math.acos((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)
	tmp = 0.0
	if (lambda2 <= 3.6e-18)
		tmp = Float64(R * acos(Float64(cos(phi1) * cos(lambda1))));
	else
		tmp = Float64(R * acos(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)
	tmp = 0.0;
	if (lambda2 <= 3.6e-18)
		tmp = R * acos((cos(phi1) * cos(lambda1)));
	else
		tmp = R * acos((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_] := If[LessEqual[lambda2, 3.6e-18], N[(R * N[ArcCos[N[(N[Cos[phi1], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[Cos[phi1], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if lambda2 < 3.6000000000000001e-18

   1. Initial program 81.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 81.3%

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

   5. Taylor expanded in phi2 around 0 46.0%

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

      1. sub-neg 46.0%

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

      2. remove-double-neg 46.0%

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

      3. mul-1-neg 46.0%

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

      4. distribute-neg-in 46.0%

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

      5. +-commutative 46.0%

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

      6. cos-neg 46.0%

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

      7. mul-1-neg 46.0%

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

      8. unsub-neg 46.0%

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

   7. Simplified 46.0%

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

   8. Taylor expanded in lambda2 around 0 38.5%

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

      1. cos-neg 17.7%

         \[\leadsto \cos^{-1} \color{blue}{\cos \lambda_1} \cdot R \]

   10. Simplified 38.5%

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

   if 3.6000000000000001e-18 < lambda2

   1. Initial program 63.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 63.3%

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

   5. Taylor expanded in phi2 around 0 45.4%

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

      1. sub-neg 45.4%

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

      2. remove-double-neg 45.4%

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

      3. mul-1-neg 45.4%

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

      4. distribute-neg-in 45.4%

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

      5. +-commutative 45.4%

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

      6. cos-neg 45.4%

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

      7. mul-1-neg 45.4%

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

      8. unsub-neg 45.4%

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

   7. Simplified 45.4%

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

   8. Taylor expanded in lambda1 around 0 45.6%

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

4. Final simplification 40.7%

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

Alternative 18: 37.3% accurate, 2.0× 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 -9.5 \cdot 10^{-14}:\\ \;\;\;\;R \cdot \cos^{-1} \left(\cos \phi_1 \cdot \cos \lambda_2\right)\\ \mathbf{else}:\\ \;\;\;\;R \cdot \cos^{-1} \left(\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 (<= phi1 -9.5e-14)
   (* R (acos (* (cos phi1) (cos lambda2))))
   (* R (acos (* (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 (phi1 <= -9.5e-14) {
		tmp = R * acos((cos(phi1) * cos(lambda2)));
	} else {
		tmp = R * acos((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 (phi1 <= (-9.5d-14)) then
        tmp = r * acos((cos(phi1) * cos(lambda2)))
    else
        tmp = r * acos((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 (phi1 <= -9.5e-14) {
		tmp = R * Math.acos((Math.cos(phi1) * Math.cos(lambda2)));
	} else {
		tmp = R * Math.acos((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 phi1 <= -9.5e-14:
		tmp = R * math.acos((math.cos(phi1) * math.cos(lambda2)))
	else:
		tmp = R * math.acos((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 (phi1 <= -9.5e-14)
		tmp = Float64(R * acos(Float64(cos(phi1) * cos(lambda2))));
	else
		tmp = Float64(R * acos(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 (phi1 <= -9.5e-14)
		tmp = R * acos((cos(phi1) * cos(lambda2)));
	else
		tmp = R * acos((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[phi1, -9.5e-14], N[(R * N[ArcCos[N[(N[Cos[phi1], $MachinePrecision] * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[Cos[phi2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if phi1 < -9.4999999999999999e-14

   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(\sin \phi_1, \sin \phi_2, \cos \phi_1 \cdot \left(\cos \phi_2 \cdot \cos \left(\lambda_1 - \lambda_2\right)\right)\right)\right) \cdot R} \]
   4. Add Preprocessing

   5. Taylor expanded in phi2 around 0 49.6%

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

      1. sub-neg 49.6%

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

      2. remove-double-neg 49.6%

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

      3. mul-1-neg 49.6%

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

      4. distribute-neg-in 49.6%

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

      5. +-commutative 49.6%

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

      6. cos-neg 49.6%

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

      7. mul-1-neg 49.6%

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

      8. unsub-neg 49.6%

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

   7. Simplified 49.6%

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

   8. Taylor expanded in lambda1 around 0 40.9%

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

   if -9.4999999999999999e-14 < phi1

   1. Initial program 73.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 \]

   3. Simplified 73.9%

      \[\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 lambda2 around 0 51.6%

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

   6. Taylor expanded in phi1 around 0 32.4%

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

      1. *-commutative 32.4%

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

   8. Simplified 32.4%

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

4. Final simplification 34.9%

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

Alternative 19: 29.3% 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_1 - \lambda_2 \leq -200000000:\\ \;\;\;\;R \cdot \cos^{-1} \cos \left(\lambda_2 - \lambda_1\right)\\ \mathbf{else}:\\ \;\;\;\;R \cdot \left|\left(\left(\lambda_1 - \lambda_2\right) \mathsf{rem} \left(\pi \cdot 2\right)\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 (<= (- lambda1 lambda2) -200000000.0)
   (* R (acos (cos (- lambda2 lambda1))))
   (* R (fabs (remainder (- lambda1 lambda2) (* PI 2.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 ((lambda1 - lambda2) <= -200000000.0) {
		tmp = R * acos(cos((lambda2 - lambda1)));
	} else {
		tmp = R * fabs(remainder((lambda1 - lambda2), (((double) M_PI) * 2.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 tmp;
	if ((lambda1 - lambda2) <= -200000000.0) {
		tmp = R * Math.acos(Math.cos((lambda2 - lambda1)));
	} else {
		tmp = R * Math.abs(Math.IEEEremainder((lambda1 - lambda2), (Math.PI * 2.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 (lambda1 - lambda2) <= -200000000.0:
		tmp = R * math.acos(math.cos((lambda2 - lambda1)))
	else:
		tmp = R * math.fabs(math.remainder((lambda1 - lambda2), (math.pi * 2.0)))
	return tmp

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[N[(lambda1 - lambda2), $MachinePrecision], -200000000.0], N[(R * N[ArcCos[N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[Abs[N[With[{TMP1 = N[(lambda1 - lambda2), $MachinePrecision], TMP2 = N[(Pi * 2.0), $MachinePrecision]}, TMP1 - Round[TMP1 / TMP2] * TMP2], $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (-.f64 lambda1 lambda2) < -2e8

   1. Initial program 77.6%

      \[\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 77.6%

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

   5. Taylor expanded in phi2 around 0 49.2%

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

      1. sub-neg 49.2%

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

      2. remove-double-neg 49.2%

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

      3. mul-1-neg 49.2%

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

      4. distribute-neg-in 49.2%

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

      5. +-commutative 49.2%

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

      6. cos-neg 49.2%

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

      7. mul-1-neg 49.2%

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

      8. unsub-neg 49.2%

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

   7. Simplified 49.2%

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

   8. Taylor expanded in phi1 around 0 32.1%

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

   if -2e8 < (-.f64 lambda1 lambda2)

   1. Initial program 74.6%

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

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

   5. Taylor expanded in phi2 around 0 43.7%

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

      1. sub-neg 43.7%

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

      2. remove-double-neg 43.7%

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

      3. mul-1-neg 43.7%

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

      4. distribute-neg-in 43.7%

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

      5. +-commutative 43.7%

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

      6. cos-neg 43.7%

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

      7. mul-1-neg 43.7%

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

      8. unsub-neg 43.7%

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

   7. Simplified 43.7%

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

   8. Taylor expanded in phi1 around 0 22.1%

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

      1. acos-cos 19.2%

         \[\leadsto \color{blue}{\left|\left(\left(\lambda_2 - \lambda_1\right) \mathsf{rem} \left(2 \cdot \pi\right)\right)\right|} \cdot R \]

      2. acos-cos-s 22.1%

         \[\leadsto \left|\left(\color{blue}{\cos^{-1} \cos \left(\lambda_2 - \lambda_1\right)} \mathsf{rem} \left(2 \cdot \pi\right)\right)\right| \cdot R \]

      3. cos-diff 26.8%

         \[\leadsto \left|\left(\cos^{-1} \color{blue}{\left(\cos \lambda_2 \cdot \cos \lambda_1 + \sin \lambda_2 \cdot \sin \lambda_1\right)} \mathsf{rem} \left(2 \cdot \pi\right)\right)\right| \cdot R \]

      4. *-commutative 26.8%

         \[\leadsto \left|\left(\cos^{-1} \left(\color{blue}{\cos \lambda_1 \cdot \cos \lambda_2} + \sin \lambda_2 \cdot \sin \lambda_1\right) \mathsf{rem} \left(2 \cdot \pi\right)\right)\right| \cdot R \]

      5. *-commutative 26.8%

         \[\leadsto \left|\left(\cos^{-1} \left(\cos \lambda_1 \cdot \cos \lambda_2 + \color{blue}{\sin \lambda_1 \cdot \sin \lambda_2}\right) \mathsf{rem} \left(2 \cdot \pi\right)\right)\right| \cdot R \]

      6. cos-diff 22.1%

         \[\leadsto \left|\left(\cos^{-1} \color{blue}{\cos \left(\lambda_1 - \lambda_2\right)} \mathsf{rem} \left(2 \cdot \pi\right)\right)\right| \cdot R \]

      7. acos-cos-s 19.2%

         \[\leadsto \left|\left(\color{blue}{\left(\lambda_1 - \lambda_2\right)} \mathsf{rem} \left(2 \cdot \pi\right)\right)\right| \cdot R \]

   10. Applied egg-rr 19.2%

       \[\leadsto \color{blue}{\left|\left(\left(\lambda_1 - \lambda_2\right) \mathsf{rem} \left(2 \cdot \pi\right)\right)\right|} \cdot R \]
   11. Step-by-step derivation

       1. *-commutative 19.2%

          \[\leadsto \left|\left(\left(\lambda_1 - \lambda_2\right) \mathsf{rem} \color{blue}{\left(\pi \cdot 2\right)}\right)\right| \cdot R \]

   12. Simplified 19.2%

       \[\leadsto \color{blue}{\left|\left(\left(\lambda_1 - \lambda_2\right) \mathsf{rem} \left(\pi \cdot 2\right)\right)\right|} \cdot R \]
3. Recombined 2 regimes into one program.

4. Final simplification 24.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\lambda_1 - \lambda_2 \leq -200000000:\\ \;\;\;\;R \cdot \cos^{-1} \cos \left(\lambda_2 - \lambda_1\right)\\ \mathbf{else}:\\ \;\;\;\;R \cdot \left|\left(\left(\lambda_1 - \lambda_2\right) \mathsf{rem} \left(\pi \cdot 2\right)\right)\right|\\ \end{array} \]
5. Add Preprocessing

Alternative 20: 19.9% 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_1 \leq -3.6 \cdot 10^{-5}:\\ \;\;\;\;R \cdot \cos^{-1} \cos \lambda_1\\ \mathbf{else}:\\ \;\;\;\;\left(\lambda_2 - \lambda_1\right) \cdot R\\ \end{array} \end{array} \]

FPCore

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

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 (lambda1 <= -3.6e-5) {
		tmp = R * acos(cos(lambda1));
	} else {
		tmp = (lambda2 - lambda1) * R;
	}
	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 (lambda1 <= (-3.6d-5)) then
        tmp = r * acos(cos(lambda1))
    else
        tmp = (lambda2 - lambda1) * r
    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 (lambda1 <= -3.6e-5) {
		tmp = R * Math.acos(Math.cos(lambda1));
	} else {
		tmp = (lambda2 - lambda1) * R;
	}
	return tmp;
}

Python

[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2])
def code(R, lambda1, lambda2, phi1, phi2):
	tmp = 0
	if lambda1 <= -3.6e-5:
		tmp = R * math.acos(math.cos(lambda1))
	else:
		tmp = (lambda2 - lambda1) * R
	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 (lambda1 <= -3.6e-5)
		tmp = Float64(R * acos(cos(lambda1)));
	else
		tmp = Float64(Float64(lambda2 - lambda1) * R);
	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 (lambda1 <= -3.6e-5)
		tmp = R * acos(cos(lambda1));
	else
		tmp = (lambda2 - lambda1) * R;
	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[lambda1, -3.6e-5], N[(R * N[ArcCos[N[Cos[lambda1], $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[(lambda2 - lambda1), $MachinePrecision] * R), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if lambda1 < -3.60000000000000009e-5

   1. Initial program 64.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 64.4%

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

   5. Taylor expanded in phi2 around 0 39.7%

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

      1. sub-neg 39.7%

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

      2. remove-double-neg 39.7%

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

      3. mul-1-neg 39.7%

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

      4. distribute-neg-in 39.7%

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

      5. +-commutative 39.7%

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

      6. cos-neg 39.7%

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

      7. mul-1-neg 39.7%

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

      8. unsub-neg 39.7%

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

   7. Simplified 39.7%

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

   8. Taylor expanded in phi1 around 0 25.6%

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

   9. Taylor expanded in lambda2 around 0 24.9%

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

       1. cos-neg 24.9%

          \[\leadsto \cos^{-1} \color{blue}{\cos \lambda_1} \cdot R \]

   11. Simplified 24.9%

       \[\leadsto \cos^{-1} \color{blue}{\cos \lambda_1} \cdot R \]

   if -3.60000000000000009e-5 < lambda1

   1. Initial program 79.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 79.4%

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

   5. Taylor expanded in phi2 around 0 47.8%

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

      1. sub-neg 47.8%

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

      2. remove-double-neg 47.8%

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

      3. mul-1-neg 47.8%

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

      4. distribute-neg-in 47.8%

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

      5. +-commutative 47.8%

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

      6. cos-neg 47.8%

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

      7. mul-1-neg 47.8%

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

      8. unsub-neg 47.8%

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

   7. Simplified 47.8%

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

   8. Taylor expanded in phi1 around 0 25.9%

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

   9. Taylor expanded in lambda2 around 0 6.2%

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

4. Final simplification 10.8%

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

Alternative 21: 26.4% 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 3.6 \cdot 10^{-18}:\\ \;\;\;\;R \cdot \cos^{-1} \cos \lambda_1\\ \mathbf{else}:\\ \;\;\;\;R \cdot \cos^{-1} \cos \lambda_2\\ \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 3.6e-18)
   (* R (acos (cos lambda1)))
   (* R (acos (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 tmp;
	if (lambda2 <= 3.6e-18) {
		tmp = R * acos(cos(lambda1));
	} else {
		tmp = R * acos(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) :: tmp
    if (lambda2 <= 3.6d-18) then
        tmp = r * acos(cos(lambda1))
    else
        tmp = r * acos(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 tmp;
	if (lambda2 <= 3.6e-18) {
		tmp = R * Math.acos(Math.cos(lambda1));
	} else {
		tmp = R * Math.acos(Math.cos(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 lambda2 <= 3.6e-18:
		tmp = R * math.acos(math.cos(lambda1))
	else:
		tmp = R * math.acos(math.cos(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 (lambda2 <= 3.6e-18)
		tmp = Float64(R * acos(cos(lambda1)));
	else
		tmp = Float64(R * acos(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)
	tmp = 0.0;
	if (lambda2 <= 3.6e-18)
		tmp = R * acos(cos(lambda1));
	else
		tmp = R * acos(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_] := If[LessEqual[lambda2, 3.6e-18], N[(R * N[ArcCos[N[Cos[lambda1], $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[Cos[lambda2], $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if lambda2 < 3.6000000000000001e-18

   1. Initial program 81.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 81.3%

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

   5. Taylor expanded in phi2 around 0 46.0%

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

      1. sub-neg 46.0%

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

      2. remove-double-neg 46.0%

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

      3. mul-1-neg 46.0%

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

      4. distribute-neg-in 46.0%

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

      5. +-commutative 46.0%

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

      6. cos-neg 46.0%

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

      7. mul-1-neg 46.0%

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

      8. unsub-neg 46.0%

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

   7. Simplified 46.0%

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

   8. Taylor expanded in phi1 around 0 24.2%

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

   9. Taylor expanded in lambda2 around 0 17.7%

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

       1. cos-neg 17.7%

          \[\leadsto \cos^{-1} \color{blue}{\cos \lambda_1} \cdot R \]

   11. Simplified 17.7%

       \[\leadsto \cos^{-1} \color{blue}{\cos \lambda_1} \cdot R \]

   if 3.6000000000000001e-18 < lambda2

   1. Initial program 63.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 63.3%

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

   5. Taylor expanded in phi2 around 0 45.4%

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

      1. sub-neg 45.4%

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

      2. remove-double-neg 45.4%

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

      3. mul-1-neg 45.4%

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

      4. distribute-neg-in 45.4%

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

      5. +-commutative 45.4%

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

      6. cos-neg 45.4%

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

      7. mul-1-neg 45.4%

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

      8. unsub-neg 45.4%

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

   7. Simplified 45.4%

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

   8. Taylor expanded in phi1 around 0 29.5%

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

   9. Taylor expanded in lambda1 around 0 29.6%

      \[\leadsto \cos^{-1} \color{blue}{\cos \lambda_2} \cdot R \]
3. Recombined 2 regimes into one program.

4. Final simplification 21.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\lambda_2 \leq 3.6 \cdot 10^{-18}:\\ \;\;\;\;R \cdot \cos^{-1} \cos \lambda_1\\ \mathbf{else}:\\ \;\;\;\;R \cdot \cos^{-1} \cos \lambda_2\\ \end{array} \]
5. Add Preprocessing

Alternative 22: 26.6% accurate, 3.0× speedup

Math

\[\begin{array}{l} [R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\ \\ R \cdot \cos^{-1} \cos \left(\lambda_2 - \lambda_1\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 (- lambda2 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(cos((lambda2 - 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(cos((lambda2 - 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.cos((lambda2 - 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.cos((lambda2 - lambda1)))

Julia

R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2])
function code(R, lambda1, lambda2, phi1, phi2)
	return Float64(R * acos(cos(Float64(lambda2 - 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(cos((lambda2 - 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[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision]], $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 75.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 \]

3. Simplified 75.8%

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

5. Taylor expanded in phi2 around 0 45.8%

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

   1. sub-neg 45.8%

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

   2. remove-double-neg 45.8%

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

   3. mul-1-neg 45.8%

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

   4. distribute-neg-in 45.8%

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

   5. +-commutative 45.8%

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

   6. cos-neg 45.8%

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

   7. mul-1-neg 45.8%

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

   8. unsub-neg 45.8%

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

7. Simplified 45.8%

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

8. Taylor expanded in phi1 around 0 25.8%

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

9. Final simplification 25.8%

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

Alternative 23: 8.7% accurate, 68.0× speedup

Math

\[\begin{array}{l} [R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\ \\ \begin{array}{l} \mathbf{if}\;\lambda_1 \leq -4.5 \cdot 10^{-133}:\\ \;\;\;\;R \cdot \left(-\lambda_1\right)\\ \mathbf{else}:\\ \;\;\;\;\lambda_2 \cdot R\\ \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 (<= lambda1 -4.5e-133) (* R (- lambda1)) (* lambda2 R)))

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 (lambda1 <= -4.5e-133) {
		tmp = R * -lambda1;
	} else {
		tmp = lambda2 * R;
	}
	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 (lambda1 <= (-4.5d-133)) then
        tmp = r * -lambda1
    else
        tmp = lambda2 * r
    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 (lambda1 <= -4.5e-133) {
		tmp = R * -lambda1;
	} else {
		tmp = lambda2 * R;
	}
	return tmp;
}

Python

[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2])
def code(R, lambda1, lambda2, phi1, phi2):
	tmp = 0
	if lambda1 <= -4.5e-133:
		tmp = R * -lambda1
	else:
		tmp = lambda2 * R
	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 (lambda1 <= -4.5e-133)
		tmp = Float64(R * Float64(-lambda1));
	else
		tmp = Float64(lambda2 * R);
	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 (lambda1 <= -4.5e-133)
		tmp = R * -lambda1;
	else
		tmp = lambda2 * R;
	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[lambda1, -4.5e-133], N[(R * (-lambda1)), $MachinePrecision], N[(lambda2 * R), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if lambda1 < -4.50000000000000009e-133

   1. Initial program 71.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 71.1%

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

   5. Taylor expanded in phi2 around 0 44.8%

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

      1. sub-neg 44.8%

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

      2. remove-double-neg 44.8%

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

      3. mul-1-neg 44.8%

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

      4. distribute-neg-in 44.8%

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

      5. +-commutative 44.8%

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

      6. cos-neg 44.8%

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

      7. mul-1-neg 44.8%

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

      8. unsub-neg 44.8%

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

   7. Simplified 44.8%

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

   8. Taylor expanded in phi1 around 0 27.8%

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

   9. Taylor expanded in lambda2 around 0 9.6%

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

       1. neg-mul-1 9.6%

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

   11. Simplified 9.6%

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

   if -4.50000000000000009e-133 < lambda1

   1. Initial program 78.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 78.2%

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

   5. Taylor expanded in phi2 around 0 46.3%

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

      1. sub-neg 46.3%

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

      2. remove-double-neg 46.3%

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

      3. mul-1-neg 46.3%

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

      4. distribute-neg-in 46.3%

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

      5. +-commutative 46.3%

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

      6. cos-neg 46.3%

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

      7. mul-1-neg 46.3%

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

      8. unsub-neg 46.3%

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

   7. Simplified 46.3%

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

   8. Taylor expanded in phi1 around 0 24.8%

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

   9. Taylor expanded in lambda2 around inf 6.6%

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

4. Final simplification 7.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\lambda_1 \leq -4.5 \cdot 10^{-133}:\\ \;\;\;\;R \cdot \left(-\lambda_1\right)\\ \mathbf{else}:\\ \;\;\;\;\lambda_2 \cdot R\\ \end{array} \]
5. Add Preprocessing

Alternative 24: 8.9% accurate, 122.6× speedup

Math

\[\begin{array}{l} [R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\ \\ \left(\lambda_2 - \lambda_1\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
 (* (- lambda2 lambda1) R))

C

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

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 = (lambda2 - lambda1) * r
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 (lambda2 - lambda1) * R;
}

Python

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

Julia

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

MATLAB

R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp = code(R, lambda1, lambda2, phi1, phi2)
	tmp = (lambda2 - lambda1) * 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[(lambda2 - lambda1), $MachinePrecision] * R), $MachinePrecision]

Derivation

1. Initial program 75.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 \]

3. Simplified 75.8%

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

5. Taylor expanded in phi2 around 0 45.8%

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

   1. sub-neg 45.8%

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

   2. remove-double-neg 45.8%

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

   3. mul-1-neg 45.8%

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

   4. distribute-neg-in 45.8%

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

   5. +-commutative 45.8%

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

   6. cos-neg 45.8%

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

   7. mul-1-neg 45.8%

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

   8. unsub-neg 45.8%

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

7. Simplified 45.8%

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

8. Taylor expanded in phi1 around 0 25.8%

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

9. Taylor expanded in lambda2 around 0 6.3%

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

10. Final simplification 6.3%

    \[\leadsto \left(\lambda_2 - \lambda_1\right) \cdot R \]
11. Add Preprocessing

Alternative 25: 7.1% accurate, 204.3× speedup

Math

\[\begin{array}{l} [R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\ \\ \lambda_2 \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 (* 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 lambda2 * R;
}

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 = lambda2 * r
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 lambda2 * R;
}

Python

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

Julia

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

MATLAB

R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp = code(R, lambda1, lambda2, phi1, phi2)
	tmp = 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[(lambda2 * R), $MachinePrecision]

Derivation

1. Initial program 75.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 \]

3. Simplified 75.8%

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

5. Taylor expanded in phi2 around 0 45.8%

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

   1. sub-neg 45.8%

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

   2. remove-double-neg 45.8%

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

   3. mul-1-neg 45.8%

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

   4. distribute-neg-in 45.8%

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

   5. +-commutative 45.8%

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

   6. cos-neg 45.8%

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

   7. mul-1-neg 45.8%

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

   8. unsub-neg 45.8%

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

7. Simplified 45.8%

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

8. Taylor expanded in phi1 around 0 25.8%

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

9. Taylor expanded in lambda2 around inf 5.7%

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

10. Final simplification 5.7%

    \[\leadsto \lambda_2 \cdot R \]
11. Add Preprocessing

Reproduce

herbie shell --seed 2024066 
(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))