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

Percentage Accurate: 61.9% → 98.4%

Time: 19.4s

Alternatives: 10

Speedup: 211.0×

• could not determine a ground truth

  1. x = -1.5494022714199093e-280
  2. y = 8.263947656543247e+293
  3. z = 3.359090448749157e+252
  4. t = 3.9789644290191005e-114

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.9% 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.4% 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 59.0%

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

   1. associate-+l- 73.2%

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

   2. sub-neg 73.2%

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

   3. log1p-define 81.2%

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

   4. neg-sub0 81.2%

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

   5. associate-+l- 81.2%

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

   6. neg-sub0 81.2%

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

   7. +-commutative 81.2%

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

   8. unsub-neg 81.2%

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

   9. *-rgt-identity 81.2%

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

   10. distribute-lft-out-- 81.2%

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

   11. expm1-define 98.6%

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

3. Simplified 98.6%

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

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;e^{z} \leq 0:\\ \;\;\;\;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 + 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 (<= (exp z) 0.0)
   (+ x (/ 1.0 (/ (- (/ t (- 1.0 (exp z))) (* 0.5 (* y t))) y)))
   (-
    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 (exp(z) <= 0.0) {
		tmp = x + (1.0 / (((t / (1.0 - exp(z))) - (0.5 * (y * t))) / y));
	} 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 (Math.exp(z) <= 0.0) {
		tmp = x + (1.0 / (((t / (1.0 - Math.exp(z))) - (0.5 * (y * t))) / y));
	} 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 math.exp(z) <= 0.0:
		tmp = x + (1.0 / (((t / (1.0 - math.exp(z))) - (0.5 * (y * t))) / y))
	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 (exp(z) <= 0.0)
		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(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[N[Exp[z], $MachinePrecision], 0.0], 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[(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 (exp.f64 z) < 0.0

   1. Initial program 74.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 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. 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. inv-pow 99.7%

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

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

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

   8. Applied egg-rr 99.7%

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

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

   if 0.0 < (exp.f64 z)

   1. Initial program 52.8%

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

      1. associate-+l- 72.8%

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

      2. sub-neg 72.8%

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

      3. log1p-define 73.6%

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

      4. neg-sub0 73.6%

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

      5. associate-+l- 73.6%

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

      6. neg-sub0 73.6%

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

      7. +-commutative 73.6%

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

      8. unsub-neg 73.6%

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

      9. *-rgt-identity 73.6%

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

      10. distribute-lft-out-- 73.7%

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

      11. expm1-define 98.1%

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

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

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

   \[\leadsto \begin{array}{l} \mathbf{if}\;e^{z} \leq 0:\\ \;\;\;\;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 + 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: 94.1% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;e^{z} \leq 10^{-5}:\\ \;\;\;\;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) 1e-5)
   (+ 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) <= 1e-5) {
		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) <= 1e-5) {
		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) <= 1e-5:
		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) <= 1e-5)
		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], 1e-5], 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) < 1.00000000000000008e-5

   1. Initial program 75.0%

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

      1. associate-+l- 75.0%

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

      2. sub-neg 75.0%

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

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

   if 1.00000000000000008e-5 < (exp.f64 z)

   1. Initial program 52.3%

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

      1. associate-+l- 72.5%

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

      2. sub-neg 72.5%

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

      3. log1p-define 73.4%

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

      4. neg-sub0 73.4%

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

      5. associate-+l- 73.4%

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

      6. neg-sub0 73.4%

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

      7. +-commutative 73.4%

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

      8. unsub-neg 73.4%

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

      9. *-rgt-identity 73.4%

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

      10. distribute-lft-out-- 73.4%

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

      11. expm1-define 98.1%

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

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

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

   \[\leadsto \begin{array}{l} \mathbf{if}\;e^{z} \leq 10^{-5}:\\ \;\;\;\;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 4: 92.8% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -31000 \lor \neg \left(y \leq 0.42\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 -31000.0) (not (<= y 0.42)))
   (- 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 <= -31000.0) || !(y <= 0.42)) {
		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 <= -31000.0) || !(y <= 0.42)) {
		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 <= -31000.0) or not (y <= 0.42):
		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 <= -31000.0) || !(y <= 0.42))
		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, -31000.0], N[Not[LessEqual[y, 0.42]], $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 < -31000 or 0.419999999999999984 < y

   1. Initial program 32.3%

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

      1. associate-+l- 68.3%

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

      2. sub-neg 68.3%

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

      3. log1p-define 68.3%

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

      4. neg-sub0 68.3%

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

      5. associate-+l- 68.3%

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

      6. neg-sub0 68.3%

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

      7. +-commutative 68.3%

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

      8. unsub-neg 68.3%

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

      9. *-rgt-identity 68.3%

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

      10. distribute-lft-out-- 68.3%

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

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

   8. Taylor expanded in x around 0 62.9%

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

      1. log1p-define 81.3%

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

      2. *-rgt-identity 81.3%

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

      3. *-rgt-identity 81.3%

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

   10. Simplified 81.3%

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

   if -31000 < y < 0.419999999999999984

   1. Initial program 76.5%

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

      1. associate-+l- 76.5%

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

      2. sub-neg 76.5%

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

      3. log1p-define 89.6%

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

      4. neg-sub0 89.6%

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

      5. associate-+l- 89.6%

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

      6. neg-sub0 89.6%

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

      7. +-commutative 89.6%

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

      8. unsub-neg 89.6%

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

      9. *-rgt-identity 89.6%

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

      10. distribute-lft-out-- 89.7%

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

      11. expm1-define 97.9%

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

   3. Simplified 97.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 y around 0 89.7%

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

      1. associate-/l* 89.7%

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

      2. expm1-define 99.9%

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

   7. Simplified 99.9%

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

4. Final simplification 92.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -31000 \lor \neg \left(y \leq 0.42\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 5: 92.8% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \mathsf{log1p}\left(y \cdot z\right)\\ \mathbf{if}\;y \leq -31000:\\ \;\;\;\;x + t\_1 \cdot \frac{-1}{t}\\ \mathbf{elif}\;y \leq 0.42:\\ \;\;\;\;x - y \cdot \frac{\mathsf{expm1}\left(z\right)}{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 -31000.0)
     (+ x (* t_1 (/ -1.0 t)))
     (if (<= y 0.42) (- x (* y (/ (expm1 z) 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 <= -31000.0) {
		tmp = x + (t_1 * (-1.0 / t));
	} else if (y <= 0.42) {
		tmp = x - (y * (expm1(z) / 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 <= -31000.0) {
		tmp = x + (t_1 * (-1.0 / t));
	} else if (y <= 0.42) {
		tmp = x - (y * (Math.expm1(z) / 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 <= -31000.0:
		tmp = x + (t_1 * (-1.0 / t))
	elif y <= 0.42:
		tmp = x - (y * (math.expm1(z) / 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 <= -31000.0)
		tmp = Float64(x + Float64(t_1 * Float64(-1.0 / t)));
	elseif (y <= 0.42)
		tmp = Float64(x - Float64(y * Float64(expm1(z) / 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, -31000.0], N[(x + N[(t$95$1 * N[(-1.0 / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 0.42], N[(x - N[(y * N[(N[(Exp[z] - 1), $MachinePrecision] / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(x - N[(t$95$1 / t), $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if y < -31000

   1. Initial program 51.7%

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

      1. associate-+l- 70.8%

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

      2. sub-neg 70.8%

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

      3. log1p-define 70.8%

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

      4. neg-sub0 70.8%

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

      5. associate-+l- 70.8%

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

      6. neg-sub0 70.8%

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

      7. +-commutative 70.8%

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

      8. unsub-neg 70.8%

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

      9. *-rgt-identity 70.8%

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

      10. distribute-lft-out-- 70.8%

          \[\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. Step-by-step derivation

      1. clear-num 99.6%

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

      2. associate-/r/ 99.5%

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

   6. Applied egg-rr 99.5%

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

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

   if -31000 < y < 0.419999999999999984

   1. Initial program 76.5%

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

      1. associate-+l- 76.5%

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

      2. sub-neg 76.5%

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

      3. log1p-define 89.6%

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

      4. neg-sub0 89.6%

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

      5. associate-+l- 89.6%

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

      6. neg-sub0 89.6%

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

      7. +-commutative 89.6%

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

      8. unsub-neg 89.6%

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

      9. *-rgt-identity 89.6%

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

      10. distribute-lft-out-- 89.7%

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

      11. expm1-define 97.9%

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

   3. Simplified 97.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 y around 0 89.7%

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

      1. associate-/l* 89.7%

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

      2. expm1-define 99.9%

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

   7. Simplified 99.9%

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

   if 0.419999999999999984 < y

   1. Initial program 9.1%

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

      1. associate-+l- 65.2%

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

      2. sub-neg 65.2%

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

      3. log1p-define 65.2%

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

      4. neg-sub0 65.2%

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

      5. associate-+l- 65.2%

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

      6. neg-sub0 65.2%

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

      7. +-commutative 65.2%

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

      8. unsub-neg 65.2%

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

      9. *-rgt-identity 65.2%

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

      10. distribute-lft-out-- 65.2%

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

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

   6. Applied egg-rr 99.8%

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

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

   8. Taylor expanded in x around 0 81.5%

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

      1. log1p-define 99.8%

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

      2. *-rgt-identity 99.8%

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

      3. *-rgt-identity 99.8%

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

   10. Simplified 99.8%

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

4. Final simplification 92.6%

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

Alternative 6: 86.3% 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 59.0%

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

   1. associate-+l- 73.2%

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

   2. sub-neg 73.2%

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

   3. log1p-define 81.2%

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

   4. neg-sub0 81.2%

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

   5. associate-+l- 81.2%

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

   6. neg-sub0 81.2%

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

   7. +-commutative 81.2%

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

   8. unsub-neg 81.2%

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

   9. *-rgt-identity 81.2%

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

   10. distribute-lft-out-- 81.2%

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

   11. expm1-define 98.6%

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

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

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

   1. associate-/l* 73.4%

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

   2. expm1-define 86.7%

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

7. Simplified 86.7%

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

Alternative 7: 71.8% accurate, 13.2× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= t -2.6e-241) x (if (<= t 6.5e-236) (* y (/ z (- t))) x)))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (t <= -2.6e-241) {
		tmp = x;
	} else if (t <= 6.5e-236) {
		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 <= (-2.6d-241)) then
        tmp = x
    else if (t <= 6.5d-236) 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 <= -2.6e-241) {
		tmp = x;
	} else if (t <= 6.5e-236) {
		tmp = y * (z / -t);
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if t <= -2.6e-241:
		tmp = x
	elif t <= 6.5e-236:
		tmp = y * (z / -t)
	else:
		tmp = x
	return tmp

Julia

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

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if (t <= -2.6e-241)
		tmp = x;
	elseif (t <= 6.5e-236)
		tmp = y * (z / -t);
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if t < -2.5999999999999999e-241 or 6.5000000000000001e-236 < t

   1. Initial program 64.2%

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

      1. associate-+l- 79.8%

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

      2. sub-neg 79.8%

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

      3. log1p-define 86.1%

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

      4. neg-sub0 86.1%

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

      5. associate-+l- 86.1%

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

      6. neg-sub0 86.1%

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

      7. +-commutative 86.1%

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

      8. unsub-neg 86.1%

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

      9. *-rgt-identity 86.1%

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

      10. distribute-lft-out-- 86.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 x around inf 74.5%

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

   if -2.5999999999999999e-241 < t < 6.5000000000000001e-236

   1. Initial program 30.4%

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

      1. associate-+l- 36.6%

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

      2. sub-neg 36.6%

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

      3. log1p-define 54.2%

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

      4. neg-sub0 54.2%

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

      5. associate-+l- 54.2%

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

      6. neg-sub0 54.2%

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

      7. +-commutative 54.2%

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

      8. unsub-neg 54.2%

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

      9. *-rgt-identity 54.2%

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

      10. distribute-lft-out-- 54.2%

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

      11. expm1-define 94.8%

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

   3. Simplified 94.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 63.1%

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

      1. mul-1-neg 63.1%

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

      2. unsub-neg 63.1%

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

      3. associate-/l* 68.0%

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

   7. Simplified 68.0%

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

   8. Taylor expanded in x around 0 41.8%

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

      1. associate-*r/ 46.7%

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

      2. neg-mul-1 46.7%

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

      3. distribute-rgt-neg-in 46.7%

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

      4. distribute-neg-frac2 46.7%

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

   10. Simplified 46.7%

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

Alternative 8: 81.8% accurate, 15.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -4.7 \cdot 10^{+41}:\\ \;\;\;\;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 -4.7e+41) x (+ x (* y (/ -1.0 (/ t z))))))

C

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

Python

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

Julia

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

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[z, -4.7e+41], 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 < -4.70000000000000001e41

   1. Initial program 73.9%

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

      1. associate-+l- 73.9%

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

      2. sub-neg 73.9%

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

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

   if -4.70000000000000001e41 < 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- 73.0%

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

      2. sub-neg 73.0%

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

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

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

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

      1. mul-1-neg 88.1%

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

      2. unsub-neg 88.1%

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

      3. associate-/l* 89.6%

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

   7. Simplified 89.6%

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

      1. clear-num 89.7%

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

      2. inv-pow 89.7%

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

   9. Applied egg-rr 89.7%

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

       1. unpow-1 89.7%

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

   11. Simplified 89.7%

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

4. Final simplification 80.2%

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

Alternative 9: 81.9% accurate, 17.6× speedup

Math

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

FPCore

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

C

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

Python

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < -3.2000000000000001e41

   1. Initial program 73.9%

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

      1. associate-+l- 73.9%

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

      2. sub-neg 73.9%

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

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

   if -3.2000000000000001e41 < 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- 73.0%

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

      2. sub-neg 73.0%

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

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

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

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

      1. mul-1-neg 88.1%

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

      2. unsub-neg 88.1%

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

      3. associate-/l* 89.6%

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

   7. Simplified 89.6%

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

Alternative 10: 71.9% 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 59.0%

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

   1. associate-+l- 73.2%

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

   2. sub-neg 73.2%

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

   3. log1p-define 81.2%

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

   4. neg-sub0 81.2%

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

   5. associate-+l- 81.2%

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

   6. neg-sub0 81.2%

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

   7. +-commutative 81.2%

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

   8. unsub-neg 81.2%

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

   9. *-rgt-identity 81.2%

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

   10. distribute-lft-out-- 81.2%

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

   11. expm1-define 98.6%

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

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

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

Developer Target 1: 75.0% 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 2024144 
(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)))