Main:z from

Percentage Accurate: 91.8% → 95.2%

Time: 19.9s

Alternatives: 20

Speedup: 1.0×

Specification

Math

\[\begin{array}{l} \\ \left(\left(\left(\sqrt{x + 1} - \sqrt{x}\right) + \left(\sqrt{y + 1} - \sqrt{y}\right)\right) + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (+
  (+
   (+ (- (sqrt (+ x 1.0)) (sqrt x)) (- (sqrt (+ y 1.0)) (sqrt y)))
   (- (sqrt (+ z 1.0)) (sqrt z)))
  (- (sqrt (+ t 1.0)) (sqrt t))))

C

double code(double x, double y, double z, double t) {
	return (((sqrt((x + 1.0)) - sqrt(x)) + (sqrt((y + 1.0)) - sqrt(y))) + (sqrt((z + 1.0)) - sqrt(z))) + (sqrt((t + 1.0)) - sqrt(t));
}

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(x, y, z, t)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    code = (((sqrt((x + 1.0d0)) - sqrt(x)) + (sqrt((y + 1.0d0)) - sqrt(y))) + (sqrt((z + 1.0d0)) - sqrt(z))) + (sqrt((t + 1.0d0)) - sqrt(t))
end function

Java

public static double code(double x, double y, double z, double t) {
	return (((Math.sqrt((x + 1.0)) - Math.sqrt(x)) + (Math.sqrt((y + 1.0)) - Math.sqrt(y))) + (Math.sqrt((z + 1.0)) - Math.sqrt(z))) + (Math.sqrt((t + 1.0)) - Math.sqrt(t));
}

Python

def code(x, y, z, t):
	return (((math.sqrt((x + 1.0)) - math.sqrt(x)) + (math.sqrt((y + 1.0)) - math.sqrt(y))) + (math.sqrt((z + 1.0)) - math.sqrt(z))) + (math.sqrt((t + 1.0)) - math.sqrt(t))

Julia

function code(x, y, z, t)
	return Float64(Float64(Float64(Float64(sqrt(Float64(x + 1.0)) - sqrt(x)) + Float64(sqrt(Float64(y + 1.0)) - sqrt(y))) + Float64(sqrt(Float64(z + 1.0)) - sqrt(z))) + Float64(sqrt(Float64(t + 1.0)) - sqrt(t)))
end

MATLAB

function tmp = code(x, y, z, t)
	tmp = (((sqrt((x + 1.0)) - sqrt(x)) + (sqrt((y + 1.0)) - sqrt(y))) + (sqrt((z + 1.0)) - sqrt(z))) + (sqrt((t + 1.0)) - sqrt(t));
end

Wolfram

code[x_, y_, z_, t_] := N[(N[(N[(N[(N[Sqrt[N[(x + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[x], $MachinePrecision]), $MachinePrecision] + N[(N[Sqrt[N[(y + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[Sqrt[N[(z + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[z], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[Sqrt[N[(t + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[t], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Initial Program: 91.8% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \left(\left(\left(\sqrt{x + 1} - \sqrt{x}\right) + \left(\sqrt{y + 1} - \sqrt{y}\right)\right) + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (+
  (+
   (+ (- (sqrt (+ x 1.0)) (sqrt x)) (- (sqrt (+ y 1.0)) (sqrt y)))
   (- (sqrt (+ z 1.0)) (sqrt z)))
  (- (sqrt (+ t 1.0)) (sqrt t))))

C

double code(double x, double y, double z, double t) {
	return (((sqrt((x + 1.0)) - sqrt(x)) + (sqrt((y + 1.0)) - sqrt(y))) + (sqrt((z + 1.0)) - sqrt(z))) + (sqrt((t + 1.0)) - sqrt(t));
}

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(x, y, z, t)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    code = (((sqrt((x + 1.0d0)) - sqrt(x)) + (sqrt((y + 1.0d0)) - sqrt(y))) + (sqrt((z + 1.0d0)) - sqrt(z))) + (sqrt((t + 1.0d0)) - sqrt(t))
end function

Java

public static double code(double x, double y, double z, double t) {
	return (((Math.sqrt((x + 1.0)) - Math.sqrt(x)) + (Math.sqrt((y + 1.0)) - Math.sqrt(y))) + (Math.sqrt((z + 1.0)) - Math.sqrt(z))) + (Math.sqrt((t + 1.0)) - Math.sqrt(t));
}

Python

def code(x, y, z, t):
	return (((math.sqrt((x + 1.0)) - math.sqrt(x)) + (math.sqrt((y + 1.0)) - math.sqrt(y))) + (math.sqrt((z + 1.0)) - math.sqrt(z))) + (math.sqrt((t + 1.0)) - math.sqrt(t))

Julia

function code(x, y, z, t)
	return Float64(Float64(Float64(Float64(sqrt(Float64(x + 1.0)) - sqrt(x)) + Float64(sqrt(Float64(y + 1.0)) - sqrt(y))) + Float64(sqrt(Float64(z + 1.0)) - sqrt(z))) + Float64(sqrt(Float64(t + 1.0)) - sqrt(t)))
end

MATLAB

function tmp = code(x, y, z, t)
	tmp = (((sqrt((x + 1.0)) - sqrt(x)) + (sqrt((y + 1.0)) - sqrt(y))) + (sqrt((z + 1.0)) - sqrt(z))) + (sqrt((t + 1.0)) - sqrt(t));
end

Wolfram

code[x_, y_, z_, t_] := N[(N[(N[(N[(N[Sqrt[N[(x + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[x], $MachinePrecision]), $MachinePrecision] + N[(N[Sqrt[N[(y + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[Sqrt[N[(z + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[z], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[Sqrt[N[(t + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[t], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Alternative 1: 95.2% accurate, 0.9× speedup

Math

\[\begin{array}{l} [x, y, z, t] = \mathsf{sort}([x, y, z, t])\\ \\ \begin{array}{l} t_1 := \sqrt{y + 1} - \sqrt{y}\\ t_2 := \sqrt{z + 1} - \sqrt{z}\\ t_3 := \sqrt{t + 1} - \sqrt{t}\\ \mathbf{if}\;x \leq 350000000:\\ \;\;\;\;\left(\left(\left(\sqrt{x + 1} - \sqrt{x}\right) + t\_1\right) + t\_2\right) + t\_3\\ \mathbf{else}:\\ \;\;\;\;\left(\left(\frac{0.5}{x \cdot \sqrt{\frac{1}{x}}} + t\_1\right) + t\_2\right) + t\_3\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (- (sqrt (+ y 1.0)) (sqrt y)))
        (t_2 (- (sqrt (+ z 1.0)) (sqrt z)))
        (t_3 (- (sqrt (+ t 1.0)) (sqrt t))))
   (if (<= x 350000000.0)
     (+ (+ (+ (- (sqrt (+ x 1.0)) (sqrt x)) t_1) t_2) t_3)
     (+ (+ (+ (/ 0.5 (* x (sqrt (/ 1.0 x)))) t_1) t_2) t_3))))

C

assert(x < y && y < z && z < t);
double code(double x, double y, double z, double t) {
	double t_1 = sqrt((y + 1.0)) - sqrt(y);
	double t_2 = sqrt((z + 1.0)) - sqrt(z);
	double t_3 = sqrt((t + 1.0)) - sqrt(t);
	double tmp;
	if (x <= 350000000.0) {
		tmp = (((sqrt((x + 1.0)) - sqrt(x)) + t_1) + t_2) + t_3;
	} else {
		tmp = (((0.5 / (x * sqrt((1.0 / x)))) + t_1) + t_2) + t_3;
	}
	return tmp;
}

Fortran

NOTE: x, y, z, and t 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(x, y, z, t)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: t_1
    real(8) :: t_2
    real(8) :: t_3
    real(8) :: tmp
    t_1 = sqrt((y + 1.0d0)) - sqrt(y)
    t_2 = sqrt((z + 1.0d0)) - sqrt(z)
    t_3 = sqrt((t + 1.0d0)) - sqrt(t)
    if (x <= 350000000.0d0) then
        tmp = (((sqrt((x + 1.0d0)) - sqrt(x)) + t_1) + t_2) + t_3
    else
        tmp = (((0.5d0 / (x * sqrt((1.0d0 / x)))) + t_1) + t_2) + t_3
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t;
public static double code(double x, double y, double z, double t) {
	double t_1 = Math.sqrt((y + 1.0)) - Math.sqrt(y);
	double t_2 = Math.sqrt((z + 1.0)) - Math.sqrt(z);
	double t_3 = Math.sqrt((t + 1.0)) - Math.sqrt(t);
	double tmp;
	if (x <= 350000000.0) {
		tmp = (((Math.sqrt((x + 1.0)) - Math.sqrt(x)) + t_1) + t_2) + t_3;
	} else {
		tmp = (((0.5 / (x * Math.sqrt((1.0 / x)))) + t_1) + t_2) + t_3;
	}
	return tmp;
}

Python

[x, y, z, t] = sort([x, y, z, t])
def code(x, y, z, t):
	t_1 = math.sqrt((y + 1.0)) - math.sqrt(y)
	t_2 = math.sqrt((z + 1.0)) - math.sqrt(z)
	t_3 = math.sqrt((t + 1.0)) - math.sqrt(t)
	tmp = 0
	if x <= 350000000.0:
		tmp = (((math.sqrt((x + 1.0)) - math.sqrt(x)) + t_1) + t_2) + t_3
	else:
		tmp = (((0.5 / (x * math.sqrt((1.0 / x)))) + t_1) + t_2) + t_3
	return tmp

Julia

x, y, z, t = sort([x, y, z, t])
function code(x, y, z, t)
	t_1 = Float64(sqrt(Float64(y + 1.0)) - sqrt(y))
	t_2 = Float64(sqrt(Float64(z + 1.0)) - sqrt(z))
	t_3 = Float64(sqrt(Float64(t + 1.0)) - sqrt(t))
	tmp = 0.0
	if (x <= 350000000.0)
		tmp = Float64(Float64(Float64(Float64(sqrt(Float64(x + 1.0)) - sqrt(x)) + t_1) + t_2) + t_3);
	else
		tmp = Float64(Float64(Float64(Float64(0.5 / Float64(x * sqrt(Float64(1.0 / x)))) + t_1) + t_2) + t_3);
	end
	return tmp
end

MATLAB

x, y, z, t = num2cell(sort([x, y, z, t])){:}
function tmp_2 = code(x, y, z, t)
	t_1 = sqrt((y + 1.0)) - sqrt(y);
	t_2 = sqrt((z + 1.0)) - sqrt(z);
	t_3 = sqrt((t + 1.0)) - sqrt(t);
	tmp = 0.0;
	if (x <= 350000000.0)
		tmp = (((sqrt((x + 1.0)) - sqrt(x)) + t_1) + t_2) + t_3;
	else
		tmp = (((0.5 / (x * sqrt((1.0 / x)))) + t_1) + t_2) + t_3;
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_] := Block[{t$95$1 = N[(N[Sqrt[N[(y + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[y], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[Sqrt[N[(z + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[z], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[Sqrt[N[(t + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[t], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, 350000000.0], N[(N[(N[(N[(N[Sqrt[N[(x + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[x], $MachinePrecision]), $MachinePrecision] + t$95$1), $MachinePrecision] + t$95$2), $MachinePrecision] + t$95$3), $MachinePrecision], N[(N[(N[(N[(0.5 / N[(x * N[Sqrt[N[(1.0 / x), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + t$95$1), $MachinePrecision] + t$95$2), $MachinePrecision] + t$95$3), $MachinePrecision]]]]]

Derivation

1. Split input into 2 regimes

2. if x < 3.5e8

   1. Initial program 91.8%

      \[\left(\left(\left(\sqrt{x + 1} - \sqrt{x}\right) + \left(\sqrt{y + 1} - \sqrt{y}\right)\right) + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   if 3.5e8 < x

   1. Initial program 91.8%

      \[\left(\left(\left(\sqrt{x + 1} - \sqrt{x}\right) + \left(\sqrt{y + 1} - \sqrt{y}\right)\right) + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   2. Taylor expanded in x around inf

      \[\leadsto \left(\left(\color{blue}{\frac{\frac{1}{2}}{x \cdot \sqrt{\frac{1}{x}}}} + \left(\sqrt{y + 1} - \sqrt{y}\right)\right) + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   4. Applied rewrites 15.4%

      \[\leadsto \left(\left(\color{blue}{\frac{0.5}{x \cdot \sqrt{\frac{1}{x}}}} + \left(\sqrt{y + 1} - \sqrt{y}\right)\right) + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 2: 91.8% accurate, 1.0× speedup

Math

\[\begin{array}{l} [x, y, z, t] = \mathsf{sort}([x, y, z, t])\\ \\ \begin{array}{l} t_1 := \sqrt{t + 1} - \sqrt{t}\\ \mathbf{if}\;y \leq 5.5 \cdot 10^{+20}:\\ \;\;\;\;\left(\left(\left(1 - \sqrt{x}\right) + \left(\sqrt{y + 1} - \sqrt{y}\right)\right) + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + t\_1\\ \mathbf{else}:\\ \;\;\;\;\left(\left(\sqrt{1 + x} - \sqrt{x}\right) + \frac{0.5}{z \cdot \sqrt{\frac{1}{z}}}\right) + t\_1\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (- (sqrt (+ t 1.0)) (sqrt t))))
   (if (<= y 5.5e+20)
     (+
      (+
       (+ (- 1.0 (sqrt x)) (- (sqrt (+ y 1.0)) (sqrt y)))
       (- (sqrt (+ z 1.0)) (sqrt z)))
      t_1)
     (+
      (+ (- (sqrt (+ 1.0 x)) (sqrt x)) (/ 0.5 (* z (sqrt (/ 1.0 z)))))
      t_1))))

C

assert(x < y && y < z && z < t);
double code(double x, double y, double z, double t) {
	double t_1 = sqrt((t + 1.0)) - sqrt(t);
	double tmp;
	if (y <= 5.5e+20) {
		tmp = (((1.0 - sqrt(x)) + (sqrt((y + 1.0)) - sqrt(y))) + (sqrt((z + 1.0)) - sqrt(z))) + t_1;
	} else {
		tmp = ((sqrt((1.0 + x)) - sqrt(x)) + (0.5 / (z * sqrt((1.0 / z))))) + t_1;
	}
	return tmp;
}

Fortran

NOTE: x, y, z, and t 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(x, y, z, t)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: t_1
    real(8) :: tmp
    t_1 = sqrt((t + 1.0d0)) - sqrt(t)
    if (y <= 5.5d+20) then
        tmp = (((1.0d0 - sqrt(x)) + (sqrt((y + 1.0d0)) - sqrt(y))) + (sqrt((z + 1.0d0)) - sqrt(z))) + t_1
    else
        tmp = ((sqrt((1.0d0 + x)) - sqrt(x)) + (0.5d0 / (z * sqrt((1.0d0 / z))))) + t_1
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t;
public static double code(double x, double y, double z, double t) {
	double t_1 = Math.sqrt((t + 1.0)) - Math.sqrt(t);
	double tmp;
	if (y <= 5.5e+20) {
		tmp = (((1.0 - Math.sqrt(x)) + (Math.sqrt((y + 1.0)) - Math.sqrt(y))) + (Math.sqrt((z + 1.0)) - Math.sqrt(z))) + t_1;
	} else {
		tmp = ((Math.sqrt((1.0 + x)) - Math.sqrt(x)) + (0.5 / (z * Math.sqrt((1.0 / z))))) + t_1;
	}
	return tmp;
}

Python

[x, y, z, t] = sort([x, y, z, t])
def code(x, y, z, t):
	t_1 = math.sqrt((t + 1.0)) - math.sqrt(t)
	tmp = 0
	if y <= 5.5e+20:
		tmp = (((1.0 - math.sqrt(x)) + (math.sqrt((y + 1.0)) - math.sqrt(y))) + (math.sqrt((z + 1.0)) - math.sqrt(z))) + t_1
	else:
		tmp = ((math.sqrt((1.0 + x)) - math.sqrt(x)) + (0.5 / (z * math.sqrt((1.0 / z))))) + t_1
	return tmp

Julia

x, y, z, t = sort([x, y, z, t])
function code(x, y, z, t)
	t_1 = Float64(sqrt(Float64(t + 1.0)) - sqrt(t))
	tmp = 0.0
	if (y <= 5.5e+20)
		tmp = Float64(Float64(Float64(Float64(1.0 - sqrt(x)) + Float64(sqrt(Float64(y + 1.0)) - sqrt(y))) + Float64(sqrt(Float64(z + 1.0)) - sqrt(z))) + t_1);
	else
		tmp = Float64(Float64(Float64(sqrt(Float64(1.0 + x)) - sqrt(x)) + Float64(0.5 / Float64(z * sqrt(Float64(1.0 / z))))) + t_1);
	end
	return tmp
end

MATLAB

x, y, z, t = num2cell(sort([x, y, z, t])){:}
function tmp_2 = code(x, y, z, t)
	t_1 = sqrt((t + 1.0)) - sqrt(t);
	tmp = 0.0;
	if (y <= 5.5e+20)
		tmp = (((1.0 - sqrt(x)) + (sqrt((y + 1.0)) - sqrt(y))) + (sqrt((z + 1.0)) - sqrt(z))) + t_1;
	else
		tmp = ((sqrt((1.0 + x)) - sqrt(x)) + (0.5 / (z * sqrt((1.0 / z))))) + t_1;
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_] := Block[{t$95$1 = N[(N[Sqrt[N[(t + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[t], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[y, 5.5e+20], N[(N[(N[(N[(1.0 - N[Sqrt[x], $MachinePrecision]), $MachinePrecision] + N[(N[Sqrt[N[(y + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[Sqrt[N[(z + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[z], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + t$95$1), $MachinePrecision], N[(N[(N[(N[Sqrt[N[(1.0 + x), $MachinePrecision]], $MachinePrecision] - N[Sqrt[x], $MachinePrecision]), $MachinePrecision] + N[(0.5 / N[(z * N[Sqrt[N[(1.0 / z), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + t$95$1), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if y < 5.5e20

   1. Initial program 91.8%

      \[\left(\left(\left(\sqrt{x + 1} - \sqrt{x}\right) + \left(\sqrt{y + 1} - \sqrt{y}\right)\right) + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   2. Taylor expanded in x around 0

      \[\leadsto \left(\left(\left(\color{blue}{1} - \sqrt{x}\right) + \left(\sqrt{y + 1} - \sqrt{y}\right)\right) + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   4. Applied rewrites 84.5%

      \[\leadsto \left(\left(\left(\color{blue}{1} - \sqrt{x}\right) + \left(\sqrt{y + 1} - \sqrt{y}\right)\right) + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   if 5.5e20 < y

   1. Initial program 91.8%

      \[\left(\left(\left(\sqrt{x + 1} - \sqrt{x}\right) + \left(\sqrt{y + 1} - \sqrt{y}\right)\right) + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   2. Taylor expanded in y around inf

      \[\leadsto \left(\color{blue}{\left(\sqrt{1 + x} - \sqrt{x}\right)} + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   4. Applied rewrites 51.3%

      \[\leadsto \left(\color{blue}{\left(\sqrt{1 + x} - \sqrt{x}\right)} + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   5. Taylor expanded in z around inf

      \[\leadsto \left(\left(\sqrt{1 + x} - \sqrt{x}\right) + \color{blue}{\frac{\frac{1}{2}}{z \cdot \sqrt{\frac{1}{z}}}}\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   7. Applied rewrites 50.0%

      \[\leadsto \left(\left(\sqrt{1 + x} - \sqrt{x}\right) + \color{blue}{\frac{0.5}{z \cdot \sqrt{\frac{1}{z}}}}\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 3: 91.7% accurate, 1.1× speedup

Math

\[\begin{array}{l} [x, y, z, t] = \mathsf{sort}([x, y, z, t])\\ \\ \begin{array}{l} t_1 := \sqrt{t + 1} - \sqrt{t}\\ \mathbf{if}\;y \leq 2.5 \cdot 10^{+20}:\\ \;\;\;\;\left(\left(1 + \left(\sqrt{y + 1} - \sqrt{y}\right)\right) + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + t\_1\\ \mathbf{else}:\\ \;\;\;\;\left(\left(\sqrt{1 + x} - \sqrt{x}\right) + \frac{0.5}{z \cdot \sqrt{\frac{1}{z}}}\right) + t\_1\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (- (sqrt (+ t 1.0)) (sqrt t))))
   (if (<= y 2.5e+20)
     (+
      (+ (+ 1.0 (- (sqrt (+ y 1.0)) (sqrt y))) (- (sqrt (+ z 1.0)) (sqrt z)))
      t_1)
     (+
      (+ (- (sqrt (+ 1.0 x)) (sqrt x)) (/ 0.5 (* z (sqrt (/ 1.0 z)))))
      t_1))))

C

assert(x < y && y < z && z < t);
double code(double x, double y, double z, double t) {
	double t_1 = sqrt((t + 1.0)) - sqrt(t);
	double tmp;
	if (y <= 2.5e+20) {
		tmp = ((1.0 + (sqrt((y + 1.0)) - sqrt(y))) + (sqrt((z + 1.0)) - sqrt(z))) + t_1;
	} else {
		tmp = ((sqrt((1.0 + x)) - sqrt(x)) + (0.5 / (z * sqrt((1.0 / z))))) + t_1;
	}
	return tmp;
}

Fortran

NOTE: x, y, z, and t 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(x, y, z, t)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: t_1
    real(8) :: tmp
    t_1 = sqrt((t + 1.0d0)) - sqrt(t)
    if (y <= 2.5d+20) then
        tmp = ((1.0d0 + (sqrt((y + 1.0d0)) - sqrt(y))) + (sqrt((z + 1.0d0)) - sqrt(z))) + t_1
    else
        tmp = ((sqrt((1.0d0 + x)) - sqrt(x)) + (0.5d0 / (z * sqrt((1.0d0 / z))))) + t_1
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t;
public static double code(double x, double y, double z, double t) {
	double t_1 = Math.sqrt((t + 1.0)) - Math.sqrt(t);
	double tmp;
	if (y <= 2.5e+20) {
		tmp = ((1.0 + (Math.sqrt((y + 1.0)) - Math.sqrt(y))) + (Math.sqrt((z + 1.0)) - Math.sqrt(z))) + t_1;
	} else {
		tmp = ((Math.sqrt((1.0 + x)) - Math.sqrt(x)) + (0.5 / (z * Math.sqrt((1.0 / z))))) + t_1;
	}
	return tmp;
}

Python

[x, y, z, t] = sort([x, y, z, t])
def code(x, y, z, t):
	t_1 = math.sqrt((t + 1.0)) - math.sqrt(t)
	tmp = 0
	if y <= 2.5e+20:
		tmp = ((1.0 + (math.sqrt((y + 1.0)) - math.sqrt(y))) + (math.sqrt((z + 1.0)) - math.sqrt(z))) + t_1
	else:
		tmp = ((math.sqrt((1.0 + x)) - math.sqrt(x)) + (0.5 / (z * math.sqrt((1.0 / z))))) + t_1
	return tmp

Julia

x, y, z, t = sort([x, y, z, t])
function code(x, y, z, t)
	t_1 = Float64(sqrt(Float64(t + 1.0)) - sqrt(t))
	tmp = 0.0
	if (y <= 2.5e+20)
		tmp = Float64(Float64(Float64(1.0 + Float64(sqrt(Float64(y + 1.0)) - sqrt(y))) + Float64(sqrt(Float64(z + 1.0)) - sqrt(z))) + t_1);
	else
		tmp = Float64(Float64(Float64(sqrt(Float64(1.0 + x)) - sqrt(x)) + Float64(0.5 / Float64(z * sqrt(Float64(1.0 / z))))) + t_1);
	end
	return tmp
end

MATLAB

x, y, z, t = num2cell(sort([x, y, z, t])){:}
function tmp_2 = code(x, y, z, t)
	t_1 = sqrt((t + 1.0)) - sqrt(t);
	tmp = 0.0;
	if (y <= 2.5e+20)
		tmp = ((1.0 + (sqrt((y + 1.0)) - sqrt(y))) + (sqrt((z + 1.0)) - sqrt(z))) + t_1;
	else
		tmp = ((sqrt((1.0 + x)) - sqrt(x)) + (0.5 / (z * sqrt((1.0 / z))))) + t_1;
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_] := Block[{t$95$1 = N[(N[Sqrt[N[(t + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[t], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[y, 2.5e+20], N[(N[(N[(1.0 + N[(N[Sqrt[N[(y + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[Sqrt[N[(z + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[z], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + t$95$1), $MachinePrecision], N[(N[(N[(N[Sqrt[N[(1.0 + x), $MachinePrecision]], $MachinePrecision] - N[Sqrt[x], $MachinePrecision]), $MachinePrecision] + N[(0.5 / N[(z * N[Sqrt[N[(1.0 / z), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + t$95$1), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if y < 2.5e20

   1. Initial program 91.8%

      \[\left(\left(\left(\sqrt{x + 1} - \sqrt{x}\right) + \left(\sqrt{y + 1} - \sqrt{y}\right)\right) + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   3. Applied rewrites 91.3%

      \[\leadsto \left(\left(\color{blue}{\frac{\left(x + 1\right) - x}{\mathsf{fma}\left(\sqrt{x + 1}, x + 1, \sqrt{x} \cdot x\right)} \cdot \left(\left(\left(x + 1\right) + x\right) - \sqrt{\mathsf{fma}\left(x, x, x\right)}\right)} + \left(\sqrt{y + 1} - \sqrt{y}\right)\right) + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   5. Applied rewrites 85.4%

      \[\leadsto \left(\left(\color{blue}{1} + \left(\sqrt{y + 1} - \sqrt{y}\right)\right) + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   if 2.5e20 < y

   1. Initial program 91.8%

      \[\left(\left(\left(\sqrt{x + 1} - \sqrt{x}\right) + \left(\sqrt{y + 1} - \sqrt{y}\right)\right) + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   2. Taylor expanded in y around inf

      \[\leadsto \left(\color{blue}{\left(\sqrt{1 + x} - \sqrt{x}\right)} + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   4. Applied rewrites 51.3%

      \[\leadsto \left(\color{blue}{\left(\sqrt{1 + x} - \sqrt{x}\right)} + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   5. Taylor expanded in z around inf

      \[\leadsto \left(\left(\sqrt{1 + x} - \sqrt{x}\right) + \color{blue}{\frac{\frac{1}{2}}{z \cdot \sqrt{\frac{1}{z}}}}\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   7. Applied rewrites 50.0%

      \[\leadsto \left(\left(\sqrt{1 + x} - \sqrt{x}\right) + \color{blue}{\frac{0.5}{z \cdot \sqrt{\frac{1}{z}}}}\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 4: 91.7% accurate, 1.0× speedup

Math

\[\begin{array}{l} [x, y, z, t] = \mathsf{sort}([x, y, z, t])\\ \\ \left(\left(\left(\sqrt{x + 1} - \sqrt{x}\right) + \left(\sqrt{y + 1} - \sqrt{y}\right)\right) + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \end{array} \]

FPCore

NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
(FPCore (x y z t)
 :precision binary64
 (+
  (+
   (+ (- (sqrt (+ x 1.0)) (sqrt x)) (- (sqrt (+ y 1.0)) (sqrt y)))
   (- (sqrt (+ z 1.0)) (sqrt z)))
  (- (sqrt (+ t 1.0)) (sqrt t))))

C

assert(x < y && y < z && z < t);
double code(double x, double y, double z, double t) {
	return (((sqrt((x + 1.0)) - sqrt(x)) + (sqrt((y + 1.0)) - sqrt(y))) + (sqrt((z + 1.0)) - sqrt(z))) + (sqrt((t + 1.0)) - sqrt(t));
}

Fortran

NOTE: x, y, z, and t 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(x, y, z, t)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    code = (((sqrt((x + 1.0d0)) - sqrt(x)) + (sqrt((y + 1.0d0)) - sqrt(y))) + (sqrt((z + 1.0d0)) - sqrt(z))) + (sqrt((t + 1.0d0)) - sqrt(t))
end function

Java

assert x < y && y < z && z < t;
public static double code(double x, double y, double z, double t) {
	return (((Math.sqrt((x + 1.0)) - Math.sqrt(x)) + (Math.sqrt((y + 1.0)) - Math.sqrt(y))) + (Math.sqrt((z + 1.0)) - Math.sqrt(z))) + (Math.sqrt((t + 1.0)) - Math.sqrt(t));
}

Python

[x, y, z, t] = sort([x, y, z, t])
def code(x, y, z, t):
	return (((math.sqrt((x + 1.0)) - math.sqrt(x)) + (math.sqrt((y + 1.0)) - math.sqrt(y))) + (math.sqrt((z + 1.0)) - math.sqrt(z))) + (math.sqrt((t + 1.0)) - math.sqrt(t))

Julia

x, y, z, t = sort([x, y, z, t])
function code(x, y, z, t)
	return Float64(Float64(Float64(Float64(sqrt(Float64(x + 1.0)) - sqrt(x)) + Float64(sqrt(Float64(y + 1.0)) - sqrt(y))) + Float64(sqrt(Float64(z + 1.0)) - sqrt(z))) + Float64(sqrt(Float64(t + 1.0)) - sqrt(t)))
end

MATLAB

x, y, z, t = num2cell(sort([x, y, z, t])){:}
function tmp = code(x, y, z, t)
	tmp = (((sqrt((x + 1.0)) - sqrt(x)) + (sqrt((y + 1.0)) - sqrt(y))) + (sqrt((z + 1.0)) - sqrt(z))) + (sqrt((t + 1.0)) - sqrt(t));
end

Wolfram

NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_] := N[(N[(N[(N[(N[Sqrt[N[(x + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[x], $MachinePrecision]), $MachinePrecision] + N[(N[Sqrt[N[(y + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[Sqrt[N[(z + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[z], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[Sqrt[N[(t + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[t], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 91.8%

   \[\left(\left(\left(\sqrt{x + 1} - \sqrt{x}\right) + \left(\sqrt{y + 1} - \sqrt{y}\right)\right) + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]
2. Add Preprocessing

Alternative 5: 89.0% accurate, 0.9× speedup

Math

\[\begin{array}{l} [x, y, z, t] = \mathsf{sort}([x, y, z, t])\\ \\ \begin{array}{l} t_1 := \sqrt{t + 1} - \sqrt{t}\\ \mathbf{if}\;\sqrt{y + 1} - \sqrt{y} \leq 0.2:\\ \;\;\;\;\left(\left(\sqrt{1 + x} - \sqrt{x}\right) + \frac{0.5}{z \cdot \sqrt{\frac{1}{z}}}\right) + t\_1\\ \mathbf{else}:\\ \;\;\;\;\left(\left(2 - \sqrt{y}\right) + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + t\_1\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (- (sqrt (+ t 1.0)) (sqrt t))))
   (if (<= (- (sqrt (+ y 1.0)) (sqrt y)) 0.2)
     (+ (+ (- (sqrt (+ 1.0 x)) (sqrt x)) (/ 0.5 (* z (sqrt (/ 1.0 z))))) t_1)
     (+ (+ (- 2.0 (sqrt y)) (- (sqrt (+ z 1.0)) (sqrt z))) t_1))))

C

assert(x < y && y < z && z < t);
double code(double x, double y, double z, double t) {
	double t_1 = sqrt((t + 1.0)) - sqrt(t);
	double tmp;
	if ((sqrt((y + 1.0)) - sqrt(y)) <= 0.2) {
		tmp = ((sqrt((1.0 + x)) - sqrt(x)) + (0.5 / (z * sqrt((1.0 / z))))) + t_1;
	} else {
		tmp = ((2.0 - sqrt(y)) + (sqrt((z + 1.0)) - sqrt(z))) + t_1;
	}
	return tmp;
}

Fortran

NOTE: x, y, z, and t 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(x, y, z, t)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: t_1
    real(8) :: tmp
    t_1 = sqrt((t + 1.0d0)) - sqrt(t)
    if ((sqrt((y + 1.0d0)) - sqrt(y)) <= 0.2d0) then
        tmp = ((sqrt((1.0d0 + x)) - sqrt(x)) + (0.5d0 / (z * sqrt((1.0d0 / z))))) + t_1
    else
        tmp = ((2.0d0 - sqrt(y)) + (sqrt((z + 1.0d0)) - sqrt(z))) + t_1
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t;
public static double code(double x, double y, double z, double t) {
	double t_1 = Math.sqrt((t + 1.0)) - Math.sqrt(t);
	double tmp;
	if ((Math.sqrt((y + 1.0)) - Math.sqrt(y)) <= 0.2) {
		tmp = ((Math.sqrt((1.0 + x)) - Math.sqrt(x)) + (0.5 / (z * Math.sqrt((1.0 / z))))) + t_1;
	} else {
		tmp = ((2.0 - Math.sqrt(y)) + (Math.sqrt((z + 1.0)) - Math.sqrt(z))) + t_1;
	}
	return tmp;
}

Python

[x, y, z, t] = sort([x, y, z, t])
def code(x, y, z, t):
	t_1 = math.sqrt((t + 1.0)) - math.sqrt(t)
	tmp = 0
	if (math.sqrt((y + 1.0)) - math.sqrt(y)) <= 0.2:
		tmp = ((math.sqrt((1.0 + x)) - math.sqrt(x)) + (0.5 / (z * math.sqrt((1.0 / z))))) + t_1
	else:
		tmp = ((2.0 - math.sqrt(y)) + (math.sqrt((z + 1.0)) - math.sqrt(z))) + t_1
	return tmp

Julia

x, y, z, t = sort([x, y, z, t])
function code(x, y, z, t)
	t_1 = Float64(sqrt(Float64(t + 1.0)) - sqrt(t))
	tmp = 0.0
	if (Float64(sqrt(Float64(y + 1.0)) - sqrt(y)) <= 0.2)
		tmp = Float64(Float64(Float64(sqrt(Float64(1.0 + x)) - sqrt(x)) + Float64(0.5 / Float64(z * sqrt(Float64(1.0 / z))))) + t_1);
	else
		tmp = Float64(Float64(Float64(2.0 - sqrt(y)) + Float64(sqrt(Float64(z + 1.0)) - sqrt(z))) + t_1);
	end
	return tmp
end

MATLAB

x, y, z, t = num2cell(sort([x, y, z, t])){:}
function tmp_2 = code(x, y, z, t)
	t_1 = sqrt((t + 1.0)) - sqrt(t);
	tmp = 0.0;
	if ((sqrt((y + 1.0)) - sqrt(y)) <= 0.2)
		tmp = ((sqrt((1.0 + x)) - sqrt(x)) + (0.5 / (z * sqrt((1.0 / z))))) + t_1;
	else
		tmp = ((2.0 - sqrt(y)) + (sqrt((z + 1.0)) - sqrt(z))) + t_1;
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_] := Block[{t$95$1 = N[(N[Sqrt[N[(t + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[t], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[Sqrt[N[(y + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[y], $MachinePrecision]), $MachinePrecision], 0.2], N[(N[(N[(N[Sqrt[N[(1.0 + x), $MachinePrecision]], $MachinePrecision] - N[Sqrt[x], $MachinePrecision]), $MachinePrecision] + N[(0.5 / N[(z * N[Sqrt[N[(1.0 / z), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + t$95$1), $MachinePrecision], N[(N[(N[(2.0 - N[Sqrt[y], $MachinePrecision]), $MachinePrecision] + N[(N[Sqrt[N[(z + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[z], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + t$95$1), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (-.f64 (sqrt.f64 (+.f64 y #s(literal 1 binary64))) (sqrt.f64 y)) < 0.20000000000000001

   1. Initial program 91.8%

      \[\left(\left(\left(\sqrt{x + 1} - \sqrt{x}\right) + \left(\sqrt{y + 1} - \sqrt{y}\right)\right) + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   2. Taylor expanded in y around inf

      \[\leadsto \left(\color{blue}{\left(\sqrt{1 + x} - \sqrt{x}\right)} + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   4. Applied rewrites 51.3%

      \[\leadsto \left(\color{blue}{\left(\sqrt{1 + x} - \sqrt{x}\right)} + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   5. Taylor expanded in z around inf

      \[\leadsto \left(\left(\sqrt{1 + x} - \sqrt{x}\right) + \color{blue}{\frac{\frac{1}{2}}{z \cdot \sqrt{\frac{1}{z}}}}\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   7. Applied rewrites 50.0%

      \[\leadsto \left(\left(\sqrt{1 + x} - \sqrt{x}\right) + \color{blue}{\frac{0.5}{z \cdot \sqrt{\frac{1}{z}}}}\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   if 0.20000000000000001 < (-.f64 (sqrt.f64 (+.f64 y #s(literal 1 binary64))) (sqrt.f64 y))

   1. Initial program 91.8%

      \[\left(\left(\left(\sqrt{x + 1} - \sqrt{x}\right) + \left(\sqrt{y + 1} - \sqrt{y}\right)\right) + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   3. Applied rewrites 91.3%

      \[\leadsto \left(\left(\color{blue}{\frac{\left(x + 1\right) - x}{\mathsf{fma}\left(\sqrt{x + 1}, x + 1, \sqrt{x} \cdot x\right)} \cdot \left(\left(\left(x + 1\right) + x\right) - \sqrt{\mathsf{fma}\left(x, x, x\right)}\right)} + \left(\sqrt{y + 1} - \sqrt{y}\right)\right) + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   5. Applied rewrites 85.4%

      \[\leadsto \left(\left(\color{blue}{1} + \left(\sqrt{y + 1} - \sqrt{y}\right)\right) + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   6. Taylor expanded in y around 0

      \[\leadsto \left(\color{blue}{\left(2 - \sqrt{y}\right)} + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   8. Applied rewrites 48.1%

      \[\leadsto \left(\color{blue}{\left(2 - \sqrt{y}\right)} + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 6: 88.8% accurate, 1.0× speedup

Math

\[\begin{array}{l} [x, y, z, t] = \mathsf{sort}([x, y, z, t])\\ \\ \begin{array}{l} t_1 := \sqrt{z + 1} - \sqrt{z}\\ t_2 := \sqrt{t + 1} - \sqrt{t}\\ \mathbf{if}\;\sqrt{y + 1} - \sqrt{y} \leq 0.2:\\ \;\;\;\;\left(\left(\sqrt{1 + x} - \sqrt{x}\right) + t\_1\right) + t\_2\\ \mathbf{else}:\\ \;\;\;\;\left(\left(2 - \sqrt{y}\right) + t\_1\right) + t\_2\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (- (sqrt (+ z 1.0)) (sqrt z)))
        (t_2 (- (sqrt (+ t 1.0)) (sqrt t))))
   (if (<= (- (sqrt (+ y 1.0)) (sqrt y)) 0.2)
     (+ (+ (- (sqrt (+ 1.0 x)) (sqrt x)) t_1) t_2)
     (+ (+ (- 2.0 (sqrt y)) t_1) t_2))))

C

assert(x < y && y < z && z < t);
double code(double x, double y, double z, double t) {
	double t_1 = sqrt((z + 1.0)) - sqrt(z);
	double t_2 = sqrt((t + 1.0)) - sqrt(t);
	double tmp;
	if ((sqrt((y + 1.0)) - sqrt(y)) <= 0.2) {
		tmp = ((sqrt((1.0 + x)) - sqrt(x)) + t_1) + t_2;
	} else {
		tmp = ((2.0 - sqrt(y)) + t_1) + t_2;
	}
	return tmp;
}

Fortran

NOTE: x, y, z, and t 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(x, y, z, t)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: t_1
    real(8) :: t_2
    real(8) :: tmp
    t_1 = sqrt((z + 1.0d0)) - sqrt(z)
    t_2 = sqrt((t + 1.0d0)) - sqrt(t)
    if ((sqrt((y + 1.0d0)) - sqrt(y)) <= 0.2d0) then
        tmp = ((sqrt((1.0d0 + x)) - sqrt(x)) + t_1) + t_2
    else
        tmp = ((2.0d0 - sqrt(y)) + t_1) + t_2
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t;
public static double code(double x, double y, double z, double t) {
	double t_1 = Math.sqrt((z + 1.0)) - Math.sqrt(z);
	double t_2 = Math.sqrt((t + 1.0)) - Math.sqrt(t);
	double tmp;
	if ((Math.sqrt((y + 1.0)) - Math.sqrt(y)) <= 0.2) {
		tmp = ((Math.sqrt((1.0 + x)) - Math.sqrt(x)) + t_1) + t_2;
	} else {
		tmp = ((2.0 - Math.sqrt(y)) + t_1) + t_2;
	}
	return tmp;
}

Python

[x, y, z, t] = sort([x, y, z, t])
def code(x, y, z, t):
	t_1 = math.sqrt((z + 1.0)) - math.sqrt(z)
	t_2 = math.sqrt((t + 1.0)) - math.sqrt(t)
	tmp = 0
	if (math.sqrt((y + 1.0)) - math.sqrt(y)) <= 0.2:
		tmp = ((math.sqrt((1.0 + x)) - math.sqrt(x)) + t_1) + t_2
	else:
		tmp = ((2.0 - math.sqrt(y)) + t_1) + t_2
	return tmp

Julia

x, y, z, t = sort([x, y, z, t])
function code(x, y, z, t)
	t_1 = Float64(sqrt(Float64(z + 1.0)) - sqrt(z))
	t_2 = Float64(sqrt(Float64(t + 1.0)) - sqrt(t))
	tmp = 0.0
	if (Float64(sqrt(Float64(y + 1.0)) - sqrt(y)) <= 0.2)
		tmp = Float64(Float64(Float64(sqrt(Float64(1.0 + x)) - sqrt(x)) + t_1) + t_2);
	else
		tmp = Float64(Float64(Float64(2.0 - sqrt(y)) + t_1) + t_2);
	end
	return tmp
end

MATLAB

x, y, z, t = num2cell(sort([x, y, z, t])){:}
function tmp_2 = code(x, y, z, t)
	t_1 = sqrt((z + 1.0)) - sqrt(z);
	t_2 = sqrt((t + 1.0)) - sqrt(t);
	tmp = 0.0;
	if ((sqrt((y + 1.0)) - sqrt(y)) <= 0.2)
		tmp = ((sqrt((1.0 + x)) - sqrt(x)) + t_1) + t_2;
	else
		tmp = ((2.0 - sqrt(y)) + t_1) + t_2;
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_] := Block[{t$95$1 = N[(N[Sqrt[N[(z + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[z], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[Sqrt[N[(t + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[t], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[Sqrt[N[(y + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[y], $MachinePrecision]), $MachinePrecision], 0.2], N[(N[(N[(N[Sqrt[N[(1.0 + x), $MachinePrecision]], $MachinePrecision] - N[Sqrt[x], $MachinePrecision]), $MachinePrecision] + t$95$1), $MachinePrecision] + t$95$2), $MachinePrecision], N[(N[(N[(2.0 - N[Sqrt[y], $MachinePrecision]), $MachinePrecision] + t$95$1), $MachinePrecision] + t$95$2), $MachinePrecision]]]]

Derivation

1. Split input into 2 regimes

2. if (-.f64 (sqrt.f64 (+.f64 y #s(literal 1 binary64))) (sqrt.f64 y)) < 0.20000000000000001

   1. Initial program 91.8%

      \[\left(\left(\left(\sqrt{x + 1} - \sqrt{x}\right) + \left(\sqrt{y + 1} - \sqrt{y}\right)\right) + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   2. Taylor expanded in y around inf

      \[\leadsto \left(\color{blue}{\left(\sqrt{1 + x} - \sqrt{x}\right)} + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   4. Applied rewrites 51.3%

      \[\leadsto \left(\color{blue}{\left(\sqrt{1 + x} - \sqrt{x}\right)} + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   if 0.20000000000000001 < (-.f64 (sqrt.f64 (+.f64 y #s(literal 1 binary64))) (sqrt.f64 y))

   1. Initial program 91.8%

      \[\left(\left(\left(\sqrt{x + 1} - \sqrt{x}\right) + \left(\sqrt{y + 1} - \sqrt{y}\right)\right) + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   3. Applied rewrites 91.3%

      \[\leadsto \left(\left(\color{blue}{\frac{\left(x + 1\right) - x}{\mathsf{fma}\left(\sqrt{x + 1}, x + 1, \sqrt{x} \cdot x\right)} \cdot \left(\left(\left(x + 1\right) + x\right) - \sqrt{\mathsf{fma}\left(x, x, x\right)}\right)} + \left(\sqrt{y + 1} - \sqrt{y}\right)\right) + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   5. Applied rewrites 85.4%

      \[\leadsto \left(\left(\color{blue}{1} + \left(\sqrt{y + 1} - \sqrt{y}\right)\right) + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   6. Taylor expanded in y around 0

      \[\leadsto \left(\color{blue}{\left(2 - \sqrt{y}\right)} + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   8. Applied rewrites 48.1%

      \[\leadsto \left(\color{blue}{\left(2 - \sqrt{y}\right)} + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 7: 86.9% accurate, 0.4× speedup

Math

\[\begin{array}{l} [x, y, z, t] = \mathsf{sort}([x, y, z, t])\\ \\ \begin{array}{l} t_1 := \sqrt{z + 1} - \sqrt{z}\\ t_2 := \left(\left(\sqrt{x + 1} - \sqrt{x}\right) + \left(\sqrt{y + 1} - \sqrt{y}\right)\right) + t\_1\\ t_3 := \sqrt{t + 1} - \sqrt{t}\\ \mathbf{if}\;t\_2 \leq 0.98:\\ \;\;\;\;\left(\left(\sqrt{1 + x} - \sqrt{x}\right) + t\_1\right) + \left(1 - \sqrt{t}\right)\\ \mathbf{elif}\;t\_2 \leq 1.5:\\ \;\;\;\;\left(1 + t\_1\right) + t\_3\\ \mathbf{else}:\\ \;\;\;\;\left(\left(2 - \sqrt{y}\right) + t\_1\right) + t\_3\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (- (sqrt (+ z 1.0)) (sqrt z)))
        (t_2
         (+
          (+ (- (sqrt (+ x 1.0)) (sqrt x)) (- (sqrt (+ y 1.0)) (sqrt y)))
          t_1))
        (t_3 (- (sqrt (+ t 1.0)) (sqrt t))))
   (if (<= t_2 0.98)
     (+ (+ (- (sqrt (+ 1.0 x)) (sqrt x)) t_1) (- 1.0 (sqrt t)))
     (if (<= t_2 1.5) (+ (+ 1.0 t_1) t_3) (+ (+ (- 2.0 (sqrt y)) t_1) t_3)))))

C

assert(x < y && y < z && z < t);
double code(double x, double y, double z, double t) {
	double t_1 = sqrt((z + 1.0)) - sqrt(z);
	double t_2 = ((sqrt((x + 1.0)) - sqrt(x)) + (sqrt((y + 1.0)) - sqrt(y))) + t_1;
	double t_3 = sqrt((t + 1.0)) - sqrt(t);
	double tmp;
	if (t_2 <= 0.98) {
		tmp = ((sqrt((1.0 + x)) - sqrt(x)) + t_1) + (1.0 - sqrt(t));
	} else if (t_2 <= 1.5) {
		tmp = (1.0 + t_1) + t_3;
	} else {
		tmp = ((2.0 - sqrt(y)) + t_1) + t_3;
	}
	return tmp;
}

Fortran

NOTE: x, y, z, and t 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(x, y, z, t)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: t_1
    real(8) :: t_2
    real(8) :: t_3
    real(8) :: tmp
    t_1 = sqrt((z + 1.0d0)) - sqrt(z)
    t_2 = ((sqrt((x + 1.0d0)) - sqrt(x)) + (sqrt((y + 1.0d0)) - sqrt(y))) + t_1
    t_3 = sqrt((t + 1.0d0)) - sqrt(t)
    if (t_2 <= 0.98d0) then
        tmp = ((sqrt((1.0d0 + x)) - sqrt(x)) + t_1) + (1.0d0 - sqrt(t))
    else if (t_2 <= 1.5d0) then
        tmp = (1.0d0 + t_1) + t_3
    else
        tmp = ((2.0d0 - sqrt(y)) + t_1) + t_3
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t;
public static double code(double x, double y, double z, double t) {
	double t_1 = Math.sqrt((z + 1.0)) - Math.sqrt(z);
	double t_2 = ((Math.sqrt((x + 1.0)) - Math.sqrt(x)) + (Math.sqrt((y + 1.0)) - Math.sqrt(y))) + t_1;
	double t_3 = Math.sqrt((t + 1.0)) - Math.sqrt(t);
	double tmp;
	if (t_2 <= 0.98) {
		tmp = ((Math.sqrt((1.0 + x)) - Math.sqrt(x)) + t_1) + (1.0 - Math.sqrt(t));
	} else if (t_2 <= 1.5) {
		tmp = (1.0 + t_1) + t_3;
	} else {
		tmp = ((2.0 - Math.sqrt(y)) + t_1) + t_3;
	}
	return tmp;
}

Python

[x, y, z, t] = sort([x, y, z, t])
def code(x, y, z, t):
	t_1 = math.sqrt((z + 1.0)) - math.sqrt(z)
	t_2 = ((math.sqrt((x + 1.0)) - math.sqrt(x)) + (math.sqrt((y + 1.0)) - math.sqrt(y))) + t_1
	t_3 = math.sqrt((t + 1.0)) - math.sqrt(t)
	tmp = 0
	if t_2 <= 0.98:
		tmp = ((math.sqrt((1.0 + x)) - math.sqrt(x)) + t_1) + (1.0 - math.sqrt(t))
	elif t_2 <= 1.5:
		tmp = (1.0 + t_1) + t_3
	else:
		tmp = ((2.0 - math.sqrt(y)) + t_1) + t_3
	return tmp

Julia

x, y, z, t = sort([x, y, z, t])
function code(x, y, z, t)
	t_1 = Float64(sqrt(Float64(z + 1.0)) - sqrt(z))
	t_2 = Float64(Float64(Float64(sqrt(Float64(x + 1.0)) - sqrt(x)) + Float64(sqrt(Float64(y + 1.0)) - sqrt(y))) + t_1)
	t_3 = Float64(sqrt(Float64(t + 1.0)) - sqrt(t))
	tmp = 0.0
	if (t_2 <= 0.98)
		tmp = Float64(Float64(Float64(sqrt(Float64(1.0 + x)) - sqrt(x)) + t_1) + Float64(1.0 - sqrt(t)));
	elseif (t_2 <= 1.5)
		tmp = Float64(Float64(1.0 + t_1) + t_3);
	else
		tmp = Float64(Float64(Float64(2.0 - sqrt(y)) + t_1) + t_3);
	end
	return tmp
end

MATLAB

x, y, z, t = num2cell(sort([x, y, z, t])){:}
function tmp_2 = code(x, y, z, t)
	t_1 = sqrt((z + 1.0)) - sqrt(z);
	t_2 = ((sqrt((x + 1.0)) - sqrt(x)) + (sqrt((y + 1.0)) - sqrt(y))) + t_1;
	t_3 = sqrt((t + 1.0)) - sqrt(t);
	tmp = 0.0;
	if (t_2 <= 0.98)
		tmp = ((sqrt((1.0 + x)) - sqrt(x)) + t_1) + (1.0 - sqrt(t));
	elseif (t_2 <= 1.5)
		tmp = (1.0 + t_1) + t_3;
	else
		tmp = ((2.0 - sqrt(y)) + t_1) + t_3;
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_] := Block[{t$95$1 = N[(N[Sqrt[N[(z + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[z], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(N[(N[Sqrt[N[(x + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[x], $MachinePrecision]), $MachinePrecision] + N[(N[Sqrt[N[(y + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + t$95$1), $MachinePrecision]}, Block[{t$95$3 = N[(N[Sqrt[N[(t + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[t], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, 0.98], N[(N[(N[(N[Sqrt[N[(1.0 + x), $MachinePrecision]], $MachinePrecision] - N[Sqrt[x], $MachinePrecision]), $MachinePrecision] + t$95$1), $MachinePrecision] + N[(1.0 - N[Sqrt[t], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, 1.5], N[(N[(1.0 + t$95$1), $MachinePrecision] + t$95$3), $MachinePrecision], N[(N[(N[(2.0 - N[Sqrt[y], $MachinePrecision]), $MachinePrecision] + t$95$1), $MachinePrecision] + t$95$3), $MachinePrecision]]]]]]

Derivation

1. Split input into 3 regimes

2. if (+.f64 (+.f64 (-.f64 (sqrt.f64 (+.f64 x #s(literal 1 binary64))) (sqrt.f64 x)) (-.f64 (sqrt.f64 (+.f64 y #s(literal 1 binary64))) (sqrt.f64 y))) (-.f64 (sqrt.f64 (+.f64 z #s(literal 1 binary64))) (sqrt.f64 z))) < 0.97999999999999998

   1. Initial program 91.8%

      \[\left(\left(\left(\sqrt{x + 1} - \sqrt{x}\right) + \left(\sqrt{y + 1} - \sqrt{y}\right)\right) + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   2. Taylor expanded in y around inf

      \[\leadsto \left(\color{blue}{\left(\sqrt{1 + x} - \sqrt{x}\right)} + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   4. Applied rewrites 51.3%

      \[\leadsto \left(\color{blue}{\left(\sqrt{1 + x} - \sqrt{x}\right)} + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   5. Taylor expanded in t around 0

      \[\leadsto \left(\left(\sqrt{1 + x} - \sqrt{x}\right) + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \color{blue}{\left(1 - \sqrt{t}\right)} \]

   7. Applied rewrites 28.4%

      \[\leadsto \left(\left(\sqrt{1 + x} - \sqrt{x}\right) + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \color{blue}{\left(1 - \sqrt{t}\right)} \]

   if 0.97999999999999998 < (+.f64 (+.f64 (-.f64 (sqrt.f64 (+.f64 x #s(literal 1 binary64))) (sqrt.f64 x)) (-.f64 (sqrt.f64 (+.f64 y #s(literal 1 binary64))) (sqrt.f64 y))) (-.f64 (sqrt.f64 (+.f64 z #s(literal 1 binary64))) (sqrt.f64 z))) < 1.5

   1. Initial program 91.8%

      \[\left(\left(\left(\sqrt{x + 1} - \sqrt{x}\right) + \left(\sqrt{y + 1} - \sqrt{y}\right)\right) + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   2. Taylor expanded in y around inf

      \[\leadsto \left(\color{blue}{\left(\sqrt{1 + x} - \sqrt{x}\right)} + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   4. Applied rewrites 51.3%

      \[\leadsto \left(\color{blue}{\left(\sqrt{1 + x} - \sqrt{x}\right)} + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   6. Applied rewrites 12.0%

      \[\leadsto \left(\color{blue}{x} + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   8. Applied rewrites 45.1%

      \[\leadsto \left(\color{blue}{1} + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   if 1.5 < (+.f64 (+.f64 (-.f64 (sqrt.f64 (+.f64 x #s(literal 1 binary64))) (sqrt.f64 x)) (-.f64 (sqrt.f64 (+.f64 y #s(literal 1 binary64))) (sqrt.f64 y))) (-.f64 (sqrt.f64 (+.f64 z #s(literal 1 binary64))) (sqrt.f64 z)))

   1. Initial program 91.8%

      \[\left(\left(\left(\sqrt{x + 1} - \sqrt{x}\right) + \left(\sqrt{y + 1} - \sqrt{y}\right)\right) + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   3. Applied rewrites 91.3%

      \[\leadsto \left(\left(\color{blue}{\frac{\left(x + 1\right) - x}{\mathsf{fma}\left(\sqrt{x + 1}, x + 1, \sqrt{x} \cdot x\right)} \cdot \left(\left(\left(x + 1\right) + x\right) - \sqrt{\mathsf{fma}\left(x, x, x\right)}\right)} + \left(\sqrt{y + 1} - \sqrt{y}\right)\right) + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   5. Applied rewrites 85.4%

      \[\leadsto \left(\left(\color{blue}{1} + \left(\sqrt{y + 1} - \sqrt{y}\right)\right) + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   6. Taylor expanded in y around 0

      \[\leadsto \left(\color{blue}{\left(2 - \sqrt{y}\right)} + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   8. Applied rewrites 48.1%

      \[\leadsto \left(\color{blue}{\left(2 - \sqrt{y}\right)} + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 8: 86.9% accurate, 0.4× speedup

Math

\[\begin{array}{l} [x, y, z, t] = \mathsf{sort}([x, y, z, t])\\ \\ \begin{array}{l} t_1 := \sqrt{z + 1} - \sqrt{z}\\ t_2 := \left(\left(\sqrt{x + 1} - \sqrt{x}\right) + \left(\sqrt{y + 1} - \sqrt{y}\right)\right) + t\_1\\ t_3 := \sqrt{t + 1} - \sqrt{t}\\ \mathbf{if}\;t\_2 \leq 0.01:\\ \;\;\;\;\left(\left(1 + \sqrt{1 + y}\right) - \sqrt{y}\right) + t\_3\\ \mathbf{elif}\;t\_2 \leq 1.5:\\ \;\;\;\;\left(1 + t\_1\right) + t\_3\\ \mathbf{else}:\\ \;\;\;\;\left(\left(2 - \sqrt{y}\right) + t\_1\right) + t\_3\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (- (sqrt (+ z 1.0)) (sqrt z)))
        (t_2
         (+
          (+ (- (sqrt (+ x 1.0)) (sqrt x)) (- (sqrt (+ y 1.0)) (sqrt y)))
          t_1))
        (t_3 (- (sqrt (+ t 1.0)) (sqrt t))))
   (if (<= t_2 0.01)
     (+ (- (+ 1.0 (sqrt (+ 1.0 y))) (sqrt y)) t_3)
     (if (<= t_2 1.5) (+ (+ 1.0 t_1) t_3) (+ (+ (- 2.0 (sqrt y)) t_1) t_3)))))

C

assert(x < y && y < z && z < t);
double code(double x, double y, double z, double t) {
	double t_1 = sqrt((z + 1.0)) - sqrt(z);
	double t_2 = ((sqrt((x + 1.0)) - sqrt(x)) + (sqrt((y + 1.0)) - sqrt(y))) + t_1;
	double t_3 = sqrt((t + 1.0)) - sqrt(t);
	double tmp;
	if (t_2 <= 0.01) {
		tmp = ((1.0 + sqrt((1.0 + y))) - sqrt(y)) + t_3;
	} else if (t_2 <= 1.5) {
		tmp = (1.0 + t_1) + t_3;
	} else {
		tmp = ((2.0 - sqrt(y)) + t_1) + t_3;
	}
	return tmp;
}

Fortran

NOTE: x, y, z, and t 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(x, y, z, t)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: t_1
    real(8) :: t_2
    real(8) :: t_3
    real(8) :: tmp
    t_1 = sqrt((z + 1.0d0)) - sqrt(z)
    t_2 = ((sqrt((x + 1.0d0)) - sqrt(x)) + (sqrt((y + 1.0d0)) - sqrt(y))) + t_1
    t_3 = sqrt((t + 1.0d0)) - sqrt(t)
    if (t_2 <= 0.01d0) then
        tmp = ((1.0d0 + sqrt((1.0d0 + y))) - sqrt(y)) + t_3
    else if (t_2 <= 1.5d0) then
        tmp = (1.0d0 + t_1) + t_3
    else
        tmp = ((2.0d0 - sqrt(y)) + t_1) + t_3
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t;
public static double code(double x, double y, double z, double t) {
	double t_1 = Math.sqrt((z + 1.0)) - Math.sqrt(z);
	double t_2 = ((Math.sqrt((x + 1.0)) - Math.sqrt(x)) + (Math.sqrt((y + 1.0)) - Math.sqrt(y))) + t_1;
	double t_3 = Math.sqrt((t + 1.0)) - Math.sqrt(t);
	double tmp;
	if (t_2 <= 0.01) {
		tmp = ((1.0 + Math.sqrt((1.0 + y))) - Math.sqrt(y)) + t_3;
	} else if (t_2 <= 1.5) {
		tmp = (1.0 + t_1) + t_3;
	} else {
		tmp = ((2.0 - Math.sqrt(y)) + t_1) + t_3;
	}
	return tmp;
}

Python

[x, y, z, t] = sort([x, y, z, t])
def code(x, y, z, t):
	t_1 = math.sqrt((z + 1.0)) - math.sqrt(z)
	t_2 = ((math.sqrt((x + 1.0)) - math.sqrt(x)) + (math.sqrt((y + 1.0)) - math.sqrt(y))) + t_1
	t_3 = math.sqrt((t + 1.0)) - math.sqrt(t)
	tmp = 0
	if t_2 <= 0.01:
		tmp = ((1.0 + math.sqrt((1.0 + y))) - math.sqrt(y)) + t_3
	elif t_2 <= 1.5:
		tmp = (1.0 + t_1) + t_3
	else:
		tmp = ((2.0 - math.sqrt(y)) + t_1) + t_3
	return tmp

Julia

x, y, z, t = sort([x, y, z, t])
function code(x, y, z, t)
	t_1 = Float64(sqrt(Float64(z + 1.0)) - sqrt(z))
	t_2 = Float64(Float64(Float64(sqrt(Float64(x + 1.0)) - sqrt(x)) + Float64(sqrt(Float64(y + 1.0)) - sqrt(y))) + t_1)
	t_3 = Float64(sqrt(Float64(t + 1.0)) - sqrt(t))
	tmp = 0.0
	if (t_2 <= 0.01)
		tmp = Float64(Float64(Float64(1.0 + sqrt(Float64(1.0 + y))) - sqrt(y)) + t_3);
	elseif (t_2 <= 1.5)
		tmp = Float64(Float64(1.0 + t_1) + t_3);
	else
		tmp = Float64(Float64(Float64(2.0 - sqrt(y)) + t_1) + t_3);
	end
	return tmp
end

MATLAB

x, y, z, t = num2cell(sort([x, y, z, t])){:}
function tmp_2 = code(x, y, z, t)
	t_1 = sqrt((z + 1.0)) - sqrt(z);
	t_2 = ((sqrt((x + 1.0)) - sqrt(x)) + (sqrt((y + 1.0)) - sqrt(y))) + t_1;
	t_3 = sqrt((t + 1.0)) - sqrt(t);
	tmp = 0.0;
	if (t_2 <= 0.01)
		tmp = ((1.0 + sqrt((1.0 + y))) - sqrt(y)) + t_3;
	elseif (t_2 <= 1.5)
		tmp = (1.0 + t_1) + t_3;
	else
		tmp = ((2.0 - sqrt(y)) + t_1) + t_3;
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_] := Block[{t$95$1 = N[(N[Sqrt[N[(z + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[z], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(N[(N[Sqrt[N[(x + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[x], $MachinePrecision]), $MachinePrecision] + N[(N[Sqrt[N[(y + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + t$95$1), $MachinePrecision]}, Block[{t$95$3 = N[(N[Sqrt[N[(t + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[t], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, 0.01], N[(N[(N[(1.0 + N[Sqrt[N[(1.0 + y), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] - N[Sqrt[y], $MachinePrecision]), $MachinePrecision] + t$95$3), $MachinePrecision], If[LessEqual[t$95$2, 1.5], N[(N[(1.0 + t$95$1), $MachinePrecision] + t$95$3), $MachinePrecision], N[(N[(N[(2.0 - N[Sqrt[y], $MachinePrecision]), $MachinePrecision] + t$95$1), $MachinePrecision] + t$95$3), $MachinePrecision]]]]]]

Derivation

1. Split input into 3 regimes

2. if (+.f64 (+.f64 (-.f64 (sqrt.f64 (+.f64 x #s(literal 1 binary64))) (sqrt.f64 x)) (-.f64 (sqrt.f64 (+.f64 y #s(literal 1 binary64))) (sqrt.f64 y))) (-.f64 (sqrt.f64 (+.f64 z #s(literal 1 binary64))) (sqrt.f64 z))) < 0.0100000000000000002

   1. Initial program 91.8%

      \[\left(\left(\left(\sqrt{x + 1} - \sqrt{x}\right) + \left(\sqrt{y + 1} - \sqrt{y}\right)\right) + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   3. Applied rewrites 91.3%

      \[\leadsto \left(\left(\color{blue}{\frac{\left(x + 1\right) - x}{\mathsf{fma}\left(\sqrt{x + 1}, x + 1, \sqrt{x} \cdot x\right)} \cdot \left(\left(\left(x + 1\right) + x\right) - \sqrt{\mathsf{fma}\left(x, x, x\right)}\right)} + \left(\sqrt{y + 1} - \sqrt{y}\right)\right) + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   5. Applied rewrites 85.4%

      \[\leadsto \left(\left(\color{blue}{1} + \left(\sqrt{y + 1} - \sqrt{y}\right)\right) + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   6. Taylor expanded in z around inf

      \[\leadsto \color{blue}{\left(\left(1 + \sqrt{1 + y}\right) - \sqrt{y}\right)} + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   8. Applied rewrites 53.4%

      \[\leadsto \color{blue}{\left(\left(1 + \sqrt{1 + y}\right) - \sqrt{y}\right)} + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   if 0.0100000000000000002 < (+.f64 (+.f64 (-.f64 (sqrt.f64 (+.f64 x #s(literal 1 binary64))) (sqrt.f64 x)) (-.f64 (sqrt.f64 (+.f64 y #s(literal 1 binary64))) (sqrt.f64 y))) (-.f64 (sqrt.f64 (+.f64 z #s(literal 1 binary64))) (sqrt.f64 z))) < 1.5

   1. Initial program 91.8%

      \[\left(\left(\left(\sqrt{x + 1} - \sqrt{x}\right) + \left(\sqrt{y + 1} - \sqrt{y}\right)\right) + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   2. Taylor expanded in y around inf

      \[\leadsto \left(\color{blue}{\left(\sqrt{1 + x} - \sqrt{x}\right)} + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   4. Applied rewrites 51.3%

      \[\leadsto \left(\color{blue}{\left(\sqrt{1 + x} - \sqrt{x}\right)} + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   6. Applied rewrites 12.0%

      \[\leadsto \left(\color{blue}{x} + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   8. Applied rewrites 45.1%

      \[\leadsto \left(\color{blue}{1} + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   if 1.5 < (+.f64 (+.f64 (-.f64 (sqrt.f64 (+.f64 x #s(literal 1 binary64))) (sqrt.f64 x)) (-.f64 (sqrt.f64 (+.f64 y #s(literal 1 binary64))) (sqrt.f64 y))) (-.f64 (sqrt.f64 (+.f64 z #s(literal 1 binary64))) (sqrt.f64 z)))

   1. Initial program 91.8%

      \[\left(\left(\left(\sqrt{x + 1} - \sqrt{x}\right) + \left(\sqrt{y + 1} - \sqrt{y}\right)\right) + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   3. Applied rewrites 91.3%

      \[\leadsto \left(\left(\color{blue}{\frac{\left(x + 1\right) - x}{\mathsf{fma}\left(\sqrt{x + 1}, x + 1, \sqrt{x} \cdot x\right)} \cdot \left(\left(\left(x + 1\right) + x\right) - \sqrt{\mathsf{fma}\left(x, x, x\right)}\right)} + \left(\sqrt{y + 1} - \sqrt{y}\right)\right) + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   5. Applied rewrites 85.4%

      \[\leadsto \left(\left(\color{blue}{1} + \left(\sqrt{y + 1} - \sqrt{y}\right)\right) + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   6. Taylor expanded in y around 0

      \[\leadsto \left(\color{blue}{\left(2 - \sqrt{y}\right)} + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   8. Applied rewrites 48.1%

      \[\leadsto \left(\color{blue}{\left(2 - \sqrt{y}\right)} + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 9: 83.9% accurate, 0.3× speedup

Math

\[\begin{array}{l} [x, y, z, t] = \mathsf{sort}([x, y, z, t])\\ \\ \begin{array}{l} t_1 := \sqrt{z + 1} - \sqrt{z}\\ t_2 := \left(\left(\sqrt{x + 1} - \sqrt{x}\right) + \left(\sqrt{y + 1} - \sqrt{y}\right)\right) + t\_1\\ t_3 := \sqrt{1 + y}\\ t_4 := \sqrt{t + 1} - \sqrt{t}\\ t_5 := \left(\left(1 + t\_3\right) - \sqrt{y}\right) + t\_4\\ \mathbf{if}\;t\_2 \leq 0.01:\\ \;\;\;\;t\_5\\ \mathbf{elif}\;t\_2 \leq 1:\\ \;\;\;\;\left(1 + t\_1\right) + t\_4\\ \mathbf{elif}\;t\_2 \leq 2.0000005:\\ \;\;\;\;t\_5\\ \mathbf{else}:\\ \;\;\;\;\left(1 + \left(t\_3 + \sqrt{1 + z}\right)\right) - \left(\sqrt{y} + \sqrt{z}\right)\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (- (sqrt (+ z 1.0)) (sqrt z)))
        (t_2
         (+
          (+ (- (sqrt (+ x 1.0)) (sqrt x)) (- (sqrt (+ y 1.0)) (sqrt y)))
          t_1))
        (t_3 (sqrt (+ 1.0 y)))
        (t_4 (- (sqrt (+ t 1.0)) (sqrt t)))
        (t_5 (+ (- (+ 1.0 t_3) (sqrt y)) t_4)))
   (if (<= t_2 0.01)
     t_5
     (if (<= t_2 1.0)
       (+ (+ 1.0 t_1) t_4)
       (if (<= t_2 2.0000005)
         t_5
         (- (+ 1.0 (+ t_3 (sqrt (+ 1.0 z)))) (+ (sqrt y) (sqrt z))))))))

C

assert(x < y && y < z && z < t);
double code(double x, double y, double z, double t) {
	double t_1 = sqrt((z + 1.0)) - sqrt(z);
	double t_2 = ((sqrt((x + 1.0)) - sqrt(x)) + (sqrt((y + 1.0)) - sqrt(y))) + t_1;
	double t_3 = sqrt((1.0 + y));
	double t_4 = sqrt((t + 1.0)) - sqrt(t);
	double t_5 = ((1.0 + t_3) - sqrt(y)) + t_4;
	double tmp;
	if (t_2 <= 0.01) {
		tmp = t_5;
	} else if (t_2 <= 1.0) {
		tmp = (1.0 + t_1) + t_4;
	} else if (t_2 <= 2.0000005) {
		tmp = t_5;
	} else {
		tmp = (1.0 + (t_3 + sqrt((1.0 + z)))) - (sqrt(y) + sqrt(z));
	}
	return tmp;
}

Fortran

NOTE: x, y, z, and t 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(x, y, z, t)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: t_1
    real(8) :: t_2
    real(8) :: t_3
    real(8) :: t_4
    real(8) :: t_5
    real(8) :: tmp
    t_1 = sqrt((z + 1.0d0)) - sqrt(z)
    t_2 = ((sqrt((x + 1.0d0)) - sqrt(x)) + (sqrt((y + 1.0d0)) - sqrt(y))) + t_1
    t_3 = sqrt((1.0d0 + y))
    t_4 = sqrt((t + 1.0d0)) - sqrt(t)
    t_5 = ((1.0d0 + t_3) - sqrt(y)) + t_4
    if (t_2 <= 0.01d0) then
        tmp = t_5
    else if (t_2 <= 1.0d0) then
        tmp = (1.0d0 + t_1) + t_4
    else if (t_2 <= 2.0000005d0) then
        tmp = t_5
    else
        tmp = (1.0d0 + (t_3 + sqrt((1.0d0 + z)))) - (sqrt(y) + sqrt(z))
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t;
public static double code(double x, double y, double z, double t) {
	double t_1 = Math.sqrt((z + 1.0)) - Math.sqrt(z);
	double t_2 = ((Math.sqrt((x + 1.0)) - Math.sqrt(x)) + (Math.sqrt((y + 1.0)) - Math.sqrt(y))) + t_1;
	double t_3 = Math.sqrt((1.0 + y));
	double t_4 = Math.sqrt((t + 1.0)) - Math.sqrt(t);
	double t_5 = ((1.0 + t_3) - Math.sqrt(y)) + t_4;
	double tmp;
	if (t_2 <= 0.01) {
		tmp = t_5;
	} else if (t_2 <= 1.0) {
		tmp = (1.0 + t_1) + t_4;
	} else if (t_2 <= 2.0000005) {
		tmp = t_5;
	} else {
		tmp = (1.0 + (t_3 + Math.sqrt((1.0 + z)))) - (Math.sqrt(y) + Math.sqrt(z));
	}
	return tmp;
}

Python

[x, y, z, t] = sort([x, y, z, t])
def code(x, y, z, t):
	t_1 = math.sqrt((z + 1.0)) - math.sqrt(z)
	t_2 = ((math.sqrt((x + 1.0)) - math.sqrt(x)) + (math.sqrt((y + 1.0)) - math.sqrt(y))) + t_1
	t_3 = math.sqrt((1.0 + y))
	t_4 = math.sqrt((t + 1.0)) - math.sqrt(t)
	t_5 = ((1.0 + t_3) - math.sqrt(y)) + t_4
	tmp = 0
	if t_2 <= 0.01:
		tmp = t_5
	elif t_2 <= 1.0:
		tmp = (1.0 + t_1) + t_4
	elif t_2 <= 2.0000005:
		tmp = t_5
	else:
		tmp = (1.0 + (t_3 + math.sqrt((1.0 + z)))) - (math.sqrt(y) + math.sqrt(z))
	return tmp

Julia

x, y, z, t = sort([x, y, z, t])
function code(x, y, z, t)
	t_1 = Float64(sqrt(Float64(z + 1.0)) - sqrt(z))
	t_2 = Float64(Float64(Float64(sqrt(Float64(x + 1.0)) - sqrt(x)) + Float64(sqrt(Float64(y + 1.0)) - sqrt(y))) + t_1)
	t_3 = sqrt(Float64(1.0 + y))
	t_4 = Float64(sqrt(Float64(t + 1.0)) - sqrt(t))
	t_5 = Float64(Float64(Float64(1.0 + t_3) - sqrt(y)) + t_4)
	tmp = 0.0
	if (t_2 <= 0.01)
		tmp = t_5;
	elseif (t_2 <= 1.0)
		tmp = Float64(Float64(1.0 + t_1) + t_4);
	elseif (t_2 <= 2.0000005)
		tmp = t_5;
	else
		tmp = Float64(Float64(1.0 + Float64(t_3 + sqrt(Float64(1.0 + z)))) - Float64(sqrt(y) + sqrt(z)));
	end
	return tmp
end

MATLAB

x, y, z, t = num2cell(sort([x, y, z, t])){:}
function tmp_2 = code(x, y, z, t)
	t_1 = sqrt((z + 1.0)) - sqrt(z);
	t_2 = ((sqrt((x + 1.0)) - sqrt(x)) + (sqrt((y + 1.0)) - sqrt(y))) + t_1;
	t_3 = sqrt((1.0 + y));
	t_4 = sqrt((t + 1.0)) - sqrt(t);
	t_5 = ((1.0 + t_3) - sqrt(y)) + t_4;
	tmp = 0.0;
	if (t_2 <= 0.01)
		tmp = t_5;
	elseif (t_2 <= 1.0)
		tmp = (1.0 + t_1) + t_4;
	elseif (t_2 <= 2.0000005)
		tmp = t_5;
	else
		tmp = (1.0 + (t_3 + sqrt((1.0 + z)))) - (sqrt(y) + sqrt(z));
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_] := Block[{t$95$1 = N[(N[Sqrt[N[(z + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[z], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(N[(N[Sqrt[N[(x + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[x], $MachinePrecision]), $MachinePrecision] + N[(N[Sqrt[N[(y + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + t$95$1), $MachinePrecision]}, Block[{t$95$3 = N[Sqrt[N[(1.0 + y), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$4 = N[(N[Sqrt[N[(t + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[t], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$5 = N[(N[(N[(1.0 + t$95$3), $MachinePrecision] - N[Sqrt[y], $MachinePrecision]), $MachinePrecision] + t$95$4), $MachinePrecision]}, If[LessEqual[t$95$2, 0.01], t$95$5, If[LessEqual[t$95$2, 1.0], N[(N[(1.0 + t$95$1), $MachinePrecision] + t$95$4), $MachinePrecision], If[LessEqual[t$95$2, 2.0000005], t$95$5, N[(N[(1.0 + N[(t$95$3 + N[Sqrt[N[(1.0 + z), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(N[Sqrt[y], $MachinePrecision] + N[Sqrt[z], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]]]

Derivation

1. Split input into 3 regimes

2. if (+.f64 (+.f64 (-.f64 (sqrt.f64 (+.f64 x #s(literal 1 binary64))) (sqrt.f64 x)) (-.f64 (sqrt.f64 (+.f64 y #s(literal 1 binary64))) (sqrt.f64 y))) (-.f64 (sqrt.f64 (+.f64 z #s(literal 1 binary64))) (sqrt.f64 z))) < 0.0100000000000000002 or 1 < (+.f64 (+.f64 (-.f64 (sqrt.f64 (+.f64 x #s(literal 1 binary64))) (sqrt.f64 x)) (-.f64 (sqrt.f64 (+.f64 y #s(literal 1 binary64))) (sqrt.f64 y))) (-.f64 (sqrt.f64 (+.f64 z #s(literal 1 binary64))) (sqrt.f64 z))) < 2.00000050000000007

   1. Initial program 91.8%

      \[\left(\left(\left(\sqrt{x + 1} - \sqrt{x}\right) + \left(\sqrt{y + 1} - \sqrt{y}\right)\right) + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   3. Applied rewrites 91.3%

      \[\leadsto \left(\left(\color{blue}{\frac{\left(x + 1\right) - x}{\mathsf{fma}\left(\sqrt{x + 1}, x + 1, \sqrt{x} \cdot x\right)} \cdot \left(\left(\left(x + 1\right) + x\right) - \sqrt{\mathsf{fma}\left(x, x, x\right)}\right)} + \left(\sqrt{y + 1} - \sqrt{y}\right)\right) + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   5. Applied rewrites 85.4%

      \[\leadsto \left(\left(\color{blue}{1} + \left(\sqrt{y + 1} - \sqrt{y}\right)\right) + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   6. Taylor expanded in z around inf

      \[\leadsto \color{blue}{\left(\left(1 + \sqrt{1 + y}\right) - \sqrt{y}\right)} + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   8. Applied rewrites 53.4%

      \[\leadsto \color{blue}{\left(\left(1 + \sqrt{1 + y}\right) - \sqrt{y}\right)} + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   if 0.0100000000000000002 < (+.f64 (+.f64 (-.f64 (sqrt.f64 (+.f64 x #s(literal 1 binary64))) (sqrt.f64 x)) (-.f64 (sqrt.f64 (+.f64 y #s(literal 1 binary64))) (sqrt.f64 y))) (-.f64 (sqrt.f64 (+.f64 z #s(literal 1 binary64))) (sqrt.f64 z))) < 1

   1. Initial program 91.8%

      \[\left(\left(\left(\sqrt{x + 1} - \sqrt{x}\right) + \left(\sqrt{y + 1} - \sqrt{y}\right)\right) + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   2. Taylor expanded in y around inf

      \[\leadsto \left(\color{blue}{\left(\sqrt{1 + x} - \sqrt{x}\right)} + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   4. Applied rewrites 51.3%

      \[\leadsto \left(\color{blue}{\left(\sqrt{1 + x} - \sqrt{x}\right)} + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   6. Applied rewrites 12.0%

      \[\leadsto \left(\color{blue}{x} + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   8. Applied rewrites 45.1%

      \[\leadsto \left(\color{blue}{1} + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   if 2.00000050000000007 < (+.f64 (+.f64 (-.f64 (sqrt.f64 (+.f64 x #s(literal 1 binary64))) (sqrt.f64 x)) (-.f64 (sqrt.f64 (+.f64 y #s(literal 1 binary64))) (sqrt.f64 y))) (-.f64 (sqrt.f64 (+.f64 z #s(literal 1 binary64))) (sqrt.f64 z)))

   1. Initial program 91.8%

      \[\left(\left(\left(\sqrt{x + 1} - \sqrt{x}\right) + \left(\sqrt{y + 1} - \sqrt{y}\right)\right) + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   3. Applied rewrites 91.3%

      \[\leadsto \left(\left(\color{blue}{\frac{\left(x + 1\right) - x}{\mathsf{fma}\left(\sqrt{x + 1}, x + 1, \sqrt{x} \cdot x\right)} \cdot \left(\left(\left(x + 1\right) + x\right) - \sqrt{\mathsf{fma}\left(x, x, x\right)}\right)} + \left(\sqrt{y + 1} - \sqrt{y}\right)\right) + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   5. Applied rewrites 85.4%

      \[\leadsto \left(\left(\color{blue}{1} + \left(\sqrt{y + 1} - \sqrt{y}\right)\right) + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   6. Taylor expanded in t around inf

      \[\leadsto \color{blue}{\left(1 + \left(\sqrt{1 + y} + \sqrt{1 + z}\right)\right) - \left(\sqrt{y} + \sqrt{z}\right)} \]

   8. Applied rewrites 12.0%

      \[\leadsto \color{blue}{\left(1 + \left(\sqrt{1 + y} + \sqrt{1 + z}\right)\right) - \left(\sqrt{y} + \sqrt{z}\right)} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 10: 79.0% accurate, 0.5× speedup

Math

\[\begin{array}{l} [x, y, z, t] = \mathsf{sort}([x, y, z, t])\\ \\ \begin{array}{l} t_1 := \sqrt{z + 1} - \sqrt{z}\\ t_2 := \left(\left(\sqrt{x + 1} - \sqrt{x}\right) + \left(\sqrt{y + 1} - \sqrt{y}\right)\right) + t\_1\\ t_3 := \sqrt{t + 1} - \sqrt{t}\\ t_4 := \left(\left(1 + \sqrt{1 + y}\right) - \sqrt{y}\right) + t\_3\\ \mathbf{if}\;t\_2 \leq 0.01:\\ \;\;\;\;t\_4\\ \mathbf{elif}\;t\_2 \leq 1:\\ \;\;\;\;\left(1 + t\_1\right) + t\_3\\ \mathbf{else}:\\ \;\;\;\;t\_4\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (- (sqrt (+ z 1.0)) (sqrt z)))
        (t_2
         (+
          (+ (- (sqrt (+ x 1.0)) (sqrt x)) (- (sqrt (+ y 1.0)) (sqrt y)))
          t_1))
        (t_3 (- (sqrt (+ t 1.0)) (sqrt t)))
        (t_4 (+ (- (+ 1.0 (sqrt (+ 1.0 y))) (sqrt y)) t_3)))
   (if (<= t_2 0.01) t_4 (if (<= t_2 1.0) (+ (+ 1.0 t_1) t_3) t_4))))

C

assert(x < y && y < z && z < t);
double code(double x, double y, double z, double t) {
	double t_1 = sqrt((z + 1.0)) - sqrt(z);
	double t_2 = ((sqrt((x + 1.0)) - sqrt(x)) + (sqrt((y + 1.0)) - sqrt(y))) + t_1;
	double t_3 = sqrt((t + 1.0)) - sqrt(t);
	double t_4 = ((1.0 + sqrt((1.0 + y))) - sqrt(y)) + t_3;
	double tmp;
	if (t_2 <= 0.01) {
		tmp = t_4;
	} else if (t_2 <= 1.0) {
		tmp = (1.0 + t_1) + t_3;
	} else {
		tmp = t_4;
	}
	return tmp;
}

Fortran

NOTE: x, y, z, and t 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(x, y, z, t)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: t_1
    real(8) :: t_2
    real(8) :: t_3
    real(8) :: t_4
    real(8) :: tmp
    t_1 = sqrt((z + 1.0d0)) - sqrt(z)
    t_2 = ((sqrt((x + 1.0d0)) - sqrt(x)) + (sqrt((y + 1.0d0)) - sqrt(y))) + t_1
    t_3 = sqrt((t + 1.0d0)) - sqrt(t)
    t_4 = ((1.0d0 + sqrt((1.0d0 + y))) - sqrt(y)) + t_3
    if (t_2 <= 0.01d0) then
        tmp = t_4
    else if (t_2 <= 1.0d0) then
        tmp = (1.0d0 + t_1) + t_3
    else
        tmp = t_4
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t;
public static double code(double x, double y, double z, double t) {
	double t_1 = Math.sqrt((z + 1.0)) - Math.sqrt(z);
	double t_2 = ((Math.sqrt((x + 1.0)) - Math.sqrt(x)) + (Math.sqrt((y + 1.0)) - Math.sqrt(y))) + t_1;
	double t_3 = Math.sqrt((t + 1.0)) - Math.sqrt(t);
	double t_4 = ((1.0 + Math.sqrt((1.0 + y))) - Math.sqrt(y)) + t_3;
	double tmp;
	if (t_2 <= 0.01) {
		tmp = t_4;
	} else if (t_2 <= 1.0) {
		tmp = (1.0 + t_1) + t_3;
	} else {
		tmp = t_4;
	}
	return tmp;
}

Python

[x, y, z, t] = sort([x, y, z, t])
def code(x, y, z, t):
	t_1 = math.sqrt((z + 1.0)) - math.sqrt(z)
	t_2 = ((math.sqrt((x + 1.0)) - math.sqrt(x)) + (math.sqrt((y + 1.0)) - math.sqrt(y))) + t_1
	t_3 = math.sqrt((t + 1.0)) - math.sqrt(t)
	t_4 = ((1.0 + math.sqrt((1.0 + y))) - math.sqrt(y)) + t_3
	tmp = 0
	if t_2 <= 0.01:
		tmp = t_4
	elif t_2 <= 1.0:
		tmp = (1.0 + t_1) + t_3
	else:
		tmp = t_4
	return tmp

Julia

x, y, z, t = sort([x, y, z, t])
function code(x, y, z, t)
	t_1 = Float64(sqrt(Float64(z + 1.0)) - sqrt(z))
	t_2 = Float64(Float64(Float64(sqrt(Float64(x + 1.0)) - sqrt(x)) + Float64(sqrt(Float64(y + 1.0)) - sqrt(y))) + t_1)
	t_3 = Float64(sqrt(Float64(t + 1.0)) - sqrt(t))
	t_4 = Float64(Float64(Float64(1.0 + sqrt(Float64(1.0 + y))) - sqrt(y)) + t_3)
	tmp = 0.0
	if (t_2 <= 0.01)
		tmp = t_4;
	elseif (t_2 <= 1.0)
		tmp = Float64(Float64(1.0 + t_1) + t_3);
	else
		tmp = t_4;
	end
	return tmp
end

MATLAB

x, y, z, t = num2cell(sort([x, y, z, t])){:}
function tmp_2 = code(x, y, z, t)
	t_1 = sqrt((z + 1.0)) - sqrt(z);
	t_2 = ((sqrt((x + 1.0)) - sqrt(x)) + (sqrt((y + 1.0)) - sqrt(y))) + t_1;
	t_3 = sqrt((t + 1.0)) - sqrt(t);
	t_4 = ((1.0 + sqrt((1.0 + y))) - sqrt(y)) + t_3;
	tmp = 0.0;
	if (t_2 <= 0.01)
		tmp = t_4;
	elseif (t_2 <= 1.0)
		tmp = (1.0 + t_1) + t_3;
	else
		tmp = t_4;
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_] := Block[{t$95$1 = N[(N[Sqrt[N[(z + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[z], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(N[(N[Sqrt[N[(x + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[x], $MachinePrecision]), $MachinePrecision] + N[(N[Sqrt[N[(y + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + t$95$1), $MachinePrecision]}, Block[{t$95$3 = N[(N[Sqrt[N[(t + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[t], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(N[(N[(1.0 + N[Sqrt[N[(1.0 + y), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] - N[Sqrt[y], $MachinePrecision]), $MachinePrecision] + t$95$3), $MachinePrecision]}, If[LessEqual[t$95$2, 0.01], t$95$4, If[LessEqual[t$95$2, 1.0], N[(N[(1.0 + t$95$1), $MachinePrecision] + t$95$3), $MachinePrecision], t$95$4]]]]]]

Derivation

1. Split input into 2 regimes

2. if (+.f64 (+.f64 (-.f64 (sqrt.f64 (+.f64 x #s(literal 1 binary64))) (sqrt.f64 x)) (-.f64 (sqrt.f64 (+.f64 y #s(literal 1 binary64))) (sqrt.f64 y))) (-.f64 (sqrt.f64 (+.f64 z #s(literal 1 binary64))) (sqrt.f64 z))) < 0.0100000000000000002 or 1 < (+.f64 (+.f64 (-.f64 (sqrt.f64 (+.f64 x #s(literal 1 binary64))) (sqrt.f64 x)) (-.f64 (sqrt.f64 (+.f64 y #s(literal 1 binary64))) (sqrt.f64 y))) (-.f64 (sqrt.f64 (+.f64 z #s(literal 1 binary64))) (sqrt.f64 z)))

   1. Initial program 91.8%

      \[\left(\left(\left(\sqrt{x + 1} - \sqrt{x}\right) + \left(\sqrt{y + 1} - \sqrt{y}\right)\right) + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   3. Applied rewrites 91.3%

      \[\leadsto \left(\left(\color{blue}{\frac{\left(x + 1\right) - x}{\mathsf{fma}\left(\sqrt{x + 1}, x + 1, \sqrt{x} \cdot x\right)} \cdot \left(\left(\left(x + 1\right) + x\right) - \sqrt{\mathsf{fma}\left(x, x, x\right)}\right)} + \left(\sqrt{y + 1} - \sqrt{y}\right)\right) + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   5. Applied rewrites 85.4%

      \[\leadsto \left(\left(\color{blue}{1} + \left(\sqrt{y + 1} - \sqrt{y}\right)\right) + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   6. Taylor expanded in z around inf

      \[\leadsto \color{blue}{\left(\left(1 + \sqrt{1 + y}\right) - \sqrt{y}\right)} + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   8. Applied rewrites 53.4%

      \[\leadsto \color{blue}{\left(\left(1 + \sqrt{1 + y}\right) - \sqrt{y}\right)} + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   if 0.0100000000000000002 < (+.f64 (+.f64 (-.f64 (sqrt.f64 (+.f64 x #s(literal 1 binary64))) (sqrt.f64 x)) (-.f64 (sqrt.f64 (+.f64 y #s(literal 1 binary64))) (sqrt.f64 y))) (-.f64 (sqrt.f64 (+.f64 z #s(literal 1 binary64))) (sqrt.f64 z))) < 1

   1. Initial program 91.8%

      \[\left(\left(\left(\sqrt{x + 1} - \sqrt{x}\right) + \left(\sqrt{y + 1} - \sqrt{y}\right)\right) + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   2. Taylor expanded in y around inf

      \[\leadsto \left(\color{blue}{\left(\sqrt{1 + x} - \sqrt{x}\right)} + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   4. Applied rewrites 51.3%

      \[\leadsto \left(\color{blue}{\left(\sqrt{1 + x} - \sqrt{x}\right)} + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   6. Applied rewrites 12.0%

      \[\leadsto \left(\color{blue}{x} + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   8. Applied rewrites 45.1%

      \[\leadsto \left(\color{blue}{1} + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 11: 79.0% accurate, 0.5× speedup

Math

\[\begin{array}{l} [x, y, z, t] = \mathsf{sort}([x, y, z, t])\\ \\ \begin{array}{l} t_1 := \left(\left(\sqrt{x + 1} - \sqrt{x}\right) + \left(\sqrt{y + 1} - \sqrt{y}\right)\right) + \left(\sqrt{z + 1} - \sqrt{z}\right)\\ t_2 := \sqrt{t + 1} - \sqrt{t}\\ t_3 := \left(\left(1 + \sqrt{1 + y}\right) - \sqrt{y}\right) + t\_2\\ \mathbf{if}\;t\_1 \leq 0.4:\\ \;\;\;\;t\_3\\ \mathbf{elif}\;t\_1 \leq 1:\\ \;\;\;\;\left(x + z \cdot \frac{1}{z}\right) + t\_2\\ \mathbf{else}:\\ \;\;\;\;t\_3\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
(FPCore (x y z t)
 :precision binary64
 (let* ((t_1
         (+
          (+ (- (sqrt (+ x 1.0)) (sqrt x)) (- (sqrt (+ y 1.0)) (sqrt y)))
          (- (sqrt (+ z 1.0)) (sqrt z))))
        (t_2 (- (sqrt (+ t 1.0)) (sqrt t)))
        (t_3 (+ (- (+ 1.0 (sqrt (+ 1.0 y))) (sqrt y)) t_2)))
   (if (<= t_1 0.4) t_3 (if (<= t_1 1.0) (+ (+ x (* z (/ 1.0 z))) t_2) t_3))))

C

assert(x < y && y < z && z < t);
double code(double x, double y, double z, double t) {
	double t_1 = ((sqrt((x + 1.0)) - sqrt(x)) + (sqrt((y + 1.0)) - sqrt(y))) + (sqrt((z + 1.0)) - sqrt(z));
	double t_2 = sqrt((t + 1.0)) - sqrt(t);
	double t_3 = ((1.0 + sqrt((1.0 + y))) - sqrt(y)) + t_2;
	double tmp;
	if (t_1 <= 0.4) {
		tmp = t_3;
	} else if (t_1 <= 1.0) {
		tmp = (x + (z * (1.0 / z))) + t_2;
	} else {
		tmp = t_3;
	}
	return tmp;
}

Fortran

NOTE: x, y, z, and t 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(x, y, z, t)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: t_1
    real(8) :: t_2
    real(8) :: t_3
    real(8) :: tmp
    t_1 = ((sqrt((x + 1.0d0)) - sqrt(x)) + (sqrt((y + 1.0d0)) - sqrt(y))) + (sqrt((z + 1.0d0)) - sqrt(z))
    t_2 = sqrt((t + 1.0d0)) - sqrt(t)
    t_3 = ((1.0d0 + sqrt((1.0d0 + y))) - sqrt(y)) + t_2
    if (t_1 <= 0.4d0) then
        tmp = t_3
    else if (t_1 <= 1.0d0) then
        tmp = (x + (z * (1.0d0 / z))) + t_2
    else
        tmp = t_3
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t;
public static double code(double x, double y, double z, double t) {
	double t_1 = ((Math.sqrt((x + 1.0)) - Math.sqrt(x)) + (Math.sqrt((y + 1.0)) - Math.sqrt(y))) + (Math.sqrt((z + 1.0)) - Math.sqrt(z));
	double t_2 = Math.sqrt((t + 1.0)) - Math.sqrt(t);
	double t_3 = ((1.0 + Math.sqrt((1.0 + y))) - Math.sqrt(y)) + t_2;
	double tmp;
	if (t_1 <= 0.4) {
		tmp = t_3;
	} else if (t_1 <= 1.0) {
		tmp = (x + (z * (1.0 / z))) + t_2;
	} else {
		tmp = t_3;
	}
	return tmp;
}

Python

[x, y, z, t] = sort([x, y, z, t])
def code(x, y, z, t):
	t_1 = ((math.sqrt((x + 1.0)) - math.sqrt(x)) + (math.sqrt((y + 1.0)) - math.sqrt(y))) + (math.sqrt((z + 1.0)) - math.sqrt(z))
	t_2 = math.sqrt((t + 1.0)) - math.sqrt(t)
	t_3 = ((1.0 + math.sqrt((1.0 + y))) - math.sqrt(y)) + t_2
	tmp = 0
	if t_1 <= 0.4:
		tmp = t_3
	elif t_1 <= 1.0:
		tmp = (x + (z * (1.0 / z))) + t_2
	else:
		tmp = t_3
	return tmp

Julia

x, y, z, t = sort([x, y, z, t])
function code(x, y, z, t)
	t_1 = Float64(Float64(Float64(sqrt(Float64(x + 1.0)) - sqrt(x)) + Float64(sqrt(Float64(y + 1.0)) - sqrt(y))) + Float64(sqrt(Float64(z + 1.0)) - sqrt(z)))
	t_2 = Float64(sqrt(Float64(t + 1.0)) - sqrt(t))
	t_3 = Float64(Float64(Float64(1.0 + sqrt(Float64(1.0 + y))) - sqrt(y)) + t_2)
	tmp = 0.0
	if (t_1 <= 0.4)
		tmp = t_3;
	elseif (t_1 <= 1.0)
		tmp = Float64(Float64(x + Float64(z * Float64(1.0 / z))) + t_2);
	else
		tmp = t_3;
	end
	return tmp
end

MATLAB

x, y, z, t = num2cell(sort([x, y, z, t])){:}
function tmp_2 = code(x, y, z, t)
	t_1 = ((sqrt((x + 1.0)) - sqrt(x)) + (sqrt((y + 1.0)) - sqrt(y))) + (sqrt((z + 1.0)) - sqrt(z));
	t_2 = sqrt((t + 1.0)) - sqrt(t);
	t_3 = ((1.0 + sqrt((1.0 + y))) - sqrt(y)) + t_2;
	tmp = 0.0;
	if (t_1 <= 0.4)
		tmp = t_3;
	elseif (t_1 <= 1.0)
		tmp = (x + (z * (1.0 / z))) + t_2;
	else
		tmp = t_3;
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_] := Block[{t$95$1 = N[(N[(N[(N[Sqrt[N[(x + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[x], $MachinePrecision]), $MachinePrecision] + N[(N[Sqrt[N[(y + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[Sqrt[N[(z + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[z], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[Sqrt[N[(t + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[t], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[(N[(1.0 + N[Sqrt[N[(1.0 + y), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] - N[Sqrt[y], $MachinePrecision]), $MachinePrecision] + t$95$2), $MachinePrecision]}, If[LessEqual[t$95$1, 0.4], t$95$3, If[LessEqual[t$95$1, 1.0], N[(N[(x + N[(z * N[(1.0 / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + t$95$2), $MachinePrecision], t$95$3]]]]]

Derivation

1. Split input into 2 regimes

2. if (+.f64 (+.f64 (-.f64 (sqrt.f64 (+.f64 x #s(literal 1 binary64))) (sqrt.f64 x)) (-.f64 (sqrt.f64 (+.f64 y #s(literal 1 binary64))) (sqrt.f64 y))) (-.f64 (sqrt.f64 (+.f64 z #s(literal 1 binary64))) (sqrt.f64 z))) < 0.40000000000000002 or 1 < (+.f64 (+.f64 (-.f64 (sqrt.f64 (+.f64 x #s(literal 1 binary64))) (sqrt.f64 x)) (-.f64 (sqrt.f64 (+.f64 y #s(literal 1 binary64))) (sqrt.f64 y))) (-.f64 (sqrt.f64 (+.f64 z #s(literal 1 binary64))) (sqrt.f64 z)))

   1. Initial program 91.8%

      \[\left(\left(\left(\sqrt{x + 1} - \sqrt{x}\right) + \left(\sqrt{y + 1} - \sqrt{y}\right)\right) + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   3. Applied rewrites 91.3%

      \[\leadsto \left(\left(\color{blue}{\frac{\left(x + 1\right) - x}{\mathsf{fma}\left(\sqrt{x + 1}, x + 1, \sqrt{x} \cdot x\right)} \cdot \left(\left(\left(x + 1\right) + x\right) - \sqrt{\mathsf{fma}\left(x, x, x\right)}\right)} + \left(\sqrt{y + 1} - \sqrt{y}\right)\right) + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   5. Applied rewrites 85.4%

      \[\leadsto \left(\left(\color{blue}{1} + \left(\sqrt{y + 1} - \sqrt{y}\right)\right) + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   6. Taylor expanded in z around inf

      \[\leadsto \color{blue}{\left(\left(1 + \sqrt{1 + y}\right) - \sqrt{y}\right)} + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   8. Applied rewrites 53.4%

      \[\leadsto \color{blue}{\left(\left(1 + \sqrt{1 + y}\right) - \sqrt{y}\right)} + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   if 0.40000000000000002 < (+.f64 (+.f64 (-.f64 (sqrt.f64 (+.f64 x #s(literal 1 binary64))) (sqrt.f64 x)) (-.f64 (sqrt.f64 (+.f64 y #s(literal 1 binary64))) (sqrt.f64 y))) (-.f64 (sqrt.f64 (+.f64 z #s(literal 1 binary64))) (sqrt.f64 z))) < 1

   1. Initial program 91.8%

      \[\left(\left(\left(\sqrt{x + 1} - \sqrt{x}\right) + \left(\sqrt{y + 1} - \sqrt{y}\right)\right) + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   2. Taylor expanded in y around inf

      \[\leadsto \left(\color{blue}{\left(\sqrt{1 + x} - \sqrt{x}\right)} + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   4. Applied rewrites 51.3%

      \[\leadsto \left(\color{blue}{\left(\sqrt{1 + x} - \sqrt{x}\right)} + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   6. Applied rewrites 12.0%

      \[\leadsto \left(\color{blue}{x} + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   8. Applied rewrites 43.9%

      \[\leadsto \left(x + \color{blue}{z \cdot \frac{1}{z}}\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 12: 49.1% accurate, 0.8× speedup

Math

\[\begin{array}{l} [x, y, z, t] = \mathsf{sort}([x, y, z, t])\\ \\ \begin{array}{l} \mathbf{if}\;\left(\left(\sqrt{x + 1} - \sqrt{x}\right) + \left(\sqrt{y + 1} - \sqrt{y}\right)\right) + \left(\sqrt{z + 1} - \sqrt{z}\right) \leq 0.4:\\ \;\;\;\;\sqrt{1 + t} - \sqrt{t}\\ \mathbf{else}:\\ \;\;\;\;\left(x + z \cdot \frac{1}{z}\right) + \left(\sqrt{t + 1} - \sqrt{t}\right)\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
(FPCore (x y z t)
 :precision binary64
 (if (<=
      (+
       (+ (- (sqrt (+ x 1.0)) (sqrt x)) (- (sqrt (+ y 1.0)) (sqrt y)))
       (- (sqrt (+ z 1.0)) (sqrt z)))
      0.4)
   (- (sqrt (+ 1.0 t)) (sqrt t))
   (+ (+ x (* z (/ 1.0 z))) (- (sqrt (+ t 1.0)) (sqrt t)))))

C

assert(x < y && y < z && z < t);
double code(double x, double y, double z, double t) {
	double tmp;
	if ((((sqrt((x + 1.0)) - sqrt(x)) + (sqrt((y + 1.0)) - sqrt(y))) + (sqrt((z + 1.0)) - sqrt(z))) <= 0.4) {
		tmp = sqrt((1.0 + t)) - sqrt(t);
	} else {
		tmp = (x + (z * (1.0 / z))) + (sqrt((t + 1.0)) - sqrt(t));
	}
	return tmp;
}

Fortran

NOTE: x, y, z, and t 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(x, y, z, t)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: tmp
    if ((((sqrt((x + 1.0d0)) - sqrt(x)) + (sqrt((y + 1.0d0)) - sqrt(y))) + (sqrt((z + 1.0d0)) - sqrt(z))) <= 0.4d0) then
        tmp = sqrt((1.0d0 + t)) - sqrt(t)
    else
        tmp = (x + (z * (1.0d0 / z))) + (sqrt((t + 1.0d0)) - sqrt(t))
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t;
public static double code(double x, double y, double z, double t) {
	double tmp;
	if ((((Math.sqrt((x + 1.0)) - Math.sqrt(x)) + (Math.sqrt((y + 1.0)) - Math.sqrt(y))) + (Math.sqrt((z + 1.0)) - Math.sqrt(z))) <= 0.4) {
		tmp = Math.sqrt((1.0 + t)) - Math.sqrt(t);
	} else {
		tmp = (x + (z * (1.0 / z))) + (Math.sqrt((t + 1.0)) - Math.sqrt(t));
	}
	return tmp;
}

Python

[x, y, z, t] = sort([x, y, z, t])
def code(x, y, z, t):
	tmp = 0
	if (((math.sqrt((x + 1.0)) - math.sqrt(x)) + (math.sqrt((y + 1.0)) - math.sqrt(y))) + (math.sqrt((z + 1.0)) - math.sqrt(z))) <= 0.4:
		tmp = math.sqrt((1.0 + t)) - math.sqrt(t)
	else:
		tmp = (x + (z * (1.0 / z))) + (math.sqrt((t + 1.0)) - math.sqrt(t))
	return tmp

Julia

x, y, z, t = sort([x, y, z, t])
function code(x, y, z, t)
	tmp = 0.0
	if (Float64(Float64(Float64(sqrt(Float64(x + 1.0)) - sqrt(x)) + Float64(sqrt(Float64(y + 1.0)) - sqrt(y))) + Float64(sqrt(Float64(z + 1.0)) - sqrt(z))) <= 0.4)
		tmp = Float64(sqrt(Float64(1.0 + t)) - sqrt(t));
	else
		tmp = Float64(Float64(x + Float64(z * Float64(1.0 / z))) + Float64(sqrt(Float64(t + 1.0)) - sqrt(t)));
	end
	return tmp
end

MATLAB

x, y, z, t = num2cell(sort([x, y, z, t])){:}
function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if ((((sqrt((x + 1.0)) - sqrt(x)) + (sqrt((y + 1.0)) - sqrt(y))) + (sqrt((z + 1.0)) - sqrt(z))) <= 0.4)
		tmp = sqrt((1.0 + t)) - sqrt(t);
	else
		tmp = (x + (z * (1.0 / z))) + (sqrt((t + 1.0)) - sqrt(t));
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_] := If[LessEqual[N[(N[(N[(N[Sqrt[N[(x + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[x], $MachinePrecision]), $MachinePrecision] + N[(N[Sqrt[N[(y + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[Sqrt[N[(z + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[z], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.4], N[(N[Sqrt[N[(1.0 + t), $MachinePrecision]], $MachinePrecision] - N[Sqrt[t], $MachinePrecision]), $MachinePrecision], N[(N[(x + N[(z * N[(1.0 / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[Sqrt[N[(t + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[t], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (+.f64 (+.f64 (-.f64 (sqrt.f64 (+.f64 x #s(literal 1 binary64))) (sqrt.f64 x)) (-.f64 (sqrt.f64 (+.f64 y #s(literal 1 binary64))) (sqrt.f64 y))) (-.f64 (sqrt.f64 (+.f64 z #s(literal 1 binary64))) (sqrt.f64 z))) < 0.40000000000000002

   1. Initial program 91.8%

      \[\left(\left(\left(\sqrt{x + 1} - \sqrt{x}\right) + \left(\sqrt{y + 1} - \sqrt{y}\right)\right) + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   2. Taylor expanded in y around inf

      \[\leadsto \left(\color{blue}{\left(\sqrt{1 + x} - \sqrt{x}\right)} + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   4. Applied rewrites 51.3%

      \[\leadsto \left(\color{blue}{\left(\sqrt{1 + x} - \sqrt{x}\right)} + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   6. Applied rewrites 12.0%

      \[\leadsto \left(\color{blue}{x} + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   7. Taylor expanded in z around inf

      \[\leadsto \color{blue}{\left(\sqrt{1 + t} + x \cdot y\right) - \sqrt{t}} \]

   9. Applied rewrites 9.4%

      \[\leadsto \color{blue}{\left(\sqrt{1 + t} + x \cdot y\right) - \sqrt{t}} \]

   10. Taylor expanded in x around 0

       \[\leadsto \sqrt{1 + t} - \sqrt{\color{blue}{t}} \]

   12. Applied rewrites 15.5%

       \[\leadsto \sqrt{1 + t} - \sqrt{\color{blue}{t}} \]

   if 0.40000000000000002 < (+.f64 (+.f64 (-.f64 (sqrt.f64 (+.f64 x #s(literal 1 binary64))) (sqrt.f64 x)) (-.f64 (sqrt.f64 (+.f64 y #s(literal 1 binary64))) (sqrt.f64 y))) (-.f64 (sqrt.f64 (+.f64 z #s(literal 1 binary64))) (sqrt.f64 z)))

   1. Initial program 91.8%

      \[\left(\left(\left(\sqrt{x + 1} - \sqrt{x}\right) + \left(\sqrt{y + 1} - \sqrt{y}\right)\right) + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   2. Taylor expanded in y around inf

      \[\leadsto \left(\color{blue}{\left(\sqrt{1 + x} - \sqrt{x}\right)} + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   4. Applied rewrites 51.3%

      \[\leadsto \left(\color{blue}{\left(\sqrt{1 + x} - \sqrt{x}\right)} + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   6. Applied rewrites 12.0%

      \[\leadsto \left(\color{blue}{x} + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   8. Applied rewrites 43.9%

      \[\leadsto \left(x + \color{blue}{z \cdot \frac{1}{z}}\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 13: 31.8% accurate, 0.8× speedup

Math

\[\begin{array}{l} [x, y, z, t] = \mathsf{sort}([x, y, z, t])\\ \\ \begin{array}{l} t_1 := \sqrt{1 + t}\\ \mathbf{if}\;\left(\left(\sqrt{x + 1} - \sqrt{x}\right) + \left(\sqrt{y + 1} - \sqrt{y}\right)\right) + \left(\sqrt{z + 1} - \sqrt{z}\right) \leq 0:\\ \;\;\;\;t\_1 - \sqrt{t}\\ \mathbf{else}:\\ \;\;\;\;\left(t\_1 + \sqrt{1 + x}\right) - \left(\sqrt{t} + \sqrt{x}\right)\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (sqrt (+ 1.0 t))))
   (if (<=
        (+
         (+ (- (sqrt (+ x 1.0)) (sqrt x)) (- (sqrt (+ y 1.0)) (sqrt y)))
         (- (sqrt (+ z 1.0)) (sqrt z)))
        0.0)
     (- t_1 (sqrt t))
     (- (+ t_1 (sqrt (+ 1.0 x))) (+ (sqrt t) (sqrt x))))))

C

assert(x < y && y < z && z < t);
double code(double x, double y, double z, double t) {
	double t_1 = sqrt((1.0 + t));
	double tmp;
	if ((((sqrt((x + 1.0)) - sqrt(x)) + (sqrt((y + 1.0)) - sqrt(y))) + (sqrt((z + 1.0)) - sqrt(z))) <= 0.0) {
		tmp = t_1 - sqrt(t);
	} else {
		tmp = (t_1 + sqrt((1.0 + x))) - (sqrt(t) + sqrt(x));
	}
	return tmp;
}

Fortran

NOTE: x, y, z, and t 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(x, y, z, t)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: t_1
    real(8) :: tmp
    t_1 = sqrt((1.0d0 + t))
    if ((((sqrt((x + 1.0d0)) - sqrt(x)) + (sqrt((y + 1.0d0)) - sqrt(y))) + (sqrt((z + 1.0d0)) - sqrt(z))) <= 0.0d0) then
        tmp = t_1 - sqrt(t)
    else
        tmp = (t_1 + sqrt((1.0d0 + x))) - (sqrt(t) + sqrt(x))
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t;
public static double code(double x, double y, double z, double t) {
	double t_1 = Math.sqrt((1.0 + t));
	double tmp;
	if ((((Math.sqrt((x + 1.0)) - Math.sqrt(x)) + (Math.sqrt((y + 1.0)) - Math.sqrt(y))) + (Math.sqrt((z + 1.0)) - Math.sqrt(z))) <= 0.0) {
		tmp = t_1 - Math.sqrt(t);
	} else {
		tmp = (t_1 + Math.sqrt((1.0 + x))) - (Math.sqrt(t) + Math.sqrt(x));
	}
	return tmp;
}

Python

[x, y, z, t] = sort([x, y, z, t])
def code(x, y, z, t):
	t_1 = math.sqrt((1.0 + t))
	tmp = 0
	if (((math.sqrt((x + 1.0)) - math.sqrt(x)) + (math.sqrt((y + 1.0)) - math.sqrt(y))) + (math.sqrt((z + 1.0)) - math.sqrt(z))) <= 0.0:
		tmp = t_1 - math.sqrt(t)
	else:
		tmp = (t_1 + math.sqrt((1.0 + x))) - (math.sqrt(t) + math.sqrt(x))
	return tmp

Julia

x, y, z, t = sort([x, y, z, t])
function code(x, y, z, t)
	t_1 = sqrt(Float64(1.0 + t))
	tmp = 0.0
	if (Float64(Float64(Float64(sqrt(Float64(x + 1.0)) - sqrt(x)) + Float64(sqrt(Float64(y + 1.0)) - sqrt(y))) + Float64(sqrt(Float64(z + 1.0)) - sqrt(z))) <= 0.0)
		tmp = Float64(t_1 - sqrt(t));
	else
		tmp = Float64(Float64(t_1 + sqrt(Float64(1.0 + x))) - Float64(sqrt(t) + sqrt(x)));
	end
	return tmp
end

MATLAB

x, y, z, t = num2cell(sort([x, y, z, t])){:}
function tmp_2 = code(x, y, z, t)
	t_1 = sqrt((1.0 + t));
	tmp = 0.0;
	if ((((sqrt((x + 1.0)) - sqrt(x)) + (sqrt((y + 1.0)) - sqrt(y))) + (sqrt((z + 1.0)) - sqrt(z))) <= 0.0)
		tmp = t_1 - sqrt(t);
	else
		tmp = (t_1 + sqrt((1.0 + x))) - (sqrt(t) + sqrt(x));
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_] := Block[{t$95$1 = N[Sqrt[N[(1.0 + t), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[N[(N[(N[(N[Sqrt[N[(x + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[x], $MachinePrecision]), $MachinePrecision] + N[(N[Sqrt[N[(y + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[Sqrt[N[(z + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[z], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.0], N[(t$95$1 - N[Sqrt[t], $MachinePrecision]), $MachinePrecision], N[(N[(t$95$1 + N[Sqrt[N[(1.0 + x), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] - N[(N[Sqrt[t], $MachinePrecision] + N[Sqrt[x], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (+.f64 (+.f64 (-.f64 (sqrt.f64 (+.f64 x #s(literal 1 binary64))) (sqrt.f64 x)) (-.f64 (sqrt.f64 (+.f64 y #s(literal 1 binary64))) (sqrt.f64 y))) (-.f64 (sqrt.f64 (+.f64 z #s(literal 1 binary64))) (sqrt.f64 z))) < 0.0

   1. Initial program 91.8%

      \[\left(\left(\left(\sqrt{x + 1} - \sqrt{x}\right) + \left(\sqrt{y + 1} - \sqrt{y}\right)\right) + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   2. Taylor expanded in y around inf

      \[\leadsto \left(\color{blue}{\left(\sqrt{1 + x} - \sqrt{x}\right)} + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   4. Applied rewrites 51.3%

      \[\leadsto \left(\color{blue}{\left(\sqrt{1 + x} - \sqrt{x}\right)} + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   6. Applied rewrites 12.0%

      \[\leadsto \left(\color{blue}{x} + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   7. Taylor expanded in z around inf

      \[\leadsto \color{blue}{\left(\sqrt{1 + t} + x \cdot y\right) - \sqrt{t}} \]

   9. Applied rewrites 9.4%

      \[\leadsto \color{blue}{\left(\sqrt{1 + t} + x \cdot y\right) - \sqrt{t}} \]

   10. Taylor expanded in x around 0

       \[\leadsto \sqrt{1 + t} - \sqrt{\color{blue}{t}} \]

   12. Applied rewrites 15.5%

       \[\leadsto \sqrt{1 + t} - \sqrt{\color{blue}{t}} \]

   if 0.0 < (+.f64 (+.f64 (-.f64 (sqrt.f64 (+.f64 x #s(literal 1 binary64))) (sqrt.f64 x)) (-.f64 (sqrt.f64 (+.f64 y #s(literal 1 binary64))) (sqrt.f64 y))) (-.f64 (sqrt.f64 (+.f64 z #s(literal 1 binary64))) (sqrt.f64 z)))

   1. Initial program 91.8%

      \[\left(\left(\left(\sqrt{x + 1} - \sqrt{x}\right) + \left(\sqrt{y + 1} - \sqrt{y}\right)\right) + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   2. Taylor expanded in y around inf

      \[\leadsto \color{blue}{\left(\sqrt{1 + t} + \left(\sqrt{1 + x} + \sqrt{1 + z}\right)\right) - \left(\sqrt{t} + \left(\sqrt{x} + \sqrt{z}\right)\right)} \]

   4. Applied rewrites 4.9%

      \[\leadsto \color{blue}{\left(\sqrt{1 + t} + \left(\sqrt{1 + x} + \sqrt{1 + z}\right)\right) - \left(\sqrt{t} + \left(\sqrt{x} + \sqrt{z}\right)\right)} \]

   5. Taylor expanded in z around inf

      \[\leadsto \left(\sqrt{1 + t} + \sqrt{1 + x}\right) - \color{blue}{\left(\sqrt{t} + \sqrt{x}\right)} \]

   7. Applied rewrites 27.1%

      \[\leadsto \left(\sqrt{1 + t} + \sqrt{1 + x}\right) - \color{blue}{\left(\sqrt{t} + \sqrt{x}\right)} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 14: 30.9% accurate, 0.9× speedup

Math

\[\begin{array}{l} [x, y, z, t] = \mathsf{sort}([x, y, z, t])\\ \\ \begin{array}{l} t_1 := \sqrt{1 + t}\\ \mathbf{if}\;\left(\left(\sqrt{x + 1} - \sqrt{x}\right) + \left(\sqrt{y + 1} - \sqrt{y}\right)\right) + \left(\sqrt{z + 1} - \sqrt{z}\right) \leq 0.4:\\ \;\;\;\;t\_1 - \sqrt{t}\\ \mathbf{else}:\\ \;\;\;\;\left(1 + t\_1\right) - \sqrt{t}\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (sqrt (+ 1.0 t))))
   (if (<=
        (+
         (+ (- (sqrt (+ x 1.0)) (sqrt x)) (- (sqrt (+ y 1.0)) (sqrt y)))
         (- (sqrt (+ z 1.0)) (sqrt z)))
        0.4)
     (- t_1 (sqrt t))
     (- (+ 1.0 t_1) (sqrt t)))))

C

assert(x < y && y < z && z < t);
double code(double x, double y, double z, double t) {
	double t_1 = sqrt((1.0 + t));
	double tmp;
	if ((((sqrt((x + 1.0)) - sqrt(x)) + (sqrt((y + 1.0)) - sqrt(y))) + (sqrt((z + 1.0)) - sqrt(z))) <= 0.4) {
		tmp = t_1 - sqrt(t);
	} else {
		tmp = (1.0 + t_1) - sqrt(t);
	}
	return tmp;
}

Fortran

NOTE: x, y, z, and t 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(x, y, z, t)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: t_1
    real(8) :: tmp
    t_1 = sqrt((1.0d0 + t))
    if ((((sqrt((x + 1.0d0)) - sqrt(x)) + (sqrt((y + 1.0d0)) - sqrt(y))) + (sqrt((z + 1.0d0)) - sqrt(z))) <= 0.4d0) then
        tmp = t_1 - sqrt(t)
    else
        tmp = (1.0d0 + t_1) - sqrt(t)
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t;
public static double code(double x, double y, double z, double t) {
	double t_1 = Math.sqrt((1.0 + t));
	double tmp;
	if ((((Math.sqrt((x + 1.0)) - Math.sqrt(x)) + (Math.sqrt((y + 1.0)) - Math.sqrt(y))) + (Math.sqrt((z + 1.0)) - Math.sqrt(z))) <= 0.4) {
		tmp = t_1 - Math.sqrt(t);
	} else {
		tmp = (1.0 + t_1) - Math.sqrt(t);
	}
	return tmp;
}

Python

[x, y, z, t] = sort([x, y, z, t])
def code(x, y, z, t):
	t_1 = math.sqrt((1.0 + t))
	tmp = 0
	if (((math.sqrt((x + 1.0)) - math.sqrt(x)) + (math.sqrt((y + 1.0)) - math.sqrt(y))) + (math.sqrt((z + 1.0)) - math.sqrt(z))) <= 0.4:
		tmp = t_1 - math.sqrt(t)
	else:
		tmp = (1.0 + t_1) - math.sqrt(t)
	return tmp

Julia

x, y, z, t = sort([x, y, z, t])
function code(x, y, z, t)
	t_1 = sqrt(Float64(1.0 + t))
	tmp = 0.0
	if (Float64(Float64(Float64(sqrt(Float64(x + 1.0)) - sqrt(x)) + Float64(sqrt(Float64(y + 1.0)) - sqrt(y))) + Float64(sqrt(Float64(z + 1.0)) - sqrt(z))) <= 0.4)
		tmp = Float64(t_1 - sqrt(t));
	else
		tmp = Float64(Float64(1.0 + t_1) - sqrt(t));
	end
	return tmp
end

MATLAB

x, y, z, t = num2cell(sort([x, y, z, t])){:}
function tmp_2 = code(x, y, z, t)
	t_1 = sqrt((1.0 + t));
	tmp = 0.0;
	if ((((sqrt((x + 1.0)) - sqrt(x)) + (sqrt((y + 1.0)) - sqrt(y))) + (sqrt((z + 1.0)) - sqrt(z))) <= 0.4)
		tmp = t_1 - sqrt(t);
	else
		tmp = (1.0 + t_1) - sqrt(t);
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_] := Block[{t$95$1 = N[Sqrt[N[(1.0 + t), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[N[(N[(N[(N[Sqrt[N[(x + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[x], $MachinePrecision]), $MachinePrecision] + N[(N[Sqrt[N[(y + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[Sqrt[N[(z + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[z], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.4], N[(t$95$1 - N[Sqrt[t], $MachinePrecision]), $MachinePrecision], N[(N[(1.0 + t$95$1), $MachinePrecision] - N[Sqrt[t], $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (+.f64 (+.f64 (-.f64 (sqrt.f64 (+.f64 x #s(literal 1 binary64))) (sqrt.f64 x)) (-.f64 (sqrt.f64 (+.f64 y #s(literal 1 binary64))) (sqrt.f64 y))) (-.f64 (sqrt.f64 (+.f64 z #s(literal 1 binary64))) (sqrt.f64 z))) < 0.40000000000000002

   1. Initial program 91.8%

      \[\left(\left(\left(\sqrt{x + 1} - \sqrt{x}\right) + \left(\sqrt{y + 1} - \sqrt{y}\right)\right) + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   2. Taylor expanded in y around inf

      \[\leadsto \left(\color{blue}{\left(\sqrt{1 + x} - \sqrt{x}\right)} + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   4. Applied rewrites 51.3%

      \[\leadsto \left(\color{blue}{\left(\sqrt{1 + x} - \sqrt{x}\right)} + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   6. Applied rewrites 12.0%

      \[\leadsto \left(\color{blue}{x} + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   7. Taylor expanded in z around inf

      \[\leadsto \color{blue}{\left(\sqrt{1 + t} + x \cdot y\right) - \sqrt{t}} \]

   9. Applied rewrites 9.4%

      \[\leadsto \color{blue}{\left(\sqrt{1 + t} + x \cdot y\right) - \sqrt{t}} \]

   10. Taylor expanded in x around 0

       \[\leadsto \sqrt{1 + t} - \sqrt{\color{blue}{t}} \]

   12. Applied rewrites 15.5%

       \[\leadsto \sqrt{1 + t} - \sqrt{\color{blue}{t}} \]

   if 0.40000000000000002 < (+.f64 (+.f64 (-.f64 (sqrt.f64 (+.f64 x #s(literal 1 binary64))) (sqrt.f64 x)) (-.f64 (sqrt.f64 (+.f64 y #s(literal 1 binary64))) (sqrt.f64 y))) (-.f64 (sqrt.f64 (+.f64 z #s(literal 1 binary64))) (sqrt.f64 z)))

   1. Initial program 91.8%

      \[\left(\left(\left(\sqrt{x + 1} - \sqrt{x}\right) + \left(\sqrt{y + 1} - \sqrt{y}\right)\right) + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   3. Applied rewrites 91.3%

      \[\leadsto \left(\left(\color{blue}{\frac{\left(x + 1\right) - x}{\mathsf{fma}\left(\sqrt{x + 1}, x + 1, \sqrt{x} \cdot x\right)} \cdot \left(\left(\left(x + 1\right) + x\right) - \sqrt{\mathsf{fma}\left(x, x, x\right)}\right)} + \left(\sqrt{y + 1} - \sqrt{y}\right)\right) + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   5. Applied rewrites 45.0%

      \[\leadsto \left(\color{blue}{y \cdot \frac{1}{y}} + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   6. Taylor expanded in z around inf

      \[\leadsto \color{blue}{\left(1 + \sqrt{1 + t}\right) - \sqrt{t}} \]

   8. Applied rewrites 26.3%

      \[\leadsto \color{blue}{\left(1 + \sqrt{1 + t}\right) - \sqrt{t}} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 15: 15.5% accurate, 4.5× speedup

Math

\[\begin{array}{l} [x, y, z, t] = \mathsf{sort}([x, y, z, t])\\ \\ \sqrt{1 + t} - \sqrt{t} \end{array} \]

FPCore

NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
(FPCore (x y z t) :precision binary64 (- (sqrt (+ 1.0 t)) (sqrt t)))

C

assert(x < y && y < z && z < t);
double code(double x, double y, double z, double t) {
	return sqrt((1.0 + t)) - sqrt(t);
}

Fortran

NOTE: x, y, z, and t 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(x, y, z, t)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    code = sqrt((1.0d0 + t)) - sqrt(t)
end function

Java

assert x < y && y < z && z < t;
public static double code(double x, double y, double z, double t) {
	return Math.sqrt((1.0 + t)) - Math.sqrt(t);
}

Python

[x, y, z, t] = sort([x, y, z, t])
def code(x, y, z, t):
	return math.sqrt((1.0 + t)) - math.sqrt(t)

Julia

x, y, z, t = sort([x, y, z, t])
function code(x, y, z, t)
	return Float64(sqrt(Float64(1.0 + t)) - sqrt(t))
end

MATLAB

x, y, z, t = num2cell(sort([x, y, z, t])){:}
function tmp = code(x, y, z, t)
	tmp = sqrt((1.0 + t)) - sqrt(t);
end

Wolfram

NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_] := N[(N[Sqrt[N[(1.0 + t), $MachinePrecision]], $MachinePrecision] - N[Sqrt[t], $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 91.8%

   \[\left(\left(\left(\sqrt{x + 1} - \sqrt{x}\right) + \left(\sqrt{y + 1} - \sqrt{y}\right)\right) + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

2. Taylor expanded in y around inf

   \[\leadsto \left(\color{blue}{\left(\sqrt{1 + x} - \sqrt{x}\right)} + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

4. Applied rewrites 51.3%

   \[\leadsto \left(\color{blue}{\left(\sqrt{1 + x} - \sqrt{x}\right)} + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

6. Applied rewrites 12.0%

   \[\leadsto \left(\color{blue}{x} + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

7. Taylor expanded in z around inf

   \[\leadsto \color{blue}{\left(\sqrt{1 + t} + x \cdot y\right) - \sqrt{t}} \]

9. Applied rewrites 9.4%

   \[\leadsto \color{blue}{\left(\sqrt{1 + t} + x \cdot y\right) - \sqrt{t}} \]

10. Taylor expanded in x around 0

    \[\leadsto \sqrt{1 + t} - \sqrt{\color{blue}{t}} \]

12. Applied rewrites 15.5%

    \[\leadsto \sqrt{1 + t} - \sqrt{\color{blue}{t}} \]
13. Add Preprocessing

Alternative 16: 7.9% accurate, 4.3× speedup

Math

\[\begin{array}{l} [x, y, z, t] = \mathsf{sort}([x, y, z, t])\\ \\ \begin{array}{l} \mathbf{if}\;z \leq 6.5 \cdot 10^{+91}:\\ \;\;\;\;\left(x + z\right) + 1\\ \mathbf{else}:\\ \;\;\;\;\left(z - y\right) \cdot x\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
(FPCore (x y z t)
 :precision binary64
 (if (<= z 6.5e+91) (+ (+ x z) 1.0) (* (- z y) x)))

C

assert(x < y && y < z && z < t);
double code(double x, double y, double z, double t) {
	double tmp;
	if (z <= 6.5e+91) {
		tmp = (x + z) + 1.0;
	} else {
		tmp = (z - y) * x;
	}
	return tmp;
}

Fortran

NOTE: x, y, z, and t 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(x, y, z, t)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: tmp
    if (z <= 6.5d+91) then
        tmp = (x + z) + 1.0d0
    else
        tmp = (z - y) * x
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t;
public static double code(double x, double y, double z, double t) {
	double tmp;
	if (z <= 6.5e+91) {
		tmp = (x + z) + 1.0;
	} else {
		tmp = (z - y) * x;
	}
	return tmp;
}

Python

[x, y, z, t] = sort([x, y, z, t])
def code(x, y, z, t):
	tmp = 0
	if z <= 6.5e+91:
		tmp = (x + z) + 1.0
	else:
		tmp = (z - y) * x
	return tmp

Julia

x, y, z, t = sort([x, y, z, t])
function code(x, y, z, t)
	tmp = 0.0
	if (z <= 6.5e+91)
		tmp = Float64(Float64(x + z) + 1.0);
	else
		tmp = Float64(Float64(z - y) * x);
	end
	return tmp
end

MATLAB

x, y, z, t = num2cell(sort([x, y, z, t])){:}
function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if (z <= 6.5e+91)
		tmp = (x + z) + 1.0;
	else
		tmp = (z - y) * x;
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_] := If[LessEqual[z, 6.5e+91], N[(N[(x + z), $MachinePrecision] + 1.0), $MachinePrecision], N[(N[(z - y), $MachinePrecision] * x), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < 6.4999999999999997e91

   1. Initial program 91.8%

      \[\left(\left(\left(\sqrt{x + 1} - \sqrt{x}\right) + \left(\sqrt{y + 1} - \sqrt{y}\right)\right) + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   2. Taylor expanded in y around inf

      \[\leadsto \left(\color{blue}{\left(\sqrt{1 + x} - \sqrt{x}\right)} + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   4. Applied rewrites 51.3%

      \[\leadsto \left(\color{blue}{\left(\sqrt{1 + x} - \sqrt{x}\right)} + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   6. Applied rewrites 6.3%

      \[\leadsto \color{blue}{\left(x + z\right) + 1} \]

   if 6.4999999999999997e91 < z

   1. Initial program 91.8%

      \[\left(\left(\left(\sqrt{x + 1} - \sqrt{x}\right) + \left(\sqrt{y + 1} - \sqrt{y}\right)\right) + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

   3. Applied rewrites 91.7%

      \[\leadsto \left(\left(\left(\sqrt{x + 1} - \sqrt{x}\right) + \left(\sqrt{y + 1} - \sqrt{y}\right)\right) + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \color{blue}{\left({\left(t + 1\right)}^{\left(\frac{0.5}{2}\right)} + {t}^{\left(\frac{0.5}{2}\right)}\right) \cdot \left({\left(t + 1\right)}^{\left(\frac{0.5}{2}\right)} - {t}^{\left(\frac{0.5}{2}\right)}\right)} \]

   5. Applied rewrites 5.8%

      \[\leadsto \color{blue}{\left(z - y\right) \cdot x} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 17: 6.3% accurate, 6.9× speedup

Math

\[\begin{array}{l} [x, y, z, t] = \mathsf{sort}([x, y, z, t])\\ \\ \left(x + z\right) + 1 \end{array} \]

FPCore

NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
(FPCore (x y z t) :precision binary64 (+ (+ x z) 1.0))

C

assert(x < y && y < z && z < t);
double code(double x, double y, double z, double t) {
	return (x + z) + 1.0;
}

Fortran

NOTE: x, y, z, and t 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(x, y, z, t)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    code = (x + z) + 1.0d0
end function

Java

assert x < y && y < z && z < t;
public static double code(double x, double y, double z, double t) {
	return (x + z) + 1.0;
}

Python

[x, y, z, t] = sort([x, y, z, t])
def code(x, y, z, t):
	return (x + z) + 1.0

Julia

x, y, z, t = sort([x, y, z, t])
function code(x, y, z, t)
	return Float64(Float64(x + z) + 1.0)
end

MATLAB

x, y, z, t = num2cell(sort([x, y, z, t])){:}
function tmp = code(x, y, z, t)
	tmp = (x + z) + 1.0;
end

Wolfram

NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_] := N[(N[(x + z), $MachinePrecision] + 1.0), $MachinePrecision]

Derivation

1. Initial program 91.8%

   \[\left(\left(\left(\sqrt{x + 1} - \sqrt{x}\right) + \left(\sqrt{y + 1} - \sqrt{y}\right)\right) + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

2. Taylor expanded in y around inf

   \[\leadsto \left(\color{blue}{\left(\sqrt{1 + x} - \sqrt{x}\right)} + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

4. Applied rewrites 51.3%

   \[\leadsto \left(\color{blue}{\left(\sqrt{1 + x} - \sqrt{x}\right)} + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

6. Applied rewrites 6.3%

   \[\leadsto \color{blue}{\left(x + z\right) + 1} \]
7. Add Preprocessing

Alternative 18: 5.2% accurate, 6.9× speedup

Math

\[\begin{array}{l} [x, y, z, t] = \mathsf{sort}([x, y, z, t])\\ \\ \left(1 + z\right) + t \end{array} \]

FPCore

NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
(FPCore (x y z t) :precision binary64 (+ (+ 1.0 z) t))

C

assert(x < y && y < z && z < t);
double code(double x, double y, double z, double t) {
	return (1.0 + z) + t;
}

Fortran

NOTE: x, y, z, and t 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(x, y, z, t)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    code = (1.0d0 + z) + t
end function

Java

assert x < y && y < z && z < t;
public static double code(double x, double y, double z, double t) {
	return (1.0 + z) + t;
}

Python

[x, y, z, t] = sort([x, y, z, t])
def code(x, y, z, t):
	return (1.0 + z) + t

Julia

x, y, z, t = sort([x, y, z, t])
function code(x, y, z, t)
	return Float64(Float64(1.0 + z) + t)
end

MATLAB

x, y, z, t = num2cell(sort([x, y, z, t])){:}
function tmp = code(x, y, z, t)
	tmp = (1.0 + z) + t;
end

Wolfram

NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_] := N[(N[(1.0 + z), $MachinePrecision] + t), $MachinePrecision]

Derivation

1. Initial program 91.8%

   \[\left(\left(\left(\sqrt{x + 1} - \sqrt{x}\right) + \left(\sqrt{y + 1} - \sqrt{y}\right)\right) + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

2. Taylor expanded in y around inf

   \[\leadsto \left(\color{blue}{\left(\sqrt{1 + x} - \sqrt{x}\right)} + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

4. Applied rewrites 51.3%

   \[\leadsto \left(\color{blue}{\left(\sqrt{1 + x} - \sqrt{x}\right)} + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

6. Applied rewrites 12.0%

   \[\leadsto \left(\color{blue}{x} + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

8. Applied rewrites 5.2%

   \[\leadsto \color{blue}{\left(1 + z\right) + t} \]
9. Add Preprocessing

Alternative 19: 5.0% accurate, 12.4× speedup

Math

\[\begin{array}{l} [x, y, z, t] = \mathsf{sort}([x, y, z, t])\\ \\ z - y \end{array} \]

FPCore

NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
(FPCore (x y z t) :precision binary64 (- z y))

C

assert(x < y && y < z && z < t);
double code(double x, double y, double z, double t) {
	return z - y;
}

Fortran

NOTE: x, y, z, and t 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(x, y, z, t)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    code = z - y
end function

Java

assert x < y && y < z && z < t;
public static double code(double x, double y, double z, double t) {
	return z - y;
}

Python

[x, y, z, t] = sort([x, y, z, t])
def code(x, y, z, t):
	return z - y

Julia

x, y, z, t = sort([x, y, z, t])
function code(x, y, z, t)
	return Float64(z - y)
end

MATLAB

x, y, z, t = num2cell(sort([x, y, z, t])){:}
function tmp = code(x, y, z, t)
	tmp = z - y;
end

Wolfram

NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_] := N[(z - y), $MachinePrecision]

Derivation

1. Initial program 91.8%

   \[\left(\left(\left(\sqrt{x + 1} - \sqrt{x}\right) + \left(\sqrt{y + 1} - \sqrt{y}\right)\right) + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

2. Taylor expanded in x around inf

   \[\leadsto \color{blue}{\left(\sqrt{1 + t} + \left(\sqrt{1 + y} + \sqrt{1 + z}\right)\right) - \left(\sqrt{t} + \left(\sqrt{y} + \sqrt{z}\right)\right)} \]

4. Applied rewrites 4.8%

   \[\leadsto \color{blue}{\left(\sqrt{1 + t} + \left(\sqrt{1 + y} + \sqrt{1 + z}\right)\right) - \left(\sqrt{t} + \left(\sqrt{y} + \sqrt{z}\right)\right)} \]

6. Applied rewrites 5.0%

   \[\leadsto \color{blue}{z - y} \]
7. Add Preprocessing

Alternative 20: 5.0% accurate, 44.8× speedup

Math

\[\begin{array}{l} [x, y, z, t] = \mathsf{sort}([x, y, z, t])\\ \\ z \end{array} \]

FPCore

NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
(FPCore (x y z t) :precision binary64 z)

C

assert(x < y && y < z && z < t);
double code(double x, double y, double z, double t) {
	return z;
}

Fortran

NOTE: x, y, z, and t 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(x, y, z, t)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    code = z
end function

Java

assert x < y && y < z && z < t;
public static double code(double x, double y, double z, double t) {
	return z;
}

Python

[x, y, z, t] = sort([x, y, z, t])
def code(x, y, z, t):
	return z

Julia

x, y, z, t = sort([x, y, z, t])
function code(x, y, z, t)
	return z
end

MATLAB

x, y, z, t = num2cell(sort([x, y, z, t])){:}
function tmp = code(x, y, z, t)
	tmp = z;
end

Wolfram

NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_] := z

Derivation

1. Initial program 91.8%

   \[\left(\left(\left(\sqrt{x + 1} - \sqrt{x}\right) + \left(\sqrt{y + 1} - \sqrt{y}\right)\right) + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right) \]

2. Taylor expanded in x around inf

   \[\leadsto \color{blue}{\left(\sqrt{1 + t} + \left(\sqrt{1 + y} + \sqrt{1 + z}\right)\right) - \left(\sqrt{t} + \left(\sqrt{y} + \sqrt{z}\right)\right)} \]

4. Applied rewrites 4.8%

   \[\leadsto \color{blue}{\left(\sqrt{1 + t} + \left(\sqrt{1 + y} + \sqrt{1 + z}\right)\right) - \left(\sqrt{t} + \left(\sqrt{y} + \sqrt{z}\right)\right)} \]

6. Applied rewrites 5.0%

   \[\leadsto \color{blue}{z - y} \]

7. Taylor expanded in y around 0

   \[\leadsto z \]

9. Applied rewrites 5.0%

   \[\leadsto z \]
10. Add Preprocessing

Reproduce

herbie shell --seed 2025159 
(FPCore (x y z t)
  :name "Main:z from "
  :precision binary64
  (+ (+ (+ (- (sqrt (+ x 1.0)) (sqrt x)) (- (sqrt (+ y 1.0)) (sqrt y))) (- (sqrt (+ z 1.0)) (sqrt z))) (- (sqrt (+ t 1.0)) (sqrt t))))