Data.Random.Distribution.Triangular:triangularCDF from random-fu-0.2.6.2, B

Percentage Accurate: 89.2% → 98.7%

Time: 3.2s

Alternatives: 6

Speedup: N/A×

Specification

Math

\[\begin{array}{l} \\ \frac{x}{\left(y - z\right) \cdot \left(t - z\right)} \end{array} \]

FPCore

(FPCore (x y z t) :precision binary64 (/ x (* (- y z) (- t z))))

C

double code(double x, double y, double z, double t) {
	return x / ((y - z) * (t - z));
}

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 = x / ((y - z) * (t - z))
end function

Java

public static double code(double x, double y, double z, double t) {
	return x / ((y - z) * (t - z));
}

Python

def code(x, y, z, t):
	return x / ((y - z) * (t - z))

Julia

function code(x, y, z, t)
	return Float64(x / Float64(Float64(y - z) * Float64(t - z)))
end

MATLAB

function tmp = code(x, y, z, t)
	tmp = x / ((y - z) * (t - z));
end

Wolfram

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

Initial Program: 89.2% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{x}{\left(y - z\right) \cdot \left(t - z\right)} \end{array} \]

FPCore

(FPCore (x y z t) :precision binary64 (/ x (* (- y z) (- t z))))

C

double code(double x, double y, double z, double t) {
	return x / ((y - z) * (t - z));
}

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 = x / ((y - z) * (t - z))
end function

Java

public static double code(double x, double y, double z, double t) {
	return x / ((y - z) * (t - z));
}

Python

def code(x, y, z, t):
	return x / ((y - z) * (t - z))

Julia

function code(x, y, z, t)
	return Float64(x / Float64(Float64(y - z) * Float64(t - z)))
end

MATLAB

function tmp = code(x, y, z, t)
	tmp = x / ((y - z) * (t - z));
end

Wolfram

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

Alternative 1: 98.7% accurate, N/A× speedup

Math

\[\begin{array}{l} [x, y, z, t] = \mathsf{sort}([x, y, z, t])\\ \\ \begin{array}{l} t_1 := \left(y - z\right) \cdot \left(t - z\right)\\ t_2 := \frac{\frac{x}{t - z}}{y - z}\\ \mathbf{if}\;t\_1 \leq -2 \cdot 10^{+246}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;t\_1 \leq 5 \cdot 10^{+194}:\\ \;\;\;\;\frac{x}{t\_1}\\ \mathbf{else}:\\ \;\;\;\;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 (* (- y z) (- t z))) (t_2 (/ (/ x (- t z)) (- y z))))
   (if (<= t_1 -2e+246) t_2 (if (<= t_1 5e+194) (/ x 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 = (y - z) * (t - z);
	double t_2 = (x / (t - z)) / (y - z);
	double tmp;
	if (t_1 <= -2e+246) {
		tmp = t_2;
	} else if (t_1 <= 5e+194) {
		tmp = x / t_1;
	} else {
		tmp = 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 = (y - z) * (t - z)
    t_2 = (x / (t - z)) / (y - z)
    if (t_1 <= (-2d+246)) then
        tmp = t_2
    else if (t_1 <= 5d+194) then
        tmp = x / t_1
    else
        tmp = 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 = (y - z) * (t - z);
	double t_2 = (x / (t - z)) / (y - z);
	double tmp;
	if (t_1 <= -2e+246) {
		tmp = t_2;
	} else if (t_1 <= 5e+194) {
		tmp = x / t_1;
	} else {
		tmp = t_2;
	}
	return tmp;
}

Python

[x, y, z, t] = sort([x, y, z, t])
def code(x, y, z, t):
	t_1 = (y - z) * (t - z)
	t_2 = (x / (t - z)) / (y - z)
	tmp = 0
	if t_1 <= -2e+246:
		tmp = t_2
	elif t_1 <= 5e+194:
		tmp = x / t_1
	else:
		tmp = t_2
	return tmp

Julia

x, y, z, t = sort([x, y, z, t])
function code(x, y, z, t)
	t_1 = Float64(Float64(y - z) * Float64(t - z))
	t_2 = Float64(Float64(x / Float64(t - z)) / Float64(y - z))
	tmp = 0.0
	if (t_1 <= -2e+246)
		tmp = t_2;
	elseif (t_1 <= 5e+194)
		tmp = Float64(x / t_1);
	else
		tmp = 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 = (y - z) * (t - z);
	t_2 = (x / (t - z)) / (y - z);
	tmp = 0.0;
	if (t_1 <= -2e+246)
		tmp = t_2;
	elseif (t_1 <= 5e+194)
		tmp = x / t_1;
	else
		tmp = 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[(y - z), $MachinePrecision] * N[(t - z), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(x / N[(t - z), $MachinePrecision]), $MachinePrecision] / N[(y - z), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -2e+246], t$95$2, If[LessEqual[t$95$1, 5e+194], N[(x / t$95$1), $MachinePrecision], t$95$2]]]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (-.f64 y z) (-.f64 t z)) < -2.00000000000000014e246 or 4.99999999999999989e194 < (*.f64 (-.f64 y z) (-.f64 t z))

   1. Initial program 81.3%

      \[\frac{x}{\left(y - z\right) \cdot \left(t - z\right)} \]
   2. Step-by-step derivation

      1. lift-/.f64 N/A

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

      2. lift--.f64 N/A

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

      3. lift--.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. *-commutative N/A

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

      6. associate-/r* N/A

         \[\leadsto \color{blue}{\frac{\frac{x}{t - z}}{y - z}} \]

      7. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{\frac{x}{t - z}}{y - z}} \]

      8. lower-/.f64 N/A

         \[\leadsto \frac{\color{blue}{\frac{x}{t - z}}}{y - z} \]

      9. lift--.f64 N/A

         \[\leadsto \frac{\frac{x}{\color{blue}{t - z}}}{y - z} \]

      10. lift--.f64 99.6

          \[\leadsto \frac{\frac{x}{t - z}}{\color{blue}{y - z}} \]

   3. Applied rewrites 99.6%

      \[\leadsto \color{blue}{\frac{\frac{x}{t - z}}{y - z}} \]

   if -2.00000000000000014e246 < (*.f64 (-.f64 y z) (-.f64 t z)) < 4.99999999999999989e194

   1. Initial program 97.6%

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

Alternative 2: 96.9% accurate, N/A× speedup

Math

\[\begin{array}{l} [x, y, z, t] = \mathsf{sort}([x, y, z, t])\\ \\ \frac{\frac{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 (/ (/ x (- y z)) (- t z)))

C

assert(x < y && y < z && z < t);
double code(double x, double y, double z, double t) {
	return (x / (y - z)) / (t - 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 = (x / (y - z)) / (t - z)
end function

Java

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

Python

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

Julia

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

MATLAB

x, y, z, t = num2cell(sort([x, y, z, t])){:}
function tmp = code(x, y, z, t)
	tmp = (x / (y - z)) / (t - z);
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 / N[(y - z), $MachinePrecision]), $MachinePrecision] / N[(t - z), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 89.2%

   \[\frac{x}{\left(y - z\right) \cdot \left(t - z\right)} \]
2. Step-by-step derivation

   1. lift-/.f64 N/A

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

   2. lift--.f64 N/A

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

   3. lift--.f64 N/A

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

   4. lift-*.f64 N/A

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

   5. associate-/r* N/A

      \[\leadsto \color{blue}{\frac{\frac{x}{y - z}}{t - z}} \]

   6. lower-/.f64 N/A

      \[\leadsto \color{blue}{\frac{\frac{x}{y - z}}{t - z}} \]

   7. lower-/.f64 N/A

      \[\leadsto \frac{\color{blue}{\frac{x}{y - z}}}{t - z} \]

   8. lift--.f64 N/A

      \[\leadsto \frac{\frac{x}{\color{blue}{y - z}}}{t - z} \]

   9. lift--.f64 96.9

      \[\leadsto \frac{\frac{x}{y - z}}{\color{blue}{t - z}} \]

3. Applied rewrites 96.9%

   \[\leadsto \color{blue}{\frac{\frac{x}{y - z}}{t - z}} \]
4. Add Preprocessing

Alternative 3: 89.2% accurate, N/A× speedup

Math

\[\begin{array}{l} [x, y, z, t] = \mathsf{sort}([x, y, z, t])\\ \\ \begin{array}{l} \mathbf{if}\;t \leq 1.06 \cdot 10^{+259}:\\ \;\;\;\;\frac{x}{\left(y - z\right) \cdot \left(t - z\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{t} \cdot \frac{y + z}{\left(y + z\right) \cdot \left(y - 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
 (if (<= t 1.06e+259)
   (/ x (* (- y z) (- t z)))
   (* (/ x t) (/ (+ y z) (* (+ y z) (- y z))))))

C

assert(x < y && y < z && z < t);
double code(double x, double y, double z, double t) {
	double tmp;
	if (t <= 1.06e+259) {
		tmp = x / ((y - z) * (t - z));
	} else {
		tmp = (x / t) * ((y + z) / ((y + z) * (y - 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) :: tmp
    if (t <= 1.06d+259) then
        tmp = x / ((y - z) * (t - z))
    else
        tmp = (x / t) * ((y + z) / ((y + z) * (y - 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 tmp;
	if (t <= 1.06e+259) {
		tmp = x / ((y - z) * (t - z));
	} else {
		tmp = (x / t) * ((y + z) / ((y + z) * (y - z)));
	}
	return tmp;
}

Python

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

Julia

x, y, z, t = sort([x, y, z, t])
function code(x, y, z, t)
	tmp = 0.0
	if (t <= 1.06e+259)
		tmp = Float64(x / Float64(Float64(y - z) * Float64(t - z)));
	else
		tmp = Float64(Float64(x / t) * Float64(Float64(y + z) / Float64(Float64(y + z) * Float64(y - z))));
	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 (t <= 1.06e+259)
		tmp = x / ((y - z) * (t - z));
	else
		tmp = (x / t) * ((y + z) / ((y + z) * (y - 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_] := If[LessEqual[t, 1.06e+259], N[(x / N[(N[(y - z), $MachinePrecision] * N[(t - z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(x / t), $MachinePrecision] * N[(N[(y + z), $MachinePrecision] / N[(N[(y + z), $MachinePrecision] * N[(y - z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if t < 1.06000000000000001e259

   1. Initial program 89.5%

      \[\frac{x}{\left(y - z\right) \cdot \left(t - z\right)} \]

   if 1.06000000000000001e259 < t

   1. Initial program 85.9%

      \[\frac{x}{\left(y - z\right) \cdot \left(t - z\right)} \]
   2. Step-by-step derivation

      1. lift--.f64 N/A

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

      2. lift--.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. *-commutative N/A

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

      5. flip3-- N/A

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

      6. flip-- N/A

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

      7. frac-times N/A

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

      8. lower-/.f64 N/A

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

   3. Applied rewrites 0.0%

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

   4. Taylor expanded in t around inf

      \[\leadsto \color{blue}{\frac{x \cdot \left(y + z\right)}{t \cdot \left({y}^{2} - {z}^{2}\right)}} \]
   5. Step-by-step derivation

      1. times-frac N/A

         \[\leadsto \frac{x}{t} \cdot \color{blue}{\frac{y + z}{{y}^{2} - {z}^{2}}} \]

      2. lower-*.f64 N/A

         \[\leadsto \frac{x}{t} \cdot \color{blue}{\frac{y + z}{{y}^{2} - {z}^{2}}} \]

      3. lower-/.f64 N/A

         \[\leadsto \frac{x}{t} \cdot \frac{\color{blue}{y + z}}{{y}^{2} - {z}^{2}} \]

      4. lower-/.f64 N/A

         \[\leadsto \frac{x}{t} \cdot \frac{y + z}{\color{blue}{{y}^{2} - {z}^{2}}} \]

      5. lift-+.f64 N/A

         \[\leadsto \frac{x}{t} \cdot \frac{y + z}{\color{blue}{{y}^{2}} - {z}^{2}} \]

      6. pow2 N/A

         \[\leadsto \frac{x}{t} \cdot \frac{y + z}{y \cdot y - {\color{blue}{z}}^{2}} \]

      7. pow2 N/A

         \[\leadsto \frac{x}{t} \cdot \frac{y + z}{y \cdot y - z \cdot \color{blue}{z}} \]

      8. difference-of-squares N/A

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

      9. lower-*.f64 N/A

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

      10. lift-+.f64 N/A

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

      11. lift--.f64 85.8

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

   6. Applied rewrites 85.8%

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

Alternative 4: 88.5% accurate, N/A× speedup

Math

\[\begin{array}{l} [x, y, z, t] = \mathsf{sort}([x, y, z, t])\\ \\ \begin{array}{l} t_1 := \left(y - z\right) \cdot \left(t - z\right)\\ t_2 := \frac{x}{t} \cdot \frac{y + z}{\left(y + z\right) \cdot \left(y - z\right)}\\ \mathbf{if}\;t\_1 \leq -\infty:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;t\_1 \leq 10^{+304}:\\ \;\;\;\;\frac{x}{\mathsf{fma}\left(\left(t - z\right) \cdot z, -1, \left(t - z\right) \cdot y\right)}\\ \mathbf{else}:\\ \;\;\;\;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 (* (- y z) (- t z)))
        (t_2 (* (/ x t) (/ (+ y z) (* (+ y z) (- y z))))))
   (if (<= t_1 (- INFINITY))
     t_2
     (if (<= t_1 1e+304) (/ x (fma (* (- t z) z) -1.0 (* (- t z) y))) t_2))))

C

assert(x < y && y < z && z < t);
double code(double x, double y, double z, double t) {
	double t_1 = (y - z) * (t - z);
	double t_2 = (x / t) * ((y + z) / ((y + z) * (y - z)));
	double tmp;
	if (t_1 <= -((double) INFINITY)) {
		tmp = t_2;
	} else if (t_1 <= 1e+304) {
		tmp = x / fma(((t - z) * z), -1.0, ((t - z) * y));
	} else {
		tmp = t_2;
	}
	return tmp;
}

Julia

x, y, z, t = sort([x, y, z, t])
function code(x, y, z, t)
	t_1 = Float64(Float64(y - z) * Float64(t - z))
	t_2 = Float64(Float64(x / t) * Float64(Float64(y + z) / Float64(Float64(y + z) * Float64(y - z))))
	tmp = 0.0
	if (t_1 <= Float64(-Inf))
		tmp = t_2;
	elseif (t_1 <= 1e+304)
		tmp = Float64(x / fma(Float64(Float64(t - z) * z), -1.0, Float64(Float64(t - z) * y)));
	else
		tmp = t_2;
	end
	return 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[(y - z), $MachinePrecision] * N[(t - z), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(x / t), $MachinePrecision] * N[(N[(y + z), $MachinePrecision] / N[(N[(y + z), $MachinePrecision] * N[(y - z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, (-Infinity)], t$95$2, If[LessEqual[t$95$1, 1e+304], N[(x / N[(N[(N[(t - z), $MachinePrecision] * z), $MachinePrecision] * -1.0 + N[(N[(t - z), $MachinePrecision] * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$2]]]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (-.f64 y z) (-.f64 t z)) < -inf.0 or 9.9999999999999994e303 < (*.f64 (-.f64 y z) (-.f64 t z))

   1. Initial program 74.4%

      \[\frac{x}{\left(y - z\right) \cdot \left(t - z\right)} \]
   2. Step-by-step derivation

      1. lift--.f64 N/A

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

      2. lift--.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. *-commutative N/A

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

      5. flip3-- N/A

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

      6. flip-- N/A

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

      7. frac-times N/A

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

      8. lower-/.f64 N/A

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

   3. Applied rewrites 0.0%

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

   4. Taylor expanded in t around inf

      \[\leadsto \color{blue}{\frac{x \cdot \left(y + z\right)}{t \cdot \left({y}^{2} - {z}^{2}\right)}} \]
   5. Step-by-step derivation

      1. times-frac N/A

         \[\leadsto \frac{x}{t} \cdot \color{blue}{\frac{y + z}{{y}^{2} - {z}^{2}}} \]

      2. lower-*.f64 N/A

         \[\leadsto \frac{x}{t} \cdot \color{blue}{\frac{y + z}{{y}^{2} - {z}^{2}}} \]

      3. lower-/.f64 N/A

         \[\leadsto \frac{x}{t} \cdot \frac{\color{blue}{y + z}}{{y}^{2} - {z}^{2}} \]

      4. lower-/.f64 N/A

         \[\leadsto \frac{x}{t} \cdot \frac{y + z}{\color{blue}{{y}^{2} - {z}^{2}}} \]

      5. lift-+.f64 N/A

         \[\leadsto \frac{x}{t} \cdot \frac{y + z}{\color{blue}{{y}^{2}} - {z}^{2}} \]

      6. pow2 N/A

         \[\leadsto \frac{x}{t} \cdot \frac{y + z}{y \cdot y - {\color{blue}{z}}^{2}} \]

      7. pow2 N/A

         \[\leadsto \frac{x}{t} \cdot \frac{y + z}{y \cdot y - z \cdot \color{blue}{z}} \]

      8. difference-of-squares N/A

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

      9. lower-*.f64 N/A

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

      10. lift-+.f64 N/A

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

      11. lift--.f64 73.5

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

   6. Applied rewrites 73.5%

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

   if -inf.0 < (*.f64 (-.f64 y z) (-.f64 t z)) < 9.9999999999999994e303

   1. Initial program 98.1%

      \[\frac{x}{\left(y - z\right) \cdot \left(t - z\right)} \]

   2. Taylor expanded in y around 0

      \[\leadsto \frac{x}{\color{blue}{-1 \cdot \left(z \cdot \left(t - z\right)\right) + y \cdot \left(t - z\right)}} \]
   3. Step-by-step derivation

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lift--.f64 N/A

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

      6. *-commutative N/A

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

      7. lower-*.f64 N/A

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

      8. lift--.f64 97.5

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

   4. Applied rewrites 97.5%

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

Alternative 5: 70.4% accurate, N/A× speedup

Math

\[\begin{array}{l} [x, y, z, t] = \mathsf{sort}([x, y, z, t])\\ \\ \begin{array}{l} t_1 := \frac{y + z}{\left(y + z\right) \cdot \left(y - z\right)}\\ \mathbf{if}\;t \leq 5.2 \cdot 10^{-30}:\\ \;\;\;\;-1 \cdot \left(\frac{x}{z} \cdot t\_1\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{t} \cdot 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 (/ (+ y z) (* (+ y z) (- y z)))))
   (if (<= t 5.2e-30) (* -1.0 (* (/ x z) t_1)) (* (/ x t) t_1))))

C

assert(x < y && y < z && z < t);
double code(double x, double y, double z, double t) {
	double t_1 = (y + z) / ((y + z) * (y - z));
	double tmp;
	if (t <= 5.2e-30) {
		tmp = -1.0 * ((x / z) * t_1);
	} else {
		tmp = (x / t) * 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 = (y + z) / ((y + z) * (y - z))
    if (t <= 5.2d-30) then
        tmp = (-1.0d0) * ((x / z) * t_1)
    else
        tmp = (x / t) * 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 = (y + z) / ((y + z) * (y - z));
	double tmp;
	if (t <= 5.2e-30) {
		tmp = -1.0 * ((x / z) * t_1);
	} else {
		tmp = (x / t) * t_1;
	}
	return tmp;
}

Python

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

Julia

x, y, z, t = sort([x, y, z, t])
function code(x, y, z, t)
	t_1 = Float64(Float64(y + z) / Float64(Float64(y + z) * Float64(y - z)))
	tmp = 0.0
	if (t <= 5.2e-30)
		tmp = Float64(-1.0 * Float64(Float64(x / z) * t_1));
	else
		tmp = Float64(Float64(x / t) * 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 = (y + z) / ((y + z) * (y - z));
	tmp = 0.0;
	if (t <= 5.2e-30)
		tmp = -1.0 * ((x / z) * t_1);
	else
		tmp = (x / t) * 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[(y + z), $MachinePrecision] / N[(N[(y + z), $MachinePrecision] * N[(y - z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t, 5.2e-30], N[(-1.0 * N[(N[(x / z), $MachinePrecision] * t$95$1), $MachinePrecision]), $MachinePrecision], N[(N[(x / t), $MachinePrecision] * t$95$1), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if t < 5.19999999999999973e-30

   1. Initial program 89.4%

      \[\frac{x}{\left(y - z\right) \cdot \left(t - z\right)} \]
   2. Step-by-step derivation

      1. lift--.f64 N/A

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

      2. lift--.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. *-commutative N/A

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

      5. flip3-- N/A

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

      6. flip-- N/A

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

      7. frac-times N/A

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

      8. lower-/.f64 N/A

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

   3. Applied rewrites 24.6%

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

   4. Taylor expanded in t around 0

      \[\leadsto \color{blue}{-1 \cdot \frac{x \cdot \left(y + z\right)}{z \cdot \left({y}^{2} - {z}^{2}\right)}} \]
   5. Step-by-step derivation

      1. lower-*.f64 N/A

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

      2. times-frac N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lift-+.f64 N/A

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

      7. pow2 N/A

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

      8. pow2 N/A

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

      9. difference-of-squares N/A

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

      10. lower-*.f64 N/A

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

      11. lift-+.f64 N/A

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

      12. lift--.f64 64.6

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

   6. Applied rewrites 64.6%

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

   if 5.19999999999999973e-30 < t

   1. Initial program 89.0%

      \[\frac{x}{\left(y - z\right) \cdot \left(t - z\right)} \]
   2. Step-by-step derivation

      1. lift--.f64 N/A

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

      2. lift--.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. *-commutative N/A

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

      5. flip3-- N/A

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

      6. flip-- N/A

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

      7. frac-times N/A

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

      8. lower-/.f64 N/A

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

   3. Applied rewrites 15.5%

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

   4. Taylor expanded in t around inf

      \[\leadsto \color{blue}{\frac{x \cdot \left(y + z\right)}{t \cdot \left({y}^{2} - {z}^{2}\right)}} \]
   5. Step-by-step derivation

      1. times-frac N/A

         \[\leadsto \frac{x}{t} \cdot \color{blue}{\frac{y + z}{{y}^{2} - {z}^{2}}} \]

      2. lower-*.f64 N/A

         \[\leadsto \frac{x}{t} \cdot \color{blue}{\frac{y + z}{{y}^{2} - {z}^{2}}} \]

      3. lower-/.f64 N/A

         \[\leadsto \frac{x}{t} \cdot \frac{\color{blue}{y + z}}{{y}^{2} - {z}^{2}} \]

      4. lower-/.f64 N/A

         \[\leadsto \frac{x}{t} \cdot \frac{y + z}{\color{blue}{{y}^{2} - {z}^{2}}} \]

      5. lift-+.f64 N/A

         \[\leadsto \frac{x}{t} \cdot \frac{y + z}{\color{blue}{{y}^{2}} - {z}^{2}} \]

      6. pow2 N/A

         \[\leadsto \frac{x}{t} \cdot \frac{y + z}{y \cdot y - {\color{blue}{z}}^{2}} \]

      7. pow2 N/A

         \[\leadsto \frac{x}{t} \cdot \frac{y + z}{y \cdot y - z \cdot \color{blue}{z}} \]

      8. difference-of-squares N/A

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

      9. lower-*.f64 N/A

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

      10. lift-+.f64 N/A

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

      11. lift--.f64 76.9

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

   6. Applied rewrites 76.9%

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

Alternative 6: 53.0% accurate, N/A× speedup

Math

\[\begin{array}{l} [x, y, z, t] = \mathsf{sort}([x, y, z, t])\\ \\ -1 \cdot \left(\frac{x}{z} \cdot \frac{y + z}{\left(y + z\right) \cdot \left(y - z\right)}\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
 (* -1.0 (* (/ x z) (/ (+ y z) (* (+ y z) (- y z))))))

C

assert(x < y && y < z && z < t);
double code(double x, double y, double z, double t) {
	return -1.0 * ((x / z) * ((y + z) / ((y + z) * (y - 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 = (-1.0d0) * ((x / z) * ((y + z) / ((y + z) * (y - z))))
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 * ((x / z) * ((y + z) / ((y + z) * (y - z))));
}

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 89.2%

   \[\frac{x}{\left(y - z\right) \cdot \left(t - z\right)} \]
2. Step-by-step derivation

   1. lift--.f64 N/A

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

   2. lift--.f64 N/A

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

   3. lift-*.f64 N/A

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

   4. *-commutative N/A

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

   5. flip3-- N/A

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

   6. flip-- N/A

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

   7. frac-times N/A

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

   8. lower-/.f64 N/A

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

3. Applied rewrites 20.3%

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

4. Taylor expanded in t around 0

   \[\leadsto \color{blue}{-1 \cdot \frac{x \cdot \left(y + z\right)}{z \cdot \left({y}^{2} - {z}^{2}\right)}} \]
5. Step-by-step derivation

   1. lower-*.f64 N/A

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

   2. times-frac N/A

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

   3. lower-*.f64 N/A

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

   4. lower-/.f64 N/A

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

   5. lower-/.f64 N/A

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

   6. lift-+.f64 N/A

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

   7. pow2 N/A

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

   8. pow2 N/A

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

   9. difference-of-squares N/A

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

   10. lower-*.f64 N/A

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

   11. lift-+.f64 N/A

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

   12. lift--.f64 53.0

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

6. Applied rewrites 53.0%

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

Reproduce

herbie shell --seed 2025101 
(FPCore (x y z t)
  :name "Data.Random.Distribution.Triangular:triangularCDF from random-fu-0.2.6.2, B"
  :precision binary64
  (/ x (* (- y z) (- t z))))