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

Percentage Accurate: 89.1% → 97.5%

Time: 10.0s

Alternatives: 9

Speedup: 1.0×

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

real(8) function code(x, y, z, t)
    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.1% 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

real(8) function code(x, y, z, t)
    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: 97.5% accurate, 0.4× speedup

Math

\[\begin{array}{l} x\_m = \left|x\right| \\ x\_s = \mathsf{copysign}\left(1, x\right) \\ x\_s \cdot \begin{array}{l} \mathbf{if}\;\frac{x\_m}{\left(t - z\right) \cdot \left(y - z\right)} \leq -5 \cdot 10^{-309}:\\ \;\;\;\;\frac{x\_m}{\mathsf{fma}\left(z, z - t, \left(t - z\right) \cdot y\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{x\_m}{t - z}}{y - z}\\ \end{array} \end{array} \]

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
(FPCore (x_s x_m y z t)
 :precision binary64
 (*
  x_s
  (if (<= (/ x_m (* (- t z) (- y z))) -5e-309)
    (/ x_m (fma z (- z t) (* (- t z) y)))
    (/ (/ x_m (- t z)) (- y z)))))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
double code(double x_s, double x_m, double y, double z, double t) {
	double tmp;
	if ((x_m / ((t - z) * (y - z))) <= -5e-309) {
		tmp = x_m / fma(z, (z - t), ((t - z) * y));
	} else {
		tmp = (x_m / (t - z)) / (y - z);
	}
	return x_s * tmp;
}

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
function code(x_s, x_m, y, z, t)
	tmp = 0.0
	if (Float64(x_m / Float64(Float64(t - z) * Float64(y - z))) <= -5e-309)
		tmp = Float64(x_m / fma(z, Float64(z - t), Float64(Float64(t - z) * y)));
	else
		tmp = Float64(Float64(x_m / Float64(t - z)) / Float64(y - z));
	end
	return Float64(x_s * tmp)
end

Wolfram

x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[x$95$s_, x$95$m_, y_, z_, t_] := N[(x$95$s * If[LessEqual[N[(x$95$m / N[(N[(t - z), $MachinePrecision] * N[(y - z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -5e-309], N[(x$95$m / N[(z * N[(z - t), $MachinePrecision] + N[(N[(t - z), $MachinePrecision] * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(x$95$m / N[(t - z), $MachinePrecision]), $MachinePrecision] / N[(y - z), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if (/.f64 x (*.f64 (-.f64 y z) (-.f64 t z))) < -4.9999999999999995e-309

   1. Initial program 98.2%

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

      1. lift-*.f64 N/A

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

      2. *-commutative N/A

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

      3. lift--.f64 N/A

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

      4. sub-neg N/A

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

      5. +-commutative N/A

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

      6. distribute-rgt-in N/A

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

      7. lift--.f64 N/A

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

      8. sub-neg N/A

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

      9. +-commutative N/A

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

      10. distribute-lft-in N/A

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

      11. sqr-neg N/A

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

      12. cancel-sign-sub-inv N/A

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

      13. distribute-lft-out-- N/A

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

      14. lower-fma.f64 N/A

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

      15. lower--.f64 N/A

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

      16. *-commutative N/A

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

      17. lower-*.f64 98.1

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

   4. Applied rewrites 98.1%

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

   if -4.9999999999999995e-309 < (/.f64 x (*.f64 (-.f64 y z) (-.f64 t z)))

   1. Initial program 80.5%

      \[\frac{x}{\left(y - z\right) \cdot \left(t - z\right)} \]
   2. Add Preprocessing
   3. 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. associate-/l/ N/A

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

      4. lower-/.f64 N/A

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

      5. lower-/.f64 97.5

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

   4. Applied rewrites 97.5%

      \[\leadsto \color{blue}{\frac{\frac{x}{t - z}}{y - z}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 97.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{x}{\left(t - z\right) \cdot \left(y - z\right)} \leq -5 \cdot 10^{-309}:\\ \;\;\;\;\frac{x}{\mathsf{fma}\left(z, z - t, \left(t - z\right) \cdot y\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{x}{t - z}}{y - z}\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 91.4% accurate, 0.4× speedup

Math

\[\begin{array}{l} x\_m = \left|x\right| \\ x\_s = \mathsf{copysign}\left(1, x\right) \\ \begin{array}{l} t_1 := \left(t - z\right) \cdot \left(y - z\right)\\ x\_s \cdot \begin{array}{l} \mathbf{if}\;t\_1 \leq -1 \cdot 10^{+296}:\\ \;\;\;\;\frac{\frac{x\_m}{y}}{t - z}\\ \mathbf{elif}\;t\_1 \leq 2 \cdot 10^{+279}:\\ \;\;\;\;\frac{x\_m}{t\_1}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{x\_m}{-z}}{t - z}\\ \end{array} \end{array} \end{array} \]

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
(FPCore (x_s x_m y z t)
 :precision binary64
 (let* ((t_1 (* (- t z) (- y z))))
   (*
    x_s
    (if (<= t_1 -1e+296)
      (/ (/ x_m y) (- t z))
      (if (<= t_1 2e+279) (/ x_m t_1) (/ (/ x_m (- z)) (- t z)))))))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
double code(double x_s, double x_m, double y, double z, double t) {
	double t_1 = (t - z) * (y - z);
	double tmp;
	if (t_1 <= -1e+296) {
		tmp = (x_m / y) / (t - z);
	} else if (t_1 <= 2e+279) {
		tmp = x_m / t_1;
	} else {
		tmp = (x_m / -z) / (t - z);
	}
	return x_s * tmp;
}

Fortran

x\_m = abs(x)
x\_s = copysign(1.0d0, x)
real(8) function code(x_s, x_m, y, z, t)
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: t_1
    real(8) :: tmp
    t_1 = (t - z) * (y - z)
    if (t_1 <= (-1d+296)) then
        tmp = (x_m / y) / (t - z)
    else if (t_1 <= 2d+279) then
        tmp = x_m / t_1
    else
        tmp = (x_m / -z) / (t - z)
    end if
    code = x_s * tmp
end function

Java

x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
public static double code(double x_s, double x_m, double y, double z, double t) {
	double t_1 = (t - z) * (y - z);
	double tmp;
	if (t_1 <= -1e+296) {
		tmp = (x_m / y) / (t - z);
	} else if (t_1 <= 2e+279) {
		tmp = x_m / t_1;
	} else {
		tmp = (x_m / -z) / (t - z);
	}
	return x_s * tmp;
}

Python

x\_m = math.fabs(x)
x\_s = math.copysign(1.0, x)
def code(x_s, x_m, y, z, t):
	t_1 = (t - z) * (y - z)
	tmp = 0
	if t_1 <= -1e+296:
		tmp = (x_m / y) / (t - z)
	elif t_1 <= 2e+279:
		tmp = x_m / t_1
	else:
		tmp = (x_m / -z) / (t - z)
	return x_s * tmp

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
function code(x_s, x_m, y, z, t)
	t_1 = Float64(Float64(t - z) * Float64(y - z))
	tmp = 0.0
	if (t_1 <= -1e+296)
		tmp = Float64(Float64(x_m / y) / Float64(t - z));
	elseif (t_1 <= 2e+279)
		tmp = Float64(x_m / t_1);
	else
		tmp = Float64(Float64(x_m / Float64(-z)) / Float64(t - z));
	end
	return Float64(x_s * tmp)
end

MATLAB

x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
function tmp_2 = code(x_s, x_m, y, z, t)
	t_1 = (t - z) * (y - z);
	tmp = 0.0;
	if (t_1 <= -1e+296)
		tmp = (x_m / y) / (t - z);
	elseif (t_1 <= 2e+279)
		tmp = x_m / t_1;
	else
		tmp = (x_m / -z) / (t - z);
	end
	tmp_2 = x_s * tmp;
end

Wolfram

x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[x$95$s_, x$95$m_, y_, z_, t_] := Block[{t$95$1 = N[(N[(t - z), $MachinePrecision] * N[(y - z), $MachinePrecision]), $MachinePrecision]}, N[(x$95$s * If[LessEqual[t$95$1, -1e+296], N[(N[(x$95$m / y), $MachinePrecision] / N[(t - z), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 2e+279], N[(x$95$m / t$95$1), $MachinePrecision], N[(N[(x$95$m / (-z)), $MachinePrecision] / N[(t - z), $MachinePrecision]), $MachinePrecision]]]), $MachinePrecision]]

Derivation

1. Split input into 3 regimes

2. if (*.f64 (-.f64 y z) (-.f64 t z)) < -9.99999999999999981e295

   1. Initial program 47.7%

      \[\frac{x}{\left(y - z\right) \cdot \left(t - z\right)} \]
   2. Add Preprocessing
   3. 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. associate-/r* N/A

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

      4. lower-/.f64 N/A

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

      5. lower-/.f64 99.8

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

   4. Applied rewrites 99.8%

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

   5. Taylor expanded in z around 0

      \[\leadsto \frac{\color{blue}{\frac{x}{y}}}{t - z} \]
   6. Step-by-step derivation

      1. lower-/.f64 77.1

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

   7. Applied rewrites 77.1%

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

   if -9.99999999999999981e295 < (*.f64 (-.f64 y z) (-.f64 t z)) < 2.00000000000000012e279

   1. Initial program 98.3%

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

   if 2.00000000000000012e279 < (*.f64 (-.f64 y z) (-.f64 t z))

   1. Initial program 78.1%

      \[\frac{x}{\left(y - z\right) \cdot \left(t - z\right)} \]
   2. Add Preprocessing
   3. 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. associate-/r* N/A

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

      4. lower-/.f64 N/A

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

      5. lower-/.f64 100.0

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

   4. Applied rewrites 100.0%

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

   5. Taylor expanded in z around inf

      \[\leadsto \frac{\frac{x}{\color{blue}{-1 \cdot z}}}{t - z} \]
   6. Step-by-step derivation

      1. mul-1-neg N/A

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

      2. lower-neg.f64 80.9

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

   7. Applied rewrites 80.9%

      \[\leadsto \frac{\frac{x}{\color{blue}{-z}}}{t - z} \]
3. Recombined 3 regimes into one program.

4. Final simplification 89.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\left(t - z\right) \cdot \left(y - z\right) \leq -1 \cdot 10^{+296}:\\ \;\;\;\;\frac{\frac{x}{y}}{t - z}\\ \mathbf{elif}\;\left(t - z\right) \cdot \left(y - z\right) \leq 2 \cdot 10^{+279}:\\ \;\;\;\;\frac{x}{\left(t - z\right) \cdot \left(y - z\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{x}{-z}}{t - z}\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 90.2% accurate, 0.5× speedup

Math

\[\begin{array}{l} x\_m = \left|x\right| \\ x\_s = \mathsf{copysign}\left(1, x\right) \\ \begin{array}{l} t_1 := \left(t - z\right) \cdot \left(y - z\right)\\ x\_s \cdot \begin{array}{l} \mathbf{if}\;t\_1 \leq -1 \cdot 10^{+296}:\\ \;\;\;\;\frac{\frac{x\_m}{y}}{t - z}\\ \mathbf{else}:\\ \;\;\;\;\frac{x\_m}{t\_1}\\ \end{array} \end{array} \end{array} \]

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
(FPCore (x_s x_m y z t)
 :precision binary64
 (let* ((t_1 (* (- t z) (- y z))))
   (* x_s (if (<= t_1 -1e+296) (/ (/ x_m y) (- t z)) (/ x_m t_1)))))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
double code(double x_s, double x_m, double y, double z, double t) {
	double t_1 = (t - z) * (y - z);
	double tmp;
	if (t_1 <= -1e+296) {
		tmp = (x_m / y) / (t - z);
	} else {
		tmp = x_m / t_1;
	}
	return x_s * tmp;
}

Fortran

x\_m = abs(x)
x\_s = copysign(1.0d0, x)
real(8) function code(x_s, x_m, y, z, t)
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: t_1
    real(8) :: tmp
    t_1 = (t - z) * (y - z)
    if (t_1 <= (-1d+296)) then
        tmp = (x_m / y) / (t - z)
    else
        tmp = x_m / t_1
    end if
    code = x_s * tmp
end function

Java

x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
public static double code(double x_s, double x_m, double y, double z, double t) {
	double t_1 = (t - z) * (y - z);
	double tmp;
	if (t_1 <= -1e+296) {
		tmp = (x_m / y) / (t - z);
	} else {
		tmp = x_m / t_1;
	}
	return x_s * tmp;
}

Python

x\_m = math.fabs(x)
x\_s = math.copysign(1.0, x)
def code(x_s, x_m, y, z, t):
	t_1 = (t - z) * (y - z)
	tmp = 0
	if t_1 <= -1e+296:
		tmp = (x_m / y) / (t - z)
	else:
		tmp = x_m / t_1
	return x_s * tmp

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
function code(x_s, x_m, y, z, t)
	t_1 = Float64(Float64(t - z) * Float64(y - z))
	tmp = 0.0
	if (t_1 <= -1e+296)
		tmp = Float64(Float64(x_m / y) / Float64(t - z));
	else
		tmp = Float64(x_m / t_1);
	end
	return Float64(x_s * tmp)
end

MATLAB

x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
function tmp_2 = code(x_s, x_m, y, z, t)
	t_1 = (t - z) * (y - z);
	tmp = 0.0;
	if (t_1 <= -1e+296)
		tmp = (x_m / y) / (t - z);
	else
		tmp = x_m / t_1;
	end
	tmp_2 = x_s * tmp;
end

Wolfram

x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[x$95$s_, x$95$m_, y_, z_, t_] := Block[{t$95$1 = N[(N[(t - z), $MachinePrecision] * N[(y - z), $MachinePrecision]), $MachinePrecision]}, N[(x$95$s * If[LessEqual[t$95$1, -1e+296], N[(N[(x$95$m / y), $MachinePrecision] / N[(t - z), $MachinePrecision]), $MachinePrecision], N[(x$95$m / t$95$1), $MachinePrecision]]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (-.f64 y z) (-.f64 t z)) < -9.99999999999999981e295

   1. Initial program 47.7%

      \[\frac{x}{\left(y - z\right) \cdot \left(t - z\right)} \]
   2. Add Preprocessing
   3. 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. associate-/r* N/A

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

      4. lower-/.f64 N/A

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

      5. lower-/.f64 99.8

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

   4. Applied rewrites 99.8%

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

   5. Taylor expanded in z around 0

      \[\leadsto \frac{\color{blue}{\frac{x}{y}}}{t - z} \]
   6. Step-by-step derivation

      1. lower-/.f64 77.1

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

   7. Applied rewrites 77.1%

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

   if -9.99999999999999981e295 < (*.f64 (-.f64 y z) (-.f64 t z))

   1. Initial program 89.8%

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

4. Final simplification 88.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\left(t - z\right) \cdot \left(y - z\right) \leq -1 \cdot 10^{+296}:\\ \;\;\;\;\frac{\frac{x}{y}}{t - z}\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{\left(t - z\right) \cdot \left(y - z\right)}\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 69.3% accurate, 0.7× speedup

Math

\[\begin{array}{l} x\_m = \left|x\right| \\ x\_s = \mathsf{copysign}\left(1, x\right) \\ x\_s \cdot \begin{array}{l} \mathbf{if}\;y \leq -5 \cdot 10^{+18}:\\ \;\;\;\;\frac{x\_m}{\left(t - z\right) \cdot y}\\ \mathbf{elif}\;y \leq 4.5 \cdot 10^{-91}:\\ \;\;\;\;\frac{x\_m}{\left(z - t\right) \cdot z}\\ \mathbf{else}:\\ \;\;\;\;\frac{x\_m}{t \cdot \left(y - z\right)}\\ \end{array} \end{array} \]

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
(FPCore (x_s x_m y z t)
 :precision binary64
 (*
  x_s
  (if (<= y -5e+18)
    (/ x_m (* (- t z) y))
    (if (<= y 4.5e-91) (/ x_m (* (- z t) z)) (/ x_m (* t (- y z)))))))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
double code(double x_s, double x_m, double y, double z, double t) {
	double tmp;
	if (y <= -5e+18) {
		tmp = x_m / ((t - z) * y);
	} else if (y <= 4.5e-91) {
		tmp = x_m / ((z - t) * z);
	} else {
		tmp = x_m / (t * (y - z));
	}
	return x_s * tmp;
}

Fortran

x\_m = abs(x)
x\_s = copysign(1.0d0, x)
real(8) function code(x_s, x_m, y, z, t)
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: tmp
    if (y <= (-5d+18)) then
        tmp = x_m / ((t - z) * y)
    else if (y <= 4.5d-91) then
        tmp = x_m / ((z - t) * z)
    else
        tmp = x_m / (t * (y - z))
    end if
    code = x_s * tmp
end function

Java

x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
public static double code(double x_s, double x_m, double y, double z, double t) {
	double tmp;
	if (y <= -5e+18) {
		tmp = x_m / ((t - z) * y);
	} else if (y <= 4.5e-91) {
		tmp = x_m / ((z - t) * z);
	} else {
		tmp = x_m / (t * (y - z));
	}
	return x_s * tmp;
}

Python

x\_m = math.fabs(x)
x\_s = math.copysign(1.0, x)
def code(x_s, x_m, y, z, t):
	tmp = 0
	if y <= -5e+18:
		tmp = x_m / ((t - z) * y)
	elif y <= 4.5e-91:
		tmp = x_m / ((z - t) * z)
	else:
		tmp = x_m / (t * (y - z))
	return x_s * tmp

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
function code(x_s, x_m, y, z, t)
	tmp = 0.0
	if (y <= -5e+18)
		tmp = Float64(x_m / Float64(Float64(t - z) * y));
	elseif (y <= 4.5e-91)
		tmp = Float64(x_m / Float64(Float64(z - t) * z));
	else
		tmp = Float64(x_m / Float64(t * Float64(y - z)));
	end
	return Float64(x_s * tmp)
end

MATLAB

x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
function tmp_2 = code(x_s, x_m, y, z, t)
	tmp = 0.0;
	if (y <= -5e+18)
		tmp = x_m / ((t - z) * y);
	elseif (y <= 4.5e-91)
		tmp = x_m / ((z - t) * z);
	else
		tmp = x_m / (t * (y - z));
	end
	tmp_2 = x_s * tmp;
end

Wolfram

x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[x$95$s_, x$95$m_, y_, z_, t_] := N[(x$95$s * If[LessEqual[y, -5e+18], N[(x$95$m / N[(N[(t - z), $MachinePrecision] * y), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 4.5e-91], N[(x$95$m / N[(N[(z - t), $MachinePrecision] * z), $MachinePrecision]), $MachinePrecision], N[(x$95$m / N[(t * N[(y - z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]), $MachinePrecision]

Derivation

1. Split input into 3 regimes

2. if y < -5e18

   1. Initial program 86.0%

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

   3. Taylor expanded in y around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 78.2

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

   5. Applied rewrites 78.2%

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

   if -5e18 < y < 4.49999999999999976e-91

   1. Initial program 90.5%

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

   3. Taylor expanded in y around 0

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

      1. *-commutative N/A

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

      2. associate-*r* N/A

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

      3. lower-*.f64 N/A

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

      4. mul-1-neg N/A

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

      5. sub-neg N/A

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

      6. +-commutative N/A

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

      7. distribute-neg-in N/A

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

      8. unsub-neg N/A

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

      9. remove-double-neg N/A

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

      10. lower--.f64 73.4

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

   5. Applied rewrites 73.4%

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

   if 4.49999999999999976e-91 < y

   1. Initial program 78.2%

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

   3. Taylor expanded in t around inf

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

      1. lower-*.f64 N/A

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

      2. lower--.f64 52.6

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

   5. Applied rewrites 52.6%

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

Alternative 5: 69.6% accurate, 0.7× speedup

Math

\[\begin{array}{l} x\_m = \left|x\right| \\ x\_s = \mathsf{copysign}\left(1, x\right) \\ \begin{array}{l} t_1 := \frac{x\_m}{z \cdot z}\\ x\_s \cdot \begin{array}{l} \mathbf{if}\;z \leq -2.05 \cdot 10^{+70}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;z \leq 9.8 \cdot 10^{+89}:\\ \;\;\;\;\frac{x\_m}{t \cdot \left(y - z\right)}\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \end{array} \]

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
(FPCore (x_s x_m y z t)
 :precision binary64
 (let* ((t_1 (/ x_m (* z z))))
   (*
    x_s
    (if (<= z -2.05e+70) t_1 (if (<= z 9.8e+89) (/ x_m (* t (- y z))) t_1)))))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
double code(double x_s, double x_m, double y, double z, double t) {
	double t_1 = x_m / (z * z);
	double tmp;
	if (z <= -2.05e+70) {
		tmp = t_1;
	} else if (z <= 9.8e+89) {
		tmp = x_m / (t * (y - z));
	} else {
		tmp = t_1;
	}
	return x_s * tmp;
}

Fortran

x\_m = abs(x)
x\_s = copysign(1.0d0, x)
real(8) function code(x_s, x_m, y, z, t)
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: t_1
    real(8) :: tmp
    t_1 = x_m / (z * z)
    if (z <= (-2.05d+70)) then
        tmp = t_1
    else if (z <= 9.8d+89) then
        tmp = x_m / (t * (y - z))
    else
        tmp = t_1
    end if
    code = x_s * tmp
end function

Java

x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
public static double code(double x_s, double x_m, double y, double z, double t) {
	double t_1 = x_m / (z * z);
	double tmp;
	if (z <= -2.05e+70) {
		tmp = t_1;
	} else if (z <= 9.8e+89) {
		tmp = x_m / (t * (y - z));
	} else {
		tmp = t_1;
	}
	return x_s * tmp;
}

Python

x\_m = math.fabs(x)
x\_s = math.copysign(1.0, x)
def code(x_s, x_m, y, z, t):
	t_1 = x_m / (z * z)
	tmp = 0
	if z <= -2.05e+70:
		tmp = t_1
	elif z <= 9.8e+89:
		tmp = x_m / (t * (y - z))
	else:
		tmp = t_1
	return x_s * tmp

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
function code(x_s, x_m, y, z, t)
	t_1 = Float64(x_m / Float64(z * z))
	tmp = 0.0
	if (z <= -2.05e+70)
		tmp = t_1;
	elseif (z <= 9.8e+89)
		tmp = Float64(x_m / Float64(t * Float64(y - z)));
	else
		tmp = t_1;
	end
	return Float64(x_s * tmp)
end

MATLAB

x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
function tmp_2 = code(x_s, x_m, y, z, t)
	t_1 = x_m / (z * z);
	tmp = 0.0;
	if (z <= -2.05e+70)
		tmp = t_1;
	elseif (z <= 9.8e+89)
		tmp = x_m / (t * (y - z));
	else
		tmp = t_1;
	end
	tmp_2 = x_s * tmp;
end

Wolfram

x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[x$95$s_, x$95$m_, y_, z_, t_] := Block[{t$95$1 = N[(x$95$m / N[(z * z), $MachinePrecision]), $MachinePrecision]}, N[(x$95$s * If[LessEqual[z, -2.05e+70], t$95$1, If[LessEqual[z, 9.8e+89], N[(x$95$m / N[(t * N[(y - z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$1]]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -2.0500000000000001e70 or 9.79999999999999992e89 < z

   1. Initial program 79.0%

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

   3. Taylor expanded in z around inf

      \[\leadsto \frac{x}{\color{blue}{{z}^{2}}} \]
   4. Step-by-step derivation

      1. unpow2 N/A

         \[\leadsto \frac{x}{\color{blue}{z \cdot z}} \]

      2. lower-*.f64 75.1

         \[\leadsto \frac{x}{\color{blue}{z \cdot z}} \]

   5. Applied rewrites 75.1%

      \[\leadsto \frac{x}{\color{blue}{z \cdot z}} \]

   if -2.0500000000000001e70 < z < 9.79999999999999992e89

   1. Initial program 88.6%

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

   3. Taylor expanded in t around inf

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

      1. lower-*.f64 N/A

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

      2. lower--.f64 65.4

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

   5. Applied rewrites 65.4%

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

Alternative 6: 61.3% accurate, 0.8× speedup

Math

\[\begin{array}{l} x\_m = \left|x\right| \\ x\_s = \mathsf{copysign}\left(1, x\right) \\ \begin{array}{l} t_1 := \frac{x\_m}{z \cdot z}\\ x\_s \cdot \begin{array}{l} \mathbf{if}\;z \leq -2.25 \cdot 10^{+67}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;z \leq 4.8 \cdot 10^{-24}:\\ \;\;\;\;\frac{x\_m}{t \cdot y}\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \end{array} \]

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
(FPCore (x_s x_m y z t)
 :precision binary64
 (let* ((t_1 (/ x_m (* z z))))
   (* x_s (if (<= z -2.25e+67) t_1 (if (<= z 4.8e-24) (/ x_m (* t y)) t_1)))))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
double code(double x_s, double x_m, double y, double z, double t) {
	double t_1 = x_m / (z * z);
	double tmp;
	if (z <= -2.25e+67) {
		tmp = t_1;
	} else if (z <= 4.8e-24) {
		tmp = x_m / (t * y);
	} else {
		tmp = t_1;
	}
	return x_s * tmp;
}

Fortran

x\_m = abs(x)
x\_s = copysign(1.0d0, x)
real(8) function code(x_s, x_m, y, z, t)
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: t_1
    real(8) :: tmp
    t_1 = x_m / (z * z)
    if (z <= (-2.25d+67)) then
        tmp = t_1
    else if (z <= 4.8d-24) then
        tmp = x_m / (t * y)
    else
        tmp = t_1
    end if
    code = x_s * tmp
end function

Java

x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
public static double code(double x_s, double x_m, double y, double z, double t) {
	double t_1 = x_m / (z * z);
	double tmp;
	if (z <= -2.25e+67) {
		tmp = t_1;
	} else if (z <= 4.8e-24) {
		tmp = x_m / (t * y);
	} else {
		tmp = t_1;
	}
	return x_s * tmp;
}

Python

x\_m = math.fabs(x)
x\_s = math.copysign(1.0, x)
def code(x_s, x_m, y, z, t):
	t_1 = x_m / (z * z)
	tmp = 0
	if z <= -2.25e+67:
		tmp = t_1
	elif z <= 4.8e-24:
		tmp = x_m / (t * y)
	else:
		tmp = t_1
	return x_s * tmp

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
function code(x_s, x_m, y, z, t)
	t_1 = Float64(x_m / Float64(z * z))
	tmp = 0.0
	if (z <= -2.25e+67)
		tmp = t_1;
	elseif (z <= 4.8e-24)
		tmp = Float64(x_m / Float64(t * y));
	else
		tmp = t_1;
	end
	return Float64(x_s * tmp)
end

MATLAB

x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
function tmp_2 = code(x_s, x_m, y, z, t)
	t_1 = x_m / (z * z);
	tmp = 0.0;
	if (z <= -2.25e+67)
		tmp = t_1;
	elseif (z <= 4.8e-24)
		tmp = x_m / (t * y);
	else
		tmp = t_1;
	end
	tmp_2 = x_s * tmp;
end

Wolfram

x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[x$95$s_, x$95$m_, y_, z_, t_] := Block[{t$95$1 = N[(x$95$m / N[(z * z), $MachinePrecision]), $MachinePrecision]}, N[(x$95$s * If[LessEqual[z, -2.25e+67], t$95$1, If[LessEqual[z, 4.8e-24], N[(x$95$m / N[(t * y), $MachinePrecision]), $MachinePrecision], t$95$1]]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -2.2499999999999999e67 or 4.7999999999999996e-24 < z

   1. Initial program 82.3%

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

   3. Taylor expanded in z around inf

      \[\leadsto \frac{x}{\color{blue}{{z}^{2}}} \]
   4. Step-by-step derivation

      1. unpow2 N/A

         \[\leadsto \frac{x}{\color{blue}{z \cdot z}} \]

      2. lower-*.f64 70.2

         \[\leadsto \frac{x}{\color{blue}{z \cdot z}} \]

   5. Applied rewrites 70.2%

      \[\leadsto \frac{x}{\color{blue}{z \cdot z}} \]

   if -2.2499999999999999e67 < z < 4.7999999999999996e-24

   1. Initial program 87.1%

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

   3. Taylor expanded in z around 0

      \[\leadsto \frac{x}{\color{blue}{t \cdot y}} \]
   4. Step-by-step derivation

      1. lower-*.f64 55.0

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

   5. Applied rewrites 55.0%

      \[\leadsto \frac{x}{\color{blue}{t \cdot y}} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 7: 96.9% accurate, 0.8× speedup

Math

\[\begin{array}{l} x\_m = \left|x\right| \\ x\_s = \mathsf{copysign}\left(1, x\right) \\ x\_s \cdot \frac{\frac{x\_m}{y - z}}{t - z} \end{array} \]

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
(FPCore (x_s x_m y z t)
 :precision binary64
 (* x_s (/ (/ x_m (- y z)) (- t z))))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
double code(double x_s, double x_m, double y, double z, double t) {
	return x_s * ((x_m / (y - z)) / (t - z));
}

Fortran

x\_m = abs(x)
x\_s = copysign(1.0d0, x)
real(8) function code(x_s, x_m, y, z, t)
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    code = x_s * ((x_m / (y - z)) / (t - z))
end function

Java

x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
public static double code(double x_s, double x_m, double y, double z, double t) {
	return x_s * ((x_m / (y - z)) / (t - z));
}

Python

x\_m = math.fabs(x)
x\_s = math.copysign(1.0, x)
def code(x_s, x_m, y, z, t):
	return x_s * ((x_m / (y - z)) / (t - z))

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
function code(x_s, x_m, y, z, t)
	return Float64(x_s * Float64(Float64(x_m / Float64(y - z)) / Float64(t - z)))
end

MATLAB

x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
function tmp = code(x_s, x_m, y, z, t)
	tmp = x_s * ((x_m / (y - z)) / (t - z));
end

Wolfram

x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[x$95$s_, x$95$m_, y_, z_, t_] := N[(x$95$s * N[(N[(x$95$m / N[(y - z), $MachinePrecision]), $MachinePrecision] / N[(t - z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 84.9%

   \[\frac{x}{\left(y - z\right) \cdot \left(t - z\right)} \]
2. Add Preprocessing
3. 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. associate-/r* N/A

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

   4. lower-/.f64 N/A

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

   5. lower-/.f64 96.2

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

4. Applied rewrites 96.2%

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

Alternative 8: 89.1% accurate, 1.0× speedup

Math

\[\begin{array}{l} x\_m = \left|x\right| \\ x\_s = \mathsf{copysign}\left(1, x\right) \\ x\_s \cdot \frac{x\_m}{\left(t - z\right) \cdot \left(y - z\right)} \end{array} \]

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
(FPCore (x_s x_m y z t)
 :precision binary64
 (* x_s (/ x_m (* (- t z) (- y z)))))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
double code(double x_s, double x_m, double y, double z, double t) {
	return x_s * (x_m / ((t - z) * (y - z)));
}

Fortran

x\_m = abs(x)
x\_s = copysign(1.0d0, x)
real(8) function code(x_s, x_m, y, z, t)
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    code = x_s * (x_m / ((t - z) * (y - z)))
end function

Java

x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
public static double code(double x_s, double x_m, double y, double z, double t) {
	return x_s * (x_m / ((t - z) * (y - z)));
}

Python

x\_m = math.fabs(x)
x\_s = math.copysign(1.0, x)
def code(x_s, x_m, y, z, t):
	return x_s * (x_m / ((t - z) * (y - z)))

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
function code(x_s, x_m, y, z, t)
	return Float64(x_s * Float64(x_m / Float64(Float64(t - z) * Float64(y - z))))
end

MATLAB

x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
function tmp = code(x_s, x_m, y, z, t)
	tmp = x_s * (x_m / ((t - z) * (y - z)));
end

Wolfram

x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[x$95$s_, x$95$m_, y_, z_, t_] := N[(x$95$s * N[(x$95$m / N[(N[(t - z), $MachinePrecision] * N[(y - z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 84.9%

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

3. Final simplification 84.9%

   \[\leadsto \frac{x}{\left(t - z\right) \cdot \left(y - z\right)} \]
4. Add Preprocessing

Alternative 9: 39.3% accurate, 1.4× speedup

Math

\[\begin{array}{l} x\_m = \left|x\right| \\ x\_s = \mathsf{copysign}\left(1, x\right) \\ x\_s \cdot \frac{x\_m}{t \cdot y} \end{array} \]

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
(FPCore (x_s x_m y z t) :precision binary64 (* x_s (/ x_m (* t y))))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
double code(double x_s, double x_m, double y, double z, double t) {
	return x_s * (x_m / (t * y));
}

Fortran

x\_m = abs(x)
x\_s = copysign(1.0d0, x)
real(8) function code(x_s, x_m, y, z, t)
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    code = x_s * (x_m / (t * y))
end function

Java

x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
public static double code(double x_s, double x_m, double y, double z, double t) {
	return x_s * (x_m / (t * y));
}

Python

x\_m = math.fabs(x)
x\_s = math.copysign(1.0, x)
def code(x_s, x_m, y, z, t):
	return x_s * (x_m / (t * y))

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
function code(x_s, x_m, y, z, t)
	return Float64(x_s * Float64(x_m / Float64(t * y)))
end

MATLAB

x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
function tmp = code(x_s, x_m, y, z, t)
	tmp = x_s * (x_m / (t * y));
end

Wolfram

x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[x$95$s_, x$95$m_, y_, z_, t_] := N[(x$95$s * N[(x$95$m / N[(t * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 84.9%

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

3. Taylor expanded in z around 0

   \[\leadsto \frac{x}{\color{blue}{t \cdot y}} \]
4. Step-by-step derivation

   1. lower-*.f64 40.2

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

5. Applied rewrites 40.2%

   \[\leadsto \frac{x}{\color{blue}{t \cdot y}} \]
6. Add Preprocessing

Developer Target 1: 88.0% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \left(y - z\right) \cdot \left(t - z\right)\\ \mathbf{if}\;\frac{x}{t\_1} < 0:\\ \;\;\;\;\frac{\frac{x}{y - z}}{t - z}\\ \mathbf{else}:\\ \;\;\;\;x \cdot \frac{1}{t\_1}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (* (- y z) (- t z))))
   (if (< (/ x t_1) 0.0) (/ (/ x (- y z)) (- t z)) (* x (/ 1.0 t_1)))))

C

double code(double x, double y, double z, double t) {
	double t_1 = (y - z) * (t - z);
	double tmp;
	if ((x / t_1) < 0.0) {
		tmp = (x / (y - z)) / (t - z);
	} else {
		tmp = x * (1.0 / t_1);
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t)
    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) * (t - z)
    if ((x / t_1) < 0.0d0) then
        tmp = (x / (y - z)) / (t - z)
    else
        tmp = x * (1.0d0 / t_1)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double t_1 = (y - z) * (t - z);
	double tmp;
	if ((x / t_1) < 0.0) {
		tmp = (x / (y - z)) / (t - z);
	} else {
		tmp = x * (1.0 / t_1);
	}
	return tmp;
}

Python

def code(x, y, z, t):
	t_1 = (y - z) * (t - z)
	tmp = 0
	if (x / t_1) < 0.0:
		tmp = (x / (y - z)) / (t - z)
	else:
		tmp = x * (1.0 / t_1)
	return tmp

Julia

function code(x, y, z, t)
	t_1 = Float64(Float64(y - z) * Float64(t - z))
	tmp = 0.0
	if (Float64(x / t_1) < 0.0)
		tmp = Float64(Float64(x / Float64(y - z)) / Float64(t - z));
	else
		tmp = Float64(x * Float64(1.0 / t_1));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	t_1 = (y - z) * (t - z);
	tmp = 0.0;
	if ((x / t_1) < 0.0)
		tmp = (x / (y - z)) / (t - z);
	else
		tmp = x * (1.0 / t_1);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(N[(y - z), $MachinePrecision] * N[(t - z), $MachinePrecision]), $MachinePrecision]}, If[Less[N[(x / t$95$1), $MachinePrecision], 0.0], N[(N[(x / N[(y - z), $MachinePrecision]), $MachinePrecision] / N[(t - z), $MachinePrecision]), $MachinePrecision], N[(x * N[(1.0 / t$95$1), $MachinePrecision]), $MachinePrecision]]]

Reproduce

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

  :alt
  (! :herbie-platform default (if (< (/ x (* (- y z) (- t z))) 0) (/ (/ x (- y z)) (- t z)) (* x (/ 1 (* (- y z) (- t z))))))

  (/ x (* (- y z) (- t z))))