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

Percentage Accurate: 62.2% → 98.3%

Time: 21.1s

Alternatives: 10

Speedup: 211.0×

• could not determine a ground truth

  1. x = -6.43777217177086e-28
  2. y = 5.739477219846883e+78
  3. z = 1.8294800714365586e+132
  4. t = -5.025144829588348e+295

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.3% 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 61.1%

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

   1. associate-+l- 74.1%

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

   2. sub-neg 74.1%

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

   3. log1p-define 80.9%

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

   4. neg-sub0 80.9%

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

   5. associate-+l- 80.9%

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

   6. neg-sub0 80.9%

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

   7. +-commutative 80.9%

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

   8. unsub-neg 80.9%

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

   9. *-rgt-identity 80.9%

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

   10. distribute-lft-out-- 80.9%

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

   11. expm1-define 97.7%

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

3. Simplified 97.7%

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

Alternative 2: 93.6% accurate, 1.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -75000000:\\ \;\;\;\;x + \frac{-1}{\frac{0.5 \cdot \left(y \cdot t\right) + \frac{t}{e^{z} + -1}}{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 (<= z -75000000.0)
   (+ x (/ -1.0 (/ (+ (* 0.5 (* y t)) (/ t (+ (exp z) -1.0))) 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 (z <= -75000000.0) {
		tmp = x + (-1.0 / (((0.5 * (y * t)) + (t / (exp(z) + -1.0))) / 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 (z <= -75000000.0) {
		tmp = x + (-1.0 / (((0.5 * (y * t)) + (t / (Math.exp(z) + -1.0))) / 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 z <= -75000000.0:
		tmp = x + (-1.0 / (((0.5 * (y * t)) + (t / (math.exp(z) + -1.0))) / 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 (z <= -75000000.0)
		tmp = Float64(x + Float64(-1.0 / Float64(Float64(Float64(0.5 * Float64(y * t)) + Float64(t / Float64(exp(z) + -1.0))) / 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[z, -75000000.0], N[(x + N[(-1.0 / N[(N[(N[(0.5 * N[(y * t), $MachinePrecision]), $MachinePrecision] + N[(t / N[(N[Exp[z], $MachinePrecision] + -1.0), $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 z < -7.5e7

   1. Initial program 77.6%

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

      1. associate-+l- 77.6%

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

      2. sub-neg 77.6%

         \[\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)}}} \]

   6. Applied egg-rr 99.7%

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

   7. Taylor expanded in y around 0 83.7%

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

   if -7.5e7 < z

   1. Initial program 53.7%

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

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

      4. neg-sub0 72.5%

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

      5. associate-+l- 72.5%

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

      6. neg-sub0 72.5%

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

      7. +-commutative 72.5%

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

      8. unsub-neg 72.5%

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

      9. *-rgt-identity 72.5%

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

      10. distribute-lft-out-- 72.5%

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

      11. expm1-define 96.8%

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

   3. Simplified 96.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 96.6%

      \[\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}\;z \leq -75000000:\\ \;\;\;\;x + \frac{-1}{\frac{0.5 \cdot \left(y \cdot t\right) + \frac{t}{e^{z} + -1}}{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: 91.3% accurate, 1.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -21000000000:\\ \;\;\;\;x - \frac{\mathsf{log1p}\left(y \cdot z\right)}{t}\\ \mathbf{elif}\;y \leq 4.2 \cdot 10^{-44}:\\ \;\;\;\;x - y \cdot \frac{\mathsf{expm1}\left(z\right)}{t}\\ \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 (<= y -21000000000.0)
   (- x (/ (log1p (* y z)) t))
   (if (<= y 4.2e-44)
     (- x (* y (/ (expm1 z) t)))
     (- x (/ (log1p (* z (+ y (* 0.5 (* y z))))) t)))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (y <= -21000000000.0) {
		tmp = x - (log1p((y * z)) / t);
	} else if (y <= 4.2e-44) {
		tmp = x - (y * (expm1(z) / t));
	} 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 (y <= -21000000000.0) {
		tmp = x - (Math.log1p((y * z)) / t);
	} else if (y <= 4.2e-44) {
		tmp = x - (y * (Math.expm1(z) / t));
	} else {
		tmp = x - (Math.log1p((z * (y + (0.5 * (y * z))))) / t);
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if y <= -21000000000.0:
		tmp = x - (math.log1p((y * z)) / t)
	elif y <= 4.2e-44:
		tmp = x - (y * (math.expm1(z) / t))
	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 (y <= -21000000000.0)
		tmp = Float64(x - Float64(log1p(Float64(y * z)) / t));
	elseif (y <= 4.2e-44)
		tmp = Float64(x - Float64(y * Float64(expm1(z) / t)));
	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[y, -21000000000.0], N[(x - N[(N[Log[1 + N[(y * z), $MachinePrecision]], $MachinePrecision] / t), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 4.2e-44], N[(x - N[(y * N[(N[(Exp[z] - 1), $MachinePrecision] / t), $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 3 regimes

2. if y < -2.1e10

   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- 79.1%

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

      2. sub-neg 79.1%

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

      3. log1p-define 79.1%

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

      4. neg-sub0 79.1%

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

      5. associate-+l- 79.1%

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

      6. neg-sub0 79.1%

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

      7. +-commutative 79.1%

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

      8. unsub-neg 79.1%

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

      9. *-rgt-identity 79.1%

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

      10. distribute-lft-out-- 79.1%

          \[\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. add-exp-log 82.6%

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

   6. Applied egg-rr 82.6%

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

   7. Taylor expanded in z around 0 68.1%

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

   if -2.1e10 < y < 4.20000000000000003e-44

   1. Initial program 78.0%

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

      1. associate-+l- 78.0%

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

      2. sub-neg 78.0%

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

      3. log1p-define 90.1%

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

      4. neg-sub0 90.1%

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

      5. associate-+l- 90.1%

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

      6. neg-sub0 90.1%

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

      7. +-commutative 90.1%

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

      8. unsub-neg 90.1%

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

      9. *-rgt-identity 90.1%

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

      10. distribute-lft-out-- 90.1%

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

      11. expm1-define 96.2%

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

   3. Simplified 96.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 89.2%

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

      1. expm1-define 95.3%

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

      2. associate-/l* 98.4%

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

   7. Simplified 98.4%

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

   if 4.20000000000000003e-44 < y

   1. Initial program 24.9%

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

      1. associate-+l- 59.1%

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

      2. sub-neg 59.1%

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

      3. log1p-define 59.1%

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

      4. neg-sub0 59.1%

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

      5. associate-+l- 59.1%

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

      6. neg-sub0 59.1%

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

      7. +-commutative 59.1%

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

      8. unsub-neg 59.1%

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

      9. *-rgt-identity 59.1%

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

      10. distribute-lft-out-- 59.0%

          \[\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 98.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. Add Preprocessing

Alternative 4: 93.8% accurate, 1.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -0.13:\\ \;\;\;\;x + \frac{-1}{\frac{0.5 \cdot \left(y \cdot t\right) + \frac{t}{e^{z} + -1}}{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 (<= z -0.13)
   (+ x (/ -1.0 (/ (+ (* 0.5 (* y t)) (/ t (+ (exp z) -1.0))) y)))
   (- x (/ (log1p (* z (+ y (* 0.5 (* y z))))) t))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (z <= -0.13) {
		tmp = x + (-1.0 / (((0.5 * (y * t)) + (t / (exp(z) + -1.0))) / 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 (z <= -0.13) {
		tmp = x + (-1.0 / (((0.5 * (y * t)) + (t / (Math.exp(z) + -1.0))) / 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 z <= -0.13:
		tmp = x + (-1.0 / (((0.5 * (y * t)) + (t / (math.exp(z) + -1.0))) / 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 (z <= -0.13)
		tmp = Float64(x + Float64(-1.0 / Float64(Float64(Float64(0.5 * Float64(y * t)) + Float64(t / Float64(exp(z) + -1.0))) / 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[z, -0.13], N[(x + N[(-1.0 / N[(N[(N[(0.5 * N[(y * t), $MachinePrecision]), $MachinePrecision] + N[(t / N[(N[Exp[z], $MachinePrecision] + -1.0), $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 z < -0.13

   1. Initial program 78.7%

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

      1. associate-+l- 78.7%

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

      2. sub-neg 78.7%

         \[\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)}}} \]

   6. Applied egg-rr 99.7%

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

   7. Taylor expanded in y around 0 83.4%

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

   if -0.13 < 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- 71.9%

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

      2. sub-neg 71.9%

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

      3. log1p-define 71.9%

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

      4. neg-sub0 71.9%

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

      5. associate-+l- 71.9%

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

      6. neg-sub0 71.9%

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

      7. +-commutative 71.9%

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

      8. unsub-neg 71.9%

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

      9. *-rgt-identity 71.9%

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

      10. distribute-lft-out-- 71.9%

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

      11. expm1-define 96.7%

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

   3. Simplified 96.7%

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

   5. Taylor expanded in z around 0 96.8%

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

4. Final simplification 92.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -0.13:\\ \;\;\;\;x + \frac{-1}{\frac{0.5 \cdot \left(y \cdot t\right) + \frac{t}{e^{z} + -1}}{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 5: 91.6% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -200000000000 \lor \neg \left(y \leq 1.2 \cdot 10^{-21}\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 -200000000000.0) (not (<= y 1.2e-21)))
   (- 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 <= -200000000000.0) || !(y <= 1.2e-21)) {
		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 <= -200000000000.0) || !(y <= 1.2e-21)) {
		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 <= -200000000000.0) or not (y <= 1.2e-21):
		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 <= -200000000000.0) || !(y <= 1.2e-21))
		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, -200000000000.0], N[Not[LessEqual[y, 1.2e-21]], $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 < -2e11 or 1.2e-21 < y

   1. Initial program 35.0%

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

      1. associate-+l- 67.8%

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

      2. sub-neg 67.8%

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

      3. log1p-define 67.8%

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

      4. neg-sub0 67.8%

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

      5. associate-+l- 67.8%

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

      6. neg-sub0 67.8%

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

      7. +-commutative 67.8%

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

      8. unsub-neg 67.8%

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

      9. *-rgt-identity 67.8%

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

      10. distribute-lft-out-- 67.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. add-exp-log 76.1%

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

   6. Applied egg-rr 76.1%

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

   7. Taylor expanded in z around 0 81.4%

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

   if -2e11 < y < 1.2e-21

   1. Initial program 78.1%

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

      1. associate-+l- 78.1%

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

      2. sub-neg 78.1%

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

      3. log1p-define 89.5%

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

      4. neg-sub0 89.5%

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

      5. associate-+l- 89.5%

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

      6. neg-sub0 89.5%

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

      7. +-commutative 89.5%

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

      8. unsub-neg 89.5%

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

      9. *-rgt-identity 89.5%

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

      10. distribute-lft-out-- 89.5%

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

      11. expm1-define 96.4%

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

   3. Simplified 96.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 88.7%

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

      1. expm1-define 95.6%

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

      2. associate-/l* 98.5%

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

   7. Simplified 98.5%

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

4. Final simplification 91.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -200000000000 \lor \neg \left(y \leq 1.2 \cdot 10^{-21}\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 6: 85.9% 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 61.1%

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

   1. associate-+l- 74.1%

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

   2. sub-neg 74.1%

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

   3. log1p-define 80.9%

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

   4. neg-sub0 80.9%

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

   5. associate-+l- 80.9%

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

   6. neg-sub0 80.9%

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

   7. +-commutative 80.9%

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

   8. unsub-neg 80.9%

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

   9. *-rgt-identity 80.9%

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

   10. distribute-lft-out-- 80.9%

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

   11. expm1-define 97.7%

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

3. Simplified 97.7%

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

5. Taylor expanded in y around 0 72.0%

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

   1. expm1-define 84.0%

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

   2. associate-/l* 85.8%

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

7. Simplified 85.8%

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

Alternative 7: 69.6% accurate, 8.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;t \leq -3.95 \cdot 10^{-181} \lor \neg \left(t \leq 3.45 \cdot 10^{-298}\right) \land \left(t \leq 4.7 \cdot 10^{-273} \lor \neg \left(t \leq 4.5 \cdot 10^{-153}\right)\right):\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;y \cdot \left(-\frac{z}{t}\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (or (<= t -3.95e-181)
         (and (not (<= t 3.45e-298))
              (or (<= t 4.7e-273) (not (<= t 4.5e-153)))))
   x
   (* y (- (/ z t)))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if ((t <= -3.95e-181) || (!(t <= 3.45e-298) && ((t <= 4.7e-273) || !(t <= 4.5e-153)))) {
		tmp = x;
	} else {
		tmp = 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 ((t <= (-3.95d-181)) .or. (.not. (t <= 3.45d-298)) .and. (t <= 4.7d-273) .or. (.not. (t <= 4.5d-153))) then
        tmp = x
    else
        tmp = 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 ((t <= -3.95e-181) || (!(t <= 3.45e-298) && ((t <= 4.7e-273) || !(t <= 4.5e-153)))) {
		tmp = x;
	} else {
		tmp = y * -(z / t);
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if (t <= -3.95e-181) or (not (t <= 3.45e-298) and ((t <= 4.7e-273) or not (t <= 4.5e-153))):
		tmp = x
	else:
		tmp = y * -(z / t)
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if ((t <= -3.95e-181) || (!(t <= 3.45e-298) && ((t <= 4.7e-273) || !(t <= 4.5e-153))))
		tmp = x;
	else
		tmp = Float64(y * Float64(-Float64(z / t)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if ((t <= -3.95e-181) || (~((t <= 3.45e-298)) && ((t <= 4.7e-273) || ~((t <= 4.5e-153)))))
		tmp = x;
	else
		tmp = y * -(z / t);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[Or[LessEqual[t, -3.95e-181], And[N[Not[LessEqual[t, 3.45e-298]], $MachinePrecision], Or[LessEqual[t, 4.7e-273], N[Not[LessEqual[t, 4.5e-153]], $MachinePrecision]]]], x, N[(y * (-N[(z / t), $MachinePrecision])), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if t < -3.95e-181 or 3.45000000000000011e-298 < t < 4.69999999999999962e-273 or 4.5e-153 < t

   1. Initial program 69.3%

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

      1. associate-+l- 84.9%

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

      2. sub-neg 84.9%

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

      3. log1p-define 89.7%

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

      4. neg-sub0 89.7%

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

      5. associate-+l- 89.7%

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

      6. neg-sub0 89.7%

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

      7. +-commutative 89.7%

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

      8. unsub-neg 89.7%

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

      9. *-rgt-identity 89.7%

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

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

   3. Simplified 99.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 79.8%

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

   if -3.95e-181 < t < 3.45000000000000011e-298 or 4.69999999999999962e-273 < t < 4.5e-153

   1. Initial program 28.8%

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

      1. associate-+l- 31.6%

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

      2. sub-neg 31.6%

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

      3. log1p-define 46.4%

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

      4. neg-sub0 46.4%

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

      5. associate-+l- 46.4%

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

      6. neg-sub0 46.4%

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

      7. +-commutative 46.4%

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

      8. unsub-neg 46.4%

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

      9. *-rgt-identity 46.4%

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

      10. distribute-lft-out-- 46.4%

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

      11. expm1-define 92.8%

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

   3. Simplified 92.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 34.0%

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

      1. expm1-define 74.2%

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

   7. Simplified 74.2%

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

   8. Taylor expanded in x around 0 18.0%

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

      1. mul-1-neg 18.0%

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

      2. expm1-define 58.3%

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

      3. *-commutative 58.3%

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

      4. associate-*r/ 50.7%

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

      5. distribute-rgt-neg-in 50.7%

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

   10. Simplified 50.7%

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

   11. Taylor expanded in z around 0 44.0%

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

       1. mul-1-neg 44.0%

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

       2. associate-*r/ 50.8%

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

       3. distribute-rgt-neg-in 50.8%

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

   13. Simplified 50.8%

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

4. Final simplification 73.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;t \leq -3.95 \cdot 10^{-181} \lor \neg \left(t \leq 3.45 \cdot 10^{-298}\right) \land \left(t \leq 4.7 \cdot 10^{-273} \lor \neg \left(t \leq 4.5 \cdot 10^{-153}\right)\right):\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;y \cdot \left(-\frac{z}{t}\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 8: 82.2% accurate, 17.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -9.5:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;x - \frac{y}{\frac{t}{z}}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t) :precision binary64 (if (<= z -9.5) x (- x (/ y (/ t z)))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (z <= -9.5) {
		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 <= (-9.5d0)) 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 <= -9.5) {
		tmp = x;
	} else {
		tmp = x - (y / (t / z));
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if z <= -9.5:
		tmp = x
	else:
		tmp = x - (y / (t / z))
	return tmp

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < -9.5

   1. Initial program 78.7%

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

      1. associate-+l- 78.7%

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

      2. sub-neg 78.7%

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

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

   if -9.5 < 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- 71.9%

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

      2. sub-neg 71.9%

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

      3. log1p-define 71.9%

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

      4. neg-sub0 71.9%

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

      5. associate-+l- 71.9%

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

      6. neg-sub0 71.9%

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

      7. +-commutative 71.9%

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

      8. unsub-neg 71.9%

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

      9. *-rgt-identity 71.9%

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

      10. distribute-lft-out-- 71.9%

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

      11. expm1-define 96.7%

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

   3. Simplified 96.7%

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

   5. Taylor expanded in z around 0 89.2%

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

      1. associate-/l* 91.8%

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

   7. Simplified 91.8%

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

      1. clear-num 91.8%

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

      2. un-div-inv 91.8%

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

   9. Applied egg-rr 91.8%

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

Alternative 9: 82.3% accurate, 17.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -2.55:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;x - y \cdot \frac{z}{t}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t) :precision binary64 (if (<= z -2.55) x (- x (* y (/ z t)))))

C

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

Fortran

real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: tmp
    if (z <= (-2.55d0)) then
        tmp = x
    else
        tmp = x - (y * (z / t))
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < -2.5499999999999998

   1. Initial program 78.7%

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

      1. associate-+l- 78.7%

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

      2. sub-neg 78.7%

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

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

   if -2.5499999999999998 < 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- 71.9%

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

      2. sub-neg 71.9%

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

      3. log1p-define 71.9%

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

      4. neg-sub0 71.9%

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

      5. associate-+l- 71.9%

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

      6. neg-sub0 71.9%

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

      7. +-commutative 71.9%

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

      8. unsub-neg 71.9%

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

      9. *-rgt-identity 71.9%

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

      10. distribute-lft-out-- 71.9%

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

      11. expm1-define 96.7%

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

   3. Simplified 96.7%

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

   5. Taylor expanded in z around 0 89.2%

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

      1. associate-/l* 91.8%

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

   7. Simplified 91.8%

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

Alternative 10: 71.5% 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 61.1%

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

   1. associate-+l- 74.1%

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

   2. sub-neg 74.1%

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

   3. log1p-define 80.9%

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

   4. neg-sub0 80.9%

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

   5. associate-+l- 80.9%

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

   6. neg-sub0 80.9%

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

   7. +-commutative 80.9%

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

   8. unsub-neg 80.9%

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

   9. *-rgt-identity 80.9%

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

   10. distribute-lft-out-- 80.9%

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

   11. expm1-define 97.7%

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

3. Simplified 97.7%

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

5. Taylor expanded in x around inf 67.4%

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

Developer target: 74.5% accurate, 1.9× speedup

Math

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

FPCore

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

C

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

Fortran

real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: t_1
    real(8) :: tmp
    t_1 = -0.5d0 / (y * t)
    if (z < (-2.8874623088207947d+119)) then
        tmp = (x - (t_1 / (z * z))) - (t_1 * ((2.0d0 / z) / (z * z)))
    else
        tmp = x - (log((1.0d0 + (z * y))) / t)
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Reproduce

herbie shell --seed 2024096 
(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)))