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

Percentage Accurate: 62.2% → 98.5%

Time: 16.1s

Alternatives: 12

Speedup: 211.0×

• could not determine a ground truth

  1. x = -4.2419929373802806e+127
  2. y = 0.09995362062313475
  3. z = 2.77788659639765e+82
  4. t = -2.637159216325127e-264

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: 62.2% 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.5% 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 57.6%

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

   1. associate-+l- 75.1%

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

   2. sub-neg 75.1%

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

   3. log1p-define 83.0%

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

   4. neg-sub0 83.0%

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

   5. associate-+l- 83.0%

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

   6. neg-sub0 83.0%

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

   7. +-commutative 83.0%

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

   8. unsub-neg 83.0%

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

   9. *-rgt-identity 83.0%

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

   10. distribute-lft-out-- 83.0%

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

   11. expm1-define 98.8%

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

3. Simplified 98.8%

   \[\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: 91.4% accurate, 1.7× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= z -2.25e+23)
   (- x (* (expm1 z) (/ y t)))
   (-
    x
    (/
     (log1p (* z (+ y (* z (+ (* 0.16666666666666666 (* y z)) (* y 0.5))))))
     t))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (z <= -2.25e+23) {
		tmp = x - (expm1(z) * (y / t));
	} else {
		tmp = x - (log1p((z * (y + (z * ((0.16666666666666666 * (y * z)) + (y * 0.5)))))) / t);
	}
	return tmp;
}

Java

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

Python

def code(x, y, z, t):
	tmp = 0
	if z <= -2.25e+23:
		tmp = x - (math.expm1(z) * (y / t))
	else:
		tmp = x - (math.log1p((z * (y + (z * ((0.16666666666666666 * (y * z)) + (y * 0.5)))))) / t)
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (z <= -2.25e+23)
		tmp = Float64(x - Float64(expm1(z) * Float64(y / t)));
	else
		tmp = Float64(x - Float64(log1p(Float64(z * Float64(y + Float64(z * Float64(Float64(0.16666666666666666 * Float64(y * z)) + Float64(y * 0.5)))))) / t));
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < -2.2499999999999999e23

   1. Initial program 72.0%

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

      1. associate-+l- 72.0%

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

      2. sub-neg 72.0%

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

      3. log1p-define 100.0%

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

      4. neg-sub0 100.0%

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

      5. associate-+l- 100.0%

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

      6. neg-sub0 100.0%

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

      7. +-commutative 100.0%

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

      8. unsub-neg 100.0%

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

      9. *-rgt-identity 100.0%

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

      10. distribute-lft-out-- 100.0%

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

      11. expm1-define 100.0%

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

   3. Simplified 100.0%

      \[\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 84.8%

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

      1. *-commutative 84.8%

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

      2. associate-/l* 84.8%

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

      3. expm1-define 84.8%

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

   7. Simplified 84.8%

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

   if -2.2499999999999999e23 < z

   1. Initial program 52.7%

      \[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 77.2%

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

      4. neg-sub0 77.2%

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

      5. associate-+l- 77.2%

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

      6. neg-sub0 77.2%

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

      7. +-commutative 77.2%

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

      8. unsub-neg 77.2%

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

      9. *-rgt-identity 77.2%

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

      10. distribute-lft-out-- 77.2%

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

      11. expm1-define 98.4%

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

   3. Simplified 98.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 z around 0 97.0%

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

4. Final simplification 93.9%

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

Alternative 3: 92.6% accurate, 1.7× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if y < -190

   1. Initial program 37.3%

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

      1. associate-+l- 74.3%

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

      2. sub-neg 74.3%

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

      3. log1p-define 74.3%

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

      4. neg-sub0 74.3%

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

      5. associate-+l- 74.3%

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

      6. neg-sub0 74.3%

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

      7. +-commutative 74.3%

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

      8. unsub-neg 74.3%

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

      9. *-rgt-identity 74.3%

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

      10. distribute-lft-out-- 74.4%

          \[\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 z around 0 74.6%

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

      1. clear-num 74.7%

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

      2. inv-pow 74.7%

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

   7. Applied egg-rr 74.7%

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

      1. unpow-1 74.7%

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

   9. Simplified 74.7%

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

   if -190 < y < 8.1999999999999998e-4

   1. Initial program 78.2%

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

      1. associate-+l- 78.8%

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

      2. sub-neg 78.8%

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

      3. log1p-define 91.3%

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

      4. neg-sub0 91.3%

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

      5. associate-+l- 91.3%

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

      6. neg-sub0 91.3%

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

      7. +-commutative 91.3%

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

      8. unsub-neg 91.3%

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

      9. *-rgt-identity 91.3%

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

      10. distribute-lft-out-- 91.2%

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

      11. expm1-define 98.2%

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

   3. Simplified 98.2%

      \[\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 91.0%

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

      1. *-commutative 91.0%

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

      2. associate-/l* 91.0%

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

      3. expm1-define 99.8%

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

   7. Simplified 99.8%

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

   if 8.1999999999999998e-4 < y

   1. Initial program 7.7%

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

      1. associate-+l- 63.1%

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

      2. sub-neg 63.1%

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

      3. log1p-define 63.5%

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

      4. neg-sub0 63.5%

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

      5. associate-+l- 63.5%

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

      6. neg-sub0 63.5%

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

      7. +-commutative 63.5%

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

      8. unsub-neg 63.5%

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

      9. *-rgt-identity 63.5%

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

      10. distribute-lft-out-- 63.6%

          \[\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. Taylor expanded in z around 0 99.5%

      \[\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 3 regimes into one program.

4. Final simplification 95.2%

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

Alternative 4: 90.9% accurate, 1.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \mathsf{log1p}\left(y \cdot z\right)\\ \mathbf{if}\;y \leq -19:\\ \;\;\;\;x + \frac{-1}{\frac{t}{t\_1}}\\ \mathbf{elif}\;y \leq 1.4 \cdot 10^{+60}:\\ \;\;\;\;x - \mathsf{expm1}\left(z\right) \cdot \frac{y}{t}\\ \mathbf{else}:\\ \;\;\;\;x \cdot \left(1 - \frac{t\_1}{x \cdot t}\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (log1p (* y z))))
   (if (<= y -19.0)
     (+ x (/ -1.0 (/ t t_1)))
     (if (<= y 1.4e+60)
       (- x (* (expm1 z) (/ y t)))
       (* x (- 1.0 (/ t_1 (* x t))))))))

C

double code(double x, double y, double z, double t) {
	double t_1 = log1p((y * z));
	double tmp;
	if (y <= -19.0) {
		tmp = x + (-1.0 / (t / t_1));
	} else if (y <= 1.4e+60) {
		tmp = x - (expm1(z) * (y / t));
	} else {
		tmp = x * (1.0 - (t_1 / (x * t)));
	}
	return tmp;
}

Java

public static double code(double x, double y, double z, double t) {
	double t_1 = Math.log1p((y * z));
	double tmp;
	if (y <= -19.0) {
		tmp = x + (-1.0 / (t / t_1));
	} else if (y <= 1.4e+60) {
		tmp = x - (Math.expm1(z) * (y / t));
	} else {
		tmp = x * (1.0 - (t_1 / (x * t)));
	}
	return tmp;
}

Python

def code(x, y, z, t):
	t_1 = math.log1p((y * z))
	tmp = 0
	if y <= -19.0:
		tmp = x + (-1.0 / (t / t_1))
	elif y <= 1.4e+60:
		tmp = x - (math.expm1(z) * (y / t))
	else:
		tmp = x * (1.0 - (t_1 / (x * t)))
	return tmp

Julia

function code(x, y, z, t)
	t_1 = log1p(Float64(y * z))
	tmp = 0.0
	if (y <= -19.0)
		tmp = Float64(x + Float64(-1.0 / Float64(t / t_1)));
	elseif (y <= 1.4e+60)
		tmp = Float64(x - Float64(expm1(z) * Float64(y / t)));
	else
		tmp = Float64(x * Float64(1.0 - Float64(t_1 / Float64(x * t))));
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[Log[1 + N[(y * z), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[y, -19.0], N[(x + N[(-1.0 / N[(t / t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 1.4e+60], N[(x - N[(N[(Exp[z] - 1), $MachinePrecision] * N[(y / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(x * N[(1.0 - N[(t$95$1 / N[(x * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if y < -19

   1. Initial program 37.3%

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

      1. associate-+l- 74.3%

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

      2. sub-neg 74.3%

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

      3. log1p-define 74.3%

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

      4. neg-sub0 74.3%

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

      5. associate-+l- 74.3%

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

      6. neg-sub0 74.3%

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

      7. +-commutative 74.3%

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

      8. unsub-neg 74.3%

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

      9. *-rgt-identity 74.3%

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

      10. distribute-lft-out-- 74.4%

          \[\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 z around 0 74.6%

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

      1. clear-num 74.7%

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

      2. inv-pow 74.7%

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

   7. Applied egg-rr 74.7%

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

      1. unpow-1 74.7%

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

   9. Simplified 74.7%

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

   if -19 < y < 1.4e60

   1. Initial program 74.5%

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

      1. associate-+l- 78.3%

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

      2. sub-neg 78.3%

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

      3. log1p-define 90.0%

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

      4. neg-sub0 90.0%

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

      5. associate-+l- 90.0%

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

      6. neg-sub0 90.0%

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

      7. +-commutative 90.0%

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

      8. unsub-neg 90.0%

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

      9. *-rgt-identity 90.0%

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

      10. distribute-lft-out-- 90.0%

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

      11. expm1-define 98.3%

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

   3. Simplified 98.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 89.8%

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

      1. *-commutative 89.8%

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

      2. associate-/l* 89.8%

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

      3. expm1-define 99.6%

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

   7. Simplified 99.6%

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

   if 1.4e60 < y

   1. Initial program 2.4%

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

      1. associate-+l- 60.1%

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

      2. sub-neg 60.1%

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

      3. log1p-define 60.1%

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

      4. neg-sub0 60.1%

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

      5. associate-+l- 60.1%

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

      6. neg-sub0 60.1%

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

      7. +-commutative 60.1%

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

      8. unsub-neg 60.1%

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

      9. *-rgt-identity 60.1%

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

      10. distribute-lft-out-- 60.1%

          \[\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. Taylor expanded in x around inf 60.1%

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

      1. mul-1-neg 60.1%

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

      2. unsub-neg 60.1%

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

      3. log1p-define 60.1%

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

      4. expm1-define 99.9%

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

   7. Simplified 99.9%

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

   8. Taylor expanded in z around 0 99.9%

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

4. Final simplification 95.2%

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

Alternative 5: 92.4% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -680 \lor \neg \left(y \leq 1.35 \cdot 10^{+60}\right):\\ \;\;\;\;x - \frac{\mathsf{log1p}\left(y \cdot z\right)}{t}\\ \mathbf{else}:\\ \;\;\;\;x - \mathsf{expm1}\left(z\right) \cdot \frac{y}{t}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (or (<= y -680.0) (not (<= y 1.35e+60)))
   (- x (/ (log1p (* y z)) t))
   (- x (* (expm1 z) (/ y t)))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if ((y <= -680.0) || !(y <= 1.35e+60)) {
		tmp = x - (log1p((y * z)) / t);
	} else {
		tmp = x - (expm1(z) * (y / t));
	}
	return tmp;
}

Java

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

Python

def code(x, y, z, t):
	tmp = 0
	if (y <= -680.0) or not (y <= 1.35e+60):
		tmp = x - (math.log1p((y * z)) / t)
	else:
		tmp = x - (math.expm1(z) * (y / t))
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if ((y <= -680.0) || !(y <= 1.35e+60))
		tmp = Float64(x - Float64(log1p(Float64(y * z)) / t));
	else
		tmp = Float64(x - Float64(expm1(z) * Float64(y / t)));
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < -680 or 1.35e60 < y

   1. Initial program 22.0%

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

      1. associate-+l- 68.1%

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

      2. sub-neg 68.1%

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

      3. log1p-define 68.1%

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

      4. neg-sub0 68.1%

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

      5. associate-+l- 68.1%

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

      6. neg-sub0 68.1%

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

      7. +-commutative 68.1%

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

      8. unsub-neg 68.1%

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

      9. *-rgt-identity 68.1%

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

      10. distribute-lft-out-- 68.1%

          \[\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. Taylor expanded in z around 0 85.7%

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

   if -680 < y < 1.35e60

   1. Initial program 74.5%

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

      1. associate-+l- 78.3%

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

      2. sub-neg 78.3%

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

      3. log1p-define 90.0%

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

      4. neg-sub0 90.0%

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

      5. associate-+l- 90.0%

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

      6. neg-sub0 90.0%

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

      7. +-commutative 90.0%

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

      8. unsub-neg 90.0%

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

      9. *-rgt-identity 90.0%

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

      10. distribute-lft-out-- 90.0%

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

      11. expm1-define 98.3%

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

   3. Simplified 98.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 89.8%

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

      1. *-commutative 89.8%

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

      2. associate-/l* 89.8%

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

      3. expm1-define 99.6%

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

   7. Simplified 99.6%

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

4. Final simplification 95.1%

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

Alternative 6: 92.4% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \mathsf{log1p}\left(y \cdot z\right)\\ \mathbf{if}\;y \leq -290:\\ \;\;\;\;x + \frac{-1}{\frac{t}{t\_1}}\\ \mathbf{elif}\;y \leq 1.35 \cdot 10^{+60}:\\ \;\;\;\;x - \mathsf{expm1}\left(z\right) \cdot \frac{y}{t}\\ \mathbf{else}:\\ \;\;\;\;x - \frac{t\_1}{t}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (log1p (* y z))))
   (if (<= y -290.0)
     (+ x (/ -1.0 (/ t t_1)))
     (if (<= y 1.35e+60) (- x (* (expm1 z) (/ y t))) (- x (/ t_1 t))))))

C

double code(double x, double y, double z, double t) {
	double t_1 = log1p((y * z));
	double tmp;
	if (y <= -290.0) {
		tmp = x + (-1.0 / (t / t_1));
	} else if (y <= 1.35e+60) {
		tmp = x - (expm1(z) * (y / t));
	} else {
		tmp = x - (t_1 / t);
	}
	return tmp;
}

Java

public static double code(double x, double y, double z, double t) {
	double t_1 = Math.log1p((y * z));
	double tmp;
	if (y <= -290.0) {
		tmp = x + (-1.0 / (t / t_1));
	} else if (y <= 1.35e+60) {
		tmp = x - (Math.expm1(z) * (y / t));
	} else {
		tmp = x - (t_1 / t);
	}
	return tmp;
}

Python

def code(x, y, z, t):
	t_1 = math.log1p((y * z))
	tmp = 0
	if y <= -290.0:
		tmp = x + (-1.0 / (t / t_1))
	elif y <= 1.35e+60:
		tmp = x - (math.expm1(z) * (y / t))
	else:
		tmp = x - (t_1 / t)
	return tmp

Julia

function code(x, y, z, t)
	t_1 = log1p(Float64(y * z))
	tmp = 0.0
	if (y <= -290.0)
		tmp = Float64(x + Float64(-1.0 / Float64(t / t_1)));
	elseif (y <= 1.35e+60)
		tmp = Float64(x - Float64(expm1(z) * Float64(y / t)));
	else
		tmp = Float64(x - Float64(t_1 / t));
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[Log[1 + N[(y * z), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[y, -290.0], N[(x + N[(-1.0 / N[(t / t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 1.35e+60], N[(x - N[(N[(Exp[z] - 1), $MachinePrecision] * N[(y / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(x - N[(t$95$1 / t), $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if y < -290

   1. Initial program 37.3%

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

      1. associate-+l- 74.3%

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

      2. sub-neg 74.3%

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

      3. log1p-define 74.3%

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

      4. neg-sub0 74.3%

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

      5. associate-+l- 74.3%

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

      6. neg-sub0 74.3%

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

      7. +-commutative 74.3%

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

      8. unsub-neg 74.3%

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

      9. *-rgt-identity 74.3%

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

      10. distribute-lft-out-- 74.4%

          \[\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 z around 0 74.6%

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

      1. clear-num 74.7%

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

      2. inv-pow 74.7%

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

   7. Applied egg-rr 74.7%

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

      1. unpow-1 74.7%

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

   9. Simplified 74.7%

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

   if -290 < y < 1.35e60

   1. Initial program 74.5%

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

      1. associate-+l- 78.3%

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

      2. sub-neg 78.3%

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

      3. log1p-define 90.0%

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

      4. neg-sub0 90.0%

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

      5. associate-+l- 90.0%

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

      6. neg-sub0 90.0%

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

      7. +-commutative 90.0%

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

      8. unsub-neg 90.0%

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

      9. *-rgt-identity 90.0%

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

      10. distribute-lft-out-- 90.0%

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

      11. expm1-define 98.3%

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

   3. Simplified 98.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 89.8%

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

      1. *-commutative 89.8%

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

      2. associate-/l* 89.8%

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

      3. expm1-define 99.6%

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

   7. Simplified 99.6%

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

   if 1.35e60 < y

   1. Initial program 2.4%

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

      1. associate-+l- 60.1%

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

      2. sub-neg 60.1%

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

      3. log1p-define 60.1%

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

      4. neg-sub0 60.1%

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

      5. associate-+l- 60.1%

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

      6. neg-sub0 60.1%

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

      7. +-commutative 60.1%

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

      8. unsub-neg 60.1%

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

      9. *-rgt-identity 60.1%

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

      10. distribute-lft-out-- 60.1%

          \[\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. Taylor expanded in z around 0 99.8%

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

4. Final simplification 95.1%

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

Alternative 7: 86.1% accurate, 2.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

Wolfram

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

Derivation

1. Initial program 57.6%

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

   1. associate-+l- 75.1%

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

   2. sub-neg 75.1%

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

   3. log1p-define 83.0%

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

   4. neg-sub0 83.0%

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

   5. associate-+l- 83.0%

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

   6. neg-sub0 83.0%

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

   7. +-commutative 83.0%

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

   8. unsub-neg 83.0%

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

   9. *-rgt-identity 83.0%

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

   10. distribute-lft-out-- 83.0%

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

   11. expm1-define 98.8%

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

3. Simplified 98.8%

   \[\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 77.8%

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

   1. associate-/l* 77.8%

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

   2. expm1-define 88.4%

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

7. Simplified 88.4%

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

Alternative 8: 82.7% accurate, 5.9× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < -0.149999999999999994

   1. Initial program 74.0%

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

      1. associate-+l- 74.0%

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

      2. sub-neg 74.0%

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

      3. log1p-define 100.0%

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

      4. neg-sub0 100.0%

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

      5. associate-+l- 100.0%

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

      6. neg-sub0 100.0%

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

      7. +-commutative 100.0%

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

      8. unsub-neg 100.0%

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

      9. *-rgt-identity 100.0%

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

      10. distribute-lft-out-- 100.0%

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

      11. expm1-define 100.0%

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

   3. Simplified 100.0%

      \[\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 60.8%

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

   if -0.149999999999999994 < z

   1. Initial program 51.5%

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

      1. associate-+l- 75.5%

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

      2. sub-neg 75.5%

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

      3. log1p-define 76.6%

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

      4. neg-sub0 76.6%

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

      5. associate-+l- 76.6%

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

      6. neg-sub0 76.6%

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

      7. +-commutative 76.6%

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

      8. unsub-neg 76.6%

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

      9. *-rgt-identity 76.6%

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

      10. distribute-lft-out-- 76.6%

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

      11. expm1-define 98.4%

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

   3. Simplified 98.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 y around 0 76.3%

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

      1. associate-/l* 76.3%

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

      2. expm1-define 90.9%

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

   7. Simplified 90.9%

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

   8. Taylor expanded in z around 0 90.8%

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

4. Final simplification 82.6%

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

Alternative 9: 82.7% accurate, 10.5× speedup

Math

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

FPCore

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

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (z <= -2.0) {
		tmp = x;
	} else {
		tmp = x + (y * (z * ((-1.0 / t) - (0.5 * (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.0d0)) then
        tmp = x
    else
        tmp = x + (y * (z * (((-1.0d0) / t) - (0.5d0 * (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.0) {
		tmp = x;
	} else {
		tmp = x + (y * (z * ((-1.0 / t) - (0.5 * (z / t)))));
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < -2

   1. Initial program 74.0%

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

      1. associate-+l- 74.0%

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

      2. sub-neg 74.0%

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

      3. log1p-define 100.0%

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

      4. neg-sub0 100.0%

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

      5. associate-+l- 100.0%

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

      6. neg-sub0 100.0%

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

      7. +-commutative 100.0%

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

      8. unsub-neg 100.0%

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

      9. *-rgt-identity 100.0%

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

      10. distribute-lft-out-- 100.0%

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

      11. expm1-define 100.0%

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

   3. Simplified 100.0%

      \[\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 60.8%

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

   if -2 < z

   1. Initial program 51.5%

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

      1. associate-+l- 75.5%

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

      2. sub-neg 75.5%

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

      3. log1p-define 76.6%

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

      4. neg-sub0 76.6%

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

      5. associate-+l- 76.6%

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

      6. neg-sub0 76.6%

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

      7. +-commutative 76.6%

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

      8. unsub-neg 76.6%

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

      9. *-rgt-identity 76.6%

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

      10. distribute-lft-out-- 76.6%

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

      11. expm1-define 98.4%

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

   3. Simplified 98.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 y around 0 76.3%

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

      1. associate-/l* 76.3%

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

      2. expm1-define 90.9%

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

   7. Simplified 90.9%

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

   8. Taylor expanded in z around 0 90.4%

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

4. Final simplification 82.3%

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

Alternative 10: 82.0% accurate, 17.6× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= z -6.4e+61) x (- x (/ y (/ t z)))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (z <= -6.4e+61) {
		tmp = x;
	} else {
		tmp = x - (y / (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 <= (-6.4d+61)) then
        tmp = x
    else
        tmp = x - (y / (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 <= -6.4e+61) {
		tmp = x;
	} else {
		tmp = x - (y / (t / z));
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < -6.3999999999999997e61

   1. Initial program 71.3%

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

      1. associate-+l- 71.3%

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

      2. sub-neg 71.3%

         \[\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 60.7%

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

   if -6.3999999999999997e61 < z

   1. Initial program 53.5%

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

      1. associate-+l- 76.2%

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

      2. sub-neg 76.2%

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

      3. log1p-define 77.8%

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

      4. neg-sub0 77.8%

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

      5. associate-+l- 77.8%

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

      6. neg-sub0 77.8%

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

      7. +-commutative 77.8%

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

      8. unsub-neg 77.8%

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

      9. *-rgt-identity 77.8%

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

      10. distribute-lft-out-- 77.8%

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

      11. expm1-define 98.5%

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

   3. Simplified 98.5%

      \[\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.3%

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

      1. associate-/l* 88.7%

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

   7. Simplified 88.7%

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

      1. clear-num 88.7%

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

      2. un-div-inv 88.7%

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

   9. Applied egg-rr 88.7%

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

Alternative 11: 82.0% accurate, 17.6× speedup

Math

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

FPCore

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

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (z <= -6.4e+61) {
		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 <= (-6.4d+61)) 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 <= -6.4e+61) {
		tmp = x;
	} else {
		tmp = x - (y * (z / t));
	}
	return tmp;
}

Python

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

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (z <= -6.4e+61)
		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 <= -6.4e+61)
		tmp = x;
	else
		tmp = x - (y * (z / t));
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < -6.3999999999999997e61

   1. Initial program 71.3%

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

      1. associate-+l- 71.3%

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

      2. sub-neg 71.3%

         \[\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 60.7%

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

   if -6.3999999999999997e61 < z

   1. Initial program 53.5%

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

      1. associate-+l- 76.2%

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

      2. sub-neg 76.2%

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

      3. log1p-define 77.8%

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

      4. neg-sub0 77.8%

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

      5. associate-+l- 77.8%

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

      6. neg-sub0 77.8%

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

      7. +-commutative 77.8%

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

      8. unsub-neg 77.8%

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

      9. *-rgt-identity 77.8%

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

      10. distribute-lft-out-- 77.8%

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

      11. expm1-define 98.5%

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

   3. Simplified 98.5%

      \[\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.3%

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

      1. associate-/l* 88.7%

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

   7. Simplified 88.7%

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

Alternative 12: 72.1% 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 57.6%

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

   1. associate-+l- 75.1%

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

   2. sub-neg 75.1%

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

   3. log1p-define 83.0%

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

   4. neg-sub0 83.0%

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

   5. associate-+l- 83.0%

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

   6. neg-sub0 83.0%

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

   7. +-commutative 83.0%

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

   8. unsub-neg 83.0%

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

   9. *-rgt-identity 83.0%

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

   10. distribute-lft-out-- 83.0%

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

   11. expm1-define 98.8%

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

3. Simplified 98.8%

   \[\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 71.0%

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

Developer target: 75.1% 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 2024107 
(FPCore (x y z t)
  :name "System.Random.MWC.Distributions:truncatedExp from mwc-random-0.13.3.2"
  :precision binary64

  :alt
  (if (< z -2.8874623088207947e+119) (- (- x (/ (/ (- 0.5) (* y t)) (* z z))) (* (/ (- 0.5) (* y t)) (/ (/ 2.0 z) (* z z)))) (- x (/ (log (+ 1.0 (* z y))) t)))

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