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

Percentage Accurate: 62.0% → 99.2%

Time: 19.1s

Alternatives: 9

Speedup: 11.3×

• could not determine a ground truth

  1. x = 4.64324916526989e-63
  2. y = 3.1095637680411256e+184
  3. z = 4.550677347805658e+47
  4. t = -1.5235833384157883e+66

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.0% 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:\\ \;\;\;\;x - \frac{\mathsf{log1p}\left(z \cdot y\right)}{t}\\ \mathbf{elif}\;t\_1 \leq 2:\\ \;\;\;\;x - \frac{\mathsf{expm1}\left(z\right)}{t} \cdot y\\ \mathbf{else}:\\ \;\;\;\;x - \frac{\log \left(\mathsf{expm1}\left(z\right) \cdot y\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)
     (- x (/ (log1p (* z y)) t))
     (if (<= t_1 2.0)
       (- x (* (/ (expm1 z) t) y))
       (- x (/ (log (* (expm1 z) y)) 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 = x - (log1p((z * y)) / t);
	} else if (t_1 <= 2.0) {
		tmp = x - ((expm1(z) / t) * y);
	} else {
		tmp = x - (log((expm1(z) * y)) / t);
	}
	return tmp;
}

Java

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

Python

def code(x, y, z, t):
	t_1 = (math.exp(z) * y) + (1.0 - y)
	tmp = 0
	if t_1 <= 0.0:
		tmp = x - (math.log1p((z * y)) / t)
	elif t_1 <= 2.0:
		tmp = x - ((math.expm1(z) / t) * y)
	else:
		tmp = x - (math.log((math.expm1(z) * y)) / 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 = Float64(x - Float64(log1p(Float64(z * y)) / t));
	elseif (t_1 <= 2.0)
		tmp = Float64(x - Float64(Float64(expm1(z) / t) * y));
	else
		tmp = Float64(x - Float64(log(Float64(expm1(z) * y)) / 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[(x - N[(N[Log[1 + N[(z * y), $MachinePrecision]], $MachinePrecision] / t), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 2.0], N[(x - N[(N[(N[(Exp[z] - 1), $MachinePrecision] / t), $MachinePrecision] * y), $MachinePrecision]), $MachinePrecision], N[(x - N[(N[Log[N[(N[(Exp[z] - 1), $MachinePrecision] * y), $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.1%

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

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

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

   7. Taylor expanded in z around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 99.8

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

   9. Applied rewrites 99.8%

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

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

   1. Initial program 82.2%

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

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

   5. Applied rewrites 99.7%

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

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

   1. Initial program 97.9%

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

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

   5. Applied rewrites 99.9%

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

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

Alternative 2: 93.9% 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:\\ \;\;\;\;x - \frac{\mathsf{log1p}\left(z \cdot y\right)}{t}\\ \mathbf{elif}\;t\_1 \leq 4 \cdot 10^{+38}:\\ \;\;\;\;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)
     (- x (/ (log1p (* z y)) t))
     (if (<= t_1 4e+38) (- 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 = x - (log1p((z * y)) / t);
	} else if (t_1 <= 4e+38) {
		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 t_1 = (Math.exp(z) * y) + (1.0 - y);
	double tmp;
	if (t_1 <= 0.0) {
		tmp = x - (Math.log1p((z * y)) / t);
	} else if (t_1 <= 4e+38) {
		tmp = x - ((Math.expm1(z) / t) * y);
	} else {
		tmp = x - (Math.log(1.0) / t);
	}
	return tmp;
}

Python

def code(x, y, z, t):
	t_1 = (math.exp(z) * y) + (1.0 - y)
	tmp = 0
	if t_1 <= 0.0:
		tmp = x - (math.log1p((z * y)) / t)
	elif t_1 <= 4e+38:
		tmp = x - ((math.expm1(z) / t) * y)
	else:
		tmp = x - (math.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 = Float64(x - Float64(log1p(Float64(z * y)) / t));
	elseif (t_1 <= 4e+38)
		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[(x - N[(N[Log[1 + N[(z * y), $MachinePrecision]], $MachinePrecision] / t), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 4e+38], 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.1%

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

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

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

   7. Taylor expanded in z around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 99.8

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

   9. Applied rewrites 99.8%

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

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

   1. Initial program 82.3%

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

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

   5. Applied rewrites 99.2%

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

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

   1. Initial program 97.8%

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

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

4. Final simplification 95.9%

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

Alternative 3: 87.9% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;e^{z} \cdot y + \left(1 - y\right) \leq 4 \cdot 10^{+38}:\\ \;\;\;\;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)) 4e+38)
   (- 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)) <= 4e+38) {
		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)) <= 4e+38) {
		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)) <= 4e+38:
		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)) <= 4e+38)
		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], 4e+38], 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))) < 3.99999999999999991e38

   1. Initial program 57.2%

      \[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 90.4

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

   5. Applied rewrites 90.4%

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

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

   1. Initial program 97.8%

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

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

4. Final simplification 87.7%

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

Alternative 4: 82.0% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (exp.f64 z) < 0.0

   1. Initial program 82.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{\log \color{blue}{1}}{t} \]
   4. Step-by-step derivation

   5. Applied rewrites 70.9%

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

   if 0.0 < (exp.f64 z)

   1. Initial program 52.1%

      \[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 \color{blue}{x + z \cdot \left(\frac{-1}{2} \cdot \frac{z \cdot \left(y + -1 \cdot {y}^{2}\right)}{t} - \frac{y}{t}\right)} \]
   4. Step-by-step derivation

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

   5. Applied rewrites 75.7%

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

   6. Taylor expanded in y around inf

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

   8. Applied rewrites 3.0%

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

   9. Taylor expanded in y around 0

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

   11. Applied rewrites 87.1%

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

Alternative 5: 98.5% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

Wolfram

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

Derivation

1. Initial program 60.8%

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

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

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

7. Final simplification 98.4%

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

Alternative 6: 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 \cdot y}{t}\\ \mathbf{else}:\\ \;\;\;\;x - \frac{z}{\frac{t}{y}}\\ \end{array} \end{array} \]

FPCore

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

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

Python

def code(x, y, z, t):
	tmp = 0
	if ((math.exp(z) * y) + (1.0 - y)) <= 0.0:
		tmp = x - ((z * y) / t)
	else:
		tmp = x - (z / (t / y))
	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 * y) / t));
	else
		tmp = Float64(x - Float64(z / Float64(t / y)));
	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 * y) / t);
	else
		tmp = x - (z / (t / y));
	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 * y), $MachinePrecision] / t), $MachinePrecision]), $MachinePrecision], N[(x - N[(z / N[(t / y), $MachinePrecision]), $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.1%

      \[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 72.3

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

   5. Applied rewrites 72.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 84.3%

      \[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 77.1

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

   5. Applied rewrites 77.1%

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

   7. Applied rewrites 77.1%

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

4. Final simplification 75.7%

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

Alternative 7: 75.4% 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 \cdot y}{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 (/ (* z y) 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 - ((z * y) / 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 - ((z * y) / 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 - ((z * y) / 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 - ((z * y) / 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(z * y) / 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 - ((z * y) / 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[(z * y), $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.1%

      \[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 72.3

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

   5. Applied rewrites 72.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 84.3%

      \[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 77.1

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

   5. Applied rewrites 77.1%

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

4. Final simplification 75.7%

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

Alternative 8: 75.1% accurate, 1.8× speedup

Math

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

FPCore

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

C

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

Python

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (exp.f64 z) < 0.0

   1. Initial program 82.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 46.8

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

   5. Applied rewrites 46.8%

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

   if 0.0 < (exp.f64 z)

   1. Initial program 52.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 87.4

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

   5. Applied rewrites 87.4%

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

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

Alternative 9: 74.1% 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 60.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 85.0

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

5. Applied rewrites 85.0%

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

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

Developer Target 1: 74.5% 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 2024255 
(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)))