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

Percentage Accurate: 61.3% → 99.2%

Time: 19.5s

Alternatives: 15

Speedup: 11.3×

• could not determine a ground truth

  1. x = -4.210971758124196e+185
  2. y = 6.564307606846429e-281
  3. z = 1415959765342.6675
  4. t = -2.45983978403063e-32

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.3% 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: 99.2% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := e^{z} \cdot y + \left(1 - y\right)\\ \mathbf{if}\;t\_1 \leq 0:\\ \;\;\;\;\mathsf{fma}\left(\frac{-1}{t}, \mathsf{log1p}\left(y \cdot z\right), x\right)\\ \mathbf{elif}\;t\_1 \leq 4:\\ \;\;\;\;x - \frac{\mathsf{expm1}\left(z\right)}{t} \cdot y\\ \mathbf{else}:\\ \;\;\;\;x - \frac{\log \left(y \cdot \mathsf{expm1}\left(z\right)\right)}{t}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (+ (* (exp z) y) (- 1.0 y))))
   (if (<= t_1 0.0)
     (fma (/ -1.0 t) (log1p (* y z)) x)
     (if (<= t_1 4.0)
       (- x (* (/ (expm1 z) t) y))
       (- x (/ (log (* y (expm1 z))) t))))))

C

double code(double x, double y, double z, double t) {
	double t_1 = (exp(z) * y) + (1.0 - y);
	double tmp;
	if (t_1 <= 0.0) {
		tmp = fma((-1.0 / t), log1p((y * z)), x);
	} else if (t_1 <= 4.0) {
		tmp = x - ((expm1(z) / t) * y);
	} else {
		tmp = x - (log((y * expm1(z))) / t);
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	t_1 = Float64(Float64(exp(z) * y) + Float64(1.0 - y))
	tmp = 0.0
	if (t_1 <= 0.0)
		tmp = fma(Float64(-1.0 / t), log1p(Float64(y * z)), x);
	elseif (t_1 <= 4.0)
		tmp = Float64(x - Float64(Float64(expm1(z) / t) * y));
	else
		tmp = Float64(x - Float64(log(Float64(y * expm1(z))) / t));
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (+.f64 (-.f64 #s(literal 1 binary64) y) (*.f64 y (exp.f64 z))) < 0.0

   1. Initial program 2.4%

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

      1. lift--.f64 N/A

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

      2. sub-neg N/A

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

      3. +-commutative N/A

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

      4. lift-/.f64 N/A

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

      5. distribute-neg-frac2 N/A

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

      6. div-inv N/A

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

      7. *-commutative N/A

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

      8. lower-fma.f64 N/A

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

   4. Applied rewrites 64.2%

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

   5. Taylor expanded in z around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 99.8

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

   7. Applied rewrites 99.8%

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

   if 0.0 < (+.f64 (-.f64 #s(literal 1 binary64) y) (*.f64 y (exp.f64 z))) < 4

   1. Initial program 83.8%

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

   3. Taylor expanded in y around 0

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

      1. associate-/l* N/A

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

      2. div-sub N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. div-sub N/A

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

      6. lower-/.f64 N/A

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

      7. lower-expm1.f64 99.9

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

   5. Applied rewrites 99.9%

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

   if 4 < (+.f64 (-.f64 #s(literal 1 binary64) y) (*.f64 y (exp.f64 z)))

   1. Initial program 99.7%

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

   3. Taylor expanded in y around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-expm1.f64 99.7

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

   5. Applied rewrites 99.7%

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

4. Final simplification 99.9%

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

Alternative 2: 93.7% accurate, 0.5× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (+ (* (exp z) y) (- 1.0 y))))
   (if (<= t_1 0.0)
     (fma (/ -1.0 t) (log1p (* y z)) x)
     (if (<= t_1 1e+64)
       (- x (* (/ (expm1 z) t) y))
       (/ (log1p (* y (expm1 z))) (- t))))))

C

double code(double x, double y, double z, double t) {
	double t_1 = (exp(z) * y) + (1.0 - y);
	double tmp;
	if (t_1 <= 0.0) {
		tmp = fma((-1.0 / t), log1p((y * z)), x);
	} else if (t_1 <= 1e+64) {
		tmp = x - ((expm1(z) / t) * y);
	} else {
		tmp = log1p((y * expm1(z))) / -t;
	}
	return tmp;
}

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (+.f64 (-.f64 #s(literal 1 binary64) y) (*.f64 y (exp.f64 z))) < 0.0

   1. Initial program 2.4%

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

      1. lift--.f64 N/A

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

      2. sub-neg N/A

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

      3. +-commutative N/A

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

      4. lift-/.f64 N/A

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

      5. distribute-neg-frac2 N/A

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

      6. div-inv N/A

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

      7. *-commutative N/A

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

      8. lower-fma.f64 N/A

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

   4. Applied rewrites 64.2%

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

   5. Taylor expanded in z around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 99.8

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

   7. Applied rewrites 99.8%

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

   if 0.0 < (+.f64 (-.f64 #s(literal 1 binary64) y) (*.f64 y (exp.f64 z))) < 1.00000000000000002e64

   1. Initial program 84.1%

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

   3. Taylor expanded in y around 0

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

      1. associate-/l* N/A

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

      2. div-sub N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. div-sub N/A

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

      6. lower-/.f64 N/A

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

      7. lower-expm1.f64 99.4

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

   5. Applied rewrites 99.4%

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

   if 1.00000000000000002e64 < (+.f64 (-.f64 #s(literal 1 binary64) y) (*.f64 y (exp.f64 z)))

   1. Initial program 99.7%

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

   3. Taylor expanded in t around 0

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

      1. mul-1-neg N/A

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

      2. distribute-neg-frac2 N/A

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

      3. lower-/.f64 N/A

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

      4. sub-neg N/A

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

      5. associate-+l+ N/A

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

      6. *-rgt-identity N/A

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

      7. cancel-sign-sub-inv N/A

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

      8. distribute-lft-out-- N/A

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

      9. lower-log1p.f64 N/A

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

      10. *-commutative N/A

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

      11. lower-*.f64 N/A

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

      12. lower-expm1.f64 N/A

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

      13. lower-neg.f64 59.6

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

   5. Applied rewrites 59.6%

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

4. Final simplification 95.6%

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

Alternative 3: 93.8% accurate, 0.6× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (+ (* (exp z) y) (- 1.0 y))))
   (if (<= t_1 0.0)
     (fma (/ -1.0 t) (log1p (* y z)) x)
     (if (<= t_1 1e+104) (- x (* (/ (expm1 z) t) y)) (- x (/ (log 1.0) t))))))

C

double code(double x, double y, double z, double t) {
	double t_1 = (exp(z) * y) + (1.0 - y);
	double tmp;
	if (t_1 <= 0.0) {
		tmp = fma((-1.0 / t), log1p((y * z)), x);
	} else if (t_1 <= 1e+104) {
		tmp = x - ((expm1(z) / t) * y);
	} else {
		tmp = x - (log(1.0) / t);
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	t_1 = Float64(Float64(exp(z) * y) + Float64(1.0 - y))
	tmp = 0.0
	if (t_1 <= 0.0)
		tmp = fma(Float64(-1.0 / t), log1p(Float64(y * z)), x);
	elseif (t_1 <= 1e+104)
		tmp = Float64(x - Float64(Float64(expm1(z) / t) * y));
	else
		tmp = Float64(x - Float64(log(1.0) / t));
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (+.f64 (-.f64 #s(literal 1 binary64) y) (*.f64 y (exp.f64 z))) < 0.0

   1. Initial program 2.4%

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

      1. lift--.f64 N/A

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

      2. sub-neg N/A

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

      3. +-commutative N/A

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

      4. lift-/.f64 N/A

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

      5. distribute-neg-frac2 N/A

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

      6. div-inv N/A

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

      7. *-commutative N/A

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

      8. lower-fma.f64 N/A

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

   4. Applied rewrites 64.2%

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

   5. Taylor expanded in z around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 99.8

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

   7. Applied rewrites 99.8%

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

   if 0.0 < (+.f64 (-.f64 #s(literal 1 binary64) y) (*.f64 y (exp.f64 z))) < 1e104

   1. Initial program 84.5%

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

   3. Taylor expanded in y around 0

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

      1. associate-/l* N/A

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

      2. div-sub N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. div-sub N/A

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

      6. lower-/.f64 N/A

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

      7. lower-expm1.f64 97.2

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

   5. Applied rewrites 97.2%

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

   if 1e104 < (+.f64 (-.f64 #s(literal 1 binary64) y) (*.f64 y (exp.f64 z)))

   1. Initial program 99.6%

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

   3. Taylor expanded in z around 0

      \[\leadsto x - \frac{\log \color{blue}{1}}{t} \]
   4. Step-by-step derivation

   5. Applied rewrites 49.8%

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

4. Final simplification 94.0%

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

Alternative 4: 87.4% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= (+ (* (exp z) y) (- 1.0 y)) 1e+104)
   (- x (* (/ (expm1 z) t) y))
   (- x (/ (log 1.0) t))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (((exp(z) * y) + (1.0 - y)) <= 1e+104) {
		tmp = x - ((expm1(z) / t) * y);
	} else {
		tmp = x - (log(1.0) / t);
	}
	return tmp;
}

Java

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

Python

def code(x, y, z, t):
	tmp = 0
	if ((math.exp(z) * y) + (1.0 - y)) <= 1e+104:
		tmp = x - ((math.expm1(z) / t) * y)
	else:
		tmp = x - (math.log(1.0) / t)
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (Float64(Float64(exp(z) * y) + Float64(1.0 - y)) <= 1e+104)
		tmp = Float64(x - Float64(Float64(expm1(z) / t) * y));
	else
		tmp = Float64(x - Float64(log(1.0) / t));
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (+.f64 (-.f64 #s(literal 1 binary64) y) (*.f64 y (exp.f64 z))) < 1e104

   1. Initial program 62.9%

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

   3. Taylor expanded in y around 0

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

      1. associate-/l* N/A

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

      2. div-sub N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. div-sub N/A

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

      6. lower-/.f64 N/A

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

      7. lower-expm1.f64 91.9

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

   5. Applied rewrites 91.9%

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

   if 1e104 < (+.f64 (-.f64 #s(literal 1 binary64) y) (*.f64 y (exp.f64 z)))

   1. Initial program 99.6%

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

   3. Taylor expanded in z around 0

      \[\leadsto x - \frac{\log \color{blue}{1}}{t} \]
   4. Step-by-step derivation

   5. Applied rewrites 49.8%

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

4. Final simplification 88.5%

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

Alternative 5: 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 65.9%

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

   1. lift--.f64 N/A

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

   2. sub-neg N/A

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

   3. +-commutative N/A

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

   4. lift-/.f64 N/A

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

   5. distribute-neg-frac2 N/A

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

   6. div-inv N/A

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

   7. *-commutative N/A

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

   8. lower-fma.f64 N/A

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

4. Applied rewrites 86.4%

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

   1. lift-fma.f64 N/A

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

   2. lift-/.f64 N/A

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

   3. associate-*l/ N/A

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

   4. associate-/l* N/A

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

   5. lift-log1p.f64 N/A

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

   6. lift-exp.f64 N/A

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

   7. lift-fma.f64 N/A

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

   8. +-commutative N/A

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

   9. associate-+r+ N/A

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

   10. lift-neg.f64 N/A

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

   11. sub-neg N/A

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

   12. *-commutative N/A

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

   13. neg-mul-1 N/A

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

   14. +-commutative N/A

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

6. Applied rewrites 98.8%

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

7. Final simplification 98.8%

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

Alternative 6: 75.8% accurate, 1.5× speedup

Math

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

FPCore

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

C

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (+.f64 (-.f64 #s(literal 1 binary64) y) (*.f64 y (exp.f64 z))) < 0.0

   1. Initial program 2.4%

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

   3. Taylor expanded in z around 0

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

      1. associate-*l/ N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 63.1

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

   5. Applied rewrites 63.1%

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

   7. Applied rewrites 77.3%

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

   if 0.0 < (+.f64 (-.f64 #s(literal 1 binary64) y) (*.f64 y (exp.f64 z)))

   1. Initial program 86.2%

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

   3. Taylor expanded in z around 0

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

      1. associate-*l/ N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 76.8

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

   5. Applied rewrites 76.8%

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

4. Final simplification 76.9%

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

Alternative 7: 75.8% accurate, 1.6× speedup

Math

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

FPCore

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

C

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (+.f64 (-.f64 #s(literal 1 binary64) y) (*.f64 y (exp.f64 z))) < 0.0

   1. Initial program 2.4%

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

   3. Taylor expanded in z around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 77.3

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

   5. Applied rewrites 77.3%

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

   if 0.0 < (+.f64 (-.f64 #s(literal 1 binary64) y) (*.f64 y (exp.f64 z)))

   1. Initial program 86.2%

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

   3. Taylor expanded in z around 0

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

      1. associate-*l/ N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 76.8

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

   5. Applied rewrites 76.8%

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

4. Final simplification 76.9%

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

Alternative 8: 75.6% accurate, 1.6× speedup

Math

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

FPCore

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

C

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (+.f64 (-.f64 #s(literal 1 binary64) y) (*.f64 y (exp.f64 z))) < 0.0

   1. Initial program 2.4%

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

   3. Taylor expanded in y around 0

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

      1. associate-/l* N/A

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

      2. div-sub N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. div-sub N/A

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

      6. lower-/.f64 N/A

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

      7. lower-expm1.f64 77.2

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

   5. Applied rewrites 77.2%

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

   6. Taylor expanded in z around 0

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

   8. Applied rewrites 77.2%

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

   if 0.0 < (+.f64 (-.f64 #s(literal 1 binary64) y) (*.f64 y (exp.f64 z)))

   1. Initial program 86.2%

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

   3. Taylor expanded in z around 0

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

      1. associate-*l/ N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 76.8

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

   5. Applied rewrites 76.8%

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

4. Final simplification 76.9%

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

Alternative 9: 88.6% accurate, 1.7× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (- x (/ (log (fma z y 1.0)) t))))
   (if (<= y -1.4e+200)
     t_1
     (if (<= y 3.7e+160) (- x (* (/ (expm1 z) t) y)) t_1))))

C

double code(double x, double y, double z, double t) {
	double t_1 = x - (log(fma(z, y, 1.0)) / t);
	double tmp;
	if (y <= -1.4e+200) {
		tmp = t_1;
	} else if (y <= 3.7e+160) {
		tmp = x - ((expm1(z) / t) * y);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	t_1 = Float64(x - Float64(log(fma(z, y, 1.0)) / t))
	tmp = 0.0
	if (y <= -1.4e+200)
		tmp = t_1;
	elseif (y <= 3.7e+160)
		tmp = Float64(x - Float64(Float64(expm1(z) / t) * y));
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < -1.39999999999999992e200 or 3.70000000000000016e160 < y

   1. Initial program 33.7%

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

   3. Taylor expanded in z around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 67.1

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

   5. Applied rewrites 67.1%

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

   if -1.39999999999999992e200 < y < 3.70000000000000016e160

   1. Initial program 71.8%

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

   3. Taylor expanded in y around 0

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

      1. associate-/l* N/A

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

      2. div-sub N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. div-sub N/A

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

      6. lower-/.f64 N/A

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

      7. lower-expm1.f64 95.0

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

   5. Applied rewrites 95.0%

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

Alternative 10: 81.7% accurate, 1.9× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= z -1.55e-28) (- x (/ (log 1.0) t)) (- x (* (/ z t) y))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (z <= -1.55e-28) {
		tmp = x - (log(1.0) / t);
	} else {
		tmp = x - ((z / t) * y);
	}
	return tmp;
}

Fortran

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

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if (z <= -1.55e-28) {
		tmp = x - (Math.log(1.0) / t);
	} else {
		tmp = x - ((z / t) * y);
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if z <= -1.55e-28:
		tmp = x - (math.log(1.0) / t)
	else:
		tmp = x - ((z / t) * y)
	return tmp

Julia

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

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if (z <= -1.55e-28)
		tmp = x - (log(1.0) / t);
	else
		tmp = x - ((z / t) * y);
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < -1.54999999999999996e-28

   1. Initial program 82.7%

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

   3. Taylor expanded in z around 0

      \[\leadsto x - \frac{\log \color{blue}{1}}{t} \]
   4. Step-by-step derivation

   5. Applied rewrites 66.6%

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

   if -1.54999999999999996e-28 < z

   1. Initial program 56.9%

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

   3. Taylor expanded in y around 0

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

      1. associate-/l* N/A

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

      2. div-sub N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. div-sub N/A

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

      6. lower-/.f64 N/A

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

      7. lower-expm1.f64 91.5

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

   5. Applied rewrites 91.5%

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

   6. Taylor expanded in z around 0

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

   8. Applied rewrites 91.5%

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

Alternative 11: 75.8% accurate, 3.4× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= z -2.3e+191)
   (- x (/ z (/ (- y (* (/ y t) 0.0)) (* (/ y t) y))))
   (- x (* (/ z t) y))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (z <= -2.3e+191) {
		tmp = x - (z / ((y - ((y / t) * 0.0)) / ((y / t) * y)));
	} else {
		tmp = x - ((z / t) * y);
	}
	return tmp;
}

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < -2.2999999999999999e191

   1. Initial program 77.7%

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

   3. Taylor expanded in z around 0

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

      1. associate-*l/ N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 39.8

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

   5. Applied rewrites 39.8%

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

   7. Applied rewrites 39.8%

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

   9. Applied rewrites 49.6%

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

   if -2.2999999999999999e191 < z

   1. Initial program 63.1%

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

   3. Taylor expanded in y around 0

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

      1. associate-/l* N/A

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

      2. div-sub N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. div-sub N/A

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

      6. lower-/.f64 N/A

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

      7. lower-expm1.f64 88.5

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

   5. Applied rewrites 88.5%

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

   6. Taylor expanded in z around 0

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

   8. Applied rewrites 85.5%

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

4. Final simplification 78.7%

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

Alternative 12: 75.4% accurate, 4.5× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= z -1.45e+192)
   (- x (/ z (/ (- (* t y) (* 0.0 y)) (* y y))))
   (- x (* (/ z t) y))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (z <= -1.45e+192) {
		tmp = x - (z / (((t * y) - (0.0 * y)) / (y * y)));
	} else {
		tmp = x - ((z / t) * y);
	}
	return tmp;
}

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < -1.4500000000000001e192

   1. Initial program 77.7%

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

   3. Taylor expanded in z around 0

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

      1. associate-*l/ N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 39.8

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

   5. Applied rewrites 39.8%

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

   7. Applied rewrites 39.8%

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

   9. Applied rewrites 43.1%

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

   if -1.4500000000000001e192 < z

   1. Initial program 63.1%

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

   3. Taylor expanded in y around 0

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

      1. associate-/l* N/A

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

      2. div-sub N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. div-sub N/A

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

      6. lower-/.f64 N/A

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

      7. lower-expm1.f64 88.5

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

   5. Applied rewrites 88.5%

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

   6. Taylor expanded in z around 0

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

   8. Applied rewrites 85.5%

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

4. Final simplification 77.5%

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

Alternative 13: 74.5% accurate, 11.3× speedup

Math

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

FPCore

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

C

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 65.9%

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

3. Taylor expanded in y around 0

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

   1. associate-/l* N/A

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

   2. div-sub N/A

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

   3. *-commutative N/A

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

   4. lower-*.f64 N/A

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

   5. div-sub N/A

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

   6. lower-/.f64 N/A

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

   7. lower-expm1.f64 86.9

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

5. Applied rewrites 86.9%

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

6. Taylor expanded in z around 0

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

8. Applied rewrites 74.9%

   \[\leadsto x - \frac{z}{t} \cdot y \]
9. Add Preprocessing

Alternative 14: 14.9% accurate, 11.9× speedup

Math

\[\begin{array}{l} \\ \frac{-z}{t} \cdot y \end{array} \]

FPCore

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

C

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 65.9%

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

3. Taylor expanded in t around 0

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

   1. mul-1-neg N/A

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

   2. distribute-neg-frac2 N/A

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

   3. lower-/.f64 N/A

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

   4. sub-neg N/A

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

   5. associate-+l+ N/A

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

   6. *-rgt-identity N/A

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

   7. cancel-sign-sub-inv N/A

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

   8. distribute-lft-out-- N/A

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

   9. lower-log1p.f64 N/A

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

   10. *-commutative N/A

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

   11. lower-*.f64 N/A

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

   12. lower-expm1.f64 N/A

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

   13. lower-neg.f64 26.6

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

5. Applied rewrites 26.6%

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

6. Taylor expanded in z around 0

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

8. Applied rewrites 12.5%

   \[\leadsto \frac{-z}{t} \cdot \color{blue}{y} \]
9. Add Preprocessing

Alternative 15: 13.0% accurate, 11.9× speedup

Math

\[\begin{array}{l} \\ \frac{-y}{t} \cdot z \end{array} \]

FPCore

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

C

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 65.9%

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

3. Taylor expanded in t around 0

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

   1. mul-1-neg N/A

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

   2. distribute-neg-frac2 N/A

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

   3. lower-/.f64 N/A

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

   4. sub-neg N/A

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

   5. associate-+l+ N/A

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

   6. *-rgt-identity N/A

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

   7. cancel-sign-sub-inv N/A

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

   8. distribute-lft-out-- N/A

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

   9. lower-log1p.f64 N/A

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

   10. *-commutative N/A

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

   11. lower-*.f64 N/A

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

   12. lower-expm1.f64 N/A

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

   13. lower-neg.f64 26.6

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

5. Applied rewrites 26.6%

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

6. Taylor expanded in z around 0

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

8. Applied rewrites 12.5%

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

10. Applied rewrites 11.1%

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

11. Final simplification 11.1%

    \[\leadsto \frac{-y}{t} \cdot z \]
12. Add Preprocessing

Developer Target 1: 75.3% accurate, 1.8× 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 2024243 
(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)))