Equirectangular approximation to distance on a great circle

Percentage Accurate: 60.0% → 96.0%

Time: 7.1s

Alternatives: 15

Speedup: 1.3×

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

Specification

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 60.0% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 96.0% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \mathsf{hypot}\left(\phi_1 - \phi_2, \cos \left(\frac{\phi_2 + \phi_1}{2}\right) \cdot \left(\lambda_1 - \lambda_2\right)\right) \cdot R \end{array} \]

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(N[Sqrt[N[(phi1 - phi2), $MachinePrecision] ^ 2 + N[(N[Cos[N[(N[(phi2 + phi1), $MachinePrecision] / 2.0), $MachinePrecision]], $MachinePrecision] * N[(lambda1 - lambda2), $MachinePrecision]), $MachinePrecision] ^ 2], $MachinePrecision] * R), $MachinePrecision]

Derivation

1. Initial program 64.4%

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

   1. lift-*.f64 N/A

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

   2. lift-sqrt.f64 N/A

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

   3. lift-+.f64 N/A

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

4. Applied rewrites 96.7%

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

Alternative 2: 78.9% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \cos \left(0.5 \cdot \phi_1\right)\\ \mathbf{if}\;\phi_2 \leq 8.6 \cdot 10^{+48}:\\ \;\;\;\;\mathsf{hypot}\left(\phi_1, t\_0 \cdot \left(\lambda_1 - \lambda_2\right)\right) \cdot R\\ \mathbf{else}:\\ \;\;\;\;\mathsf{hypot}\left(\phi_1 - \phi_2, t\_0 \cdot \left(-\lambda_2\right)\right) \cdot R\\ \end{array} \end{array} \]

FPCore

(FPCore (R lambda1 lambda2 phi1 phi2)
 :precision binary64
 (let* ((t_0 (cos (* 0.5 phi1))))
   (if (<= phi2 8.6e+48)
     (* (hypot phi1 (* t_0 (- lambda1 lambda2))) R)
     (* (hypot (- phi1 phi2) (* t_0 (- lambda2))) R))))

C

double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	double t_0 = cos((0.5 * phi1));
	double tmp;
	if (phi2 <= 8.6e+48) {
		tmp = hypot(phi1, (t_0 * (lambda1 - lambda2))) * R;
	} else {
		tmp = hypot((phi1 - phi2), (t_0 * -lambda2)) * R;
	}
	return tmp;
}

Java

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

Python

def code(R, lambda1, lambda2, phi1, phi2):
	t_0 = math.cos((0.5 * phi1))
	tmp = 0
	if phi2 <= 8.6e+48:
		tmp = math.hypot(phi1, (t_0 * (lambda1 - lambda2))) * R
	else:
		tmp = math.hypot((phi1 - phi2), (t_0 * -lambda2)) * R
	return tmp

Julia

function code(R, lambda1, lambda2, phi1, phi2)
	t_0 = cos(Float64(0.5 * phi1))
	tmp = 0.0
	if (phi2 <= 8.6e+48)
		tmp = Float64(hypot(phi1, Float64(t_0 * Float64(lambda1 - lambda2))) * R);
	else
		tmp = Float64(hypot(Float64(phi1 - phi2), Float64(t_0 * Float64(-lambda2))) * R);
	end
	return tmp
end

MATLAB

function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
	t_0 = cos((0.5 * phi1));
	tmp = 0.0;
	if (phi2 <= 8.6e+48)
		tmp = hypot(phi1, (t_0 * (lambda1 - lambda2))) * R;
	else
		tmp = hypot((phi1 - phi2), (t_0 * -lambda2)) * R;
	end
	tmp_2 = tmp;
end

Wolfram

code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[Cos[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[phi2, 8.6e+48], N[(N[Sqrt[phi1 ^ 2 + N[(t$95$0 * N[(lambda1 - lambda2), $MachinePrecision]), $MachinePrecision] ^ 2], $MachinePrecision] * R), $MachinePrecision], N[(N[Sqrt[N[(phi1 - phi2), $MachinePrecision] ^ 2 + N[(t$95$0 * (-lambda2)), $MachinePrecision] ^ 2], $MachinePrecision] * R), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if phi2 < 8.59999999999999957e48

   1. Initial program 66.2%

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

      1. lift-*.f64 N/A

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

      2. lift-sqrt.f64 N/A

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

      3. lift-+.f64 N/A

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

   4. Applied rewrites 97.0%

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

   5. Taylor expanded in phi1 around inf

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

      1. lower-*.f64 92.4

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

   7. Applied rewrites 92.4%

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

   8. Taylor expanded in phi1 around inf

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

   10. Applied rewrites 76.3%

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

   if 8.59999999999999957e48 < phi2

   1. Initial program 58.0%

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

      1. lift-*.f64 N/A

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

      2. lift-sqrt.f64 N/A

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

      3. lift-+.f64 N/A

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

   4. Applied rewrites 95.7%

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

   5. Taylor expanded in phi1 around inf

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

      1. lower-*.f64 86.0

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

   7. Applied rewrites 86.0%

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

   8. Taylor expanded in lambda1 around 0

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 84.2

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

   10. Applied rewrites 84.2%

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

Alternative 3: 76.7% accurate, 1.2× speedup

Math

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

FPCore

(FPCore (R lambda1 lambda2 phi1 phi2)
 :precision binary64
 (if (<= phi2 1.45e+53)
   (* (hypot phi1 (* (cos (* 0.5 phi1)) (- lambda1 lambda2))) R)
   (fma (- R) phi1 (* R phi2))))

C

double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	double tmp;
	if (phi2 <= 1.45e+53) {
		tmp = hypot(phi1, (cos((0.5 * phi1)) * (lambda1 - lambda2))) * R;
	} else {
		tmp = fma(-R, phi1, (R * phi2));
	}
	return tmp;
}

Julia

function code(R, lambda1, lambda2, phi1, phi2)
	tmp = 0.0
	if (phi2 <= 1.45e+53)
		tmp = Float64(hypot(phi1, Float64(cos(Float64(0.5 * phi1)) * Float64(lambda1 - lambda2))) * R);
	else
		tmp = fma(Float64(-R), phi1, Float64(R * phi2));
	end
	return tmp
end

Wolfram

code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, 1.45e+53], N[(N[Sqrt[phi1 ^ 2 + N[(N[Cos[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision] * N[(lambda1 - lambda2), $MachinePrecision]), $MachinePrecision] ^ 2], $MachinePrecision] * R), $MachinePrecision], N[((-R) * phi1 + N[(R * phi2), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if phi2 < 1.4500000000000001e53

   1. Initial program 66.2%

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

      1. lift-*.f64 N/A

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

      2. lift-sqrt.f64 N/A

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

      3. lift-+.f64 N/A

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

   4. Applied rewrites 97.0%

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

   5. Taylor expanded in phi1 around inf

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

      1. lower-*.f64 92.4

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

   7. Applied rewrites 92.4%

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

   8. Taylor expanded in phi1 around inf

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

   10. Applied rewrites 76.3%

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

   if 1.4500000000000001e53 < phi2

   1. Initial program 58.0%

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

   3. Taylor expanded in phi1 around -inf

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

      1. associate-*r* N/A

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

      2. mul-1-neg N/A

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

      3. lower-*.f64 N/A

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

      4. lower-neg.f64 N/A

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

      5. +-commutative N/A

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

      6. *-commutative N/A

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

      7. lower-fma.f64 N/A

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

      8. lower-/.f64 N/A

         \[\leadsto \left(-\phi_1\right) \cdot \mathsf{fma}\left(\frac{R \cdot \phi_2}{\phi_1}, -1, R\right) \]

      9. *-commutative N/A

         \[\leadsto \left(-\phi_1\right) \cdot \mathsf{fma}\left(\frac{\phi_2 \cdot R}{\phi_1}, -1, R\right) \]

      10. lower-*.f64 66.3

          \[\leadsto \left(-\phi_1\right) \cdot \mathsf{fma}\left(\frac{\phi_2 \cdot R}{\phi_1}, -1, R\right) \]

   5. Applied rewrites 66.3%

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

   6. Taylor expanded in phi1 around 0

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

      1. associate-*r* N/A

         \[\leadsto \left(-1 \cdot R\right) \cdot \phi_1 + R \cdot \phi_2 \]

      2. mul-1-neg N/A

         \[\leadsto \left(\mathsf{neg}\left(R\right)\right) \cdot \phi_1 + R \cdot \phi_2 \]

      3. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(\mathsf{neg}\left(R\right), \phi_1, R \cdot \phi_2\right) \]

      4. lower-neg.f64 N/A

         \[\leadsto \mathsf{fma}\left(-R, \phi_1, R \cdot \phi_2\right) \]

      5. lower-*.f64 77.9

         \[\leadsto \mathsf{fma}\left(-R, \phi_1, R \cdot \phi_2\right) \]

   8. Applied rewrites 77.9%

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

Alternative 4: 90.4% accurate, 1.3× speedup

Math

\[\begin{array}{l} \\ \mathsf{hypot}\left(\phi_1 - \phi_2, \cos \left(0.5 \cdot \phi_1\right) \cdot \left(\lambda_1 - \lambda_2\right)\right) \cdot R \end{array} \]

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 64.4%

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

   1. lift-*.f64 N/A

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

   2. lift-sqrt.f64 N/A

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

   3. lift-+.f64 N/A

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

4. Applied rewrites 96.7%

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

5. Taylor expanded in phi1 around inf

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

   1. lower-*.f64 91.0

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

7. Applied rewrites 91.0%

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

Alternative 5: 31.5% accurate, 2.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\lambda_1 \leq -5.6 \cdot 10^{+132}:\\ \;\;\;\;-R \cdot \left(\lambda_1 \cdot \cos \left(0.5 \cdot \phi_2\right)\right)\\ \mathbf{elif}\;\lambda_1 \leq 1.3 \cdot 10^{+99}:\\ \;\;\;\;R \cdot \left(\phi_2 - \phi_1\right)\\ \mathbf{else}:\\ \;\;\;\;\left(R \cdot \lambda_2\right) \cdot \cos \left(0.5 \cdot \left(\phi_2 + \phi_1\right)\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (R lambda1 lambda2 phi1 phi2)
 :precision binary64
 (if (<= lambda1 -5.6e+132)
   (- (* R (* lambda1 (cos (* 0.5 phi2)))))
   (if (<= lambda1 1.3e+99)
     (* R (- phi2 phi1))
     (* (* R lambda2) (cos (* 0.5 (+ phi2 phi1)))))))

C

double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	double tmp;
	if (lambda1 <= -5.6e+132) {
		tmp = -(R * (lambda1 * cos((0.5 * phi2))));
	} else if (lambda1 <= 1.3e+99) {
		tmp = R * (phi2 - phi1);
	} else {
		tmp = (R * lambda2) * cos((0.5 * (phi2 + phi1)));
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(r, lambda1, lambda2, phi1, phi2)
use fmin_fmax_functions
    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 <= (-5.6d+132)) then
        tmp = -(r * (lambda1 * cos((0.5d0 * phi2))))
    else if (lambda1 <= 1.3d+99) then
        tmp = r * (phi2 - phi1)
    else
        tmp = (r * lambda2) * cos((0.5d0 * (phi2 + phi1)))
    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 <= -5.6e+132) {
		tmp = -(R * (lambda1 * Math.cos((0.5 * phi2))));
	} else if (lambda1 <= 1.3e+99) {
		tmp = R * (phi2 - phi1);
	} else {
		tmp = (R * lambda2) * Math.cos((0.5 * (phi2 + phi1)));
	}
	return tmp;
}

Python

def code(R, lambda1, lambda2, phi1, phi2):
	tmp = 0
	if lambda1 <= -5.6e+132:
		tmp = -(R * (lambda1 * math.cos((0.5 * phi2))))
	elif lambda1 <= 1.3e+99:
		tmp = R * (phi2 - phi1)
	else:
		tmp = (R * lambda2) * math.cos((0.5 * (phi2 + phi1)))
	return tmp

Julia

function code(R, lambda1, lambda2, phi1, phi2)
	tmp = 0.0
	if (lambda1 <= -5.6e+132)
		tmp = Float64(-Float64(R * Float64(lambda1 * cos(Float64(0.5 * phi2)))));
	elseif (lambda1 <= 1.3e+99)
		tmp = Float64(R * Float64(phi2 - phi1));
	else
		tmp = Float64(Float64(R * lambda2) * cos(Float64(0.5 * Float64(phi2 + phi1))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
	tmp = 0.0;
	if (lambda1 <= -5.6e+132)
		tmp = -(R * (lambda1 * cos((0.5 * phi2))));
	elseif (lambda1 <= 1.3e+99)
		tmp = R * (phi2 - phi1);
	else
		tmp = (R * lambda2) * cos((0.5 * (phi2 + phi1)));
	end
	tmp_2 = tmp;
end

Wolfram

code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[lambda1, -5.6e+132], (-N[(R * N[(lambda1 * N[Cos[N[(0.5 * phi2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), If[LessEqual[lambda1, 1.3e+99], N[(R * N[(phi2 - phi1), $MachinePrecision]), $MachinePrecision], N[(N[(R * lambda2), $MachinePrecision] * N[Cos[N[(0.5 * N[(phi2 + phi1), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if lambda1 < -5.5999999999999998e132

   1. Initial program 36.9%

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

   3. Taylor expanded in lambda1 around -inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. associate-*r* N/A

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

      4. lower-*.f64 N/A

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

      5. lower-*.f64 N/A

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

      6. lower-cos.f64 N/A

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

      7. lower-*.f64 N/A

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

      8. +-commutative N/A

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

      9. lower-+.f64 57.6

         \[\leadsto -\left(R \cdot \lambda_1\right) \cdot \cos \left(0.5 \cdot \left(\phi_2 + \phi_1\right)\right) \]

   5. Applied rewrites 57.6%

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

   6. Taylor expanded in phi1 around 0

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

   8. Applied rewrites 55.4%

      \[\leadsto -\left(R \cdot \lambda_1\right) \cdot \cos \left(0.5 \cdot \phi_2\right) \]

   9. Taylor expanded in phi1 around 0

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

       1. lower-*.f64 N/A

          \[\leadsto -R \cdot \left(\lambda_1 \cdot \cos \left(\frac{1}{2} \cdot \phi_2\right)\right) \]

       2. lower-*.f64 N/A

          \[\leadsto -R \cdot \left(\lambda_1 \cdot \cos \left(\frac{1}{2} \cdot \phi_2\right)\right) \]

       3. lower-cos.f64 N/A

          \[\leadsto -R \cdot \left(\lambda_1 \cdot \cos \left(\frac{1}{2} \cdot \phi_2\right)\right) \]

       4. lower-*.f64 55.3

          \[\leadsto -R \cdot \left(\lambda_1 \cdot \cos \left(0.5 \cdot \phi_2\right)\right) \]

   11. Applied rewrites 55.3%

       \[\leadsto -R \cdot \left(\lambda_1 \cdot \cos \left(0.5 \cdot \phi_2\right)\right) \]

   if -5.5999999999999998e132 < lambda1 < 1.3e99

   1. Initial program 71.9%

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

   3. Taylor expanded in phi2 around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(\frac{R \cdot \phi_1}{\phi_2}, -1, R\right) \cdot \phi_2 \]

      6. lower-/.f64 N/A

         \[\leadsto \mathsf{fma}\left(\frac{R \cdot \phi_1}{\phi_2}, -1, R\right) \cdot \phi_2 \]

      7. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(\frac{\phi_1 \cdot R}{\phi_2}, -1, R\right) \cdot \phi_2 \]

      8. lower-*.f64 39.4

         \[\leadsto \mathsf{fma}\left(\frac{\phi_1 \cdot R}{\phi_2}, -1, R\right) \cdot \phi_2 \]

   5. Applied rewrites 39.4%

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

   6. Taylor expanded in phi1 around 0

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

      1. associate-*r* N/A

         \[\leadsto \left(-1 \cdot R\right) \cdot \phi_1 + R \cdot \phi_2 \]

      2. mul-1-neg N/A

         \[\leadsto \left(\mathsf{neg}\left(R\right)\right) \cdot \phi_1 + R \cdot \phi_2 \]

      3. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(\mathsf{neg}\left(R\right), \phi_1, R \cdot \phi_2\right) \]

      4. lower-neg.f64 N/A

         \[\leadsto \mathsf{fma}\left(-R, \phi_1, R \cdot \phi_2\right) \]

      5. lower-*.f64 38.2

         \[\leadsto \mathsf{fma}\left(-R, \phi_1, R \cdot \phi_2\right) \]

   8. Applied rewrites 38.2%

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

   9. Taylor expanded in R around 0

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

       1. lower-*.f64 N/A

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

       2. lower-+.f64 N/A

          \[\leadsto R \cdot \left(\phi_2 + -1 \cdot \phi_1\right) \]

       3. lower-*.f64 38.8

          \[\leadsto R \cdot \left(\phi_2 + -1 \cdot \phi_1\right) \]

   11. Applied rewrites 38.8%

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

   if 1.3e99 < lambda1

   1. Initial program 60.1%

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

   3. Taylor expanded in lambda2 around inf

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

      1. associate-*r* N/A

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

      2. lower-*.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower-cos.f64 N/A

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

      5. lower-*.f64 N/A

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

      6. +-commutative N/A

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

      7. lower-+.f64 12.7

         \[\leadsto \left(R \cdot \lambda_2\right) \cdot \cos \left(0.5 \cdot \left(\phi_2 + \phi_1\right)\right) \]

   5. Applied rewrites 12.7%

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

4. Final simplification 36.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\lambda_1 \leq -5.6 \cdot 10^{+132}:\\ \;\;\;\;-R \cdot \left(\lambda_1 \cdot \cos \left(0.5 \cdot \phi_2\right)\right)\\ \mathbf{elif}\;\lambda_1 \leq 1.3 \cdot 10^{+99}:\\ \;\;\;\;R \cdot \left(\phi_2 - \phi_1\right)\\ \mathbf{else}:\\ \;\;\;\;\left(R \cdot \lambda_2\right) \cdot \cos \left(0.5 \cdot \left(\phi_2 + \phi_1\right)\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 33.3% accurate, 2.2× speedup

Math

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

FPCore

(FPCore (R lambda1 lambda2 phi1 phi2)
 :precision binary64
 (if (<= lambda1 -5.6e+132)
   (- (* R (* lambda1 (cos (* 0.5 phi2)))))
   (* R (- phi2 phi1))))

C

double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	double tmp;
	if (lambda1 <= -5.6e+132) {
		tmp = -(R * (lambda1 * cos((0.5 * phi2))));
	} else {
		tmp = R * (phi2 - phi1);
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(r, lambda1, lambda2, phi1, phi2)
use fmin_fmax_functions
    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 <= (-5.6d+132)) then
        tmp = -(r * (lambda1 * cos((0.5d0 * phi2))))
    else
        tmp = r * (phi2 - phi1)
    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 <= -5.6e+132) {
		tmp = -(R * (lambda1 * Math.cos((0.5 * phi2))));
	} else {
		tmp = R * (phi2 - phi1);
	}
	return tmp;
}

Python

def code(R, lambda1, lambda2, phi1, phi2):
	tmp = 0
	if lambda1 <= -5.6e+132:
		tmp = -(R * (lambda1 * math.cos((0.5 * phi2))))
	else:
		tmp = R * (phi2 - phi1)
	return tmp

Julia

function code(R, lambda1, lambda2, phi1, phi2)
	tmp = 0.0
	if (lambda1 <= -5.6e+132)
		tmp = Float64(-Float64(R * Float64(lambda1 * cos(Float64(0.5 * phi2)))));
	else
		tmp = Float64(R * Float64(phi2 - phi1));
	end
	return tmp
end

MATLAB

function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
	tmp = 0.0;
	if (lambda1 <= -5.6e+132)
		tmp = -(R * (lambda1 * cos((0.5 * phi2))));
	else
		tmp = R * (phi2 - phi1);
	end
	tmp_2 = tmp;
end

Wolfram

code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[lambda1, -5.6e+132], (-N[(R * N[(lambda1 * N[Cos[N[(0.5 * phi2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), N[(R * N[(phi2 - phi1), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if lambda1 < -5.5999999999999998e132

   1. Initial program 36.9%

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

   3. Taylor expanded in lambda1 around -inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. associate-*r* N/A

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

      4. lower-*.f64 N/A

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

      5. lower-*.f64 N/A

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

      6. lower-cos.f64 N/A

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

      7. lower-*.f64 N/A

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

      8. +-commutative N/A

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

      9. lower-+.f64 57.6

         \[\leadsto -\left(R \cdot \lambda_1\right) \cdot \cos \left(0.5 \cdot \left(\phi_2 + \phi_1\right)\right) \]

   5. Applied rewrites 57.6%

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

   6. Taylor expanded in phi1 around 0

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

   8. Applied rewrites 55.4%

      \[\leadsto -\left(R \cdot \lambda_1\right) \cdot \cos \left(0.5 \cdot \phi_2\right) \]

   9. Taylor expanded in phi1 around 0

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

       1. lower-*.f64 N/A

          \[\leadsto -R \cdot \left(\lambda_1 \cdot \cos \left(\frac{1}{2} \cdot \phi_2\right)\right) \]

       2. lower-*.f64 N/A

          \[\leadsto -R \cdot \left(\lambda_1 \cdot \cos \left(\frac{1}{2} \cdot \phi_2\right)\right) \]

       3. lower-cos.f64 N/A

          \[\leadsto -R \cdot \left(\lambda_1 \cdot \cos \left(\frac{1}{2} \cdot \phi_2\right)\right) \]

       4. lower-*.f64 55.3

          \[\leadsto -R \cdot \left(\lambda_1 \cdot \cos \left(0.5 \cdot \phi_2\right)\right) \]

   11. Applied rewrites 55.3%

       \[\leadsto -R \cdot \left(\lambda_1 \cdot \cos \left(0.5 \cdot \phi_2\right)\right) \]

   if -5.5999999999999998e132 < lambda1

   1. Initial program 69.4%

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

   3. Taylor expanded in phi2 around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(\frac{R \cdot \phi_1}{\phi_2}, -1, R\right) \cdot \phi_2 \]

      6. lower-/.f64 N/A

         \[\leadsto \mathsf{fma}\left(\frac{R \cdot \phi_1}{\phi_2}, -1, R\right) \cdot \phi_2 \]

      7. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(\frac{\phi_1 \cdot R}{\phi_2}, -1, R\right) \cdot \phi_2 \]

      8. lower-*.f64 35.8

         \[\leadsto \mathsf{fma}\left(\frac{\phi_1 \cdot R}{\phi_2}, -1, R\right) \cdot \phi_2 \]

   5. Applied rewrites 35.8%

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

   6. Taylor expanded in phi1 around 0

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

      1. associate-*r* N/A

         \[\leadsto \left(-1 \cdot R\right) \cdot \phi_1 + R \cdot \phi_2 \]

      2. mul-1-neg N/A

         \[\leadsto \left(\mathsf{neg}\left(R\right)\right) \cdot \phi_1 + R \cdot \phi_2 \]

      3. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(\mathsf{neg}\left(R\right), \phi_1, R \cdot \phi_2\right) \]

      4. lower-neg.f64 N/A

         \[\leadsto \mathsf{fma}\left(-R, \phi_1, R \cdot \phi_2\right) \]

      5. lower-*.f64 34.0

         \[\leadsto \mathsf{fma}\left(-R, \phi_1, R \cdot \phi_2\right) \]

   8. Applied rewrites 34.0%

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

   9. Taylor expanded in R around 0

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

       1. lower-*.f64 N/A

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

       2. lower-+.f64 N/A

          \[\leadsto R \cdot \left(\phi_2 + -1 \cdot \phi_1\right) \]

       3. lower-*.f64 34.5

          \[\leadsto R \cdot \left(\phi_2 + -1 \cdot \phi_1\right) \]

   11. Applied rewrites 34.5%

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

4. Final simplification 37.7%

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

Alternative 7: 29.8% accurate, 5.8× speedup

Math

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

FPCore

(FPCore (R lambda1 lambda2 phi1 phi2)
 :precision binary64
 (if (<= (- lambda1 lambda2) -1e+121)
   (* (* (fma (/ R phi2) -1.0 (/ R phi1)) phi1) phi2)
   (* R (- phi2 phi1))))

C

double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	double tmp;
	if ((lambda1 - lambda2) <= -1e+121) {
		tmp = (fma((R / phi2), -1.0, (R / phi1)) * phi1) * phi2;
	} else {
		tmp = R * (phi2 - phi1);
	}
	return tmp;
}

Julia

function code(R, lambda1, lambda2, phi1, phi2)
	tmp = 0.0
	if (Float64(lambda1 - lambda2) <= -1e+121)
		tmp = Float64(Float64(fma(Float64(R / phi2), -1.0, Float64(R / phi1)) * phi1) * phi2);
	else
		tmp = Float64(R * Float64(phi2 - phi1));
	end
	return tmp
end

Wolfram

code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[N[(lambda1 - lambda2), $MachinePrecision], -1e+121], N[(N[(N[(N[(R / phi2), $MachinePrecision] * -1.0 + N[(R / phi1), $MachinePrecision]), $MachinePrecision] * phi1), $MachinePrecision] * phi2), $MachinePrecision], N[(R * N[(phi2 - phi1), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (-.f64 lambda1 lambda2) < -1.00000000000000004e121

   1. Initial program 41.6%

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

   3. Taylor expanded in phi2 around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(\frac{R \cdot \phi_1}{\phi_2}, -1, R\right) \cdot \phi_2 \]

      6. lower-/.f64 N/A

         \[\leadsto \mathsf{fma}\left(\frac{R \cdot \phi_1}{\phi_2}, -1, R\right) \cdot \phi_2 \]

      7. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(\frac{\phi_1 \cdot R}{\phi_2}, -1, R\right) \cdot \phi_2 \]

      8. lower-*.f64 20.2

         \[\leadsto \mathsf{fma}\left(\frac{\phi_1 \cdot R}{\phi_2}, -1, R\right) \cdot \phi_2 \]

   5. Applied rewrites 20.2%

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

   6. Taylor expanded in phi1 around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-fma.f64 N/A

         \[\leadsto \left(\mathsf{fma}\left(\frac{R}{\phi_2}, -1, \frac{R}{\phi_1}\right) \cdot \phi_1\right) \cdot \phi_2 \]

      5. lower-/.f64 N/A

         \[\leadsto \left(\mathsf{fma}\left(\frac{R}{\phi_2}, -1, \frac{R}{\phi_1}\right) \cdot \phi_1\right) \cdot \phi_2 \]

      6. lower-/.f64 21.7

         \[\leadsto \left(\mathsf{fma}\left(\frac{R}{\phi_2}, -1, \frac{R}{\phi_1}\right) \cdot \phi_1\right) \cdot \phi_2 \]

   8. Applied rewrites 21.7%

      \[\leadsto \left(\mathsf{fma}\left(\frac{R}{\phi_2}, -1, \frac{R}{\phi_1}\right) \cdot \phi_1\right) \cdot \phi_2 \]

   if -1.00000000000000004e121 < (-.f64 lambda1 lambda2)

   1. Initial program 71.4%

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

   3. Taylor expanded in phi2 around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(\frac{R \cdot \phi_1}{\phi_2}, -1, R\right) \cdot \phi_2 \]

      6. lower-/.f64 N/A

         \[\leadsto \mathsf{fma}\left(\frac{R \cdot \phi_1}{\phi_2}, -1, R\right) \cdot \phi_2 \]

      7. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(\frac{\phi_1 \cdot R}{\phi_2}, -1, R\right) \cdot \phi_2 \]

      8. lower-*.f64 36.4

         \[\leadsto \mathsf{fma}\left(\frac{\phi_1 \cdot R}{\phi_2}, -1, R\right) \cdot \phi_2 \]

   5. Applied rewrites 36.4%

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

   6. Taylor expanded in phi1 around 0

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

      1. associate-*r* N/A

         \[\leadsto \left(-1 \cdot R\right) \cdot \phi_1 + R \cdot \phi_2 \]

      2. mul-1-neg N/A

         \[\leadsto \left(\mathsf{neg}\left(R\right)\right) \cdot \phi_1 + R \cdot \phi_2 \]

      3. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(\mathsf{neg}\left(R\right), \phi_1, R \cdot \phi_2\right) \]

      4. lower-neg.f64 N/A

         \[\leadsto \mathsf{fma}\left(-R, \phi_1, R \cdot \phi_2\right) \]

      5. lower-*.f64 34.9

         \[\leadsto \mathsf{fma}\left(-R, \phi_1, R \cdot \phi_2\right) \]

   8. Applied rewrites 34.9%

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

   9. Taylor expanded in R around 0

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

       1. lower-*.f64 N/A

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

       2. lower-+.f64 N/A

          \[\leadsto R \cdot \left(\phi_2 + -1 \cdot \phi_1\right) \]

       3. lower-*.f64 35.4

          \[\leadsto R \cdot \left(\phi_2 + -1 \cdot \phi_1\right) \]

   11. Applied rewrites 35.4%

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

4. Final simplification 32.2%

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

Alternative 8: 29.7% accurate, 6.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\lambda_1 - \lambda_2 \leq -1.08 \cdot 10^{+231}:\\ \;\;\;\;\left(-\phi_1\right) \cdot \mathsf{fma}\left(\phi_2 \cdot \frac{R}{\phi_1}, -1, R\right)\\ \mathbf{elif}\;\lambda_1 - \lambda_2 \leq -2.4 \cdot 10^{+176}:\\ \;\;\;\;\mathsf{fma}\left(\phi_1 \cdot \frac{R}{\phi_2}, -1, R\right) \cdot \phi_2\\ \mathbf{else}:\\ \;\;\;\;R \cdot \left(\phi_2 - \phi_1\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (R lambda1 lambda2 phi1 phi2)
 :precision binary64
 (if (<= (- lambda1 lambda2) -1.08e+231)
   (* (- phi1) (fma (* phi2 (/ R phi1)) -1.0 R))
   (if (<= (- lambda1 lambda2) -2.4e+176)
     (* (fma (* phi1 (/ R phi2)) -1.0 R) phi2)
     (* R (- phi2 phi1)))))

C

double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	double tmp;
	if ((lambda1 - lambda2) <= -1.08e+231) {
		tmp = -phi1 * fma((phi2 * (R / phi1)), -1.0, R);
	} else if ((lambda1 - lambda2) <= -2.4e+176) {
		tmp = fma((phi1 * (R / phi2)), -1.0, R) * phi2;
	} else {
		tmp = R * (phi2 - phi1);
	}
	return tmp;
}

Julia

function code(R, lambda1, lambda2, phi1, phi2)
	tmp = 0.0
	if (Float64(lambda1 - lambda2) <= -1.08e+231)
		tmp = Float64(Float64(-phi1) * fma(Float64(phi2 * Float64(R / phi1)), -1.0, R));
	elseif (Float64(lambda1 - lambda2) <= -2.4e+176)
		tmp = Float64(fma(Float64(phi1 * Float64(R / phi2)), -1.0, R) * phi2);
	else
		tmp = Float64(R * Float64(phi2 - phi1));
	end
	return tmp
end

Wolfram

code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[N[(lambda1 - lambda2), $MachinePrecision], -1.08e+231], N[((-phi1) * N[(N[(phi2 * N[(R / phi1), $MachinePrecision]), $MachinePrecision] * -1.0 + R), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(lambda1 - lambda2), $MachinePrecision], -2.4e+176], N[(N[(N[(phi1 * N[(R / phi2), $MachinePrecision]), $MachinePrecision] * -1.0 + R), $MachinePrecision] * phi2), $MachinePrecision], N[(R * N[(phi2 - phi1), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if (-.f64 lambda1 lambda2) < -1.08000000000000001e231

   1. Initial program 36.8%

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

   3. Taylor expanded in phi1 around -inf

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

      1. associate-*r* N/A

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

      2. mul-1-neg N/A

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

      3. lower-*.f64 N/A

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

      4. lower-neg.f64 N/A

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

      5. +-commutative N/A

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

      6. *-commutative N/A

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

      7. lower-fma.f64 N/A

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

      8. lower-/.f64 N/A

         \[\leadsto \left(-\phi_1\right) \cdot \mathsf{fma}\left(\frac{R \cdot \phi_2}{\phi_1}, -1, R\right) \]

      9. *-commutative N/A

         \[\leadsto \left(-\phi_1\right) \cdot \mathsf{fma}\left(\frac{\phi_2 \cdot R}{\phi_1}, -1, R\right) \]

      10. lower-*.f64 25.2

          \[\leadsto \left(-\phi_1\right) \cdot \mathsf{fma}\left(\frac{\phi_2 \cdot R}{\phi_1}, -1, R\right) \]

   5. Applied rewrites 25.2%

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

      1. lift-*.f64 N/A

         \[\leadsto \left(-\phi_1\right) \cdot \mathsf{fma}\left(\frac{\phi_2 \cdot R}{\phi_1}, -1, R\right) \]

      2. lift-/.f64 N/A

         \[\leadsto \left(-\phi_1\right) \cdot \mathsf{fma}\left(\frac{\phi_2 \cdot R}{\phi_1}, -1, R\right) \]

      3. associate-/l* N/A

         \[\leadsto \left(-\phi_1\right) \cdot \mathsf{fma}\left(\phi_2 \cdot \frac{R}{\phi_1}, -1, R\right) \]

      4. lower-*.f64 N/A

         \[\leadsto \left(-\phi_1\right) \cdot \mathsf{fma}\left(\phi_2 \cdot \frac{R}{\phi_1}, -1, R\right) \]

      5. lower-/.f64 28.6

         \[\leadsto \left(-\phi_1\right) \cdot \mathsf{fma}\left(\phi_2 \cdot \frac{R}{\phi_1}, -1, R\right) \]

   7. Applied rewrites 28.6%

      \[\leadsto \left(-\phi_1\right) \cdot \mathsf{fma}\left(\phi_2 \cdot \frac{R}{\phi_1}, -1, R\right) \]

   if -1.08000000000000001e231 < (-.f64 lambda1 lambda2) < -2.4000000000000001e176

   1. Initial program 52.6%

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

   3. Taylor expanded in phi2 around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(\frac{R \cdot \phi_1}{\phi_2}, -1, R\right) \cdot \phi_2 \]

      6. lower-/.f64 N/A

         \[\leadsto \mathsf{fma}\left(\frac{R \cdot \phi_1}{\phi_2}, -1, R\right) \cdot \phi_2 \]

      7. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(\frac{\phi_1 \cdot R}{\phi_2}, -1, R\right) \cdot \phi_2 \]

      8. lower-*.f64 31.4

         \[\leadsto \mathsf{fma}\left(\frac{\phi_1 \cdot R}{\phi_2}, -1, R\right) \cdot \phi_2 \]

   5. Applied rewrites 31.4%

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

      1. lift-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(\frac{\phi_1 \cdot R}{\phi_2}, -1, R\right) \cdot \phi_2 \]

      2. lift-/.f64 N/A

         \[\leadsto \mathsf{fma}\left(\frac{\phi_1 \cdot R}{\phi_2}, -1, R\right) \cdot \phi_2 \]

      3. associate-/l* N/A

         \[\leadsto \mathsf{fma}\left(\phi_1 \cdot \frac{R}{\phi_2}, -1, R\right) \cdot \phi_2 \]

      4. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(\phi_1 \cdot \frac{R}{\phi_2}, -1, R\right) \cdot \phi_2 \]

      5. lower-/.f64 41.4

         \[\leadsto \mathsf{fma}\left(\phi_1 \cdot \frac{R}{\phi_2}, -1, R\right) \cdot \phi_2 \]

   7. Applied rewrites 41.4%

      \[\leadsto \mathsf{fma}\left(\phi_1 \cdot \frac{R}{\phi_2}, -1, R\right) \cdot \phi_2 \]

   if -2.4000000000000001e176 < (-.f64 lambda1 lambda2)

   1. Initial program 68.8%

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

   3. Taylor expanded in phi2 around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(\frac{R \cdot \phi_1}{\phi_2}, -1, R\right) \cdot \phi_2 \]

      6. lower-/.f64 N/A

         \[\leadsto \mathsf{fma}\left(\frac{R \cdot \phi_1}{\phi_2}, -1, R\right) \cdot \phi_2 \]

      7. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(\frac{\phi_1 \cdot R}{\phi_2}, -1, R\right) \cdot \phi_2 \]

      8. lower-*.f64 34.6

         \[\leadsto \mathsf{fma}\left(\frac{\phi_1 \cdot R}{\phi_2}, -1, R\right) \cdot \phi_2 \]

   5. Applied rewrites 34.6%

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

   6. Taylor expanded in phi1 around 0

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

      1. associate-*r* N/A

         \[\leadsto \left(-1 \cdot R\right) \cdot \phi_1 + R \cdot \phi_2 \]

      2. mul-1-neg N/A

         \[\leadsto \left(\mathsf{neg}\left(R\right)\right) \cdot \phi_1 + R \cdot \phi_2 \]

      3. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(\mathsf{neg}\left(R\right), \phi_1, R \cdot \phi_2\right) \]

      4. lower-neg.f64 N/A

         \[\leadsto \mathsf{fma}\left(-R, \phi_1, R \cdot \phi_2\right) \]

      5. lower-*.f64 33.2

         \[\leadsto \mathsf{fma}\left(-R, \phi_1, R \cdot \phi_2\right) \]

   8. Applied rewrites 33.2%

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

   9. Taylor expanded in R around 0

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

       1. lower-*.f64 N/A

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

       2. lower-+.f64 N/A

          \[\leadsto R \cdot \left(\phi_2 + -1 \cdot \phi_1\right) \]

       3. lower-*.f64 33.7

          \[\leadsto R \cdot \left(\phi_2 + -1 \cdot \phi_1\right) \]

   11. Applied rewrites 33.7%

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

4. Final simplification 33.4%

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

Alternative 9: 29.5% accurate, 7.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\lambda_1 - \lambda_2 \leq -7.5 \cdot 10^{+153}:\\ \;\;\;\;\left(-\phi_2\right) \cdot \mathsf{fma}\left(R, \frac{\phi_1}{\phi_2}, -R\right)\\ \mathbf{else}:\\ \;\;\;\;R \cdot \left(\phi_2 - \phi_1\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (R lambda1 lambda2 phi1 phi2)
 :precision binary64
 (if (<= (- lambda1 lambda2) -7.5e+153)
   (* (- phi2) (fma R (/ phi1 phi2) (- R)))
   (* R (- phi2 phi1))))

C

double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	double tmp;
	if ((lambda1 - lambda2) <= -7.5e+153) {
		tmp = -phi2 * fma(R, (phi1 / phi2), -R);
	} else {
		tmp = R * (phi2 - phi1);
	}
	return tmp;
}

Julia

function code(R, lambda1, lambda2, phi1, phi2)
	tmp = 0.0
	if (Float64(lambda1 - lambda2) <= -7.5e+153)
		tmp = Float64(Float64(-phi2) * fma(R, Float64(phi1 / phi2), Float64(-R)));
	else
		tmp = Float64(R * Float64(phi2 - phi1));
	end
	return tmp
end

Wolfram

code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[N[(lambda1 - lambda2), $MachinePrecision], -7.5e+153], N[((-phi2) * N[(R * N[(phi1 / phi2), $MachinePrecision] + (-R)), $MachinePrecision]), $MachinePrecision], N[(R * N[(phi2 - phi1), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (-.f64 lambda1 lambda2) < -7.50000000000000065e153

   1. Initial program 40.4%

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

   3. Taylor expanded in phi1 around -inf

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

      1. associate-*r* N/A

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

      2. mul-1-neg N/A

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

      3. lower-*.f64 N/A

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

      4. lower-neg.f64 N/A

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

      5. +-commutative N/A

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

      6. *-commutative N/A

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

      7. lower-fma.f64 N/A

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

      8. lower-/.f64 N/A

         \[\leadsto \left(-\phi_1\right) \cdot \mathsf{fma}\left(\frac{R \cdot \phi_2}{\phi_1}, -1, R\right) \]

      9. *-commutative N/A

         \[\leadsto \left(-\phi_1\right) \cdot \mathsf{fma}\left(\frac{\phi_2 \cdot R}{\phi_1}, -1, R\right) \]

      10. lower-*.f64 21.6

          \[\leadsto \left(-\phi_1\right) \cdot \mathsf{fma}\left(\frac{\phi_2 \cdot R}{\phi_1}, -1, R\right) \]

   5. Applied rewrites 21.6%

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

   6. Taylor expanded in phi2 around -inf

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

      1. associate-*r* N/A

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

      2. mul-1-neg N/A

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

      3. lower-*.f64 N/A

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

      4. lower-neg.f64 N/A

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

      5. mul-1-neg N/A

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

      6. +-commutative N/A

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

      7. associate-/l* N/A

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

      8. lower-fma.f64 N/A

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

      9. lower-/.f64 N/A

         \[\leadsto \left(-\phi_2\right) \cdot \mathsf{fma}\left(R, \frac{\phi_1}{\phi_2}, \mathsf{neg}\left(R\right)\right) \]

      10. lower-neg.f64 21.6

          \[\leadsto \left(-\phi_2\right) \cdot \mathsf{fma}\left(R, \frac{\phi_1}{\phi_2}, -R\right) \]

   8. Applied rewrites 21.6%

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

   if -7.50000000000000065e153 < (-.f64 lambda1 lambda2)

   1. Initial program 70.4%

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

   3. Taylor expanded in phi2 around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(\frac{R \cdot \phi_1}{\phi_2}, -1, R\right) \cdot \phi_2 \]

      6. lower-/.f64 N/A

         \[\leadsto \mathsf{fma}\left(\frac{R \cdot \phi_1}{\phi_2}, -1, R\right) \cdot \phi_2 \]

      7. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(\frac{\phi_1 \cdot R}{\phi_2}, -1, R\right) \cdot \phi_2 \]

      8. lower-*.f64 35.8

         \[\leadsto \mathsf{fma}\left(\frac{\phi_1 \cdot R}{\phi_2}, -1, R\right) \cdot \phi_2 \]

   5. Applied rewrites 35.8%

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

   6. Taylor expanded in phi1 around 0

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

      1. associate-*r* N/A

         \[\leadsto \left(-1 \cdot R\right) \cdot \phi_1 + R \cdot \phi_2 \]

      2. mul-1-neg N/A

         \[\leadsto \left(\mathsf{neg}\left(R\right)\right) \cdot \phi_1 + R \cdot \phi_2 \]

      3. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(\mathsf{neg}\left(R\right), \phi_1, R \cdot \phi_2\right) \]

      4. lower-neg.f64 N/A

         \[\leadsto \mathsf{fma}\left(-R, \phi_1, R \cdot \phi_2\right) \]

      5. lower-*.f64 34.4

         \[\leadsto \mathsf{fma}\left(-R, \phi_1, R \cdot \phi_2\right) \]

   8. Applied rewrites 34.4%

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

   9. Taylor expanded in R around 0

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

       1. lower-*.f64 N/A

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

       2. lower-+.f64 N/A

          \[\leadsto R \cdot \left(\phi_2 + -1 \cdot \phi_1\right) \]

       3. lower-*.f64 34.9

          \[\leadsto R \cdot \left(\phi_2 + -1 \cdot \phi_1\right) \]

   11. Applied rewrites 34.9%

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

4. Final simplification 32.3%

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

Alternative 10: 30.3% accurate, 8.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\phi_1 \leq -1.5 \cdot 10^{-21}:\\ \;\;\;\;R \cdot \left(\phi_2 - \phi_1\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\phi_1 \cdot \frac{R}{\phi_2}, -1, R\right) \cdot \phi_2\\ \end{array} \end{array} \]

FPCore

(FPCore (R lambda1 lambda2 phi1 phi2)
 :precision binary64
 (if (<= phi1 -1.5e-21)
   (* R (- phi2 phi1))
   (* (fma (* phi1 (/ R phi2)) -1.0 R) phi2)))

C

double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	double tmp;
	if (phi1 <= -1.5e-21) {
		tmp = R * (phi2 - phi1);
	} else {
		tmp = fma((phi1 * (R / phi2)), -1.0, R) * phi2;
	}
	return tmp;
}

Julia

function code(R, lambda1, lambda2, phi1, phi2)
	tmp = 0.0
	if (phi1 <= -1.5e-21)
		tmp = Float64(R * Float64(phi2 - phi1));
	else
		tmp = Float64(fma(Float64(phi1 * Float64(R / phi2)), -1.0, R) * phi2);
	end
	return tmp
end

Wolfram

code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi1, -1.5e-21], N[(R * N[(phi2 - phi1), $MachinePrecision]), $MachinePrecision], N[(N[(N[(phi1 * N[(R / phi2), $MachinePrecision]), $MachinePrecision] * -1.0 + R), $MachinePrecision] * phi2), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if phi1 < -1.49999999999999996e-21

   1. Initial program 55.1%

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

   3. Taylor expanded in phi2 around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(\frac{R \cdot \phi_1}{\phi_2}, -1, R\right) \cdot \phi_2 \]

      6. lower-/.f64 N/A

         \[\leadsto \mathsf{fma}\left(\frac{R \cdot \phi_1}{\phi_2}, -1, R\right) \cdot \phi_2 \]

      7. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(\frac{\phi_1 \cdot R}{\phi_2}, -1, R\right) \cdot \phi_2 \]

      8. lower-*.f64 63.2

         \[\leadsto \mathsf{fma}\left(\frac{\phi_1 \cdot R}{\phi_2}, -1, R\right) \cdot \phi_2 \]

   5. Applied rewrites 63.2%

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

   6. Taylor expanded in phi1 around 0

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

      1. associate-*r* N/A

         \[\leadsto \left(-1 \cdot R\right) \cdot \phi_1 + R \cdot \phi_2 \]

      2. mul-1-neg N/A

         \[\leadsto \left(\mathsf{neg}\left(R\right)\right) \cdot \phi_1 + R \cdot \phi_2 \]

      3. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(\mathsf{neg}\left(R\right), \phi_1, R \cdot \phi_2\right) \]

      4. lower-neg.f64 N/A

         \[\leadsto \mathsf{fma}\left(-R, \phi_1, R \cdot \phi_2\right) \]

      5. lower-*.f64 60.4

         \[\leadsto \mathsf{fma}\left(-R, \phi_1, R \cdot \phi_2\right) \]

   8. Applied rewrites 60.4%

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

   9. Taylor expanded in R around 0

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

       1. lower-*.f64 N/A

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

       2. lower-+.f64 N/A

          \[\leadsto R \cdot \left(\phi_2 + -1 \cdot \phi_1\right) \]

       3. lower-*.f64 63.1

          \[\leadsto R \cdot \left(\phi_2 + -1 \cdot \phi_1\right) \]

   11. Applied rewrites 63.1%

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

   if -1.49999999999999996e-21 < phi1

   1. Initial program 68.1%

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

   3. Taylor expanded in phi2 around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(\frac{R \cdot \phi_1}{\phi_2}, -1, R\right) \cdot \phi_2 \]

      6. lower-/.f64 N/A

         \[\leadsto \mathsf{fma}\left(\frac{R \cdot \phi_1}{\phi_2}, -1, R\right) \cdot \phi_2 \]

      7. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(\frac{\phi_1 \cdot R}{\phi_2}, -1, R\right) \cdot \phi_2 \]

      8. lower-*.f64 20.7

         \[\leadsto \mathsf{fma}\left(\frac{\phi_1 \cdot R}{\phi_2}, -1, R\right) \cdot \phi_2 \]

   5. Applied rewrites 20.7%

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

      1. lift-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(\frac{\phi_1 \cdot R}{\phi_2}, -1, R\right) \cdot \phi_2 \]

      2. lift-/.f64 N/A

         \[\leadsto \mathsf{fma}\left(\frac{\phi_1 \cdot R}{\phi_2}, -1, R\right) \cdot \phi_2 \]

      3. associate-/l* N/A

         \[\leadsto \mathsf{fma}\left(\phi_1 \cdot \frac{R}{\phi_2}, -1, R\right) \cdot \phi_2 \]

      4. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(\phi_1 \cdot \frac{R}{\phi_2}, -1, R\right) \cdot \phi_2 \]

      5. lower-/.f64 24.4

         \[\leadsto \mathsf{fma}\left(\phi_1 \cdot \frac{R}{\phi_2}, -1, R\right) \cdot \phi_2 \]

   7. Applied rewrites 24.4%

      \[\leadsto \mathsf{fma}\left(\phi_1 \cdot \frac{R}{\phi_2}, -1, R\right) \cdot \phi_2 \]
3. Recombined 2 regimes into one program.

4. Final simplification 35.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\phi_1 \leq -1.5 \cdot 10^{-21}:\\ \;\;\;\;R \cdot \left(\phi_2 - \phi_1\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\phi_1 \cdot \frac{R}{\phi_2}, -1, R\right) \cdot \phi_2\\ \end{array} \]
5. Add Preprocessing

Alternative 11: 30.3% accurate, 9.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\phi_2 \leq 8.6 \cdot 10^{+48}:\\ \;\;\;\;\mathsf{fma}\left(R, \frac{\phi_2}{\phi_1}, -R\right) \cdot \phi_1\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(-R, \phi_1, R \cdot \phi_2\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (R lambda1 lambda2 phi1 phi2)
 :precision binary64
 (if (<= phi2 8.6e+48)
   (* (fma R (/ phi2 phi1) (- R)) phi1)
   (fma (- R) phi1 (* R phi2))))

C

double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	double tmp;
	if (phi2 <= 8.6e+48) {
		tmp = fma(R, (phi2 / phi1), -R) * phi1;
	} else {
		tmp = fma(-R, phi1, (R * phi2));
	}
	return tmp;
}

Julia

function code(R, lambda1, lambda2, phi1, phi2)
	tmp = 0.0
	if (phi2 <= 8.6e+48)
		tmp = Float64(fma(R, Float64(phi2 / phi1), Float64(-R)) * phi1);
	else
		tmp = fma(Float64(-R), phi1, Float64(R * phi2));
	end
	return tmp
end

Wolfram

code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, 8.6e+48], N[(N[(R * N[(phi2 / phi1), $MachinePrecision] + (-R)), $MachinePrecision] * phi1), $MachinePrecision], N[((-R) * phi1 + N[(R * phi2), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if phi2 < 8.59999999999999957e48

   1. Initial program 66.2%

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

   3. Taylor expanded in phi1 around -inf

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

      1. associate-*r* N/A

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

      2. mul-1-neg N/A

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

      3. lower-*.f64 N/A

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

      4. lower-neg.f64 N/A

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

      5. +-commutative N/A

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

      6. *-commutative N/A

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

      7. lower-fma.f64 N/A

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

      8. lower-/.f64 N/A

         \[\leadsto \left(-\phi_1\right) \cdot \mathsf{fma}\left(\frac{R \cdot \phi_2}{\phi_1}, -1, R\right) \]

      9. *-commutative N/A

         \[\leadsto \left(-\phi_1\right) \cdot \mathsf{fma}\left(\frac{\phi_2 \cdot R}{\phi_1}, -1, R\right) \]

      10. lower-*.f64 19.4

          \[\leadsto \left(-\phi_1\right) \cdot \mathsf{fma}\left(\frac{\phi_2 \cdot R}{\phi_1}, -1, R\right) \]

   5. Applied rewrites 19.4%

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

   6. Taylor expanded in phi1 around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. mul-1-neg N/A

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

      4. +-commutative N/A

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

      5. associate-/l* N/A

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

      6. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(R, \frac{\phi_2}{\phi_1}, \mathsf{neg}\left(R\right)\right) \cdot \phi_1 \]

      7. lower-/.f64 N/A

         \[\leadsto \mathsf{fma}\left(R, \frac{\phi_2}{\phi_1}, \mathsf{neg}\left(R\right)\right) \cdot \phi_1 \]

      8. lower-neg.f64 20.3

         \[\leadsto \mathsf{fma}\left(R, \frac{\phi_2}{\phi_1}, -R\right) \cdot \phi_1 \]

   8. Applied rewrites 20.3%

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

   if 8.59999999999999957e48 < phi2

   1. Initial program 58.0%

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

   3. Taylor expanded in phi1 around -inf

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

      1. associate-*r* N/A

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

      2. mul-1-neg N/A

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

      3. lower-*.f64 N/A

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

      4. lower-neg.f64 N/A

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

      5. +-commutative N/A

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

      6. *-commutative N/A

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

      7. lower-fma.f64 N/A

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

      8. lower-/.f64 N/A

         \[\leadsto \left(-\phi_1\right) \cdot \mathsf{fma}\left(\frac{R \cdot \phi_2}{\phi_1}, -1, R\right) \]

      9. *-commutative N/A

         \[\leadsto \left(-\phi_1\right) \cdot \mathsf{fma}\left(\frac{\phi_2 \cdot R}{\phi_1}, -1, R\right) \]

      10. lower-*.f64 66.3

          \[\leadsto \left(-\phi_1\right) \cdot \mathsf{fma}\left(\frac{\phi_2 \cdot R}{\phi_1}, -1, R\right) \]

   5. Applied rewrites 66.3%

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

   6. Taylor expanded in phi1 around 0

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

      1. associate-*r* N/A

         \[\leadsto \left(-1 \cdot R\right) \cdot \phi_1 + R \cdot \phi_2 \]

      2. mul-1-neg N/A

         \[\leadsto \left(\mathsf{neg}\left(R\right)\right) \cdot \phi_1 + R \cdot \phi_2 \]

      3. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(\mathsf{neg}\left(R\right), \phi_1, R \cdot \phi_2\right) \]

      4. lower-neg.f64 N/A

         \[\leadsto \mathsf{fma}\left(-R, \phi_1, R \cdot \phi_2\right) \]

      5. lower-*.f64 77.9

         \[\leadsto \mathsf{fma}\left(-R, \phi_1, R \cdot \phi_2\right) \]

   8. Applied rewrites 77.9%

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

Alternative 12: 30.7% accurate, 13.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\phi_2 \leq -4 \cdot 10^{-46}:\\ \;\;\;\;R \cdot \left(-\phi_1\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(-R, \phi_1, R \cdot \phi_2\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (R lambda1 lambda2 phi1 phi2)
 :precision binary64
 (if (<= phi2 -4e-46) (* R (- phi1)) (fma (- R) phi1 (* R phi2))))

C

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

Julia

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

Wolfram

code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, -4e-46], N[(R * (-phi1)), $MachinePrecision], N[((-R) * phi1 + N[(R * phi2), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if phi2 < -4.00000000000000009e-46

   1. Initial program 63.1%

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

   3. Taylor expanded in phi1 around -inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 17.7

         \[\leadsto R \cdot \left(-\phi_1\right) \]

   5. Applied rewrites 17.7%

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

   if -4.00000000000000009e-46 < phi2

   1. Initial program 65.0%

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

   3. Taylor expanded in phi1 around -inf

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

      1. associate-*r* N/A

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

      2. mul-1-neg N/A

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

      3. lower-*.f64 N/A

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

      4. lower-neg.f64 N/A

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

      5. +-commutative N/A

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

      6. *-commutative N/A

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

      7. lower-fma.f64 N/A

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

      8. lower-/.f64 N/A

         \[\leadsto \left(-\phi_1\right) \cdot \mathsf{fma}\left(\frac{R \cdot \phi_2}{\phi_1}, -1, R\right) \]

      9. *-commutative N/A

         \[\leadsto \left(-\phi_1\right) \cdot \mathsf{fma}\left(\frac{\phi_2 \cdot R}{\phi_1}, -1, R\right) \]

      10. lower-*.f64 37.9

          \[\leadsto \left(-\phi_1\right) \cdot \mathsf{fma}\left(\frac{\phi_2 \cdot R}{\phi_1}, -1, R\right) \]

   5. Applied rewrites 37.9%

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

   6. Taylor expanded in phi1 around 0

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

      1. associate-*r* N/A

         \[\leadsto \left(-1 \cdot R\right) \cdot \phi_1 + R \cdot \phi_2 \]

      2. mul-1-neg N/A

         \[\leadsto \left(\mathsf{neg}\left(R\right)\right) \cdot \phi_1 + R \cdot \phi_2 \]

      3. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(\mathsf{neg}\left(R\right), \phi_1, R \cdot \phi_2\right) \]

      4. lower-neg.f64 N/A

         \[\leadsto \mathsf{fma}\left(-R, \phi_1, R \cdot \phi_2\right) \]

      5. lower-*.f64 39.9

         \[\leadsto \mathsf{fma}\left(-R, \phi_1, R \cdot \phi_2\right) \]

   8. Applied rewrites 39.9%

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

Alternative 13: 27.7% accurate, 19.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\phi_1 \leq -2.3 \cdot 10^{-112}:\\ \;\;\;\;R \cdot \left(-\phi_1\right)\\ \mathbf{else}:\\ \;\;\;\;R \cdot \phi_2\\ \end{array} \end{array} \]

FPCore

(FPCore (R lambda1 lambda2 phi1 phi2)
 :precision binary64
 (if (<= phi1 -2.3e-112) (* R (- phi1)) (* R phi2)))

C

double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
	double tmp;
	if (phi1 <= -2.3e-112) {
		tmp = R * -phi1;
	} else {
		tmp = R * phi2;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(r, lambda1, lambda2, phi1, phi2)
use fmin_fmax_functions
    real(8), intent (in) :: r
    real(8), intent (in) :: lambda1
    real(8), intent (in) :: lambda2
    real(8), intent (in) :: phi1
    real(8), intent (in) :: phi2
    real(8) :: tmp
    if (phi1 <= (-2.3d-112)) then
        tmp = r * -phi1
    else
        tmp = r * phi2
    end if
    code = tmp
end function

Java

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

Python

def code(R, lambda1, lambda2, phi1, phi2):
	tmp = 0
	if phi1 <= -2.3e-112:
		tmp = R * -phi1
	else:
		tmp = R * phi2
	return tmp

Julia

function code(R, lambda1, lambda2, phi1, phi2)
	tmp = 0.0
	if (phi1 <= -2.3e-112)
		tmp = Float64(R * Float64(-phi1));
	else
		tmp = Float64(R * phi2);
	end
	return tmp
end

MATLAB

function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
	tmp = 0.0;
	if (phi1 <= -2.3e-112)
		tmp = R * -phi1;
	else
		tmp = R * phi2;
	end
	tmp_2 = tmp;
end

Wolfram

code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi1, -2.3e-112], N[(R * (-phi1)), $MachinePrecision], N[(R * phi2), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if phi1 < -2.29999999999999991e-112

   1. Initial program 61.9%

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

   3. Taylor expanded in phi1 around -inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 50.3

         \[\leadsto R \cdot \left(-\phi_1\right) \]

   5. Applied rewrites 50.3%

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

   if -2.29999999999999991e-112 < phi1

   1. Initial program 65.9%

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

   3. Taylor expanded in phi2 around inf

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

   5. Applied rewrites 19.0%

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

Alternative 14: 29.1% accurate, 31.0× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(r, lambda1, lambda2, phi1, phi2)
use fmin_fmax_functions
    real(8), intent (in) :: r
    real(8), intent (in) :: lambda1
    real(8), intent (in) :: lambda2
    real(8), intent (in) :: phi1
    real(8), intent (in) :: phi2
    code = r * (phi2 - phi1)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 64.4%

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

3. Taylor expanded in phi2 around inf

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

   1. *-commutative N/A

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

   2. lower-*.f64 N/A

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

   3. +-commutative N/A

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

   4. *-commutative N/A

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

   5. lower-fma.f64 N/A

      \[\leadsto \mathsf{fma}\left(\frac{R \cdot \phi_1}{\phi_2}, -1, R\right) \cdot \phi_2 \]

   6. lower-/.f64 N/A

      \[\leadsto \mathsf{fma}\left(\frac{R \cdot \phi_1}{\phi_2}, -1, R\right) \cdot \phi_2 \]

   7. *-commutative N/A

      \[\leadsto \mathsf{fma}\left(\frac{\phi_1 \cdot R}{\phi_2}, -1, R\right) \cdot \phi_2 \]

   8. lower-*.f64 32.6

      \[\leadsto \mathsf{fma}\left(\frac{\phi_1 \cdot R}{\phi_2}, -1, R\right) \cdot \phi_2 \]

5. Applied rewrites 32.6%

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

6. Taylor expanded in phi1 around 0

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

   1. associate-*r* N/A

      \[\leadsto \left(-1 \cdot R\right) \cdot \phi_1 + R \cdot \phi_2 \]

   2. mul-1-neg N/A

      \[\leadsto \left(\mathsf{neg}\left(R\right)\right) \cdot \phi_1 + R \cdot \phi_2 \]

   3. lower-fma.f64 N/A

      \[\leadsto \mathsf{fma}\left(\mathsf{neg}\left(R\right), \phi_1, R \cdot \phi_2\right) \]

   4. lower-neg.f64 N/A

      \[\leadsto \mathsf{fma}\left(-R, \phi_1, R \cdot \phi_2\right) \]

   5. lower-*.f64 31.1

      \[\leadsto \mathsf{fma}\left(-R, \phi_1, R \cdot \phi_2\right) \]

8. Applied rewrites 31.1%

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

9. Taylor expanded in R around 0

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

    1. lower-*.f64 N/A

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

    2. lower-+.f64 N/A

       \[\leadsto R \cdot \left(\phi_2 + -1 \cdot \phi_1\right) \]

    3. lower-*.f64 31.9

       \[\leadsto R \cdot \left(\phi_2 + -1 \cdot \phi_1\right) \]

11. Applied rewrites 31.9%

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

12. Final simplification 31.9%

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

Alternative 15: 17.5% accurate, 46.5× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(r, lambda1, lambda2, phi1, phi2)
use fmin_fmax_functions
    real(8), intent (in) :: r
    real(8), intent (in) :: lambda1
    real(8), intent (in) :: lambda2
    real(8), intent (in) :: phi1
    real(8), intent (in) :: phi2
    code = r * phi2
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 64.4%

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

3. Taylor expanded in phi2 around inf

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

5. Applied rewrites 17.5%

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

Reproduce

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