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

Percentage Accurate: 98.9% → 98.9%

Time: 9.1s

Alternatives: 9

Speedup: 1.0×

Specification

Math

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

FPCore

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

C

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 98.9% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 98.9% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 98.5%

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

3. Final simplification 98.5%

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

Alternative 2: 91.5% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -8.5 \cdot 10^{-124} \lor \neg \left(z \leq 4.5 \cdot 10^{-75}\right):\\ \;\;\;\;1 + \frac{\frac{x}{z}}{y - t}\\ \mathbf{else}:\\ \;\;\;\;1 - \frac{x}{y \cdot \left(y - t\right)}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (or (<= z -8.5e-124) (not (<= z 4.5e-75)))
   (+ 1.0 (/ (/ x z) (- y t)))
   (- 1.0 (/ x (* y (- y t))))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if ((z <= -8.5e-124) || !(z <= 4.5e-75)) {
		tmp = 1.0 + ((x / z) / (y - t));
	} else {
		tmp = 1.0 - (x / (y * (y - t)));
	}
	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) :: tmp
    if ((z <= (-8.5d-124)) .or. (.not. (z <= 4.5d-75))) then
        tmp = 1.0d0 + ((x / z) / (y - t))
    else
        tmp = 1.0d0 - (x / (y * (y - t)))
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if ((z <= -8.5e-124) || !(z <= 4.5e-75)) {
		tmp = 1.0 + ((x / z) / (y - t));
	} else {
		tmp = 1.0 - (x / (y * (y - t)));
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if (z <= -8.5e-124) or not (z <= 4.5e-75):
		tmp = 1.0 + ((x / z) / (y - t))
	else:
		tmp = 1.0 - (x / (y * (y - t)))
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if ((z <= -8.5e-124) || !(z <= 4.5e-75))
		tmp = Float64(1.0 + Float64(Float64(x / z) / Float64(y - t)));
	else
		tmp = Float64(1.0 - Float64(x / Float64(y * Float64(y - t))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if ((z <= -8.5e-124) || ~((z <= 4.5e-75)))
		tmp = 1.0 + ((x / z) / (y - t));
	else
		tmp = 1.0 - (x / (y * (y - t)));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[Or[LessEqual[z, -8.5e-124], N[Not[LessEqual[z, 4.5e-75]], $MachinePrecision]], N[(1.0 + N[(N[(x / z), $MachinePrecision] / N[(y - t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(1.0 - N[(x / N[(y * N[(y - t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -8.5000000000000002e-124 or 4.5000000000000003e-75 < z

   1. Initial program 99.5%

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

      1. sub-neg 99.5%

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

      2. neg-mul-1 99.5%

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

      3. *-commutative 99.5%

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

      4. *-commutative 99.5%

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

      5. associate-/r* 99.4%

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

      6. associate-*r/ 99.4%

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

      7. metadata-eval 99.4%

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

      8. times-frac 99.4%

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

      9. *-lft-identity 99.4%

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

      10. neg-mul-1 99.4%

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

      11. sub-neg 99.4%

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

      12. +-commutative 99.4%

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

      13. distribute-neg-out 99.4%

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

      14. remove-double-neg 99.4%

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

      15. sub-neg 99.4%

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

   3. Simplified 99.4%

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

   5. Taylor expanded in z around inf 93.9%

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

      1. associate-/r* 94.2%

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

   7. Simplified 94.2%

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

   if -8.5000000000000002e-124 < z < 4.5000000000000003e-75

   1. Initial program 96.4%

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

   3. Taylor expanded in z around 0 87.0%

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

4. Final simplification 91.9%

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

Alternative 3: 91.0% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -1.05 \cdot 10^{-126} \lor \neg \left(z \leq 5.5 \cdot 10^{-75}\right):\\ \;\;\;\;1 + \frac{\frac{x}{z}}{y - t}\\ \mathbf{else}:\\ \;\;\;\;1 - \frac{\frac{x}{y}}{y - t}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (or (<= z -1.05e-126) (not (<= z 5.5e-75)))
   (+ 1.0 (/ (/ x z) (- y t)))
   (- 1.0 (/ (/ x y) (- y t)))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if ((z <= -1.05e-126) || !(z <= 5.5e-75)) {
		tmp = 1.0 + ((x / z) / (y - t));
	} else {
		tmp = 1.0 - ((x / y) / (y - t));
	}
	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) :: tmp
    if ((z <= (-1.05d-126)) .or. (.not. (z <= 5.5d-75))) then
        tmp = 1.0d0 + ((x / z) / (y - t))
    else
        tmp = 1.0d0 - ((x / y) / (y - t))
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if ((z <= -1.05e-126) || !(z <= 5.5e-75)) {
		tmp = 1.0 + ((x / z) / (y - t));
	} else {
		tmp = 1.0 - ((x / y) / (y - t));
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if (z <= -1.05e-126) or not (z <= 5.5e-75):
		tmp = 1.0 + ((x / z) / (y - t))
	else:
		tmp = 1.0 - ((x / y) / (y - t))
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if ((z <= -1.05e-126) || !(z <= 5.5e-75))
		tmp = Float64(1.0 + Float64(Float64(x / z) / Float64(y - t)));
	else
		tmp = Float64(1.0 - Float64(Float64(x / y) / Float64(y - t)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if ((z <= -1.05e-126) || ~((z <= 5.5e-75)))
		tmp = 1.0 + ((x / z) / (y - t));
	else
		tmp = 1.0 - ((x / y) / (y - t));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[Or[LessEqual[z, -1.05e-126], N[Not[LessEqual[z, 5.5e-75]], $MachinePrecision]], N[(1.0 + N[(N[(x / z), $MachinePrecision] / N[(y - t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(1.0 - N[(N[(x / y), $MachinePrecision] / N[(y - t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -1.0499999999999999e-126 or 5.50000000000000026e-75 < z

   1. Initial program 99.5%

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

      1. sub-neg 99.5%

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

      2. neg-mul-1 99.5%

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

      3. *-commutative 99.5%

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

      4. *-commutative 99.5%

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

      5. associate-/r* 99.4%

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

      6. associate-*r/ 99.4%

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

      7. metadata-eval 99.4%

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

      8. times-frac 99.4%

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

      9. *-lft-identity 99.4%

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

      10. neg-mul-1 99.4%

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

      11. sub-neg 99.4%

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

      12. +-commutative 99.4%

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

      13. distribute-neg-out 99.4%

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

      14. remove-double-neg 99.4%

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

      15. sub-neg 99.4%

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

   3. Simplified 99.4%

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

   5. Taylor expanded in z around inf 94.0%

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

      1. associate-/r* 94.2%

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

   7. Simplified 94.2%

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

   if -1.0499999999999999e-126 < z < 5.50000000000000026e-75

   1. Initial program 96.3%

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

   3. Taylor expanded in z around 0 88.0%

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

      1. expm1-log1p-u 72.4%

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

      2. expm1-udef 72.4%

         \[\leadsto 1 - \color{blue}{\left(e^{\mathsf{log1p}\left(\frac{x}{y \cdot \left(y - t\right)}\right)} - 1\right)} \]

   5. Applied egg-rr 72.4%

      \[\leadsto 1 - \color{blue}{\left(e^{\mathsf{log1p}\left(\frac{x}{y \cdot \left(y - t\right)}\right)} - 1\right)} \]
   6. Step-by-step derivation

      1. expm1-def 72.4%

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

      2. expm1-log1p 88.0%

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

      3. associate-/r* 89.3%

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

   7. Simplified 89.3%

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

4. Final simplification 92.7%

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

Alternative 4: 88.3% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -3 \cdot 10^{-66}:\\ \;\;\;\;1 + \frac{\frac{x}{y}}{z - y}\\ \mathbf{elif}\;y \leq 1.5 \cdot 10^{-31}:\\ \;\;\;\;1 + \frac{\frac{x}{z}}{y - t}\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= y -3e-66)
   (+ 1.0 (/ (/ x y) (- z y)))
   (if (<= y 1.5e-31) (+ 1.0 (/ (/ x z) (- y t))) 1.0)))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (y <= -3e-66) {
		tmp = 1.0 + ((x / y) / (z - y));
	} else if (y <= 1.5e-31) {
		tmp = 1.0 + ((x / z) / (y - t));
	} else {
		tmp = 1.0;
	}
	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) :: tmp
    if (y <= (-3d-66)) then
        tmp = 1.0d0 + ((x / y) / (z - y))
    else if (y <= 1.5d-31) then
        tmp = 1.0d0 + ((x / z) / (y - t))
    else
        tmp = 1.0d0
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if (y <= -3e-66) {
		tmp = 1.0 + ((x / y) / (z - y));
	} else if (y <= 1.5e-31) {
		tmp = 1.0 + ((x / z) / (y - t));
	} else {
		tmp = 1.0;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if y <= -3e-66:
		tmp = 1.0 + ((x / y) / (z - y))
	elif y <= 1.5e-31:
		tmp = 1.0 + ((x / z) / (y - t))
	else:
		tmp = 1.0
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (y <= -3e-66)
		tmp = Float64(1.0 + Float64(Float64(x / y) / Float64(z - y)));
	elseif (y <= 1.5e-31)
		tmp = Float64(1.0 + Float64(Float64(x / z) / Float64(y - t)));
	else
		tmp = 1.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if (y <= -3e-66)
		tmp = 1.0 + ((x / y) / (z - y));
	elseif (y <= 1.5e-31)
		tmp = 1.0 + ((x / z) / (y - t));
	else
		tmp = 1.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[y, -3e-66], N[(1.0 + N[(N[(x / y), $MachinePrecision] / N[(z - y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 1.5e-31], N[(1.0 + N[(N[(x / z), $MachinePrecision] / N[(y - t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 1.0]]

Derivation

1. Split input into 3 regimes

2. if y < -3.0000000000000002e-66

   1. Initial program 100.0%

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

      1. sub-neg 100.0%

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

      2. neg-mul-1 100.0%

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

      3. *-commutative 100.0%

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

      4. *-commutative 100.0%

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

      5. associate-/r* 100.0%

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

      6. associate-*r/ 100.0%

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

      7. metadata-eval 100.0%

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

      8. times-frac 100.0%

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

      9. *-lft-identity 100.0%

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

      10. neg-mul-1 100.0%

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

      11. sub-neg 100.0%

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

      12. +-commutative 100.0%

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

      13. distribute-neg-out 100.0%

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

      14. remove-double-neg 100.0%

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

      15. sub-neg 100.0%

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

   3. Simplified 100.0%

      \[\leadsto \color{blue}{1 + \frac{\frac{x}{z - y}}{y - t}} \]
   4. Add Preprocessing
   5. Step-by-step derivation

      1. clear-num 100.0%

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

      2. inv-pow 100.0%

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

      3. div-inv 100.0%

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

      4. clear-num 99.9%

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

   6. Applied egg-rr 99.9%

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

      1. unpow-1 99.9%

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

      2. associate-/r* 99.9%

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

   8. Simplified 99.9%

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

   9. Taylor expanded in t around 0 94.3%

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

       1. associate-/r* 94.4%

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

   11. Simplified 94.4%

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

   if -3.0000000000000002e-66 < y < 1.49999999999999991e-31

   1. Initial program 96.4%

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

      1. sub-neg 96.4%

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

      2. neg-mul-1 96.4%

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

      3. *-commutative 96.4%

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

      4. *-commutative 96.4%

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

      5. associate-/r* 96.2%

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

      6. associate-*r/ 96.2%

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

      7. metadata-eval 96.2%

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

      8. times-frac 96.2%

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

      9. *-lft-identity 96.2%

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

      10. neg-mul-1 96.2%

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

      11. sub-neg 96.2%

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

      12. +-commutative 96.2%

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

      13. distribute-neg-out 96.2%

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

      14. remove-double-neg 96.2%

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

      15. sub-neg 96.2%

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

   3. Simplified 96.2%

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

   5. Taylor expanded in z around inf 86.6%

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

      1. associate-/r* 86.3%

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

   7. Simplified 86.3%

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

   if 1.49999999999999991e-31 < y

   1. Initial program 100.0%

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

      1. sub-neg 100.0%

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

      2. neg-mul-1 100.0%

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

      3. *-commutative 100.0%

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

      4. *-commutative 100.0%

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

      5. associate-/r* 100.0%

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

      6. associate-*r/ 100.0%

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

      7. metadata-eval 100.0%

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

      8. times-frac 100.0%

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

      9. *-lft-identity 100.0%

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

      10. neg-mul-1 100.0%

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

      11. sub-neg 100.0%

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

      12. +-commutative 100.0%

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

      13. distribute-neg-out 100.0%

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

      14. remove-double-neg 100.0%

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

      15. sub-neg 100.0%

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

   3. Simplified 100.0%

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

   5. Taylor expanded in t around inf 78.7%

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

      1. associate-*r/ 78.7%

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

      2. neg-mul-1 78.7%

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

      3. associate-/r* 78.6%

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

   7. Simplified 78.6%

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

   8. Taylor expanded in x around 0 95.4%

      \[\leadsto \color{blue}{1} \]
3. Recombined 3 regimes into one program.

4. Final simplification 91.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -3 \cdot 10^{-66}:\\ \;\;\;\;1 + \frac{\frac{x}{y}}{z - y}\\ \mathbf{elif}\;y \leq 1.5 \cdot 10^{-31}:\\ \;\;\;\;1 + \frac{\frac{x}{z}}{y - t}\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 85.2% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;t \leq -5.2 \cdot 10^{-205}:\\ \;\;\;\;1 + \frac{\frac{x}{z}}{y - t}\\ \mathbf{elif}\;t \leq 850000:\\ \;\;\;\;1 + \frac{\frac{x}{y}}{z - y}\\ \mathbf{else}:\\ \;\;\;\;1 - \frac{\frac{x}{t}}{z - y}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= t -5.2e-205)
   (+ 1.0 (/ (/ x z) (- y t)))
   (if (<= t 850000.0)
     (+ 1.0 (/ (/ x y) (- z y)))
     (- 1.0 (/ (/ x t) (- z y))))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (t <= -5.2e-205) {
		tmp = 1.0 + ((x / z) / (y - t));
	} else if (t <= 850000.0) {
		tmp = 1.0 + ((x / y) / (z - y));
	} else {
		tmp = 1.0 - ((x / t) / (z - y));
	}
	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) :: tmp
    if (t <= (-5.2d-205)) then
        tmp = 1.0d0 + ((x / z) / (y - t))
    else if (t <= 850000.0d0) then
        tmp = 1.0d0 + ((x / y) / (z - y))
    else
        tmp = 1.0d0 - ((x / t) / (z - y))
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if (t <= -5.2e-205) {
		tmp = 1.0 + ((x / z) / (y - t));
	} else if (t <= 850000.0) {
		tmp = 1.0 + ((x / y) / (z - y));
	} else {
		tmp = 1.0 - ((x / t) / (z - y));
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if t <= -5.2e-205:
		tmp = 1.0 + ((x / z) / (y - t))
	elif t <= 850000.0:
		tmp = 1.0 + ((x / y) / (z - y))
	else:
		tmp = 1.0 - ((x / t) / (z - y))
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (t <= -5.2e-205)
		tmp = Float64(1.0 + Float64(Float64(x / z) / Float64(y - t)));
	elseif (t <= 850000.0)
		tmp = Float64(1.0 + Float64(Float64(x / y) / Float64(z - y)));
	else
		tmp = Float64(1.0 - Float64(Float64(x / t) / Float64(z - y)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if (t <= -5.2e-205)
		tmp = 1.0 + ((x / z) / (y - t));
	elseif (t <= 850000.0)
		tmp = 1.0 + ((x / y) / (z - y));
	else
		tmp = 1.0 - ((x / t) / (z - y));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[t, -5.2e-205], N[(1.0 + N[(N[(x / z), $MachinePrecision] / N[(y - t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t, 850000.0], N[(1.0 + N[(N[(x / y), $MachinePrecision] / N[(z - y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(1.0 - N[(N[(x / t), $MachinePrecision] / N[(z - y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if t < -5.1999999999999997e-205

   1. Initial program 99.9%

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

      1. sub-neg 99.9%

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

      2. neg-mul-1 99.9%

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

      3. *-commutative 99.9%

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

      4. *-commutative 99.9%

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

      5. associate-/r* 99.0%

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

      6. associate-*r/ 99.0%

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

      7. metadata-eval 99.0%

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

      8. times-frac 99.0%

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

      9. *-lft-identity 99.0%

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

      10. neg-mul-1 99.0%

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

      11. sub-neg 99.0%

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

      12. +-commutative 99.0%

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

      13. distribute-neg-out 99.0%

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

      14. remove-double-neg 99.0%

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

      15. sub-neg 99.0%

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

   3. Simplified 99.0%

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

   5. Taylor expanded in z around inf 85.1%

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

      1. associate-/r* 84.9%

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

   7. Simplified 84.9%

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

   if -5.1999999999999997e-205 < t < 8.5e5

   1. Initial program 95.4%

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

      1. sub-neg 95.4%

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

      2. neg-mul-1 95.4%

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

      3. *-commutative 95.4%

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

      4. *-commutative 95.4%

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

      5. associate-/r* 99.9%

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

      6. associate-*r/ 99.9%

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

      7. metadata-eval 99.9%

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

      8. times-frac 99.9%

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

      9. *-lft-identity 99.9%

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

      10. neg-mul-1 99.9%

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

      11. sub-neg 99.9%

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

      12. +-commutative 99.9%

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

      13. distribute-neg-out 99.9%

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

      14. remove-double-neg 99.9%

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

      15. sub-neg 99.9%

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

   3. Simplified 99.9%

      \[\leadsto \color{blue}{1 + \frac{\frac{x}{z - y}}{y - t}} \]
   4. Add Preprocessing
   5. Step-by-step derivation

      1. clear-num 99.9%

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

      2. inv-pow 99.9%

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

      3. div-inv 99.8%

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

      4. clear-num 99.9%

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

   6. Applied egg-rr 99.9%

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

      1. unpow-1 99.9%

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

      2. associate-/r* 99.9%

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

   8. Simplified 99.9%

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

   9. Taylor expanded in t around 0 84.8%

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

       1. associate-/r* 88.3%

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

   11. Simplified 88.3%

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

   if 8.5e5 < t

   1. Initial program 99.9%

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

      1. sub-neg 99.9%

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

      2. neg-mul-1 99.9%

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

      3. *-commutative 99.9%

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

      4. *-commutative 99.9%

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

      5. associate-/r* 96.1%

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

      6. associate-*r/ 96.1%

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

      7. metadata-eval 96.1%

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

      8. times-frac 96.1%

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

      9. *-lft-identity 96.1%

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

      10. neg-mul-1 96.1%

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

      11. sub-neg 96.1%

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

      12. +-commutative 96.1%

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

      13. distribute-neg-out 96.1%

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

      14. remove-double-neg 96.1%

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

      15. sub-neg 96.1%

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

   3. Simplified 96.1%

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

   5. Taylor expanded in t around inf 99.9%

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

      1. associate-*r/ 99.9%

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

      2. neg-mul-1 99.9%

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

      3. associate-/r* 100.0%

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

   7. Simplified 100.0%

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

4. Final simplification 90.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;t \leq -5.2 \cdot 10^{-205}:\\ \;\;\;\;1 + \frac{\frac{x}{z}}{y - t}\\ \mathbf{elif}\;t \leq 850000:\\ \;\;\;\;1 + \frac{\frac{x}{y}}{z - y}\\ \mathbf{else}:\\ \;\;\;\;1 - \frac{\frac{x}{t}}{z - y}\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 83.5% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -2.4 \cdot 10^{-70}:\\ \;\;\;\;1\\ \mathbf{elif}\;y \leq 4.2 \cdot 10^{-62}:\\ \;\;\;\;1 - \frac{x}{z \cdot t}\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= y -2.4e-70) 1.0 (if (<= y 4.2e-62) (- 1.0 (/ x (* z t))) 1.0)))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (y <= -2.4e-70) {
		tmp = 1.0;
	} else if (y <= 4.2e-62) {
		tmp = 1.0 - (x / (z * t));
	} else {
		tmp = 1.0;
	}
	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) :: tmp
    if (y <= (-2.4d-70)) then
        tmp = 1.0d0
    else if (y <= 4.2d-62) then
        tmp = 1.0d0 - (x / (z * t))
    else
        tmp = 1.0d0
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if (y <= -2.4e-70) {
		tmp = 1.0;
	} else if (y <= 4.2e-62) {
		tmp = 1.0 - (x / (z * t));
	} else {
		tmp = 1.0;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if y <= -2.4e-70:
		tmp = 1.0
	elif y <= 4.2e-62:
		tmp = 1.0 - (x / (z * t))
	else:
		tmp = 1.0
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (y <= -2.4e-70)
		tmp = 1.0;
	elseif (y <= 4.2e-62)
		tmp = Float64(1.0 - Float64(x / Float64(z * t)));
	else
		tmp = 1.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if (y <= -2.4e-70)
		tmp = 1.0;
	elseif (y <= 4.2e-62)
		tmp = 1.0 - (x / (z * t));
	else
		tmp = 1.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[y, -2.4e-70], 1.0, If[LessEqual[y, 4.2e-62], N[(1.0 - N[(x / N[(z * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 1.0]]

Derivation

1. Split input into 2 regimes

2. if y < -2.4000000000000001e-70 or 4.1999999999999998e-62 < y

   1. Initial program 100.0%

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

      1. sub-neg 100.0%

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

      2. neg-mul-1 100.0%

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

      3. *-commutative 100.0%

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

      4. *-commutative 100.0%

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

      5. associate-/r* 100.0%

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

      6. associate-*r/ 100.0%

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

      7. metadata-eval 100.0%

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

      8. times-frac 100.0%

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

      9. *-lft-identity 100.0%

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

      10. neg-mul-1 100.0%

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

      11. sub-neg 100.0%

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

      12. +-commutative 100.0%

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

      13. distribute-neg-out 100.0%

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

      14. remove-double-neg 100.0%

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

      15. sub-neg 100.0%

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

   3. Simplified 100.0%

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

   5. Taylor expanded in t around inf 76.9%

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

      1. associate-*r/ 76.9%

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

      2. neg-mul-1 76.9%

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

      3. associate-/r* 76.9%

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

   7. Simplified 76.9%

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

   8. Taylor expanded in x around 0 91.3%

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

   if -2.4000000000000001e-70 < y < 4.1999999999999998e-62

   1. Initial program 96.0%

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

   3. Taylor expanded in y around 0 75.4%

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

4. Final simplification 85.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -2.4 \cdot 10^{-70}:\\ \;\;\;\;1\\ \mathbf{elif}\;y \leq 4.2 \cdot 10^{-62}:\\ \;\;\;\;1 - \frac{x}{z \cdot t}\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 84.3% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -2.15 \cdot 10^{-120}:\\ \;\;\;\;1 + \frac{\frac{x}{y}}{z - y}\\ \mathbf{elif}\;y \leq 1.7 \cdot 10^{-66}:\\ \;\;\;\;1 - \frac{x}{z \cdot t}\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= y -2.15e-120)
   (+ 1.0 (/ (/ x y) (- z y)))
   (if (<= y 1.7e-66) (- 1.0 (/ x (* z t))) 1.0)))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (y <= -2.15e-120) {
		tmp = 1.0 + ((x / y) / (z - y));
	} else if (y <= 1.7e-66) {
		tmp = 1.0 - (x / (z * t));
	} else {
		tmp = 1.0;
	}
	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) :: tmp
    if (y <= (-2.15d-120)) then
        tmp = 1.0d0 + ((x / y) / (z - y))
    else if (y <= 1.7d-66) then
        tmp = 1.0d0 - (x / (z * t))
    else
        tmp = 1.0d0
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if (y <= -2.15e-120) {
		tmp = 1.0 + ((x / y) / (z - y));
	} else if (y <= 1.7e-66) {
		tmp = 1.0 - (x / (z * t));
	} else {
		tmp = 1.0;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if y <= -2.15e-120:
		tmp = 1.0 + ((x / y) / (z - y))
	elif y <= 1.7e-66:
		tmp = 1.0 - (x / (z * t))
	else:
		tmp = 1.0
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (y <= -2.15e-120)
		tmp = Float64(1.0 + Float64(Float64(x / y) / Float64(z - y)));
	elseif (y <= 1.7e-66)
		tmp = Float64(1.0 - Float64(x / Float64(z * t)));
	else
		tmp = 1.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if (y <= -2.15e-120)
		tmp = 1.0 + ((x / y) / (z - y));
	elseif (y <= 1.7e-66)
		tmp = 1.0 - (x / (z * t));
	else
		tmp = 1.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[y, -2.15e-120], N[(1.0 + N[(N[(x / y), $MachinePrecision] / N[(z - y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 1.7e-66], N[(1.0 - N[(x / N[(z * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 1.0]]

Derivation

1. Split input into 3 regimes

2. if y < -2.14999999999999991e-120

   1. Initial program 100.0%

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

      1. sub-neg 100.0%

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

      2. neg-mul-1 100.0%

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

      3. *-commutative 100.0%

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

      4. *-commutative 100.0%

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

      5. associate-/r* 99.0%

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

      6. associate-*r/ 99.0%

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

      7. metadata-eval 99.0%

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

      8. times-frac 99.0%

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

      9. *-lft-identity 99.0%

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

      10. neg-mul-1 99.0%

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

      11. sub-neg 99.0%

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

      12. +-commutative 99.0%

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

      13. distribute-neg-out 99.0%

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

      14. remove-double-neg 99.0%

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

      15. sub-neg 99.0%

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

   3. Simplified 99.0%

      \[\leadsto \color{blue}{1 + \frac{\frac{x}{z - y}}{y - t}} \]
   4. Add Preprocessing
   5. Step-by-step derivation

      1. clear-num 99.0%

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

      2. inv-pow 99.0%

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

      3. div-inv 99.0%

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

      4. clear-num 99.0%

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

   6. Applied egg-rr 99.0%

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

      1. unpow-1 99.0%

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

      2. associate-/r* 99.0%

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

   8. Simplified 99.0%

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

   9. Taylor expanded in t around 0 91.5%

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

       1. associate-/r* 91.5%

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

   11. Simplified 91.5%

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

   if -2.14999999999999991e-120 < y < 1.69999999999999999e-66

   1. Initial program 95.5%

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

   3. Taylor expanded in y around 0 76.7%

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

   if 1.69999999999999999e-66 < y

   1. Initial program 100.0%

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

      1. sub-neg 100.0%

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

      2. neg-mul-1 100.0%

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

      3. *-commutative 100.0%

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

      4. *-commutative 100.0%

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

      5. associate-/r* 99.9%

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

      6. associate-*r/ 99.9%

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

      7. metadata-eval 99.9%

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

      8. times-frac 99.9%

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

      9. *-lft-identity 99.9%

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

      10. neg-mul-1 99.9%

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

      11. sub-neg 99.9%

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

      12. +-commutative 99.9%

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

      13. distribute-neg-out 99.9%

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

      14. remove-double-neg 99.9%

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

      15. sub-neg 99.9%

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

   3. Simplified 99.9%

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

   5. Taylor expanded in t around inf 79.6%

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

      1. associate-*r/ 79.6%

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

      2. neg-mul-1 79.6%

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

      3. associate-/r* 79.6%

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

   7. Simplified 79.6%

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

   8. Taylor expanded in x around 0 94.2%

      \[\leadsto \color{blue}{1} \]
3. Recombined 3 regimes into one program.

4. Final simplification 87.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -2.15 \cdot 10^{-120}:\\ \;\;\;\;1 + \frac{\frac{x}{y}}{z - y}\\ \mathbf{elif}\;y \leq 1.7 \cdot 10^{-66}:\\ \;\;\;\;1 - \frac{x}{z \cdot t}\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \]
5. Add Preprocessing

Alternative 8: 98.2% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ 1 + \frac{\frac{x}{z - y}}{y - t} \end{array} \]

FPCore

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

C

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 98.5%

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

   1. sub-neg 98.5%

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

   2. neg-mul-1 98.5%

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

   3. *-commutative 98.5%

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

   4. *-commutative 98.5%

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

   5. associate-/r* 98.5%

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

   6. associate-*r/ 98.5%

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

   7. metadata-eval 98.5%

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

   8. times-frac 98.5%

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

   9. *-lft-identity 98.5%

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

   10. neg-mul-1 98.5%

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

   11. sub-neg 98.5%

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

   12. +-commutative 98.5%

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

   13. distribute-neg-out 98.5%

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

   14. remove-double-neg 98.5%

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

   15. sub-neg 98.5%

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

3. Simplified 98.5%

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

5. Final simplification 98.5%

   \[\leadsto 1 + \frac{\frac{x}{z - y}}{y - t} \]
6. Add Preprocessing

Alternative 9: 75.5% accurate, 11.0× speedup

Math

\[\begin{array}{l} \\ 1 \end{array} \]

FPCore

(FPCore (x y z t) :precision binary64 1.0)

C

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

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 = 1.0d0
end function

Java

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

Python

def code(x, y, z, t):
	return 1.0

Julia

function code(x, y, z, t)
	return 1.0
end

MATLAB

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

Wolfram

code[x_, y_, z_, t_] := 1.0

Derivation

1. Initial program 98.5%

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

   1. sub-neg 98.5%

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

   2. neg-mul-1 98.5%

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

   3. *-commutative 98.5%

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

   4. *-commutative 98.5%

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

   5. associate-/r* 98.5%

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

   6. associate-*r/ 98.5%

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

   7. metadata-eval 98.5%

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

   8. times-frac 98.5%

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

   9. *-lft-identity 98.5%

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

   10. neg-mul-1 98.5%

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

   11. sub-neg 98.5%

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

   12. +-commutative 98.5%

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

   13. distribute-neg-out 98.5%

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

   14. remove-double-neg 98.5%

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

   15. sub-neg 98.5%

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

3. Simplified 98.5%

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

5. Taylor expanded in t around inf 78.4%

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

   1. associate-*r/ 78.4%

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

   2. neg-mul-1 78.4%

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

   3. associate-/r* 78.7%

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

7. Simplified 78.7%

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

8. Taylor expanded in x around 0 75.5%

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

9. Final simplification 75.5%

   \[\leadsto 1 \]
10. Add Preprocessing

Reproduce

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