1/2(abs(p)+abs(r) - sqrt((p-r)^2 + 4q^2))

Percentage Accurate: 24.5% → 58.5%

Time: 6.0s

Alternatives: 7

Speedup: 27.7×

Specification

Math

\[\begin{array}{l} \\ \frac{1}{2} \cdot \left(\left(\left|p\right| + \left|r\right|\right) - \sqrt{{\left(p - r\right)}^{2} + 4 \cdot {q}^{2}}\right) \end{array} \]

FPCore

(FPCore (p r q)
 :precision binary64
 (*
  (/ 1.0 2.0)
  (- (+ (fabs p) (fabs r)) (sqrt (+ (pow (- p r) 2.0) (* 4.0 (pow q 2.0)))))))

C

double code(double p, double r, double q) {
	return (1.0 / 2.0) * ((fabs(p) + fabs(r)) - sqrt((pow((p - r), 2.0) + (4.0 * pow(q, 2.0)))));
}

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(p, r, q)
use fmin_fmax_functions
    real(8), intent (in) :: p
    real(8), intent (in) :: r
    real(8), intent (in) :: q
    code = (1.0d0 / 2.0d0) * ((abs(p) + abs(r)) - sqrt((((p - r) ** 2.0d0) + (4.0d0 * (q ** 2.0d0)))))
end function

Java

public static double code(double p, double r, double q) {
	return (1.0 / 2.0) * ((Math.abs(p) + Math.abs(r)) - Math.sqrt((Math.pow((p - r), 2.0) + (4.0 * Math.pow(q, 2.0)))));
}

Python

def code(p, r, q):
	return (1.0 / 2.0) * ((math.fabs(p) + math.fabs(r)) - math.sqrt((math.pow((p - r), 2.0) + (4.0 * math.pow(q, 2.0)))))

Julia

function code(p, r, q)
	return Float64(Float64(1.0 / 2.0) * Float64(Float64(abs(p) + abs(r)) - sqrt(Float64((Float64(p - r) ^ 2.0) + Float64(4.0 * (q ^ 2.0))))))
end

MATLAB

function tmp = code(p, r, q)
	tmp = (1.0 / 2.0) * ((abs(p) + abs(r)) - sqrt((((p - r) ^ 2.0) + (4.0 * (q ^ 2.0)))));
end

Wolfram

code[p_, r_, q_] := N[(N[(1.0 / 2.0), $MachinePrecision] * N[(N[(N[Abs[p], $MachinePrecision] + N[Abs[r], $MachinePrecision]), $MachinePrecision] - N[Sqrt[N[(N[Power[N[(p - r), $MachinePrecision], 2.0], $MachinePrecision] + N[(4.0 * N[Power[q, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Initial Program: 24.5% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{1}{2} \cdot \left(\left(\left|p\right| + \left|r\right|\right) - \sqrt{{\left(p - r\right)}^{2} + 4 \cdot {q}^{2}}\right) \end{array} \]

FPCore

(FPCore (p r q)
 :precision binary64
 (*
  (/ 1.0 2.0)
  (- (+ (fabs p) (fabs r)) (sqrt (+ (pow (- p r) 2.0) (* 4.0 (pow q 2.0)))))))

C

double code(double p, double r, double q) {
	return (1.0 / 2.0) * ((fabs(p) + fabs(r)) - sqrt((pow((p - r), 2.0) + (4.0 * pow(q, 2.0)))));
}

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(p, r, q)
use fmin_fmax_functions
    real(8), intent (in) :: p
    real(8), intent (in) :: r
    real(8), intent (in) :: q
    code = (1.0d0 / 2.0d0) * ((abs(p) + abs(r)) - sqrt((((p - r) ** 2.0d0) + (4.0d0 * (q ** 2.0d0)))))
end function

Java

public static double code(double p, double r, double q) {
	return (1.0 / 2.0) * ((Math.abs(p) + Math.abs(r)) - Math.sqrt((Math.pow((p - r), 2.0) + (4.0 * Math.pow(q, 2.0)))));
}

Python

def code(p, r, q):
	return (1.0 / 2.0) * ((math.fabs(p) + math.fabs(r)) - math.sqrt((math.pow((p - r), 2.0) + (4.0 * math.pow(q, 2.0)))))

Julia

function code(p, r, q)
	return Float64(Float64(1.0 / 2.0) * Float64(Float64(abs(p) + abs(r)) - sqrt(Float64((Float64(p - r) ^ 2.0) + Float64(4.0 * (q ^ 2.0))))))
end

MATLAB

function tmp = code(p, r, q)
	tmp = (1.0 / 2.0) * ((abs(p) + abs(r)) - sqrt((((p - r) ^ 2.0) + (4.0 * (q ^ 2.0)))));
end

Wolfram

code[p_, r_, q_] := N[(N[(1.0 / 2.0), $MachinePrecision] * N[(N[(N[Abs[p], $MachinePrecision] + N[Abs[r], $MachinePrecision]), $MachinePrecision] - N[Sqrt[N[(N[Power[N[(p - r), $MachinePrecision], 2.0], $MachinePrecision] + N[(4.0 * N[Power[q, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Alternative 1: 58.5% accurate, 5.8× speedup

Math

\[\begin{array}{l} q_m = \left|q\right| \\ [p, r, q_m] = \mathsf{sort}([p, r, q_m])\\ \\ \begin{array}{l} \mathbf{if}\;q\_m \leq 4.4 \cdot 10^{-42}:\\ \;\;\;\;\left(-p\right) \cdot \frac{-0.5 \cdot \left(p + \left(\left(\left|r\right| - r\right) + \left|p\right|\right)\right)}{p}\\ \mathbf{elif}\;q\_m \leq 13500000000000:\\ \;\;\;\;\left(\frac{q\_m \cdot q\_m}{r} \cdot -2\right) \cdot 0.5\\ \mathbf{else}:\\ \;\;\;\;\left(\left(\left|r\right| + \left|p\right|\right) - \left(q\_m + q\_m\right)\right) \cdot 0.5\\ \end{array} \end{array} \]

FPCore

q_m = (fabs.f64 q)
NOTE: p, r, and q_m should be sorted in increasing order before calling this function.
(FPCore (p r q_m)
 :precision binary64
 (if (<= q_m 4.4e-42)
   (* (- p) (/ (* -0.5 (+ p (+ (- (fabs r) r) (fabs p)))) p))
   (if (<= q_m 13500000000000.0)
     (* (* (/ (* q_m q_m) r) -2.0) 0.5)
     (* (- (+ (fabs r) (fabs p)) (+ q_m q_m)) 0.5))))

C

q_m = fabs(q);
assert(p < r && r < q_m);
double code(double p, double r, double q_m) {
	double tmp;
	if (q_m <= 4.4e-42) {
		tmp = -p * ((-0.5 * (p + ((fabs(r) - r) + fabs(p)))) / p);
	} else if (q_m <= 13500000000000.0) {
		tmp = (((q_m * q_m) / r) * -2.0) * 0.5;
	} else {
		tmp = ((fabs(r) + fabs(p)) - (q_m + q_m)) * 0.5;
	}
	return tmp;
}

Fortran

q_m =     private
NOTE: p, r, and q_m should be sorted in increasing order before calling this function.
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(p, r, q_m)
use fmin_fmax_functions
    real(8), intent (in) :: p
    real(8), intent (in) :: r
    real(8), intent (in) :: q_m
    real(8) :: tmp
    if (q_m <= 4.4d-42) then
        tmp = -p * (((-0.5d0) * (p + ((abs(r) - r) + abs(p)))) / p)
    else if (q_m <= 13500000000000.0d0) then
        tmp = (((q_m * q_m) / r) * (-2.0d0)) * 0.5d0
    else
        tmp = ((abs(r) + abs(p)) - (q_m + q_m)) * 0.5d0
    end if
    code = tmp
end function

Java

q_m = Math.abs(q);
assert p < r && r < q_m;
public static double code(double p, double r, double q_m) {
	double tmp;
	if (q_m <= 4.4e-42) {
		tmp = -p * ((-0.5 * (p + ((Math.abs(r) - r) + Math.abs(p)))) / p);
	} else if (q_m <= 13500000000000.0) {
		tmp = (((q_m * q_m) / r) * -2.0) * 0.5;
	} else {
		tmp = ((Math.abs(r) + Math.abs(p)) - (q_m + q_m)) * 0.5;
	}
	return tmp;
}

Python

q_m = math.fabs(q)
[p, r, q_m] = sort([p, r, q_m])
def code(p, r, q_m):
	tmp = 0
	if q_m <= 4.4e-42:
		tmp = -p * ((-0.5 * (p + ((math.fabs(r) - r) + math.fabs(p)))) / p)
	elif q_m <= 13500000000000.0:
		tmp = (((q_m * q_m) / r) * -2.0) * 0.5
	else:
		tmp = ((math.fabs(r) + math.fabs(p)) - (q_m + q_m)) * 0.5
	return tmp

Julia

q_m = abs(q)
p, r, q_m = sort([p, r, q_m])
function code(p, r, q_m)
	tmp = 0.0
	if (q_m <= 4.4e-42)
		tmp = Float64(Float64(-p) * Float64(Float64(-0.5 * Float64(p + Float64(Float64(abs(r) - r) + abs(p)))) / p));
	elseif (q_m <= 13500000000000.0)
		tmp = Float64(Float64(Float64(Float64(q_m * q_m) / r) * -2.0) * 0.5);
	else
		tmp = Float64(Float64(Float64(abs(r) + abs(p)) - Float64(q_m + q_m)) * 0.5);
	end
	return tmp
end

MATLAB

q_m = abs(q);
p, r, q_m = num2cell(sort([p, r, q_m])){:}
function tmp_2 = code(p, r, q_m)
	tmp = 0.0;
	if (q_m <= 4.4e-42)
		tmp = -p * ((-0.5 * (p + ((abs(r) - r) + abs(p)))) / p);
	elseif (q_m <= 13500000000000.0)
		tmp = (((q_m * q_m) / r) * -2.0) * 0.5;
	else
		tmp = ((abs(r) + abs(p)) - (q_m + q_m)) * 0.5;
	end
	tmp_2 = tmp;
end

Wolfram

q_m = N[Abs[q], $MachinePrecision]
NOTE: p, r, and q_m should be sorted in increasing order before calling this function.
code[p_, r_, q$95$m_] := If[LessEqual[q$95$m, 4.4e-42], N[((-p) * N[(N[(-0.5 * N[(p + N[(N[(N[Abs[r], $MachinePrecision] - r), $MachinePrecision] + N[Abs[p], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / p), $MachinePrecision]), $MachinePrecision], If[LessEqual[q$95$m, 13500000000000.0], N[(N[(N[(N[(q$95$m * q$95$m), $MachinePrecision] / r), $MachinePrecision] * -2.0), $MachinePrecision] * 0.5), $MachinePrecision], N[(N[(N[(N[Abs[r], $MachinePrecision] + N[Abs[p], $MachinePrecision]), $MachinePrecision] - N[(q$95$m + q$95$m), $MachinePrecision]), $MachinePrecision] * 0.5), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if q < 4.4000000000000001e-42

   1. Initial program 22.4%

      \[\frac{1}{2} \cdot \left(\left(\left|p\right| + \left|r\right|\right) - \sqrt{{\left(p - r\right)}^{2} + 4 \cdot {q}^{2}}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in p around -inf

      \[\leadsto \color{blue}{-1 \cdot \left(p \cdot \left(\frac{-1}{2} \cdot \frac{\left(\left|p\right| + \left|r\right|\right) - r}{p} - \frac{1}{2}\right)\right)} \]
   4. Step-by-step derivation

      1. metadata-eval N/A

         \[\leadsto -1 \cdot \left(p \cdot \left(\frac{-1}{2} \cdot \frac{\left(\left|p\right| + \left|r\right|\right) - r}{p} - \frac{1}{\color{blue}{2}}\right)\right) \]

      2. associate-*r* N/A

         \[\leadsto \left(-1 \cdot p\right) \cdot \color{blue}{\left(\frac{-1}{2} \cdot \frac{\left(\left|p\right| + \left|r\right|\right) - r}{p} - \frac{1}{2}\right)} \]

      3. mul-1-neg N/A

         \[\leadsto \left(\mathsf{neg}\left(p\right)\right) \cdot \left(\color{blue}{\frac{-1}{2} \cdot \frac{\left(\left|p\right| + \left|r\right|\right) - r}{p}} - \frac{1}{2}\right) \]

      4. lower-*.f64 N/A

         \[\leadsto \left(\mathsf{neg}\left(p\right)\right) \cdot \color{blue}{\left(\frac{-1}{2} \cdot \frac{\left(\left|p\right| + \left|r\right|\right) - r}{p} - \frac{1}{2}\right)} \]

      5. lower-neg.f64 N/A

         \[\leadsto \left(-p\right) \cdot \left(\color{blue}{\frac{-1}{2} \cdot \frac{\left(\left|p\right| + \left|r\right|\right) - r}{p}} - \frac{1}{2}\right) \]

      6. lower--.f64 N/A

         \[\leadsto \left(-p\right) \cdot \left(\frac{-1}{2} \cdot \frac{\left(\left|p\right| + \left|r\right|\right) - r}{p} - \color{blue}{\frac{1}{2}}\right) \]

   5. Applied rewrites 25.2%

      \[\leadsto \color{blue}{\left(-p\right) \cdot \left(\frac{\left|p\right| + \left(\left|r\right| - r\right)}{p} \cdot -0.5 - 0.5\right)} \]

   6. Taylor expanded in r around inf

      \[\leadsto \left(-p\right) \cdot \left(\frac{1}{2} \cdot \color{blue}{\frac{r}{p}}\right) \]
   7. Step-by-step derivation

      1. metadata-eval N/A

         \[\leadsto \left(-p\right) \cdot \left(\frac{1}{2} \cdot \frac{r}{p}\right) \]

      2. *-commutative N/A

         \[\leadsto \left(-p\right) \cdot \left(\frac{r}{p} \cdot \frac{1}{\color{blue}{2}}\right) \]

      3. unpow1 N/A

         \[\leadsto \left(-p\right) \cdot \left(\frac{{r}^{1}}{p} \cdot \frac{1}{2}\right) \]

      4. metadata-eval N/A

         \[\leadsto \left(-p\right) \cdot \left(\frac{{r}^{\left(\frac{2}{2}\right)}}{p} \cdot \frac{1}{2}\right) \]

      5. sqrt-pow1 N/A

         \[\leadsto \left(-p\right) \cdot \left(\frac{\sqrt{{r}^{2}}}{p} \cdot \frac{1}{2}\right) \]

      6. pow2 N/A

         \[\leadsto \left(-p\right) \cdot \left(\frac{\sqrt{r \cdot r}}{p} \cdot \frac{1}{2}\right) \]

      7. rem-sqrt-square-rev N/A

         \[\leadsto \left(-p\right) \cdot \left(\frac{\left|r\right|}{p} \cdot \frac{1}{2}\right) \]

      8. lower-*.f64 N/A

         \[\leadsto \left(-p\right) \cdot \left(\frac{\left|r\right|}{p} \cdot \frac{1}{\color{blue}{2}}\right) \]

      9. rem-sqrt-square-rev N/A

         \[\leadsto \left(-p\right) \cdot \left(\frac{\sqrt{r \cdot r}}{p} \cdot \frac{1}{2}\right) \]

      10. pow2 N/A

          \[\leadsto \left(-p\right) \cdot \left(\frac{\sqrt{{r}^{2}}}{p} \cdot \frac{1}{2}\right) \]

      11. sqrt-pow1 N/A

          \[\leadsto \left(-p\right) \cdot \left(\frac{{r}^{\left(\frac{2}{2}\right)}}{p} \cdot \frac{1}{2}\right) \]

      12. metadata-eval N/A

          \[\leadsto \left(-p\right) \cdot \left(\frac{{r}^{1}}{p} \cdot \frac{1}{2}\right) \]

      13. unpow1 N/A

          \[\leadsto \left(-p\right) \cdot \left(\frac{r}{p} \cdot \frac{1}{2}\right) \]

      14. lower-/.f64 N/A

          \[\leadsto \left(-p\right) \cdot \left(\frac{r}{p} \cdot \frac{1}{2}\right) \]

      15. metadata-eval 8.9

          \[\leadsto \left(-p\right) \cdot \left(\frac{r}{p} \cdot 0.5\right) \]

   8. Applied rewrites 8.9%

      \[\leadsto \left(-p\right) \cdot \left(\frac{r}{p} \cdot \color{blue}{0.5}\right) \]

   9. Taylor expanded in p around 0

      \[\leadsto \left(-p\right) \cdot \frac{\frac{-1}{2} \cdot p + \frac{-1}{2} \cdot \left(\left(\left|p\right| + \left|r\right|\right) - r\right)}{\color{blue}{p}} \]
   10. Step-by-step derivation

       1. lower-/.f64 N/A

          \[\leadsto \left(-p\right) \cdot \frac{\frac{-1}{2} \cdot p + \frac{-1}{2} \cdot \left(\left(\left|p\right| + \left|r\right|\right) - r\right)}{p} \]

       2. distribute-lft-out N/A

          \[\leadsto \left(-p\right) \cdot \frac{\frac{-1}{2} \cdot \left(p + \left(\left(\left|p\right| + \left|r\right|\right) - r\right)\right)}{p} \]

       3. lower-*.f64 N/A

          \[\leadsto \left(-p\right) \cdot \frac{\frac{-1}{2} \cdot \left(p + \left(\left(\left|p\right| + \left|r\right|\right) - r\right)\right)}{p} \]

       4. associate-+r- N/A

          \[\leadsto \left(-p\right) \cdot \frac{\frac{-1}{2} \cdot \left(p + \left(\left|p\right| + \left(\left|r\right| - r\right)\right)\right)}{p} \]

       5. lower-+.f64 N/A

          \[\leadsto \left(-p\right) \cdot \frac{\frac{-1}{2} \cdot \left(p + \left(\left|p\right| + \left(\left|r\right| - r\right)\right)\right)}{p} \]

       6. +-commutative N/A

          \[\leadsto \left(-p\right) \cdot \frac{\frac{-1}{2} \cdot \left(p + \left(\left(\left|r\right| - r\right) + \left|p\right|\right)\right)}{p} \]

       7. lower-+.f64 N/A

          \[\leadsto \left(-p\right) \cdot \frac{\frac{-1}{2} \cdot \left(p + \left(\left(\left|r\right| - r\right) + \left|p\right|\right)\right)}{p} \]

       8. lower--.f64 N/A

          \[\leadsto \left(-p\right) \cdot \frac{\frac{-1}{2} \cdot \left(p + \left(\left(\left|r\right| - r\right) + \left|p\right|\right)\right)}{p} \]

       9. lift-fabs.f64 N/A

          \[\leadsto \left(-p\right) \cdot \frac{\frac{-1}{2} \cdot \left(p + \left(\left(\left|r\right| - r\right) + \left|p\right|\right)\right)}{p} \]

       10. lift-fabs.f64 25.2

           \[\leadsto \left(-p\right) \cdot \frac{-0.5 \cdot \left(p + \left(\left(\left|r\right| - r\right) + \left|p\right|\right)\right)}{p} \]

   11. Applied rewrites 25.2%

       \[\leadsto \left(-p\right) \cdot \frac{-0.5 \cdot \left(p + \left(\left(\left|r\right| - r\right) + \left|p\right|\right)\right)}{\color{blue}{p}} \]

   if 4.4000000000000001e-42 < q < 1.35e13

   1. Initial program 27.0%

      \[\frac{1}{2} \cdot \left(\left(\left|p\right| + \left|r\right|\right) - \sqrt{{\left(p - r\right)}^{2} + 4 \cdot {q}^{2}}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in p around 0

      \[\leadsto \color{blue}{\frac{1}{2} \cdot \left(\left(\left|p\right| + \left|r\right|\right) - \sqrt{4 \cdot {q}^{2} + {r}^{2}}\right)} \]
   4. Step-by-step derivation

      1. metadata-eval N/A

         \[\leadsto \frac{1}{2} \cdot \left(\color{blue}{\left(\left|p\right| + \left|r\right|\right)} - \sqrt{4 \cdot {q}^{2} + {r}^{2}}\right) \]

      2. *-commutative N/A

         \[\leadsto \left(\left(\left|p\right| + \left|r\right|\right) - \sqrt{4 \cdot {q}^{2} + {r}^{2}}\right) \cdot \color{blue}{\frac{1}{2}} \]

      3. lower-*.f64 N/A

         \[\leadsto \left(\left(\left|p\right| + \left|r\right|\right) - \sqrt{4 \cdot {q}^{2} + {r}^{2}}\right) \cdot \color{blue}{\frac{1}{2}} \]

   5. Applied rewrites 26.8%

      \[\leadsto \color{blue}{\left(\left(\left|r\right| + \left|p\right|\right) - \sqrt{\mathsf{fma}\left(q \cdot q, 4, r \cdot r\right)}\right) \cdot 0.5} \]

   6. Taylor expanded in r around inf

      \[\leadsto \left(r \cdot \left(\left(-2 \cdot \frac{{q}^{2}}{{r}^{2}} + \left(\frac{\left|p\right|}{r} + \frac{\left|r\right|}{r}\right)\right) - 1\right)\right) \cdot \frac{1}{2} \]
   7. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \left(\left(\left(-2 \cdot \frac{{q}^{2}}{{r}^{2}} + \left(\frac{\left|p\right|}{r} + \frac{\left|r\right|}{r}\right)\right) - 1\right) \cdot r\right) \cdot \frac{1}{2} \]

      2. lower-*.f64 N/A

         \[\leadsto \left(\left(\left(-2 \cdot \frac{{q}^{2}}{{r}^{2}} + \left(\frac{\left|p\right|}{r} + \frac{\left|r\right|}{r}\right)\right) - 1\right) \cdot r\right) \cdot \frac{1}{2} \]

   8. Applied rewrites 23.4%

      \[\leadsto \left(\mathsf{fma}\left(-2, \frac{q \cdot q}{r \cdot r}, \frac{r + p}{r} - 1\right) \cdot r\right) \cdot 0.5 \]

   9. Taylor expanded in p around 0

      \[\leadsto \left(-2 \cdot \frac{{q}^{2}}{r}\right) \cdot \frac{1}{2} \]
   10. Step-by-step derivation

       1. *-commutative N/A

          \[\leadsto \left(\frac{{q}^{2}}{r} \cdot -2\right) \cdot \frac{1}{2} \]

       2. lower-*.f64 N/A

          \[\leadsto \left(\frac{{q}^{2}}{r} \cdot -2\right) \cdot \frac{1}{2} \]

       3. lower-/.f64 N/A

          \[\leadsto \left(\frac{{q}^{2}}{r} \cdot -2\right) \cdot \frac{1}{2} \]

       4. pow2 N/A

          \[\leadsto \left(\frac{q \cdot q}{r} \cdot -2\right) \cdot \frac{1}{2} \]

       5. lift-*.f64 35.7

          \[\leadsto \left(\frac{q \cdot q}{r} \cdot -2\right) \cdot 0.5 \]

   11. Applied rewrites 35.7%

       \[\leadsto \left(\frac{q \cdot q}{r} \cdot -2\right) \cdot 0.5 \]

   if 1.35e13 < q

   1. Initial program 35.3%

      \[\frac{1}{2} \cdot \left(\left(\left|p\right| + \left|r\right|\right) - \sqrt{{\left(p - r\right)}^{2} + 4 \cdot {q}^{2}}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in p around 0

      \[\leadsto \color{blue}{\frac{1}{2} \cdot \left(\left(\left|p\right| + \left|r\right|\right) - \sqrt{4 \cdot {q}^{2} + {r}^{2}}\right)} \]
   4. Step-by-step derivation

      1. metadata-eval N/A

         \[\leadsto \frac{1}{2} \cdot \left(\color{blue}{\left(\left|p\right| + \left|r\right|\right)} - \sqrt{4 \cdot {q}^{2} + {r}^{2}}\right) \]

      2. *-commutative N/A

         \[\leadsto \left(\left(\left|p\right| + \left|r\right|\right) - \sqrt{4 \cdot {q}^{2} + {r}^{2}}\right) \cdot \color{blue}{\frac{1}{2}} \]

      3. lower-*.f64 N/A

         \[\leadsto \left(\left(\left|p\right| + \left|r\right|\right) - \sqrt{4 \cdot {q}^{2} + {r}^{2}}\right) \cdot \color{blue}{\frac{1}{2}} \]

   5. Applied rewrites 34.5%

      \[\leadsto \color{blue}{\left(\left(\left|r\right| + \left|p\right|\right) - \sqrt{\mathsf{fma}\left(q \cdot q, 4, r \cdot r\right)}\right) \cdot 0.5} \]

   6. Taylor expanded in r around 0

      \[\leadsto \left(\left(\left|r\right| + \left|p\right|\right) - 2 \cdot q\right) \cdot \frac{1}{2} \]
   7. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \left(\left(\left|r\right| + \left|p\right|\right) - q \cdot 2\right) \cdot \frac{1}{2} \]

      2. lower-*.f64 73.5

         \[\leadsto \left(\left(\left|r\right| + \left|p\right|\right) - q \cdot 2\right) \cdot 0.5 \]

   8. Applied rewrites 73.5%

      \[\leadsto \left(\left(\left|r\right| + \left|p\right|\right) - q \cdot 2\right) \cdot 0.5 \]
   9. Step-by-step derivation

      1. lift-*.f64 N/A

         \[\leadsto \left(\left(\left|r\right| + \left|p\right|\right) - q \cdot 2\right) \cdot \frac{1}{2} \]

      2. *-commutative N/A

         \[\leadsto \left(\left(\left|r\right| + \left|p\right|\right) - 2 \cdot q\right) \cdot \frac{1}{2} \]

      3. count-2-rev N/A

         \[\leadsto \left(\left(\left|r\right| + \left|p\right|\right) - \left(q + q\right)\right) \cdot \frac{1}{2} \]

      4. lower-+.f64 73.5

         \[\leadsto \left(\left(\left|r\right| + \left|p\right|\right) - \left(q + q\right)\right) \cdot 0.5 \]

   10. Applied rewrites 73.5%

       \[\leadsto \left(\left(\left|r\right| + \left|p\right|\right) - \left(q + q\right)\right) \cdot 0.5 \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 2: 58.5% accurate, 1.0× speedup

Math

\[\begin{array}{l} q_m = \left|q\right| \\ [p, r, q_m] = \mathsf{sort}([p, r, q_m])\\ \\ \begin{array}{l} t_0 := 4 \cdot {q\_m}^{2}\\ \mathbf{if}\;t\_0 \leq 10^{-83}:\\ \;\;\;\;0.5 \cdot \left(p + \left(\left(\left|r\right| - r\right) + \left|p\right|\right)\right)\\ \mathbf{elif}\;t\_0 \leq 4 \cdot 10^{+24}:\\ \;\;\;\;\left(\frac{q\_m \cdot q\_m}{r} \cdot -2\right) \cdot 0.5\\ \mathbf{else}:\\ \;\;\;\;\left(\left(\left|r\right| + \left|p\right|\right) - \left(q\_m + q\_m\right)\right) \cdot 0.5\\ \end{array} \end{array} \]

FPCore

q_m = (fabs.f64 q)
NOTE: p, r, and q_m should be sorted in increasing order before calling this function.
(FPCore (p r q_m)
 :precision binary64
 (let* ((t_0 (* 4.0 (pow q_m 2.0))))
   (if (<= t_0 1e-83)
     (* 0.5 (+ p (+ (- (fabs r) r) (fabs p))))
     (if (<= t_0 4e+24)
       (* (* (/ (* q_m q_m) r) -2.0) 0.5)
       (* (- (+ (fabs r) (fabs p)) (+ q_m q_m)) 0.5)))))

C

q_m = fabs(q);
assert(p < r && r < q_m);
double code(double p, double r, double q_m) {
	double t_0 = 4.0 * pow(q_m, 2.0);
	double tmp;
	if (t_0 <= 1e-83) {
		tmp = 0.5 * (p + ((fabs(r) - r) + fabs(p)));
	} else if (t_0 <= 4e+24) {
		tmp = (((q_m * q_m) / r) * -2.0) * 0.5;
	} else {
		tmp = ((fabs(r) + fabs(p)) - (q_m + q_m)) * 0.5;
	}
	return tmp;
}

Fortran

q_m =     private
NOTE: p, r, and q_m should be sorted in increasing order before calling this function.
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(p, r, q_m)
use fmin_fmax_functions
    real(8), intent (in) :: p
    real(8), intent (in) :: r
    real(8), intent (in) :: q_m
    real(8) :: t_0
    real(8) :: tmp
    t_0 = 4.0d0 * (q_m ** 2.0d0)
    if (t_0 <= 1d-83) then
        tmp = 0.5d0 * (p + ((abs(r) - r) + abs(p)))
    else if (t_0 <= 4d+24) then
        tmp = (((q_m * q_m) / r) * (-2.0d0)) * 0.5d0
    else
        tmp = ((abs(r) + abs(p)) - (q_m + q_m)) * 0.5d0
    end if
    code = tmp
end function

Java

q_m = Math.abs(q);
assert p < r && r < q_m;
public static double code(double p, double r, double q_m) {
	double t_0 = 4.0 * Math.pow(q_m, 2.0);
	double tmp;
	if (t_0 <= 1e-83) {
		tmp = 0.5 * (p + ((Math.abs(r) - r) + Math.abs(p)));
	} else if (t_0 <= 4e+24) {
		tmp = (((q_m * q_m) / r) * -2.0) * 0.5;
	} else {
		tmp = ((Math.abs(r) + Math.abs(p)) - (q_m + q_m)) * 0.5;
	}
	return tmp;
}

Python

q_m = math.fabs(q)
[p, r, q_m] = sort([p, r, q_m])
def code(p, r, q_m):
	t_0 = 4.0 * math.pow(q_m, 2.0)
	tmp = 0
	if t_0 <= 1e-83:
		tmp = 0.5 * (p + ((math.fabs(r) - r) + math.fabs(p)))
	elif t_0 <= 4e+24:
		tmp = (((q_m * q_m) / r) * -2.0) * 0.5
	else:
		tmp = ((math.fabs(r) + math.fabs(p)) - (q_m + q_m)) * 0.5
	return tmp

Julia

q_m = abs(q)
p, r, q_m = sort([p, r, q_m])
function code(p, r, q_m)
	t_0 = Float64(4.0 * (q_m ^ 2.0))
	tmp = 0.0
	if (t_0 <= 1e-83)
		tmp = Float64(0.5 * Float64(p + Float64(Float64(abs(r) - r) + abs(p))));
	elseif (t_0 <= 4e+24)
		tmp = Float64(Float64(Float64(Float64(q_m * q_m) / r) * -2.0) * 0.5);
	else
		tmp = Float64(Float64(Float64(abs(r) + abs(p)) - Float64(q_m + q_m)) * 0.5);
	end
	return tmp
end

MATLAB

q_m = abs(q);
p, r, q_m = num2cell(sort([p, r, q_m])){:}
function tmp_2 = code(p, r, q_m)
	t_0 = 4.0 * (q_m ^ 2.0);
	tmp = 0.0;
	if (t_0 <= 1e-83)
		tmp = 0.5 * (p + ((abs(r) - r) + abs(p)));
	elseif (t_0 <= 4e+24)
		tmp = (((q_m * q_m) / r) * -2.0) * 0.5;
	else
		tmp = ((abs(r) + abs(p)) - (q_m + q_m)) * 0.5;
	end
	tmp_2 = tmp;
end

Wolfram

q_m = N[Abs[q], $MachinePrecision]
NOTE: p, r, and q_m should be sorted in increasing order before calling this function.
code[p_, r_, q$95$m_] := Block[{t$95$0 = N[(4.0 * N[Power[q$95$m, 2.0], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, 1e-83], N[(0.5 * N[(p + N[(N[(N[Abs[r], $MachinePrecision] - r), $MachinePrecision] + N[Abs[p], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, 4e+24], N[(N[(N[(N[(q$95$m * q$95$m), $MachinePrecision] / r), $MachinePrecision] * -2.0), $MachinePrecision] * 0.5), $MachinePrecision], N[(N[(N[(N[Abs[r], $MachinePrecision] + N[Abs[p], $MachinePrecision]), $MachinePrecision] - N[(q$95$m + q$95$m), $MachinePrecision]), $MachinePrecision] * 0.5), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if (*.f64 #s(literal 4 binary64) (pow.f64 q #s(literal 2 binary64))) < 1e-83

   1. Initial program 21.2%

      \[\frac{1}{2} \cdot \left(\left(\left|p\right| + \left|r\right|\right) - \sqrt{{\left(p - r\right)}^{2} + 4 \cdot {q}^{2}}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in p around -inf

      \[\leadsto \color{blue}{-1 \cdot \left(p \cdot \left(\frac{-1}{2} \cdot \frac{\left(\left|p\right| + \left|r\right|\right) - r}{p} - \frac{1}{2}\right)\right)} \]
   4. Step-by-step derivation

      1. metadata-eval N/A

         \[\leadsto -1 \cdot \left(p \cdot \left(\frac{-1}{2} \cdot \frac{\left(\left|p\right| + \left|r\right|\right) - r}{p} - \frac{1}{\color{blue}{2}}\right)\right) \]

      2. associate-*r* N/A

         \[\leadsto \left(-1 \cdot p\right) \cdot \color{blue}{\left(\frac{-1}{2} \cdot \frac{\left(\left|p\right| + \left|r\right|\right) - r}{p} - \frac{1}{2}\right)} \]

      3. mul-1-neg N/A

         \[\leadsto \left(\mathsf{neg}\left(p\right)\right) \cdot \left(\color{blue}{\frac{-1}{2} \cdot \frac{\left(\left|p\right| + \left|r\right|\right) - r}{p}} - \frac{1}{2}\right) \]

      4. lower-*.f64 N/A

         \[\leadsto \left(\mathsf{neg}\left(p\right)\right) \cdot \color{blue}{\left(\frac{-1}{2} \cdot \frac{\left(\left|p\right| + \left|r\right|\right) - r}{p} - \frac{1}{2}\right)} \]

      5. lower-neg.f64 N/A

         \[\leadsto \left(-p\right) \cdot \left(\color{blue}{\frac{-1}{2} \cdot \frac{\left(\left|p\right| + \left|r\right|\right) - r}{p}} - \frac{1}{2}\right) \]

      6. lower--.f64 N/A

         \[\leadsto \left(-p\right) \cdot \left(\frac{-1}{2} \cdot \frac{\left(\left|p\right| + \left|r\right|\right) - r}{p} - \color{blue}{\frac{1}{2}}\right) \]

   5. Applied rewrites 37.4%

      \[\leadsto \color{blue}{\left(-p\right) \cdot \left(\frac{\left|p\right| + \left(\left|r\right| - r\right)}{p} \cdot -0.5 - 0.5\right)} \]

   6. Taylor expanded in r around -inf

      \[\leadsto -1 \cdot \color{blue}{\left(r \cdot \left(\frac{1}{2} + \frac{p \cdot \left(\frac{-1}{2} \cdot \left(\frac{\left|p\right|}{p} + \frac{\left|r\right|}{p}\right) - \frac{1}{2}\right)}{r}\right)\right)} \]

   8. Applied rewrites 2.9%

      \[\leadsto \left(-r\right) \cdot \color{blue}{\mathsf{fma}\left(p, \frac{\frac{r + p}{p} \cdot -0.5 - 0.5}{r}, 0.5\right)} \]

   9. Taylor expanded in p around 0

      \[\leadsto p \]
   10. Step-by-step derivation

   11. Applied rewrites 14.9%

       \[\leadsto p \]

   12. Taylor expanded in p around 0

       \[\leadsto \frac{1}{2} \cdot p + \color{blue}{\frac{1}{2} \cdot \left(\left(\left|p\right| + \left|r\right|\right) - r\right)} \]
   13. Step-by-step derivation

       1. metadata-eval N/A

          \[\leadsto \frac{1}{2} \cdot p + \frac{1}{2} \cdot \left(\left(\color{blue}{\left|p\right|} + \left|r\right|\right) - r\right) \]

       2. metadata-eval N/A

          \[\leadsto \frac{1}{2} \cdot p + \frac{1}{2} \cdot \left(\left(\left|p\right| + \left|r\right|\right) - r\right) \]

       3. distribute-lft-out N/A

          \[\leadsto \frac{1}{2} \cdot \left(p + \color{blue}{\left(\left(\left|p\right| + \left|r\right|\right) - r\right)}\right) \]

       4. lower-*.f64 N/A

          \[\leadsto \frac{1}{2} \cdot \left(p + \color{blue}{\left(\left(\left|p\right| + \left|r\right|\right) - r\right)}\right) \]

       5. metadata-eval N/A

          \[\leadsto \frac{1}{2} \cdot \left(p + \left(\color{blue}{\left(\left|p\right| + \left|r\right|\right)} - r\right)\right) \]

       6. associate-+r- N/A

          \[\leadsto \frac{1}{2} \cdot \left(p + \left(\left|p\right| + \left(\left|r\right| - \color{blue}{r}\right)\right)\right) \]

       7. lower-+.f64 N/A

          \[\leadsto \frac{1}{2} \cdot \left(p + \left(\left|p\right| + \color{blue}{\left(\left|r\right| - r\right)}\right)\right) \]

       8. +-commutative N/A

          \[\leadsto \frac{1}{2} \cdot \left(p + \left(\left(\left|r\right| - r\right) + \left|p\right|\right)\right) \]

       9. lower-+.f64 N/A

          \[\leadsto \frac{1}{2} \cdot \left(p + \left(\left(\left|r\right| - r\right) + \left|p\right|\right)\right) \]

       10. lower--.f64 N/A

           \[\leadsto \frac{1}{2} \cdot \left(p + \left(\left(\left|r\right| - r\right) + \left|p\right|\right)\right) \]

       11. lift-fabs.f64 N/A

           \[\leadsto \frac{1}{2} \cdot \left(p + \left(\left(\left|r\right| - r\right) + \left|p\right|\right)\right) \]

       12. lift-fabs.f64 37.4

           \[\leadsto 0.5 \cdot \left(p + \left(\left(\left|r\right| - r\right) + \left|p\right|\right)\right) \]

   14. Applied rewrites 37.4%

       \[\leadsto 0.5 \cdot \color{blue}{\left(p + \left(\left(\left|r\right| - r\right) + \left|p\right|\right)\right)} \]

   if 1e-83 < (*.f64 #s(literal 4 binary64) (pow.f64 q #s(literal 2 binary64))) < 3.9999999999999999e24

   1. Initial program 22.2%

      \[\frac{1}{2} \cdot \left(\left(\left|p\right| + \left|r\right|\right) - \sqrt{{\left(p - r\right)}^{2} + 4 \cdot {q}^{2}}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in p around 0

      \[\leadsto \color{blue}{\frac{1}{2} \cdot \left(\left(\left|p\right| + \left|r\right|\right) - \sqrt{4 \cdot {q}^{2} + {r}^{2}}\right)} \]
   4. Step-by-step derivation

      1. metadata-eval N/A

         \[\leadsto \frac{1}{2} \cdot \left(\color{blue}{\left(\left|p\right| + \left|r\right|\right)} - \sqrt{4 \cdot {q}^{2} + {r}^{2}}\right) \]

      2. *-commutative N/A

         \[\leadsto \left(\left(\left|p\right| + \left|r\right|\right) - \sqrt{4 \cdot {q}^{2} + {r}^{2}}\right) \cdot \color{blue}{\frac{1}{2}} \]

      3. lower-*.f64 N/A

         \[\leadsto \left(\left(\left|p\right| + \left|r\right|\right) - \sqrt{4 \cdot {q}^{2} + {r}^{2}}\right) \cdot \color{blue}{\frac{1}{2}} \]

   5. Applied rewrites 22.0%

      \[\leadsto \color{blue}{\left(\left(\left|r\right| + \left|p\right|\right) - \sqrt{\mathsf{fma}\left(q \cdot q, 4, r \cdot r\right)}\right) \cdot 0.5} \]

   6. Taylor expanded in r around inf

      \[\leadsto \left(r \cdot \left(\left(-2 \cdot \frac{{q}^{2}}{{r}^{2}} + \left(\frac{\left|p\right|}{r} + \frac{\left|r\right|}{r}\right)\right) - 1\right)\right) \cdot \frac{1}{2} \]
   7. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \left(\left(\left(-2 \cdot \frac{{q}^{2}}{{r}^{2}} + \left(\frac{\left|p\right|}{r} + \frac{\left|r\right|}{r}\right)\right) - 1\right) \cdot r\right) \cdot \frac{1}{2} \]

      2. lower-*.f64 N/A

         \[\leadsto \left(\left(\left(-2 \cdot \frac{{q}^{2}}{{r}^{2}} + \left(\frac{\left|p\right|}{r} + \frac{\left|r\right|}{r}\right)\right) - 1\right) \cdot r\right) \cdot \frac{1}{2} \]

   8. Applied rewrites 24.7%

      \[\leadsto \left(\mathsf{fma}\left(-2, \frac{q \cdot q}{r \cdot r}, \frac{r + p}{r} - 1\right) \cdot r\right) \cdot 0.5 \]

   9. Taylor expanded in p around 0

      \[\leadsto \left(-2 \cdot \frac{{q}^{2}}{r}\right) \cdot \frac{1}{2} \]
   10. Step-by-step derivation

       1. *-commutative N/A

          \[\leadsto \left(\frac{{q}^{2}}{r} \cdot -2\right) \cdot \frac{1}{2} \]

       2. lower-*.f64 N/A

          \[\leadsto \left(\frac{{q}^{2}}{r} \cdot -2\right) \cdot \frac{1}{2} \]

       3. lower-/.f64 N/A

          \[\leadsto \left(\frac{{q}^{2}}{r} \cdot -2\right) \cdot \frac{1}{2} \]

       4. pow2 N/A

          \[\leadsto \left(\frac{q \cdot q}{r} \cdot -2\right) \cdot \frac{1}{2} \]

       5. lift-*.f64 38.1

          \[\leadsto \left(\frac{q \cdot q}{r} \cdot -2\right) \cdot 0.5 \]

   11. Applied rewrites 38.1%

       \[\leadsto \left(\frac{q \cdot q}{r} \cdot -2\right) \cdot 0.5 \]

   if 3.9999999999999999e24 < (*.f64 #s(literal 4 binary64) (pow.f64 q #s(literal 2 binary64)))

   1. Initial program 30.3%

      \[\frac{1}{2} \cdot \left(\left(\left|p\right| + \left|r\right|\right) - \sqrt{{\left(p - r\right)}^{2} + 4 \cdot {q}^{2}}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in p around 0

      \[\leadsto \color{blue}{\frac{1}{2} \cdot \left(\left(\left|p\right| + \left|r\right|\right) - \sqrt{4 \cdot {q}^{2} + {r}^{2}}\right)} \]
   4. Step-by-step derivation

      1. metadata-eval N/A

         \[\leadsto \frac{1}{2} \cdot \left(\color{blue}{\left(\left|p\right| + \left|r\right|\right)} - \sqrt{4 \cdot {q}^{2} + {r}^{2}}\right) \]

      2. *-commutative N/A

         \[\leadsto \left(\left(\left|p\right| + \left|r\right|\right) - \sqrt{4 \cdot {q}^{2} + {r}^{2}}\right) \cdot \color{blue}{\frac{1}{2}} \]

      3. lower-*.f64 N/A

         \[\leadsto \left(\left(\left|p\right| + \left|r\right|\right) - \sqrt{4 \cdot {q}^{2} + {r}^{2}}\right) \cdot \color{blue}{\frac{1}{2}} \]

   5. Applied rewrites 29.2%

      \[\leadsto \color{blue}{\left(\left(\left|r\right| + \left|p\right|\right) - \sqrt{\mathsf{fma}\left(q \cdot q, 4, r \cdot r\right)}\right) \cdot 0.5} \]

   6. Taylor expanded in r around 0

      \[\leadsto \left(\left(\left|r\right| + \left|p\right|\right) - 2 \cdot q\right) \cdot \frac{1}{2} \]
   7. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \left(\left(\left|r\right| + \left|p\right|\right) - q \cdot 2\right) \cdot \frac{1}{2} \]

      2. lower-*.f64 35.0

         \[\leadsto \left(\left(\left|r\right| + \left|p\right|\right) - q \cdot 2\right) \cdot 0.5 \]

   8. Applied rewrites 35.0%

      \[\leadsto \left(\left(\left|r\right| + \left|p\right|\right) - q \cdot 2\right) \cdot 0.5 \]
   9. Step-by-step derivation

      1. lift-*.f64 N/A

         \[\leadsto \left(\left(\left|r\right| + \left|p\right|\right) - q \cdot 2\right) \cdot \frac{1}{2} \]

      2. *-commutative N/A

         \[\leadsto \left(\left(\left|r\right| + \left|p\right|\right) - 2 \cdot q\right) \cdot \frac{1}{2} \]

      3. count-2-rev N/A

         \[\leadsto \left(\left(\left|r\right| + \left|p\right|\right) - \left(q + q\right)\right) \cdot \frac{1}{2} \]

      4. lower-+.f64 35.0

         \[\leadsto \left(\left(\left|r\right| + \left|p\right|\right) - \left(q + q\right)\right) \cdot 0.5 \]

   10. Applied rewrites 35.0%

       \[\leadsto \left(\left(\left|r\right| + \left|p\right|\right) - \left(q + q\right)\right) \cdot 0.5 \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 3: 58.6% accurate, 1.9× speedup

Math

\[\begin{array}{l} q_m = \left|q\right| \\ [p, r, q_m] = \mathsf{sort}([p, r, q_m])\\ \\ \begin{array}{l} \mathbf{if}\;4 \cdot {q\_m}^{2} \leq 5 \cdot 10^{-74}:\\ \;\;\;\;0.5 \cdot \left(p + \left(\left(\left|r\right| - r\right) + \left|p\right|\right)\right)\\ \mathbf{else}:\\ \;\;\;\;-q\_m\\ \end{array} \end{array} \]

FPCore

q_m = (fabs.f64 q)
NOTE: p, r, and q_m should be sorted in increasing order before calling this function.
(FPCore (p r q_m)
 :precision binary64
 (if (<= (* 4.0 (pow q_m 2.0)) 5e-74)
   (* 0.5 (+ p (+ (- (fabs r) r) (fabs p))))
   (- q_m)))

C

q_m = fabs(q);
assert(p < r && r < q_m);
double code(double p, double r, double q_m) {
	double tmp;
	if ((4.0 * pow(q_m, 2.0)) <= 5e-74) {
		tmp = 0.5 * (p + ((fabs(r) - r) + fabs(p)));
	} else {
		tmp = -q_m;
	}
	return tmp;
}

Fortran

q_m =     private
NOTE: p, r, and q_m should be sorted in increasing order before calling this function.
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(p, r, q_m)
use fmin_fmax_functions
    real(8), intent (in) :: p
    real(8), intent (in) :: r
    real(8), intent (in) :: q_m
    real(8) :: tmp
    if ((4.0d0 * (q_m ** 2.0d0)) <= 5d-74) then
        tmp = 0.5d0 * (p + ((abs(r) - r) + abs(p)))
    else
        tmp = -q_m
    end if
    code = tmp
end function

Java

q_m = Math.abs(q);
assert p < r && r < q_m;
public static double code(double p, double r, double q_m) {
	double tmp;
	if ((4.0 * Math.pow(q_m, 2.0)) <= 5e-74) {
		tmp = 0.5 * (p + ((Math.abs(r) - r) + Math.abs(p)));
	} else {
		tmp = -q_m;
	}
	return tmp;
}

Python

q_m = math.fabs(q)
[p, r, q_m] = sort([p, r, q_m])
def code(p, r, q_m):
	tmp = 0
	if (4.0 * math.pow(q_m, 2.0)) <= 5e-74:
		tmp = 0.5 * (p + ((math.fabs(r) - r) + math.fabs(p)))
	else:
		tmp = -q_m
	return tmp

Julia

q_m = abs(q)
p, r, q_m = sort([p, r, q_m])
function code(p, r, q_m)
	tmp = 0.0
	if (Float64(4.0 * (q_m ^ 2.0)) <= 5e-74)
		tmp = Float64(0.5 * Float64(p + Float64(Float64(abs(r) - r) + abs(p))));
	else
		tmp = Float64(-q_m);
	end
	return tmp
end

MATLAB

q_m = abs(q);
p, r, q_m = num2cell(sort([p, r, q_m])){:}
function tmp_2 = code(p, r, q_m)
	tmp = 0.0;
	if ((4.0 * (q_m ^ 2.0)) <= 5e-74)
		tmp = 0.5 * (p + ((abs(r) - r) + abs(p)));
	else
		tmp = -q_m;
	end
	tmp_2 = tmp;
end

Wolfram

q_m = N[Abs[q], $MachinePrecision]
NOTE: p, r, and q_m should be sorted in increasing order before calling this function.
code[p_, r_, q$95$m_] := If[LessEqual[N[(4.0 * N[Power[q$95$m, 2.0], $MachinePrecision]), $MachinePrecision], 5e-74], N[(0.5 * N[(p + N[(N[(N[Abs[r], $MachinePrecision] - r), $MachinePrecision] + N[Abs[p], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], (-q$95$m)]

Derivation

1. Split input into 2 regimes

2. if (*.f64 #s(literal 4 binary64) (pow.f64 q #s(literal 2 binary64))) < 4.99999999999999998e-74

   1. Initial program 20.4%

      \[\frac{1}{2} \cdot \left(\left(\left|p\right| + \left|r\right|\right) - \sqrt{{\left(p - r\right)}^{2} + 4 \cdot {q}^{2}}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in p around -inf

      \[\leadsto \color{blue}{-1 \cdot \left(p \cdot \left(\frac{-1}{2} \cdot \frac{\left(\left|p\right| + \left|r\right|\right) - r}{p} - \frac{1}{2}\right)\right)} \]
   4. Step-by-step derivation

      1. metadata-eval N/A

         \[\leadsto -1 \cdot \left(p \cdot \left(\frac{-1}{2} \cdot \frac{\left(\left|p\right| + \left|r\right|\right) - r}{p} - \frac{1}{\color{blue}{2}}\right)\right) \]

      2. associate-*r* N/A

         \[\leadsto \left(-1 \cdot p\right) \cdot \color{blue}{\left(\frac{-1}{2} \cdot \frac{\left(\left|p\right| + \left|r\right|\right) - r}{p} - \frac{1}{2}\right)} \]

      3. mul-1-neg N/A

         \[\leadsto \left(\mathsf{neg}\left(p\right)\right) \cdot \left(\color{blue}{\frac{-1}{2} \cdot \frac{\left(\left|p\right| + \left|r\right|\right) - r}{p}} - \frac{1}{2}\right) \]

      4. lower-*.f64 N/A

         \[\leadsto \left(\mathsf{neg}\left(p\right)\right) \cdot \color{blue}{\left(\frac{-1}{2} \cdot \frac{\left(\left|p\right| + \left|r\right|\right) - r}{p} - \frac{1}{2}\right)} \]

      5. lower-neg.f64 N/A

         \[\leadsto \left(-p\right) \cdot \left(\color{blue}{\frac{-1}{2} \cdot \frac{\left(\left|p\right| + \left|r\right|\right) - r}{p}} - \frac{1}{2}\right) \]

      6. lower--.f64 N/A

         \[\leadsto \left(-p\right) \cdot \left(\frac{-1}{2} \cdot \frac{\left(\left|p\right| + \left|r\right|\right) - r}{p} - \color{blue}{\frac{1}{2}}\right) \]

   5. Applied rewrites 36.8%

      \[\leadsto \color{blue}{\left(-p\right) \cdot \left(\frac{\left|p\right| + \left(\left|r\right| - r\right)}{p} \cdot -0.5 - 0.5\right)} \]

   6. Taylor expanded in r around -inf

      \[\leadsto -1 \cdot \color{blue}{\left(r \cdot \left(\frac{1}{2} + \frac{p \cdot \left(\frac{-1}{2} \cdot \left(\frac{\left|p\right|}{p} + \frac{\left|r\right|}{p}\right) - \frac{1}{2}\right)}{r}\right)\right)} \]

   8. Applied rewrites 2.9%

      \[\leadsto \left(-r\right) \cdot \color{blue}{\mathsf{fma}\left(p, \frac{\frac{r + p}{p} \cdot -0.5 - 0.5}{r}, 0.5\right)} \]

   9. Taylor expanded in p around 0

      \[\leadsto p \]
   10. Step-by-step derivation

   11. Applied rewrites 14.4%

       \[\leadsto p \]

   12. Taylor expanded in p around 0

       \[\leadsto \frac{1}{2} \cdot p + \color{blue}{\frac{1}{2} \cdot \left(\left(\left|p\right| + \left|r\right|\right) - r\right)} \]
   13. Step-by-step derivation

       1. metadata-eval N/A

          \[\leadsto \frac{1}{2} \cdot p + \frac{1}{2} \cdot \left(\left(\color{blue}{\left|p\right|} + \left|r\right|\right) - r\right) \]

       2. metadata-eval N/A

          \[\leadsto \frac{1}{2} \cdot p + \frac{1}{2} \cdot \left(\left(\left|p\right| + \left|r\right|\right) - r\right) \]

       3. distribute-lft-out N/A

          \[\leadsto \frac{1}{2} \cdot \left(p + \color{blue}{\left(\left(\left|p\right| + \left|r\right|\right) - r\right)}\right) \]

       4. lower-*.f64 N/A

          \[\leadsto \frac{1}{2} \cdot \left(p + \color{blue}{\left(\left(\left|p\right| + \left|r\right|\right) - r\right)}\right) \]

       5. metadata-eval N/A

          \[\leadsto \frac{1}{2} \cdot \left(p + \left(\color{blue}{\left(\left|p\right| + \left|r\right|\right)} - r\right)\right) \]

       6. associate-+r- N/A

          \[\leadsto \frac{1}{2} \cdot \left(p + \left(\left|p\right| + \left(\left|r\right| - \color{blue}{r}\right)\right)\right) \]

       7. lower-+.f64 N/A

          \[\leadsto \frac{1}{2} \cdot \left(p + \left(\left|p\right| + \color{blue}{\left(\left|r\right| - r\right)}\right)\right) \]

       8. +-commutative N/A

          \[\leadsto \frac{1}{2} \cdot \left(p + \left(\left(\left|r\right| - r\right) + \left|p\right|\right)\right) \]

       9. lower-+.f64 N/A

          \[\leadsto \frac{1}{2} \cdot \left(p + \left(\left(\left|r\right| - r\right) + \left|p\right|\right)\right) \]

       10. lower--.f64 N/A

           \[\leadsto \frac{1}{2} \cdot \left(p + \left(\left(\left|r\right| - r\right) + \left|p\right|\right)\right) \]

       11. lift-fabs.f64 N/A

           \[\leadsto \frac{1}{2} \cdot \left(p + \left(\left(\left|r\right| - r\right) + \left|p\right|\right)\right) \]

       12. lift-fabs.f64 36.9

           \[\leadsto 0.5 \cdot \left(p + \left(\left(\left|r\right| - r\right) + \left|p\right|\right)\right) \]

   14. Applied rewrites 36.9%

       \[\leadsto 0.5 \cdot \color{blue}{\left(p + \left(\left(\left|r\right| - r\right) + \left|p\right|\right)\right)} \]

   if 4.99999999999999998e-74 < (*.f64 #s(literal 4 binary64) (pow.f64 q #s(literal 2 binary64)))

   1. Initial program 29.8%

      \[\frac{1}{2} \cdot \left(\left(\left|p\right| + \left|r\right|\right) - \sqrt{{\left(p - r\right)}^{2} + 4 \cdot {q}^{2}}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in q around inf

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

      1. mul-1-neg N/A

         \[\leadsto \mathsf{neg}\left(q\right) \]

      2. lower-neg.f64 32.4

         \[\leadsto -q \]

   5. Applied rewrites 32.4%

      \[\leadsto \color{blue}{-q} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 4: 49.1% accurate, 2.1× speedup

Math

\[\begin{array}{l} q_m = \left|q\right| \\ [p, r, q_m] = \mathsf{sort}([p, r, q_m])\\ \\ \begin{array}{l} \mathbf{if}\;4 \cdot {q\_m}^{2} \leq 5 \cdot 10^{-74}:\\ \;\;\;\;\left(p - p\right) \cdot 0.5\\ \mathbf{else}:\\ \;\;\;\;-q\_m\\ \end{array} \end{array} \]

FPCore

q_m = (fabs.f64 q)
NOTE: p, r, and q_m should be sorted in increasing order before calling this function.
(FPCore (p r q_m)
 :precision binary64
 (if (<= (* 4.0 (pow q_m 2.0)) 5e-74) (* (- p p) 0.5) (- q_m)))

C

q_m = fabs(q);
assert(p < r && r < q_m);
double code(double p, double r, double q_m) {
	double tmp;
	if ((4.0 * pow(q_m, 2.0)) <= 5e-74) {
		tmp = (p - p) * 0.5;
	} else {
		tmp = -q_m;
	}
	return tmp;
}

Fortran

q_m =     private
NOTE: p, r, and q_m should be sorted in increasing order before calling this function.
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(p, r, q_m)
use fmin_fmax_functions
    real(8), intent (in) :: p
    real(8), intent (in) :: r
    real(8), intent (in) :: q_m
    real(8) :: tmp
    if ((4.0d0 * (q_m ** 2.0d0)) <= 5d-74) then
        tmp = (p - p) * 0.5d0
    else
        tmp = -q_m
    end if
    code = tmp
end function

Java

q_m = Math.abs(q);
assert p < r && r < q_m;
public static double code(double p, double r, double q_m) {
	double tmp;
	if ((4.0 * Math.pow(q_m, 2.0)) <= 5e-74) {
		tmp = (p - p) * 0.5;
	} else {
		tmp = -q_m;
	}
	return tmp;
}

Python

q_m = math.fabs(q)
[p, r, q_m] = sort([p, r, q_m])
def code(p, r, q_m):
	tmp = 0
	if (4.0 * math.pow(q_m, 2.0)) <= 5e-74:
		tmp = (p - p) * 0.5
	else:
		tmp = -q_m
	return tmp

Julia

q_m = abs(q)
p, r, q_m = sort([p, r, q_m])
function code(p, r, q_m)
	tmp = 0.0
	if (Float64(4.0 * (q_m ^ 2.0)) <= 5e-74)
		tmp = Float64(Float64(p - p) * 0.5);
	else
		tmp = Float64(-q_m);
	end
	return tmp
end

MATLAB

q_m = abs(q);
p, r, q_m = num2cell(sort([p, r, q_m])){:}
function tmp_2 = code(p, r, q_m)
	tmp = 0.0;
	if ((4.0 * (q_m ^ 2.0)) <= 5e-74)
		tmp = (p - p) * 0.5;
	else
		tmp = -q_m;
	end
	tmp_2 = tmp;
end

Wolfram

q_m = N[Abs[q], $MachinePrecision]
NOTE: p, r, and q_m should be sorted in increasing order before calling this function.
code[p_, r_, q$95$m_] := If[LessEqual[N[(4.0 * N[Power[q$95$m, 2.0], $MachinePrecision]), $MachinePrecision], 5e-74], N[(N[(p - p), $MachinePrecision] * 0.5), $MachinePrecision], (-q$95$m)]

Derivation

1. Split input into 2 regimes

2. if (*.f64 #s(literal 4 binary64) (pow.f64 q #s(literal 2 binary64))) < 4.99999999999999998e-74

   1. Initial program 20.4%

      \[\frac{1}{2} \cdot \left(\left(\left|p\right| + \left|r\right|\right) - \sqrt{{\left(p - r\right)}^{2} + 4 \cdot {q}^{2}}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in p around -inf

      \[\leadsto \color{blue}{-1 \cdot \left(p \cdot \left(\frac{-1}{2} \cdot \frac{\left(\left|p\right| + \left|r\right|\right) - r}{p} - \frac{1}{2}\right)\right)} \]
   4. Step-by-step derivation

      1. metadata-eval N/A

         \[\leadsto -1 \cdot \left(p \cdot \left(\frac{-1}{2} \cdot \frac{\left(\left|p\right| + \left|r\right|\right) - r}{p} - \frac{1}{\color{blue}{2}}\right)\right) \]

      2. associate-*r* N/A

         \[\leadsto \left(-1 \cdot p\right) \cdot \color{blue}{\left(\frac{-1}{2} \cdot \frac{\left(\left|p\right| + \left|r\right|\right) - r}{p} - \frac{1}{2}\right)} \]

      3. mul-1-neg N/A

         \[\leadsto \left(\mathsf{neg}\left(p\right)\right) \cdot \left(\color{blue}{\frac{-1}{2} \cdot \frac{\left(\left|p\right| + \left|r\right|\right) - r}{p}} - \frac{1}{2}\right) \]

      4. lower-*.f64 N/A

         \[\leadsto \left(\mathsf{neg}\left(p\right)\right) \cdot \color{blue}{\left(\frac{-1}{2} \cdot \frac{\left(\left|p\right| + \left|r\right|\right) - r}{p} - \frac{1}{2}\right)} \]

      5. lower-neg.f64 N/A

         \[\leadsto \left(-p\right) \cdot \left(\color{blue}{\frac{-1}{2} \cdot \frac{\left(\left|p\right| + \left|r\right|\right) - r}{p}} - \frac{1}{2}\right) \]

      6. lower--.f64 N/A

         \[\leadsto \left(-p\right) \cdot \left(\frac{-1}{2} \cdot \frac{\left(\left|p\right| + \left|r\right|\right) - r}{p} - \color{blue}{\frac{1}{2}}\right) \]

   5. Applied rewrites 36.8%

      \[\leadsto \color{blue}{\left(-p\right) \cdot \left(\frac{\left|p\right| + \left(\left|r\right| - r\right)}{p} \cdot -0.5 - 0.5\right)} \]

   6. Taylor expanded in q around 0

      \[\leadsto \color{blue}{\frac{1}{2} \cdot \left(\left(r + \left(\left|p\right| + \left|r\right|\right)\right) - p\right)} \]
   7. Step-by-step derivation

      1. metadata-eval N/A

         \[\leadsto \frac{1}{2} \cdot \left(\color{blue}{\left(r + \left(\left|p\right| + \left|r\right|\right)\right)} - p\right) \]

      2. *-commutative N/A

         \[\leadsto \left(\left(r + \left(\left|p\right| + \left|r\right|\right)\right) - p\right) \cdot \color{blue}{\frac{1}{2}} \]

      3. lower-*.f64 N/A

         \[\leadsto \left(\left(r + \left(\left|p\right| + \left|r\right|\right)\right) - p\right) \cdot \color{blue}{\frac{1}{2}} \]

   8. Applied rewrites 23.7%

      \[\leadsto \color{blue}{\left(\left(\left(r + p\right) + r\right) - p\right) \cdot 0.5} \]

   9. Taylor expanded in p around inf

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

   11. Applied rewrites 45.4%

       \[\leadsto \left(p - p\right) \cdot 0.5 \]

   if 4.99999999999999998e-74 < (*.f64 #s(literal 4 binary64) (pow.f64 q #s(literal 2 binary64)))

   1. Initial program 29.8%

      \[\frac{1}{2} \cdot \left(\left(\left|p\right| + \left|r\right|\right) - \sqrt{{\left(p - r\right)}^{2} + 4 \cdot {q}^{2}}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in q around inf

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

      1. mul-1-neg N/A

         \[\leadsto \mathsf{neg}\left(q\right) \]

      2. lower-neg.f64 32.4

         \[\leadsto -q \]

   5. Applied rewrites 32.4%

      \[\leadsto \color{blue}{-q} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 5: 42.0% accurate, 27.7× speedup

Math

\[\begin{array}{l} q_m = \left|q\right| \\ [p, r, q_m] = \mathsf{sort}([p, r, q_m])\\ \\ \begin{array}{l} \mathbf{if}\;q\_m \leq 9.5 \cdot 10^{-45}:\\ \;\;\;\;p\\ \mathbf{else}:\\ \;\;\;\;-q\_m\\ \end{array} \end{array} \]

FPCore

q_m = (fabs.f64 q)
NOTE: p, r, and q_m should be sorted in increasing order before calling this function.
(FPCore (p r q_m) :precision binary64 (if (<= q_m 9.5e-45) p (- q_m)))

C

q_m = fabs(q);
assert(p < r && r < q_m);
double code(double p, double r, double q_m) {
	double tmp;
	if (q_m <= 9.5e-45) {
		tmp = p;
	} else {
		tmp = -q_m;
	}
	return tmp;
}

Fortran

q_m =     private
NOTE: p, r, and q_m should be sorted in increasing order before calling this function.
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(p, r, q_m)
use fmin_fmax_functions
    real(8), intent (in) :: p
    real(8), intent (in) :: r
    real(8), intent (in) :: q_m
    real(8) :: tmp
    if (q_m <= 9.5d-45) then
        tmp = p
    else
        tmp = -q_m
    end if
    code = tmp
end function

Java

q_m = Math.abs(q);
assert p < r && r < q_m;
public static double code(double p, double r, double q_m) {
	double tmp;
	if (q_m <= 9.5e-45) {
		tmp = p;
	} else {
		tmp = -q_m;
	}
	return tmp;
}

Python

q_m = math.fabs(q)
[p, r, q_m] = sort([p, r, q_m])
def code(p, r, q_m):
	tmp = 0
	if q_m <= 9.5e-45:
		tmp = p
	else:
		tmp = -q_m
	return tmp

Julia

q_m = abs(q)
p, r, q_m = sort([p, r, q_m])
function code(p, r, q_m)
	tmp = 0.0
	if (q_m <= 9.5e-45)
		tmp = p;
	else
		tmp = Float64(-q_m);
	end
	return tmp
end

MATLAB

q_m = abs(q);
p, r, q_m = num2cell(sort([p, r, q_m])){:}
function tmp_2 = code(p, r, q_m)
	tmp = 0.0;
	if (q_m <= 9.5e-45)
		tmp = p;
	else
		tmp = -q_m;
	end
	tmp_2 = tmp;
end

Wolfram

q_m = N[Abs[q], $MachinePrecision]
NOTE: p, r, and q_m should be sorted in increasing order before calling this function.
code[p_, r_, q$95$m_] := If[LessEqual[q$95$m, 9.5e-45], p, (-q$95$m)]

Derivation

1. Split input into 2 regimes

2. if q < 9.5000000000000002e-45

   1. Initial program 22.4%

      \[\frac{1}{2} \cdot \left(\left(\left|p\right| + \left|r\right|\right) - \sqrt{{\left(p - r\right)}^{2} + 4 \cdot {q}^{2}}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in p around -inf

      \[\leadsto \color{blue}{-1 \cdot \left(p \cdot \left(\frac{-1}{2} \cdot \frac{\left(\left|p\right| + \left|r\right|\right) - r}{p} - \frac{1}{2}\right)\right)} \]
   4. Step-by-step derivation

      1. metadata-eval N/A

         \[\leadsto -1 \cdot \left(p \cdot \left(\frac{-1}{2} \cdot \frac{\left(\left|p\right| + \left|r\right|\right) - r}{p} - \frac{1}{\color{blue}{2}}\right)\right) \]

      2. associate-*r* N/A

         \[\leadsto \left(-1 \cdot p\right) \cdot \color{blue}{\left(\frac{-1}{2} \cdot \frac{\left(\left|p\right| + \left|r\right|\right) - r}{p} - \frac{1}{2}\right)} \]

      3. mul-1-neg N/A

         \[\leadsto \left(\mathsf{neg}\left(p\right)\right) \cdot \left(\color{blue}{\frac{-1}{2} \cdot \frac{\left(\left|p\right| + \left|r\right|\right) - r}{p}} - \frac{1}{2}\right) \]

      4. lower-*.f64 N/A

         \[\leadsto \left(\mathsf{neg}\left(p\right)\right) \cdot \color{blue}{\left(\frac{-1}{2} \cdot \frac{\left(\left|p\right| + \left|r\right|\right) - r}{p} - \frac{1}{2}\right)} \]

      5. lower-neg.f64 N/A

         \[\leadsto \left(-p\right) \cdot \left(\color{blue}{\frac{-1}{2} \cdot \frac{\left(\left|p\right| + \left|r\right|\right) - r}{p}} - \frac{1}{2}\right) \]

      6. lower--.f64 N/A

         \[\leadsto \left(-p\right) \cdot \left(\frac{-1}{2} \cdot \frac{\left(\left|p\right| + \left|r\right|\right) - r}{p} - \color{blue}{\frac{1}{2}}\right) \]

   5. Applied rewrites 25.2%

      \[\leadsto \color{blue}{\left(-p\right) \cdot \left(\frac{\left|p\right| + \left(\left|r\right| - r\right)}{p} \cdot -0.5 - 0.5\right)} \]

   6. Taylor expanded in r around -inf

      \[\leadsto -1 \cdot \color{blue}{\left(r \cdot \left(\frac{1}{2} + \frac{p \cdot \left(\frac{-1}{2} \cdot \left(\frac{\left|p\right|}{p} + \frac{\left|r\right|}{p}\right) - \frac{1}{2}\right)}{r}\right)\right)} \]

   8. Applied rewrites 3.1%

      \[\leadsto \left(-r\right) \cdot \color{blue}{\mathsf{fma}\left(p, \frac{\frac{r + p}{p} \cdot -0.5 - 0.5}{r}, 0.5\right)} \]

   9. Taylor expanded in p around 0

      \[\leadsto p \]
   10. Step-by-step derivation

   11. Applied rewrites 11.4%

       \[\leadsto p \]

   if 9.5000000000000002e-45 < q

   1. Initial program 33.8%

      \[\frac{1}{2} \cdot \left(\left(\left|p\right| + \left|r\right|\right) - \sqrt{{\left(p - r\right)}^{2} + 4 \cdot {q}^{2}}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in q around inf

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

      1. mul-1-neg N/A

         \[\leadsto \mathsf{neg}\left(q\right) \]

      2. lower-neg.f64 64.9

         \[\leadsto -q \]

   5. Applied rewrites 64.9%

      \[\leadsto \color{blue}{-q} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 6: 16.0% accurate, 250.0× speedup

Math

\[\begin{array}{l} q_m = \left|q\right| \\ [p, r, q_m] = \mathsf{sort}([p, r, q_m])\\ \\ p \end{array} \]

FPCore

q_m = (fabs.f64 q)
NOTE: p, r, and q_m should be sorted in increasing order before calling this function.
(FPCore (p r q_m) :precision binary64 p)

C

q_m = fabs(q);
assert(p < r && r < q_m);
double code(double p, double r, double q_m) {
	return p;
}

Fortran

q_m =     private
NOTE: p, r, and q_m should be sorted in increasing order before calling this function.
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(p, r, q_m)
use fmin_fmax_functions
    real(8), intent (in) :: p
    real(8), intent (in) :: r
    real(8), intent (in) :: q_m
    code = p
end function

Java

q_m = Math.abs(q);
assert p < r && r < q_m;
public static double code(double p, double r, double q_m) {
	return p;
}

Python

q_m = math.fabs(q)
[p, r, q_m] = sort([p, r, q_m])
def code(p, r, q_m):
	return p

Julia

q_m = abs(q)
p, r, q_m = sort([p, r, q_m])
function code(p, r, q_m)
	return p
end

MATLAB

q_m = abs(q);
p, r, q_m = num2cell(sort([p, r, q_m])){:}
function tmp = code(p, r, q_m)
	tmp = p;
end

Wolfram

q_m = N[Abs[q], $MachinePrecision]
NOTE: p, r, and q_m should be sorted in increasing order before calling this function.
code[p_, r_, q$95$m_] := p

Derivation

1. Initial program 25.2%

   \[\frac{1}{2} \cdot \left(\left(\left|p\right| + \left|r\right|\right) - \sqrt{{\left(p - r\right)}^{2} + 4 \cdot {q}^{2}}\right) \]
2. Add Preprocessing

3. Taylor expanded in p around -inf

   \[\leadsto \color{blue}{-1 \cdot \left(p \cdot \left(\frac{-1}{2} \cdot \frac{\left(\left|p\right| + \left|r\right|\right) - r}{p} - \frac{1}{2}\right)\right)} \]
4. Step-by-step derivation

   1. metadata-eval N/A

      \[\leadsto -1 \cdot \left(p \cdot \left(\frac{-1}{2} \cdot \frac{\left(\left|p\right| + \left|r\right|\right) - r}{p} - \frac{1}{\color{blue}{2}}\right)\right) \]

   2. associate-*r* N/A

      \[\leadsto \left(-1 \cdot p\right) \cdot \color{blue}{\left(\frac{-1}{2} \cdot \frac{\left(\left|p\right| + \left|r\right|\right) - r}{p} - \frac{1}{2}\right)} \]

   3. mul-1-neg N/A

      \[\leadsto \left(\mathsf{neg}\left(p\right)\right) \cdot \left(\color{blue}{\frac{-1}{2} \cdot \frac{\left(\left|p\right| + \left|r\right|\right) - r}{p}} - \frac{1}{2}\right) \]

   4. lower-*.f64 N/A

      \[\leadsto \left(\mathsf{neg}\left(p\right)\right) \cdot \color{blue}{\left(\frac{-1}{2} \cdot \frac{\left(\left|p\right| + \left|r\right|\right) - r}{p} - \frac{1}{2}\right)} \]

   5. lower-neg.f64 N/A

      \[\leadsto \left(-p\right) \cdot \left(\color{blue}{\frac{-1}{2} \cdot \frac{\left(\left|p\right| + \left|r\right|\right) - r}{p}} - \frac{1}{2}\right) \]

   6. lower--.f64 N/A

      \[\leadsto \left(-p\right) \cdot \left(\frac{-1}{2} \cdot \frac{\left(\left|p\right| + \left|r\right|\right) - r}{p} - \color{blue}{\frac{1}{2}}\right) \]

5. Applied rewrites 20.1%

   \[\leadsto \color{blue}{\left(-p\right) \cdot \left(\frac{\left|p\right| + \left(\left|r\right| - r\right)}{p} \cdot -0.5 - 0.5\right)} \]

6. Taylor expanded in r around -inf

   \[\leadsto -1 \cdot \color{blue}{\left(r \cdot \left(\frac{1}{2} + \frac{p \cdot \left(\frac{-1}{2} \cdot \left(\frac{\left|p\right|}{p} + \frac{\left|r\right|}{p}\right) - \frac{1}{2}\right)}{r}\right)\right)} \]

8. Applied rewrites 3.1%

   \[\leadsto \left(-r\right) \cdot \color{blue}{\mathsf{fma}\left(p, \frac{\frac{r + p}{p} \cdot -0.5 - 0.5}{r}, 0.5\right)} \]

9. Taylor expanded in p around 0

   \[\leadsto p \]
10. Step-by-step derivation

11. Applied rewrites 9.4%

    \[\leadsto p \]
12. Add Preprocessing

Alternative 7: 3.3% accurate, 250.0× speedup

Math

\[\begin{array}{l} q_m = \left|q\right| \\ [p, r, q_m] = \mathsf{sort}([p, r, q_m])\\ \\ q\_m \end{array} \]

FPCore

q_m = (fabs.f64 q)
NOTE: p, r, and q_m should be sorted in increasing order before calling this function.
(FPCore (p r q_m) :precision binary64 q_m)

C

q_m = fabs(q);
assert(p < r && r < q_m);
double code(double p, double r, double q_m) {
	return q_m;
}

Fortran

q_m =     private
NOTE: p, r, and q_m should be sorted in increasing order before calling this function.
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(p, r, q_m)
use fmin_fmax_functions
    real(8), intent (in) :: p
    real(8), intent (in) :: r
    real(8), intent (in) :: q_m
    code = q_m
end function

Java

q_m = Math.abs(q);
assert p < r && r < q_m;
public static double code(double p, double r, double q_m) {
	return q_m;
}

Python

q_m = math.fabs(q)
[p, r, q_m] = sort([p, r, q_m])
def code(p, r, q_m):
	return q_m

Julia

q_m = abs(q)
p, r, q_m = sort([p, r, q_m])
function code(p, r, q_m)
	return q_m
end

MATLAB

q_m = abs(q);
p, r, q_m = num2cell(sort([p, r, q_m])){:}
function tmp = code(p, r, q_m)
	tmp = q_m;
end

Wolfram

q_m = N[Abs[q], $MachinePrecision]
NOTE: p, r, and q_m should be sorted in increasing order before calling this function.
code[p_, r_, q$95$m_] := q$95$m

Derivation

1. Initial program 25.2%

   \[\frac{1}{2} \cdot \left(\left(\left|p\right| + \left|r\right|\right) - \sqrt{{\left(p - r\right)}^{2} + 4 \cdot {q}^{2}}\right) \]
2. Add Preprocessing

3. Taylor expanded in q around -inf

   \[\leadsto \color{blue}{q} \]
4. Step-by-step derivation

5. Applied rewrites 18.7%

   \[\leadsto \color{blue}{q} \]
6. Add Preprocessing

Reproduce

herbie shell --seed 2025051 
(FPCore (p r q)
  :name "1/2(abs(p)+abs(r) - sqrt((p-r)^2 + 4q^2))"
  :precision binary64
  (* (/ 1.0 2.0) (- (+ (fabs p) (fabs r)) (sqrt (+ (pow (- p r) 2.0) (* 4.0 (pow q 2.0)))))))