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

Percentage Accurate: 45.6% → 81.7%

Time: 3.4s

Alternatives: 8

Speedup: 11.9×

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: 45.6% 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: 81.7% accurate, 3.1× 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 := \left|p\right| + \left|r\right|\\ \mathbf{if}\;q\_m \leq 5.5 \cdot 10^{+129}:\\ \;\;\;\;0.5 \cdot \left(t\_0 + \left(r - p\right)\right)\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \left(t\_0 + \left(q\_m + q\_m\right)\right)\\ \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 (+ (fabs p) (fabs r))))
   (if (<= q_m 5.5e+129) (* 0.5 (+ t_0 (- r p))) (* 0.5 (+ t_0 (+ q_m q_m))))))

C

q_m = fabs(q);
assert(p < r && r < q_m);
double code(double p, double r, double q_m) {
	double t_0 = fabs(p) + fabs(r);
	double tmp;
	if (q_m <= 5.5e+129) {
		tmp = 0.5 * (t_0 + (r - p));
	} else {
		tmp = 0.5 * (t_0 + (q_m + 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) :: t_0
    real(8) :: tmp
    t_0 = abs(p) + abs(r)
    if (q_m <= 5.5d+129) then
        tmp = 0.5d0 * (t_0 + (r - p))
    else
        tmp = 0.5d0 * (t_0 + (q_m + 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 t_0 = Math.abs(p) + Math.abs(r);
	double tmp;
	if (q_m <= 5.5e+129) {
		tmp = 0.5 * (t_0 + (r - p));
	} else {
		tmp = 0.5 * (t_0 + (q_m + 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):
	t_0 = math.fabs(p) + math.fabs(r)
	tmp = 0
	if q_m <= 5.5e+129:
		tmp = 0.5 * (t_0 + (r - p))
	else:
		tmp = 0.5 * (t_0 + (q_m + q_m))
	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(abs(p) + abs(r))
	tmp = 0.0
	if (q_m <= 5.5e+129)
		tmp = Float64(0.5 * Float64(t_0 + Float64(r - p)));
	else
		tmp = Float64(0.5 * Float64(t_0 + Float64(q_m + 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)
	t_0 = abs(p) + abs(r);
	tmp = 0.0;
	if (q_m <= 5.5e+129)
		tmp = 0.5 * (t_0 + (r - p));
	else
		tmp = 0.5 * (t_0 + (q_m + 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_] := Block[{t$95$0 = N[(N[Abs[p], $MachinePrecision] + N[Abs[r], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[q$95$m, 5.5e+129], N[(0.5 * N[(t$95$0 + N[(r - p), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(0.5 * N[(t$95$0 + N[(q$95$m + q$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if q < 5.49999999999999984e129

   1. Initial program 58.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. Taylor expanded in r around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

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

      4. lower-+.f64 N/A

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

      5. associate-*r/ N/A

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

      6. mul-1-neg N/A

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

      7. lower-/.f64 N/A

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

      8. lower-neg.f64 71.9

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

   4. Applied rewrites 71.9%

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

   5. Taylor expanded in p around 0

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

      1. fp-cancel-sign-sub-inv N/A

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

      2. metadata-eval N/A

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

      3. metadata-eval N/A

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

      4. unpow1 N/A

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

      5. metadata-eval N/A

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

      6. sqrt-pow1 N/A

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

      7. unpow2 N/A

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

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

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

      9. fabs-mul N/A

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

      10. mul-1-neg N/A

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

      11. neg-fabs N/A

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

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

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

      13. unpow2 N/A

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

      14. sqrt-pow1 N/A

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

      15. metadata-eval N/A

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

      16. unpow1 N/A

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

      17. lower--.f64 83.4

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

   7. Applied rewrites 83.4%

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

      1. lift-/.f64 N/A

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

      2. metadata-eval 83.4

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

   9. Applied rewrites 83.4%

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

   if 5.49999999999999984e129 < q

   1. Initial program 14.1%

      \[\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. Taylor expanded in r around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

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

      4. lower-+.f64 N/A

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

      5. associate-*r/ N/A

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

      6. mul-1-neg N/A

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

      7. lower-/.f64 N/A

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

      8. lower-neg.f64 23.9

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

   4. Applied rewrites 23.9%

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

   5. Taylor expanded in p around 0

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

      1. fp-cancel-sign-sub-inv N/A

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

      2. metadata-eval N/A

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

      3. metadata-eval N/A

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

      4. unpow1 N/A

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

      5. metadata-eval N/A

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

      6. sqrt-pow1 N/A

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

      7. unpow2 N/A

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

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

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

      9. fabs-mul N/A

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

      10. mul-1-neg N/A

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

      11. neg-fabs N/A

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

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

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

      13. unpow2 N/A

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

      14. sqrt-pow1 N/A

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

      15. metadata-eval N/A

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

      16. unpow1 N/A

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

      17. lower--.f64 29.6

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

   7. Applied rewrites 29.6%

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

      1. lift-/.f64 N/A

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

      2. metadata-eval 29.6

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

   9. Applied rewrites 29.6%

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

   10. Taylor expanded in q around inf

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

       1. count-2-rev N/A

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

       2. lower-+.f64 77.6

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

   12. Applied rewrites 77.6%

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

Alternative 2: 80.7% accurate, 1.5× 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 10^{+260}:\\ \;\;\;\;0.5 \cdot \left(\left(\left|p\right| + \left|r\right|\right) + \left(r - p\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)) 1e+260)
   (* 0.5 (+ (+ (fabs p) (fabs r)) (- r 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)) <= 1e+260) {
		tmp = 0.5 * ((fabs(p) + fabs(r)) + (r - 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)) <= 1d+260) then
        tmp = 0.5d0 * ((abs(p) + abs(r)) + (r - 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)) <= 1e+260) {
		tmp = 0.5 * ((Math.abs(p) + Math.abs(r)) + (r - 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)) <= 1e+260:
		tmp = 0.5 * ((math.fabs(p) + math.fabs(r)) + (r - 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)) <= 1e+260)
		tmp = Float64(0.5 * Float64(Float64(abs(p) + abs(r)) + Float64(r - p)));
	else
		tmp = 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)) <= 1e+260)
		tmp = 0.5 * ((abs(p) + abs(r)) + (r - 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], 1e+260], N[(0.5 * N[(N[(N[Abs[p], $MachinePrecision] + N[Abs[r], $MachinePrecision]), $MachinePrecision] + N[(r - p), $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))) < 1.00000000000000007e260

   1. Initial program 58.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. Taylor expanded in r around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

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

      4. lower-+.f64 N/A

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

      5. associate-*r/ N/A

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

      6. mul-1-neg N/A

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

      7. lower-/.f64 N/A

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

      8. lower-neg.f64 71.9

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

   4. Applied rewrites 71.9%

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

   5. Taylor expanded in p around 0

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

      1. fp-cancel-sign-sub-inv N/A

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

      2. metadata-eval N/A

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

      3. metadata-eval N/A

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

      4. unpow1 N/A

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

      5. metadata-eval N/A

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

      6. sqrt-pow1 N/A

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

      7. unpow2 N/A

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

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

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

      9. fabs-mul N/A

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

      10. mul-1-neg N/A

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

      11. neg-fabs N/A

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

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

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

      13. unpow2 N/A

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

      14. sqrt-pow1 N/A

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

      15. metadata-eval N/A

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

      16. unpow1 N/A

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

      17. lower--.f64 83.4

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

   7. Applied rewrites 83.4%

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

      1. lift-/.f64 N/A

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

      2. metadata-eval 83.4

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

   9. Applied rewrites 83.4%

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

   if 1.00000000000000007e260 < (*.f64 #s(literal 4 binary64) (pow.f64 q #s(literal 2 binary64)))

   1. Initial program 14.1%

      \[\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. Taylor expanded in q around inf

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

   4. Applied rewrites 73.9%

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

Alternative 3: 61.4% accurate, 2.9× 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 := \left|p\right| + \left|r\right|\\ \mathbf{if}\;r \leq 3.2 \cdot 10^{-265}:\\ \;\;\;\;0.5 \cdot \left(t\_0 + \left(-p\right)\right)\\ \mathbf{elif}\;r \leq 3.6 \cdot 10^{-91}:\\ \;\;\;\;q\_m\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \left(t\_0 + r\right)\\ \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 (+ (fabs p) (fabs r))))
   (if (<= r 3.2e-265)
     (* 0.5 (+ t_0 (- p)))
     (if (<= r 3.6e-91) q_m (* 0.5 (+ t_0 r))))))

C

q_m = fabs(q);
assert(p < r && r < q_m);
double code(double p, double r, double q_m) {
	double t_0 = fabs(p) + fabs(r);
	double tmp;
	if (r <= 3.2e-265) {
		tmp = 0.5 * (t_0 + -p);
	} else if (r <= 3.6e-91) {
		tmp = q_m;
	} else {
		tmp = 0.5 * (t_0 + r);
	}
	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 = abs(p) + abs(r)
    if (r <= 3.2d-265) then
        tmp = 0.5d0 * (t_0 + -p)
    else if (r <= 3.6d-91) then
        tmp = q_m
    else
        tmp = 0.5d0 * (t_0 + r)
    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 = Math.abs(p) + Math.abs(r);
	double tmp;
	if (r <= 3.2e-265) {
		tmp = 0.5 * (t_0 + -p);
	} else if (r <= 3.6e-91) {
		tmp = q_m;
	} else {
		tmp = 0.5 * (t_0 + r);
	}
	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 = math.fabs(p) + math.fabs(r)
	tmp = 0
	if r <= 3.2e-265:
		tmp = 0.5 * (t_0 + -p)
	elif r <= 3.6e-91:
		tmp = q_m
	else:
		tmp = 0.5 * (t_0 + r)
	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(abs(p) + abs(r))
	tmp = 0.0
	if (r <= 3.2e-265)
		tmp = Float64(0.5 * Float64(t_0 + Float64(-p)));
	elseif (r <= 3.6e-91)
		tmp = q_m;
	else
		tmp = Float64(0.5 * Float64(t_0 + r));
	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 = abs(p) + abs(r);
	tmp = 0.0;
	if (r <= 3.2e-265)
		tmp = 0.5 * (t_0 + -p);
	elseif (r <= 3.6e-91)
		tmp = q_m;
	else
		tmp = 0.5 * (t_0 + r);
	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[(N[Abs[p], $MachinePrecision] + N[Abs[r], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[r, 3.2e-265], N[(0.5 * N[(t$95$0 + (-p)), $MachinePrecision]), $MachinePrecision], If[LessEqual[r, 3.6e-91], q$95$m, N[(0.5 * N[(t$95$0 + r), $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if r < 3.2e-265

   1. Initial program 46.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. Taylor expanded in r around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

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

      4. lower-+.f64 N/A

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

      5. associate-*r/ N/A

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

      6. mul-1-neg N/A

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

      7. lower-/.f64 N/A

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

      8. lower-neg.f64 44.2

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

   4. Applied rewrites 44.2%

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

   5. Taylor expanded in p around 0

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

      1. fp-cancel-sign-sub-inv N/A

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

      2. metadata-eval N/A

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

      3. metadata-eval N/A

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

      4. unpow1 N/A

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

      5. metadata-eval N/A

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

      6. sqrt-pow1 N/A

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

      7. unpow2 N/A

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

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

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

      9. fabs-mul N/A

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

      10. mul-1-neg N/A

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

      11. neg-fabs N/A

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

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

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

      13. unpow2 N/A

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

      14. sqrt-pow1 N/A

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

      15. metadata-eval N/A

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

      16. unpow1 N/A

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

      17. lower--.f64 65.1

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

   7. Applied rewrites 65.1%

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

      1. lift-/.f64 N/A

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

      2. metadata-eval 65.1

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

   9. Applied rewrites 65.1%

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

   10. Taylor expanded in p around -inf

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

       1. mul-1-neg N/A

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

       2. lower-neg.f64 64.1

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

   12. Applied rewrites 64.1%

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

   if 3.2e-265 < r < 3.6e-91

   1. Initial program 57.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. Taylor expanded in q around inf

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

   4. Applied rewrites 54.4%

      \[\leadsto \color{blue}{q} \]

   if 3.6e-91 < r

   1. Initial program 41.6%

      \[\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. Taylor expanded in r around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

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

      4. lower-+.f64 N/A

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

      5. associate-*r/ N/A

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

      6. mul-1-neg N/A

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

      7. lower-/.f64 N/A

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

      8. lower-neg.f64 74.4

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

   4. Applied rewrites 74.4%

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

   5. Taylor expanded in p around 0

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

   7. Applied rewrites 62.1%

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

      1. lift-/.f64 N/A

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

      2. metadata-eval 62.1

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

   9. Applied rewrites 62.1%

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

Alternative 4: 57.3% accurate, 3.6× 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 6.6 \cdot 10^{+40}:\\ \;\;\;\;0.5 \cdot \left(\left(\left|p\right| + \left|r\right|\right) + r\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 (<= q_m 6.6e+40) (* 0.5 (+ (+ (fabs p) (fabs r)) r)) 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 <= 6.6e+40) {
		tmp = 0.5 * ((fabs(p) + fabs(r)) + r);
	} 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 <= 6.6d+40) then
        tmp = 0.5d0 * ((abs(p) + abs(r)) + r)
    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 <= 6.6e+40) {
		tmp = 0.5 * ((Math.abs(p) + Math.abs(r)) + r);
	} 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 <= 6.6e+40:
		tmp = 0.5 * ((math.fabs(p) + math.fabs(r)) + r)
	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 <= 6.6e+40)
		tmp = Float64(0.5 * Float64(Float64(abs(p) + abs(r)) + r));
	else
		tmp = 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 <= 6.6e+40)
		tmp = 0.5 * ((abs(p) + abs(r)) + r);
	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, 6.6e+40], N[(0.5 * N[(N[(N[Abs[p], $MachinePrecision] + N[Abs[r], $MachinePrecision]), $MachinePrecision] + r), $MachinePrecision]), $MachinePrecision], q$95$m]

Derivation

1. Split input into 2 regimes

2. if q < 6.5999999999999997e40

   1. Initial program 58.1%

      \[\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. Taylor expanded in r around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

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

      4. lower-+.f64 N/A

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

      5. associate-*r/ N/A

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

      6. mul-1-neg N/A

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

      7. lower-/.f64 N/A

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

      8. lower-neg.f64 77.9

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

   4. Applied rewrites 77.9%

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

   5. Taylor expanded in p around 0

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

   7. Applied rewrites 52.7%

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

      1. lift-/.f64 N/A

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

      2. metadata-eval 52.7

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

   9. Applied rewrites 52.7%

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

   if 6.5999999999999997e40 < q

   1. Initial program 29.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. Taylor expanded in q around inf

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

   4. Applied rewrites 63.3%

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

Alternative 5: 57.3% accurate, 3.6× 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 6.6 \cdot 10^{+40}:\\ \;\;\;\;0.5 \cdot \left(\left|p\right| + \left(\left|r\right| + r\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 (<= q_m 6.6e+40) (* 0.5 (+ (fabs p) (+ (fabs r) r))) 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 <= 6.6e+40) {
		tmp = 0.5 * (fabs(p) + (fabs(r) + r));
	} 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 <= 6.6d+40) then
        tmp = 0.5d0 * (abs(p) + (abs(r) + r))
    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 <= 6.6e+40) {
		tmp = 0.5 * (Math.abs(p) + (Math.abs(r) + r));
	} 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 <= 6.6e+40:
		tmp = 0.5 * (math.fabs(p) + (math.fabs(r) + r))
	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 <= 6.6e+40)
		tmp = Float64(0.5 * Float64(abs(p) + Float64(abs(r) + r)));
	else
		tmp = 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 <= 6.6e+40)
		tmp = 0.5 * (abs(p) + (abs(r) + r));
	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, 6.6e+40], N[(0.5 * N[(N[Abs[p], $MachinePrecision] + N[(N[Abs[r], $MachinePrecision] + r), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], q$95$m]

Derivation

1. Split input into 2 regimes

2. if q < 6.5999999999999997e40

   1. Initial program 58.1%

      \[\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. Taylor expanded in r around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

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

      4. lower-+.f64 N/A

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

      5. associate-*r/ N/A

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

      6. mul-1-neg N/A

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

      7. lower-/.f64 N/A

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

      8. lower-neg.f64 77.9

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

   4. Applied rewrites 77.9%

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

   5. Taylor expanded in p around 0

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

   7. Applied rewrites 52.7%

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

      1. lift-/.f64 N/A

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

      2. metadata-eval 52.7

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

   9. Applied rewrites 52.7%

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

       1. lift-+.f64 N/A

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

       2. lift-fabs.f64 N/A

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

       3. lift-fabs.f64 N/A

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

       4. lift-+.f64 N/A

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

       5. associate-+l+ N/A

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

       6. lower-+.f64 N/A

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

       7. lift-fabs.f64 N/A

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

       8. lower-+.f64 N/A

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

       9. lift-fabs.f64 52.7

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

   11. Applied rewrites 52.7%

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

   if 6.5999999999999997e40 < q

   1. Initial program 29.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. Taylor expanded in q around inf

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

   4. Applied rewrites 63.3%

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

Alternative 6: 54.8% accurate, 11.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}\;r \leq 1.85 \cdot 10^{-5}:\\ \;\;\;\;q\_m\\ \mathbf{else}:\\ \;\;\;\;r\\ \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 (<= r 1.85e-5) q_m r))

C

q_m = fabs(q);
assert(p < r && r < q_m);
double code(double p, double r, double q_m) {
	double tmp;
	if (r <= 1.85e-5) {
		tmp = q_m;
	} else {
		tmp = r;
	}
	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 (r <= 1.85d-5) then
        tmp = q_m
    else
        tmp = r
    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 (r <= 1.85e-5) {
		tmp = q_m;
	} else {
		tmp = r;
	}
	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 r <= 1.85e-5:
		tmp = q_m
	else:
		tmp = r
	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 (r <= 1.85e-5)
		tmp = q_m;
	else
		tmp = r;
	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 (r <= 1.85e-5)
		tmp = q_m;
	else
		tmp = r;
	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[r, 1.85e-5], q$95$m, r]

Derivation

1. Split input into 2 regimes

2. if r < 1.84999999999999991e-5

   1. Initial program 53.1%

      \[\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. Taylor expanded in q around inf

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

   4. Applied rewrites 44.8%

      \[\leadsto \color{blue}{q} \]

   if 1.84999999999999991e-5 < r

   1. Initial program 35.9%

      \[\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. Taylor expanded in p around inf

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

   4. Applied rewrites 14.1%

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

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

   6. Applied rewrites 13.7%

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

   7. Taylor expanded in p around -inf

      \[\leadsto \color{blue}{r} \]
   8. Step-by-step derivation

   9. Applied rewrites 67.6%

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

Alternative 7: 35.0% accurate, 56.9× speedup

Math

\[\begin{array}{l} q_m = \left|q\right| \\ [p, r, q_m] = \mathsf{sort}([p, r, q_m])\\ \\ r \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 r)

C

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

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

Python

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

Julia

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

MATLAB

q_m = abs(q);
p, r, q_m = num2cell(sort([p, r, q_m])){:}
function tmp = code(p, r, q_m)
	tmp = r;
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_] := r

Derivation

1. Initial program 45.6%

   \[\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. Taylor expanded in p around inf

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

4. Applied rewrites 8.5%

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

   1. lift-*.f64 N/A

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

   2. lift-/.f64 N/A

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

   3. *-commutative N/A

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

   4. lower-*.f64 N/A

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

6. Applied rewrites 7.6%

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

7. Taylor expanded in p around -inf

   \[\leadsto \color{blue}{r} \]
8. Step-by-step derivation

9. Applied rewrites 35.0%

   \[\leadsto \color{blue}{r} \]
10. Add Preprocessing

Alternative 8: 1.9% accurate, 56.9× 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 45.6%

   \[\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. Taylor expanded in p around inf

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

4. Applied rewrites 8.5%

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

   1. lift-*.f64 N/A

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

   2. lift-/.f64 N/A

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

   3. *-commutative N/A

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

   4. lower-*.f64 N/A

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

6. Applied rewrites 7.6%

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

7. Taylor expanded in p around inf

   \[\leadsto \color{blue}{p} \]
8. Step-by-step derivation

9. Applied rewrites 1.9%

   \[\leadsto \color{blue}{p} \]
10. Add Preprocessing

Reproduce

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