Spherical law of cosines

Percentage Accurate: 74.1% → 94.4%

Time: 29.4s

Alternatives: 19

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.4% accurate, 0.6× 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 \mathsf{fma}\left(\cos \lambda_2, \cos \lambda_1, \sin \lambda_1 \cdot \sin \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))
     (fma (cos lambda2) (cos lambda1) (* (sin lambda1) (sin 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)) * fma(cos(lambda2), cos(lambda1), (sin(lambda1) * sin(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)) * fma(cos(lambda2), cos(lambda1), Float64(sin(lambda1) * sin(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[(N[Cos[lambda2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision] + N[(N[Sin[lambda1], $MachinePrecision] * N[Sin[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * R), $MachinePrecision]

Derivation

1. Initial program 75.8%

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

   1. cos-diff 95.3%

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

4. Applied egg-rr 95.3%

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

   1. cos-neg 95.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 95.3%

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

   3. fma-define 95.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 95.3%

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

6. Simplified 95.3%

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

7. Final simplification 95.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(\cos \lambda_2, \cos \lambda_1, \sin \lambda_1 \cdot \sin \lambda_2\right)\right) \cdot R \]
8. Add Preprocessing

Alternative 2: 73.3% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \cos \phi_1 \cdot \cos \phi_2\\ \mathbf{if}\;\lambda_1 - \lambda_2 \leq -5 \cdot 10^{+233}:\\ \;\;\;\;R \cdot \cos^{-1} \left(t\_0 \cdot \mathsf{fma}\left(\cos \lambda_2, \cos \lambda_1, \sin \lambda_1 \cdot \sin \lambda_2\right) + \phi_1 \cdot \sin \phi_2\right)\\ \mathbf{else}:\\ \;\;\;\;R \cdot {\left(\sqrt[3]{\pi \cdot 0.5 - \sin^{-1} \left(\mathsf{fma}\left(t\_0, \cos \left(\lambda_2 - \lambda_1\right), \sin \phi_1 \cdot \sin \phi_2\right)\right)}\right)}^{3}\\ \end{array} \end{array} \]

FPCore

(FPCore (R lambda1 lambda2 phi1 phi2)
 :precision binary64
 (let* ((t_0 (* (cos phi1) (cos phi2))))
   (if (<= (- lambda1 lambda2) -5e+233)
     (*
      R
      (acos
       (+
        (*
         t_0
         (fma (cos lambda2) (cos lambda1) (* (sin lambda1) (sin lambda2))))
        (* phi1 (sin phi2)))))
     (*
      R
      (pow
       (cbrt
        (-
         (* PI 0.5)
         (asin (fma t_0 (cos (- lambda2 lambda1)) (* (sin phi1) (sin phi2))))))
       3.0)))))

C

double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	double t_0 = cos(phi1) * cos(phi2);
	double tmp;
	if ((lambda1 - lambda2) <= -5e+233) {
		tmp = R * acos(((t_0 * fma(cos(lambda2), cos(lambda1), (sin(lambda1) * sin(lambda2)))) + (phi1 * sin(phi2))));
	} else {
		tmp = R * pow(cbrt(((((double) M_PI) * 0.5) - asin(fma(t_0, cos((lambda2 - lambda1)), (sin(phi1) * sin(phi2)))))), 3.0);
	}
	return tmp;
}

Julia

function code(R, lambda1, lambda2, phi1, phi2)
	t_0 = Float64(cos(phi1) * cos(phi2))
	tmp = 0.0
	if (Float64(lambda1 - lambda2) <= -5e+233)
		tmp = Float64(R * acos(Float64(Float64(t_0 * fma(cos(lambda2), cos(lambda1), Float64(sin(lambda1) * sin(lambda2)))) + Float64(phi1 * sin(phi2)))));
	else
		tmp = Float64(R * (cbrt(Float64(Float64(pi * 0.5) - asin(fma(t_0, cos(Float64(lambda2 - lambda1)), Float64(sin(phi1) * sin(phi2)))))) ^ 3.0));
	end
	return tmp
end

Wolfram

code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(lambda1 - lambda2), $MachinePrecision], -5e+233], N[(R * N[ArcCos[N[(N[(t$95$0 * N[(N[Cos[lambda2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision] + N[(N[Sin[lambda1], $MachinePrecision] * N[Sin[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(phi1 * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[Power[N[Power[N[(N[(Pi * 0.5), $MachinePrecision] - N[ArcSin[N[(t$95$0 * N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision] + N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], 1/3], $MachinePrecision], 3.0], $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (-.f64 lambda1 lambda2) < -5.00000000000000009e233

   1. Initial program 68.6%

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

      1. cos-diff 99.3%

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

   4. Applied egg-rr 99.3%

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

      1. cos-neg 99.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 99.3%

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

      3. fma-define 99.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 99.3%

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

   6. Simplified 99.3%

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

   7. Taylor expanded in phi1 around 0 51.8%

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

   if -5.00000000000000009e233 < (-.f64 lambda1 lambda2)

   1. Initial program 76.5%

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

      1. acos-asin 76.4%

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

      2. sub-neg 76.4%

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

      3. div-inv 76.4%

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

      4. metadata-eval 76.4%

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

      5. +-commutative 76.4%

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

      6. *-commutative 76.4%

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

      7. fma-define 76.4%

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

   4. Applied egg-rr 76.4%

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

      1. sub-neg 76.4%

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

      2. fma-define 76.4%

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

      3. *-commutative 76.4%

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

      4. associate-*r* 76.4%

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

      5. fma-define 76.4%

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

   6. Simplified 76.4%

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

      1. add-cube-cbrt 75.5%

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

      2. pow3 75.5%

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

   8. Applied egg-rr 75.5%

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

4. Final simplification 73.4%

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

Alternative 3: 94.4% accurate, 0.7× speedup

Math

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

FPCore

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

C

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

Fortran

real(8) function code(r, lambda1, lambda2, phi1, phi2)
    real(8), intent (in) :: r
    real(8), intent (in) :: lambda1
    real(8), intent (in) :: lambda2
    real(8), intent (in) :: phi1
    real(8), intent (in) :: phi2
    code = r * acos(((sin(phi1) * sin(phi2)) + (cos(phi1) * (cos(phi2) * ((sin(lambda1) * sin(lambda2)) + (cos(lambda2) * cos(lambda1)))))))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 75.8%

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

   1. cos-diff 95.3%

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

4. Applied egg-rr 95.3%

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

   1. cos-neg 95.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 95.3%

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

   3. fma-define 95.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 95.3%

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

6. Simplified 95.3%

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

7. Taylor expanded in phi1 around 0 95.3%

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

8. Final simplification 95.3%

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

Alternative 4: 74.1% accurate, 0.9× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 75.8%

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

3. Simplified 75.8%

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

5. Final simplification 75.8%

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

Alternative 5: 43.2% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (R lambda1 lambda2 phi1 phi2)
 :precision binary64
 (if (<= lambda2 225.0)
   (* R (acos (fma (cos phi1) (cos phi2) (* (sin phi1) (sin phi2)))))
   (*
    R
    (acos
     (*
      (cos phi1)
      (+ (* (sin lambda1) (sin lambda2)) (* (cos lambda2) (cos lambda1))))))))

C

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

Julia

function code(R, lambda1, lambda2, phi1, phi2)
	tmp = 0.0
	if (lambda2 <= 225.0)
		tmp = Float64(R * acos(fma(cos(phi1), cos(phi2), Float64(sin(phi1) * sin(phi2)))));
	else
		tmp = Float64(R * acos(Float64(cos(phi1) * Float64(Float64(sin(lambda1) * sin(lambda2)) + Float64(cos(lambda2) * cos(lambda1))))));
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if lambda2 < 225

   1. Initial program 81.4%

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

   3. Simplified 81.4%

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

   5. Taylor expanded in lambda2 around 0 66.4%

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

   6. Taylor expanded in lambda1 around 0 40.4%

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

      1. fma-define 40.4%

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

   8. Simplified 40.4%

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

   if 225 < lambda2

   1. Initial program 61.1%

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

   3. Simplified 61.1%

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

   5. Taylor expanded in phi2 around 0 42.7%

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

      1. sub-neg 42.7%

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

      2. remove-double-neg 42.7%

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

      3. mul-1-neg 42.7%

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

      4. distribute-neg-in 42.7%

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

      5. +-commutative 42.7%

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

      6. cos-neg 42.7%

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

      7. mul-1-neg 42.7%

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

      8. unsub-neg 42.7%

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

   7. Simplified 42.7%

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

      1. cos-diff 65.7%

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

      2. *-commutative 65.7%

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

   9. Applied egg-rr 65.7%

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

4. Final simplification 47.4%

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

Alternative 6: 63.4% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (R lambda1 lambda2 phi1 phi2)
 :precision binary64
 (if (<= phi2 1.28e-8)
   (*
    R
    (acos
     (*
      (cos phi1)
      (+ (* (sin lambda1) (sin lambda2)) (* (cos lambda2) (cos lambda1))))))
   (*
    R
    (acos
     (+
      (* (sin phi1) (sin phi2))
      (* (* (cos phi1) (cos phi2)) (cos lambda1)))))))

C

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

Fortran

real(8) function code(r, lambda1, lambda2, phi1, phi2)
    real(8), intent (in) :: r
    real(8), intent (in) :: lambda1
    real(8), intent (in) :: lambda2
    real(8), intent (in) :: phi1
    real(8), intent (in) :: phi2
    real(8) :: tmp
    if (phi2 <= 1.28d-8) then
        tmp = r * acos((cos(phi1) * ((sin(lambda1) * sin(lambda2)) + (cos(lambda2) * cos(lambda1)))))
    else
        tmp = r * acos(((sin(phi1) * sin(phi2)) + ((cos(phi1) * cos(phi2)) * cos(lambda1))))
    end if
    code = tmp
end function

Java

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

Python

def code(R, lambda1, lambda2, phi1, phi2):
	tmp = 0
	if phi2 <= 1.28e-8:
		tmp = R * math.acos((math.cos(phi1) * ((math.sin(lambda1) * math.sin(lambda2)) + (math.cos(lambda2) * math.cos(lambda1)))))
	else:
		tmp = R * math.acos(((math.sin(phi1) * math.sin(phi2)) + ((math.cos(phi1) * math.cos(phi2)) * math.cos(lambda1))))
	return tmp

Julia

function code(R, lambda1, lambda2, phi1, phi2)
	tmp = 0.0
	if (phi2 <= 1.28e-8)
		tmp = Float64(R * acos(Float64(cos(phi1) * Float64(Float64(sin(lambda1) * sin(lambda2)) + Float64(cos(lambda2) * cos(lambda1))))));
	else
		tmp = Float64(R * acos(Float64(Float64(sin(phi1) * sin(phi2)) + Float64(Float64(cos(phi1) * cos(phi2)) * cos(lambda1)))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
	tmp = 0.0;
	if (phi2 <= 1.28e-8)
		tmp = R * acos((cos(phi1) * ((sin(lambda1) * sin(lambda2)) + (cos(lambda2) * cos(lambda1)))));
	else
		tmp = R * acos(((sin(phi1) * sin(phi2)) + ((cos(phi1) * cos(phi2)) * cos(lambda1))));
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if phi2 < 1.28000000000000005e-8

   1. Initial program 75.8%

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

   3. Simplified 75.8%

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

   5. Taylor expanded in phi2 around 0 53.8%

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

      1. sub-neg 53.8%

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

      2. remove-double-neg 53.8%

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

      3. mul-1-neg 53.8%

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

      4. distribute-neg-in 53.8%

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

      5. +-commutative 53.8%

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

      6. cos-neg 53.8%

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

      7. mul-1-neg 53.8%

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

      8. unsub-neg 53.8%

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

   7. Simplified 53.8%

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

      1. cos-diff 66.7%

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

      2. *-commutative 66.7%

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

   9. Applied egg-rr 66.7%

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

   if 1.28000000000000005e-8 < phi2

   1. Initial program 75.5%

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

   3. Taylor expanded in lambda2 around 0 53.3%

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

4. Final simplification 63.7%

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

Alternative 7: 63.5% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \cos \phi_1 \cdot \cos \phi_2\\ t_1 := \sin \phi_1 \cdot \sin \phi_2\\ \mathbf{if}\;\lambda_2 \leq 3.6 \cdot 10^{-18}:\\ \;\;\;\;R \cdot \cos^{-1} \left(t\_1 + t\_0 \cdot \cos \lambda_1\right)\\ \mathbf{else}:\\ \;\;\;\;R \cdot \cos^{-1} \left(t\_1 + t\_0 \cdot \cos \lambda_2\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (R lambda1 lambda2 phi1 phi2)
 :precision binary64
 (let* ((t_0 (* (cos phi1) (cos phi2))) (t_1 (* (sin phi1) (sin phi2))))
   (if (<= lambda2 3.6e-18)
     (* R (acos (+ t_1 (* t_0 (cos lambda1)))))
     (* R (acos (+ t_1 (* t_0 (cos lambda2))))))))

C

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

Fortran

real(8) function code(r, lambda1, lambda2, phi1, phi2)
    real(8), intent (in) :: r
    real(8), intent (in) :: lambda1
    real(8), intent (in) :: lambda2
    real(8), intent (in) :: phi1
    real(8), intent (in) :: phi2
    real(8) :: t_0
    real(8) :: t_1
    real(8) :: tmp
    t_0 = cos(phi1) * cos(phi2)
    t_1 = sin(phi1) * sin(phi2)
    if (lambda2 <= 3.6d-18) then
        tmp = r * acos((t_1 + (t_0 * cos(lambda1))))
    else
        tmp = r * acos((t_1 + (t_0 * cos(lambda2))))
    end if
    code = tmp
end function

Java

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

Python

def code(R, lambda1, lambda2, phi1, phi2):
	t_0 = math.cos(phi1) * math.cos(phi2)
	t_1 = math.sin(phi1) * math.sin(phi2)
	tmp = 0
	if lambda2 <= 3.6e-18:
		tmp = R * math.acos((t_1 + (t_0 * math.cos(lambda1))))
	else:
		tmp = R * math.acos((t_1 + (t_0 * math.cos(lambda2))))
	return tmp

Julia

function code(R, lambda1, lambda2, phi1, phi2)
	t_0 = Float64(cos(phi1) * cos(phi2))
	t_1 = Float64(sin(phi1) * sin(phi2))
	tmp = 0.0
	if (lambda2 <= 3.6e-18)
		tmp = Float64(R * acos(Float64(t_1 + Float64(t_0 * cos(lambda1)))));
	else
		tmp = Float64(R * acos(Float64(t_1 + Float64(t_0 * cos(lambda2)))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
	t_0 = cos(phi1) * cos(phi2);
	t_1 = sin(phi1) * sin(phi2);
	tmp = 0.0;
	if (lambda2 <= 3.6e-18)
		tmp = R * acos((t_1 + (t_0 * cos(lambda1))));
	else
		tmp = R * acos((t_1 + (t_0 * cos(lambda2))));
	end
	tmp_2 = tmp;
end

Wolfram

code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(N[Cos[phi1], $MachinePrecision] * N[Cos[phi2], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[Sin[phi1], $MachinePrecision] * N[Sin[phi2], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[lambda2, 3.6e-18], N[(R * N[ArcCos[N[(t$95$1 + N[(t$95$0 * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(t$95$1 + N[(t$95$0 * N[Cos[lambda2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 2 regimes

2. if lambda2 < 3.6000000000000001e-18

   1. Initial program 81.3%

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

   3. Taylor expanded in lambda2 around 0 66.4%

      \[\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 3.6000000000000001e-18 < lambda2

   1. Initial program 63.3%

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

   3. Taylor expanded in lambda1 around 0 63.3%

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

      1. cos-neg 63.3%

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

   5. Simplified 63.3%

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

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

Alternative 8: 74.1% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ R \cdot \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) \end{array} \]

FPCore

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

C

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

Fortran

real(8) function code(r, lambda1, lambda2, phi1, phi2)
    real(8), intent (in) :: r
    real(8), intent (in) :: lambda1
    real(8), intent (in) :: lambda2
    real(8), intent (in) :: phi1
    real(8), intent (in) :: phi2
    code = r * acos(((sin(phi1) * sin(phi2)) + ((cos(phi1) * cos(phi2)) * cos((lambda1 - lambda2)))))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 75.8%

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

3. Final simplification 75.8%

   \[\leadsto R \cdot \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) \]
4. Add Preprocessing

Alternative 9: 32.5% accurate, 2.0× speedup

Math

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

FPCore

(FPCore (R lambda1 lambda2 phi1 phi2)
 :precision binary64
 (if (<= (- lambda1 lambda2) -0.01)
   (* R (acos (cos (- lambda2 lambda1))))
   (* R (acos (* (cos phi1) (cos lambda1))))))

C

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

Fortran

real(8) function code(r, lambda1, lambda2, phi1, phi2)
    real(8), intent (in) :: r
    real(8), intent (in) :: lambda1
    real(8), intent (in) :: lambda2
    real(8), intent (in) :: phi1
    real(8), intent (in) :: phi2
    real(8) :: tmp
    if ((lambda1 - lambda2) <= (-0.01d0)) then
        tmp = r * acos(cos((lambda2 - lambda1)))
    else
        tmp = r * acos((cos(phi1) * cos(lambda1)))
    end if
    code = tmp
end function

Java

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

Python

def code(R, lambda1, lambda2, phi1, phi2):
	tmp = 0
	if (lambda1 - lambda2) <= -0.01:
		tmp = R * math.acos(math.cos((lambda2 - lambda1)))
	else:
		tmp = R * math.acos((math.cos(phi1) * math.cos(lambda1)))
	return tmp

Julia

function code(R, lambda1, lambda2, phi1, phi2)
	tmp = 0.0
	if (Float64(lambda1 - lambda2) <= -0.01)
		tmp = Float64(R * acos(cos(Float64(lambda2 - lambda1))));
	else
		tmp = Float64(R * acos(Float64(cos(phi1) * cos(lambda1))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
	tmp = 0.0;
	if ((lambda1 - lambda2) <= -0.01)
		tmp = R * acos(cos((lambda2 - lambda1)));
	else
		tmp = R * acos((cos(phi1) * cos(lambda1)));
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 78.3%

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

   3. Simplified 78.3%

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

   5. Taylor expanded in phi2 around 0 50.0%

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

      1. sub-neg 50.0%

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

      2. remove-double-neg 50.0%

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

      3. mul-1-neg 50.0%

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

      4. distribute-neg-in 50.0%

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

      5. +-commutative 50.0%

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

      6. cos-neg 50.0%

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

      7. mul-1-neg 50.0%

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

      8. unsub-neg 50.0%

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

   7. Simplified 50.0%

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

   8. Taylor expanded in phi1 around 0 31.7%

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

   if -0.0100000000000000002 < (-.f64 lambda1 lambda2)

   1. Initial program 74.1%

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

   3. Simplified 74.1%

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

   5. Taylor expanded in phi2 around 0 43.2%

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

      1. sub-neg 43.2%

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

      2. remove-double-neg 43.2%

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

      3. mul-1-neg 43.2%

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

      4. distribute-neg-in 43.2%

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

      5. +-commutative 43.2%

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

      6. cos-neg 43.2%

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

      7. mul-1-neg 43.2%

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

      8. unsub-neg 43.2%

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

   7. Simplified 43.2%

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

   8. Taylor expanded in lambda2 around 0 34.7%

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

      1. cos-neg 14.8%

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

   10. Simplified 34.7%

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

4. Final simplification 33.5%

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

Alternative 10: 37.5% accurate, 2.0× speedup

Math

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

FPCore

(FPCore (R lambda1 lambda2 phi1 phi2)
 :precision binary64
 (if (<= lambda2 4e-67)
   (* R (acos (* (cos phi2) (cos lambda1))))
   (* R (acos (* (cos phi1) (cos (- lambda2 lambda1)))))))

C

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

Fortran

real(8) function code(r, lambda1, lambda2, phi1, phi2)
    real(8), intent (in) :: r
    real(8), intent (in) :: lambda1
    real(8), intent (in) :: lambda2
    real(8), intent (in) :: phi1
    real(8), intent (in) :: phi2
    real(8) :: tmp
    if (lambda2 <= 4d-67) then
        tmp = r * acos((cos(phi2) * cos(lambda1)))
    else
        tmp = r * acos((cos(phi1) * cos((lambda2 - lambda1))))
    end if
    code = tmp
end function

Java

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

Python

def code(R, lambda1, lambda2, phi1, phi2):
	tmp = 0
	if lambda2 <= 4e-67:
		tmp = R * math.acos((math.cos(phi2) * math.cos(lambda1)))
	else:
		tmp = R * math.acos((math.cos(phi1) * math.cos((lambda2 - lambda1))))
	return tmp

Julia

function code(R, lambda1, lambda2, phi1, phi2)
	tmp = 0.0
	if (lambda2 <= 4e-67)
		tmp = Float64(R * acos(Float64(cos(phi2) * cos(lambda1))));
	else
		tmp = Float64(R * acos(Float64(cos(phi1) * cos(Float64(lambda2 - lambda1)))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
	tmp = 0.0;
	if (lambda2 <= 4e-67)
		tmp = R * acos((cos(phi2) * cos(lambda1)));
	else
		tmp = R * acos((cos(phi1) * cos((lambda2 - lambda1))));
	end
	tmp_2 = tmp;
end

Wolfram

code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[lambda2, 4e-67], N[(R * N[ArcCos[N[(N[Cos[phi2], $MachinePrecision] * N[Cos[lambda1], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[(N[Cos[phi1], $MachinePrecision] * N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if lambda2 < 3.99999999999999977e-67

   1. Initial program 80.6%

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

   3. Simplified 80.6%

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

   5. Taylor expanded in lambda2 around 0 64.6%

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

   6. Taylor expanded in phi1 around 0 32.1%

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

      1. *-commutative 32.1%

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

   8. Simplified 32.1%

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

   if 3.99999999999999977e-67 < lambda2

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

   3. Simplified 67.0%

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

   5. Taylor expanded in phi2 around 0 47.2%

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

      1. sub-neg 47.2%

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

      2. remove-double-neg 47.2%

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

      3. mul-1-neg 47.2%

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

      4. distribute-neg-in 47.2%

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

      5. +-commutative 47.2%

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

      6. cos-neg 47.2%

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

      7. mul-1-neg 47.2%

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

      8. unsub-neg 47.2%

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

   7. Simplified 47.2%

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

4. Final simplification 37.5%

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

Alternative 11: 43.5% accurate, 2.0× speedup

Math

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

FPCore

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

C

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 75.8%

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

3. Simplified 75.8%

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

5. Taylor expanded in phi1 around 0 40.4%

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

   1. sub-neg 40.4%

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

   2. neg-mul-1 40.4%

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

   3. neg-mul-1 40.4%

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

   4. remove-double-neg 40.4%

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

   5. mul-1-neg 40.4%

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

   6. distribute-neg-in 40.4%

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

   7. +-commutative 40.4%

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

   8. cos-neg 40.4%

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

   9. mul-1-neg 40.4%

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

   10. unsub-neg 40.4%

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

7. Simplified 40.4%

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

8. Final simplification 40.4%

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

Alternative 12: 31.3% accurate, 2.0× speedup

Math

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

FPCore

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

C

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

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 = r * acos((cos(phi1) * cos(lambda2)))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 75.8%

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

3. Simplified 75.8%

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

5. Taylor expanded in phi2 around 0 45.8%

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

   1. sub-neg 45.8%

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

   2. remove-double-neg 45.8%

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

   3. mul-1-neg 45.8%

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

   4. distribute-neg-in 45.8%

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

   5. +-commutative 45.8%

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

   6. cos-neg 45.8%

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

   7. mul-1-neg 45.8%

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

   8. unsub-neg 45.8%

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

7. Simplified 45.8%

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

8. Taylor expanded in lambda1 around 0 34.8%

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

9. Final simplification 34.8%

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

Alternative 13: 15.8% accurate, 2.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\lambda_1 - \lambda_2 \leq -200:\\ \;\;\;\;R \cdot \cos^{-1} \cos \left(\lambda_2 - \lambda_1\right)\\ \mathbf{else}:\\ \;\;\;\;R \cdot \frac{{\lambda_2}^{2} - {\lambda_1}^{2}}{\lambda_2 + \lambda_1}\\ \end{array} \end{array} \]

FPCore

(FPCore (R lambda1 lambda2 phi1 phi2)
 :precision binary64
 (if (<= (- lambda1 lambda2) -200.0)
   (* R (acos (cos (- lambda2 lambda1))))
   (* R (/ (- (pow lambda2 2.0) (pow lambda1 2.0)) (+ lambda2 lambda1)))))

C

double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	double tmp;
	if ((lambda1 - lambda2) <= -200.0) {
		tmp = R * acos(cos((lambda2 - lambda1)));
	} else {
		tmp = R * ((pow(lambda2, 2.0) - pow(lambda1, 2.0)) / (lambda2 + lambda1));
	}
	return tmp;
}

Fortran

real(8) function code(r, lambda1, lambda2, phi1, phi2)
    real(8), intent (in) :: r
    real(8), intent (in) :: lambda1
    real(8), intent (in) :: lambda2
    real(8), intent (in) :: phi1
    real(8), intent (in) :: phi2
    real(8) :: tmp
    if ((lambda1 - lambda2) <= (-200.0d0)) then
        tmp = r * acos(cos((lambda2 - lambda1)))
    else
        tmp = r * (((lambda2 ** 2.0d0) - (lambda1 ** 2.0d0)) / (lambda2 + lambda1))
    end if
    code = tmp
end function

Java

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

Python

def code(R, lambda1, lambda2, phi1, phi2):
	tmp = 0
	if (lambda1 - lambda2) <= -200.0:
		tmp = R * math.acos(math.cos((lambda2 - lambda1)))
	else:
		tmp = R * ((math.pow(lambda2, 2.0) - math.pow(lambda1, 2.0)) / (lambda2 + lambda1))
	return tmp

Julia

function code(R, lambda1, lambda2, phi1, phi2)
	tmp = 0.0
	if (Float64(lambda1 - lambda2) <= -200.0)
		tmp = Float64(R * acos(cos(Float64(lambda2 - lambda1))));
	else
		tmp = Float64(R * Float64(Float64((lambda2 ^ 2.0) - (lambda1 ^ 2.0)) / Float64(lambda2 + lambda1)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
	tmp = 0.0;
	if ((lambda1 - lambda2) <= -200.0)
		tmp = R * acos(cos((lambda2 - lambda1)));
	else
		tmp = R * (((lambda2 ^ 2.0) - (lambda1 ^ 2.0)) / (lambda2 + lambda1));
	end
	tmp_2 = tmp;
end

Wolfram

code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[N[(lambda1 - lambda2), $MachinePrecision], -200.0], N[(R * N[ArcCos[N[Cos[N[(lambda2 - lambda1), $MachinePrecision]], $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[(N[(N[Power[lambda2, 2.0], $MachinePrecision] - N[Power[lambda1, 2.0], $MachinePrecision]), $MachinePrecision] / N[(lambda2 + lambda1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

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

   1. Initial program 78.1%

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

   3. Simplified 78.1%

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

   5. Taylor expanded in phi2 around 0 49.5%

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

      1. sub-neg 49.5%

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

      2. remove-double-neg 49.5%

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

      3. mul-1-neg 49.5%

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

      4. distribute-neg-in 49.5%

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

      5. +-commutative 49.5%

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

      6. cos-neg 49.5%

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

      7. mul-1-neg 49.5%

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

      8. unsub-neg 49.5%

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

   7. Simplified 49.5%

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

   8. Taylor expanded in phi1 around 0 31.9%

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

   if -200 < (-.f64 lambda1 lambda2)

   1. Initial program 74.3%

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

   3. Simplified 74.3%

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

   5. Taylor expanded in phi2 around 0 43.5%

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

      1. sub-neg 43.5%

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

      2. remove-double-neg 43.5%

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

      3. mul-1-neg 43.5%

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

      4. distribute-neg-in 43.5%

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

      5. +-commutative 43.5%

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

      6. cos-neg 43.5%

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

      7. mul-1-neg 43.5%

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

      8. unsub-neg 43.5%

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

   7. Simplified 43.5%

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

   8. Taylor expanded in phi1 around 0 22.1%

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

      1. acos-cos-s 6.1%

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

      2. flip-- 5.8%

         \[\leadsto \color{blue}{\frac{\lambda_2 \cdot \lambda_2 - \lambda_1 \cdot \lambda_1}{\lambda_2 + \lambda_1}} \cdot R \]

      3. pow2 5.8%

         \[\leadsto \frac{\color{blue}{{\lambda_2}^{2}} - \lambda_1 \cdot \lambda_1}{\lambda_2 + \lambda_1} \cdot R \]

      4. pow2 5.8%

         \[\leadsto \frac{{\lambda_2}^{2} - \color{blue}{{\lambda_1}^{2}}}{\lambda_2 + \lambda_1} \cdot R \]

   10. Applied egg-rr 5.8%

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

4. Final simplification 15.8%

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

Alternative 14: 22.1% accurate, 2.9× speedup

Math

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

FPCore

(FPCore (R lambda1 lambda2 phi1 phi2)
 :precision binary64
 (if (<= lambda2 3.6e-18)
   (* R (acos (cos lambda1)))
   (* R (acos (cos lambda2)))))

C

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

Fortran

real(8) function code(r, lambda1, lambda2, phi1, phi2)
    real(8), intent (in) :: r
    real(8), intent (in) :: lambda1
    real(8), intent (in) :: lambda2
    real(8), intent (in) :: phi1
    real(8), intent (in) :: phi2
    real(8) :: tmp
    if (lambda2 <= 3.6d-18) then
        tmp = r * acos(cos(lambda1))
    else
        tmp = r * acos(cos(lambda2))
    end if
    code = tmp
end function

Java

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

Python

def code(R, lambda1, lambda2, phi1, phi2):
	tmp = 0
	if lambda2 <= 3.6e-18:
		tmp = R * math.acos(math.cos(lambda1))
	else:
		tmp = R * math.acos(math.cos(lambda2))
	return tmp

Julia

function code(R, lambda1, lambda2, phi1, phi2)
	tmp = 0.0
	if (lambda2 <= 3.6e-18)
		tmp = Float64(R * acos(cos(lambda1)));
	else
		tmp = Float64(R * acos(cos(lambda2)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
	tmp = 0.0;
	if (lambda2 <= 3.6e-18)
		tmp = R * acos(cos(lambda1));
	else
		tmp = R * acos(cos(lambda2));
	end
	tmp_2 = tmp;
end

Wolfram

code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[lambda2, 3.6e-18], N[(R * N[ArcCos[N[Cos[lambda1], $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[ArcCos[N[Cos[lambda2], $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if lambda2 < 3.6000000000000001e-18

   1. Initial program 81.3%

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

   3. Simplified 81.3%

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

   5. Taylor expanded in phi2 around 0 46.0%

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

      1. sub-neg 46.0%

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

      2. remove-double-neg 46.0%

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

      3. mul-1-neg 46.0%

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

      4. distribute-neg-in 46.0%

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

      5. +-commutative 46.0%

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

      6. cos-neg 46.0%

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

      7. mul-1-neg 46.0%

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

      8. unsub-neg 46.0%

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

   7. Simplified 46.0%

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

   8. Taylor expanded in phi1 around 0 24.2%

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

   9. Taylor expanded in lambda2 around 0 17.7%

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

       1. cos-neg 17.7%

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

   11. Simplified 17.7%

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

   if 3.6000000000000001e-18 < lambda2

   1. Initial program 63.3%

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

   3. Simplified 63.3%

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

   5. Taylor expanded in phi2 around 0 45.4%

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

      1. sub-neg 45.4%

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

      2. remove-double-neg 45.4%

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

      3. mul-1-neg 45.4%

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

      4. distribute-neg-in 45.4%

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

      5. +-commutative 45.4%

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

      6. cos-neg 45.4%

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

      7. mul-1-neg 45.4%

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

      8. unsub-neg 45.4%

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

   7. Simplified 45.4%

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

   8. Taylor expanded in phi1 around 0 29.5%

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

   9. Taylor expanded in lambda1 around 0 29.6%

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

4. Final simplification 21.4%

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

Alternative 15: 26.6% accurate, 3.0× speedup

Math

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

FPCore

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

C

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

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 = r * acos(cos((lambda2 - lambda1)))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 75.8%

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

3. Simplified 75.8%

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

5. Taylor expanded in phi2 around 0 45.8%

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

   1. sub-neg 45.8%

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

   2. remove-double-neg 45.8%

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

   3. mul-1-neg 45.8%

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

   4. distribute-neg-in 45.8%

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

   5. +-commutative 45.8%

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

   6. cos-neg 45.8%

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

   7. mul-1-neg 45.8%

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

   8. unsub-neg 45.8%

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

7. Simplified 45.8%

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

8. Taylor expanded in phi1 around 0 25.8%

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

9. Final simplification 25.8%

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

Alternative 16: 17.5% accurate, 3.0× speedup

Math

\[\begin{array}{l} \\ R \cdot \cos^{-1} \cos \lambda_1 \end{array} \]

FPCore

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

C

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

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 = r * acos(cos(lambda1))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * N[ArcCos[N[Cos[lambda1], $MachinePrecision]], $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 75.8%

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

3. Simplified 75.8%

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

5. Taylor expanded in phi2 around 0 45.8%

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

   1. sub-neg 45.8%

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

   2. remove-double-neg 45.8%

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

   3. mul-1-neg 45.8%

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

   4. distribute-neg-in 45.8%

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

   5. +-commutative 45.8%

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

   6. cos-neg 45.8%

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

   7. mul-1-neg 45.8%

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

   8. unsub-neg 45.8%

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

7. Simplified 45.8%

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

8. Taylor expanded in phi1 around 0 25.8%

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

9. Taylor expanded in lambda2 around 0 15.5%

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

    1. cos-neg 15.5%

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

11. Simplified 15.5%

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

12. Final simplification 15.5%

    \[\leadsto R \cdot \cos^{-1} \cos \lambda_1 \]
13. Add Preprocessing

Alternative 17: 5.6% accurate, 122.6× speedup

Math

\[\begin{array}{l} \\ R \cdot \left(\lambda_2 - \lambda_1\right) \end{array} \]

FPCore

(FPCore (R lambda1 lambda2 phi1 phi2)
 :precision binary64
 (* R (- lambda2 lambda1)))

C

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

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 = r * (lambda2 - lambda1)
end function

Java

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

Python

def code(R, lambda1, lambda2, phi1, phi2):
	return R * (lambda2 - lambda1)

Julia

function code(R, lambda1, lambda2, phi1, phi2)
	return Float64(R * Float64(lambda2 - lambda1))
end

MATLAB

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

Wolfram

code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * N[(lambda2 - lambda1), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 75.8%

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

3. Simplified 75.8%

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

5. Taylor expanded in phi2 around 0 45.8%

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

   1. sub-neg 45.8%

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

   2. remove-double-neg 45.8%

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

   3. mul-1-neg 45.8%

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

   4. distribute-neg-in 45.8%

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

   5. +-commutative 45.8%

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

   6. cos-neg 45.8%

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

   7. mul-1-neg 45.8%

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

   8. unsub-neg 45.8%

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

7. Simplified 45.8%

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

8. Taylor expanded in phi1 around 0 25.8%

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

9. Taylor expanded in lambda2 around 0 6.3%

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

10. Final simplification 6.3%

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

Alternative 18: 5.3% accurate, 153.3× speedup

Math

\[\begin{array}{l} \\ \lambda_1 \cdot \left(-R\right) \end{array} \]

FPCore

(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (* lambda1 (- R)))

C

double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	return lambda1 * -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 = lambda1 * -r
end function

Java

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

Python

def code(R, lambda1, lambda2, phi1, phi2):
	return lambda1 * -R

Julia

function code(R, lambda1, lambda2, phi1, phi2)
	return Float64(lambda1 * Float64(-R))
end

MATLAB

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

Wolfram

code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(lambda1 * (-R)), $MachinePrecision]

Derivation

1. Initial program 75.8%

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

3. Simplified 75.8%

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

5. Taylor expanded in phi2 around 0 45.8%

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

   1. sub-neg 45.8%

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

   2. remove-double-neg 45.8%

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

   3. mul-1-neg 45.8%

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

   4. distribute-neg-in 45.8%

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

   5. +-commutative 45.8%

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

   6. cos-neg 45.8%

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

   7. mul-1-neg 45.8%

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

   8. unsub-neg 45.8%

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

7. Simplified 45.8%

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

8. Taylor expanded in phi1 around 0 25.8%

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

9. Taylor expanded in lambda2 around 0 6.1%

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

    1. neg-mul-1 6.1%

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

11. Simplified 6.1%

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

12. Final simplification 6.1%

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

Alternative 19: 5.4% accurate, 204.3× speedup

Math

\[\begin{array}{l} \\ \lambda_2 \cdot R \end{array} \]

FPCore

(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (* lambda2 R))

C

double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	return 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 = lambda2 * r
end function

Java

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

Python

def code(R, lambda1, lambda2, phi1, phi2):
	return lambda2 * R

Julia

function code(R, lambda1, lambda2, phi1, phi2)
	return Float64(lambda2 * R)
end

MATLAB

function tmp = code(R, lambda1, lambda2, phi1, phi2)
	tmp = lambda2 * R;
end

Wolfram

code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(lambda2 * R), $MachinePrecision]

Derivation

1. Initial program 75.8%

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

3. Simplified 75.8%

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

5. Taylor expanded in phi2 around 0 45.8%

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

   1. sub-neg 45.8%

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

   2. remove-double-neg 45.8%

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

   3. mul-1-neg 45.8%

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

   4. distribute-neg-in 45.8%

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

   5. +-commutative 45.8%

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

   6. cos-neg 45.8%

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

   7. mul-1-neg 45.8%

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

   8. unsub-neg 45.8%

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

7. Simplified 45.8%

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

8. Taylor expanded in phi1 around 0 25.8%

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

9. Taylor expanded in lambda2 around inf 5.7%

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

10. Final simplification 5.7%

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

Reproduce

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