Numeric.SpecFunctions:incompleteBetaWorker from math-functions-0.1.5.2, A

Percentage Accurate: 98.4% → 98.4%

Time: 15.9s

Alternatives: 20

Speedup: 1.0×

• 47.2% of points produce a very large (infinite) output. You may want to add a precondition.

Specification

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 98.4% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 98.4% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 98.2%

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

3. Final simplification 98.2%

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

Alternative 2: 93.6% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;t + -1 \leq -4 \lor \neg \left(t + -1 \leq 200\right):\\ \;\;\;\;\frac{x \cdot e^{\left(t + -1\right) \cdot \log a - b}}{y}\\ \mathbf{else}:\\ \;\;\;\;\frac{x \cdot e^{\left(y \cdot \log z - \log a\right) - b}}{y}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (or (<= (+ t -1.0) -4.0) (not (<= (+ t -1.0) 200.0)))
   (/ (* x (exp (- (* (+ t -1.0) (log a)) b))) y)
   (/ (* x (exp (- (- (* y (log z)) (log a)) b))) y)))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (((t + -1.0) <= -4.0) || !((t + -1.0) <= 200.0)) {
		tmp = (x * exp((((t + -1.0) * log(a)) - b))) / y;
	} else {
		tmp = (x * exp((((y * log(z)) - log(a)) - b))) / y;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: tmp
    if (((t + (-1.0d0)) <= (-4.0d0)) .or. (.not. ((t + (-1.0d0)) <= 200.0d0))) then
        tmp = (x * exp((((t + (-1.0d0)) * log(a)) - b))) / y
    else
        tmp = (x * exp((((y * log(z)) - log(a)) - b))) / y
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (((t + -1.0) <= -4.0) || !((t + -1.0) <= 200.0)) {
		tmp = (x * Math.exp((((t + -1.0) * Math.log(a)) - b))) / y;
	} else {
		tmp = (x * Math.exp((((y * Math.log(z)) - Math.log(a)) - b))) / y;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	tmp = 0
	if ((t + -1.0) <= -4.0) or not ((t + -1.0) <= 200.0):
		tmp = (x * math.exp((((t + -1.0) * math.log(a)) - b))) / y
	else:
		tmp = (x * math.exp((((y * math.log(z)) - math.log(a)) - b))) / y
	return tmp

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if ((Float64(t + -1.0) <= -4.0) || !(Float64(t + -1.0) <= 200.0))
		tmp = Float64(Float64(x * exp(Float64(Float64(Float64(t + -1.0) * log(a)) - b))) / y);
	else
		tmp = Float64(Float64(x * exp(Float64(Float64(Float64(y * log(z)) - log(a)) - b))) / y);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if (((t + -1.0) <= -4.0) || ~(((t + -1.0) <= 200.0)))
		tmp = (x * exp((((t + -1.0) * log(a)) - b))) / y;
	else
		tmp = (x * exp((((y * log(z)) - log(a)) - b))) / y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[Or[LessEqual[N[(t + -1.0), $MachinePrecision], -4.0], N[Not[LessEqual[N[(t + -1.0), $MachinePrecision], 200.0]], $MachinePrecision]], N[(N[(x * N[Exp[N[(N[(N[(t + -1.0), $MachinePrecision] * N[Log[a], $MachinePrecision]), $MachinePrecision] - b), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / y), $MachinePrecision], N[(N[(x * N[Exp[N[(N[(N[(y * N[Log[z], $MachinePrecision]), $MachinePrecision] - N[Log[a], $MachinePrecision]), $MachinePrecision] - b), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / y), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (-.f64 t #s(literal 1 binary64)) < -4 or 200 < (-.f64 t #s(literal 1 binary64))

   1. Initial program 99.3%

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

   3. Taylor expanded in y around 0 91.3%

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

   if -4 < (-.f64 t #s(literal 1 binary64)) < 200

   1. Initial program 97.3%

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

   3. Taylor expanded in t around 0 97.1%

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

      1. +-commutative 97.1%

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

      2. mul-1-neg 97.1%

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

      3. unsub-neg 97.1%

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

   5. Simplified 97.1%

      \[\leadsto \frac{x \cdot \color{blue}{e^{\left(y \cdot \log z - \log a\right) - b}}}{y} \]
3. Recombined 2 regimes into one program.

4. Final simplification 94.3%

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

Alternative 3: 89.0% accurate, 1.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -6.8 \cdot 10^{+96} \lor \neg \left(y \leq 4.2 \cdot 10^{+141}\right):\\ \;\;\;\;\frac{x \cdot \frac{{z}^{y}}{a}}{y}\\ \mathbf{else}:\\ \;\;\;\;\frac{x \cdot e^{\left(t + -1\right) \cdot \log a - b}}{y}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (or (<= y -6.8e+96) (not (<= y 4.2e+141)))
   (/ (* x (/ (pow z y) a)) y)
   (/ (* x (exp (- (* (+ t -1.0) (log a)) b))) y)))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((y <= -6.8e+96) || !(y <= 4.2e+141)) {
		tmp = (x * (pow(z, y) / a)) / y;
	} else {
		tmp = (x * exp((((t + -1.0) * log(a)) - b))) / y;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: tmp
    if ((y <= (-6.8d+96)) .or. (.not. (y <= 4.2d+141))) then
        tmp = (x * ((z ** y) / a)) / y
    else
        tmp = (x * exp((((t + (-1.0d0)) * log(a)) - b))) / y
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((y <= -6.8e+96) || !(y <= 4.2e+141)) {
		tmp = (x * (Math.pow(z, y) / a)) / y;
	} else {
		tmp = (x * Math.exp((((t + -1.0) * Math.log(a)) - b))) / y;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	tmp = 0
	if (y <= -6.8e+96) or not (y <= 4.2e+141):
		tmp = (x * (math.pow(z, y) / a)) / y
	else:
		tmp = (x * math.exp((((t + -1.0) * math.log(a)) - b))) / y
	return tmp

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if ((y <= -6.8e+96) || !(y <= 4.2e+141))
		tmp = Float64(Float64(x * Float64((z ^ y) / a)) / y);
	else
		tmp = Float64(Float64(x * exp(Float64(Float64(Float64(t + -1.0) * log(a)) - b))) / y);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if ((y <= -6.8e+96) || ~((y <= 4.2e+141)))
		tmp = (x * ((z ^ y) / a)) / y;
	else
		tmp = (x * exp((((t + -1.0) * log(a)) - b))) / y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[Or[LessEqual[y, -6.8e+96], N[Not[LessEqual[y, 4.2e+141]], $MachinePrecision]], N[(N[(x * N[(N[Power[z, y], $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision] / y), $MachinePrecision], N[(N[(x * N[Exp[N[(N[(N[(t + -1.0), $MachinePrecision] * N[Log[a], $MachinePrecision]), $MachinePrecision] - b), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / y), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -6.8000000000000002e96 or 4.1999999999999997e141 < y

   1. Initial program 100.0%

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

   3. Taylor expanded in t around 0 97.1%

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

      1. +-commutative 97.1%

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

      2. mul-1-neg 97.1%

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

      3. unsub-neg 97.1%

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

   5. Simplified 97.1%

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

   6. Taylor expanded in b around 0 92.9%

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

      1. div-exp 92.9%

         \[\leadsto \frac{x \cdot \color{blue}{\frac{e^{y \cdot \log z}}{e^{\log a}}}}{y} \]

      2. *-commutative 92.9%

         \[\leadsto \frac{x \cdot \frac{e^{\color{blue}{\log z \cdot y}}}{e^{\log a}}}{y} \]

      3. exp-to-pow 92.9%

         \[\leadsto \frac{x \cdot \frac{\color{blue}{{z}^{y}}}{e^{\log a}}}{y} \]

      4. rem-exp-log 92.9%

         \[\leadsto \frac{x \cdot \frac{{z}^{y}}{\color{blue}{a}}}{y} \]

   8. Simplified 92.9%

      \[\leadsto \frac{\color{blue}{x \cdot \frac{{z}^{y}}{a}}}{y} \]

   if -6.8000000000000002e96 < y < 4.1999999999999997e141

   1. Initial program 97.6%

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

   3. Taylor expanded in y around 0 92.1%

      \[\leadsto \color{blue}{\frac{x \cdot e^{\log a \cdot \left(t - 1\right) - b}}{y}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 92.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -6.8 \cdot 10^{+96} \lor \neg \left(y \leq 4.2 \cdot 10^{+141}\right):\\ \;\;\;\;\frac{x \cdot \frac{{z}^{y}}{a}}{y}\\ \mathbf{else}:\\ \;\;\;\;\frac{x \cdot e^{\left(t + -1\right) \cdot \log a - b}}{y}\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 81.7% accurate, 1.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -9.5 \cdot 10^{+59} \lor \neg \left(y \leq 9.5 \cdot 10^{+46}\right):\\ \;\;\;\;\frac{x \cdot \frac{{z}^{y}}{a}}{y}\\ \mathbf{else}:\\ \;\;\;\;\frac{x \cdot \frac{{a}^{\left(t + -1\right)}}{e^{b}}}{y}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (or (<= y -9.5e+59) (not (<= y 9.5e+46)))
   (/ (* x (/ (pow z y) a)) y)
   (/ (* x (/ (pow a (+ t -1.0)) (exp b))) y)))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((y <= -9.5e+59) || !(y <= 9.5e+46)) {
		tmp = (x * (pow(z, y) / a)) / y;
	} else {
		tmp = (x * (pow(a, (t + -1.0)) / exp(b))) / y;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: tmp
    if ((y <= (-9.5d+59)) .or. (.not. (y <= 9.5d+46))) then
        tmp = (x * ((z ** y) / a)) / y
    else
        tmp = (x * ((a ** (t + (-1.0d0))) / exp(b))) / y
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((y <= -9.5e+59) || !(y <= 9.5e+46)) {
		tmp = (x * (Math.pow(z, y) / a)) / y;
	} else {
		tmp = (x * (Math.pow(a, (t + -1.0)) / Math.exp(b))) / y;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	tmp = 0
	if (y <= -9.5e+59) or not (y <= 9.5e+46):
		tmp = (x * (math.pow(z, y) / a)) / y
	else:
		tmp = (x * (math.pow(a, (t + -1.0)) / math.exp(b))) / y
	return tmp

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if ((y <= -9.5e+59) || !(y <= 9.5e+46))
		tmp = Float64(Float64(x * Float64((z ^ y) / a)) / y);
	else
		tmp = Float64(Float64(x * Float64((a ^ Float64(t + -1.0)) / exp(b))) / y);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if ((y <= -9.5e+59) || ~((y <= 9.5e+46)))
		tmp = (x * ((z ^ y) / a)) / y;
	else
		tmp = (x * ((a ^ (t + -1.0)) / exp(b))) / y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[Or[LessEqual[y, -9.5e+59], N[Not[LessEqual[y, 9.5e+46]], $MachinePrecision]], N[(N[(x * N[(N[Power[z, y], $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision] / y), $MachinePrecision], N[(N[(x * N[(N[Power[a, N[(t + -1.0), $MachinePrecision]], $MachinePrecision] / N[Exp[b], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / y), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -9.50000000000000023e59 or 9.5000000000000008e46 < y

   1. Initial program 100.0%

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

   3. Taylor expanded in t around 0 92.3%

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

      1. +-commutative 92.3%

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

      2. mul-1-neg 92.3%

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

      3. unsub-neg 92.3%

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

   5. Simplified 92.3%

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

   6. Taylor expanded in b around 0 84.6%

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

      1. div-exp 84.6%

         \[\leadsto \frac{x \cdot \color{blue}{\frac{e^{y \cdot \log z}}{e^{\log a}}}}{y} \]

      2. *-commutative 84.6%

         \[\leadsto \frac{x \cdot \frac{e^{\color{blue}{\log z \cdot y}}}{e^{\log a}}}{y} \]

      3. exp-to-pow 84.6%

         \[\leadsto \frac{x \cdot \frac{\color{blue}{{z}^{y}}}{e^{\log a}}}{y} \]

      4. rem-exp-log 84.6%

         \[\leadsto \frac{x \cdot \frac{{z}^{y}}{\color{blue}{a}}}{y} \]

   8. Simplified 84.6%

      \[\leadsto \frac{\color{blue}{x \cdot \frac{{z}^{y}}{a}}}{y} \]

   if -9.50000000000000023e59 < y < 9.5000000000000008e46

   1. Initial program 97.0%

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

   3. Taylor expanded in y around 0 95.4%

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

      1. div-exp 83.8%

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

      2. exp-to-pow 84.8%

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

      3. sub-neg 84.8%

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

      4. metadata-eval 84.8%

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

   5. Simplified 84.8%

      \[\leadsto \frac{x \cdot \color{blue}{\frac{{a}^{\left(t + -1\right)}}{e^{b}}}}{y} \]
3. Recombined 2 regimes into one program.

4. Final simplification 84.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -9.5 \cdot 10^{+59} \lor \neg \left(y \leq 9.5 \cdot 10^{+46}\right):\\ \;\;\;\;\frac{x \cdot \frac{{z}^{y}}{a}}{y}\\ \mathbf{else}:\\ \;\;\;\;\frac{x \cdot \frac{{a}^{\left(t + -1\right)}}{e^{b}}}{y}\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 81.6% accurate, 1.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -2.1 \cdot 10^{+60} \lor \neg \left(y \leq 1.2 \cdot 10^{+47}\right):\\ \;\;\;\;\frac{x \cdot \frac{{z}^{y}}{a}}{y}\\ \mathbf{else}:\\ \;\;\;\;x \cdot \frac{{a}^{\left(t + -1\right)}}{y \cdot e^{b}}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (or (<= y -2.1e+60) (not (<= y 1.2e+47)))
   (/ (* x (/ (pow z y) a)) y)
   (* x (/ (pow a (+ t -1.0)) (* y (exp b))))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((y <= -2.1e+60) || !(y <= 1.2e+47)) {
		tmp = (x * (pow(z, y) / a)) / y;
	} else {
		tmp = x * (pow(a, (t + -1.0)) / (y * exp(b)));
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: tmp
    if ((y <= (-2.1d+60)) .or. (.not. (y <= 1.2d+47))) then
        tmp = (x * ((z ** y) / a)) / y
    else
        tmp = x * ((a ** (t + (-1.0d0))) / (y * exp(b)))
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((y <= -2.1e+60) || !(y <= 1.2e+47)) {
		tmp = (x * (Math.pow(z, y) / a)) / y;
	} else {
		tmp = x * (Math.pow(a, (t + -1.0)) / (y * Math.exp(b)));
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	tmp = 0
	if (y <= -2.1e+60) or not (y <= 1.2e+47):
		tmp = (x * (math.pow(z, y) / a)) / y
	else:
		tmp = x * (math.pow(a, (t + -1.0)) / (y * math.exp(b)))
	return tmp

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if ((y <= -2.1e+60) || !(y <= 1.2e+47))
		tmp = Float64(Float64(x * Float64((z ^ y) / a)) / y);
	else
		tmp = Float64(x * Float64((a ^ Float64(t + -1.0)) / Float64(y * exp(b))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if ((y <= -2.1e+60) || ~((y <= 1.2e+47)))
		tmp = (x * ((z ^ y) / a)) / y;
	else
		tmp = x * ((a ^ (t + -1.0)) / (y * exp(b)));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[Or[LessEqual[y, -2.1e+60], N[Not[LessEqual[y, 1.2e+47]], $MachinePrecision]], N[(N[(x * N[(N[Power[z, y], $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision] / y), $MachinePrecision], N[(x * N[(N[Power[a, N[(t + -1.0), $MachinePrecision]], $MachinePrecision] / N[(y * N[Exp[b], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -2.1000000000000001e60 or 1.20000000000000009e47 < y

   1. Initial program 100.0%

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

   3. Taylor expanded in t around 0 92.3%

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

      1. +-commutative 92.3%

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

      2. mul-1-neg 92.3%

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

      3. unsub-neg 92.3%

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

   5. Simplified 92.3%

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

   6. Taylor expanded in b around 0 84.6%

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

      1. div-exp 84.6%

         \[\leadsto \frac{x \cdot \color{blue}{\frac{e^{y \cdot \log z}}{e^{\log a}}}}{y} \]

      2. *-commutative 84.6%

         \[\leadsto \frac{x \cdot \frac{e^{\color{blue}{\log z \cdot y}}}{e^{\log a}}}{y} \]

      3. exp-to-pow 84.6%

         \[\leadsto \frac{x \cdot \frac{\color{blue}{{z}^{y}}}{e^{\log a}}}{y} \]

      4. rem-exp-log 84.6%

         \[\leadsto \frac{x \cdot \frac{{z}^{y}}{\color{blue}{a}}}{y} \]

   8. Simplified 84.6%

      \[\leadsto \frac{\color{blue}{x \cdot \frac{{z}^{y}}{a}}}{y} \]

   if -2.1000000000000001e60 < y < 1.20000000000000009e47

   1. Initial program 97.0%

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

      1. associate-/l* 95.9%

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

      2. associate--l+ 95.9%

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

      3. exp-sum 89.4%

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

      4. associate-/l* 89.4%

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

      5. *-commutative 89.4%

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

      6. exp-to-pow 89.4%

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

      7. exp-diff 78.3%

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

      8. *-commutative 78.3%

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

      9. exp-to-pow 79.3%

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

      10. sub-neg 79.3%

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

      11. metadata-eval 79.3%

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

   3. Simplified 79.3%

      \[\leadsto \color{blue}{x \cdot \left({z}^{y} \cdot \frac{\frac{{a}^{\left(t + -1\right)}}{e^{b}}}{y}\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in y around 0 83.1%

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

      1. exp-to-pow 84.1%

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

      2. sub-neg 84.1%

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

      3. metadata-eval 84.1%

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

      4. associate-*r/ 83.0%

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

   7. Simplified 83.0%

      \[\leadsto \color{blue}{x \cdot \frac{{a}^{\left(t + -1\right)}}{y \cdot e^{b}}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 83.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -2.1 \cdot 10^{+60} \lor \neg \left(y \leq 1.2 \cdot 10^{+47}\right):\\ \;\;\;\;\frac{x \cdot \frac{{z}^{y}}{a}}{y}\\ \mathbf{else}:\\ \;\;\;\;x \cdot \frac{{a}^{\left(t + -1\right)}}{y \cdot e^{b}}\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 75.3% accurate, 2.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{x \cdot e^{-b}}{y}\\ \mathbf{if}\;b \leq -170000000000:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;b \leq -1.95 \cdot 10^{-272}:\\ \;\;\;\;\frac{x \cdot \frac{{z}^{y}}{a}}{y}\\ \mathbf{elif}\;b \leq 1.55 \cdot 10^{+44}:\\ \;\;\;\;\frac{x \cdot \frac{{a}^{t}}{a}}{y}\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (/ (* x (exp (- b))) y)))
   (if (<= b -170000000000.0)
     t_1
     (if (<= b -1.95e-272)
       (/ (* x (/ (pow z y) a)) y)
       (if (<= b 1.55e+44) (/ (* x (/ (pow a t) a)) y) t_1)))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = (x * exp(-b)) / y;
	double tmp;
	if (b <= -170000000000.0) {
		tmp = t_1;
	} else if (b <= -1.95e-272) {
		tmp = (x * (pow(z, y) / a)) / y;
	} else if (b <= 1.55e+44) {
		tmp = (x * (pow(a, t) / a)) / y;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: t_1
    real(8) :: tmp
    t_1 = (x * exp(-b)) / y
    if (b <= (-170000000000.0d0)) then
        tmp = t_1
    else if (b <= (-1.95d-272)) then
        tmp = (x * ((z ** y) / a)) / y
    else if (b <= 1.55d+44) then
        tmp = (x * ((a ** t) / a)) / y
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = (x * Math.exp(-b)) / y;
	double tmp;
	if (b <= -170000000000.0) {
		tmp = t_1;
	} else if (b <= -1.95e-272) {
		tmp = (x * (Math.pow(z, y) / a)) / y;
	} else if (b <= 1.55e+44) {
		tmp = (x * (Math.pow(a, t) / a)) / y;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	t_1 = (x * math.exp(-b)) / y
	tmp = 0
	if b <= -170000000000.0:
		tmp = t_1
	elif b <= -1.95e-272:
		tmp = (x * (math.pow(z, y) / a)) / y
	elif b <= 1.55e+44:
		tmp = (x * (math.pow(a, t) / a)) / y
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z, t, a, b)
	t_1 = Float64(Float64(x * exp(Float64(-b))) / y)
	tmp = 0.0
	if (b <= -170000000000.0)
		tmp = t_1;
	elseif (b <= -1.95e-272)
		tmp = Float64(Float64(x * Float64((z ^ y) / a)) / y);
	elseif (b <= 1.55e+44)
		tmp = Float64(Float64(x * Float64((a ^ t) / a)) / y);
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	t_1 = (x * exp(-b)) / y;
	tmp = 0.0;
	if (b <= -170000000000.0)
		tmp = t_1;
	elseif (b <= -1.95e-272)
		tmp = (x * ((z ^ y) / a)) / y;
	elseif (b <= 1.55e+44)
		tmp = (x * ((a ^ t) / a)) / y;
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(N[(x * N[Exp[(-b)], $MachinePrecision]), $MachinePrecision] / y), $MachinePrecision]}, If[LessEqual[b, -170000000000.0], t$95$1, If[LessEqual[b, -1.95e-272], N[(N[(x * N[(N[Power[z, y], $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision] / y), $MachinePrecision], If[LessEqual[b, 1.55e+44], N[(N[(x * N[(N[Power[a, t], $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision] / y), $MachinePrecision], t$95$1]]]]

Derivation

1. Split input into 3 regimes

2. if b < -1.7e11 or 1.54999999999999998e44 < b

   1. Initial program 100.0%

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

   3. Taylor expanded in t around 0 93.0%

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

      1. +-commutative 93.0%

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

      2. mul-1-neg 93.0%

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

      3. unsub-neg 93.0%

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

   5. Simplified 93.0%

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

   6. Taylor expanded in b around inf 86.9%

      \[\leadsto \frac{x \cdot e^{\color{blue}{-1 \cdot b}}}{y} \]
   7. Step-by-step derivation

      1. neg-mul-1 86.9%

         \[\leadsto \frac{x \cdot e^{\color{blue}{-b}}}{y} \]

   8. Simplified 86.9%

      \[\leadsto \frac{x \cdot e^{\color{blue}{-b}}}{y} \]

   if -1.7e11 < b < -1.9499999999999999e-272

   1. Initial program 97.6%

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

   3. Taylor expanded in t around 0 80.3%

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

      1. +-commutative 80.3%

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

      2. mul-1-neg 80.3%

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

      3. unsub-neg 80.3%

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

   5. Simplified 80.3%

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

   6. Taylor expanded in b around 0 80.3%

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

      1. div-exp 80.3%

         \[\leadsto \frac{x \cdot \color{blue}{\frac{e^{y \cdot \log z}}{e^{\log a}}}}{y} \]

      2. *-commutative 80.3%

         \[\leadsto \frac{x \cdot \frac{e^{\color{blue}{\log z \cdot y}}}{e^{\log a}}}{y} \]

      3. exp-to-pow 80.3%

         \[\leadsto \frac{x \cdot \frac{\color{blue}{{z}^{y}}}{e^{\log a}}}{y} \]

      4. rem-exp-log 82.1%

         \[\leadsto \frac{x \cdot \frac{{z}^{y}}{\color{blue}{a}}}{y} \]

   8. Simplified 82.1%

      \[\leadsto \frac{\color{blue}{x \cdot \frac{{z}^{y}}{a}}}{y} \]

   if -1.9499999999999999e-272 < b < 1.54999999999999998e44

   1. Initial program 96.2%

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

   3. Taylor expanded in y around 0 74.8%

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

   4. Taylor expanded in b around 0 73.7%

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

   6. Simplified 74.3%

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

      1. unpow-prod-up 74.5%

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

      2. inv-pow 74.5%

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

   8. Applied egg-rr 74.5%

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

      1. associate-*l/ 74.5%

         \[\leadsto \frac{x \cdot \color{blue}{\frac{1 \cdot {a}^{t}}{a}}}{y} \]

      2. *-lft-identity 74.5%

         \[\leadsto \frac{x \cdot \frac{\color{blue}{{a}^{t}}}{a}}{y} \]

   10. Simplified 74.5%

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

Alternative 7: 65.5% accurate, 2.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{x \cdot e^{-b}}{y}\\ \mathbf{if}\;b \leq -0.75:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;b \leq -3.7 \cdot 10^{-34}:\\ \;\;\;\;\frac{\frac{x}{a}}{y}\\ \mathbf{elif}\;b \leq 5.2 \cdot 10^{+51}:\\ \;\;\;\;\frac{x \cdot {a}^{t}}{y}\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (/ (* x (exp (- b))) y)))
   (if (<= b -0.75)
     t_1
     (if (<= b -3.7e-34)
       (/ (/ x a) y)
       (if (<= b 5.2e+51) (/ (* x (pow a t)) y) t_1)))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = (x * exp(-b)) / y;
	double tmp;
	if (b <= -0.75) {
		tmp = t_1;
	} else if (b <= -3.7e-34) {
		tmp = (x / a) / y;
	} else if (b <= 5.2e+51) {
		tmp = (x * pow(a, t)) / y;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: t_1
    real(8) :: tmp
    t_1 = (x * exp(-b)) / y
    if (b <= (-0.75d0)) then
        tmp = t_1
    else if (b <= (-3.7d-34)) then
        tmp = (x / a) / y
    else if (b <= 5.2d+51) then
        tmp = (x * (a ** t)) / y
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = (x * Math.exp(-b)) / y;
	double tmp;
	if (b <= -0.75) {
		tmp = t_1;
	} else if (b <= -3.7e-34) {
		tmp = (x / a) / y;
	} else if (b <= 5.2e+51) {
		tmp = (x * Math.pow(a, t)) / y;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	t_1 = (x * math.exp(-b)) / y
	tmp = 0
	if b <= -0.75:
		tmp = t_1
	elif b <= -3.7e-34:
		tmp = (x / a) / y
	elif b <= 5.2e+51:
		tmp = (x * math.pow(a, t)) / y
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z, t, a, b)
	t_1 = Float64(Float64(x * exp(Float64(-b))) / y)
	tmp = 0.0
	if (b <= -0.75)
		tmp = t_1;
	elseif (b <= -3.7e-34)
		tmp = Float64(Float64(x / a) / y);
	elseif (b <= 5.2e+51)
		tmp = Float64(Float64(x * (a ^ t)) / y);
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	t_1 = (x * exp(-b)) / y;
	tmp = 0.0;
	if (b <= -0.75)
		tmp = t_1;
	elseif (b <= -3.7e-34)
		tmp = (x / a) / y;
	elseif (b <= 5.2e+51)
		tmp = (x * (a ^ t)) / y;
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(N[(x * N[Exp[(-b)], $MachinePrecision]), $MachinePrecision] / y), $MachinePrecision]}, If[LessEqual[b, -0.75], t$95$1, If[LessEqual[b, -3.7e-34], N[(N[(x / a), $MachinePrecision] / y), $MachinePrecision], If[LessEqual[b, 5.2e+51], N[(N[(x * N[Power[a, t], $MachinePrecision]), $MachinePrecision] / y), $MachinePrecision], t$95$1]]]]

Derivation

1. Split input into 3 regimes

2. if b < -0.75 or 5.2000000000000002e51 < b

   1. Initial program 100.0%

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

   3. Taylor expanded in t around 0 93.3%

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

      1. +-commutative 93.3%

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

      2. mul-1-neg 93.3%

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

      3. unsub-neg 93.3%

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

   5. Simplified 93.3%

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

   6. Taylor expanded in b around inf 85.7%

      \[\leadsto \frac{x \cdot e^{\color{blue}{-1 \cdot b}}}{y} \]
   7. Step-by-step derivation

      1. neg-mul-1 85.7%

         \[\leadsto \frac{x \cdot e^{\color{blue}{-b}}}{y} \]

   8. Simplified 85.7%

      \[\leadsto \frac{x \cdot e^{\color{blue}{-b}}}{y} \]

   if -0.75 < b < -3.69999999999999988e-34

   1. Initial program 93.1%

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

   3. Taylor expanded in y around 0 79.1%

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

   4. Taylor expanded in b around 0 79.1%

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

   6. Simplified 72.2%

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

   7. Taylor expanded in t around 0 71.6%

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

      1. associate-/r* 85.5%

         \[\leadsto \color{blue}{\frac{\frac{x}{a}}{y}} \]

   9. Simplified 85.5%

      \[\leadsto \color{blue}{\frac{\frac{x}{a}}{y}} \]

   if -3.69999999999999988e-34 < b < 5.2000000000000002e51

   1. Initial program 96.9%

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

   3. Taylor expanded in y around 0 73.8%

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

   4. Taylor expanded in b around 0 73.0%

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

   6. Simplified 73.9%

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

   7. Taylor expanded in t around inf 57.9%

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

Alternative 8: 75.3% accurate, 2.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -0.82 \lor \neg \left(b \leq 2.8 \cdot 10^{+44}\right):\\ \;\;\;\;\frac{x \cdot e^{-b}}{y}\\ \mathbf{else}:\\ \;\;\;\;\frac{x \cdot \frac{{a}^{t}}{a}}{y}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (or (<= b -0.82) (not (<= b 2.8e+44)))
   (/ (* x (exp (- b))) y)
   (/ (* x (/ (pow a t) a)) y)))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((b <= -0.82) || !(b <= 2.8e+44)) {
		tmp = (x * exp(-b)) / y;
	} else {
		tmp = (x * (pow(a, t) / a)) / y;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: tmp
    if ((b <= (-0.82d0)) .or. (.not. (b <= 2.8d+44))) then
        tmp = (x * exp(-b)) / y
    else
        tmp = (x * ((a ** t) / a)) / y
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((b <= -0.82) || !(b <= 2.8e+44)) {
		tmp = (x * Math.exp(-b)) / y;
	} else {
		tmp = (x * (Math.pow(a, t) / a)) / y;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	tmp = 0
	if (b <= -0.82) or not (b <= 2.8e+44):
		tmp = (x * math.exp(-b)) / y
	else:
		tmp = (x * (math.pow(a, t) / a)) / y
	return tmp

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if ((b <= -0.82) || !(b <= 2.8e+44))
		tmp = Float64(Float64(x * exp(Float64(-b))) / y);
	else
		tmp = Float64(Float64(x * Float64((a ^ t) / a)) / y);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if ((b <= -0.82) || ~((b <= 2.8e+44)))
		tmp = (x * exp(-b)) / y;
	else
		tmp = (x * ((a ^ t) / a)) / y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[Or[LessEqual[b, -0.82], N[Not[LessEqual[b, 2.8e+44]], $MachinePrecision]], N[(N[(x * N[Exp[(-b)], $MachinePrecision]), $MachinePrecision] / y), $MachinePrecision], N[(N[(x * N[(N[Power[a, t], $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision] / y), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if b < -0.819999999999999951 or 2.8000000000000001e44 < b

   1. Initial program 100.0%

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

   3. Taylor expanded in t around 0 93.3%

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

      1. +-commutative 93.3%

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

      2. mul-1-neg 93.3%

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

      3. unsub-neg 93.3%

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

   5. Simplified 93.3%

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

   6. Taylor expanded in b around inf 85.7%

      \[\leadsto \frac{x \cdot e^{\color{blue}{-1 \cdot b}}}{y} \]
   7. Step-by-step derivation

      1. neg-mul-1 85.7%

         \[\leadsto \frac{x \cdot e^{\color{blue}{-b}}}{y} \]

   8. Simplified 85.7%

      \[\leadsto \frac{x \cdot e^{\color{blue}{-b}}}{y} \]

   if -0.819999999999999951 < b < 2.8000000000000001e44

   1. Initial program 96.7%

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

   3. Taylor expanded in y around 0 74.0%

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

   4. Taylor expanded in b around 0 73.3%

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

   6. Simplified 74.5%

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

      1. unpow-prod-up 74.6%

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

      2. inv-pow 74.6%

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

   8. Applied egg-rr 74.6%

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

      1. associate-*l/ 74.6%

         \[\leadsto \frac{x \cdot \color{blue}{\frac{1 \cdot {a}^{t}}{a}}}{y} \]

      2. *-lft-identity 74.6%

         \[\leadsto \frac{x \cdot \frac{\color{blue}{{a}^{t}}}{a}}{y} \]

   10. Simplified 74.6%

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

4. Final simplification 79.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq -0.82 \lor \neg \left(b \leq 2.8 \cdot 10^{+44}\right):\\ \;\;\;\;\frac{x \cdot e^{-b}}{y}\\ \mathbf{else}:\\ \;\;\;\;\frac{x \cdot \frac{{a}^{t}}{a}}{y}\\ \end{array} \]
5. Add Preprocessing

Alternative 9: 75.2% accurate, 2.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -0.82 \lor \neg \left(b \leq 1.5 \cdot 10^{+52}\right):\\ \;\;\;\;\frac{x \cdot e^{-b}}{y}\\ \mathbf{else}:\\ \;\;\;\;x \cdot \frac{{a}^{\left(t + -1\right)}}{y}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (or (<= b -0.82) (not (<= b 1.5e+52)))
   (/ (* x (exp (- b))) y)
   (* x (/ (pow a (+ t -1.0)) y))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((b <= -0.82) || !(b <= 1.5e+52)) {
		tmp = (x * exp(-b)) / y;
	} else {
		tmp = x * (pow(a, (t + -1.0)) / y);
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: tmp
    if ((b <= (-0.82d0)) .or. (.not. (b <= 1.5d+52))) then
        tmp = (x * exp(-b)) / y
    else
        tmp = x * ((a ** (t + (-1.0d0))) / y)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((b <= -0.82) || !(b <= 1.5e+52)) {
		tmp = (x * Math.exp(-b)) / y;
	} else {
		tmp = x * (Math.pow(a, (t + -1.0)) / y);
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	tmp = 0
	if (b <= -0.82) or not (b <= 1.5e+52):
		tmp = (x * math.exp(-b)) / y
	else:
		tmp = x * (math.pow(a, (t + -1.0)) / y)
	return tmp

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if ((b <= -0.82) || !(b <= 1.5e+52))
		tmp = Float64(Float64(x * exp(Float64(-b))) / y);
	else
		tmp = Float64(x * Float64((a ^ Float64(t + -1.0)) / y));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if ((b <= -0.82) || ~((b <= 1.5e+52)))
		tmp = (x * exp(-b)) / y;
	else
		tmp = x * ((a ^ (t + -1.0)) / y);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[Or[LessEqual[b, -0.82], N[Not[LessEqual[b, 1.5e+52]], $MachinePrecision]], N[(N[(x * N[Exp[(-b)], $MachinePrecision]), $MachinePrecision] / y), $MachinePrecision], N[(x * N[(N[Power[a, N[(t + -1.0), $MachinePrecision]], $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if b < -0.819999999999999951 or 1.5e52 < b

   1. Initial program 100.0%

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

   3. Taylor expanded in t around 0 93.3%

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

      1. +-commutative 93.3%

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

      2. mul-1-neg 93.3%

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

      3. unsub-neg 93.3%

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

   5. Simplified 93.3%

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

   6. Taylor expanded in b around inf 85.7%

      \[\leadsto \frac{x \cdot e^{\color{blue}{-1 \cdot b}}}{y} \]
   7. Step-by-step derivation

      1. neg-mul-1 85.7%

         \[\leadsto \frac{x \cdot e^{\color{blue}{-b}}}{y} \]

   8. Simplified 85.7%

      \[\leadsto \frac{x \cdot e^{\color{blue}{-b}}}{y} \]

   if -0.819999999999999951 < b < 1.5e52

   1. Initial program 96.7%

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

   3. Taylor expanded in y around 0 74.0%

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

   4. Taylor expanded in b around 0 73.3%

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

   6. Simplified 71.8%

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

4. Final simplification 78.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq -0.82 \lor \neg \left(b \leq 1.5 \cdot 10^{+52}\right):\\ \;\;\;\;\frac{x \cdot e^{-b}}{y}\\ \mathbf{else}:\\ \;\;\;\;x \cdot \frac{{a}^{\left(t + -1\right)}}{y}\\ \end{array} \]
5. Add Preprocessing

Alternative 10: 74.5% accurate, 2.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;t \leq -6 \cdot 10^{+121} \lor \neg \left(t \leq 6.5 \cdot 10^{-6}\right):\\ \;\;\;\;\frac{x \cdot {a}^{t}}{y}\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{a \cdot \left(y \cdot e^{b}\right)}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (or (<= t -6e+121) (not (<= t 6.5e-6)))
   (/ (* x (pow a t)) y)
   (/ x (* a (* y (exp b))))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((t <= -6e+121) || !(t <= 6.5e-6)) {
		tmp = (x * pow(a, t)) / y;
	} else {
		tmp = x / (a * (y * exp(b)));
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: tmp
    if ((t <= (-6d+121)) .or. (.not. (t <= 6.5d-6))) then
        tmp = (x * (a ** t)) / y
    else
        tmp = x / (a * (y * exp(b)))
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((t <= -6e+121) || !(t <= 6.5e-6)) {
		tmp = (x * Math.pow(a, t)) / y;
	} else {
		tmp = x / (a * (y * Math.exp(b)));
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	tmp = 0
	if (t <= -6e+121) or not (t <= 6.5e-6):
		tmp = (x * math.pow(a, t)) / y
	else:
		tmp = x / (a * (y * math.exp(b)))
	return tmp

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if ((t <= -6e+121) || !(t <= 6.5e-6))
		tmp = Float64(Float64(x * (a ^ t)) / y);
	else
		tmp = Float64(x / Float64(a * Float64(y * exp(b))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if ((t <= -6e+121) || ~((t <= 6.5e-6)))
		tmp = (x * (a ^ t)) / y;
	else
		tmp = x / (a * (y * exp(b)));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[Or[LessEqual[t, -6e+121], N[Not[LessEqual[t, 6.5e-6]], $MachinePrecision]], N[(N[(x * N[Power[a, t], $MachinePrecision]), $MachinePrecision] / y), $MachinePrecision], N[(x / N[(a * N[(y * N[Exp[b], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if t < -6.0000000000000005e121 or 6.4999999999999996e-6 < t

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0 90.6%

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

   4. Taylor expanded in b around 0 82.1%

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

   6. Simplified 82.1%

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

   7. Taylor expanded in t around inf 83.0%

      \[\leadsto \frac{x \cdot {a}^{\color{blue}{t}}}{y} \]

   if -6.0000000000000005e121 < t < 6.4999999999999996e-6

   1. Initial program 97.0%

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

      1. associate-/l* 95.8%

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

      2. associate--l+ 95.8%

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

      3. exp-sum 82.7%

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

      4. associate-/l* 79.4%

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

      5. *-commutative 79.4%

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

      6. exp-to-pow 79.4%

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

      7. exp-diff 76.1%

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

      8. *-commutative 76.1%

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

      9. exp-to-pow 77.1%

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

      10. sub-neg 77.1%

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

      11. metadata-eval 77.1%

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

   3. Simplified 77.1%

      \[\leadsto \color{blue}{x \cdot \left({z}^{y} \cdot \frac{\frac{{a}^{\left(t + -1\right)}}{e^{b}}}{y}\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in y around 0 69.6%

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

      1. exp-to-pow 70.7%

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

      2. sub-neg 70.7%

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

      3. metadata-eval 70.7%

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

      4. associate-*r/ 70.9%

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

   7. Simplified 70.9%

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

   8. Taylor expanded in t around 0 74.5%

      \[\leadsto \color{blue}{\frac{x}{a \cdot \left(y \cdot e^{b}\right)}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 78.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;t \leq -6 \cdot 10^{+121} \lor \neg \left(t \leq 6.5 \cdot 10^{-6}\right):\\ \;\;\;\;\frac{x \cdot {a}^{t}}{y}\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{a \cdot \left(y \cdot e^{b}\right)}\\ \end{array} \]
5. Add Preprocessing

Alternative 11: 59.1% accurate, 2.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -0.82 \lor \neg \left(b \leq 6.5\right):\\ \;\;\;\;\frac{x \cdot e^{-b}}{y}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{x}{a}}{y}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (or (<= b -0.82) (not (<= b 6.5))) (/ (* x (exp (- b))) y) (/ (/ x a) y)))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((b <= -0.82) || !(b <= 6.5)) {
		tmp = (x * exp(-b)) / y;
	} else {
		tmp = (x / a) / y;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: tmp
    if ((b <= (-0.82d0)) .or. (.not. (b <= 6.5d0))) then
        tmp = (x * exp(-b)) / y
    else
        tmp = (x / a) / y
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((b <= -0.82) || !(b <= 6.5)) {
		tmp = (x * Math.exp(-b)) / y;
	} else {
		tmp = (x / a) / y;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	tmp = 0
	if (b <= -0.82) or not (b <= 6.5):
		tmp = (x * math.exp(-b)) / y
	else:
		tmp = (x / a) / y
	return tmp

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if ((b <= -0.82) || !(b <= 6.5))
		tmp = Float64(Float64(x * exp(Float64(-b))) / y);
	else
		tmp = Float64(Float64(x / a) / y);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if ((b <= -0.82) || ~((b <= 6.5)))
		tmp = (x * exp(-b)) / y;
	else
		tmp = (x / a) / y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[Or[LessEqual[b, -0.82], N[Not[LessEqual[b, 6.5]], $MachinePrecision]], N[(N[(x * N[Exp[(-b)], $MachinePrecision]), $MachinePrecision] / y), $MachinePrecision], N[(N[(x / a), $MachinePrecision] / y), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if b < -0.819999999999999951 or 6.5 < b

   1. Initial program 100.0%

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

   3. Taylor expanded in t around 0 89.9%

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

      1. +-commutative 89.9%

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

      2. mul-1-neg 89.9%

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

      3. unsub-neg 89.9%

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

   5. Simplified 89.9%

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

   6. Taylor expanded in b around inf 82.2%

      \[\leadsto \frac{x \cdot e^{\color{blue}{-1 \cdot b}}}{y} \]
   7. Step-by-step derivation

      1. neg-mul-1 82.2%

         \[\leadsto \frac{x \cdot e^{\color{blue}{-b}}}{y} \]

   8. Simplified 82.2%

      \[\leadsto \frac{x \cdot e^{\color{blue}{-b}}}{y} \]

   if -0.819999999999999951 < b < 6.5

   1. Initial program 96.5%

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

   3. Taylor expanded in y around 0 74.3%

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

   4. Taylor expanded in b around 0 74.3%

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

   6. Simplified 72.7%

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

   7. Taylor expanded in t around 0 43.9%

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

      1. associate-/r* 46.1%

         \[\leadsto \color{blue}{\frac{\frac{x}{a}}{y}} \]

   9. Simplified 46.1%

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

4. Final simplification 64.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq -0.82 \lor \neg \left(b \leq 6.5\right):\\ \;\;\;\;\frac{x \cdot e^{-b}}{y}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{x}{a}}{y}\\ \end{array} \]
5. Add Preprocessing

Alternative 12: 40.9% accurate, 14.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -1.85 \cdot 10^{+47}:\\ \;\;\;\;\frac{x \cdot \left(1 + b \cdot \left(-1 + b \cdot \left(0.5 + b \cdot -0.16666666666666666\right)\right)\right)}{y}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{x}{a}}{y}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (<= b -1.85e+47)
   (/ (* x (+ 1.0 (* b (+ -1.0 (* b (+ 0.5 (* b -0.16666666666666666))))))) y)
   (/ (/ x a) y)))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (b <= -1.85e+47) {
		tmp = (x * (1.0 + (b * (-1.0 + (b * (0.5 + (b * -0.16666666666666666))))))) / y;
	} else {
		tmp = (x / a) / y;
	}
	return tmp;
}

Fortran

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

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (b <= -1.85e+47) {
		tmp = (x * (1.0 + (b * (-1.0 + (b * (0.5 + (b * -0.16666666666666666))))))) / y;
	} else {
		tmp = (x / a) / y;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	tmp = 0
	if b <= -1.85e+47:
		tmp = (x * (1.0 + (b * (-1.0 + (b * (0.5 + (b * -0.16666666666666666))))))) / y
	else:
		tmp = (x / a) / y
	return tmp

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if (b <= -1.85e+47)
		tmp = Float64(Float64(x * Float64(1.0 + Float64(b * Float64(-1.0 + Float64(b * Float64(0.5 + Float64(b * -0.16666666666666666))))))) / y);
	else
		tmp = Float64(Float64(x / a) / y);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if (b <= -1.85e+47)
		tmp = (x * (1.0 + (b * (-1.0 + (b * (0.5 + (b * -0.16666666666666666))))))) / y;
	else
		tmp = (x / a) / y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[LessEqual[b, -1.85e+47], N[(N[(x * N[(1.0 + N[(b * N[(-1.0 + N[(b * N[(0.5 + N[(b * -0.16666666666666666), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / y), $MachinePrecision], N[(N[(x / a), $MachinePrecision] / y), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if b < -1.8500000000000002e47

   1. Initial program 100.0%

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

   3. Taylor expanded in t around 0 98.0%

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

      1. +-commutative 98.0%

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

      2. mul-1-neg 98.0%

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

      3. unsub-neg 98.0%

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

   5. Simplified 98.0%

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

   6. Taylor expanded in b around inf 92.0%

      \[\leadsto \frac{x \cdot e^{\color{blue}{-1 \cdot b}}}{y} \]
   7. Step-by-step derivation

      1. neg-mul-1 92.0%

         \[\leadsto \frac{x \cdot e^{\color{blue}{-b}}}{y} \]

   8. Simplified 92.0%

      \[\leadsto \frac{x \cdot e^{\color{blue}{-b}}}{y} \]

   9. Taylor expanded in b around 0 80.2%

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

   if -1.8500000000000002e47 < b

   1. Initial program 97.8%

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

   3. Taylor expanded in y around 0 79.2%

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

   4. Taylor expanded in b around 0 62.3%

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

   6. Simplified 60.8%

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

   7. Taylor expanded in t around 0 34.5%

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

      1. associate-/r* 36.4%

         \[\leadsto \color{blue}{\frac{\frac{x}{a}}{y}} \]

   9. Simplified 36.4%

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

4. Final simplification 44.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq -1.85 \cdot 10^{+47}:\\ \;\;\;\;\frac{x \cdot \left(1 + b \cdot \left(-1 + b \cdot \left(0.5 + b \cdot -0.16666666666666666\right)\right)\right)}{y}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{x}{a}}{y}\\ \end{array} \]
5. Add Preprocessing

Alternative 13: 40.0% accurate, 17.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -2.8 \cdot 10^{+39}:\\ \;\;\;\;x \cdot \frac{1 + b \cdot \left(1 + b \cdot 0.5\right)}{y}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{x}{a}}{y}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (<= b -2.8e+39)
   (* x (/ (+ 1.0 (* b (+ 1.0 (* b 0.5)))) y))
   (/ (/ x a) y)))

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[LessEqual[b, -2.8e+39], N[(x * N[(N[(1.0 + N[(b * N[(1.0 + N[(b * 0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision], N[(N[(x / a), $MachinePrecision] / y), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if b < -2.80000000000000001e39

   1. Initial program 100.0%

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

   3. Taylor expanded in t around 0 98.0%

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

      1. +-commutative 98.0%

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

      2. mul-1-neg 98.0%

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

      3. unsub-neg 98.0%

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

   5. Simplified 98.0%

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

   6. Taylor expanded in b around inf 92.0%

      \[\leadsto \frac{x \cdot e^{\color{blue}{-1 \cdot b}}}{y} \]
   7. Step-by-step derivation

      1. neg-mul-1 92.0%

         \[\leadsto \frac{x \cdot e^{\color{blue}{-b}}}{y} \]

   8. Simplified 92.0%

      \[\leadsto \frac{x \cdot e^{\color{blue}{-b}}}{y} \]
   9. Step-by-step derivation

      1. associate-/l* 92.0%

         \[\leadsto \color{blue}{x \cdot \frac{e^{-b}}{y}} \]

      2. add-sqr-sqrt 92.0%

         \[\leadsto x \cdot \frac{e^{\color{blue}{\sqrt{-b} \cdot \sqrt{-b}}}}{y} \]

      3. sqrt-unprod 92.0%

         \[\leadsto x \cdot \frac{e^{\color{blue}{\sqrt{\left(-b\right) \cdot \left(-b\right)}}}}{y} \]

      4. sqr-neg 92.0%

         \[\leadsto x \cdot \frac{e^{\sqrt{\color{blue}{b \cdot b}}}}{y} \]

      5. sqrt-unprod 0.0%

         \[\leadsto x \cdot \frac{e^{\color{blue}{\sqrt{b} \cdot \sqrt{b}}}}{y} \]

      6. add-sqr-sqrt 9.6%

         \[\leadsto x \cdot \frac{e^{\color{blue}{b}}}{y} \]

   10. Applied egg-rr 9.6%

       \[\leadsto \color{blue}{x \cdot \frac{e^{b}}{y}} \]

   11. Taylor expanded in b around 0 76.2%

       \[\leadsto x \cdot \frac{\color{blue}{1 + b \cdot \left(1 + 0.5 \cdot b\right)}}{y} \]
   12. Step-by-step derivation

       1. *-commutative 76.2%

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

   13. Simplified 76.2%

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

   if -2.80000000000000001e39 < b

   1. Initial program 97.8%

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

   3. Taylor expanded in y around 0 79.2%

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

   4. Taylor expanded in b around 0 62.3%

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

   6. Simplified 60.8%

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

   7. Taylor expanded in t around 0 34.5%

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

      1. associate-/r* 36.4%

         \[\leadsto \color{blue}{\frac{\frac{x}{a}}{y}} \]

   9. Simplified 36.4%

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

Alternative 14: 39.7% accurate, 19.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -1.05 \cdot 10^{+48}:\\ \;\;\;\;\frac{x \cdot \left(1 + b \cdot \left(b \cdot 0.5\right)\right)}{y}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{x}{a}}{y}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (<= b -1.05e+48) (/ (* x (+ 1.0 (* b (* b 0.5)))) y) (/ (/ x a) y)))

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[LessEqual[b, -1.05e+48], N[(N[(x * N[(1.0 + N[(b * N[(b * 0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / y), $MachinePrecision], N[(N[(x / a), $MachinePrecision] / y), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if b < -1.0499999999999999e48

   1. Initial program 100.0%

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

   3. Taylor expanded in t around 0 98.0%

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

      1. +-commutative 98.0%

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

      2. mul-1-neg 98.0%

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

      3. unsub-neg 98.0%

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

   5. Simplified 98.0%

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

   6. Taylor expanded in b around inf 92.0%

      \[\leadsto \frac{x \cdot e^{\color{blue}{-1 \cdot b}}}{y} \]
   7. Step-by-step derivation

      1. neg-mul-1 92.0%

         \[\leadsto \frac{x \cdot e^{\color{blue}{-b}}}{y} \]

   8. Simplified 92.0%

      \[\leadsto \frac{x \cdot e^{\color{blue}{-b}}}{y} \]

   9. Taylor expanded in b around 0 72.3%

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

   10. Taylor expanded in b around inf 72.3%

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

   if -1.0499999999999999e48 < b

   1. Initial program 97.8%

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

   3. Taylor expanded in y around 0 79.2%

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

   4. Taylor expanded in b around 0 62.3%

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

   6. Simplified 60.8%

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

   7. Taylor expanded in t around 0 34.5%

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

      1. associate-/r* 36.4%

         \[\leadsto \color{blue}{\frac{\frac{x}{a}}{y}} \]

   9. Simplified 36.4%

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

4. Final simplification 43.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq -1.05 \cdot 10^{+48}:\\ \;\;\;\;\frac{x \cdot \left(1 + b \cdot \left(b \cdot 0.5\right)\right)}{y}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{x}{a}}{y}\\ \end{array} \]
5. Add Preprocessing

Alternative 15: 34.0% accurate, 22.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -2.15 \cdot 10^{+55}:\\ \;\;\;\;\frac{x}{y} - x \cdot \frac{b}{y}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{x}{a}}{y}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (<= b -2.15e+55) (- (/ x y) (* x (/ b y))) (/ (/ x a) y)))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (b <= -2.15e+55) {
		tmp = (x / y) - (x * (b / y));
	} else {
		tmp = (x / a) / y;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: tmp
    if (b <= (-2.15d+55)) then
        tmp = (x / y) - (x * (b / y))
    else
        tmp = (x / a) / y
    end if
    code = tmp
end function

Java

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

Python

def code(x, y, z, t, a, b):
	tmp = 0
	if b <= -2.15e+55:
		tmp = (x / y) - (x * (b / y))
	else:
		tmp = (x / a) / y
	return tmp

Julia

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

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if (b <= -2.15e+55)
		tmp = (x / y) - (x * (b / y));
	else
		tmp = (x / a) / y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[LessEqual[b, -2.15e+55], N[(N[(x / y), $MachinePrecision] - N[(x * N[(b / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(x / a), $MachinePrecision] / y), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if b < -2.1499999999999999e55

   1. Initial program 100.0%

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

   3. Taylor expanded in t around 0 97.9%

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

      1. +-commutative 97.9%

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

      2. mul-1-neg 97.9%

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

      3. unsub-neg 97.9%

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

   5. Simplified 97.9%

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

   6. Taylor expanded in b around inf 91.6%

      \[\leadsto \frac{x \cdot e^{\color{blue}{-1 \cdot b}}}{y} \]
   7. Step-by-step derivation

      1. neg-mul-1 91.6%

         \[\leadsto \frac{x \cdot e^{\color{blue}{-b}}}{y} \]

   8. Simplified 91.6%

      \[\leadsto \frac{x \cdot e^{\color{blue}{-b}}}{y} \]

   9. Taylor expanded in b around 0 73.2%

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

   10. Taylor expanded in b around 0 34.5%

       \[\leadsto \color{blue}{-1 \cdot \frac{b \cdot x}{y} + \frac{x}{y}} \]
   11. Step-by-step derivation

       1. +-commutative 34.5%

          \[\leadsto \color{blue}{\frac{x}{y} + -1 \cdot \frac{b \cdot x}{y}} \]

       2. mul-1-neg 34.5%

          \[\leadsto \frac{x}{y} + \color{blue}{\left(-\frac{b \cdot x}{y}\right)} \]

       3. unsub-neg 34.5%

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

       4. *-commutative 34.5%

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

       5. associate-/l* 42.5%

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

   12. Simplified 42.5%

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

   if -2.1499999999999999e55 < b

   1. Initial program 97.8%

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

   3. Taylor expanded in y around 0 79.4%

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

   4. Taylor expanded in b around 0 61.7%

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

   6. Simplified 60.3%

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

   7. Taylor expanded in t around 0 34.2%

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

      1. associate-/r* 36.1%

         \[\leadsto \color{blue}{\frac{\frac{x}{a}}{y}} \]

   9. Simplified 36.1%

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

Alternative 16: 33.6% accurate, 26.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -1.15 \cdot 10^{+56}:\\ \;\;\;\;\frac{x \cdot \left(1 - b\right)}{y}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{x}{a}}{y}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (<= b -1.15e+56) (/ (* x (- 1.0 b)) y) (/ (/ x a) y)))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (b <= -1.15e+56) {
		tmp = (x * (1.0 - b)) / y;
	} else {
		tmp = (x / a) / y;
	}
	return tmp;
}

Fortran

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

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (b <= -1.15e+56) {
		tmp = (x * (1.0 - b)) / y;
	} else {
		tmp = (x / a) / y;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	tmp = 0
	if b <= -1.15e+56:
		tmp = (x * (1.0 - b)) / y
	else:
		tmp = (x / a) / y
	return tmp

Julia

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

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if (b <= -1.15e+56)
		tmp = (x * (1.0 - b)) / y;
	else
		tmp = (x / a) / y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[LessEqual[b, -1.15e+56], N[(N[(x * N[(1.0 - b), $MachinePrecision]), $MachinePrecision] / y), $MachinePrecision], N[(N[(x / a), $MachinePrecision] / y), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if b < -1.15000000000000007e56

   1. Initial program 100.0%

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

   3. Taylor expanded in t around 0 97.9%

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

      1. +-commutative 97.9%

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

      2. mul-1-neg 97.9%

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

      3. unsub-neg 97.9%

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

   5. Simplified 97.9%

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

   6. Taylor expanded in b around inf 91.6%

      \[\leadsto \frac{x \cdot e^{\color{blue}{-1 \cdot b}}}{y} \]
   7. Step-by-step derivation

      1. neg-mul-1 91.6%

         \[\leadsto \frac{x \cdot e^{\color{blue}{-b}}}{y} \]

   8. Simplified 91.6%

      \[\leadsto \frac{x \cdot e^{\color{blue}{-b}}}{y} \]

   9. Taylor expanded in b around 0 34.5%

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

       1. mul-1-neg 34.5%

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

       2. unsub-neg 34.5%

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

   11. Simplified 34.5%

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

   if -1.15000000000000007e56 < b

   1. Initial program 97.8%

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

   3. Taylor expanded in y around 0 79.4%

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

   4. Taylor expanded in b around 0 61.7%

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

   6. Simplified 60.3%

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

   7. Taylor expanded in t around 0 34.2%

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

      1. associate-/r* 36.1%

         \[\leadsto \color{blue}{\frac{\frac{x}{a}}{y}} \]

   9. Simplified 36.1%

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

Alternative 17: 30.5% accurate, 26.2× speedup

Math

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

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (<= t -5.3e-145) (* x (/ 1.0 (* y a))) (/ (/ x a) y)))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (t <= -5.3e-145) {
		tmp = x * (1.0 / (y * a));
	} else {
		tmp = (x / a) / y;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: tmp
    if (t <= (-5.3d-145)) then
        tmp = x * (1.0d0 / (y * a))
    else
        tmp = (x / a) / y
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (t <= -5.3e-145) {
		tmp = x * (1.0 / (y * a));
	} else {
		tmp = (x / a) / y;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	tmp = 0
	if t <= -5.3e-145:
		tmp = x * (1.0 / (y * a))
	else:
		tmp = (x / a) / y
	return tmp

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if (t <= -5.3e-145)
		tmp = Float64(x * Float64(1.0 / Float64(y * a)));
	else
		tmp = Float64(Float64(x / a) / y);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if (t <= -5.3e-145)
		tmp = x * (1.0 / (y * a));
	else
		tmp = (x / a) / y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[LessEqual[t, -5.3e-145], N[(x * N[(1.0 / N[(y * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(x / a), $MachinePrecision] / y), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if t < -5.29999999999999999e-145

   1. Initial program 97.7%

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

   3. Taylor expanded in y around 0 86.1%

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

   4. Taylor expanded in b around 0 67.2%

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

   6. Simplified 70.6%

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

   7. Taylor expanded in t around 0 42.7%

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

      1. *-commutative 42.7%

         \[\leadsto x \cdot \frac{1}{\color{blue}{y \cdot a}} \]

   9. Simplified 42.7%

      \[\leadsto x \cdot \color{blue}{\frac{1}{y \cdot a}} \]

   if -5.29999999999999999e-145 < t

   1. Initial program 98.5%

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

   3. Taylor expanded in y around 0 79.8%

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

   4. Taylor expanded in b around 0 53.7%

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

   6. Simplified 51.0%

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

   7. Taylor expanded in t around 0 28.8%

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

      1. associate-/r* 31.7%

         \[\leadsto \color{blue}{\frac{\frac{x}{a}}{y}} \]

   9. Simplified 31.7%

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

Alternative 18: 30.6% accurate, 31.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -1060000000:\\ \;\;\;\;\frac{x}{y \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{x}{a}}{y}\\ \end{array} \end{array} \]

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[LessEqual[b, -1060000000.0], N[(x / N[(y * a), $MachinePrecision]), $MachinePrecision], N[(N[(x / a), $MachinePrecision] / y), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if b < -1.06e9

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0 94.4%

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

   4. Taylor expanded in b around 0 45.3%

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

   6. Simplified 48.8%

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

   7. Taylor expanded in t around 0 30.7%

      \[\leadsto \color{blue}{\frac{x}{a \cdot y}} \]

   if -1.06e9 < b

   1. Initial program 97.8%

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

   3. Taylor expanded in y around 0 78.8%

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

   4. Taylor expanded in b around 0 62.0%

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

   6. Simplified 60.5%

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

   7. Taylor expanded in t around 0 34.2%

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

      1. associate-/r* 36.6%

         \[\leadsto \color{blue}{\frac{\frac{x}{a}}{y}} \]

   9. Simplified 36.6%

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

4. Final simplification 35.3%

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

Alternative 19: 30.4% accurate, 63.0× speedup

Math

\[\begin{array}{l} \\ \frac{x}{y \cdot a} \end{array} \]

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_, t_, a_, b_] := N[(x / N[(y * a), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 98.2%

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

3. Taylor expanded in y around 0 82.1%

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

4. Taylor expanded in b around 0 58.6%

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

6. Simplified 58.1%

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

7. Taylor expanded in t around 0 33.5%

   \[\leadsto \color{blue}{\frac{x}{a \cdot y}} \]

8. Final simplification 33.5%

   \[\leadsto \frac{x}{y \cdot a} \]
9. Add Preprocessing

Alternative 20: 16.1% accurate, 105.0× speedup

Math

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

FPCore

(FPCore (x y z t a b) :precision binary64 (/ x y))

C

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

Fortran

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

Java

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

Python

def code(x, y, z, t, a, b):
	return x / y

Julia

function code(x, y, z, t, a, b)
	return Float64(x / y)
end

MATLAB

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

Wolfram

code[x_, y_, z_, t_, a_, b_] := N[(x / y), $MachinePrecision]

Derivation

1. Initial program 98.2%

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

3. Taylor expanded in t around 0 81.0%

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

   1. +-commutative 81.0%

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

   2. mul-1-neg 81.0%

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

   3. unsub-neg 81.0%

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

5. Simplified 81.0%

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

6. Taylor expanded in b around inf 49.8%

   \[\leadsto \frac{x \cdot e^{\color{blue}{-1 \cdot b}}}{y} \]
7. Step-by-step derivation

   1. neg-mul-1 49.8%

      \[\leadsto \frac{x \cdot e^{\color{blue}{-b}}}{y} \]

8. Simplified 49.8%

   \[\leadsto \frac{x \cdot e^{\color{blue}{-b}}}{y} \]

9. Taylor expanded in b around 0 14.7%

   \[\leadsto \color{blue}{\frac{x}{y}} \]
10. Add Preprocessing

Developer Target 1: 72.3% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := {a}^{\left(t - 1\right)}\\ t_2 := \frac{x \cdot \frac{t\_1}{y}}{\left(b + 1\right) - y \cdot \log z}\\ \mathbf{if}\;t < -0.8845848504127471:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;t < 852031.2288374073:\\ \;\;\;\;\frac{\frac{x}{y} \cdot t\_1}{e^{b - \log z \cdot y}}\\ \mathbf{else}:\\ \;\;\;\;t\_2\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (pow a (- t 1.0)))
        (t_2 (/ (* x (/ t_1 y)) (- (+ b 1.0) (* y (log z))))))
   (if (< t -0.8845848504127471)
     t_2
     (if (< t 852031.2288374073)
       (/ (* (/ x y) t_1) (exp (- b (* (log z) y))))
       t_2))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = pow(a, (t - 1.0));
	double t_2 = (x * (t_1 / y)) / ((b + 1.0) - (y * log(z)));
	double tmp;
	if (t < -0.8845848504127471) {
		tmp = t_2;
	} else if (t < 852031.2288374073) {
		tmp = ((x / y) * t_1) / exp((b - (log(z) * y)));
	} else {
		tmp = t_2;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: t_1
    real(8) :: t_2
    real(8) :: tmp
    t_1 = a ** (t - 1.0d0)
    t_2 = (x * (t_1 / y)) / ((b + 1.0d0) - (y * log(z)))
    if (t < (-0.8845848504127471d0)) then
        tmp = t_2
    else if (t < 852031.2288374073d0) then
        tmp = ((x / y) * t_1) / exp((b - (log(z) * y)))
    else
        tmp = t_2
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = Math.pow(a, (t - 1.0));
	double t_2 = (x * (t_1 / y)) / ((b + 1.0) - (y * Math.log(z)));
	double tmp;
	if (t < -0.8845848504127471) {
		tmp = t_2;
	} else if (t < 852031.2288374073) {
		tmp = ((x / y) * t_1) / Math.exp((b - (Math.log(z) * y)));
	} else {
		tmp = t_2;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	t_1 = math.pow(a, (t - 1.0))
	t_2 = (x * (t_1 / y)) / ((b + 1.0) - (y * math.log(z)))
	tmp = 0
	if t < -0.8845848504127471:
		tmp = t_2
	elif t < 852031.2288374073:
		tmp = ((x / y) * t_1) / math.exp((b - (math.log(z) * y)))
	else:
		tmp = t_2
	return tmp

Julia

function code(x, y, z, t, a, b)
	t_1 = a ^ Float64(t - 1.0)
	t_2 = Float64(Float64(x * Float64(t_1 / y)) / Float64(Float64(b + 1.0) - Float64(y * log(z))))
	tmp = 0.0
	if (t < -0.8845848504127471)
		tmp = t_2;
	elseif (t < 852031.2288374073)
		tmp = Float64(Float64(Float64(x / y) * t_1) / exp(Float64(b - Float64(log(z) * y))));
	else
		tmp = t_2;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	t_1 = a ^ (t - 1.0);
	t_2 = (x * (t_1 / y)) / ((b + 1.0) - (y * log(z)));
	tmp = 0.0;
	if (t < -0.8845848504127471)
		tmp = t_2;
	elseif (t < 852031.2288374073)
		tmp = ((x / y) * t_1) / exp((b - (log(z) * y)));
	else
		tmp = t_2;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[Power[a, N[(t - 1.0), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$2 = N[(N[(x * N[(t$95$1 / y), $MachinePrecision]), $MachinePrecision] / N[(N[(b + 1.0), $MachinePrecision] - N[(y * N[Log[z], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[Less[t, -0.8845848504127471], t$95$2, If[Less[t, 852031.2288374073], N[(N[(N[(x / y), $MachinePrecision] * t$95$1), $MachinePrecision] / N[Exp[N[(b - N[(N[Log[z], $MachinePrecision] * y), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], t$95$2]]]]

Reproduce

herbie shell --seed 2024129 
(FPCore (x y z t a b)
  :name "Numeric.SpecFunctions:incompleteBetaWorker from math-functions-0.1.5.2, A"
  :precision binary64

  :alt
  (! :herbie-platform default (if (< t -8845848504127471/10000000000000000) (/ (* x (/ (pow a (- t 1)) y)) (- (+ b 1) (* y (log z)))) (if (< t 8520312288374073/10000000000) (/ (* (/ x y) (pow a (- t 1))) (exp (- b (* (log z) y)))) (/ (* x (/ (pow a (- t 1)) y)) (- (+ b 1) (* y (log z)))))))

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