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

Percentage Accurate: 45.1% → 81.8%

Time: 3.0s

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.1% 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.8% 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} t_0 := \left|p\right| + \left|r\right|\\ \mathbf{if}\;4 \cdot {q\_m}^{2} \leq 2 \cdot 10^{+182}:\\ \;\;\;\;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 (<= (* 4.0 (pow q_m 2.0)) 2e+182)
     (* 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 ((4.0 * pow(q_m, 2.0)) <= 2e+182) {
		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 ((4.0d0 * (q_m ** 2.0d0)) <= 2d+182) 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 ((4.0 * Math.pow(q_m, 2.0)) <= 2e+182) {
		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 (4.0 * math.pow(q_m, 2.0)) <= 2e+182:
		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 (Float64(4.0 * (q_m ^ 2.0)) <= 2e+182)
		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 ((4.0 * (q_m ^ 2.0)) <= 2e+182)
		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[N[(4.0 * N[Power[q$95$m, 2.0], $MachinePrecision]), $MachinePrecision], 2e+182], 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 (*.f64 #s(literal 4 binary64) (pow.f64 q #s(literal 2 binary64))) < 2.0000000000000001e182

   1. Initial program 57.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 p around -inf

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

      1. associate-*r* N/A

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

      2. 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) \cdot \left(\color{blue}{1} + -1 \cdot \frac{r}{p}\right)\right) \]

      3. lower-*.f64 N/A

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

      4. lower-neg.f64 N/A

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

      5. +-commutative N/A

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

      6. lower-+.f64 N/A

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

      7. associate-*r/ N/A

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

      8. mul-1-neg N/A

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

      9. lower-/.f64 N/A

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

      10. lower-neg.f64 74.6

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

   4. Applied rewrites 74.6%

      \[\leadsto \frac{1}{2} \cdot \left(\left(\left|p\right| + \left|r\right|\right) + \color{blue}{\left(-p\right) \cdot \left(\frac{-r}{p} + 1\right)}\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 86.6

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

   7. Applied rewrites 86.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 86.6

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

   9. Applied rewrites 86.6%

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

   if 2.0000000000000001e182 < (*.f64 #s(literal 4 binary64) (pow.f64 q #s(literal 2 binary64)))

   1. Initial program 23.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 \frac{1}{2} \cdot \left(\left(\left|p\right| + \left|r\right|\right) + \color{blue}{2 \cdot q}\right) \]
   3. 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 72.9

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

   4. Applied rewrites 72.9%

      \[\leadsto \frac{1}{2} \cdot \left(\left(\left|p\right| + \left|r\right|\right) + \color{blue}{\left(q + q\right)}\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) + \left(q + q\right)\right) \]

      2. metadata-eval 72.9

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

   6. Applied rewrites 72.9%

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

Alternative 2: 80.9% 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 2 \cdot 10^{+182}:\\ \;\;\;\;0.5 \cdot \left(\left(\left|p\right| + \left|r\right|\right) + \left(r - p\right)\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\frac{r}{q\_m}, 0.5, 1\right) \cdot 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)) 2e+182)
   (* 0.5 (+ (+ (fabs p) (fabs r)) (- r p)))
   (* (fma (/ r q_m) 0.5 1.0) 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)) <= 2e+182) {
		tmp = 0.5 * ((fabs(p) + fabs(r)) + (r - p));
	} else {
		tmp = fma((r / q_m), 0.5, 1.0) * 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)) <= 2e+182)
		tmp = Float64(0.5 * Float64(Float64(abs(p) + abs(r)) + Float64(r - p)));
	else
		tmp = Float64(fma(Float64(r / q_m), 0.5, 1.0) * q_m);
	end
	return 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], 2e+182], N[(0.5 * N[(N[(N[Abs[p], $MachinePrecision] + N[Abs[r], $MachinePrecision]), $MachinePrecision] + N[(r - p), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(r / q$95$m), $MachinePrecision] * 0.5 + 1.0), $MachinePrecision] * q$95$m), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 #s(literal 4 binary64) (pow.f64 q #s(literal 2 binary64))) < 2.0000000000000001e182

   1. Initial program 57.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 p around -inf

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

      1. associate-*r* N/A

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

      2. 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) \cdot \left(\color{blue}{1} + -1 \cdot \frac{r}{p}\right)\right) \]

      3. lower-*.f64 N/A

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

      4. lower-neg.f64 N/A

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

      5. +-commutative N/A

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

      6. lower-+.f64 N/A

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

      7. associate-*r/ N/A

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

      8. mul-1-neg N/A

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

      9. lower-/.f64 N/A

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

      10. lower-neg.f64 74.6

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

   4. Applied rewrites 74.6%

      \[\leadsto \frac{1}{2} \cdot \left(\left(\left|p\right| + \left|r\right|\right) + \color{blue}{\left(-p\right) \cdot \left(\frac{-r}{p} + 1\right)}\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 86.6

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

   7. Applied rewrites 86.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 86.6

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

   9. Applied rewrites 86.6%

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

   if 2.0000000000000001e182 < (*.f64 #s(literal 4 binary64) (pow.f64 q #s(literal 2 binary64)))

   1. Initial program 23.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 \cdot \left(1 + \frac{1}{2} \cdot \frac{\left|p\right| + \left|r\right|}{q}\right)} \]
   3. Step-by-step derivation

      1. metadata-eval N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

   4. Applied rewrites 69.4%

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

   5. Taylor expanded in p around 0

      \[\leadsto \mathsf{fma}\left(\frac{r}{q}, \frac{1}{2}, 1\right) \cdot q \]
   6. Step-by-step derivation

   7. Applied rewrites 70.5%

      \[\leadsto \mathsf{fma}\left(\frac{r}{q}, 0.5, 1\right) \cdot q \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 3: 58.4% accurate, 2.4× 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|\\ t_1 := 0.5 \cdot \left(t\_0 + r\right)\\ \mathbf{if}\;q\_m \leq 3.8 \cdot 10^{-242}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;q\_m \leq 1.25 \cdot 10^{-58}:\\ \;\;\;\;0.5 \cdot \left(t\_0 + \left(-p\right)\right)\\ \mathbf{elif}\;q\_m \leq 3.1 \cdot 10^{+16}:\\ \;\;\;\;t\_1\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\frac{r}{q\_m}, 0.5, 1\right) \cdot 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
 (let* ((t_0 (+ (fabs p) (fabs r))) (t_1 (* 0.5 (+ t_0 r))))
   (if (<= q_m 3.8e-242)
     t_1
     (if (<= q_m 1.25e-58)
       (* 0.5 (+ t_0 (- p)))
       (if (<= q_m 3.1e+16) t_1 (* (fma (/ r q_m) 0.5 1.0) 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 t_1 = 0.5 * (t_0 + r);
	double tmp;
	if (q_m <= 3.8e-242) {
		tmp = t_1;
	} else if (q_m <= 1.25e-58) {
		tmp = 0.5 * (t_0 + -p);
	} else if (q_m <= 3.1e+16) {
		tmp = t_1;
	} else {
		tmp = fma((r / q_m), 0.5, 1.0) * 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))
	t_1 = Float64(0.5 * Float64(t_0 + r))
	tmp = 0.0
	if (q_m <= 3.8e-242)
		tmp = t_1;
	elseif (q_m <= 1.25e-58)
		tmp = Float64(0.5 * Float64(t_0 + Float64(-p)));
	elseif (q_m <= 3.1e+16)
		tmp = t_1;
	else
		tmp = Float64(fma(Float64(r / q_m), 0.5, 1.0) * q_m);
	end
	return 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]}, Block[{t$95$1 = N[(0.5 * N[(t$95$0 + r), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[q$95$m, 3.8e-242], t$95$1, If[LessEqual[q$95$m, 1.25e-58], N[(0.5 * N[(t$95$0 + (-p)), $MachinePrecision]), $MachinePrecision], If[LessEqual[q$95$m, 3.1e+16], t$95$1, N[(N[(N[(r / q$95$m), $MachinePrecision] * 0.5 + 1.0), $MachinePrecision] * q$95$m), $MachinePrecision]]]]]]

Derivation

1. Split input into 3 regimes

2. if q < 3.8000000000000002e-242 or 1.24999999999999994e-58 < q < 3.1e16

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

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

      1. associate-*r* N/A

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

      2. 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) \cdot \left(\color{blue}{1} + -1 \cdot \frac{r}{p}\right)\right) \]

      3. lower-*.f64 N/A

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

      4. lower-neg.f64 N/A

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

      5. +-commutative N/A

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

      6. lower-+.f64 N/A

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

      7. associate-*r/ N/A

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

      8. mul-1-neg N/A

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

      9. lower-/.f64 N/A

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

      10. lower-neg.f64 77.0

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

   4. Applied rewrites 77.0%

      \[\leadsto \frac{1}{2} \cdot \left(\left(\left|p\right| + \left|r\right|\right) + \color{blue}{\left(-p\right) \cdot \left(\frac{-r}{p} + 1\right)}\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 53.3%

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

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

   9. Applied rewrites 53.3%

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

   if 3.8000000000000002e-242 < q < 1.24999999999999994e-58

   1. Initial program 56.5%

      \[\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}{-1 \cdot p}\right) \]
   3. 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 54.6

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

   4. Applied rewrites 54.6%

      \[\leadsto \frac{1}{2} \cdot \left(\left(\left|p\right| + \left|r\right|\right) + \color{blue}{\left(-p\right)}\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) + \left(-p\right)\right) \]

      2. metadata-eval 54.6

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

   6. Applied rewrites 54.6%

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

   if 3.1e16 < q

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

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

      1. metadata-eval N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

   4. Applied rewrites 17.7%

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

   5. Taylor expanded in p around 0

      \[\leadsto \mathsf{fma}\left(\frac{r}{q}, \frac{1}{2}, 1\right) \cdot q \]
   6. Step-by-step derivation

   7. Applied rewrites 19.0%

      \[\leadsto \mathsf{fma}\left(\frac{r}{q}, 0.5, 1\right) \cdot q \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 4: 58.4% accurate, 3.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}\;q\_m \leq 3.1 \cdot 10^{+16}:\\ \;\;\;\;0.5 \cdot \left(\left(\left|p\right| + \left|r\right|\right) + r\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\frac{r}{q\_m}, 0.5, 1\right) \cdot 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 3.1e+16)
   (* 0.5 (+ (+ (fabs p) (fabs r)) r))
   (* (fma (/ r q_m) 0.5 1.0) 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 <= 3.1e+16) {
		tmp = 0.5 * ((fabs(p) + fabs(r)) + r);
	} else {
		tmp = fma((r / q_m), 0.5, 1.0) * 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 <= 3.1e+16)
		tmp = Float64(0.5 * Float64(Float64(abs(p) + abs(r)) + r));
	else
		tmp = Float64(fma(Float64(r / q_m), 0.5, 1.0) * q_m);
	end
	return 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, 3.1e+16], N[(0.5 * N[(N[(N[Abs[p], $MachinePrecision] + N[Abs[r], $MachinePrecision]), $MachinePrecision] + r), $MachinePrecision]), $MachinePrecision], N[(N[(N[(r / q$95$m), $MachinePrecision] * 0.5 + 1.0), $MachinePrecision] * q$95$m), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if q < 3.1e16

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

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

      1. associate-*r* N/A

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

      2. 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) \cdot \left(\color{blue}{1} + -1 \cdot \frac{r}{p}\right)\right) \]

      3. lower-*.f64 N/A

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

      4. lower-neg.f64 N/A

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

      5. +-commutative N/A

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

      6. lower-+.f64 N/A

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

      7. associate-*r/ N/A

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

      8. mul-1-neg N/A

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

      9. lower-/.f64 N/A

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

      10. lower-neg.f64 79.1

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

   4. Applied rewrites 79.1%

      \[\leadsto \frac{1}{2} \cdot \left(\left(\left|p\right| + \left|r\right|\right) + \color{blue}{\left(-p\right) \cdot \left(\frac{-r}{p} + 1\right)}\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 54.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 54.1

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

   9. Applied rewrites 54.1%

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

   if 3.1e16 < q

   1. Initial program 32.7%

      \[\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 \cdot \left(1 + \frac{1}{2} \cdot \frac{\left|p\right| + \left|r\right|}{q}\right)} \]
   3. Step-by-step derivation

      1. metadata-eval N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

   4. Applied rewrites 62.0%

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

   5. Taylor expanded in p around 0

      \[\leadsto \mathsf{fma}\left(\frac{r}{q}, \frac{1}{2}, 1\right) \cdot q \]
   6. Step-by-step derivation

   7. Applied rewrites 63.2%

      \[\leadsto \mathsf{fma}\left(\frac{r}{q}, 0.5, 1\right) \cdot q \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 5: 57.8% 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 3.1 \cdot 10^{+16}:\\ \;\;\;\;0.5 \cdot \left(\left(\left|p\right| + \left|r\right|\right) + r\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(r + p, 0.5, q\_m\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
 (if (<= q_m 3.1e+16)
   (* 0.5 (+ (+ (fabs p) (fabs r)) r))
   (fma (+ r 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 (q_m <= 3.1e+16) {
		tmp = 0.5 * ((fabs(p) + fabs(r)) + r);
	} else {
		tmp = fma((r + p), 0.5, 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 <= 3.1e+16)
		tmp = Float64(0.5 * Float64(Float64(abs(p) + abs(r)) + r));
	else
		tmp = fma(Float64(r + p), 0.5, q_m);
	end
	return 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, 3.1e+16], N[(0.5 * N[(N[(N[Abs[p], $MachinePrecision] + N[Abs[r], $MachinePrecision]), $MachinePrecision] + r), $MachinePrecision]), $MachinePrecision], N[(N[(r + p), $MachinePrecision] * 0.5 + q$95$m), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if q < 3.1e16

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

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

      1. associate-*r* N/A

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

      2. 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) \cdot \left(\color{blue}{1} + -1 \cdot \frac{r}{p}\right)\right) \]

      3. lower-*.f64 N/A

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

      4. lower-neg.f64 N/A

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

      5. +-commutative N/A

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

      6. lower-+.f64 N/A

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

      7. associate-*r/ N/A

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

      8. mul-1-neg N/A

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

      9. lower-/.f64 N/A

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

      10. lower-neg.f64 79.1

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

   4. Applied rewrites 79.1%

      \[\leadsto \frac{1}{2} \cdot \left(\left(\left|p\right| + \left|r\right|\right) + \color{blue}{\left(-p\right) \cdot \left(\frac{-r}{p} + 1\right)}\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 54.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 54.1

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

   9. Applied rewrites 54.1%

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

   if 3.1e16 < q

   1. Initial program 32.7%

      \[\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 \cdot \left(1 + \frac{1}{2} \cdot \frac{\left|p\right| + \left|r\right|}{q}\right)} \]
   3. Step-by-step derivation

      1. metadata-eval N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

   4. Applied rewrites 62.0%

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

   5. Taylor expanded in q around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. +-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. lift-+.f64 62.0

         \[\leadsto \mathsf{fma}\left(r + p, 0.5, q\right) \]

   7. Applied rewrites 62.0%

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

Alternative 6: 54.3% accurate, 4.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 2.9 \cdot 10^{+16}:\\ \;\;\;\;r\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(r + p, 0.5, q\_m\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
 (if (<= q_m 2.9e+16) r (fma (+ r 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 (q_m <= 2.9e+16) {
		tmp = r;
	} else {
		tmp = fma((r + p), 0.5, 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 <= 2.9e+16)
		tmp = r;
	else
		tmp = fma(Float64(r + p), 0.5, q_m);
	end
	return 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, 2.9e+16], r, N[(N[(r + p), $MachinePrecision] * 0.5 + q$95$m), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if q < 2.9e16

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

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

      1. metadata-eval N/A

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

      2. metadata-eval N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

   4. Applied rewrites 47.4%

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

   5. Taylor expanded in p around 0

      \[\leadsto r \]
   6. Step-by-step derivation

   7. Applied rewrites 47.4%

      \[\leadsto r \]

   if 2.9e16 < q

   1. Initial program 32.7%

      \[\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 \cdot \left(1 + \frac{1}{2} \cdot \frac{\left|p\right| + \left|r\right|}{q}\right)} \]
   3. Step-by-step derivation

      1. metadata-eval N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

   4. Applied rewrites 62.0%

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

   5. Taylor expanded in q around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. +-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. lift-+.f64 62.0

         \[\leadsto \mathsf{fma}\left(r + p, 0.5, q\right) \]

   7. Applied rewrites 62.0%

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

Alternative 7: 53.5% 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}\;q\_m \leq 2.9 \cdot 10^{+16}:\\ \;\;\;\;r\\ \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 2.9e+16) 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 <= 2.9e+16) {
		tmp = 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 <= 2.9d+16) then
        tmp = 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 <= 2.9e+16) {
		tmp = 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 <= 2.9e+16:
		tmp = 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 <= 2.9e+16)
		tmp = 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 <= 2.9e+16)
		tmp = 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, 2.9e+16], r, q$95$m]

Derivation

1. Split input into 2 regimes

2. if q < 2.9e16

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

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

      1. metadata-eval N/A

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

      2. metadata-eval N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

   4. Applied rewrites 47.4%

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

   5. Taylor expanded in p around 0

      \[\leadsto r \]
   6. Step-by-step derivation

   7. Applied rewrites 47.4%

      \[\leadsto r \]

   if 2.9e16 < q

   1. Initial program 32.7%

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

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

Alternative 8: 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])\\ \\ 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 45.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 35.0%

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

Reproduce

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