System.Random.MWC.Distributions:truncatedExp from mwc-random-0.13.3.2

Percentage Accurate: 61.4% → 98.2%

Time: 19.2s

Alternatives: 9

Speedup: 211.0×

• could not determine a ground truth

  1. x = 523552370997509950.0
  2. y = 4.709290020118478e-214
  3. z = 1.649850814861735e+170
  4. t = -2.9488500626365057e-93

Specification

Math

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

FPCore

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

C

double code(double x, double y, double z, double t) {
	return x - (log(((1.0 - y) + (y * exp(z)))) / 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 = x - (log(((1.0d0 - y) + (y * exp(z)))) / t)
end function

Java

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

Python

def code(x, y, z, t):
	return x - (math.log(((1.0 - y) + (y * math.exp(z)))) / t)

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 61.4% accurate, 1.0× speedup

Math

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

FPCore

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

C

double code(double x, double y, double z, double t) {
	return x - (log(((1.0 - y) + (y * exp(z)))) / 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 = x - (log(((1.0d0 - y) + (y * exp(z)))) / t)
end function

Java

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

Python

def code(x, y, z, t):
	return x - (math.log(((1.0 - y) + (y * math.exp(z)))) / t)

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 98.2% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

def code(x, y, z, t):
	return x - (math.log1p((y * math.expm1(z))) / t)

Julia

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

Wolfram

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

Derivation

1. Initial program 63.8%

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

   1. associate-+l- 76.1%

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

   2. sub-neg 76.1%

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

   3. log1p-define 83.6%

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

   4. neg-sub0 83.6%

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

   5. associate-+l- 83.6%

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

   6. neg-sub0 83.6%

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

   7. +-commutative 83.6%

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

   8. unsub-neg 83.6%

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

   9. *-rgt-identity 83.6%

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

   10. distribute-lft-out-- 83.6%

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

   11. expm1-define 99.4%

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

3. Simplified 99.4%

   \[\leadsto \color{blue}{x - \frac{\mathsf{log1p}\left(y \cdot \mathsf{expm1}\left(z\right)\right)}{t}} \]
4. Add Preprocessing
5. Add Preprocessing

Alternative 2: 93.6% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;e^{z} \leq 0.95:\\ \;\;\;\;x + \frac{1}{\frac{\frac{t}{1 - e^{z}} - 0.5 \cdot \left(y \cdot t\right)}{y}}\\ \mathbf{else}:\\ \;\;\;\;x - \frac{\mathsf{log1p}\left(z \cdot \left(y + 0.5 \cdot \left(y \cdot z\right)\right)\right)}{t}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= (exp z) 0.95)
   (+ x (/ 1.0 (/ (- (/ t (- 1.0 (exp z))) (* 0.5 (* y t))) y)))
   (- x (/ (log1p (* z (+ y (* 0.5 (* y z))))) t))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (exp(z) <= 0.95) {
		tmp = x + (1.0 / (((t / (1.0 - exp(z))) - (0.5 * (y * t))) / y));
	} else {
		tmp = x - (log1p((z * (y + (0.5 * (y * z))))) / t);
	}
	return tmp;
}

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if (Math.exp(z) <= 0.95) {
		tmp = x + (1.0 / (((t / (1.0 - Math.exp(z))) - (0.5 * (y * t))) / y));
	} else {
		tmp = x - (Math.log1p((z * (y + (0.5 * (y * z))))) / t);
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if math.exp(z) <= 0.95:
		tmp = x + (1.0 / (((t / (1.0 - math.exp(z))) - (0.5 * (y * t))) / y))
	else:
		tmp = x - (math.log1p((z * (y + (0.5 * (y * z))))) / t)
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (exp(z) <= 0.95)
		tmp = Float64(x + Float64(1.0 / Float64(Float64(Float64(t / Float64(1.0 - exp(z))) - Float64(0.5 * Float64(y * t))) / y)));
	else
		tmp = Float64(x - Float64(log1p(Float64(z * Float64(y + Float64(0.5 * Float64(y * z))))) / t));
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[N[Exp[z], $MachinePrecision], 0.95], N[(x + N[(1.0 / N[(N[(N[(t / N[(1.0 - N[Exp[z], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(0.5 * N[(y * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(x - N[(N[Log[1 + N[(z * N[(y + N[(0.5 * N[(y * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (exp.f64 z) < 0.94999999999999996

   1. Initial program 79.4%

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

      1. associate-+l- 79.4%

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

      2. sub-neg 79.4%

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

      3. log1p-define 99.8%

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

      4. neg-sub0 99.8%

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

      5. associate-+l- 99.8%

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

      6. neg-sub0 99.8%

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

      7. +-commutative 99.8%

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

      8. unsub-neg 99.8%

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

      9. *-rgt-identity 99.8%

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

      10. distribute-lft-out-- 99.8%

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

      11. expm1-define 99.8%

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

   3. Simplified 99.8%

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

      1. clear-num 99.8%

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

      2. inv-pow 99.8%

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

   6. Applied egg-rr 99.8%

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

      1. unpow-1 99.8%

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

   8. Applied egg-rr 99.8%

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

   9. Taylor expanded in y around 0 80.8%

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

   if 0.94999999999999996 < (exp.f64 z)

   1. Initial program 55.2%

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

      1. associate-+l- 74.2%

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

      2. sub-neg 74.2%

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

      3. log1p-define 74.7%

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

      4. neg-sub0 74.7%

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

      5. associate-+l- 74.7%

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

      6. neg-sub0 74.7%

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

      7. +-commutative 74.7%

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

      8. unsub-neg 74.7%

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

      9. *-rgt-identity 74.7%

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

      10. distribute-lft-out-- 74.7%

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

      11. expm1-define 99.1%

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

   3. Simplified 99.1%

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

   5. Taylor expanded in z around 0 98.9%

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

4. Final simplification 92.5%

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

Alternative 3: 92.2% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -250 \lor \neg \left(y \leq 2\right):\\ \;\;\;\;x - \frac{\mathsf{log1p}\left(y \cdot z\right)}{t}\\ \mathbf{else}:\\ \;\;\;\;x - y \cdot \frac{\mathsf{expm1}\left(z\right)}{t}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (or (<= y -250.0) (not (<= y 2.0)))
   (- x (/ (log1p (* y z)) t))
   (- x (* y (/ (expm1 z) t)))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if ((y <= -250.0) || !(y <= 2.0)) {
		tmp = x - (log1p((y * z)) / t);
	} else {
		tmp = x - (y * (expm1(z) / t));
	}
	return tmp;
}

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if ((y <= -250.0) || !(y <= 2.0)) {
		tmp = x - (Math.log1p((y * z)) / t);
	} else {
		tmp = x - (y * (Math.expm1(z) / t));
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if (y <= -250.0) or not (y <= 2.0):
		tmp = x - (math.log1p((y * z)) / t)
	else:
		tmp = x - (y * (math.expm1(z) / t))
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if ((y <= -250.0) || !(y <= 2.0))
		tmp = Float64(x - Float64(log1p(Float64(y * z)) / t));
	else
		tmp = Float64(x - Float64(y * Float64(expm1(z) / t)));
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_] := If[Or[LessEqual[y, -250.0], N[Not[LessEqual[y, 2.0]], $MachinePrecision]], N[(x - N[(N[Log[1 + N[(y * z), $MachinePrecision]], $MachinePrecision] / t), $MachinePrecision]), $MachinePrecision], N[(x - N[(y * N[(N[(Exp[z] - 1), $MachinePrecision] / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -250 or 2 < y

   1. Initial program 35.2%

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

      1. associate-+l- 69.3%

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

      2. sub-neg 69.3%

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

      3. log1p-define 69.3%

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

      4. neg-sub0 69.3%

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

      5. associate-+l- 69.3%

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

      6. neg-sub0 69.3%

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

      7. +-commutative 69.3%

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

      8. unsub-neg 69.3%

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

      9. *-rgt-identity 69.3%

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

      10. distribute-lft-out-- 69.3%

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

      11. expm1-define 99.8%

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

   3. Simplified 99.8%

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

      1. clear-num 99.7%

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

      2. associate-/r/ 99.7%

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

   6. Applied egg-rr 99.7%

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

   7. Taylor expanded in z around 0 77.3%

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

   8. Taylor expanded in x around 0 63.1%

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

      1. log1p-define 77.4%

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

   10. Simplified 77.4%

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

   if -250 < y < 2

   1. Initial program 79.9%

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

      1. associate-+l- 79.9%

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

      2. sub-neg 79.9%

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

      3. log1p-define 91.7%

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

      4. neg-sub0 91.7%

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

      5. associate-+l- 91.7%

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

      6. neg-sub0 91.7%

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

      7. +-commutative 91.7%

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

      8. unsub-neg 91.7%

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

      9. *-rgt-identity 91.7%

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

      10. distribute-lft-out-- 91.7%

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

      11. expm1-define 99.1%

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

   3. Simplified 99.1%

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

   5. Taylor expanded in y around 0 90.5%

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

      1. associate-/l* 90.5%

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

      2. expm1-define 98.7%

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

   7. Simplified 98.7%

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

4. Final simplification 91.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -250 \lor \neg \left(y \leq 2\right):\\ \;\;\;\;x - \frac{\mathsf{log1p}\left(y \cdot z\right)}{t}\\ \mathbf{else}:\\ \;\;\;\;x - y \cdot \frac{\mathsf{expm1}\left(z\right)}{t}\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 86.8% accurate, 1.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -4.5 \cdot 10^{+129}:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;x - y \cdot \frac{\mathsf{expm1}\left(z\right)}{t}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= y -4.5e+129) x (- x (* y (/ (expm1 z) t)))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (y <= -4.5e+129) {
		tmp = x;
	} else {
		tmp = x - (y * (expm1(z) / t));
	}
	return tmp;
}

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if (y <= -4.5e+129) {
		tmp = x;
	} else {
		tmp = x - (y * (Math.expm1(z) / t));
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if y <= -4.5e+129:
		tmp = x
	else:
		tmp = x - (y * (math.expm1(z) / t))
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (y <= -4.5e+129)
		tmp = x;
	else
		tmp = Float64(x - Float64(y * Float64(expm1(z) / t)));
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[y, -4.5e+129], x, N[(x - N[(y * N[(N[(Exp[z] - 1), $MachinePrecision] / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -4.5000000000000001e129

   1. Initial program 56.8%

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

      1. associate-+l- 80.1%

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

      2. sub-neg 80.1%

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

      3. log1p-define 80.1%

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

      4. neg-sub0 80.1%

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

      5. associate-+l- 80.1%

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

      6. neg-sub0 80.1%

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

      7. +-commutative 80.1%

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

      8. unsub-neg 80.1%

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

      9. *-rgt-identity 80.1%

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

      10. distribute-lft-out-- 80.1%

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

      11. expm1-define 99.6%

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

   3. Simplified 99.6%

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

   5. Taylor expanded in x around inf 47.0%

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

   if -4.5000000000000001e129 < y

   1. Initial program 64.8%

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

      1. associate-+l- 75.6%

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

      2. sub-neg 75.6%

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

      3. log1p-define 84.1%

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

      4. neg-sub0 84.1%

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

      5. associate-+l- 84.1%

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

      6. neg-sub0 84.1%

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

      7. +-commutative 84.1%

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

      8. unsub-neg 84.1%

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

      9. *-rgt-identity 84.1%

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

      10. distribute-lft-out-- 84.1%

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

      11. expm1-define 99.3%

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

   3. Simplified 99.3%

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

   5. Taylor expanded in y around 0 79.7%

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

      1. associate-/l* 79.6%

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

      2. expm1-define 90.6%

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

   7. Simplified 90.6%

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

Alternative 5: 82.1% accurate, 9.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -2.6 \cdot 10^{+16}:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;x + y \cdot \frac{z \cdot \left(-1 - z \cdot \left(0.5 + z \cdot 0.16666666666666666\right)\right)}{t}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= z -2.6e+16)
   x
   (+ x (* y (/ (* z (- -1.0 (* z (+ 0.5 (* z 0.16666666666666666))))) t)))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (z <= -2.6e+16) {
		tmp = x;
	} else {
		tmp = x + (y * ((z * (-1.0 - (z * (0.5 + (z * 0.16666666666666666))))) / 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 <= (-2.6d+16)) then
        tmp = x
    else
        tmp = x + (y * ((z * ((-1.0d0) - (z * (0.5d0 + (z * 0.16666666666666666d0))))) / t))
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if (z <= -2.6e+16) {
		tmp = x;
	} else {
		tmp = x + (y * ((z * (-1.0 - (z * (0.5 + (z * 0.16666666666666666))))) / t));
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if z <= -2.6e+16:
		tmp = x
	else:
		tmp = x + (y * ((z * (-1.0 - (z * (0.5 + (z * 0.16666666666666666))))) / t))
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (z <= -2.6e+16)
		tmp = x;
	else
		tmp = Float64(x + Float64(y * Float64(Float64(z * Float64(-1.0 - Float64(z * Float64(0.5 + Float64(z * 0.16666666666666666))))) / t)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if (z <= -2.6e+16)
		tmp = x;
	else
		tmp = x + (y * ((z * (-1.0 - (z * (0.5 + (z * 0.16666666666666666))))) / t));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[z, -2.6e+16], x, N[(x + N[(y * N[(N[(z * N[(-1.0 - N[(z * N[(0.5 + N[(z * 0.16666666666666666), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -2.6e16

   1. Initial program 81.0%

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

      1. associate-+l- 81.0%

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

      2. sub-neg 81.0%

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

      3. log1p-define 99.9%

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

      4. neg-sub0 99.9%

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

      5. associate-+l- 99.9%

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

      6. neg-sub0 99.9%

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

      7. +-commutative 99.9%

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

      8. unsub-neg 99.9%

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

      9. *-rgt-identity 99.9%

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

      10. distribute-lft-out-- 99.9%

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

      11. expm1-define 99.9%

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

   3. Simplified 99.9%

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

   5. Taylor expanded in x around inf 57.9%

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

   if -2.6e16 < z

   1. Initial program 54.8%

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

      1. associate-+l- 73.5%

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

      2. sub-neg 73.5%

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

      3. log1p-define 75.1%

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

      4. neg-sub0 75.1%

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

      5. associate-+l- 75.1%

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

      6. neg-sub0 75.1%

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

      7. +-commutative 75.1%

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

      8. unsub-neg 75.1%

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

      9. *-rgt-identity 75.1%

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

      10. distribute-lft-out-- 75.1%

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

      11. expm1-define 99.1%

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

   3. Simplified 99.1%

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

   5. Taylor expanded in y around 0 74.7%

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

      1. expm1-define 88.9%

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

   7. Simplified 88.9%

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

   8. Taylor expanded in z around 0 87.9%

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

   9. Taylor expanded in y around 0 87.9%

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

       1. associate-/l* 88.1%

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

       2. *-commutative 88.1%

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

   11. Simplified 88.1%

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

4. Final simplification 77.7%

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

Alternative 6: 71.2% accurate, 13.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;t \leq -1.9 \cdot 10^{-238}:\\ \;\;\;\;x\\ \mathbf{elif}\;t \leq 7.5 \cdot 10^{-198}:\\ \;\;\;\;y \cdot \frac{-z}{t}\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= t -1.9e-238) x (if (<= t 7.5e-198) (* y (/ (- z) t)) x)))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (t <= -1.9e-238) {
		tmp = x;
	} else if (t <= 7.5e-198) {
		tmp = y * (-z / t);
	} else {
		tmp = x;
	}
	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 <= (-1.9d-238)) then
        tmp = x
    else if (t <= 7.5d-198) then
        tmp = y * (-z / t)
    else
        tmp = x
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if (t <= -1.9e-238) {
		tmp = x;
	} else if (t <= 7.5e-198) {
		tmp = y * (-z / t);
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if t <= -1.9e-238:
		tmp = x
	elif t <= 7.5e-198:
		tmp = y * (-z / t)
	else:
		tmp = x
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (t <= -1.9e-238)
		tmp = x;
	elseif (t <= 7.5e-198)
		tmp = Float64(y * Float64(Float64(-z) / t));
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if (t <= -1.9e-238)
		tmp = x;
	elseif (t <= 7.5e-198)
		tmp = y * (-z / t);
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[t, -1.9e-238], x, If[LessEqual[t, 7.5e-198], N[(y * N[((-z) / t), $MachinePrecision]), $MachinePrecision], x]]

Derivation

1. Split input into 2 regimes

2. if t < -1.8999999999999998e-238 or 7.50000000000000064e-198 < t

   1. Initial program 68.1%

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

      1. associate-+l- 82.6%

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

      2. sub-neg 82.6%

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

      3. log1p-define 88.6%

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

      4. neg-sub0 88.6%

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

      5. associate-+l- 88.6%

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

      6. neg-sub0 88.6%

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

      7. +-commutative 88.6%

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

      8. unsub-neg 88.6%

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

      9. *-rgt-identity 88.6%

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

      10. distribute-lft-out-- 88.6%

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

      11. expm1-define 99.7%

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

   3. Simplified 99.7%

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

   5. Taylor expanded in x around inf 77.0%

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

   if -1.8999999999999998e-238 < t < 7.50000000000000064e-198

   1. Initial program 40.8%

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

      1. associate-+l- 41.1%

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

      2. sub-neg 41.1%

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

      3. log1p-define 56.6%

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

      4. neg-sub0 56.6%

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

      5. associate-+l- 56.6%

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

      6. neg-sub0 56.6%

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

      7. +-commutative 56.6%

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

      8. unsub-neg 56.6%

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

      9. *-rgt-identity 56.6%

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

      10. distribute-lft-out-- 56.6%

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

      11. expm1-define 97.3%

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

   3. Simplified 97.3%

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

   5. Taylor expanded in z around 0 47.7%

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

      1. mul-1-neg 47.7%

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

      2. unsub-neg 47.7%

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

      3. associate-/l* 50.0%

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

   7. Simplified 50.0%

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

   8. Taylor expanded in x around 0 38.4%

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

      1. neg-mul-1 38.4%

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

      2. distribute-neg-frac 38.4%

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

      3. distribute-rgt-neg-in 38.4%

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

   10. Simplified 38.4%

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

   11. Taylor expanded in y around 0 38.4%

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

       1. mul-1-neg 38.4%

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

       2. associate-*r/ 40.8%

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

       3. distribute-rgt-neg-in 40.8%

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

       4. distribute-neg-frac2 40.8%

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

   13. Simplified 40.8%

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

4. Final simplification 71.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;t \leq -1.9 \cdot 10^{-238}:\\ \;\;\;\;x\\ \mathbf{elif}\;t \leq 7.5 \cdot 10^{-198}:\\ \;\;\;\;y \cdot \frac{-z}{t}\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 82.0% accurate, 15.1× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= z -2.6e+16) x (+ x (* y (/ -1.0 (/ t z))))))

C

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

Java

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

Python

def code(x, y, z, t):
	tmp = 0
	if z <= -2.6e+16:
		tmp = x
	else:
		tmp = x + (y * (-1.0 / (t / z)))
	return tmp

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < -2.6e16

   1. Initial program 81.0%

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

      1. associate-+l- 81.0%

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

      2. sub-neg 81.0%

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

      3. log1p-define 99.9%

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

      4. neg-sub0 99.9%

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

      5. associate-+l- 99.9%

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

      6. neg-sub0 99.9%

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

      7. +-commutative 99.9%

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

      8. unsub-neg 99.9%

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

      9. *-rgt-identity 99.9%

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

      10. distribute-lft-out-- 99.9%

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

      11. expm1-define 99.9%

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

   3. Simplified 99.9%

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

   5. Taylor expanded in x around inf 57.9%

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

   if -2.6e16 < z

   1. Initial program 54.8%

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

      1. associate-+l- 73.5%

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

      2. sub-neg 73.5%

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

      3. log1p-define 75.1%

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

      4. neg-sub0 75.1%

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

      5. associate-+l- 75.1%

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

      6. neg-sub0 75.1%

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

      7. +-commutative 75.1%

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

      8. unsub-neg 75.1%

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

      9. *-rgt-identity 75.1%

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

      10. distribute-lft-out-- 75.1%

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

      11. expm1-define 99.1%

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

   3. Simplified 99.1%

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

   5. Taylor expanded in z around 0 87.5%

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

      1. mul-1-neg 87.5%

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

      2. unsub-neg 87.5%

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

      3. associate-/l* 87.7%

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

   7. Simplified 87.7%

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

      1. clear-num 87.7%

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

      2. inv-pow 87.7%

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

   9. Applied egg-rr 87.7%

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

       1. unpow-1 87.7%

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

   11. Simplified 87.7%

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

4. Final simplification 77.5%

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

Alternative 8: 82.0% accurate, 17.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -2.6 \cdot 10^{+16}:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;x - y \cdot \frac{z}{t}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= z -2.6e+16) x (- x (* y (/ z t)))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (z <= -2.6e+16) {
		tmp = x;
	} else {
		tmp = x - (y * (z / 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 <= (-2.6d+16)) then
        tmp = x
    else
        tmp = x - (y * (z / t))
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if (z <= -2.6e+16) {
		tmp = x;
	} else {
		tmp = x - (y * (z / t));
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if z <= -2.6e+16:
		tmp = x
	else:
		tmp = x - (y * (z / t))
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (z <= -2.6e+16)
		tmp = x;
	else
		tmp = Float64(x - Float64(y * Float64(z / t)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if (z <= -2.6e+16)
		tmp = x;
	else
		tmp = x - (y * (z / t));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[z, -2.6e+16], x, N[(x - N[(y * N[(z / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -2.6e16

   1. Initial program 81.0%

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

      1. associate-+l- 81.0%

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

      2. sub-neg 81.0%

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

      3. log1p-define 99.9%

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

      4. neg-sub0 99.9%

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

      5. associate-+l- 99.9%

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

      6. neg-sub0 99.9%

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

      7. +-commutative 99.9%

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

      8. unsub-neg 99.9%

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

      9. *-rgt-identity 99.9%

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

      10. distribute-lft-out-- 99.9%

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

      11. expm1-define 99.9%

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

   3. Simplified 99.9%

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

   5. Taylor expanded in x around inf 57.9%

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

   if -2.6e16 < z

   1. Initial program 54.8%

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

      1. associate-+l- 73.5%

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

      2. sub-neg 73.5%

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

      3. log1p-define 75.1%

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

      4. neg-sub0 75.1%

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

      5. associate-+l- 75.1%

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

      6. neg-sub0 75.1%

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

      7. +-commutative 75.1%

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

      8. unsub-neg 75.1%

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

      9. *-rgt-identity 75.1%

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

      10. distribute-lft-out-- 75.1%

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

      11. expm1-define 99.1%

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

   3. Simplified 99.1%

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

   5. Taylor expanded in z around 0 87.5%

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

      1. mul-1-neg 87.5%

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

      2. unsub-neg 87.5%

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

      3. associate-/l* 87.7%

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

   7. Simplified 87.7%

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

Alternative 9: 71.7% accurate, 211.0× speedup

Math

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

FPCore

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

C

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

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
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 63.8%

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

   1. associate-+l- 76.1%

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

   2. sub-neg 76.1%

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

   3. log1p-define 83.6%

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

   4. neg-sub0 83.6%

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

   5. associate-+l- 83.6%

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

   6. neg-sub0 83.6%

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

   7. +-commutative 83.6%

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

   8. unsub-neg 83.6%

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

   9. *-rgt-identity 83.6%

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

   10. distribute-lft-out-- 83.6%

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

   11. expm1-define 99.4%

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

3. Simplified 99.4%

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

5. Taylor expanded in x around inf 67.8%

   \[\leadsto \color{blue}{x} \]
6. Add Preprocessing

Developer Target 1: 74.5% accurate, 1.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{-0.5}{y \cdot t}\\ \mathbf{if}\;z < -2.8874623088207947 \cdot 10^{+119}:\\ \;\;\;\;\left(x - \frac{t\_1}{z \cdot z}\right) - t\_1 \cdot \frac{\frac{2}{z}}{z \cdot z}\\ \mathbf{else}:\\ \;\;\;\;x - \frac{\log \left(1 + z \cdot y\right)}{t}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (/ (- 0.5) (* y t))))
   (if (< z -2.8874623088207947e+119)
     (- (- x (/ t_1 (* z z))) (* t_1 (/ (/ 2.0 z) (* z z))))
     (- x (/ (log (+ 1.0 (* z y))) t)))))

C

double code(double x, double y, double z, double t) {
	double t_1 = -0.5 / (y * t);
	double tmp;
	if (z < -2.8874623088207947e+119) {
		tmp = (x - (t_1 / (z * z))) - (t_1 * ((2.0 / z) / (z * z)));
	} else {
		tmp = x - (log((1.0 + (z * 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) :: t_1
    real(8) :: tmp
    t_1 = -0.5d0 / (y * t)
    if (z < (-2.8874623088207947d+119)) then
        tmp = (x - (t_1 / (z * z))) - (t_1 * ((2.0d0 / z) / (z * z)))
    else
        tmp = x - (log((1.0d0 + (z * y))) / t)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double t_1 = -0.5 / (y * t);
	double tmp;
	if (z < -2.8874623088207947e+119) {
		tmp = (x - (t_1 / (z * z))) - (t_1 * ((2.0 / z) / (z * z)));
	} else {
		tmp = x - (Math.log((1.0 + (z * y))) / t);
	}
	return tmp;
}

Python

def code(x, y, z, t):
	t_1 = -0.5 / (y * t)
	tmp = 0
	if z < -2.8874623088207947e+119:
		tmp = (x - (t_1 / (z * z))) - (t_1 * ((2.0 / z) / (z * z)))
	else:
		tmp = x - (math.log((1.0 + (z * y))) / t)
	return tmp

Julia

function code(x, y, z, t)
	t_1 = Float64(Float64(-0.5) / Float64(y * t))
	tmp = 0.0
	if (z < -2.8874623088207947e+119)
		tmp = Float64(Float64(x - Float64(t_1 / Float64(z * z))) - Float64(t_1 * Float64(Float64(2.0 / z) / Float64(z * z))));
	else
		tmp = Float64(x - Float64(log(Float64(1.0 + Float64(z * y))) / t));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	t_1 = -0.5 / (y * t);
	tmp = 0.0;
	if (z < -2.8874623088207947e+119)
		tmp = (x - (t_1 / (z * z))) - (t_1 * ((2.0 / z) / (z * z)));
	else
		tmp = x - (log((1.0 + (z * y))) / t);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[((-0.5) / N[(y * t), $MachinePrecision]), $MachinePrecision]}, If[Less[z, -2.8874623088207947e+119], N[(N[(x - N[(t$95$1 / N[(z * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(t$95$1 * N[(N[(2.0 / z), $MachinePrecision] / N[(z * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(x - N[(N[Log[N[(1.0 + N[(z * y), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t), $MachinePrecision]), $MachinePrecision]]]

Reproduce

herbie shell --seed 2024165 
(FPCore (x y z t)
  :name "System.Random.MWC.Distributions:truncatedExp from mwc-random-0.13.3.2"
  :precision binary64

  :alt
  (! :herbie-platform default (if (< z -288746230882079470000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) (- (- x (/ (/ (- 1/2) (* y t)) (* z z))) (* (/ (- 1/2) (* y t)) (/ (/ 2 z) (* z z)))) (- x (/ (log (+ 1 (* z y))) t))))

  (- x (/ (log (+ (- 1.0 y) (* y (exp z)))) t)))