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

Percentage Accurate: 61.2% → 98.5%

Time: 14.3s

Alternatives: 9

Speedup: 211.0×

• could not determine a ground truth

  1. x = 2.1424880441968136e+202
  2. y = 2.0787733088875457e-134
  3. z = 5.173375048026849e+203
  4. t = 4.063401278306864e-269

Specification

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (- x (/ (log (+ (- 1.0 y) (* y (exp z)))) t)))

C

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

Fortran

real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    code = x - (log(((1.0d0 - y) + (y * exp(z)))) / t)
end function

Java

public static double code(double x, double y, double z, double t) {
	return x - (Math.log(((1.0 - y) + (y * Math.exp(z)))) / t);
}

Python

def code(x, y, z, t):
	return x - (math.log(((1.0 - y) + (y * math.exp(z)))) / t)

Julia

function code(x, y, z, t)
	return Float64(x - Float64(log(Float64(Float64(1.0 - y) + Float64(y * exp(z)))) / t))
end

MATLAB

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

Wolfram

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

Initial Program: 61.2% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (- x (/ (log (+ (- 1.0 y) (* y (exp z)))) t)))

C

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

Fortran

real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    code = x - (log(((1.0d0 - y) + (y * exp(z)))) / t)
end function

Java

public static double code(double x, double y, double z, double t) {
	return x - (Math.log(((1.0 - y) + (y * Math.exp(z)))) / t);
}

Python

def code(x, y, z, t):
	return x - (math.log(((1.0 - y) + (y * math.exp(z)))) / t)

Julia

function code(x, y, z, t)
	return Float64(x - Float64(log(Float64(Float64(1.0 - y) + Float64(y * exp(z)))) / t))
end

MATLAB

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

Wolfram

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

Alternative 1: 98.5% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

Wolfram

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

Derivation

1. Initial program 64.1%

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

   1. sub-neg 64.1%

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

   2. associate-+l+ 76.9%

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

   3. cancel-sign-sub 76.9%

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

   4. log1p-def 80.6%

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

   5. cancel-sign-sub 80.6%

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

   6. +-commutative 80.6%

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

   7. unsub-neg 80.6%

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

   8. *-rgt-identity 80.6%

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

   9. distribute-lft-out-- 80.6%

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

   10. expm1-def 98.1%

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

3. Simplified 98.1%

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

4. Final simplification 98.1%

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

Alternative 2: 93.5% accurate, 1.8× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= z -1.6e-5)
   (+ x (/ -1.0 (+ (* t 0.5) (/ t (* y (+ (exp z) -1.0))))))
   (- x (/ (log1p (* y z)) t))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (z <= -1.6e-5) {
		tmp = x + (-1.0 / ((t * 0.5) + (t / (y * (exp(z) + -1.0)))));
	} else {
		tmp = x - (log1p((y * z)) / t);
	}
	return tmp;
}

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if (z <= -1.6e-5) {
		tmp = x + (-1.0 / ((t * 0.5) + (t / (y * (Math.exp(z) + -1.0)))));
	} else {
		tmp = x - (Math.log1p((y * z)) / t);
	}
	return tmp;
}

Python

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < -1.59999999999999993e-5

   1. Initial program 85.0%

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

      1. sub-neg 85.0%

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

      2. associate-+l+ 85.0%

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

      3. cancel-sign-sub 85.0%

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

      4. log1p-def 99.8%

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

      5. cancel-sign-sub 99.8%

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

      6. +-commutative 99.8%

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

      7. unsub-neg 99.8%

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

      8. *-rgt-identity 99.8%

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

      9. distribute-lft-out-- 99.8%

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

      10. expm1-def 99.9%

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

   3. Simplified 99.9%

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

      1. clear-num 99.8%

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

      2. associate-/r/ 99.8%

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

   5. Applied egg-rr 99.8%

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

      1. associate-*l/ 99.9%

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

      2. *-un-lft-identity 99.9%

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

      3. clear-num 99.8%

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

   7. Applied egg-rr 99.8%

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

   8. Taylor expanded in y around 0 77.4%

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

   if -1.59999999999999993e-5 < z

   1. Initial program 57.0%

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

      1. sub-neg 57.0%

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

      2. associate-+l+ 74.1%

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

      3. cancel-sign-sub 74.1%

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

      4. log1p-def 74.1%

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

      5. cancel-sign-sub 74.1%

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

      6. +-commutative 74.1%

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

      7. unsub-neg 74.1%

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

      8. *-rgt-identity 74.1%

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

      9. distribute-lft-out-- 74.1%

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

      10. expm1-def 97.5%

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

   3. Simplified 97.5%

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

   4. Taylor expanded in z around 0 97.3%

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

   5. Taylor expanded in z around 0 97.2%

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

4. Final simplification 92.2%

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

Alternative 3: 88.8% accurate, 1.9× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= z -8.6e-9)
   (+ x (/ -1.0 (- (+ (* t 0.5) (/ t (* y z))) (* 0.5 (/ t y)))))
   (- x (/ (log1p (* y z)) t))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (z <= -8.6e-9) {
		tmp = x + (-1.0 / (((t * 0.5) + (t / (y * z))) - (0.5 * (t / y))));
	} else {
		tmp = x - (log1p((y * z)) / t);
	}
	return tmp;
}

Java

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

Python

def code(x, y, z, t):
	tmp = 0
	if z <= -8.6e-9:
		tmp = x + (-1.0 / (((t * 0.5) + (t / (y * z))) - (0.5 * (t / y))))
	else:
		tmp = x - (math.log1p((y * z)) / t)
	return tmp

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < -8.59999999999999925e-9

   1. Initial program 85.0%

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

      1. sub-neg 85.0%

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

      2. associate-+l+ 85.0%

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

      3. cancel-sign-sub 85.0%

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

      4. log1p-def 99.8%

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

      5. cancel-sign-sub 99.8%

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

      6. +-commutative 99.8%

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

      7. unsub-neg 99.8%

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

      8. *-rgt-identity 99.8%

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

      9. distribute-lft-out-- 99.8%

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

      10. expm1-def 99.9%

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

   3. Simplified 99.9%

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

      1. clear-num 99.8%

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

      2. associate-/r/ 99.8%

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

   5. Applied egg-rr 99.8%

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

      1. associate-*l/ 99.9%

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

      2. *-un-lft-identity 99.9%

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

      3. clear-num 99.8%

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

   7. Applied egg-rr 99.8%

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

   8. Taylor expanded in y around 0 77.4%

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

   9. Taylor expanded in z around 0 65.5%

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

   if -8.59999999999999925e-9 < z

   1. Initial program 57.0%

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

      1. sub-neg 57.0%

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

      2. associate-+l+ 74.1%

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

      3. cancel-sign-sub 74.1%

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

      4. log1p-def 74.1%

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

      5. cancel-sign-sub 74.1%

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

      6. +-commutative 74.1%

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

      7. unsub-neg 74.1%

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

      8. *-rgt-identity 74.1%

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

      9. distribute-lft-out-- 74.1%

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

      10. expm1-def 97.5%

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

   3. Simplified 97.5%

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

   4. Taylor expanded in z around 0 97.3%

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

   5. Taylor expanded in z around 0 97.2%

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

4. Final simplification 89.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -8.6 \cdot 10^{-9}:\\ \;\;\;\;x + \frac{-1}{\left(t \cdot 0.5 + \frac{t}{y \cdot z}\right) - 0.5 \cdot \frac{t}{y}}\\ \mathbf{else}:\\ \;\;\;\;x - \frac{\mathsf{log1p}\left(y \cdot z\right)}{t}\\ \end{array} \]

Alternative 4: 91.2% accurate, 1.9× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < -2e-3

   1. Initial program 85.0%

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

      1. sub-neg 85.0%

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

      2. associate-+l+ 85.0%

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

      3. cancel-sign-sub 85.0%

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

      4. log1p-def 99.8%

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

      5. cancel-sign-sub 99.8%

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

      6. +-commutative 99.8%

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

      7. unsub-neg 99.8%

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

      8. *-rgt-identity 99.8%

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

      9. distribute-lft-out-- 99.8%

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

      10. expm1-def 99.9%

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

   3. Simplified 99.9%

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

   4. Taylor expanded in y around 0 70.9%

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

      1. expm1-def 71.0%

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

   6. Simplified 71.0%

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

   if -2e-3 < z

   1. Initial program 57.0%

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

      1. sub-neg 57.0%

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

      2. associate-+l+ 74.1%

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

      3. cancel-sign-sub 74.1%

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

      4. log1p-def 74.1%

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

      5. cancel-sign-sub 74.1%

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

      6. +-commutative 74.1%

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

      7. unsub-neg 74.1%

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

      8. *-rgt-identity 74.1%

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

      9. distribute-lft-out-- 74.1%

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

      10. expm1-def 97.5%

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

   3. Simplified 97.5%

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

   4. Taylor expanded in z around 0 97.3%

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

   5. Taylor expanded in z around 0 97.2%

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

4. Final simplification 90.6%

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

Alternative 5: 84.1% accurate, 10.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := t \cdot 0.5 + \frac{t}{y \cdot z}\\ \mathbf{if}\;z \leq -1.2 \cdot 10^{-11}:\\ \;\;\;\;x + \frac{-1}{t_1 - 0.5 \cdot \frac{t}{y}}\\ \mathbf{else}:\\ \;\;\;\;x + \frac{-1}{t_1}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (+ (* t 0.5) (/ t (* y z)))))
   (if (<= z -1.2e-11)
     (+ x (/ -1.0 (- t_1 (* 0.5 (/ t y)))))
     (+ x (/ -1.0 t_1)))))

C

double code(double x, double y, double z, double t) {
	double t_1 = (t * 0.5) + (t / (y * z));
	double tmp;
	if (z <= -1.2e-11) {
		tmp = x + (-1.0 / (t_1 - (0.5 * (t / y))));
	} else {
		tmp = x + (-1.0 / t_1);
	}
	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 = (t * 0.5d0) + (t / (y * z))
    if (z <= (-1.2d-11)) then
        tmp = x + ((-1.0d0) / (t_1 - (0.5d0 * (t / y))))
    else
        tmp = x + ((-1.0d0) / t_1)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double t_1 = (t * 0.5) + (t / (y * z));
	double tmp;
	if (z <= -1.2e-11) {
		tmp = x + (-1.0 / (t_1 - (0.5 * (t / y))));
	} else {
		tmp = x + (-1.0 / t_1);
	}
	return tmp;
}

Python

def code(x, y, z, t):
	t_1 = (t * 0.5) + (t / (y * z))
	tmp = 0
	if z <= -1.2e-11:
		tmp = x + (-1.0 / (t_1 - (0.5 * (t / y))))
	else:
		tmp = x + (-1.0 / t_1)
	return tmp

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < -1.2000000000000001e-11

   1. Initial program 85.0%

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

      1. sub-neg 85.0%

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

      2. associate-+l+ 85.0%

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

      3. cancel-sign-sub 85.0%

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

      4. log1p-def 99.8%

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

      5. cancel-sign-sub 99.8%

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

      6. +-commutative 99.8%

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

      7. unsub-neg 99.8%

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

      8. *-rgt-identity 99.8%

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

      9. distribute-lft-out-- 99.8%

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

      10. expm1-def 99.9%

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

   3. Simplified 99.9%

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

      1. clear-num 99.8%

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

      2. associate-/r/ 99.8%

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

   5. Applied egg-rr 99.8%

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

      1. associate-*l/ 99.9%

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

      2. *-un-lft-identity 99.9%

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

      3. clear-num 99.8%

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

   7. Applied egg-rr 99.8%

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

   8. Taylor expanded in y around 0 77.4%

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

   9. Taylor expanded in z around 0 65.5%

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

   if -1.2000000000000001e-11 < z

   1. Initial program 57.0%

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

      1. sub-neg 57.0%

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

      2. associate-+l+ 74.1%

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

      3. cancel-sign-sub 74.1%

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

      4. log1p-def 74.1%

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

      5. cancel-sign-sub 74.1%

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

      6. +-commutative 74.1%

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

      7. unsub-neg 74.1%

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

      8. *-rgt-identity 74.1%

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

      9. distribute-lft-out-- 74.1%

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

      10. expm1-def 97.5%

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

   3. Simplified 97.5%

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

      1. clear-num 97.4%

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

      2. associate-/r/ 97.5%

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

   5. Applied egg-rr 97.5%

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

      1. associate-*l/ 97.5%

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

      2. *-un-lft-identity 97.5%

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

      3. clear-num 97.4%

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

   7. Applied egg-rr 97.4%

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

   8. Taylor expanded in y around 0 73.7%

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

   9. Taylor expanded in z around 0 92.2%

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

4. Final simplification 85.4%

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

Alternative 6: 82.4% accurate, 14.0× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= z -1e+120) x (+ x (/ -1.0 (+ (* t 0.5) (/ t (* y z)))))))

C

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

Fortran

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

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if (z <= -1e+120) {
		tmp = x;
	} else {
		tmp = x + (-1.0 / ((t * 0.5) + (t / (y * z))));
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < -9.9999999999999998e119

   1. Initial program 92.3%

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

      1. sub-neg 92.3%

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

      2. associate-+l+ 92.3%

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

      3. cancel-sign-sub 92.3%

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

      4. log1p-def 99.9%

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

      5. cancel-sign-sub 99.9%

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

      6. +-commutative 99.9%

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

      7. unsub-neg 99.9%

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

      8. *-rgt-identity 99.9%

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

      9. distribute-lft-out-- 99.9%

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

      10. expm1-def 99.9%

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

   3. Simplified 99.9%

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

   4. Taylor expanded in x around inf 62.7%

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

   if -9.9999999999999998e119 < z

   1. Initial program 59.0%

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

      1. sub-neg 59.0%

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

      2. associate-+l+ 74.1%

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

      3. cancel-sign-sub 74.1%

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

      4. log1p-def 77.2%

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

      5. cancel-sign-sub 77.2%

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

      6. +-commutative 77.2%

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

      7. unsub-neg 77.2%

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

      8. *-rgt-identity 77.2%

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

      9. distribute-lft-out-- 77.2%

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

      10. expm1-def 97.8%

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

   3. Simplified 97.8%

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

      1. clear-num 97.7%

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

      2. associate-/r/ 97.8%

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

   5. Applied egg-rr 97.8%

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

      1. associate-*l/ 97.8%

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

      2. *-un-lft-identity 97.8%

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

      3. clear-num 97.7%

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

   7. Applied egg-rr 97.7%

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

   8. Taylor expanded in y around 0 74.8%

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

   9. Taylor expanded in z around 0 88.3%

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

4. Final simplification 84.4%

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

Alternative 7: 77.4% accurate, 23.3× speedup

Math

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

FPCore

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

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (z <= -9.2e+120) {
		tmp = x;
	} else {
		tmp = x - (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) :: tmp
    if (z <= (-9.2d+120)) then
        tmp = x
    else
        tmp = x - (z * (y / t))
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < -9.1999999999999997e120

   1. Initial program 92.3%

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

      1. sub-neg 92.3%

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

      2. associate-+l+ 92.3%

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

      3. cancel-sign-sub 92.3%

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

      4. log1p-def 99.9%

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

      5. cancel-sign-sub 99.9%

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

      6. +-commutative 99.9%

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

      7. unsub-neg 99.9%

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

      8. *-rgt-identity 99.9%

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

      9. distribute-lft-out-- 99.9%

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

      10. expm1-def 99.9%

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

   3. Simplified 99.9%

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

   4. Taylor expanded in x around inf 62.7%

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

   if -9.1999999999999997e120 < z

   1. Initial program 59.0%

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

      1. sub-neg 59.0%

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

      2. associate-+l+ 74.1%

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

      3. cancel-sign-sub 74.1%

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

      4. log1p-def 77.2%

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

      5. cancel-sign-sub 77.2%

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

      6. +-commutative 77.2%

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

      7. unsub-neg 77.2%

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

      8. *-rgt-identity 77.2%

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

      9. distribute-lft-out-- 77.2%

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

      10. expm1-def 97.8%

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

   3. Simplified 97.8%

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

   4. Taylor expanded in z around 0 86.1%

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

      1. associate-/l* 86.9%

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

      2. associate-/r/ 82.6%

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

   6. Simplified 82.6%

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

4. Final simplification 79.6%

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

Alternative 8: 80.2% accurate, 23.3× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= z -1e+120) x (- x (/ y (/ t z)))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (z <= -1e+120) {
		tmp = x;
	} else {
		tmp = x - (y / (t / z));
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: tmp
    if (z <= (-1d+120)) then
        tmp = x
    else
        tmp = x - (y / (t / z))
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < -9.9999999999999998e119

   1. Initial program 92.3%

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

      1. sub-neg 92.3%

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

      2. associate-+l+ 92.3%

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

      3. cancel-sign-sub 92.3%

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

      4. log1p-def 99.9%

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

      5. cancel-sign-sub 99.9%

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

      6. +-commutative 99.9%

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

      7. unsub-neg 99.9%

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

      8. *-rgt-identity 99.9%

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

      9. distribute-lft-out-- 99.9%

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

      10. expm1-def 99.9%

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

   3. Simplified 99.9%

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

   4. Taylor expanded in x around inf 62.7%

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

   if -9.9999999999999998e119 < z

   1. Initial program 59.0%

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

      1. sub-neg 59.0%

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

      2. associate-+l+ 74.1%

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

      3. cancel-sign-sub 74.1%

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

      4. log1p-def 77.2%

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

      5. cancel-sign-sub 77.2%

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

      6. +-commutative 77.2%

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

      7. unsub-neg 77.2%

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

      8. *-rgt-identity 77.2%

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

      9. distribute-lft-out-- 77.2%

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

      10. expm1-def 97.8%

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

   3. Simplified 97.8%

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

   4. Taylor expanded in z around 0 86.1%

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

      1. associate-/l* 86.9%

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

   6. Simplified 86.9%

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

4. Final simplification 83.2%

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

Alternative 9: 71.2% accurate, 211.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 64.1%

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

   1. sub-neg 64.1%

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

   2. associate-+l+ 76.9%

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

   3. cancel-sign-sub 76.9%

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

   4. log1p-def 80.6%

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

   5. cancel-sign-sub 80.6%

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

   6. +-commutative 80.6%

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

   7. unsub-neg 80.6%

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

   8. *-rgt-identity 80.6%

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

   9. distribute-lft-out-- 80.6%

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

   10. expm1-def 98.1%

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

3. Simplified 98.1%

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

4. Taylor expanded in x around inf 70.1%

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

5. Final simplification 70.1%

   \[\leadsto x \]

Developer target: 74.7% accurate, 1.9× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Reproduce

herbie shell --seed 2023310 
(FPCore (x y z t)
  :name "System.Random.MWC.Distributions:truncatedExp from mwc-random-0.13.3.2"
  :precision binary64

  :herbie-target
  (if (< z -2.8874623088207947e+119) (- (- x (/ (/ (- 0.5) (* y t)) (* z z))) (* (/ (- 0.5) (* y t)) (/ (/ 2.0 z) (* z z)))) (- x (/ (log (+ 1.0 (* z y))) t)))

  (- x (/ (log (+ (- 1.0 y) (* y (exp z)))) t)))