Spherical law of cosines

Percentage Accurate: 74.1% → 94.2%

Time: 27.6s

Alternatives: 18

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: 94.2% accurate, 0.6× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

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

   1. cos-diff 93.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 \]

3. Applied egg-rr 93.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. Step-by-step derivation

   1. cos-neg 93.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 93.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-def 93.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 93.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 \]

5. Simplified 93.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 \]

6. Taylor expanded in phi1 around 0 93.3%

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

   1. associate-*r* 93.3%

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

   2. *-commutative 93.3%

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

   3. *-commutative 93.3%

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

   4. *-commutative 93.3%

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

   5. associate-*r* 93.3%

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

   6. fma-def 93.4%

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

8. Simplified 93.4%

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

9. Final simplification 93.4%

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

Alternative 2: 94.2% accurate, 0.6× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

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

   1. cos-diff 93.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 \]

3. Applied egg-rr 93.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. Step-by-step derivation

   1. cos-neg 93.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 93.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-def 93.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 93.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 \]

5. Simplified 93.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 \]

6. Final simplification 93.3%

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

Alternative 3: 94.2% accurate, 0.7× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

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

   1. cos-diff 93.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 \]

3. Applied egg-rr 93.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. Step-by-step derivation

   1. cos-neg 93.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 93.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-def 93.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 93.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 \]

5. Simplified 93.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 \]

6. Taylor expanded in lambda2 around inf 93.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(\sin \lambda_2 \cdot \sin \lambda_1 + \cos \lambda_2 \cdot \cos \lambda_1\right)}\right) \cdot R \]

7. Taylor expanded in lambda2 around inf 93.3%

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

8. Final simplification 93.3%

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

Alternative 4: 94.2% accurate, 0.7× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

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

   1. cos-diff 34.6%

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

   2. +-commutative 34.6%

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

3. Applied egg-rr 93.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(\sin \lambda_1 \cdot \sin \lambda_2 + \cos \lambda_1 \cdot \cos \lambda_2\right)}\right) \cdot R \]

4. Final simplification 93.3%

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

Alternative 5: 84.1% accurate, 0.7× speedup

Math

\[\begin{array}{l} [phi1, phi2] = \mathsf{sort}([phi1, phi2])\\ \\ \begin{array}{l} t_0 := \cos \phi_2 \cdot \cos \phi_1\\ t_1 := \cos \left(\lambda_1 - \lambda_2\right)\\ t_2 := \sin \phi_1 \cdot \sin \phi_2\\ \mathbf{if}\;\phi_1 \leq -6200000:\\ \;\;\;\;R \cdot \cos^{-1} \left(t_2 + t_0 \cdot \mathsf{expm1}\left(\mathsf{log1p}\left(t_1\right)\right)\right)\\ \mathbf{elif}\;\phi_1 \leq 2.1 \cdot 10^{-25}:\\ \;\;\;\;R \cdot \cos^{-1} \left(t_0 \cdot \left(\sin \lambda_2 \cdot \sin \lambda_1 + \cos \lambda_1 \cdot \cos \lambda_2\right) + \phi_1 \cdot \sin \phi_2\right)\\ \mathbf{else}:\\ \;\;\;\;R \cdot \log \left(e^{\cos^{-1} \left(t_2 + t_0 \cdot t_1\right)}\right)\\ \end{array} \end{array} \]

FPCore

NOTE: 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 phi2) (cos phi1)))
        (t_1 (cos (- lambda1 lambda2)))
        (t_2 (* (sin phi1) (sin phi2))))
   (if (<= phi1 -6200000.0)
     (* R (acos (+ t_2 (* t_0 (expm1 (log1p t_1))))))
     (if (<= phi1 2.1e-25)
       (*
        R
        (acos
         (+
          (*
           t_0
           (+ (* (sin lambda2) (sin lambda1)) (* (cos lambda1) (cos lambda2))))
          (* phi1 (sin phi2)))))
       (* R (log (exp (acos (+ t_2 (* t_0 t_1))))))))))

C

assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	double t_0 = cos(phi2) * cos(phi1);
	double t_1 = cos((lambda1 - lambda2));
	double t_2 = sin(phi1) * sin(phi2);
	double tmp;
	if (phi1 <= -6200000.0) {
		tmp = R * acos((t_2 + (t_0 * expm1(log1p(t_1)))));
	} else if (phi1 <= 2.1e-25) {
		tmp = R * acos(((t_0 * ((sin(lambda2) * sin(lambda1)) + (cos(lambda1) * cos(lambda2)))) + (phi1 * sin(phi2))));
	} else {
		tmp = R * log(exp(acos((t_2 + (t_0 * t_1)))));
	}
	return tmp;
}

Java

assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	double t_0 = Math.cos(phi2) * Math.cos(phi1);
	double t_1 = Math.cos((lambda1 - lambda2));
	double t_2 = Math.sin(phi1) * Math.sin(phi2);
	double tmp;
	if (phi1 <= -6200000.0) {
		tmp = R * Math.acos((t_2 + (t_0 * Math.expm1(Math.log1p(t_1)))));
	} else if (phi1 <= 2.1e-25) {
		tmp = R * Math.acos(((t_0 * ((Math.sin(lambda2) * Math.sin(lambda1)) + (Math.cos(lambda1) * Math.cos(lambda2)))) + (phi1 * Math.sin(phi2))));
	} else {
		tmp = R * Math.log(Math.exp(Math.acos((t_2 + (t_0 * t_1)))));
	}
	return tmp;
}

Python

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

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if phi1 < -6.2e6

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

      1. expm1-log1p-u 72.5%

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

   3. Applied egg-rr 72.5%

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

   if -6.2e6 < phi1 < 2.10000000000000002e-25

   1. Initial program 69.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. Taylor expanded in phi1 around 0 68.6%

      \[\leadsto \cos^{-1} \left(\color{blue}{\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. Step-by-step derivation

      1. cos-diff 49.5%

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

      2. +-commutative 49.5%

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

   4. Applied egg-rr 86.8%

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

   if 2.10000000000000002e-25 < phi1

   1. Initial program 75.2%

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

      1. add-sqr-sqrt 38.6%

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

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

      3. pow2 61.7%

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

   3. Applied egg-rr 61.7%

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

      1. add-log-exp 61.7%

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

      2. sqrt-pow1 75.2%

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

      3. metadata-eval 75.2%

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

      4. pow1 75.2%

         \[\leadsto \log \left(e^{\cos^{-1} \left(\color{blue}{\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 \]

      5. *-commutative 75.2%

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

      6. *-commutative 75.2%

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

   5. Applied egg-rr 75.2%

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

4. Final simplification 80.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\phi_1 \leq -6200000:\\ \;\;\;\;R \cdot \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_2 \cdot \cos \phi_1\right) \cdot \mathsf{expm1}\left(\mathsf{log1p}\left(\cos \left(\lambda_1 - \lambda_2\right)\right)\right)\right)\\ \mathbf{elif}\;\phi_1 \leq 2.1 \cdot 10^{-25}:\\ \;\;\;\;R \cdot \cos^{-1} \left(\left(\cos \phi_2 \cdot \cos \phi_1\right) \cdot \left(\sin \lambda_2 \cdot \sin \lambda_1 + \cos \lambda_1 \cdot \cos \lambda_2\right) + \phi_1 \cdot \sin \phi_2\right)\\ \mathbf{else}:\\ \;\;\;\;R \cdot \log \left(e^{\cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_2 \cdot \cos \phi_1\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right)}\right)\\ \end{array} \]

Alternative 6: 82.4% accurate, 0.7× speedup

Math

\[\begin{array}{l} [phi1, phi2] = \mathsf{sort}([phi1, phi2])\\ \\ \begin{array}{l} t_0 := \cos \phi_2 \cdot \cos \phi_1\\ t_1 := \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + t_0 \cdot \cos \left(\lambda_1 - \lambda_2\right)\right)\\ \mathbf{if}\;\phi_2 \leq -0.0105:\\ \;\;\;\;R \cdot \log \left(e^{t_1}\right)\\ \mathbf{elif}\;\phi_2 \leq 2.85 \cdot 10^{+45}:\\ \;\;\;\;R \cdot \cos^{-1} \left(t_0 \cdot \left(\sin \lambda_2 \cdot \sin \lambda_1 + \cos \lambda_1 \cdot \cos \lambda_2\right) + \phi_2 \cdot \sin \phi_1\right)\\ \mathbf{else}:\\ \;\;\;\;R \cdot t_1\\ \end{array} \end{array} \]

FPCore

NOTE: 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 phi2) (cos phi1)))
        (t_1
         (acos
          (+ (* (sin phi1) (sin phi2)) (* t_0 (cos (- lambda1 lambda2)))))))
   (if (<= phi2 -0.0105)
     (* R (log (exp t_1)))
     (if (<= phi2 2.85e+45)
       (*
        R
        (acos
         (+
          (*
           t_0
           (+ (* (sin lambda2) (sin lambda1)) (* (cos lambda1) (cos lambda2))))
          (* phi2 (sin phi1)))))
       (* R t_1)))))

C

assert(phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	double t_0 = cos(phi2) * cos(phi1);
	double t_1 = acos(((sin(phi1) * sin(phi2)) + (t_0 * cos((lambda1 - lambda2)))));
	double tmp;
	if (phi2 <= -0.0105) {
		tmp = R * log(exp(t_1));
	} else if (phi2 <= 2.85e+45) {
		tmp = R * acos(((t_0 * ((sin(lambda2) * sin(lambda1)) + (cos(lambda1) * cos(lambda2)))) + (phi2 * sin(phi1))));
	} else {
		tmp = R * t_1;
	}
	return tmp;
}

Fortran

NOTE: 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(phi2) * cos(phi1)
    t_1 = acos(((sin(phi1) * sin(phi2)) + (t_0 * cos((lambda1 - lambda2)))))
    if (phi2 <= (-0.0105d0)) then
        tmp = r * log(exp(t_1))
    else if (phi2 <= 2.85d+45) then
        tmp = r * acos(((t_0 * ((sin(lambda2) * sin(lambda1)) + (cos(lambda1) * cos(lambda2)))) + (phi2 * sin(phi1))))
    else
        tmp = r * t_1
    end if
    code = tmp
end function

Java

assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	double t_0 = Math.cos(phi2) * Math.cos(phi1);
	double t_1 = Math.acos(((Math.sin(phi1) * Math.sin(phi2)) + (t_0 * Math.cos((lambda1 - lambda2)))));
	double tmp;
	if (phi2 <= -0.0105) {
		tmp = R * Math.log(Math.exp(t_1));
	} else if (phi2 <= 2.85e+45) {
		tmp = R * Math.acos(((t_0 * ((Math.sin(lambda2) * Math.sin(lambda1)) + (Math.cos(lambda1) * Math.cos(lambda2)))) + (phi2 * Math.sin(phi1))));
	} else {
		tmp = R * t_1;
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if phi2 < -0.0105000000000000007

   1. Initial program 77.1%

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

      1. add-sqr-sqrt 39.8%

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

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

      3. pow2 65.5%

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

   3. Applied egg-rr 65.5%

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

      1. add-log-exp 65.5%

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

      2. sqrt-pow1 77.1%

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

      3. metadata-eval 77.1%

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

      4. pow1 77.1%

         \[\leadsto \log \left(e^{\cos^{-1} \left(\color{blue}{\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 \]

      5. *-commutative 77.1%

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

      6. *-commutative 77.1%

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

   5. Applied egg-rr 77.1%

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

   if -0.0105000000000000007 < phi2 < 2.85000000000000013e45

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

      1. cos-diff 89.0%

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

   3. Applied egg-rr 89.0%

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

      1. cos-neg 89.0%

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

         \[\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-def 89.1%

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

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

   5. Simplified 89.1%

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

   6. Taylor expanded in lambda2 around inf 89.0%

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

   7. Taylor expanded in phi2 around 0 87.0%

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

   if 2.85000000000000013e45 < phi2

   1. Initial program 74.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. Recombined 3 regimes into one program.

4. Final simplification 82.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\phi_2 \leq -0.0105:\\ \;\;\;\;R \cdot \log \left(e^{\cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_2 \cdot \cos \phi_1\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right)}\right)\\ \mathbf{elif}\;\phi_2 \leq 2.85 \cdot 10^{+45}:\\ \;\;\;\;R \cdot \cos^{-1} \left(\left(\cos \phi_2 \cdot \cos \phi_1\right) \cdot \left(\sin \lambda_2 \cdot \sin \lambda_1 + \cos \lambda_1 \cdot \cos \lambda_2\right) + \phi_2 \cdot \sin \phi_1\right)\\ \mathbf{else}:\\ \;\;\;\;R \cdot \cos^{-1} \left(\sin \phi_1 \cdot \sin \phi_2 + \left(\cos \phi_2 \cdot \cos \phi_1\right) \cdot \cos \left(\lambda_1 - \lambda_2\right)\right)\\ \end{array} \]

Alternative 7: 69.9% accurate, 0.9× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	double tmp;
	if (lambda2 <= -67000000000000.0) {
		tmp = R * Math.acos(((Math.cos(phi1) * ((Math.sin(lambda2) * Math.sin(lambda1)) + (Math.cos(lambda1) * Math.cos(lambda2)))) + (phi1 * Math.sin(phi2))));
	} else {
		tmp = R * Math.acos(((Math.sin(phi1) * Math.sin(phi2)) + ((Math.cos(phi2) * Math.cos(phi1)) * Math.cos((lambda1 - lambda2)))));
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if lambda2 < -6.7e13

   1. Initial program 52.1%

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

   2. Taylor expanded in phi1 around 0 25.6%

      \[\leadsto \cos^{-1} \left(\color{blue}{\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. Taylor expanded in phi2 around 0 21.1%

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

      1. cos-diff 35.3%

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

      2. +-commutative 35.3%

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

   5. Applied egg-rr 35.3%

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

   if -6.7e13 < lambda2

   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 \]
3. Recombined 2 regimes into one program.

4. Final simplification 66.8%

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

Alternative 8: 61.3% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	double t_0 = Math.cos(phi2) * Math.cos(phi1);
	double tmp;
	if (lambda2 <= 4400.0) {
		tmp = R * Math.acos(((Math.sin(phi1) * Math.sin(phi2)) + (Math.cos(lambda1) * t_0)));
	} else {
		tmp = R * Math.acos((t_0 * Math.cos((lambda1 - lambda2))));
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if lambda2 < 4400

   1. Initial program 72.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. Taylor expanded in lambda2 around 0 59.8%

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

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

      1. *-commutative 67.9%

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

      2. sin-mult 62.3%

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

      3. +-commutative 62.3%

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

   3. Applied egg-rr 62.3%

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

      1. +-commutative 62.3%

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

   5. Simplified 62.3%

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

   6. Taylor expanded in phi2 around 0 62.3%

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

      1. cos-neg 62.3%

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

      2. +-inverses 62.3%

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

   8. Simplified 62.3%

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

4. Final simplification 60.4%

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

Alternative 9: 63.6% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	double t_0 = Math.cos(phi2) * Math.cos(phi1);
	double t_1 = Math.sin(phi1) * Math.sin(phi2);
	double tmp;
	if (lambda2 <= 4400.0) {
		tmp = R * Math.acos((t_1 + (Math.cos(lambda1) * t_0)));
	} else {
		tmp = R * Math.acos((t_1 + (Math.cos(lambda2) * t_0)));
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if lambda2 < 4400

   1. Initial program 72.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. Taylor expanded in lambda2 around 0 59.8%

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

   1. Initial program 67.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. Taylor expanded in lambda1 around 0 67.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 \left(-\lambda_2\right)}\right) \cdot R \]
   3. Step-by-step derivation

      1. cos-neg 36.6%

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

   4. Simplified 67.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_2}\right) \cdot R \]
3. Recombined 2 regimes into one program.

4. Final simplification 61.6%

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

Alternative 10: 74.1% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 71.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. Final simplification 71.6%

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

Alternative 11: 43.7% accurate, 1.5× speedup

Math

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

FPCore

NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
 :precision binary64
 (let* ((t_0 (cos (- lambda1 lambda2))))
   (if (<= phi2 7.5e-113)
     (* R (acos (+ (* phi2 phi1) (* (cos phi1) t_0))))
     (* R (acos (+ (* phi1 (sin phi2)) (* (cos phi2) t_0)))))))

C

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

Fortran

NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
    real(8), intent (in) :: r
    real(8), intent (in) :: lambda1
    real(8), intent (in) :: lambda2
    real(8), intent (in) :: phi1
    real(8), intent (in) :: phi2
    real(8) :: t_0
    real(8) :: tmp
    t_0 = cos((lambda1 - lambda2))
    if (phi2 <= 7.5d-113) then
        tmp = r * acos(((phi2 * phi1) + (cos(phi1) * t_0)))
    else
        tmp = r * acos(((phi1 * sin(phi2)) + (cos(phi2) * t_0)))
    end if
    code = tmp
end function

Java

assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	double t_0 = Math.cos((lambda1 - lambda2));
	double tmp;
	if (phi2 <= 7.5e-113) {
		tmp = R * Math.acos(((phi2 * phi1) + (Math.cos(phi1) * t_0)));
	} else {
		tmp = R * Math.acos(((phi1 * Math.sin(phi2)) + (Math.cos(phi2) * t_0)));
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if phi2 < 7.5000000000000002e-113

   1. Initial program 70.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. Taylor expanded in phi1 around 0 45.5%

      \[\leadsto \cos^{-1} \left(\color{blue}{\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. Taylor expanded in phi2 around 0 33.0%

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

   4. Taylor expanded in phi2 around 0 31.5%

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

      1. *-commutative 31.5%

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

   6. Simplified 31.5%

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

   if 7.5000000000000002e-113 < phi2

   1. Initial program 73.4%

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

   2. Taylor expanded in phi1 around 0 33.7%

      \[\leadsto \cos^{-1} \left(\color{blue}{\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. Taylor expanded in phi1 around 0 33.1%

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

4. Final simplification 32.1%

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

Alternative 12: 23.5% accurate, 1.5× speedup

Math

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

FPCore

NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
 :precision binary64
 (let* ((t_0 (* phi1 (sin phi2))))
   (if (<= lambda1 -0.000112)
     (* R (acos (+ t_0 (* (cos phi1) (cos lambda1)))))
     (* R (acos (+ t_0 (* (cos phi1) (cos lambda2))))))))

C

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

Fortran

NOTE: phi1 and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
    real(8), intent (in) :: r
    real(8), intent (in) :: lambda1
    real(8), intent (in) :: lambda2
    real(8), intent (in) :: phi1
    real(8), intent (in) :: phi2
    real(8) :: t_0
    real(8) :: tmp
    t_0 = phi1 * sin(phi2)
    if (lambda1 <= (-0.000112d0)) then
        tmp = r * acos((t_0 + (cos(phi1) * cos(lambda1))))
    else
        tmp = r * acos((t_0 + (cos(phi1) * cos(lambda2))))
    end if
    code = tmp
end function

Java

assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	double t_0 = phi1 * Math.sin(phi2);
	double tmp;
	if (lambda1 <= -0.000112) {
		tmp = R * Math.acos((t_0 + (Math.cos(phi1) * Math.cos(lambda1))));
	} else {
		tmp = R * Math.acos((t_0 + (Math.cos(phi1) * Math.cos(lambda2))));
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if lambda1 < -1.11999999999999998e-4

   1. Initial program 56.1%

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

   2. Taylor expanded in phi1 around 0 36.4%

      \[\leadsto \cos^{-1} \left(\color{blue}{\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. Taylor expanded in phi2 around 0 26.3%

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

   4. Taylor expanded in lambda2 around 0 26.4%

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

   if -1.11999999999999998e-4 < lambda1

   1. Initial program 77.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. Taylor expanded in phi1 around 0 43.1%

      \[\leadsto \cos^{-1} \left(\color{blue}{\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. Taylor expanded in phi2 around 0 27.5%

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

   4. Taylor expanded in lambda1 around 0 21.2%

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

      1. cos-neg 21.2%

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

   6. Simplified 21.2%

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

4. Final simplification 22.5%

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

Alternative 13: 28.4% accurate, 1.5× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 71.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. Taylor expanded in phi1 around 0 41.4%

   \[\leadsto \cos^{-1} \left(\color{blue}{\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. Taylor expanded in phi2 around 0 27.2%

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

4. Final simplification 27.2%

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

Alternative 14: 59.6% accurate, 1.5× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

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

   1. *-commutative 71.6%

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

   2. sin-mult 59.5%

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

   3. +-commutative 59.5%

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

3. Applied egg-rr 59.5%

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

   1. +-commutative 59.5%

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

5. Simplified 59.5%

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

6. Taylor expanded in phi2 around 0 59.5%

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

   1. cos-neg 59.5%

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

   2. +-inverses 59.5%

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

8. Simplified 59.5%

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

9. Final simplification 59.5%

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

Alternative 15: 23.9% accurate, 2.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	double tmp;
	if (phi1 <= -0.004) {
		tmp = R * Math.acos(((phi2 * phi1) + (Math.cos(phi1) * Math.cos(lambda2))));
	} else {
		tmp = R * Math.acos(((phi2 * phi1) + (Math.cos((lambda1 - lambda2)) * ((-0.5 * (phi1 * phi1)) + 1.0))));
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if phi1 < -0.0040000000000000001

   1. Initial program 73.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. Taylor expanded in phi1 around 0 12.1%

      \[\leadsto \cos^{-1} \left(\color{blue}{\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. Taylor expanded in phi2 around 0 12.0%

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

   4. Taylor expanded in phi2 around 0 11.7%

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

      1. *-commutative 11.7%

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

   6. Simplified 11.7%

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

   7. Taylor expanded in lambda1 around 0 10.5%

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

      1. cos-neg 10.5%

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

      2. *-commutative 10.5%

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

   9. Simplified 10.5%

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

   if -0.0040000000000000001 < phi1

   1. Initial program 71.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. Taylor expanded in phi1 around 0 49.5%

      \[\leadsto \cos^{-1} \left(\color{blue}{\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. Taylor expanded in phi2 around 0 31.5%

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

   4. Taylor expanded in phi2 around 0 29.4%

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

      1. *-commutative 29.4%

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

   6. Simplified 29.4%

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

   7. Taylor expanded in phi1 around 0 23.8%

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

      1. *-commutative 23.8%

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

      2. associate-*r* 23.8%

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

      3. distribute-lft1-in 23.8%

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

      4. unpow2 23.8%

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

   9. Simplified 23.8%

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

4. Final simplification 20.9%

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

Alternative 16: 21.8% accurate, 2.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

assert phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	double tmp;
	if (lambda1 <= -1.05e-5) {
		tmp = R * Math.acos(((phi2 * phi1) + (Math.cos(phi1) * Math.cos(lambda1))));
	} else {
		tmp = R * Math.acos(((phi2 * phi1) + (Math.cos(phi1) * Math.cos(lambda2))));
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if lambda1 < -1.04999999999999994e-5

   1. Initial program 56.1%

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

   2. Taylor expanded in phi1 around 0 36.4%

      \[\leadsto \cos^{-1} \left(\color{blue}{\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. Taylor expanded in phi2 around 0 26.3%

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

   4. Taylor expanded in phi2 around 0 24.3%

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

      1. *-commutative 24.3%

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

   6. Simplified 24.3%

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

   7. Taylor expanded in lambda2 around 0 24.3%

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

   if -1.04999999999999994e-5 < lambda1

   1. Initial program 77.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. Taylor expanded in phi1 around 0 43.1%

      \[\leadsto \cos^{-1} \left(\color{blue}{\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. Taylor expanded in phi2 around 0 27.5%

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

   4. Taylor expanded in phi2 around 0 25.9%

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

      1. *-commutative 25.9%

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

   6. Simplified 25.9%

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

   7. Taylor expanded in lambda1 around 0 19.8%

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

      1. cos-neg 19.8%

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

      2. *-commutative 19.8%

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

   9. Simplified 19.8%

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

4. Final simplification 21.0%

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

Alternative 17: 26.3% accurate, 2.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 71.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. Taylor expanded in phi1 around 0 41.4%

   \[\leadsto \cos^{-1} \left(\color{blue}{\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. Taylor expanded in phi2 around 0 27.2%

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

4. Taylor expanded in phi2 around 0 25.5%

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

   1. *-commutative 25.5%

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

6. Simplified 25.5%

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

7. Final simplification 25.5%

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

Alternative 18: 18.8% accurate, 2.9× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 71.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. Taylor expanded in phi1 around 0 41.4%

   \[\leadsto \cos^{-1} \left(\color{blue}{\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. Taylor expanded in phi2 around 0 27.2%

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

4. Taylor expanded in phi2 around 0 25.5%

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

   1. *-commutative 25.5%

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

6. Simplified 25.5%

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

7. Taylor expanded in phi1 around 0 20.5%

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

8. Final simplification 20.5%

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

Reproduce

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