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

Percentage Accurate: 98.5% → 98.5%

Time: 6.8s

Alternatives: 13

Speedup: 1.0×

• 47.4% 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

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y, z, t, a, b)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), 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.5% 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

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y, z, t, a, b)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), 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.5% 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

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

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

   \[\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: 88.4% accurate, 1.4× speedup

Math

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

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (or (<= y -4e+139) (not (<= y 980000.0)))
   (* x (/ (/ (pow z y) a) y))
   (* x (/ (exp (- (* (log a) (- t 1.0)) b)) y))))

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y, z, t, a, b)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: tmp
    if ((y <= (-4d+139)) .or. (.not. (y <= 980000.0d0))) then
        tmp = x * (((z ** y) / a) / y)
    else
        tmp = x * (exp(((log(a) * (t - 1.0d0)) - 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 <= -4e+139) || !(y <= 980000.0)) {
		tmp = x * ((Math.pow(z, y) / a) / y);
	} else {
		tmp = x * (Math.exp(((Math.log(a) * (t - 1.0)) - b)) / y);
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < -4.00000000000000013e139 or 9.8e5 < 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 b around 0

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

      1. associate-/l* N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. exp-sum N/A

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

      5. *-commutative N/A

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

      6. pow-to-exp N/A

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

      7. pow-to-exp N/A

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

      8. lower-*.f64 N/A

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

      9. lower-pow.f64 N/A

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

      10. lower-pow.f64 N/A

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

      11. lift--.f64 79.4

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

   5. Applied rewrites 79.4%

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

   6. Taylor expanded in t around 0

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

      1. lower-/.f64 N/A

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

      2. lift-pow.f64 89.9

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

   8. Applied rewrites 89.9%

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

   if -4.00000000000000013e139 < y < 9.8e5

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

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

      1. lower-*.f64 N/A

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

      2. lift-log.f64 N/A

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

      3. lift--.f64 94.9

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

   5. Applied rewrites 94.9%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/l* N/A

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

      4. lower-*.f64 N/A

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

      5. lower-/.f64 95.0

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

   7. Applied rewrites 95.0%

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

4. Final simplification 93.1%

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

Alternative 3: 75.4% accurate, 1.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := x \cdot \frac{\frac{{z}^{y}}{a}}{y}\\ \mathbf{if}\;y \leq -1.85 \cdot 10^{+34}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;y \leq -7.6 \cdot 10^{-211}:\\ \;\;\;\;\frac{{a}^{\left(t - 1\right)} \cdot x}{y}\\ \mathbf{elif}\;y \leq 24000:\\ \;\;\;\;x \cdot \frac{e^{\left(-\log a\right) - b}}{y}\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (* x (/ (/ (pow z y) a) y))))
   (if (<= y -1.85e+34)
     t_1
     (if (<= y -7.6e-211)
       (/ (* (pow a (- t 1.0)) x) y)
       (if (<= y 24000.0) (* x (/ (exp (- (- (log a)) b)) y)) t_1)))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = x * ((pow(z, y) / a) / y);
	double tmp;
	if (y <= -1.85e+34) {
		tmp = t_1;
	} else if (y <= -7.6e-211) {
		tmp = (pow(a, (t - 1.0)) * x) / y;
	} else if (y <= 24000.0) {
		tmp = x * (exp((-log(a) - b)) / y);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y, z, t, a, b)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: t_1
    real(8) :: tmp
    t_1 = x * (((z ** y) / a) / y)
    if (y <= (-1.85d+34)) then
        tmp = t_1
    else if (y <= (-7.6d-211)) then
        tmp = ((a ** (t - 1.0d0)) * x) / y
    else if (y <= 24000.0d0) then
        tmp = x * (exp((-log(a) - b)) / 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.pow(z, y) / a) / y);
	double tmp;
	if (y <= -1.85e+34) {
		tmp = t_1;
	} else if (y <= -7.6e-211) {
		tmp = (Math.pow(a, (t - 1.0)) * x) / y;
	} else if (y <= 24000.0) {
		tmp = x * (Math.exp((-Math.log(a) - b)) / y);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	t_1 = x * ((math.pow(z, y) / a) / y)
	tmp = 0
	if y <= -1.85e+34:
		tmp = t_1
	elif y <= -7.6e-211:
		tmp = (math.pow(a, (t - 1.0)) * x) / y
	elif y <= 24000.0:
		tmp = x * (math.exp((-math.log(a) - b)) / y)
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z, t, a, b)
	t_1 = Float64(x * Float64(Float64((z ^ y) / a) / y))
	tmp = 0.0
	if (y <= -1.85e+34)
		tmp = t_1;
	elseif (y <= -7.6e-211)
		tmp = Float64(Float64((a ^ Float64(t - 1.0)) * x) / y);
	elseif (y <= 24000.0)
		tmp = Float64(x * Float64(exp(Float64(Float64(-log(a)) - b)) / y));
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	t_1 = x * (((z ^ y) / a) / y);
	tmp = 0.0;
	if (y <= -1.85e+34)
		tmp = t_1;
	elseif (y <= -7.6e-211)
		tmp = ((a ^ (t - 1.0)) * x) / y;
	elseif (y <= 24000.0)
		tmp = x * (exp((-log(a) - b)) / y);
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if y < -1.85000000000000004e34 or 24000 < 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 b around 0

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

      1. associate-/l* N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. exp-sum N/A

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

      5. *-commutative N/A

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

      6. pow-to-exp N/A

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

      7. pow-to-exp N/A

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

      8. lower-*.f64 N/A

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

      9. lower-pow.f64 N/A

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

      10. lower-pow.f64 N/A

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

      11. lift--.f64 75.9

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

   5. Applied rewrites 75.9%

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

   6. Taylor expanded in t around 0

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

      1. lower-/.f64 N/A

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

      2. lift-pow.f64 85.2

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

   8. Applied rewrites 85.2%

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

   if -1.85000000000000004e34 < y < -7.60000000000000023e-211

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

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

      1. associate-/l* N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. exp-sum N/A

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

      5. *-commutative N/A

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

      6. pow-to-exp N/A

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

      7. pow-to-exp N/A

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

      8. lower-*.f64 N/A

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

      9. lower-pow.f64 N/A

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

      10. lower-pow.f64 N/A

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

      11. lift--.f64 74.4

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

   5. Applied rewrites 74.4%

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

   6. Taylor expanded in y around 0

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

      1. lower-/.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. pow-to-exp N/A

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

      5. lift-pow.f64 N/A

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

      6. lift--.f64 74.7

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

   8. Applied rewrites 74.7%

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

   if -7.60000000000000023e-211 < y < 24000

   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

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

      1. lower-*.f64 N/A

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

      2. lift-log.f64 N/A

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

      3. lift--.f64 97.0

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

   5. Applied rewrites 97.0%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/l* N/A

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

      4. lower-*.f64 N/A

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

      5. lower-/.f64 97.2

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

   7. Applied rewrites 97.2%

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

   8. Taylor expanded in t around 0

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. lift-log.f64 75.9

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

   10. Applied rewrites 75.9%

       \[\leadsto x \cdot \frac{e^{\left(-\log a\right) - b}}{y} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 4: 81.8% accurate, 1.4× speedup

Math

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

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (<= b -5.6e+189)
   (* x (/ (exp (- b)) y))
   (if (<= b 4e+57)
     (* x (/ (* (pow z y) (pow a (- t 1.0))) y))
     (* x (/ (exp (- (- (log a)) b)) y)))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (b <= -5.6e+189) {
		tmp = x * (exp(-b) / y);
	} else if (b <= 4e+57) {
		tmp = x * ((pow(z, y) * pow(a, (t - 1.0))) / y);
	} else {
		tmp = x * (exp((-log(a) - b)) / y);
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y, z, t, a, b)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: tmp
    if (b <= (-5.6d+189)) then
        tmp = x * (exp(-b) / y)
    else if (b <= 4d+57) then
        tmp = x * (((z ** y) * (a ** (t - 1.0d0))) / y)
    else
        tmp = x * (exp((-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 (b <= -5.6e+189) {
		tmp = x * (Math.exp(-b) / y);
	} else if (b <= 4e+57) {
		tmp = x * ((Math.pow(z, y) * Math.pow(a, (t - 1.0))) / y);
	} else {
		tmp = x * (Math.exp((-Math.log(a) - b)) / y);
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	tmp = 0
	if b <= -5.6e+189:
		tmp = x * (math.exp(-b) / y)
	elif b <= 4e+57:
		tmp = x * ((math.pow(z, y) * math.pow(a, (t - 1.0))) / y)
	else:
		tmp = x * (math.exp((-math.log(a) - b)) / y)
	return tmp

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if (b <= -5.6e+189)
		tmp = Float64(x * Float64(exp(Float64(-b)) / y));
	elseif (b <= 4e+57)
		tmp = Float64(x * Float64(Float64((z ^ y) * (a ^ Float64(t - 1.0))) / y));
	else
		tmp = Float64(x * Float64(exp(Float64(Float64(-log(a)) - b)) / y));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if (b <= -5.6e+189)
		tmp = x * (exp(-b) / y);
	elseif (b <= 4e+57)
		tmp = x * (((z ^ y) * (a ^ (t - 1.0))) / y);
	else
		tmp = x * (exp((-log(a) - b)) / y);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[LessEqual[b, -5.6e+189], N[(x * N[(N[Exp[(-b)], $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 4e+57], N[(x * N[(N[(N[Power[z, y], $MachinePrecision] * N[Power[a, N[(t - 1.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision], N[(x * N[(N[Exp[N[((-N[Log[a], $MachinePrecision]) - b), $MachinePrecision]], $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b < -5.60000000000000013e189

   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 inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 96.2

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

   5. Applied rewrites 96.2%

      \[\leadsto \frac{x \cdot e^{\color{blue}{-b}}}{y} \]
   6. 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. lower-*.f64 N/A

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

      5. lower-/.f64 96.2

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

   7. Applied rewrites 96.2%

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

   if -5.60000000000000013e189 < b < 4.00000000000000019e57

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

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

      1. associate-/l* N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. exp-sum N/A

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

      5. *-commutative N/A

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

      6. pow-to-exp N/A

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

      7. pow-to-exp N/A

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

      8. lower-*.f64 N/A

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

      9. lower-pow.f64 N/A

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

      10. lower-pow.f64 N/A

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

      11. lift--.f64 84.3

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

   5. Applied rewrites 84.3%

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

   if 4.00000000000000019e57 < 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 y around 0

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

      1. lower-*.f64 N/A

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

      2. lift-log.f64 N/A

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

      3. lift--.f64 91.4

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

   5. Applied rewrites 91.4%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/l* N/A

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

      4. lower-*.f64 N/A

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

      5. lower-/.f64 91.4

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

   7. Applied rewrites 91.4%

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

   8. Taylor expanded in t around 0

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. lift-log.f64 84.5

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

   10. Applied rewrites 84.5%

       \[\leadsto x \cdot \frac{e^{\left(-\log a\right) - b}}{y} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 5: 75.8% accurate, 2.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := x \cdot \frac{e^{-b}}{y}\\ \mathbf{if}\;b \leq -1.55 \cdot 10^{+43}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;b \leq -4.9 \cdot 10^{-79}:\\ \;\;\;\;x \cdot \frac{\frac{{z}^{y}}{a}}{y}\\ \mathbf{elif}\;b \leq 1.05 \cdot 10^{+50}:\\ \;\;\;\;\frac{x \cdot \frac{{a}^{\left(t - 1\right)}}{b + 1}}{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 -1.55e+43)
     t_1
     (if (<= b -4.9e-79)
       (* x (/ (/ (pow z y) a) y))
       (if (<= b 1.05e+50) (/ (* x (/ (pow a (- t 1.0)) (+ b 1.0))) 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 <= -1.55e+43) {
		tmp = t_1;
	} else if (b <= -4.9e-79) {
		tmp = x * ((pow(z, y) / a) / y);
	} else if (b <= 1.05e+50) {
		tmp = (x * (pow(a, (t - 1.0)) / (b + 1.0))) / y;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y, z, t, a, b)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: t_1
    real(8) :: tmp
    t_1 = x * (exp(-b) / y)
    if (b <= (-1.55d+43)) then
        tmp = t_1
    else if (b <= (-4.9d-79)) then
        tmp = x * (((z ** y) / a) / y)
    else if (b <= 1.05d+50) then
        tmp = (x * ((a ** (t - 1.0d0)) / (b + 1.0d0))) / 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 <= -1.55e+43) {
		tmp = t_1;
	} else if (b <= -4.9e-79) {
		tmp = x * ((Math.pow(z, y) / a) / y);
	} else if (b <= 1.05e+50) {
		tmp = (x * (Math.pow(a, (t - 1.0)) / (b + 1.0))) / 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 <= -1.55e+43:
		tmp = t_1
	elif b <= -4.9e-79:
		tmp = x * ((math.pow(z, y) / a) / y)
	elif b <= 1.05e+50:
		tmp = (x * (math.pow(a, (t - 1.0)) / (b + 1.0))) / y
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z, t, a, b)
	t_1 = Float64(x * Float64(exp(Float64(-b)) / y))
	tmp = 0.0
	if (b <= -1.55e+43)
		tmp = t_1;
	elseif (b <= -4.9e-79)
		tmp = Float64(x * Float64(Float64((z ^ y) / a) / y));
	elseif (b <= 1.05e+50)
		tmp = Float64(Float64(x * Float64((a ^ Float64(t - 1.0)) / Float64(b + 1.0))) / 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 <= -1.55e+43)
		tmp = t_1;
	elseif (b <= -4.9e-79)
		tmp = x * (((z ^ y) / a) / y);
	elseif (b <= 1.05e+50)
		tmp = (x * ((a ^ (t - 1.0)) / (b + 1.0))) / y;
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(x * N[(N[Exp[(-b)], $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[b, -1.55e+43], t$95$1, If[LessEqual[b, -4.9e-79], N[(x * N[(N[(N[Power[z, y], $MachinePrecision] / a), $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 1.05e+50], N[(N[(x * N[(N[Power[a, N[(t - 1.0), $MachinePrecision]], $MachinePrecision] / N[(b + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / y), $MachinePrecision], t$95$1]]]]

Derivation

1. Split input into 3 regimes

2. if b < -1.5500000000000001e43 or 1.05e50 < 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 b around inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 82.7

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

   5. Applied rewrites 82.7%

      \[\leadsto \frac{x \cdot e^{\color{blue}{-b}}}{y} \]
   6. 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. lower-*.f64 N/A

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

      5. lower-/.f64 82.7

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

   7. Applied rewrites 82.7%

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

   if -1.5500000000000001e43 < b < -4.9000000000000001e-79

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

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

      1. associate-/l* N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. exp-sum N/A

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

      5. *-commutative N/A

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

      6. pow-to-exp N/A

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

      7. pow-to-exp N/A

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

      8. lower-*.f64 N/A

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

      9. lower-pow.f64 N/A

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

      10. lower-pow.f64 N/A

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

      11. lift--.f64 95.7

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

   5. Applied rewrites 95.7%

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

   6. Taylor expanded in t around 0

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

      1. lower-/.f64 N/A

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

      2. lift-pow.f64 95.9

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

   8. Applied rewrites 95.9%

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

   if -4.9000000000000001e-79 < b < 1.05e50

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

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

      1. div-exp N/A

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

      2. pow-to-exp N/A

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

      3. lower-/.f64 N/A

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

      4. lower-pow.f64 N/A

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

      5. lift--.f64 N/A

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

      6. lower-exp.f64 72.0

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

   5. Applied rewrites 72.0%

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

   6. Taylor expanded in b around 0

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

      1. +-commutative N/A

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

      2. lower-+.f64 72.9

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

   8. Applied rewrites 72.9%

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

Alternative 6: 75.5% accurate, 2.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := x \cdot \frac{e^{-b}}{y}\\ \mathbf{if}\;b \leq -1.55 \cdot 10^{+43}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;b \leq -4.9 \cdot 10^{-79}:\\ \;\;\;\;x \cdot \frac{\frac{{z}^{y}}{a}}{y}\\ \mathbf{elif}\;b \leq 6 \cdot 10^{+49}:\\ \;\;\;\;x \cdot \frac{\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 -1.55e+43)
     t_1
     (if (<= b -4.9e-79)
       (* x (/ (/ (pow z y) a) y))
       (if (<= b 6e+49) (* 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 <= -1.55e+43) {
		tmp = t_1;
	} else if (b <= -4.9e-79) {
		tmp = x * ((pow(z, y) / a) / y);
	} else if (b <= 6e+49) {
		tmp = x * ((pow(a, t) / a) / y);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y, z, t, a, b)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: t_1
    real(8) :: tmp
    t_1 = x * (exp(-b) / y)
    if (b <= (-1.55d+43)) then
        tmp = t_1
    else if (b <= (-4.9d-79)) then
        tmp = x * (((z ** y) / a) / y)
    else if (b <= 6d+49) 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 <= -1.55e+43) {
		tmp = t_1;
	} else if (b <= -4.9e-79) {
		tmp = x * ((Math.pow(z, y) / a) / y);
	} else if (b <= 6e+49) {
		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 <= -1.55e+43:
		tmp = t_1
	elif b <= -4.9e-79:
		tmp = x * ((math.pow(z, y) / a) / y)
	elif b <= 6e+49:
		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(x * Float64(exp(Float64(-b)) / y))
	tmp = 0.0
	if (b <= -1.55e+43)
		tmp = t_1;
	elseif (b <= -4.9e-79)
		tmp = Float64(x * Float64(Float64((z ^ y) / a) / y));
	elseif (b <= 6e+49)
		tmp = Float64(x * Float64(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 <= -1.55e+43)
		tmp = t_1;
	elseif (b <= -4.9e-79)
		tmp = x * (((z ^ y) / a) / y);
	elseif (b <= 6e+49)
		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[(x * N[(N[Exp[(-b)], $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[b, -1.55e+43], t$95$1, If[LessEqual[b, -4.9e-79], N[(x * N[(N[(N[Power[z, y], $MachinePrecision] / a), $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 6e+49], N[(x * N[(N[(N[Power[a, t], $MachinePrecision] / a), $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision], t$95$1]]]]

Derivation

1. Split input into 3 regimes

2. if b < -1.5500000000000001e43 or 6.0000000000000005e49 < 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 b around inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 82.7

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

   5. Applied rewrites 82.7%

      \[\leadsto \frac{x \cdot e^{\color{blue}{-b}}}{y} \]
   6. 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. lower-*.f64 N/A

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

      5. lower-/.f64 82.7

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

   7. Applied rewrites 82.7%

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

   if -1.5500000000000001e43 < b < -4.9000000000000001e-79

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

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

      1. associate-/l* N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. exp-sum N/A

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

      5. *-commutative N/A

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

      6. pow-to-exp N/A

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

      7. pow-to-exp N/A

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

      8. lower-*.f64 N/A

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

      9. lower-pow.f64 N/A

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

      10. lower-pow.f64 N/A

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

      11. lift--.f64 95.7

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

   5. Applied rewrites 95.7%

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

   6. Taylor expanded in t around 0

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

      1. lower-/.f64 N/A

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

      2. lift-pow.f64 95.9

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

   8. Applied rewrites 95.9%

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

   if -4.9000000000000001e-79 < b < 6.0000000000000005e49

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

      1. associate-/l* N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. exp-sum N/A

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

      5. *-commutative N/A

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

      6. pow-to-exp N/A

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

      7. pow-to-exp N/A

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

      8. lower-*.f64 N/A

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

      9. lower-pow.f64 N/A

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

      10. lower-pow.f64 N/A

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

      11. lift--.f64 85.4

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

   5. Applied rewrites 85.4%

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

   6. Taylor expanded in y around 0

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

      1. pow-to-exp N/A

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

      2. lift-pow.f64 N/A

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

      3. lift--.f64 72.6

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

   8. Applied rewrites 72.6%

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

      1. lift--.f64 N/A

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

      2. lift-pow.f64 N/A

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

      3. pow-sub N/A

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

      4. unpow1 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-pow.f64 72.7

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

   10. Applied rewrites 72.7%

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

Alternative 7: 74.6% accurate, 2.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := x \cdot \frac{e^{-b}}{y}\\ \mathbf{if}\;b \leq -5.6 \cdot 10^{+42}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;b \leq -9 \cdot 10^{-209}:\\ \;\;\;\;\frac{x}{a} \cdot \frac{{z}^{y}}{y}\\ \mathbf{elif}\;b \leq 6 \cdot 10^{+49}:\\ \;\;\;\;x \cdot \frac{\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 -5.6e+42)
     t_1
     (if (<= b -9e-209)
       (* (/ x a) (/ (pow z y) y))
       (if (<= b 6e+49) (* 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 <= -5.6e+42) {
		tmp = t_1;
	} else if (b <= -9e-209) {
		tmp = (x / a) * (pow(z, y) / y);
	} else if (b <= 6e+49) {
		tmp = x * ((pow(a, t) / a) / y);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y, z, t, a, b)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: t_1
    real(8) :: tmp
    t_1 = x * (exp(-b) / y)
    if (b <= (-5.6d+42)) then
        tmp = t_1
    else if (b <= (-9d-209)) then
        tmp = (x / a) * ((z ** y) / y)
    else if (b <= 6d+49) 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 <= -5.6e+42) {
		tmp = t_1;
	} else if (b <= -9e-209) {
		tmp = (x / a) * (Math.pow(z, y) / y);
	} else if (b <= 6e+49) {
		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 <= -5.6e+42:
		tmp = t_1
	elif b <= -9e-209:
		tmp = (x / a) * (math.pow(z, y) / y)
	elif b <= 6e+49:
		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(x * Float64(exp(Float64(-b)) / y))
	tmp = 0.0
	if (b <= -5.6e+42)
		tmp = t_1;
	elseif (b <= -9e-209)
		tmp = Float64(Float64(x / a) * Float64((z ^ y) / y));
	elseif (b <= 6e+49)
		tmp = Float64(x * Float64(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 <= -5.6e+42)
		tmp = t_1;
	elseif (b <= -9e-209)
		tmp = (x / a) * ((z ^ y) / y);
	elseif (b <= 6e+49)
		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[(x * N[(N[Exp[(-b)], $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[b, -5.6e+42], t$95$1, If[LessEqual[b, -9e-209], N[(N[(x / a), $MachinePrecision] * N[(N[Power[z, y], $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 6e+49], N[(x * N[(N[(N[Power[a, t], $MachinePrecision] / a), $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision], t$95$1]]]]

Derivation

1. Split input into 3 regimes

2. if b < -5.5999999999999999e42 or 6.0000000000000005e49 < 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 b around inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 82.7

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

   5. Applied rewrites 82.7%

      \[\leadsto \frac{x \cdot e^{\color{blue}{-b}}}{y} \]
   6. 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. lower-*.f64 N/A

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

      5. lower-/.f64 82.7

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

   7. Applied rewrites 82.7%

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

   if -5.5999999999999999e42 < b < -8.9999999999999996e-209

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

      1. associate-/l* N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. exp-sum N/A

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

      5. *-commutative N/A

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

      6. pow-to-exp N/A

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

      7. pow-to-exp N/A

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

      8. lower-*.f64 N/A

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

      9. lower-pow.f64 N/A

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

      10. lower-pow.f64 N/A

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

      11. lift--.f64 84.4

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

   5. Applied rewrites 84.4%

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

   6. Taylor expanded in t around 0

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

      1. times-frac N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lift-pow.f64 78.7

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

   8. Applied rewrites 78.7%

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

   if -8.9999999999999996e-209 < b < 6.0000000000000005e49

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

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

      1. associate-/l* N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. exp-sum N/A

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

      5. *-commutative N/A

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

      6. pow-to-exp N/A

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

      7. pow-to-exp N/A

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

      8. lower-*.f64 N/A

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

      9. lower-pow.f64 N/A

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

      10. lower-pow.f64 N/A

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

      11. lift--.f64 88.6

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

   5. Applied rewrites 88.6%

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

   6. Taylor expanded in y around 0

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

      1. pow-to-exp N/A

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

      2. lift-pow.f64 N/A

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

      3. lift--.f64 72.8

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

   8. Applied rewrites 72.8%

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

      1. lift--.f64 N/A

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

      2. lift-pow.f64 N/A

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

      3. pow-sub N/A

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

      4. unpow1 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-pow.f64 72.8

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

   10. Applied rewrites 72.8%

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

Alternative 8: 74.5% accurate, 2.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := x \cdot \frac{e^{-b}}{y}\\ \mathbf{if}\;b \leq -5.6 \cdot 10^{+42}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;b \leq -9 \cdot 10^{-209}:\\ \;\;\;\;\frac{x}{a} \cdot \frac{{z}^{y}}{y}\\ \mathbf{elif}\;b \leq 6 \cdot 10^{+49}:\\ \;\;\;\;x \cdot \frac{{a}^{\left(t - 1\right)}}{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 -5.6e+42)
     t_1
     (if (<= b -9e-209)
       (* (/ x a) (/ (pow z y) y))
       (if (<= b 6e+49) (* x (/ (pow a (- t 1.0)) 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 <= -5.6e+42) {
		tmp = t_1;
	} else if (b <= -9e-209) {
		tmp = (x / a) * (pow(z, y) / y);
	} else if (b <= 6e+49) {
		tmp = x * (pow(a, (t - 1.0)) / y);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y, z, t, a, b)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: t_1
    real(8) :: tmp
    t_1 = x * (exp(-b) / y)
    if (b <= (-5.6d+42)) then
        tmp = t_1
    else if (b <= (-9d-209)) then
        tmp = (x / a) * ((z ** y) / y)
    else if (b <= 6d+49) then
        tmp = x * ((a ** (t - 1.0d0)) / 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 <= -5.6e+42) {
		tmp = t_1;
	} else if (b <= -9e-209) {
		tmp = (x / a) * (Math.pow(z, y) / y);
	} else if (b <= 6e+49) {
		tmp = x * (Math.pow(a, (t - 1.0)) / 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 <= -5.6e+42:
		tmp = t_1
	elif b <= -9e-209:
		tmp = (x / a) * (math.pow(z, y) / y)
	elif b <= 6e+49:
		tmp = x * (math.pow(a, (t - 1.0)) / y)
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z, t, a, b)
	t_1 = Float64(x * Float64(exp(Float64(-b)) / y))
	tmp = 0.0
	if (b <= -5.6e+42)
		tmp = t_1;
	elseif (b <= -9e-209)
		tmp = Float64(Float64(x / a) * Float64((z ^ y) / y));
	elseif (b <= 6e+49)
		tmp = Float64(x * Float64((a ^ Float64(t - 1.0)) / 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 <= -5.6e+42)
		tmp = t_1;
	elseif (b <= -9e-209)
		tmp = (x / a) * ((z ^ y) / y);
	elseif (b <= 6e+49)
		tmp = x * ((a ^ (t - 1.0)) / y);
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(x * N[(N[Exp[(-b)], $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[b, -5.6e+42], t$95$1, If[LessEqual[b, -9e-209], N[(N[(x / a), $MachinePrecision] * N[(N[Power[z, y], $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 6e+49], N[(x * N[(N[Power[a, N[(t - 1.0), $MachinePrecision]], $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision], t$95$1]]]]

Derivation

1. Split input into 3 regimes

2. if b < -5.5999999999999999e42 or 6.0000000000000005e49 < 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 b around inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 82.7

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

   5. Applied rewrites 82.7%

      \[\leadsto \frac{x \cdot e^{\color{blue}{-b}}}{y} \]
   6. 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. lower-*.f64 N/A

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

      5. lower-/.f64 82.7

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

   7. Applied rewrites 82.7%

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

   if -5.5999999999999999e42 < b < -8.9999999999999996e-209

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

      1. associate-/l* N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. exp-sum N/A

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

      5. *-commutative N/A

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

      6. pow-to-exp N/A

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

      7. pow-to-exp N/A

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

      8. lower-*.f64 N/A

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

      9. lower-pow.f64 N/A

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

      10. lower-pow.f64 N/A

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

      11. lift--.f64 84.4

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

   5. Applied rewrites 84.4%

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

   6. Taylor expanded in t around 0

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

      1. times-frac N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lift-pow.f64 78.7

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

   8. Applied rewrites 78.7%

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

   if -8.9999999999999996e-209 < b < 6.0000000000000005e49

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

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

      1. associate-/l* N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. exp-sum N/A

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

      5. *-commutative N/A

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

      6. pow-to-exp N/A

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

      7. pow-to-exp N/A

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

      8. lower-*.f64 N/A

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

      9. lower-pow.f64 N/A

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

      10. lower-pow.f64 N/A

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

      11. lift--.f64 88.6

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

   5. Applied rewrites 88.6%

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

   6. Taylor expanded in y around 0

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

      1. pow-to-exp N/A

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

      2. lift-pow.f64 N/A

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

      3. lift--.f64 72.8

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

   8. Applied rewrites 72.8%

      \[\leadsto x \cdot \frac{{a}^{\left(t - 1\right)}}{y} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 9: 75.1% accurate, 2.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -7.5 \cdot 10^{+42} \lor \neg \left(b \leq 6 \cdot 10^{+49}\right):\\ \;\;\;\;x \cdot \frac{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 -7.5e+42) (not (<= b 6e+49)))
   (* 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 <= -7.5e+42) || !(b <= 6e+49)) {
		tmp = x * (exp(-b) / y);
	} else {
		tmp = x * (pow(a, (t - 1.0)) / y);
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y, z, t, a, b)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: tmp
    if ((b <= (-7.5d+42)) .or. (.not. (b <= 6d+49))) 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 <= -7.5e+42) || !(b <= 6e+49)) {
		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 <= -7.5e+42) or not (b <= 6e+49):
		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 <= -7.5e+42) || !(b <= 6e+49))
		tmp = Float64(x * Float64(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 <= -7.5e+42) || ~((b <= 6e+49)))
		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, -7.5e+42], N[Not[LessEqual[b, 6e+49]], $MachinePrecision]], N[(x * N[(N[Exp[(-b)], $MachinePrecision] / y), $MachinePrecision]), $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 < -7.50000000000000041e42 or 6.0000000000000005e49 < 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 b around inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 82.7

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

   5. Applied rewrites 82.7%

      \[\leadsto \frac{x \cdot e^{\color{blue}{-b}}}{y} \]
   6. 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. lower-*.f64 N/A

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

      5. lower-/.f64 82.7

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

   7. Applied rewrites 82.7%

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

   if -7.50000000000000041e42 < b < 6.0000000000000005e49

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

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

      1. associate-/l* N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. exp-sum N/A

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

      5. *-commutative N/A

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

      6. pow-to-exp N/A

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

      7. pow-to-exp N/A

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

      8. lower-*.f64 N/A

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

      9. lower-pow.f64 N/A

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

      10. lower-pow.f64 N/A

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

      11. lift--.f64 87.1

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

   5. Applied rewrites 87.1%

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

   6. Taylor expanded in y around 0

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

      1. pow-to-exp N/A

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

      2. lift-pow.f64 N/A

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

      3. lift--.f64 71.7

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

   8. Applied rewrites 71.7%

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

4. Final simplification 76.6%

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

Alternative 10: 75.3% accurate, 2.5× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y, z, t, a, b)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: tmp
    if ((b <= (-5.6d+42)) .or. (.not. (b <= 6d+49))) then
        tmp = x * (exp(-b) / y)
    else
        tmp = ((a ** (t - 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 <= -5.6e+42) || !(b <= 6e+49)) {
		tmp = x * (Math.exp(-b) / y);
	} else {
		tmp = (Math.pow(a, (t - 1.0)) * x) / y;
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if b < -5.5999999999999999e42 or 6.0000000000000005e49 < 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 b around inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 82.7

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

   5. Applied rewrites 82.7%

      \[\leadsto \frac{x \cdot e^{\color{blue}{-b}}}{y} \]
   6. 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. lower-*.f64 N/A

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

      5. lower-/.f64 82.7

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

   7. Applied rewrites 82.7%

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

   if -5.5999999999999999e42 < b < 6.0000000000000005e49

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

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

      1. associate-/l* N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. exp-sum N/A

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

      5. *-commutative N/A

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

      6. pow-to-exp N/A

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

      7. pow-to-exp N/A

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

      8. lower-*.f64 N/A

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

      9. lower-pow.f64 N/A

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

      10. lower-pow.f64 N/A

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

      11. lift--.f64 87.1

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

   5. Applied rewrites 87.1%

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

   6. Taylor expanded in y around 0

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

      1. lower-/.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. pow-to-exp N/A

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

      5. lift-pow.f64 N/A

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

      6. lift--.f64 71.0

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

   8. Applied rewrites 71.0%

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

4. Final simplification 76.2%

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

Alternative 11: 65.6% accurate, 2.6× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y, z, t, a, b)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: tmp
    if ((b <= (-2.9d+44)) .or. (.not. (b <= 6d+49))) then
        tmp = x * (exp(-b) / y)
    else
        tmp = x * ((a ** t) / 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.9e+44) || !(b <= 6e+49)) {
		tmp = x * (Math.exp(-b) / y);
	} else {
		tmp = x * (Math.pow(a, t) / y);
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if b < -2.9000000000000002e44 or 6.0000000000000005e49 < 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 b around inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 82.7

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

   5. Applied rewrites 82.7%

      \[\leadsto \frac{x \cdot e^{\color{blue}{-b}}}{y} \]
   6. 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. lower-*.f64 N/A

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

      5. lower-/.f64 82.7

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

   7. Applied rewrites 82.7%

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

   if -2.9000000000000002e44 < b < 6.0000000000000005e49

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

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

      1. associate-/l* N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. exp-sum N/A

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

      5. *-commutative N/A

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

      6. pow-to-exp N/A

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

      7. pow-to-exp N/A

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

      8. lower-*.f64 N/A

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

      9. lower-pow.f64 N/A

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

      10. lower-pow.f64 N/A

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

      11. lift--.f64 87.1

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

   5. Applied rewrites 87.1%

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

   6. Taylor expanded in y around 0

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

      1. pow-to-exp N/A

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

      2. lift-pow.f64 N/A

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

      3. lift--.f64 71.7

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

   8. Applied rewrites 71.7%

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

   9. Taylor expanded in t around inf

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

   11. Applied rewrites 58.5%

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

4. Final simplification 69.3%

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

Alternative 12: 59.1% accurate, 2.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;t \leq -1.55 \cdot 10^{-16} \lor \neg \left(t \leq 1.75\right):\\ \;\;\;\;x \cdot \frac{{a}^{t}}{y}\\ \mathbf{else}:\\ \;\;\;\;x \cdot \frac{\frac{1}{a}}{y}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (or (<= t -1.55e-16) (not (<= t 1.75)))
   (* x (/ (pow a t) y))
   (* x (/ (/ 1.0 a) y))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((t <= -1.55e-16) || !(t <= 1.75)) {
		tmp = x * (pow(a, t) / y);
	} else {
		tmp = x * ((1.0 / a) / y);
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y, z, t, a, b)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: tmp
    if ((t <= (-1.55d-16)) .or. (.not. (t <= 1.75d0))) then
        tmp = x * ((a ** t) / y)
    else
        tmp = x * ((1.0d0 / 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 <= -1.55e-16) || !(t <= 1.75)) {
		tmp = x * (Math.pow(a, t) / y);
	} else {
		tmp = x * ((1.0 / a) / y);
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	tmp = 0
	if (t <= -1.55e-16) or not (t <= 1.75):
		tmp = x * (math.pow(a, t) / y)
	else:
		tmp = x * ((1.0 / a) / y)
	return tmp

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if ((t <= -1.55e-16) || !(t <= 1.75))
		tmp = Float64(x * Float64((a ^ t) / y));
	else
		tmp = Float64(x * Float64(Float64(1.0 / a) / y));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if ((t <= -1.55e-16) || ~((t <= 1.75)))
		tmp = x * ((a ^ t) / y);
	else
		tmp = x * ((1.0 / a) / y);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[Or[LessEqual[t, -1.55e-16], N[Not[LessEqual[t, 1.75]], $MachinePrecision]], N[(x * N[(N[Power[a, t], $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision], N[(x * N[(N[(1.0 / a), $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if t < -1.55e-16 or 1.75 < 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 b around 0

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

      1. associate-/l* N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. exp-sum N/A

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

      5. *-commutative N/A

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

      6. pow-to-exp N/A

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

      7. pow-to-exp N/A

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

      8. lower-*.f64 N/A

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

      9. lower-pow.f64 N/A

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

      10. lower-pow.f64 N/A

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

      11. lift--.f64 68.8

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

   5. Applied rewrites 68.8%

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

   6. Taylor expanded in y around 0

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

      1. pow-to-exp N/A

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

      2. lift-pow.f64 N/A

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

      3. lift--.f64 80.5

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

   8. Applied rewrites 80.5%

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

   9. Taylor expanded in t around inf

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

   11. Applied rewrites 80.5%

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

   if -1.55e-16 < t < 1.75

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

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

      1. associate-/l* N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. exp-sum N/A

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

      5. *-commutative N/A

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

      6. pow-to-exp N/A

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

      7. pow-to-exp N/A

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

      8. lower-*.f64 N/A

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

      9. lower-pow.f64 N/A

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

      10. lower-pow.f64 N/A

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

      11. lift--.f64 73.1

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

   5. Applied rewrites 73.1%

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

   6. Taylor expanded in t around 0

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

      1. lower-/.f64 N/A

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

      2. lift-pow.f64 72.7

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

   8. Applied rewrites 72.7%

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

   9. Taylor expanded in y around 0

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

   11. Applied rewrites 36.3%

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

4. Final simplification 57.2%

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

Alternative 13: 30.7% accurate, 12.0× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

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

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

   1. associate-/l* N/A

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

   2. lower-*.f64 N/A

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

   3. lower-/.f64 N/A

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

   4. exp-sum N/A

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

   5. *-commutative N/A

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

   6. pow-to-exp N/A

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

   7. pow-to-exp N/A

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

   8. lower-*.f64 N/A

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

   9. lower-pow.f64 N/A

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

   10. lower-pow.f64 N/A

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

   11. lift--.f64 71.0

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

5. Applied rewrites 71.0%

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

6. Taylor expanded in t around 0

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

   1. lower-/.f64 N/A

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

   2. lift-pow.f64 60.5

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

8. Applied rewrites 60.5%

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

9. Taylor expanded in y around 0

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

11. Applied rewrites 30.2%

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

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

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

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