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

Percentage Accurate: 61.8% → 96.5%

Time: 10.0s

Alternatives: 9

Speedup: 226.0×

• could not determine a ground truth

  1. x = 1.1677475857150566e+253
  2. y = 1.5381506510236513e-102
  3. z = 7.509493463962836e+135
  4. t = 1.603886696893722e-59

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

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x, y, z, t)
use fmin_fmax_functions
    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.8% 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

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x, y, z, t)
use fmin_fmax_functions
    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: 96.5% accurate, 0.3× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

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

   1. Initial program 2.6%

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

   3. Taylor expanded in x around -inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

   5. Applied rewrites 52.8%

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

   6. Taylor expanded in z around 0

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

      1. *-commutative N/A

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

      2. lift-*.f64 87.5

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

   8. Applied rewrites 87.5%

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

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

   1. Initial program 80.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}{y \cdot \left(\left(\frac{-1}{2} \cdot \frac{y \cdot {\left(e^{z} - 1\right)}^{2}}{t} + \frac{e^{z}}{t}\right) - \frac{1}{t}\right)} \]
   4. Step-by-step derivation

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. associate--l+ N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. *-commutative N/A

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

      7. lower-*.f64 N/A

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

      8. lower-pow.f64 N/A

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

      9. lower-expm1.f64 N/A

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

      10. sub-div N/A

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

      11. lower-/.f64 N/A

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

      12. lower-expm1.f64 99.9

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

   5. Applied rewrites 99.9%

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

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

   1. Initial program 95.7%

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower-expm1.f64 96.4

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

   5. Applied rewrites 96.4%

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

4. Final simplification 96.4%

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

Alternative 2: 92.8% accurate, 0.5× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 58.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 - \frac{\color{blue}{y \cdot \left(e^{z} - 1\right)}}{t} \]
   4. Step-by-step derivation

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-expm1.f64 93.3

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

   5. Applied rewrites 93.3%

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

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

   1. Initial program 95.7%

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower-expm1.f64 96.4

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

   5. Applied rewrites 96.4%

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

Alternative 3: 92.7% accurate, 0.5× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 58.7%

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-expm1.f64 92.8

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

   5. Applied rewrites 92.8%

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

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

   1. Initial program 95.8%

      \[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 \left(\left(e^{z} - 1\right) \cdot \color{blue}{y}\right)}{t} \]

      2. lower-*.f64 N/A

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

      3. lower-expm1.f64 96.5

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

   5. Applied rewrites 96.5%

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

Alternative 4: 87.4% accurate, 0.7× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 59.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 - \frac{\color{blue}{y \cdot \left(e^{z} - 1\right)}}{t} \]
   4. Step-by-step derivation

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-expm1.f64 91.3

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

   5. Applied rewrites 91.3%

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

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

   1. Initial program 95.2%

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

   3. Taylor expanded in x around inf

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

   5. Applied rewrites 40.3%

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

Alternative 5: 90.1% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= z -2.8e-181)
   (* (- (/ (log1p (* (expm1 z) y)) (* (- t) x)) -1.0) x)
   (- x (* y (/ z t)))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (z <= -2.8e-181) {
		tmp = ((log1p((expm1(z) * y)) / (-t * x)) - -1.0) * x;
	} else {
		tmp = x - (y * (z / t));
	}
	return tmp;
}

Java

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

Python

def code(x, y, z, t):
	tmp = 0
	if z <= -2.8e-181:
		tmp = ((math.log1p((math.expm1(z) * y)) / (-t * x)) - -1.0) * x
	else:
		tmp = x - (y * (z / t))
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (z <= -2.8e-181)
		tmp = Float64(Float64(Float64(log1p(Float64(expm1(z) * y)) / Float64(Float64(-t) * x)) - -1.0) * x);
	else
		tmp = Float64(x - Float64(y * Float64(z / t)));
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < -2.79999999999999986e-181

   1. Initial program 72.6%

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

   3. Taylor expanded in x around -inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

   5. Applied rewrites 78.6%

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

   6. Taylor expanded in y around 0

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

      1. *-commutative N/A

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

      2. lift-expm1.f64 N/A

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

      3. lift-*.f64 90.9

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

   8. Applied rewrites 90.9%

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

   if -2.79999999999999986e-181 < z

   1. Initial program 55.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 - \frac{\color{blue}{y \cdot \left(e^{z} - 1\right)}}{t} \]
   4. Step-by-step derivation

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-expm1.f64 92.8

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

   5. Applied rewrites 92.8%

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

   6. Taylor expanded in z around 0

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

      1. associate-/l* N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 96.1

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

   8. Applied rewrites 96.1%

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

4. Final simplification 93.7%

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

Alternative 6: 91.1% accurate, 1.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -2.5 \cdot 10^{+69} \lor \neg \left(y \leq 5.1 \cdot 10^{+85}\right):\\ \;\;\;\;\left(\frac{\mathsf{log1p}\left(\frac{1}{\frac{\mathsf{fma}\left(-0.5, z, 1\right)}{z}} \cdot y\right)}{\left(-t\right) \cdot x} - -1\right) \cdot x\\ \mathbf{else}:\\ \;\;\;\;x - \frac{\mathsf{expm1}\left(z\right) \cdot y}{t}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (or (<= y -2.5e+69) (not (<= y 5.1e+85)))
   (* (- (/ (log1p (* (/ 1.0 (/ (fma -0.5 z 1.0) z)) y)) (* (- t) x)) -1.0) x)
   (- x (/ (* (expm1 z) y) t))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if ((y <= -2.5e+69) || !(y <= 5.1e+85)) {
		tmp = ((log1p(((1.0 / (fma(-0.5, z, 1.0) / z)) * y)) / (-t * x)) - -1.0) * x;
	} else {
		tmp = x - ((expm1(z) * y) / t);
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	tmp = 0.0
	if ((y <= -2.5e+69) || !(y <= 5.1e+85))
		tmp = Float64(Float64(Float64(log1p(Float64(Float64(1.0 / Float64(fma(-0.5, z, 1.0) / z)) * y)) / Float64(Float64(-t) * x)) - -1.0) * x);
	else
		tmp = Float64(x - Float64(Float64(expm1(z) * y) / t));
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_] := If[Or[LessEqual[y, -2.5e+69], N[Not[LessEqual[y, 5.1e+85]], $MachinePrecision]], N[(N[(N[(N[Log[1 + N[(N[(1.0 / N[(N[(-0.5 * z + 1.0), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision] * y), $MachinePrecision]], $MachinePrecision] / N[((-t) * x), $MachinePrecision]), $MachinePrecision] - -1.0), $MachinePrecision] * x), $MachinePrecision], N[(x - N[(N[(N[(Exp[z] - 1), $MachinePrecision] * y), $MachinePrecision] / t), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -2.50000000000000018e69 or 5.0999999999999998e85 < y

   1. Initial program 36.9%

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

   3. Taylor expanded in x around -inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

   5. Applied rewrites 61.6%

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

   6. Taylor expanded in y around 0

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

      1. *-commutative N/A

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

      2. lift-expm1.f64 N/A

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

      3. lift-*.f64 88.9

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

   8. Applied rewrites 88.9%

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

      1. lift-expm1.f64 N/A

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

      2. unpow1 N/A

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

      3. metadata-eval N/A

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

      4. pow-neg N/A

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

      5. lower-/.f64 N/A

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

      6. lower-pow.f64 N/A

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

      7. lift-expm1.f64 88.9

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

   10. Applied rewrites 88.9%

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

   11. Taylor expanded in z around 0

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

       1. lower-/.f64 N/A

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

       2. +-commutative N/A

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

       3. lower-fma.f64 78.3

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

   13. Applied rewrites 78.3%

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

   if -2.50000000000000018e69 < y < 5.0999999999999998e85

   1. Initial program 72.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 - \frac{\color{blue}{y \cdot \left(e^{z} - 1\right)}}{t} \]
   4. Step-by-step derivation

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-expm1.f64 94.4

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

   5. Applied rewrites 94.4%

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

4. Final simplification 90.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -2.5 \cdot 10^{+69} \lor \neg \left(y \leq 5.1 \cdot 10^{+85}\right):\\ \;\;\;\;\left(\frac{\mathsf{log1p}\left(\frac{1}{\frac{\mathsf{fma}\left(-0.5, z, 1\right)}{z}} \cdot y\right)}{\left(-t\right) \cdot x} - -1\right) \cdot x\\ \mathbf{else}:\\ \;\;\;\;x - \frac{\mathsf{expm1}\left(z\right) \cdot y}{t}\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 71.1% accurate, 7.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -2.8 \cdot 10^{-240} \lor \neg \left(x \leq 2.4 \cdot 10^{-231}\right):\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;-y \cdot \frac{z}{t}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (or (<= x -2.8e-240) (not (<= x 2.4e-231))) x (- (* y (/ z t)))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if ((x <= -2.8e-240) || !(x <= 2.4e-231)) {
		tmp = x;
	} else {
		tmp = -(y * (z / t));
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x, y, z, t)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: tmp
    if ((x <= (-2.8d-240)) .or. (.not. (x <= 2.4d-231))) then
        tmp = x
    else
        tmp = -(y * (z / t))
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if ((x <= -2.8e-240) || !(x <= 2.4e-231)) {
		tmp = x;
	} else {
		tmp = -(y * (z / t));
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if (x <= -2.8e-240) or not (x <= 2.4e-231):
		tmp = x
	else:
		tmp = -(y * (z / t))
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if ((x <= -2.8e-240) || !(x <= 2.4e-231))
		tmp = x;
	else
		tmp = Float64(-Float64(y * Float64(z / t)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if ((x <= -2.8e-240) || ~((x <= 2.4e-231)))
		tmp = x;
	else
		tmp = -(y * (z / t));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[Or[LessEqual[x, -2.8e-240], N[Not[LessEqual[x, 2.4e-231]], $MachinePrecision]], x, (-N[(y * N[(z / t), $MachinePrecision]), $MachinePrecision])]

Derivation

1. Split input into 2 regimes

2. if x < -2.7999999999999999e-240 or 2.39999999999999992e-231 < x

   1. Initial program 66.0%

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

   3. Taylor expanded in x around inf

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

   5. Applied rewrites 72.6%

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

   if -2.7999999999999999e-240 < x < 2.39999999999999992e-231

   1. Initial program 30.8%

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

   3. Taylor expanded in x 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 \mathsf{neg}\left(\frac{\log \left(\left(1 + y \cdot e^{z}\right) - y\right)}{t}\right) \]

      2. lower-neg.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. associate--l+ N/A

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

      5. lower-log1p.f64 N/A

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

      6. lower--.f64 N/A

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

      7. *-commutative N/A

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

      8. lower-*.f64 N/A

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

      9. lift-exp.f64 18.6

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

   5. Applied rewrites 18.6%

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

   6. Taylor expanded in z around 0

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

      1. associate-/l* N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 68.2

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

   8. Applied rewrites 68.2%

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

4. Final simplification 72.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -2.8 \cdot 10^{-240} \lor \neg \left(x \leq 2.4 \cdot 10^{-231}\right):\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;-y \cdot \frac{z}{t}\\ \end{array} \]
5. Add Preprocessing

Alternative 8: 82.3% accurate, 8.7× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x, y, z, t)
use fmin_fmax_functions
    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 <= (-8200000.0d0)) then
        tmp = x
    else
        tmp = x - (y * (z / t))
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < -8.2e6

   1. Initial program 86.7%

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

   3. Taylor expanded in x around inf

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

   5. Applied rewrites 56.0%

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

   if -8.2e6 < z

   1. Initial program 54.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 - \frac{\color{blue}{y \cdot \left(e^{z} - 1\right)}}{t} \]
   4. Step-by-step derivation

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-expm1.f64 91.1

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

   5. Applied rewrites 91.1%

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

   6. Taylor expanded in z around 0

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

      1. associate-/l* N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 94.0

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

   8. Applied rewrites 94.0%

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

4. Final simplification 84.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -8200000:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;x - y \cdot \frac{z}{t}\\ \end{array} \]
5. Add Preprocessing

Alternative 9: 71.1% accurate, 226.0× speedup

Math

\[\begin{array}{l} \\ x \end{array} \]

FPCore

(FPCore (x y z t) :precision binary64 x)

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x, y, z, t)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    code = x
end function

Java

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

Python

def code(x, y, z, t):
	return x

Julia

function code(x, y, z, t)
	return x
end

MATLAB

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

Wolfram

code[x_, y_, z_, t_] := x

Derivation

1. Initial program 63.1%

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

3. Taylor expanded in x around inf

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

5. Applied rewrites 68.1%

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

Developer Target 1: 73.6% 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

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x, y, z, t)
use fmin_fmax_functions
    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 2025051 
(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)))