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

Percentage Accurate: 98.4% → 98.4%

Time: 10.0s

Alternatives: 10

Speedup: 1.0×

• 46.1% 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.5%

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

Alternative 2: 81.1% accurate, 0.6× speedup

Math

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

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (* (- t 1.0) (log a)))
        (t_2 (/ (* x (exp (- (* (log a) t) b))) y)))
   (if (<= t_1 -200000.0)
     t_2
     (if (<= t_1 80.0)
       (* (/ (pow a (- t 1.0)) (* (exp b) y)) x)
       (if (<= t_1 2e+32) (/ (/ (* (pow z y) x) a) y) t_2)))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = (t - 1.0) * log(a);
	double t_2 = (x * exp(((log(a) * t) - b))) / y;
	double tmp;
	if (t_1 <= -200000.0) {
		tmp = t_2;
	} else if (t_1 <= 80.0) {
		tmp = (pow(a, (t - 1.0)) / (exp(b) * y)) * x;
	} else if (t_1 <= 2e+32) {
		tmp = ((pow(z, y) * x) / a) / 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 = (t - 1.0d0) * log(a)
    t_2 = (x * exp(((log(a) * t) - b))) / y
    if (t_1 <= (-200000.0d0)) then
        tmp = t_2
    else if (t_1 <= 80.0d0) then
        tmp = ((a ** (t - 1.0d0)) / (exp(b) * y)) * x
    else if (t_1 <= 2d+32) then
        tmp = (((z ** y) * x) / a) / 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 = (t - 1.0) * Math.log(a);
	double t_2 = (x * Math.exp(((Math.log(a) * t) - b))) / y;
	double tmp;
	if (t_1 <= -200000.0) {
		tmp = t_2;
	} else if (t_1 <= 80.0) {
		tmp = (Math.pow(a, (t - 1.0)) / (Math.exp(b) * y)) * x;
	} else if (t_1 <= 2e+32) {
		tmp = ((Math.pow(z, y) * x) / a) / y;
	} else {
		tmp = t_2;
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (*.f64 (-.f64 t #s(literal 1 binary64)) (log.f64 a)) < -2e5 or 2.00000000000000011e32 < (*.f64 (-.f64 t #s(literal 1 binary64)) (log.f64 a))

   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 inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-log.f64 94.4

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

   5. Applied rewrites 94.4%

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

   if -2e5 < (*.f64 (-.f64 t #s(literal 1 binary64)) (log.f64 a)) < 80

   1. Initial program 96.0%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/l* N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

   4. Applied rewrites 88.8%

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

   5. Taylor expanded in y around 0

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

      1. exp-to-pow N/A

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

      2. lower-pow.f64 N/A

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

      3. lower--.f64 80.7

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

   7. Applied rewrites 80.7%

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

   if 80 < (*.f64 (-.f64 t #s(literal 1 binary64)) (log.f64 a)) < 2.00000000000000011e32

   1. Initial program 99.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 b around 0

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

      1. exp-sum N/A

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

      2. associate-*r* N/A

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

      3. lower-*.f64 N/A

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

      4. lower-*.f64 N/A

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

      5. *-commutative N/A

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

      6. exp-to-pow N/A

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

      7. lower-pow.f64 N/A

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

      8. exp-to-pow N/A

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

      9. lower-pow.f64 N/A

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

      10. lower--.f64 84.9

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

   5. Applied rewrites 84.9%

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

   6. Taylor expanded in t around 0

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

   8. Applied rewrites 87.0%

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

Alternative 3: 80.9% accurate, 0.6× speedup

Math

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

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (* (- t 1.0) (log a)))
        (t_2 (/ (* x (exp (- (* (log a) t) b))) y)))
   (if (<= t_1 -50000000.0)
     t_2
     (if (<= t_1 80.0)
       (* (/ (pow a -1.0) (* (exp b) y)) x)
       (if (<= t_1 2e+32) (/ (/ (* (pow z y) x) a) y) t_2)))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = (t - 1.0) * log(a);
	double t_2 = (x * exp(((log(a) * t) - b))) / y;
	double tmp;
	if (t_1 <= -50000000.0) {
		tmp = t_2;
	} else if (t_1 <= 80.0) {
		tmp = (pow(a, -1.0) / (exp(b) * y)) * x;
	} else if (t_1 <= 2e+32) {
		tmp = ((pow(z, y) * x) / a) / 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 = (t - 1.0d0) * log(a)
    t_2 = (x * exp(((log(a) * t) - b))) / y
    if (t_1 <= (-50000000.0d0)) then
        tmp = t_2
    else if (t_1 <= 80.0d0) then
        tmp = ((a ** (-1.0d0)) / (exp(b) * y)) * x
    else if (t_1 <= 2d+32) then
        tmp = (((z ** y) * x) / a) / 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 = (t - 1.0) * Math.log(a);
	double t_2 = (x * Math.exp(((Math.log(a) * t) - b))) / y;
	double tmp;
	if (t_1 <= -50000000.0) {
		tmp = t_2;
	} else if (t_1 <= 80.0) {
		tmp = (Math.pow(a, -1.0) / (Math.exp(b) * y)) * x;
	} else if (t_1 <= 2e+32) {
		tmp = ((Math.pow(z, y) * x) / a) / y;
	} else {
		tmp = t_2;
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (*.f64 (-.f64 t #s(literal 1 binary64)) (log.f64 a)) < -5e7 or 2.00000000000000011e32 < (*.f64 (-.f64 t #s(literal 1 binary64)) (log.f64 a))

   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 inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-log.f64 94.4

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

   5. Applied rewrites 94.4%

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

   if -5e7 < (*.f64 (-.f64 t #s(literal 1 binary64)) (log.f64 a)) < 80

   1. Initial program 96.0%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/l* N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

   4. Applied rewrites 87.7%

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

   5. Taylor expanded in y around 0

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

      1. exp-to-pow N/A

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

      2. lower-pow.f64 N/A

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

      3. lower--.f64 79.7

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

   7. Applied rewrites 79.7%

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

   8. Taylor expanded in t around 0

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

   10. Applied rewrites 80.7%

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

   if 80 < (*.f64 (-.f64 t #s(literal 1 binary64)) (log.f64 a)) < 2.00000000000000011e32

   1. Initial program 99.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 b around 0

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

      1. exp-sum N/A

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

      2. associate-*r* N/A

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

      3. lower-*.f64 N/A

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

      4. lower-*.f64 N/A

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

      5. *-commutative N/A

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

      6. exp-to-pow N/A

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

      7. lower-pow.f64 N/A

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

      8. exp-to-pow N/A

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

      9. lower-pow.f64 N/A

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

      10. lower--.f64 84.9

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

   5. Applied rewrites 84.9%

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

   6. Taylor expanded in t around 0

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

   8. Applied rewrites 87.0%

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

4. Final simplification 88.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\left(t - 1\right) \cdot \log a \leq -50000000:\\ \;\;\;\;\frac{x \cdot e^{\log a \cdot t - b}}{y}\\ \mathbf{elif}\;\left(t - 1\right) \cdot \log a \leq 80:\\ \;\;\;\;\frac{{a}^{-1}}{e^{b} \cdot y} \cdot x\\ \mathbf{elif}\;\left(t - 1\right) \cdot \log a \leq 2 \cdot 10^{+32}:\\ \;\;\;\;\frac{\frac{{z}^{y} \cdot x}{a}}{y}\\ \mathbf{else}:\\ \;\;\;\;\frac{x \cdot e^{\log a \cdot t - b}}{y}\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 75.7% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \left(t - 1\right) \cdot \log a\\ t_2 := \frac{{a}^{\left(t - 1\right)} \cdot x}{y}\\ \mathbf{if}\;t\_1 \leq -5 \cdot 10^{+72}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;t\_1 \leq 80:\\ \;\;\;\;\frac{{a}^{-1}}{e^{b} \cdot y} \cdot x\\ \mathbf{elif}\;t\_1 \leq 2 \cdot 10^{+32}:\\ \;\;\;\;\frac{\frac{{z}^{y} \cdot x}{a}}{y}\\ \mathbf{else}:\\ \;\;\;\;t\_2\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (* (- t 1.0) (log a))) (t_2 (/ (* (pow a (- t 1.0)) x) y)))
   (if (<= t_1 -5e+72)
     t_2
     (if (<= t_1 80.0)
       (* (/ (pow a -1.0) (* (exp b) y)) x)
       (if (<= t_1 2e+32) (/ (/ (* (pow z y) x) a) y) t_2)))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = (t - 1.0) * log(a);
	double t_2 = (pow(a, (t - 1.0)) * x) / y;
	double tmp;
	if (t_1 <= -5e+72) {
		tmp = t_2;
	} else if (t_1 <= 80.0) {
		tmp = (pow(a, -1.0) / (exp(b) * y)) * x;
	} else if (t_1 <= 2e+32) {
		tmp = ((pow(z, y) * x) / a) / 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 = (t - 1.0d0) * log(a)
    t_2 = ((a ** (t - 1.0d0)) * x) / y
    if (t_1 <= (-5d+72)) then
        tmp = t_2
    else if (t_1 <= 80.0d0) then
        tmp = ((a ** (-1.0d0)) / (exp(b) * y)) * x
    else if (t_1 <= 2d+32) then
        tmp = (((z ** y) * x) / a) / 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 = (t - 1.0) * Math.log(a);
	double t_2 = (Math.pow(a, (t - 1.0)) * x) / y;
	double tmp;
	if (t_1 <= -5e+72) {
		tmp = t_2;
	} else if (t_1 <= 80.0) {
		tmp = (Math.pow(a, -1.0) / (Math.exp(b) * y)) * x;
	} else if (t_1 <= 2e+32) {
		tmp = ((Math.pow(z, y) * x) / a) / y;
	} else {
		tmp = t_2;
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	t_1 = (t - 1.0) * log(a);
	t_2 = ((a ^ (t - 1.0)) * x) / y;
	tmp = 0.0;
	if (t_1 <= -5e+72)
		tmp = t_2;
	elseif (t_1 <= 80.0)
		tmp = ((a ^ -1.0) / (exp(b) * y)) * x;
	elseif (t_1 <= 2e+32)
		tmp = (((z ^ y) * x) / a) / y;
	else
		tmp = t_2;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (*.f64 (-.f64 t #s(literal 1 binary64)) (log.f64 a)) < -4.99999999999999992e72 or 2.00000000000000011e32 < (*.f64 (-.f64 t #s(literal 1 binary64)) (log.f64 a))

   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 b around 0

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

      1. exp-sum N/A

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

      2. associate-*r* N/A

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

      3. lower-*.f64 N/A

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

      4. lower-*.f64 N/A

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

      5. *-commutative N/A

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

      6. exp-to-pow N/A

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

      7. lower-pow.f64 N/A

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

      8. exp-to-pow N/A

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

      9. lower-pow.f64 N/A

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

      10. lower--.f64 74.4

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

   5. Applied rewrites 74.4%

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

   6. Taylor expanded in y around 0

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

   8. Applied rewrites 86.4%

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

   if -4.99999999999999992e72 < (*.f64 (-.f64 t #s(literal 1 binary64)) (log.f64 a)) < 80

   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. Step-by-step derivation

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/l* N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

   4. Applied rewrites 78.5%

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

   5. Taylor expanded in y around 0

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

      1. exp-to-pow N/A

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

      2. lower-pow.f64 N/A

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

      3. lower--.f64 72.2

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

   7. Applied rewrites 72.2%

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

   8. Taylor expanded in t around 0

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

   10. Applied rewrites 76.0%

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

   if 80 < (*.f64 (-.f64 t #s(literal 1 binary64)) (log.f64 a)) < 2.00000000000000011e32

   1. Initial program 99.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 b around 0

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

      1. exp-sum N/A

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

      2. associate-*r* N/A

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

      3. lower-*.f64 N/A

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

      4. lower-*.f64 N/A

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

      5. *-commutative N/A

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

      6. exp-to-pow N/A

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

      7. lower-pow.f64 N/A

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

      8. exp-to-pow N/A

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

      9. lower-pow.f64 N/A

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

      10. lower--.f64 84.9

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

   5. Applied rewrites 84.9%

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

   6. Taylor expanded in t around 0

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

   8. Applied rewrites 87.0%

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

4. Final simplification 82.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\left(t - 1\right) \cdot \log a \leq -5 \cdot 10^{+72}:\\ \;\;\;\;\frac{{a}^{\left(t - 1\right)} \cdot x}{y}\\ \mathbf{elif}\;\left(t - 1\right) \cdot \log a \leq 80:\\ \;\;\;\;\frac{{a}^{-1}}{e^{b} \cdot y} \cdot x\\ \mathbf{elif}\;\left(t - 1\right) \cdot \log a \leq 2 \cdot 10^{+32}:\\ \;\;\;\;\frac{\frac{{z}^{y} \cdot x}{a}}{y}\\ \mathbf{else}:\\ \;\;\;\;\frac{{a}^{\left(t - 1\right)} \cdot x}{y}\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 92.8% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;t \leq -3 \cdot 10^{+93} \lor \neg \left(t \leq 31\right):\\ \;\;\;\;\frac{x \cdot e^{\log a \cdot t - b}}{y}\\ \mathbf{else}:\\ \;\;\;\;\frac{x \cdot e^{\mathsf{fma}\left(\log z, y, -\log a\right) - b}}{y}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (or (<= t -3e+93) (not (<= t 31.0)))
   (/ (* x (exp (- (* (log a) t) b))) y)
   (/ (* x (exp (- (fma (log z) y (- (log a))) b))) y)))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((t <= -3e+93) || !(t <= 31.0)) {
		tmp = (x * exp(((log(a) * t) - b))) / y;
	} else {
		tmp = (x * exp((fma(log(z), y, -log(a)) - b))) / y;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if ((t <= -3e+93) || !(t <= 31.0))
		tmp = Float64(Float64(x * exp(Float64(Float64(log(a) * t) - b))) / y);
	else
		tmp = Float64(Float64(x * exp(Float64(fma(log(z), y, Float64(-log(a))) - b))) / y);
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if t < -2.99999999999999978e93 or 31 < 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 t around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-log.f64 97.1

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

   5. Applied rewrites 97.1%

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

   if -2.99999999999999978e93 < t < 31

   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

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower-log.f64 N/A

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

      5. mul-1-neg N/A

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

      6. lower-neg.f64 N/A

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

      7. lower-log.f64 94.6

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

   5. Applied rewrites 94.6%

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

4. Final simplification 95.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;t \leq -3 \cdot 10^{+93} \lor \neg \left(t \leq 31\right):\\ \;\;\;\;\frac{x \cdot e^{\log a \cdot t - b}}{y}\\ \mathbf{else}:\\ \;\;\;\;\frac{x \cdot e^{\mathsf{fma}\left(\log z, y, -\log a\right) - b}}{y}\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 87.3% accurate, 1.4× speedup

Math

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

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (or (<= b -1950.0) (not (<= b 1.45e+21)))
   (/ (* x (exp (- (* (log a) t) b))) y)
   (/ (* (* x (pow z y)) (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 <= -1950.0) || !(b <= 1.45e+21)) {
		tmp = (x * exp(((log(a) * t) - b))) / y;
	} else {
		tmp = ((x * pow(z, y)) * 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 <= (-1950.0d0)) .or. (.not. (b <= 1.45d+21))) then
        tmp = (x * exp(((log(a) * t) - b))) / y
    else
        tmp = ((x * (z ** y)) * (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 <= -1950.0) || !(b <= 1.45e+21)) {
		tmp = (x * Math.exp(((Math.log(a) * t) - b))) / y;
	} else {
		tmp = ((x * Math.pow(z, y)) * Math.pow(a, (t - 1.0))) / y;
	}
	return tmp;
}

Python

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

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if ((b <= -1950.0) || !(b <= 1.45e+21))
		tmp = Float64(Float64(x * exp(Float64(Float64(log(a) * t) - b))) / y);
	else
		tmp = Float64(Float64(Float64(x * (z ^ y)) * (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 <= -1950.0) || ~((b <= 1.45e+21)))
		tmp = (x * exp(((log(a) * t) - b))) / y;
	else
		tmp = ((x * (z ^ y)) * (a ^ (t - 1.0))) / y;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if b < -1950 or 1.45e21 < 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 inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-log.f64 91.9

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

   5. Applied rewrites 91.9%

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

   if -1950 < b < 1.45e21

   1. Initial program 97.4%

      \[\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 b around 0

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

      1. exp-sum N/A

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

      2. associate-*r* N/A

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

      3. lower-*.f64 N/A

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

      4. lower-*.f64 N/A

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

      5. *-commutative N/A

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

      6. exp-to-pow N/A

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

      7. lower-pow.f64 N/A

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

      8. exp-to-pow N/A

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

      9. lower-pow.f64 N/A

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

      10. lower--.f64 90.3

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

   5. Applied rewrites 90.3%

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

4. Final simplification 91.0%

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

Alternative 7: 75.9% accurate, 2.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := e^{-b}\\ \mathbf{if}\;b \leq -3700000:\\ \;\;\;\;\frac{t\_1}{y} \cdot x\\ \mathbf{elif}\;b \leq 4.5 \cdot 10^{+24}:\\ \;\;\;\;\frac{{a}^{\left(t - 1\right)} \cdot x}{y}\\ \mathbf{else}:\\ \;\;\;\;\frac{x \cdot t\_1}{y}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (exp (- b))))
   (if (<= b -3700000.0)
     (* (/ t_1 y) x)
     (if (<= b 4.5e+24) (/ (* (pow a (- t 1.0)) x) y) (/ (* x t_1) y)))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = exp(-b);
	double tmp;
	if (b <= -3700000.0) {
		tmp = (t_1 / y) * x;
	} else if (b <= 4.5e+24) {
		tmp = (pow(a, (t - 1.0)) * x) / y;
	} else {
		tmp = (x * t_1) / 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) :: t_1
    real(8) :: tmp
    t_1 = exp(-b)
    if (b <= (-3700000.0d0)) then
        tmp = (t_1 / y) * x
    else if (b <= 4.5d+24) then
        tmp = ((a ** (t - 1.0d0)) * x) / y
    else
        tmp = (x * t_1) / 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 t_1 = Math.exp(-b);
	double tmp;
	if (b <= -3700000.0) {
		tmp = (t_1 / y) * x;
	} else if (b <= 4.5e+24) {
		tmp = (Math.pow(a, (t - 1.0)) * x) / y;
	} else {
		tmp = (x * t_1) / y;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	t_1 = math.exp(-b)
	tmp = 0
	if b <= -3700000.0:
		tmp = (t_1 / y) * x
	elif b <= 4.5e+24:
		tmp = (math.pow(a, (t - 1.0)) * x) / y
	else:
		tmp = (x * t_1) / y
	return tmp

Julia

function code(x, y, z, t, a, b)
	t_1 = exp(Float64(-b))
	tmp = 0.0
	if (b <= -3700000.0)
		tmp = Float64(Float64(t_1 / y) * x);
	elseif (b <= 4.5e+24)
		tmp = Float64(Float64((a ^ Float64(t - 1.0)) * x) / y);
	else
		tmp = Float64(Float64(x * t_1) / y);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	t_1 = exp(-b);
	tmp = 0.0;
	if (b <= -3700000.0)
		tmp = (t_1 / y) * x;
	elseif (b <= 4.5e+24)
		tmp = ((a ^ (t - 1.0)) * x) / y;
	else
		tmp = (x * t_1) / y;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if b < -3.7e6

   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

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower-log.f64 N/A

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

      5. mul-1-neg N/A

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

      6. lower-neg.f64 N/A

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

      7. lower-log.f64 88.1

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

   5. Applied rewrites 88.1%

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

   6. Taylor expanded in b around inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 80.6

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

   8. Applied rewrites 80.6%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/l* N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. lower-/.f64 80.6

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

   10. Applied rewrites 80.6%

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

   if -3.7e6 < b < 4.50000000000000019e24

   1. Initial program 97.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 b around 0

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

      1. exp-sum N/A

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

      2. associate-*r* N/A

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

      3. lower-*.f64 N/A

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

      4. lower-*.f64 N/A

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

      5. *-commutative N/A

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

      6. exp-to-pow N/A

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

      7. lower-pow.f64 N/A

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

      8. exp-to-pow N/A

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

      9. lower-pow.f64 N/A

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

      10. lower--.f64 90.4

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

   5. Applied rewrites 90.4%

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

   6. Taylor expanded in y around 0

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

   8. Applied rewrites 75.2%

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

   if 4.50000000000000019e24 < 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

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower-log.f64 N/A

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

      5. mul-1-neg N/A

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

      6. lower-neg.f64 N/A

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

      7. lower-log.f64 93.0

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

   5. Applied rewrites 93.0%

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

   6. Taylor expanded in b around inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 90.6

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

   8. Applied rewrites 90.6%

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

Alternative 8: 59.1% accurate, 2.6× speedup

Math

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

FPCore

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

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((b <= -340.0) || !(b <= 7.6e+20)) {
		tmp = (exp(-b) / y) * x;
	} else {
		tmp = (pow(a, -1.0) * x) / 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 <= (-340.0d0)) .or. (.not. (b <= 7.6d+20))) then
        tmp = (exp(-b) / y) * x
    else
        tmp = ((a ** (-1.0d0)) * x) / 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 <= -340.0) || !(b <= 7.6e+20)) {
		tmp = (Math.exp(-b) / y) * x;
	} else {
		tmp = (Math.pow(a, -1.0) * x) / y;
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if b < -340 or 7.6e20 < 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

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower-log.f64 N/A

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

      5. mul-1-neg N/A

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

      6. lower-neg.f64 N/A

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

      7. lower-log.f64 89.3

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

   5. Applied rewrites 89.3%

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

   6. Taylor expanded in b around inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 83.9

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

   8. Applied rewrites 83.9%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/l* N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. lower-/.f64 83.9

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

   10. Applied rewrites 83.9%

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

   if -340 < b < 7.6e20

   1. Initial program 97.4%

      \[\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 b around 0

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

      1. exp-sum N/A

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

      2. associate-*r* N/A

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

      3. lower-*.f64 N/A

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

      4. lower-*.f64 N/A

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

      5. *-commutative N/A

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

      6. exp-to-pow N/A

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

      7. lower-pow.f64 N/A

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

      8. exp-to-pow N/A

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

      9. lower-pow.f64 N/A

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

      10. lower--.f64 90.3

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

   5. Applied rewrites 90.3%

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

   6. Taylor expanded in y around 0

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

   8. Applied rewrites 74.9%

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

   9. Taylor expanded in t around 0

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

   11. Applied rewrites 43.2%

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

4. Final simplification 60.7%

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

Alternative 9: 31.4% accurate, 2.8× speedup

Math

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

FPCore

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

C

double code(double x, double y, double z, double t, double a, double b) {
	return (pow(a, -1.0) * 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 = ((a ** (-1.0d0)) * x) / y
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

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 b around 0

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

   1. exp-sum N/A

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

   2. associate-*r* N/A

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

   3. lower-*.f64 N/A

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

   4. lower-*.f64 N/A

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

   5. *-commutative N/A

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

   6. exp-to-pow N/A

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

   7. lower-pow.f64 N/A

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

   8. exp-to-pow N/A

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

   9. lower-pow.f64 N/A

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

   10. lower--.f64 71.8

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

5. Applied rewrites 71.8%

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

6. Taylor expanded in y around 0

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

8. Applied rewrites 58.4%

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

9. Taylor expanded in t around 0

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

11. Applied rewrites 31.8%

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

12. Final simplification 31.8%

    \[\leadsto \frac{{a}^{-1} \cdot x}{y} \]
13. Add Preprocessing

Alternative 10: 31.4% accurate, 14.6× speedup

Math

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

FPCore

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

C

double code(double x, double y, double z, double t, double a, double b) {
	return (x / a) / 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 / a) / y
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

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 b around 0

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

   1. exp-sum N/A

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

   2. associate-*r* N/A

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

   3. lower-*.f64 N/A

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

   4. lower-*.f64 N/A

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

   5. *-commutative N/A

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

   6. exp-to-pow N/A

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

   7. lower-pow.f64 N/A

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

   8. exp-to-pow N/A

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

   9. lower-pow.f64 N/A

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

   10. lower--.f64 71.8

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

5. Applied rewrites 71.8%

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

6. Taylor expanded in t around 0

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

8. Applied rewrites 62.7%

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

9. Taylor expanded in y around 0

   \[\leadsto \frac{\frac{x}{a}}{y} \]
10. Step-by-step derivation

11. Applied rewrites 31.7%

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

Developer Target 1: 71.8% 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 2024339 
(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))