Numeric.SpecFunctions:invIncompleteBetaWorker from math-functions-0.1.5.2, I

Percentage Accurate: 94.2% → 97.5%

Time: 14.5s

Alternatives: 13

Speedup: 0.5×

Specification

Math

\[\begin{array}{l} \\ \frac{x}{x + y \cdot e^{2 \cdot \left(\frac{z \cdot \sqrt{t + a}}{t} - \left(b - c\right) \cdot \left(\left(a + \frac{5}{6}\right) - \frac{2}{t \cdot 3}\right)\right)}} \end{array} \]

FPCore

(FPCore (x y z t a b c)
 :precision binary64
 (/
  x
  (+
   x
   (*
    y
    (exp
     (*
      2.0
      (-
       (/ (* z (sqrt (+ t a))) t)
       (* (- b c) (- (+ a (/ 5.0 6.0)) (/ 2.0 (* t 3.0)))))))))))

C

double code(double x, double y, double z, double t, double a, double b, double c) {
	return x / (x + (y * exp((2.0 * (((z * sqrt((t + a))) / t) - ((b - c) * ((a + (5.0 / 6.0)) - (2.0 / (t * 3.0)))))))));
}

Fortran

real(8) function code(x, y, z, t, a, b, c)
    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), intent (in) :: c
    code = x / (x + (y * exp((2.0d0 * (((z * sqrt((t + a))) / t) - ((b - c) * ((a + (5.0d0 / 6.0d0)) - (2.0d0 / (t * 3.0d0)))))))))
end function

Java

public static double code(double x, double y, double z, double t, double a, double b, double c) {
	return x / (x + (y * Math.exp((2.0 * (((z * Math.sqrt((t + a))) / t) - ((b - c) * ((a + (5.0 / 6.0)) - (2.0 / (t * 3.0)))))))));
}

Python

def code(x, y, z, t, a, b, c):
	return x / (x + (y * math.exp((2.0 * (((z * math.sqrt((t + a))) / t) - ((b - c) * ((a + (5.0 / 6.0)) - (2.0 / (t * 3.0)))))))))

Julia

function code(x, y, z, t, a, b, c)
	return Float64(x / Float64(x + Float64(y * exp(Float64(2.0 * Float64(Float64(Float64(z * sqrt(Float64(t + a))) / t) - Float64(Float64(b - c) * Float64(Float64(a + Float64(5.0 / 6.0)) - Float64(2.0 / Float64(t * 3.0))))))))))
end

MATLAB

function tmp = code(x, y, z, t, a, b, c)
	tmp = x / (x + (y * exp((2.0 * (((z * sqrt((t + a))) / t) - ((b - c) * ((a + (5.0 / 6.0)) - (2.0 / (t * 3.0)))))))));
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_] := N[(x / N[(x + N[(y * N[Exp[N[(2.0 * N[(N[(N[(z * N[Sqrt[N[(t + a), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / t), $MachinePrecision] - N[(N[(b - c), $MachinePrecision] * N[(N[(a + N[(5.0 / 6.0), $MachinePrecision]), $MachinePrecision] - N[(2.0 / N[(t * 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Initial Program: 94.2% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{x}{x + y \cdot e^{2 \cdot \left(\frac{z \cdot \sqrt{t + a}}{t} - \left(b - c\right) \cdot \left(\left(a + \frac{5}{6}\right) - \frac{2}{t \cdot 3}\right)\right)}} \end{array} \]

FPCore

(FPCore (x y z t a b c)
 :precision binary64
 (/
  x
  (+
   x
   (*
    y
    (exp
     (*
      2.0
      (-
       (/ (* z (sqrt (+ t a))) t)
       (* (- b c) (- (+ a (/ 5.0 6.0)) (/ 2.0 (* t 3.0)))))))))))

C

double code(double x, double y, double z, double t, double a, double b, double c) {
	return x / (x + (y * exp((2.0 * (((z * sqrt((t + a))) / t) - ((b - c) * ((a + (5.0 / 6.0)) - (2.0 / (t * 3.0)))))))));
}

Fortran

real(8) function code(x, y, z, t, a, b, c)
    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), intent (in) :: c
    code = x / (x + (y * exp((2.0d0 * (((z * sqrt((t + a))) / t) - ((b - c) * ((a + (5.0d0 / 6.0d0)) - (2.0d0 / (t * 3.0d0)))))))))
end function

Java

public static double code(double x, double y, double z, double t, double a, double b, double c) {
	return x / (x + (y * Math.exp((2.0 * (((z * Math.sqrt((t + a))) / t) - ((b - c) * ((a + (5.0 / 6.0)) - (2.0 / (t * 3.0)))))))));
}

Python

def code(x, y, z, t, a, b, c):
	return x / (x + (y * math.exp((2.0 * (((z * math.sqrt((t + a))) / t) - ((b - c) * ((a + (5.0 / 6.0)) - (2.0 / (t * 3.0)))))))))

Julia

function code(x, y, z, t, a, b, c)
	return Float64(x / Float64(x + Float64(y * exp(Float64(2.0 * Float64(Float64(Float64(z * sqrt(Float64(t + a))) / t) - Float64(Float64(b - c) * Float64(Float64(a + Float64(5.0 / 6.0)) - Float64(2.0 / Float64(t * 3.0))))))))))
end

MATLAB

function tmp = code(x, y, z, t, a, b, c)
	tmp = x / (x + (y * exp((2.0 * (((z * sqrt((t + a))) / t) - ((b - c) * ((a + (5.0 / 6.0)) - (2.0 / (t * 3.0)))))))));
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_] := N[(x / N[(x + N[(y * N[Exp[N[(2.0 * N[(N[(N[(z * N[Sqrt[N[(t + a), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / t), $MachinePrecision] - N[(N[(b - c), $MachinePrecision] * N[(N[(a + N[(5.0 / 6.0), $MachinePrecision]), $MachinePrecision] - N[(2.0 / N[(t * 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Alternative 1: 97.5% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{x}{x + y \cdot e^{2 \cdot \left(\frac{z \cdot \sqrt{t + a}}{t} - \left(b - c\right) \cdot \left(\left(a + \frac{5}{6}\right) - \frac{2}{t \cdot 3}\right)\right)}}\\ \mathbf{if}\;t\_1 \leq 2:\\ \;\;\;\;t\_1\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{x + y \cdot e^{2 \cdot \frac{\mathsf{fma}\left(\sqrt{a}, z, 0.6666666666666666 \cdot \left(b - c\right)\right)}{t}}}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c)
 :precision binary64
 (let* ((t_1
         (/
          x
          (+
           x
           (*
            y
            (exp
             (*
              2.0
              (-
               (/ (* z (sqrt (+ t a))) t)
               (* (- b c) (- (+ a (/ 5.0 6.0)) (/ 2.0 (* t 3.0))))))))))))
   (if (<= t_1 2.0)
     t_1
     (/
      x
      (+
       x
       (*
        y
        (exp
         (* 2.0 (/ (fma (sqrt a) z (* 0.6666666666666666 (- b c))) t)))))))))

C

double code(double x, double y, double z, double t, double a, double b, double c) {
	double t_1 = x / (x + (y * exp((2.0 * (((z * sqrt((t + a))) / t) - ((b - c) * ((a + (5.0 / 6.0)) - (2.0 / (t * 3.0)))))))));
	double tmp;
	if (t_1 <= 2.0) {
		tmp = t_1;
	} else {
		tmp = x / (x + (y * exp((2.0 * (fma(sqrt(a), z, (0.6666666666666666 * (b - c))) / t)))));
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b, c)
	t_1 = Float64(x / Float64(x + Float64(y * exp(Float64(2.0 * Float64(Float64(Float64(z * sqrt(Float64(t + a))) / t) - Float64(Float64(b - c) * Float64(Float64(a + Float64(5.0 / 6.0)) - Float64(2.0 / Float64(t * 3.0))))))))))
	tmp = 0.0
	if (t_1 <= 2.0)
		tmp = t_1;
	else
		tmp = Float64(x / Float64(x + Float64(y * exp(Float64(2.0 * Float64(fma(sqrt(a), z, Float64(0.6666666666666666 * Float64(b - c))) / t))))));
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(x / N[(x + N[(y * N[Exp[N[(2.0 * N[(N[(N[(z * N[Sqrt[N[(t + a), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / t), $MachinePrecision] - N[(N[(b - c), $MachinePrecision] * N[(N[(a + N[(5.0 / 6.0), $MachinePrecision]), $MachinePrecision] - N[(2.0 / N[(t * 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, 2.0], t$95$1, N[(x / N[(x + N[(y * N[Exp[N[(2.0 * N[(N[(N[Sqrt[a], $MachinePrecision] * z + N[(0.6666666666666666 * N[(b - c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 x (+.f64 x (*.f64 y (exp.f64 (*.f64 #s(literal 2 binary64) (-.f64 (/.f64 (*.f64 z (sqrt.f64 (+.f64 t a))) t) (*.f64 (-.f64 b c) (-.f64 (+.f64 a (/.f64 #s(literal 5 binary64) #s(literal 6 binary64))) (/.f64 #s(literal 2 binary64) (*.f64 t #s(literal 3 binary64))))))))))) < 2

   1. Initial program 98.4%

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

   if 2 < (/.f64 x (+.f64 x (*.f64 y (exp.f64 (*.f64 #s(literal 2 binary64) (-.f64 (/.f64 (*.f64 z (sqrt.f64 (+.f64 t a))) t) (*.f64 (-.f64 b c) (-.f64 (+.f64 a (/.f64 #s(literal 5 binary64) #s(literal 6 binary64))) (/.f64 #s(literal 2 binary64) (*.f64 t #s(literal 3 binary64)))))))))))

   1. Initial program 0.0%

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

   3. Taylor expanded in t around 0

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

      1. lower-/.f64 N/A

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

      2. fp-cancel-sub-sign-inv N/A

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \frac{\color{blue}{\sqrt{a} \cdot z + \left(\mathsf{neg}\left(\frac{-2}{3}\right)\right) \cdot \left(b - c\right)}}{t}}} \]

      3. metadata-eval N/A

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

      4. lower-fma.f64 N/A

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \frac{\color{blue}{\mathsf{fma}\left(\sqrt{a}, z, \frac{2}{3} \cdot \left(b - c\right)\right)}}{t}}} \]

      5. lower-sqrt.f64 N/A

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \frac{\mathsf{fma}\left(\color{blue}{\sqrt{a}}, z, \frac{2}{3} \cdot \left(b - c\right)\right)}{t}}} \]

      6. lower-*.f64 N/A

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \frac{\mathsf{fma}\left(\sqrt{a}, z, \color{blue}{\frac{2}{3} \cdot \left(b - c\right)}\right)}{t}}} \]

      7. lower--.f64 70.0

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \frac{\mathsf{fma}\left(\sqrt{a}, z, 0.6666666666666666 \cdot \color{blue}{\left(b - c\right)}\right)}{t}}} \]

   5. Applied rewrites 70.0%

      \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \color{blue}{\frac{\mathsf{fma}\left(\sqrt{a}, z, 0.6666666666666666 \cdot \left(b - c\right)\right)}{t}}}} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 2: 74.5% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := 2 \cdot \left(\frac{z \cdot \sqrt{t + a}}{t} - \left(b - c\right) \cdot \left(\left(a + \frac{5}{6}\right) - \frac{2}{t \cdot 3}\right)\right)\\ \mathbf{if}\;t\_1 \leq -2 \cdot 10^{+17}:\\ \;\;\;\;1\\ \mathbf{elif}\;t\_1 \leq 10^{+89} \lor \neg \left(t\_1 \leq 10^{+229}\right):\\ \;\;\;\;\frac{x}{x + y \cdot e^{2 \cdot \left(\left(-b\right) \cdot \left(0.8333333333333334 + a\right)\right)}}\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{x + y \cdot e^{2 \cdot \left(\left(0.8333333333333334 + a\right) \cdot c\right)}}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c)
 :precision binary64
 (let* ((t_1
         (*
          2.0
          (-
           (/ (* z (sqrt (+ t a))) t)
           (* (- b c) (- (+ a (/ 5.0 6.0)) (/ 2.0 (* t 3.0))))))))
   (if (<= t_1 -2e+17)
     1.0
     (if (or (<= t_1 1e+89) (not (<= t_1 1e+229)))
       (/ x (+ x (* y (exp (* 2.0 (* (- b) (+ 0.8333333333333334 a)))))))
       (/ x (+ x (* y (exp (* 2.0 (* (+ 0.8333333333333334 a) c))))))))))

C

double code(double x, double y, double z, double t, double a, double b, double c) {
	double t_1 = 2.0 * (((z * sqrt((t + a))) / t) - ((b - c) * ((a + (5.0 / 6.0)) - (2.0 / (t * 3.0)))));
	double tmp;
	if (t_1 <= -2e+17) {
		tmp = 1.0;
	} else if ((t_1 <= 1e+89) || !(t_1 <= 1e+229)) {
		tmp = x / (x + (y * exp((2.0 * (-b * (0.8333333333333334 + a))))));
	} else {
		tmp = x / (x + (y * exp((2.0 * ((0.8333333333333334 + a) * c)))));
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b, c)
    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), intent (in) :: c
    real(8) :: t_1
    real(8) :: tmp
    t_1 = 2.0d0 * (((z * sqrt((t + a))) / t) - ((b - c) * ((a + (5.0d0 / 6.0d0)) - (2.0d0 / (t * 3.0d0)))))
    if (t_1 <= (-2d+17)) then
        tmp = 1.0d0
    else if ((t_1 <= 1d+89) .or. (.not. (t_1 <= 1d+229))) then
        tmp = x / (x + (y * exp((2.0d0 * (-b * (0.8333333333333334d0 + a))))))
    else
        tmp = x / (x + (y * exp((2.0d0 * ((0.8333333333333334d0 + a) * c)))))
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b, double c) {
	double t_1 = 2.0 * (((z * Math.sqrt((t + a))) / t) - ((b - c) * ((a + (5.0 / 6.0)) - (2.0 / (t * 3.0)))));
	double tmp;
	if (t_1 <= -2e+17) {
		tmp = 1.0;
	} else if ((t_1 <= 1e+89) || !(t_1 <= 1e+229)) {
		tmp = x / (x + (y * Math.exp((2.0 * (-b * (0.8333333333333334 + a))))));
	} else {
		tmp = x / (x + (y * Math.exp((2.0 * ((0.8333333333333334 + a) * c)))));
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b, c):
	t_1 = 2.0 * (((z * math.sqrt((t + a))) / t) - ((b - c) * ((a + (5.0 / 6.0)) - (2.0 / (t * 3.0)))))
	tmp = 0
	if t_1 <= -2e+17:
		tmp = 1.0
	elif (t_1 <= 1e+89) or not (t_1 <= 1e+229):
		tmp = x / (x + (y * math.exp((2.0 * (-b * (0.8333333333333334 + a))))))
	else:
		tmp = x / (x + (y * math.exp((2.0 * ((0.8333333333333334 + a) * c)))))
	return tmp

Julia

function code(x, y, z, t, a, b, c)
	t_1 = Float64(2.0 * Float64(Float64(Float64(z * sqrt(Float64(t + a))) / t) - Float64(Float64(b - c) * Float64(Float64(a + Float64(5.0 / 6.0)) - Float64(2.0 / Float64(t * 3.0))))))
	tmp = 0.0
	if (t_1 <= -2e+17)
		tmp = 1.0;
	elseif ((t_1 <= 1e+89) || !(t_1 <= 1e+229))
		tmp = Float64(x / Float64(x + Float64(y * exp(Float64(2.0 * Float64(Float64(-b) * Float64(0.8333333333333334 + a)))))));
	else
		tmp = Float64(x / Float64(x + Float64(y * exp(Float64(2.0 * Float64(Float64(0.8333333333333334 + a) * c))))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b, c)
	t_1 = 2.0 * (((z * sqrt((t + a))) / t) - ((b - c) * ((a + (5.0 / 6.0)) - (2.0 / (t * 3.0)))));
	tmp = 0.0;
	if (t_1 <= -2e+17)
		tmp = 1.0;
	elseif ((t_1 <= 1e+89) || ~((t_1 <= 1e+229)))
		tmp = x / (x + (y * exp((2.0 * (-b * (0.8333333333333334 + a))))));
	else
		tmp = x / (x + (y * exp((2.0 * ((0.8333333333333334 + a) * c)))));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(2.0 * N[(N[(N[(z * N[Sqrt[N[(t + a), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / t), $MachinePrecision] - N[(N[(b - c), $MachinePrecision] * N[(N[(a + N[(5.0 / 6.0), $MachinePrecision]), $MachinePrecision] - N[(2.0 / N[(t * 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -2e+17], 1.0, If[Or[LessEqual[t$95$1, 1e+89], N[Not[LessEqual[t$95$1, 1e+229]], $MachinePrecision]], N[(x / N[(x + N[(y * N[Exp[N[(2.0 * N[((-b) * N[(0.8333333333333334 + a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(x / N[(x + N[(y * N[Exp[N[(2.0 * N[(N[(0.8333333333333334 + a), $MachinePrecision] * c), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if (*.f64 #s(literal 2 binary64) (-.f64 (/.f64 (*.f64 z (sqrt.f64 (+.f64 t a))) t) (*.f64 (-.f64 b c) (-.f64 (+.f64 a (/.f64 #s(literal 5 binary64) #s(literal 6 binary64))) (/.f64 #s(literal 2 binary64) (*.f64 t #s(literal 3 binary64))))))) < -2e17

   1. Initial program 96.3%

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

   3. Taylor expanded in x around inf

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

   5. Applied rewrites 96.3%

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

   if -2e17 < (*.f64 #s(literal 2 binary64) (-.f64 (/.f64 (*.f64 z (sqrt.f64 (+.f64 t a))) t) (*.f64 (-.f64 b c) (-.f64 (+.f64 a (/.f64 #s(literal 5 binary64) #s(literal 6 binary64))) (/.f64 #s(literal 2 binary64) (*.f64 t #s(literal 3 binary64))))))) < 9.99999999999999995e88 or 9.9999999999999999e228 < (*.f64 #s(literal 2 binary64) (-.f64 (/.f64 (*.f64 z (sqrt.f64 (+.f64 t a))) t) (*.f64 (-.f64 b c) (-.f64 (+.f64 a (/.f64 #s(literal 5 binary64) #s(literal 6 binary64))) (/.f64 #s(literal 2 binary64) (*.f64 t #s(literal 3 binary64)))))))

   1. Initial program 90.0%

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

   3. Taylor expanded in b around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. associate--r+ N/A

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

      4. lower--.f64 N/A

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

      5. lower--.f64 N/A

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

      6. associate-*r/ N/A

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

      7. metadata-eval N/A

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

      8. lower-/.f64 72.2

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

   5. Applied rewrites 72.2%

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

   6. Taylor expanded in t around inf

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

   8. Applied rewrites 59.9%

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

   if 9.99999999999999995e88 < (*.f64 #s(literal 2 binary64) (-.f64 (/.f64 (*.f64 z (sqrt.f64 (+.f64 t a))) t) (*.f64 (-.f64 b c) (-.f64 (+.f64 a (/.f64 #s(literal 5 binary64) #s(literal 6 binary64))) (/.f64 #s(literal 2 binary64) (*.f64 t #s(literal 3 binary64))))))) < 9.9999999999999999e228

   1. Initial program 100.0%

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

   3. Taylor expanded in c around inf

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

      1. *-commutative N/A

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \color{blue}{\left(\left(\left(\frac{5}{6} + a\right) - \frac{2}{3} \cdot \frac{1}{t}\right) \cdot c\right)}}} \]

      2. lower-*.f64 N/A

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \color{blue}{\left(\left(\left(\frac{5}{6} + a\right) - \frac{2}{3} \cdot \frac{1}{t}\right) \cdot c\right)}}} \]

      3. lower--.f64 N/A

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \left(\color{blue}{\left(\left(\frac{5}{6} + a\right) - \frac{2}{3} \cdot \frac{1}{t}\right)} \cdot c\right)}} \]

      4. lower-+.f64 N/A

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \left(\left(\color{blue}{\left(\frac{5}{6} + a\right)} - \frac{2}{3} \cdot \frac{1}{t}\right) \cdot c\right)}} \]

      5. associate-*r/ N/A

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \left(\left(\left(\frac{5}{6} + a\right) - \color{blue}{\frac{\frac{2}{3} \cdot 1}{t}}\right) \cdot c\right)}} \]

      6. metadata-eval N/A

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \left(\left(\left(\frac{5}{6} + a\right) - \frac{\color{blue}{\frac{2}{3}}}{t}\right) \cdot c\right)}} \]

      7. lower-/.f64 80.8

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \left(\left(\left(0.8333333333333334 + a\right) - \color{blue}{\frac{0.6666666666666666}{t}}\right) \cdot c\right)}} \]

   5. Applied rewrites 80.8%

      \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \color{blue}{\left(\left(\left(0.8333333333333334 + a\right) - \frac{0.6666666666666666}{t}\right) \cdot c\right)}}} \]

   6. Taylor expanded in t around inf

      \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \left(c \cdot \color{blue}{\left(\frac{5}{6} + a\right)}\right)}} \]
   7. Step-by-step derivation

   8. Applied rewrites 81.0%

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

4. Final simplification 76.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;2 \cdot \left(\frac{z \cdot \sqrt{t + a}}{t} - \left(b - c\right) \cdot \left(\left(a + \frac{5}{6}\right) - \frac{2}{t \cdot 3}\right)\right) \leq -2 \cdot 10^{+17}:\\ \;\;\;\;1\\ \mathbf{elif}\;2 \cdot \left(\frac{z \cdot \sqrt{t + a}}{t} - \left(b - c\right) \cdot \left(\left(a + \frac{5}{6}\right) - \frac{2}{t \cdot 3}\right)\right) \leq 10^{+89} \lor \neg \left(2 \cdot \left(\frac{z \cdot \sqrt{t + a}}{t} - \left(b - c\right) \cdot \left(\left(a + \frac{5}{6}\right) - \frac{2}{t \cdot 3}\right)\right) \leq 10^{+229}\right):\\ \;\;\;\;\frac{x}{x + y \cdot e^{2 \cdot \left(\left(-b\right) \cdot \left(0.8333333333333334 + a\right)\right)}}\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{x + y \cdot e^{2 \cdot \left(\left(0.8333333333333334 + a\right) \cdot c\right)}}\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 70.9% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := 2 \cdot \left(\frac{z \cdot \sqrt{t + a}}{t} - \left(b - c\right) \cdot \left(\left(a + \frac{5}{6}\right) - \frac{2}{t \cdot 3}\right)\right)\\ \mathbf{if}\;t\_1 \leq -20000:\\ \;\;\;\;1\\ \mathbf{elif}\;t\_1 \leq 10^{+89} \lor \neg \left(t\_1 \leq 10^{+249}\right):\\ \;\;\;\;\frac{x}{x + y \cdot e^{2 \cdot \left(-0.8333333333333334 \cdot b\right)}}\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{x + y \cdot e^{2 \cdot \left(0.8333333333333334 \cdot c\right)}}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c)
 :precision binary64
 (let* ((t_1
         (*
          2.0
          (-
           (/ (* z (sqrt (+ t a))) t)
           (* (- b c) (- (+ a (/ 5.0 6.0)) (/ 2.0 (* t 3.0))))))))
   (if (<= t_1 -20000.0)
     1.0
     (if (or (<= t_1 1e+89) (not (<= t_1 1e+249)))
       (/ x (+ x (* y (exp (* 2.0 (* -0.8333333333333334 b))))))
       (/ x (+ x (* y (exp (* 2.0 (* 0.8333333333333334 c))))))))))

C

double code(double x, double y, double z, double t, double a, double b, double c) {
	double t_1 = 2.0 * (((z * sqrt((t + a))) / t) - ((b - c) * ((a + (5.0 / 6.0)) - (2.0 / (t * 3.0)))));
	double tmp;
	if (t_1 <= -20000.0) {
		tmp = 1.0;
	} else if ((t_1 <= 1e+89) || !(t_1 <= 1e+249)) {
		tmp = x / (x + (y * exp((2.0 * (-0.8333333333333334 * b)))));
	} else {
		tmp = x / (x + (y * exp((2.0 * (0.8333333333333334 * c)))));
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b, c)
    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), intent (in) :: c
    real(8) :: t_1
    real(8) :: tmp
    t_1 = 2.0d0 * (((z * sqrt((t + a))) / t) - ((b - c) * ((a + (5.0d0 / 6.0d0)) - (2.0d0 / (t * 3.0d0)))))
    if (t_1 <= (-20000.0d0)) then
        tmp = 1.0d0
    else if ((t_1 <= 1d+89) .or. (.not. (t_1 <= 1d+249))) then
        tmp = x / (x + (y * exp((2.0d0 * ((-0.8333333333333334d0) * b)))))
    else
        tmp = x / (x + (y * exp((2.0d0 * (0.8333333333333334d0 * c)))))
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b, double c) {
	double t_1 = 2.0 * (((z * Math.sqrt((t + a))) / t) - ((b - c) * ((a + (5.0 / 6.0)) - (2.0 / (t * 3.0)))));
	double tmp;
	if (t_1 <= -20000.0) {
		tmp = 1.0;
	} else if ((t_1 <= 1e+89) || !(t_1 <= 1e+249)) {
		tmp = x / (x + (y * Math.exp((2.0 * (-0.8333333333333334 * b)))));
	} else {
		tmp = x / (x + (y * Math.exp((2.0 * (0.8333333333333334 * c)))));
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b, c):
	t_1 = 2.0 * (((z * math.sqrt((t + a))) / t) - ((b - c) * ((a + (5.0 / 6.0)) - (2.0 / (t * 3.0)))))
	tmp = 0
	if t_1 <= -20000.0:
		tmp = 1.0
	elif (t_1 <= 1e+89) or not (t_1 <= 1e+249):
		tmp = x / (x + (y * math.exp((2.0 * (-0.8333333333333334 * b)))))
	else:
		tmp = x / (x + (y * math.exp((2.0 * (0.8333333333333334 * c)))))
	return tmp

Julia

function code(x, y, z, t, a, b, c)
	t_1 = Float64(2.0 * Float64(Float64(Float64(z * sqrt(Float64(t + a))) / t) - Float64(Float64(b - c) * Float64(Float64(a + Float64(5.0 / 6.0)) - Float64(2.0 / Float64(t * 3.0))))))
	tmp = 0.0
	if (t_1 <= -20000.0)
		tmp = 1.0;
	elseif ((t_1 <= 1e+89) || !(t_1 <= 1e+249))
		tmp = Float64(x / Float64(x + Float64(y * exp(Float64(2.0 * Float64(-0.8333333333333334 * b))))));
	else
		tmp = Float64(x / Float64(x + Float64(y * exp(Float64(2.0 * Float64(0.8333333333333334 * c))))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b, c)
	t_1 = 2.0 * (((z * sqrt((t + a))) / t) - ((b - c) * ((a + (5.0 / 6.0)) - (2.0 / (t * 3.0)))));
	tmp = 0.0;
	if (t_1 <= -20000.0)
		tmp = 1.0;
	elseif ((t_1 <= 1e+89) || ~((t_1 <= 1e+249)))
		tmp = x / (x + (y * exp((2.0 * (-0.8333333333333334 * b)))));
	else
		tmp = x / (x + (y * exp((2.0 * (0.8333333333333334 * c)))));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(2.0 * N[(N[(N[(z * N[Sqrt[N[(t + a), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / t), $MachinePrecision] - N[(N[(b - c), $MachinePrecision] * N[(N[(a + N[(5.0 / 6.0), $MachinePrecision]), $MachinePrecision] - N[(2.0 / N[(t * 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -20000.0], 1.0, If[Or[LessEqual[t$95$1, 1e+89], N[Not[LessEqual[t$95$1, 1e+249]], $MachinePrecision]], N[(x / N[(x + N[(y * N[Exp[N[(2.0 * N[(-0.8333333333333334 * b), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(x / N[(x + N[(y * N[Exp[N[(2.0 * N[(0.8333333333333334 * c), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if (*.f64 #s(literal 2 binary64) (-.f64 (/.f64 (*.f64 z (sqrt.f64 (+.f64 t a))) t) (*.f64 (-.f64 b c) (-.f64 (+.f64 a (/.f64 #s(literal 5 binary64) #s(literal 6 binary64))) (/.f64 #s(literal 2 binary64) (*.f64 t #s(literal 3 binary64))))))) < -2e4

   1. Initial program 96.4%

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

   3. Taylor expanded in x around inf

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

   5. Applied rewrites 96.4%

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

   if -2e4 < (*.f64 #s(literal 2 binary64) (-.f64 (/.f64 (*.f64 z (sqrt.f64 (+.f64 t a))) t) (*.f64 (-.f64 b c) (-.f64 (+.f64 a (/.f64 #s(literal 5 binary64) #s(literal 6 binary64))) (/.f64 #s(literal 2 binary64) (*.f64 t #s(literal 3 binary64))))))) < 9.99999999999999995e88 or 9.9999999999999992e248 < (*.f64 #s(literal 2 binary64) (-.f64 (/.f64 (*.f64 z (sqrt.f64 (+.f64 t a))) t) (*.f64 (-.f64 b c) (-.f64 (+.f64 a (/.f64 #s(literal 5 binary64) #s(literal 6 binary64))) (/.f64 #s(literal 2 binary64) (*.f64 t #s(literal 3 binary64)))))))

   1. Initial program 89.2%

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

   3. Taylor expanded in b around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. associate--r+ N/A

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

      4. lower--.f64 N/A

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

      5. lower--.f64 N/A

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

      6. associate-*r/ N/A

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

      7. metadata-eval N/A

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

      8. lower-/.f64 71.5

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

   5. Applied rewrites 71.5%

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

   6. Taylor expanded in t around inf

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

   8. Applied rewrites 60.6%

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

   9. Taylor expanded in a around 0

      \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \left(\frac{-5}{6} \cdot b\right)}} \]
   10. Step-by-step derivation

   11. Applied rewrites 51.0%

       \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \left(-0.8333333333333334 \cdot b\right)}} \]

   if 9.99999999999999995e88 < (*.f64 #s(literal 2 binary64) (-.f64 (/.f64 (*.f64 z (sqrt.f64 (+.f64 t a))) t) (*.f64 (-.f64 b c) (-.f64 (+.f64 a (/.f64 #s(literal 5 binary64) #s(literal 6 binary64))) (/.f64 #s(literal 2 binary64) (*.f64 t #s(literal 3 binary64))))))) < 9.9999999999999992e248

   1. Initial program 100.0%

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

   3. Taylor expanded in c around inf

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

      1. *-commutative N/A

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \color{blue}{\left(\left(\left(\frac{5}{6} + a\right) - \frac{2}{3} \cdot \frac{1}{t}\right) \cdot c\right)}}} \]

      2. lower-*.f64 N/A

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \color{blue}{\left(\left(\left(\frac{5}{6} + a\right) - \frac{2}{3} \cdot \frac{1}{t}\right) \cdot c\right)}}} \]

      3. lower--.f64 N/A

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \left(\color{blue}{\left(\left(\frac{5}{6} + a\right) - \frac{2}{3} \cdot \frac{1}{t}\right)} \cdot c\right)}} \]

      4. lower-+.f64 N/A

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \left(\left(\color{blue}{\left(\frac{5}{6} + a\right)} - \frac{2}{3} \cdot \frac{1}{t}\right) \cdot c\right)}} \]

      5. associate-*r/ N/A

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \left(\left(\left(\frac{5}{6} + a\right) - \color{blue}{\frac{\frac{2}{3} \cdot 1}{t}}\right) \cdot c\right)}} \]

      6. metadata-eval N/A

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \left(\left(\left(\frac{5}{6} + a\right) - \frac{\color{blue}{\frac{2}{3}}}{t}\right) \cdot c\right)}} \]

      7. lower-/.f64 65.7

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \left(\left(\left(0.8333333333333334 + a\right) - \color{blue}{\frac{0.6666666666666666}{t}}\right) \cdot c\right)}} \]

   5. Applied rewrites 65.7%

      \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \color{blue}{\left(\left(\left(0.8333333333333334 + a\right) - \frac{0.6666666666666666}{t}\right) \cdot c\right)}}} \]

   6. Taylor expanded in t around inf

      \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \left(c \cdot \color{blue}{\left(\frac{5}{6} + a\right)}\right)}} \]
   7. Step-by-step derivation

   8. Applied rewrites 66.5%

      \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \left(\left(0.8333333333333334 + a\right) \cdot \color{blue}{c}\right)}} \]

   9. Taylor expanded in a around 0

      \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \left(\frac{5}{6} \cdot c\right)}} \]
   10. Step-by-step derivation

   11. Applied rewrites 63.2%

       \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \left(0.8333333333333334 \cdot c\right)}} \]
3. Recombined 3 regimes into one program.

4. Final simplification 71.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;2 \cdot \left(\frac{z \cdot \sqrt{t + a}}{t} - \left(b - c\right) \cdot \left(\left(a + \frac{5}{6}\right) - \frac{2}{t \cdot 3}\right)\right) \leq -20000:\\ \;\;\;\;1\\ \mathbf{elif}\;2 \cdot \left(\frac{z \cdot \sqrt{t + a}}{t} - \left(b - c\right) \cdot \left(\left(a + \frac{5}{6}\right) - \frac{2}{t \cdot 3}\right)\right) \leq 10^{+89} \lor \neg \left(2 \cdot \left(\frac{z \cdot \sqrt{t + a}}{t} - \left(b - c\right) \cdot \left(\left(a + \frac{5}{6}\right) - \frac{2}{t \cdot 3}\right)\right) \leq 10^{+249}\right):\\ \;\;\;\;\frac{x}{x + y \cdot e^{2 \cdot \left(-0.8333333333333334 \cdot b\right)}}\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{x + y \cdot e^{2 \cdot \left(0.8333333333333334 \cdot c\right)}}\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 74.2% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;e^{2 \cdot \left(\frac{z \cdot \sqrt{t + a}}{t} - \left(b - c\right) \cdot \left(\left(a + \frac{5}{6}\right) - \frac{2}{t \cdot 3}\right)\right)} \leq 0:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{x + y \cdot e^{2 \cdot \left(\left(0.8333333333333334 + a\right) \cdot c\right)}}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c)
 :precision binary64
 (if (<=
      (exp
       (*
        2.0
        (-
         (/ (* z (sqrt (+ t a))) t)
         (* (- b c) (- (+ a (/ 5.0 6.0)) (/ 2.0 (* t 3.0)))))))
      0.0)
   1.0
   (/ x (+ x (* y (exp (* 2.0 (* (+ 0.8333333333333334 a) c))))))))

C

double code(double x, double y, double z, double t, double a, double b, double c) {
	double tmp;
	if (exp((2.0 * (((z * sqrt((t + a))) / t) - ((b - c) * ((a + (5.0 / 6.0)) - (2.0 / (t * 3.0))))))) <= 0.0) {
		tmp = 1.0;
	} else {
		tmp = x / (x + (y * exp((2.0 * ((0.8333333333333334 + a) * c)))));
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b, c)
    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), intent (in) :: c
    real(8) :: tmp
    if (exp((2.0d0 * (((z * sqrt((t + a))) / t) - ((b - c) * ((a + (5.0d0 / 6.0d0)) - (2.0d0 / (t * 3.0d0))))))) <= 0.0d0) then
        tmp = 1.0d0
    else
        tmp = x / (x + (y * exp((2.0d0 * ((0.8333333333333334d0 + a) * c)))))
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b, double c) {
	double tmp;
	if (Math.exp((2.0 * (((z * Math.sqrt((t + a))) / t) - ((b - c) * ((a + (5.0 / 6.0)) - (2.0 / (t * 3.0))))))) <= 0.0) {
		tmp = 1.0;
	} else {
		tmp = x / (x + (y * Math.exp((2.0 * ((0.8333333333333334 + a) * c)))));
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b, c):
	tmp = 0
	if math.exp((2.0 * (((z * math.sqrt((t + a))) / t) - ((b - c) * ((a + (5.0 / 6.0)) - (2.0 / (t * 3.0))))))) <= 0.0:
		tmp = 1.0
	else:
		tmp = x / (x + (y * math.exp((2.0 * ((0.8333333333333334 + a) * c)))))
	return tmp

Julia

function code(x, y, z, t, a, b, c)
	tmp = 0.0
	if (exp(Float64(2.0 * Float64(Float64(Float64(z * sqrt(Float64(t + a))) / t) - Float64(Float64(b - c) * Float64(Float64(a + Float64(5.0 / 6.0)) - Float64(2.0 / Float64(t * 3.0))))))) <= 0.0)
		tmp = 1.0;
	else
		tmp = Float64(x / Float64(x + Float64(y * exp(Float64(2.0 * Float64(Float64(0.8333333333333334 + a) * c))))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b, c)
	tmp = 0.0;
	if (exp((2.0 * (((z * sqrt((t + a))) / t) - ((b - c) * ((a + (5.0 / 6.0)) - (2.0 / (t * 3.0))))))) <= 0.0)
		tmp = 1.0;
	else
		tmp = x / (x + (y * exp((2.0 * ((0.8333333333333334 + a) * c)))));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_] := If[LessEqual[N[Exp[N[(2.0 * N[(N[(N[(z * N[Sqrt[N[(t + a), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / t), $MachinePrecision] - N[(N[(b - c), $MachinePrecision] * N[(N[(a + N[(5.0 / 6.0), $MachinePrecision]), $MachinePrecision] - N[(2.0 / N[(t * 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], 0.0], 1.0, N[(x / N[(x + N[(y * N[Exp[N[(2.0 * N[(N[(0.8333333333333334 + a), $MachinePrecision] * c), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (exp.f64 (*.f64 #s(literal 2 binary64) (-.f64 (/.f64 (*.f64 z (sqrt.f64 (+.f64 t a))) t) (*.f64 (-.f64 b c) (-.f64 (+.f64 a (/.f64 #s(literal 5 binary64) #s(literal 6 binary64))) (/.f64 #s(literal 2 binary64) (*.f64 t #s(literal 3 binary64)))))))) < 0.0

   1. Initial program 96.4%

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

   3. Taylor expanded in x around inf

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

   5. Applied rewrites 96.4%

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

   if 0.0 < (exp.f64 (*.f64 #s(literal 2 binary64) (-.f64 (/.f64 (*.f64 z (sqrt.f64 (+.f64 t a))) t) (*.f64 (-.f64 b c) (-.f64 (+.f64 a (/.f64 #s(literal 5 binary64) #s(literal 6 binary64))) (/.f64 #s(literal 2 binary64) (*.f64 t #s(literal 3 binary64))))))))

   1. Initial program 91.2%

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

   3. Taylor expanded in c around inf

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

      1. *-commutative N/A

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \color{blue}{\left(\left(\left(\frac{5}{6} + a\right) - \frac{2}{3} \cdot \frac{1}{t}\right) \cdot c\right)}}} \]

      2. lower-*.f64 N/A

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \color{blue}{\left(\left(\left(\frac{5}{6} + a\right) - \frac{2}{3} \cdot \frac{1}{t}\right) \cdot c\right)}}} \]

      3. lower--.f64 N/A

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \left(\color{blue}{\left(\left(\frac{5}{6} + a\right) - \frac{2}{3} \cdot \frac{1}{t}\right)} \cdot c\right)}} \]

      4. lower-+.f64 N/A

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \left(\left(\color{blue}{\left(\frac{5}{6} + a\right)} - \frac{2}{3} \cdot \frac{1}{t}\right) \cdot c\right)}} \]

      5. associate-*r/ N/A

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \left(\left(\left(\frac{5}{6} + a\right) - \color{blue}{\frac{\frac{2}{3} \cdot 1}{t}}\right) \cdot c\right)}} \]

      6. metadata-eval N/A

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \left(\left(\left(\frac{5}{6} + a\right) - \frac{\color{blue}{\frac{2}{3}}}{t}\right) \cdot c\right)}} \]

      7. lower-/.f64 61.4

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \left(\left(\left(0.8333333333333334 + a\right) - \color{blue}{\frac{0.6666666666666666}{t}}\right) \cdot c\right)}} \]

   5. Applied rewrites 61.4%

      \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \color{blue}{\left(\left(\left(0.8333333333333334 + a\right) - \frac{0.6666666666666666}{t}\right) \cdot c\right)}}} \]

   6. Taylor expanded in t around inf

      \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \left(c \cdot \color{blue}{\left(\frac{5}{6} + a\right)}\right)}} \]
   7. Step-by-step derivation

   8. Applied rewrites 49.8%

      \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \left(\left(0.8333333333333334 + a\right) \cdot \color{blue}{c}\right)}} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 5: 79.2% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := 2 \cdot \left(\frac{z \cdot \sqrt{t + a}}{t} - \left(b - c\right) \cdot \left(\left(a + \frac{5}{6}\right) - \frac{2}{t \cdot 3}\right)\right)\\ \mathbf{if}\;t\_1 \leq -2 \cdot 10^{+17}:\\ \;\;\;\;1\\ \mathbf{elif}\;t\_1 \leq 10^{+89}:\\ \;\;\;\;\frac{x}{x + y \cdot e^{2 \cdot \left(\left(-b\right) \cdot \left(0.8333333333333334 + a\right)\right)}}\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{x + y \cdot e^{2 \cdot \left(\left(\left(0.8333333333333334 + a\right) - \frac{0.6666666666666666}{t}\right) \cdot c\right)}}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c)
 :precision binary64
 (let* ((t_1
         (*
          2.0
          (-
           (/ (* z (sqrt (+ t a))) t)
           (* (- b c) (- (+ a (/ 5.0 6.0)) (/ 2.0 (* t 3.0))))))))
   (if (<= t_1 -2e+17)
     1.0
     (if (<= t_1 1e+89)
       (/ x (+ x (* y (exp (* 2.0 (* (- b) (+ 0.8333333333333334 a)))))))
       (/
        x
        (+
         x
         (*
          y
          (exp
           (*
            2.0
            (*
             (- (+ 0.8333333333333334 a) (/ 0.6666666666666666 t))
             c))))))))))

C

double code(double x, double y, double z, double t, double a, double b, double c) {
	double t_1 = 2.0 * (((z * sqrt((t + a))) / t) - ((b - c) * ((a + (5.0 / 6.0)) - (2.0 / (t * 3.0)))));
	double tmp;
	if (t_1 <= -2e+17) {
		tmp = 1.0;
	} else if (t_1 <= 1e+89) {
		tmp = x / (x + (y * exp((2.0 * (-b * (0.8333333333333334 + a))))));
	} else {
		tmp = x / (x + (y * exp((2.0 * (((0.8333333333333334 + a) - (0.6666666666666666 / t)) * c)))));
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b, c)
    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), intent (in) :: c
    real(8) :: t_1
    real(8) :: tmp
    t_1 = 2.0d0 * (((z * sqrt((t + a))) / t) - ((b - c) * ((a + (5.0d0 / 6.0d0)) - (2.0d0 / (t * 3.0d0)))))
    if (t_1 <= (-2d+17)) then
        tmp = 1.0d0
    else if (t_1 <= 1d+89) then
        tmp = x / (x + (y * exp((2.0d0 * (-b * (0.8333333333333334d0 + a))))))
    else
        tmp = x / (x + (y * exp((2.0d0 * (((0.8333333333333334d0 + a) - (0.6666666666666666d0 / t)) * c)))))
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b, double c) {
	double t_1 = 2.0 * (((z * Math.sqrt((t + a))) / t) - ((b - c) * ((a + (5.0 / 6.0)) - (2.0 / (t * 3.0)))));
	double tmp;
	if (t_1 <= -2e+17) {
		tmp = 1.0;
	} else if (t_1 <= 1e+89) {
		tmp = x / (x + (y * Math.exp((2.0 * (-b * (0.8333333333333334 + a))))));
	} else {
		tmp = x / (x + (y * Math.exp((2.0 * (((0.8333333333333334 + a) - (0.6666666666666666 / t)) * c)))));
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b, c):
	t_1 = 2.0 * (((z * math.sqrt((t + a))) / t) - ((b - c) * ((a + (5.0 / 6.0)) - (2.0 / (t * 3.0)))))
	tmp = 0
	if t_1 <= -2e+17:
		tmp = 1.0
	elif t_1 <= 1e+89:
		tmp = x / (x + (y * math.exp((2.0 * (-b * (0.8333333333333334 + a))))))
	else:
		tmp = x / (x + (y * math.exp((2.0 * (((0.8333333333333334 + a) - (0.6666666666666666 / t)) * c)))))
	return tmp

Julia

function code(x, y, z, t, a, b, c)
	t_1 = Float64(2.0 * Float64(Float64(Float64(z * sqrt(Float64(t + a))) / t) - Float64(Float64(b - c) * Float64(Float64(a + Float64(5.0 / 6.0)) - Float64(2.0 / Float64(t * 3.0))))))
	tmp = 0.0
	if (t_1 <= -2e+17)
		tmp = 1.0;
	elseif (t_1 <= 1e+89)
		tmp = Float64(x / Float64(x + Float64(y * exp(Float64(2.0 * Float64(Float64(-b) * Float64(0.8333333333333334 + a)))))));
	else
		tmp = Float64(x / Float64(x + Float64(y * exp(Float64(2.0 * Float64(Float64(Float64(0.8333333333333334 + a) - Float64(0.6666666666666666 / t)) * c))))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b, c)
	t_1 = 2.0 * (((z * sqrt((t + a))) / t) - ((b - c) * ((a + (5.0 / 6.0)) - (2.0 / (t * 3.0)))));
	tmp = 0.0;
	if (t_1 <= -2e+17)
		tmp = 1.0;
	elseif (t_1 <= 1e+89)
		tmp = x / (x + (y * exp((2.0 * (-b * (0.8333333333333334 + a))))));
	else
		tmp = x / (x + (y * exp((2.0 * (((0.8333333333333334 + a) - (0.6666666666666666 / t)) * c)))));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(2.0 * N[(N[(N[(z * N[Sqrt[N[(t + a), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / t), $MachinePrecision] - N[(N[(b - c), $MachinePrecision] * N[(N[(a + N[(5.0 / 6.0), $MachinePrecision]), $MachinePrecision] - N[(2.0 / N[(t * 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -2e+17], 1.0, If[LessEqual[t$95$1, 1e+89], N[(x / N[(x + N[(y * N[Exp[N[(2.0 * N[((-b) * N[(0.8333333333333334 + a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(x / N[(x + N[(y * N[Exp[N[(2.0 * N[(N[(N[(0.8333333333333334 + a), $MachinePrecision] - N[(0.6666666666666666 / t), $MachinePrecision]), $MachinePrecision] * c), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if (*.f64 #s(literal 2 binary64) (-.f64 (/.f64 (*.f64 z (sqrt.f64 (+.f64 t a))) t) (*.f64 (-.f64 b c) (-.f64 (+.f64 a (/.f64 #s(literal 5 binary64) #s(literal 6 binary64))) (/.f64 #s(literal 2 binary64) (*.f64 t #s(literal 3 binary64))))))) < -2e17

   1. Initial program 96.3%

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

   3. Taylor expanded in x around inf

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

   5. Applied rewrites 96.3%

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

   if -2e17 < (*.f64 #s(literal 2 binary64) (-.f64 (/.f64 (*.f64 z (sqrt.f64 (+.f64 t a))) t) (*.f64 (-.f64 b c) (-.f64 (+.f64 a (/.f64 #s(literal 5 binary64) #s(literal 6 binary64))) (/.f64 #s(literal 2 binary64) (*.f64 t #s(literal 3 binary64))))))) < 9.99999999999999995e88

   1. Initial program 99.9%

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

   3. Taylor expanded in b around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. associate--r+ N/A

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

      4. lower--.f64 N/A

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

      5. lower--.f64 N/A

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

      6. associate-*r/ N/A

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

      7. metadata-eval N/A

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

      8. lower-/.f64 89.0

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

   5. Applied rewrites 89.0%

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

   6. Taylor expanded in t around inf

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

   8. Applied rewrites 85.8%

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

   if 9.99999999999999995e88 < (*.f64 #s(literal 2 binary64) (-.f64 (/.f64 (*.f64 z (sqrt.f64 (+.f64 t a))) t) (*.f64 (-.f64 b c) (-.f64 (+.f64 a (/.f64 #s(literal 5 binary64) #s(literal 6 binary64))) (/.f64 #s(literal 2 binary64) (*.f64 t #s(literal 3 binary64)))))))

   1. Initial program 89.2%

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

   3. Taylor expanded in c around inf

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

      1. *-commutative N/A

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \color{blue}{\left(\left(\left(\frac{5}{6} + a\right) - \frac{2}{3} \cdot \frac{1}{t}\right) \cdot c\right)}}} \]

      2. lower-*.f64 N/A

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \color{blue}{\left(\left(\left(\frac{5}{6} + a\right) - \frac{2}{3} \cdot \frac{1}{t}\right) \cdot c\right)}}} \]

      3. lower--.f64 N/A

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \left(\color{blue}{\left(\left(\frac{5}{6} + a\right) - \frac{2}{3} \cdot \frac{1}{t}\right)} \cdot c\right)}} \]

      4. lower-+.f64 N/A

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \left(\left(\color{blue}{\left(\frac{5}{6} + a\right)} - \frac{2}{3} \cdot \frac{1}{t}\right) \cdot c\right)}} \]

      5. associate-*r/ N/A

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \left(\left(\left(\frac{5}{6} + a\right) - \color{blue}{\frac{\frac{2}{3} \cdot 1}{t}}\right) \cdot c\right)}} \]

      6. metadata-eval N/A

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \left(\left(\left(\frac{5}{6} + a\right) - \frac{\color{blue}{\frac{2}{3}}}{t}\right) \cdot c\right)}} \]

      7. lower-/.f64 60.6

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \left(\left(\left(0.8333333333333334 + a\right) - \color{blue}{\frac{0.6666666666666666}{t}}\right) \cdot c\right)}} \]

   5. Applied rewrites 60.6%

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

Alternative 6: 70.8% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;e^{2 \cdot \left(\frac{z \cdot \sqrt{t + a}}{t} - \left(b - c\right) \cdot \left(\left(a + \frac{5}{6}\right) - \frac{2}{t \cdot 3}\right)\right)} \leq 0:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{x + y \cdot e^{2 \cdot \left(c \cdot a\right)}}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c)
 :precision binary64
 (if (<=
      (exp
       (*
        2.0
        (-
         (/ (* z (sqrt (+ t a))) t)
         (* (- b c) (- (+ a (/ 5.0 6.0)) (/ 2.0 (* t 3.0)))))))
      0.0)
   1.0
   (/ x (+ x (* y (exp (* 2.0 (* c a))))))))

C

double code(double x, double y, double z, double t, double a, double b, double c) {
	double tmp;
	if (exp((2.0 * (((z * sqrt((t + a))) / t) - ((b - c) * ((a + (5.0 / 6.0)) - (2.0 / (t * 3.0))))))) <= 0.0) {
		tmp = 1.0;
	} else {
		tmp = x / (x + (y * exp((2.0 * (c * a)))));
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b, c)
    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), intent (in) :: c
    real(8) :: tmp
    if (exp((2.0d0 * (((z * sqrt((t + a))) / t) - ((b - c) * ((a + (5.0d0 / 6.0d0)) - (2.0d0 / (t * 3.0d0))))))) <= 0.0d0) then
        tmp = 1.0d0
    else
        tmp = x / (x + (y * exp((2.0d0 * (c * a)))))
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b, double c) {
	double tmp;
	if (Math.exp((2.0 * (((z * Math.sqrt((t + a))) / t) - ((b - c) * ((a + (5.0 / 6.0)) - (2.0 / (t * 3.0))))))) <= 0.0) {
		tmp = 1.0;
	} else {
		tmp = x / (x + (y * Math.exp((2.0 * (c * a)))));
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b, c):
	tmp = 0
	if math.exp((2.0 * (((z * math.sqrt((t + a))) / t) - ((b - c) * ((a + (5.0 / 6.0)) - (2.0 / (t * 3.0))))))) <= 0.0:
		tmp = 1.0
	else:
		tmp = x / (x + (y * math.exp((2.0 * (c * a)))))
	return tmp

Julia

function code(x, y, z, t, a, b, c)
	tmp = 0.0
	if (exp(Float64(2.0 * Float64(Float64(Float64(z * sqrt(Float64(t + a))) / t) - Float64(Float64(b - c) * Float64(Float64(a + Float64(5.0 / 6.0)) - Float64(2.0 / Float64(t * 3.0))))))) <= 0.0)
		tmp = 1.0;
	else
		tmp = Float64(x / Float64(x + Float64(y * exp(Float64(2.0 * Float64(c * a))))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b, c)
	tmp = 0.0;
	if (exp((2.0 * (((z * sqrt((t + a))) / t) - ((b - c) * ((a + (5.0 / 6.0)) - (2.0 / (t * 3.0))))))) <= 0.0)
		tmp = 1.0;
	else
		tmp = x / (x + (y * exp((2.0 * (c * a)))));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_] := If[LessEqual[N[Exp[N[(2.0 * N[(N[(N[(z * N[Sqrt[N[(t + a), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / t), $MachinePrecision] - N[(N[(b - c), $MachinePrecision] * N[(N[(a + N[(5.0 / 6.0), $MachinePrecision]), $MachinePrecision] - N[(2.0 / N[(t * 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], 0.0], 1.0, N[(x / N[(x + N[(y * N[Exp[N[(2.0 * N[(c * a), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (exp.f64 (*.f64 #s(literal 2 binary64) (-.f64 (/.f64 (*.f64 z (sqrt.f64 (+.f64 t a))) t) (*.f64 (-.f64 b c) (-.f64 (+.f64 a (/.f64 #s(literal 5 binary64) #s(literal 6 binary64))) (/.f64 #s(literal 2 binary64) (*.f64 t #s(literal 3 binary64)))))))) < 0.0

   1. Initial program 96.4%

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

   3. Taylor expanded in x around inf

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

   5. Applied rewrites 96.4%

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

   if 0.0 < (exp.f64 (*.f64 #s(literal 2 binary64) (-.f64 (/.f64 (*.f64 z (sqrt.f64 (+.f64 t a))) t) (*.f64 (-.f64 b c) (-.f64 (+.f64 a (/.f64 #s(literal 5 binary64) #s(literal 6 binary64))) (/.f64 #s(literal 2 binary64) (*.f64 t #s(literal 3 binary64))))))))

   1. Initial program 91.2%

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

   3. Taylor expanded in c around inf

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

      1. *-commutative N/A

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \color{blue}{\left(\left(\left(\frac{5}{6} + a\right) - \frac{2}{3} \cdot \frac{1}{t}\right) \cdot c\right)}}} \]

      2. lower-*.f64 N/A

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \color{blue}{\left(\left(\left(\frac{5}{6} + a\right) - \frac{2}{3} \cdot \frac{1}{t}\right) \cdot c\right)}}} \]

      3. lower--.f64 N/A

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \left(\color{blue}{\left(\left(\frac{5}{6} + a\right) - \frac{2}{3} \cdot \frac{1}{t}\right)} \cdot c\right)}} \]

      4. lower-+.f64 N/A

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \left(\left(\color{blue}{\left(\frac{5}{6} + a\right)} - \frac{2}{3} \cdot \frac{1}{t}\right) \cdot c\right)}} \]

      5. associate-*r/ N/A

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \left(\left(\left(\frac{5}{6} + a\right) - \color{blue}{\frac{\frac{2}{3} \cdot 1}{t}}\right) \cdot c\right)}} \]

      6. metadata-eval N/A

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \left(\left(\left(\frac{5}{6} + a\right) - \frac{\color{blue}{\frac{2}{3}}}{t}\right) \cdot c\right)}} \]

      7. lower-/.f64 61.4

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \left(\left(\left(0.8333333333333334 + a\right) - \color{blue}{\frac{0.6666666666666666}{t}}\right) \cdot c\right)}} \]

   5. Applied rewrites 61.4%

      \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \color{blue}{\left(\left(\left(0.8333333333333334 + a\right) - \frac{0.6666666666666666}{t}\right) \cdot c\right)}}} \]

   6. Taylor expanded in a around inf

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

   8. Applied rewrites 43.1%

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

Alternative 7: 71.5% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := 2 \cdot \left(\frac{z \cdot \sqrt{t + a}}{t} - \left(b - c\right) \cdot \left(\left(a + \frac{5}{6}\right) - \frac{2}{t \cdot 3}\right)\right)\\ \mathbf{if}\;t\_1 \leq -20000:\\ \;\;\;\;1\\ \mathbf{elif}\;t\_1 \leq 5 \cdot 10^{+242}:\\ \;\;\;\;\frac{x}{x + y \cdot e^{2 \cdot \left(0.8333333333333334 \cdot c\right)}}\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{x + y \cdot e^{2 \cdot \left(c \cdot a\right)}}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c)
 :precision binary64
 (let* ((t_1
         (*
          2.0
          (-
           (/ (* z (sqrt (+ t a))) t)
           (* (- b c) (- (+ a (/ 5.0 6.0)) (/ 2.0 (* t 3.0))))))))
   (if (<= t_1 -20000.0)
     1.0
     (if (<= t_1 5e+242)
       (/ x (+ x (* y (exp (* 2.0 (* 0.8333333333333334 c))))))
       (/ x (+ x (* y (exp (* 2.0 (* c a))))))))))

C

double code(double x, double y, double z, double t, double a, double b, double c) {
	double t_1 = 2.0 * (((z * sqrt((t + a))) / t) - ((b - c) * ((a + (5.0 / 6.0)) - (2.0 / (t * 3.0)))));
	double tmp;
	if (t_1 <= -20000.0) {
		tmp = 1.0;
	} else if (t_1 <= 5e+242) {
		tmp = x / (x + (y * exp((2.0 * (0.8333333333333334 * c)))));
	} else {
		tmp = x / (x + (y * exp((2.0 * (c * a)))));
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b, c)
    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), intent (in) :: c
    real(8) :: t_1
    real(8) :: tmp
    t_1 = 2.0d0 * (((z * sqrt((t + a))) / t) - ((b - c) * ((a + (5.0d0 / 6.0d0)) - (2.0d0 / (t * 3.0d0)))))
    if (t_1 <= (-20000.0d0)) then
        tmp = 1.0d0
    else if (t_1 <= 5d+242) then
        tmp = x / (x + (y * exp((2.0d0 * (0.8333333333333334d0 * c)))))
    else
        tmp = x / (x + (y * exp((2.0d0 * (c * a)))))
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b, double c) {
	double t_1 = 2.0 * (((z * Math.sqrt((t + a))) / t) - ((b - c) * ((a + (5.0 / 6.0)) - (2.0 / (t * 3.0)))));
	double tmp;
	if (t_1 <= -20000.0) {
		tmp = 1.0;
	} else if (t_1 <= 5e+242) {
		tmp = x / (x + (y * Math.exp((2.0 * (0.8333333333333334 * c)))));
	} else {
		tmp = x / (x + (y * Math.exp((2.0 * (c * a)))));
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b, c):
	t_1 = 2.0 * (((z * math.sqrt((t + a))) / t) - ((b - c) * ((a + (5.0 / 6.0)) - (2.0 / (t * 3.0)))))
	tmp = 0
	if t_1 <= -20000.0:
		tmp = 1.0
	elif t_1 <= 5e+242:
		tmp = x / (x + (y * math.exp((2.0 * (0.8333333333333334 * c)))))
	else:
		tmp = x / (x + (y * math.exp((2.0 * (c * a)))))
	return tmp

Julia

function code(x, y, z, t, a, b, c)
	t_1 = Float64(2.0 * Float64(Float64(Float64(z * sqrt(Float64(t + a))) / t) - Float64(Float64(b - c) * Float64(Float64(a + Float64(5.0 / 6.0)) - Float64(2.0 / Float64(t * 3.0))))))
	tmp = 0.0
	if (t_1 <= -20000.0)
		tmp = 1.0;
	elseif (t_1 <= 5e+242)
		tmp = Float64(x / Float64(x + Float64(y * exp(Float64(2.0 * Float64(0.8333333333333334 * c))))));
	else
		tmp = Float64(x / Float64(x + Float64(y * exp(Float64(2.0 * Float64(c * a))))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b, c)
	t_1 = 2.0 * (((z * sqrt((t + a))) / t) - ((b - c) * ((a + (5.0 / 6.0)) - (2.0 / (t * 3.0)))));
	tmp = 0.0;
	if (t_1 <= -20000.0)
		tmp = 1.0;
	elseif (t_1 <= 5e+242)
		tmp = x / (x + (y * exp((2.0 * (0.8333333333333334 * c)))));
	else
		tmp = x / (x + (y * exp((2.0 * (c * a)))));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(2.0 * N[(N[(N[(z * N[Sqrt[N[(t + a), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / t), $MachinePrecision] - N[(N[(b - c), $MachinePrecision] * N[(N[(a + N[(5.0 / 6.0), $MachinePrecision]), $MachinePrecision] - N[(2.0 / N[(t * 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -20000.0], 1.0, If[LessEqual[t$95$1, 5e+242], N[(x / N[(x + N[(y * N[Exp[N[(2.0 * N[(0.8333333333333334 * c), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(x / N[(x + N[(y * N[Exp[N[(2.0 * N[(c * a), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if (*.f64 #s(literal 2 binary64) (-.f64 (/.f64 (*.f64 z (sqrt.f64 (+.f64 t a))) t) (*.f64 (-.f64 b c) (-.f64 (+.f64 a (/.f64 #s(literal 5 binary64) #s(literal 6 binary64))) (/.f64 #s(literal 2 binary64) (*.f64 t #s(literal 3 binary64))))))) < -2e4

   1. Initial program 96.4%

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

   3. Taylor expanded in x around inf

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

   5. Applied rewrites 96.4%

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

   if -2e4 < (*.f64 #s(literal 2 binary64) (-.f64 (/.f64 (*.f64 z (sqrt.f64 (+.f64 t a))) t) (*.f64 (-.f64 b c) (-.f64 (+.f64 a (/.f64 #s(literal 5 binary64) #s(literal 6 binary64))) (/.f64 #s(literal 2 binary64) (*.f64 t #s(literal 3 binary64))))))) < 5.0000000000000004e242

   1. Initial program 100.0%

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

   3. Taylor expanded in c around inf

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

      1. *-commutative N/A

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \color{blue}{\left(\left(\left(\frac{5}{6} + a\right) - \frac{2}{3} \cdot \frac{1}{t}\right) \cdot c\right)}}} \]

      2. lower-*.f64 N/A

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \color{blue}{\left(\left(\left(\frac{5}{6} + a\right) - \frac{2}{3} \cdot \frac{1}{t}\right) \cdot c\right)}}} \]

      3. lower--.f64 N/A

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \left(\color{blue}{\left(\left(\frac{5}{6} + a\right) - \frac{2}{3} \cdot \frac{1}{t}\right)} \cdot c\right)}} \]

      4. lower-+.f64 N/A

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \left(\left(\color{blue}{\left(\frac{5}{6} + a\right)} - \frac{2}{3} \cdot \frac{1}{t}\right) \cdot c\right)}} \]

      5. associate-*r/ N/A

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \left(\left(\left(\frac{5}{6} + a\right) - \color{blue}{\frac{\frac{2}{3} \cdot 1}{t}}\right) \cdot c\right)}} \]

      6. metadata-eval N/A

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \left(\left(\left(\frac{5}{6} + a\right) - \frac{\color{blue}{\frac{2}{3}}}{t}\right) \cdot c\right)}} \]

      7. lower-/.f64 63.9

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \left(\left(\left(0.8333333333333334 + a\right) - \color{blue}{\frac{0.6666666666666666}{t}}\right) \cdot c\right)}} \]

   5. Applied rewrites 63.9%

      \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \color{blue}{\left(\left(\left(0.8333333333333334 + a\right) - \frac{0.6666666666666666}{t}\right) \cdot c\right)}}} \]

   6. Taylor expanded in t around inf

      \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \left(c \cdot \color{blue}{\left(\frac{5}{6} + a\right)}\right)}} \]
   7. Step-by-step derivation

   8. Applied rewrites 64.0%

      \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \left(\left(0.8333333333333334 + a\right) \cdot \color{blue}{c}\right)}} \]

   9. Taylor expanded in a around 0

      \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \left(\frac{5}{6} \cdot c\right)}} \]
   10. Step-by-step derivation

   11. Applied rewrites 57.0%

       \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \left(0.8333333333333334 \cdot c\right)}} \]

   if 5.0000000000000004e242 < (*.f64 #s(literal 2 binary64) (-.f64 (/.f64 (*.f64 z (sqrt.f64 (+.f64 t a))) t) (*.f64 (-.f64 b c) (-.f64 (+.f64 a (/.f64 #s(literal 5 binary64) #s(literal 6 binary64))) (/.f64 #s(literal 2 binary64) (*.f64 t #s(literal 3 binary64)))))))

   1. Initial program 86.2%

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

   3. Taylor expanded in c around inf

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

      1. *-commutative N/A

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \color{blue}{\left(\left(\left(\frac{5}{6} + a\right) - \frac{2}{3} \cdot \frac{1}{t}\right) \cdot c\right)}}} \]

      2. lower-*.f64 N/A

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \color{blue}{\left(\left(\left(\frac{5}{6} + a\right) - \frac{2}{3} \cdot \frac{1}{t}\right) \cdot c\right)}}} \]

      3. lower--.f64 N/A

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \left(\color{blue}{\left(\left(\frac{5}{6} + a\right) - \frac{2}{3} \cdot \frac{1}{t}\right)} \cdot c\right)}} \]

      4. lower-+.f64 N/A

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \left(\left(\color{blue}{\left(\frac{5}{6} + a\right)} - \frac{2}{3} \cdot \frac{1}{t}\right) \cdot c\right)}} \]

      5. associate-*r/ N/A

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \left(\left(\left(\frac{5}{6} + a\right) - \color{blue}{\frac{\frac{2}{3} \cdot 1}{t}}\right) \cdot c\right)}} \]

      6. metadata-eval N/A

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \left(\left(\left(\frac{5}{6} + a\right) - \frac{\color{blue}{\frac{2}{3}}}{t}\right) \cdot c\right)}} \]

      7. lower-/.f64 59.9

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \left(\left(\left(0.8333333333333334 + a\right) - \color{blue}{\frac{0.6666666666666666}{t}}\right) \cdot c\right)}} \]

   5. Applied rewrites 59.9%

      \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \color{blue}{\left(\left(\left(0.8333333333333334 + a\right) - \frac{0.6666666666666666}{t}\right) \cdot c\right)}}} \]

   6. Taylor expanded in a around inf

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

   8. Applied rewrites 42.7%

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

Alternative 8: 92.7% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \sqrt{{t}^{-1}}\\ t_2 := -\left(b - c\right)\\ \mathbf{if}\;t \leq 2 \cdot 10^{-256}:\\ \;\;\;\;\frac{x}{x + y \cdot e^{2 \cdot \frac{\mathsf{fma}\left(\sqrt{a}, z, 0.6666666666666666 \cdot \left(b - c\right)\right)}{t}}}\\ \mathbf{elif}\;t \leq 2.75 \cdot 10^{-8}:\\ \;\;\;\;\frac{x}{x + y \cdot e^{2 \cdot \mathsf{fma}\left(t\_1, z, t\_2 \cdot \left(0.8333333333333334 - \frac{0.6666666666666666}{t}\right)\right)}}\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{x + y \cdot e^{2 \cdot \mathsf{fma}\left(t\_1, z, t\_2 \cdot \left(0.8333333333333334 + a\right)\right)}}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c)
 :precision binary64
 (let* ((t_1 (sqrt (pow t -1.0))) (t_2 (- (- b c))))
   (if (<= t 2e-256)
     (/
      x
      (+
       x
       (*
        y
        (exp (* 2.0 (/ (fma (sqrt a) z (* 0.6666666666666666 (- b c))) t))))))
     (if (<= t 2.75e-8)
       (/
        x
        (+
         x
         (*
          y
          (exp
           (*
            2.0
            (fma
             t_1
             z
             (* t_2 (- 0.8333333333333334 (/ 0.6666666666666666 t)))))))))
       (/
        x
        (+
         x
         (* y (exp (* 2.0 (fma t_1 z (* t_2 (+ 0.8333333333333334 a))))))))))))

C

double code(double x, double y, double z, double t, double a, double b, double c) {
	double t_1 = sqrt(pow(t, -1.0));
	double t_2 = -(b - c);
	double tmp;
	if (t <= 2e-256) {
		tmp = x / (x + (y * exp((2.0 * (fma(sqrt(a), z, (0.6666666666666666 * (b - c))) / t)))));
	} else if (t <= 2.75e-8) {
		tmp = x / (x + (y * exp((2.0 * fma(t_1, z, (t_2 * (0.8333333333333334 - (0.6666666666666666 / t))))))));
	} else {
		tmp = x / (x + (y * exp((2.0 * fma(t_1, z, (t_2 * (0.8333333333333334 + a)))))));
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b, c)
	t_1 = sqrt((t ^ -1.0))
	t_2 = Float64(-Float64(b - c))
	tmp = 0.0
	if (t <= 2e-256)
		tmp = Float64(x / Float64(x + Float64(y * exp(Float64(2.0 * Float64(fma(sqrt(a), z, Float64(0.6666666666666666 * Float64(b - c))) / t))))));
	elseif (t <= 2.75e-8)
		tmp = Float64(x / Float64(x + Float64(y * exp(Float64(2.0 * fma(t_1, z, Float64(t_2 * Float64(0.8333333333333334 - Float64(0.6666666666666666 / t)))))))));
	else
		tmp = Float64(x / Float64(x + Float64(y * exp(Float64(2.0 * fma(t_1, z, Float64(t_2 * Float64(0.8333333333333334 + a))))))));
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[Sqrt[N[Power[t, -1.0], $MachinePrecision]], $MachinePrecision]}, Block[{t$95$2 = (-N[(b - c), $MachinePrecision])}, If[LessEqual[t, 2e-256], N[(x / N[(x + N[(y * N[Exp[N[(2.0 * N[(N[(N[Sqrt[a], $MachinePrecision] * z + N[(0.6666666666666666 * N[(b - c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t, 2.75e-8], N[(x / N[(x + N[(y * N[Exp[N[(2.0 * N[(t$95$1 * z + N[(t$95$2 * N[(0.8333333333333334 - N[(0.6666666666666666 / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(x / N[(x + N[(y * N[Exp[N[(2.0 * N[(t$95$1 * z + N[(t$95$2 * N[(0.8333333333333334 + a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]

Derivation

1. Split input into 3 regimes

2. if t < 1.99999999999999995e-256

   1. Initial program 86.5%

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

   3. Taylor expanded in t around 0

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

      1. lower-/.f64 N/A

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

      2. fp-cancel-sub-sign-inv N/A

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \frac{\color{blue}{\sqrt{a} \cdot z + \left(\mathsf{neg}\left(\frac{-2}{3}\right)\right) \cdot \left(b - c\right)}}{t}}} \]

      3. metadata-eval N/A

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

      4. lower-fma.f64 N/A

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \frac{\color{blue}{\mathsf{fma}\left(\sqrt{a}, z, \frac{2}{3} \cdot \left(b - c\right)\right)}}{t}}} \]

      5. lower-sqrt.f64 N/A

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \frac{\mathsf{fma}\left(\color{blue}{\sqrt{a}}, z, \frac{2}{3} \cdot \left(b - c\right)\right)}{t}}} \]

      6. lower-*.f64 N/A

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \frac{\mathsf{fma}\left(\sqrt{a}, z, \color{blue}{\frac{2}{3} \cdot \left(b - c\right)}\right)}{t}}} \]

      7. lower--.f64 93.4

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \frac{\mathsf{fma}\left(\sqrt{a}, z, 0.6666666666666666 \cdot \color{blue}{\left(b - c\right)}\right)}{t}}} \]

   5. Applied rewrites 93.4%

      \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \color{blue}{\frac{\mathsf{fma}\left(\sqrt{a}, z, 0.6666666666666666 \cdot \left(b - c\right)\right)}{t}}}} \]

   if 1.99999999999999995e-256 < t < 2.7500000000000001e-8

   1. Initial program 97.0%

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

   3. Taylor expanded in a around 0

      \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \color{blue}{\left(\sqrt{\frac{1}{t}} \cdot z - \left(\frac{5}{6} - \frac{2}{3} \cdot \frac{1}{t}\right) \cdot \left(b - c\right)\right)}}} \]
   4. Step-by-step derivation

      1. *-commutative N/A

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

      2. fp-cancel-sub-sign-inv N/A

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \color{blue}{\left(\sqrt{\frac{1}{t}} \cdot z + \left(\mathsf{neg}\left(\left(b - c\right)\right)\right) \cdot \left(\frac{5}{6} - \frac{2}{3} \cdot \frac{1}{t}\right)\right)}}} \]

      3. lower-fma.f64 N/A

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \color{blue}{\mathsf{fma}\left(\sqrt{\frac{1}{t}}, z, \left(\mathsf{neg}\left(\left(b - c\right)\right)\right) \cdot \left(\frac{5}{6} - \frac{2}{3} \cdot \frac{1}{t}\right)\right)}}} \]

      4. lower-sqrt.f64 N/A

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \mathsf{fma}\left(\color{blue}{\sqrt{\frac{1}{t}}}, z, \left(\mathsf{neg}\left(\left(b - c\right)\right)\right) \cdot \left(\frac{5}{6} - \frac{2}{3} \cdot \frac{1}{t}\right)\right)}} \]

      5. lower-/.f64 N/A

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \mathsf{fma}\left(\sqrt{\color{blue}{\frac{1}{t}}}, z, \left(\mathsf{neg}\left(\left(b - c\right)\right)\right) \cdot \left(\frac{5}{6} - \frac{2}{3} \cdot \frac{1}{t}\right)\right)}} \]

      6. mul-1-neg N/A

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \mathsf{fma}\left(\sqrt{\frac{1}{t}}, z, \color{blue}{\left(-1 \cdot \left(b - c\right)\right)} \cdot \left(\frac{5}{6} - \frac{2}{3} \cdot \frac{1}{t}\right)\right)}} \]

      7. lower-*.f64 N/A

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \mathsf{fma}\left(\sqrt{\frac{1}{t}}, z, \color{blue}{\left(-1 \cdot \left(b - c\right)\right) \cdot \left(\frac{5}{6} - \frac{2}{3} \cdot \frac{1}{t}\right)}\right)}} \]

      8. mul-1-neg N/A

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \mathsf{fma}\left(\sqrt{\frac{1}{t}}, z, \color{blue}{\left(\mathsf{neg}\left(\left(b - c\right)\right)\right)} \cdot \left(\frac{5}{6} - \frac{2}{3} \cdot \frac{1}{t}\right)\right)}} \]

      9. lower-neg.f64 N/A

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \mathsf{fma}\left(\sqrt{\frac{1}{t}}, z, \color{blue}{\left(-\left(b - c\right)\right)} \cdot \left(\frac{5}{6} - \frac{2}{3} \cdot \frac{1}{t}\right)\right)}} \]

      10. lower--.f64 N/A

          \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \mathsf{fma}\left(\sqrt{\frac{1}{t}}, z, \left(-\color{blue}{\left(b - c\right)}\right) \cdot \left(\frac{5}{6} - \frac{2}{3} \cdot \frac{1}{t}\right)\right)}} \]

      11. lower--.f64 N/A

          \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \mathsf{fma}\left(\sqrt{\frac{1}{t}}, z, \left(-\left(b - c\right)\right) \cdot \color{blue}{\left(\frac{5}{6} - \frac{2}{3} \cdot \frac{1}{t}\right)}\right)}} \]

      12. associate-*r/ N/A

          \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \mathsf{fma}\left(\sqrt{\frac{1}{t}}, z, \left(-\left(b - c\right)\right) \cdot \left(\frac{5}{6} - \color{blue}{\frac{\frac{2}{3} \cdot 1}{t}}\right)\right)}} \]

      13. metadata-eval N/A

          \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \mathsf{fma}\left(\sqrt{\frac{1}{t}}, z, \left(-\left(b - c\right)\right) \cdot \left(\frac{5}{6} - \frac{\color{blue}{\frac{2}{3}}}{t}\right)\right)}} \]

      14. lower-/.f64 85.5

          \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \mathsf{fma}\left(\sqrt{\frac{1}{t}}, z, \left(-\left(b - c\right)\right) \cdot \left(0.8333333333333334 - \color{blue}{\frac{0.6666666666666666}{t}}\right)\right)}} \]

   5. Applied rewrites 85.5%

      \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \color{blue}{\mathsf{fma}\left(\sqrt{\frac{1}{t}}, z, \left(-\left(b - c\right)\right) \cdot \left(0.8333333333333334 - \frac{0.6666666666666666}{t}\right)\right)}}} \]

   if 2.7500000000000001e-8 < t

   1. Initial program 95.7%

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

   3. Taylor expanded in t around inf

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

      1. *-commutative N/A

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

      2. fp-cancel-sub-sign-inv N/A

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \color{blue}{\left(\sqrt{\frac{1}{t}} \cdot z + \left(\mathsf{neg}\left(\left(b - c\right)\right)\right) \cdot \left(\frac{5}{6} + a\right)\right)}}} \]

      3. lower-fma.f64 N/A

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \color{blue}{\mathsf{fma}\left(\sqrt{\frac{1}{t}}, z, \left(\mathsf{neg}\left(\left(b - c\right)\right)\right) \cdot \left(\frac{5}{6} + a\right)\right)}}} \]

      4. lower-sqrt.f64 N/A

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \mathsf{fma}\left(\color{blue}{\sqrt{\frac{1}{t}}}, z, \left(\mathsf{neg}\left(\left(b - c\right)\right)\right) \cdot \left(\frac{5}{6} + a\right)\right)}} \]

      5. lower-/.f64 N/A

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \mathsf{fma}\left(\sqrt{\color{blue}{\frac{1}{t}}}, z, \left(\mathsf{neg}\left(\left(b - c\right)\right)\right) \cdot \left(\frac{5}{6} + a\right)\right)}} \]

      6. mul-1-neg N/A

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \mathsf{fma}\left(\sqrt{\frac{1}{t}}, z, \color{blue}{\left(-1 \cdot \left(b - c\right)\right)} \cdot \left(\frac{5}{6} + a\right)\right)}} \]

      7. lower-*.f64 N/A

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \mathsf{fma}\left(\sqrt{\frac{1}{t}}, z, \color{blue}{\left(-1 \cdot \left(b - c\right)\right) \cdot \left(\frac{5}{6} + a\right)}\right)}} \]

      8. mul-1-neg N/A

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \mathsf{fma}\left(\sqrt{\frac{1}{t}}, z, \color{blue}{\left(\mathsf{neg}\left(\left(b - c\right)\right)\right)} \cdot \left(\frac{5}{6} + a\right)\right)}} \]

      9. lower-neg.f64 N/A

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \mathsf{fma}\left(\sqrt{\frac{1}{t}}, z, \color{blue}{\left(-\left(b - c\right)\right)} \cdot \left(\frac{5}{6} + a\right)\right)}} \]

      10. lower--.f64 N/A

          \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \mathsf{fma}\left(\sqrt{\frac{1}{t}}, z, \left(-\color{blue}{\left(b - c\right)}\right) \cdot \left(\frac{5}{6} + a\right)\right)}} \]

      11. lower-+.f64 99.8

          \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \mathsf{fma}\left(\sqrt{\frac{1}{t}}, z, \left(-\left(b - c\right)\right) \cdot \color{blue}{\left(0.8333333333333334 + a\right)}\right)}} \]

   5. Applied rewrites 99.8%

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

4. Final simplification 94.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;t \leq 2 \cdot 10^{-256}:\\ \;\;\;\;\frac{x}{x + y \cdot e^{2 \cdot \frac{\mathsf{fma}\left(\sqrt{a}, z, 0.6666666666666666 \cdot \left(b - c\right)\right)}{t}}}\\ \mathbf{elif}\;t \leq 2.75 \cdot 10^{-8}:\\ \;\;\;\;\frac{x}{x + y \cdot e^{2 \cdot \mathsf{fma}\left(\sqrt{{t}^{-1}}, z, \left(-\left(b - c\right)\right) \cdot \left(0.8333333333333334 - \frac{0.6666666666666666}{t}\right)\right)}}\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{x + y \cdot e^{2 \cdot \mathsf{fma}\left(\sqrt{{t}^{-1}}, z, \left(-\left(b - c\right)\right) \cdot \left(0.8333333333333334 + a\right)\right)}}\\ \end{array} \]
5. Add Preprocessing

Alternative 9: 88.6% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;t \leq 3.15 \cdot 10^{-43}:\\ \;\;\;\;\frac{x}{x + y \cdot e^{2 \cdot \frac{\mathsf{fma}\left(\sqrt{a}, z, 0.6666666666666666 \cdot \left(b - c\right)\right)}{t}}}\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{x + y \cdot e^{2 \cdot \mathsf{fma}\left(\sqrt{{t}^{-1}}, z, \left(-\left(b - c\right)\right) \cdot \left(0.8333333333333334 + a\right)\right)}}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c)
 :precision binary64
 (if (<= t 3.15e-43)
   (/
    x
    (+
     x
     (*
      y
      (exp (* 2.0 (/ (fma (sqrt a) z (* 0.6666666666666666 (- b c))) t))))))
   (/
    x
    (+
     x
     (*
      y
      (exp
       (*
        2.0
        (fma
         (sqrt (pow t -1.0))
         z
         (* (- (- b c)) (+ 0.8333333333333334 a))))))))))

C

double code(double x, double y, double z, double t, double a, double b, double c) {
	double tmp;
	if (t <= 3.15e-43) {
		tmp = x / (x + (y * exp((2.0 * (fma(sqrt(a), z, (0.6666666666666666 * (b - c))) / t)))));
	} else {
		tmp = x / (x + (y * exp((2.0 * fma(sqrt(pow(t, -1.0)), z, (-(b - c) * (0.8333333333333334 + a)))))));
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b, c)
	tmp = 0.0
	if (t <= 3.15e-43)
		tmp = Float64(x / Float64(x + Float64(y * exp(Float64(2.0 * Float64(fma(sqrt(a), z, Float64(0.6666666666666666 * Float64(b - c))) / t))))));
	else
		tmp = Float64(x / Float64(x + Float64(y * exp(Float64(2.0 * fma(sqrt((t ^ -1.0)), z, Float64(Float64(-Float64(b - c)) * Float64(0.8333333333333334 + a))))))));
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_] := If[LessEqual[t, 3.15e-43], N[(x / N[(x + N[(y * N[Exp[N[(2.0 * N[(N[(N[Sqrt[a], $MachinePrecision] * z + N[(0.6666666666666666 * N[(b - c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(x / N[(x + N[(y * N[Exp[N[(2.0 * N[(N[Sqrt[N[Power[t, -1.0], $MachinePrecision]], $MachinePrecision] * z + N[((-N[(b - c), $MachinePrecision]) * N[(0.8333333333333334 + a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if t < 3.1500000000000001e-43

   1. Initial program 91.1%

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

   3. Taylor expanded in t around 0

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

      1. lower-/.f64 N/A

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

      2. fp-cancel-sub-sign-inv N/A

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \frac{\color{blue}{\sqrt{a} \cdot z + \left(\mathsf{neg}\left(\frac{-2}{3}\right)\right) \cdot \left(b - c\right)}}{t}}} \]

      3. metadata-eval N/A

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

      4. lower-fma.f64 N/A

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \frac{\color{blue}{\mathsf{fma}\left(\sqrt{a}, z, \frac{2}{3} \cdot \left(b - c\right)\right)}}{t}}} \]

      5. lower-sqrt.f64 N/A

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \frac{\mathsf{fma}\left(\color{blue}{\sqrt{a}}, z, \frac{2}{3} \cdot \left(b - c\right)\right)}{t}}} \]

      6. lower-*.f64 N/A

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \frac{\mathsf{fma}\left(\sqrt{a}, z, \color{blue}{\frac{2}{3} \cdot \left(b - c\right)}\right)}{t}}} \]

      7. lower--.f64 88.4

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \frac{\mathsf{fma}\left(\sqrt{a}, z, 0.6666666666666666 \cdot \color{blue}{\left(b - c\right)}\right)}{t}}} \]

   5. Applied rewrites 88.4%

      \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \color{blue}{\frac{\mathsf{fma}\left(\sqrt{a}, z, 0.6666666666666666 \cdot \left(b - c\right)\right)}{t}}}} \]

   if 3.1500000000000001e-43 < t

   1. Initial program 96.0%

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

   3. Taylor expanded in t around inf

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

      1. *-commutative N/A

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

      2. fp-cancel-sub-sign-inv N/A

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \color{blue}{\left(\sqrt{\frac{1}{t}} \cdot z + \left(\mathsf{neg}\left(\left(b - c\right)\right)\right) \cdot \left(\frac{5}{6} + a\right)\right)}}} \]

      3. lower-fma.f64 N/A

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \color{blue}{\mathsf{fma}\left(\sqrt{\frac{1}{t}}, z, \left(\mathsf{neg}\left(\left(b - c\right)\right)\right) \cdot \left(\frac{5}{6} + a\right)\right)}}} \]

      4. lower-sqrt.f64 N/A

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \mathsf{fma}\left(\color{blue}{\sqrt{\frac{1}{t}}}, z, \left(\mathsf{neg}\left(\left(b - c\right)\right)\right) \cdot \left(\frac{5}{6} + a\right)\right)}} \]

      5. lower-/.f64 N/A

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \mathsf{fma}\left(\sqrt{\color{blue}{\frac{1}{t}}}, z, \left(\mathsf{neg}\left(\left(b - c\right)\right)\right) \cdot \left(\frac{5}{6} + a\right)\right)}} \]

      6. mul-1-neg N/A

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \mathsf{fma}\left(\sqrt{\frac{1}{t}}, z, \color{blue}{\left(-1 \cdot \left(b - c\right)\right)} \cdot \left(\frac{5}{6} + a\right)\right)}} \]

      7. lower-*.f64 N/A

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \mathsf{fma}\left(\sqrt{\frac{1}{t}}, z, \color{blue}{\left(-1 \cdot \left(b - c\right)\right) \cdot \left(\frac{5}{6} + a\right)}\right)}} \]

      8. mul-1-neg N/A

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \mathsf{fma}\left(\sqrt{\frac{1}{t}}, z, \color{blue}{\left(\mathsf{neg}\left(\left(b - c\right)\right)\right)} \cdot \left(\frac{5}{6} + a\right)\right)}} \]

      9. lower-neg.f64 N/A

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \mathsf{fma}\left(\sqrt{\frac{1}{t}}, z, \color{blue}{\left(-\left(b - c\right)\right)} \cdot \left(\frac{5}{6} + a\right)\right)}} \]

      10. lower--.f64 N/A

          \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \mathsf{fma}\left(\sqrt{\frac{1}{t}}, z, \left(-\color{blue}{\left(b - c\right)}\right) \cdot \left(\frac{5}{6} + a\right)\right)}} \]

      11. lower-+.f64 96.6

          \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \mathsf{fma}\left(\sqrt{\frac{1}{t}}, z, \left(-\left(b - c\right)\right) \cdot \color{blue}{\left(0.8333333333333334 + a\right)}\right)}} \]

   5. Applied rewrites 96.6%

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

4. Final simplification 92.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;t \leq 3.15 \cdot 10^{-43}:\\ \;\;\;\;\frac{x}{x + y \cdot e^{2 \cdot \frac{\mathsf{fma}\left(\sqrt{a}, z, 0.6666666666666666 \cdot \left(b - c\right)\right)}{t}}}\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{x + y \cdot e^{2 \cdot \mathsf{fma}\left(\sqrt{{t}^{-1}}, z, \left(-\left(b - c\right)\right) \cdot \left(0.8333333333333334 + a\right)\right)}}\\ \end{array} \]
5. Add Preprocessing

Alternative 10: 82.8% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;t \leq 3.15 \cdot 10^{-43}:\\ \;\;\;\;\frac{x}{x + y \cdot e^{2 \cdot \frac{\mathsf{fma}\left(\sqrt{a}, z, 0.6666666666666666 \cdot \left(b - c\right)\right)}{t}}}\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{x + y \cdot e^{2 \cdot \mathsf{fma}\left(\sqrt{{t}^{-1}}, z, \left(c - b\right) \cdot 0.8333333333333334\right)}}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c)
 :precision binary64
 (if (<= t 3.15e-43)
   (/
    x
    (+
     x
     (*
      y
      (exp (* 2.0 (/ (fma (sqrt a) z (* 0.6666666666666666 (- b c))) t))))))
   (/
    x
    (+
     x
     (*
      y
      (exp
       (* 2.0 (fma (sqrt (pow t -1.0)) z (* (- c b) 0.8333333333333334)))))))))

C

double code(double x, double y, double z, double t, double a, double b, double c) {
	double tmp;
	if (t <= 3.15e-43) {
		tmp = x / (x + (y * exp((2.0 * (fma(sqrt(a), z, (0.6666666666666666 * (b - c))) / t)))));
	} else {
		tmp = x / (x + (y * exp((2.0 * fma(sqrt(pow(t, -1.0)), z, ((c - b) * 0.8333333333333334))))));
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b, c)
	tmp = 0.0
	if (t <= 3.15e-43)
		tmp = Float64(x / Float64(x + Float64(y * exp(Float64(2.0 * Float64(fma(sqrt(a), z, Float64(0.6666666666666666 * Float64(b - c))) / t))))));
	else
		tmp = Float64(x / Float64(x + Float64(y * exp(Float64(2.0 * fma(sqrt((t ^ -1.0)), z, Float64(Float64(c - b) * 0.8333333333333334)))))));
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_] := If[LessEqual[t, 3.15e-43], N[(x / N[(x + N[(y * N[Exp[N[(2.0 * N[(N[(N[Sqrt[a], $MachinePrecision] * z + N[(0.6666666666666666 * N[(b - c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(x / N[(x + N[(y * N[Exp[N[(2.0 * N[(N[Sqrt[N[Power[t, -1.0], $MachinePrecision]], $MachinePrecision] * z + N[(N[(c - b), $MachinePrecision] * 0.8333333333333334), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if t < 3.1500000000000001e-43

   1. Initial program 91.1%

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

   3. Taylor expanded in t around 0

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

      1. lower-/.f64 N/A

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

      2. fp-cancel-sub-sign-inv N/A

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \frac{\color{blue}{\sqrt{a} \cdot z + \left(\mathsf{neg}\left(\frac{-2}{3}\right)\right) \cdot \left(b - c\right)}}{t}}} \]

      3. metadata-eval N/A

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

      4. lower-fma.f64 N/A

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \frac{\color{blue}{\mathsf{fma}\left(\sqrt{a}, z, \frac{2}{3} \cdot \left(b - c\right)\right)}}{t}}} \]

      5. lower-sqrt.f64 N/A

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \frac{\mathsf{fma}\left(\color{blue}{\sqrt{a}}, z, \frac{2}{3} \cdot \left(b - c\right)\right)}{t}}} \]

      6. lower-*.f64 N/A

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \frac{\mathsf{fma}\left(\sqrt{a}, z, \color{blue}{\frac{2}{3} \cdot \left(b - c\right)}\right)}{t}}} \]

      7. lower--.f64 88.4

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \frac{\mathsf{fma}\left(\sqrt{a}, z, 0.6666666666666666 \cdot \color{blue}{\left(b - c\right)}\right)}{t}}} \]

   5. Applied rewrites 88.4%

      \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \color{blue}{\frac{\mathsf{fma}\left(\sqrt{a}, z, 0.6666666666666666 \cdot \left(b - c\right)\right)}{t}}}} \]

   if 3.1500000000000001e-43 < t

   1. Initial program 96.0%

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

   3. Taylor expanded in t around inf

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

      1. *-commutative N/A

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

      2. fp-cancel-sub-sign-inv N/A

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \color{blue}{\left(\sqrt{\frac{1}{t}} \cdot z + \left(\mathsf{neg}\left(\left(b - c\right)\right)\right) \cdot \left(\frac{5}{6} + a\right)\right)}}} \]

      3. lower-fma.f64 N/A

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \color{blue}{\mathsf{fma}\left(\sqrt{\frac{1}{t}}, z, \left(\mathsf{neg}\left(\left(b - c\right)\right)\right) \cdot \left(\frac{5}{6} + a\right)\right)}}} \]

      4. lower-sqrt.f64 N/A

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \mathsf{fma}\left(\color{blue}{\sqrt{\frac{1}{t}}}, z, \left(\mathsf{neg}\left(\left(b - c\right)\right)\right) \cdot \left(\frac{5}{6} + a\right)\right)}} \]

      5. lower-/.f64 N/A

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \mathsf{fma}\left(\sqrt{\color{blue}{\frac{1}{t}}}, z, \left(\mathsf{neg}\left(\left(b - c\right)\right)\right) \cdot \left(\frac{5}{6} + a\right)\right)}} \]

      6. mul-1-neg N/A

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \mathsf{fma}\left(\sqrt{\frac{1}{t}}, z, \color{blue}{\left(-1 \cdot \left(b - c\right)\right)} \cdot \left(\frac{5}{6} + a\right)\right)}} \]

      7. lower-*.f64 N/A

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \mathsf{fma}\left(\sqrt{\frac{1}{t}}, z, \color{blue}{\left(-1 \cdot \left(b - c\right)\right) \cdot \left(\frac{5}{6} + a\right)}\right)}} \]

      8. mul-1-neg N/A

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \mathsf{fma}\left(\sqrt{\frac{1}{t}}, z, \color{blue}{\left(\mathsf{neg}\left(\left(b - c\right)\right)\right)} \cdot \left(\frac{5}{6} + a\right)\right)}} \]

      9. lower-neg.f64 N/A

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \mathsf{fma}\left(\sqrt{\frac{1}{t}}, z, \color{blue}{\left(-\left(b - c\right)\right)} \cdot \left(\frac{5}{6} + a\right)\right)}} \]

      10. lower--.f64 N/A

          \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \mathsf{fma}\left(\sqrt{\frac{1}{t}}, z, \left(-\color{blue}{\left(b - c\right)}\right) \cdot \left(\frac{5}{6} + a\right)\right)}} \]

      11. lower-+.f64 96.6

          \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \mathsf{fma}\left(\sqrt{\frac{1}{t}}, z, \left(-\left(b - c\right)\right) \cdot \color{blue}{\left(0.8333333333333334 + a\right)}\right)}} \]

   5. Applied rewrites 96.6%

      \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \color{blue}{\mathsf{fma}\left(\sqrt{\frac{1}{t}}, z, \left(-\left(b - c\right)\right) \cdot \left(0.8333333333333334 + a\right)\right)}}} \]

   6. Taylor expanded in a around 0

      \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \mathsf{fma}\left(\sqrt{\frac{1}{t}}, z, \frac{5}{6} \cdot \left(c - b\right)\right)}} \]
   7. Step-by-step derivation

   8. Applied rewrites 80.6%

      \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \mathsf{fma}\left(\sqrt{\frac{1}{t}}, z, \left(c - b\right) \cdot 0.8333333333333334\right)}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 84.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;t \leq 3.15 \cdot 10^{-43}:\\ \;\;\;\;\frac{x}{x + y \cdot e^{2 \cdot \frac{\mathsf{fma}\left(\sqrt{a}, z, 0.6666666666666666 \cdot \left(b - c\right)\right)}{t}}}\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{x + y \cdot e^{2 \cdot \mathsf{fma}\left(\sqrt{{t}^{-1}}, z, \left(c - b\right) \cdot 0.8333333333333334\right)}}\\ \end{array} \]
5. Add Preprocessing

Alternative 11: 78.9% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{x}{x + y \cdot e^{2 \cdot \left(\left(\left(0.8333333333333334 + a\right) - \frac{0.6666666666666666}{t}\right) \cdot c\right)}}\\ \mathbf{if}\;c \leq -2 \cdot 10^{+140}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;c \leq -9.5 \cdot 10^{+38}:\\ \;\;\;\;\frac{x}{x + y \cdot e^{2 \cdot \frac{\mathsf{fma}\left(\sqrt{a}, z, 0.6666666666666666 \cdot \left(b - c\right)\right)}{t}}}\\ \mathbf{elif}\;c \leq 6.4 \cdot 10^{-40}:\\ \;\;\;\;\frac{x}{x + y \cdot e^{2 \cdot \left(\left(\left(\frac{0.6666666666666666}{t} - 0.8333333333333334\right) - a\right) \cdot b\right)}}\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c)
 :precision binary64
 (let* ((t_1
         (/
          x
          (+
           x
           (*
            y
            (exp
             (*
              2.0
              (*
               (- (+ 0.8333333333333334 a) (/ 0.6666666666666666 t))
               c))))))))
   (if (<= c -2e+140)
     t_1
     (if (<= c -9.5e+38)
       (/
        x
        (+
         x
         (*
          y
          (exp
           (* 2.0 (/ (fma (sqrt a) z (* 0.6666666666666666 (- b c))) t))))))
       (if (<= c 6.4e-40)
         (/
          x
          (+
           x
           (*
            y
            (exp
             (*
              2.0
              (* (- (- (/ 0.6666666666666666 t) 0.8333333333333334) a) b))))))
         t_1)))))

C

double code(double x, double y, double z, double t, double a, double b, double c) {
	double t_1 = x / (x + (y * exp((2.0 * (((0.8333333333333334 + a) - (0.6666666666666666 / t)) * c)))));
	double tmp;
	if (c <= -2e+140) {
		tmp = t_1;
	} else if (c <= -9.5e+38) {
		tmp = x / (x + (y * exp((2.0 * (fma(sqrt(a), z, (0.6666666666666666 * (b - c))) / t)))));
	} else if (c <= 6.4e-40) {
		tmp = x / (x + (y * exp((2.0 * ((((0.6666666666666666 / t) - 0.8333333333333334) - a) * b)))));
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b, c)
	t_1 = Float64(x / Float64(x + Float64(y * exp(Float64(2.0 * Float64(Float64(Float64(0.8333333333333334 + a) - Float64(0.6666666666666666 / t)) * c))))))
	tmp = 0.0
	if (c <= -2e+140)
		tmp = t_1;
	elseif (c <= -9.5e+38)
		tmp = Float64(x / Float64(x + Float64(y * exp(Float64(2.0 * Float64(fma(sqrt(a), z, Float64(0.6666666666666666 * Float64(b - c))) / t))))));
	elseif (c <= 6.4e-40)
		tmp = Float64(x / Float64(x + Float64(y * exp(Float64(2.0 * Float64(Float64(Float64(Float64(0.6666666666666666 / t) - 0.8333333333333334) - a) * b))))));
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(x / N[(x + N[(y * N[Exp[N[(2.0 * N[(N[(N[(0.8333333333333334 + a), $MachinePrecision] - N[(0.6666666666666666 / t), $MachinePrecision]), $MachinePrecision] * c), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[c, -2e+140], t$95$1, If[LessEqual[c, -9.5e+38], N[(x / N[(x + N[(y * N[Exp[N[(2.0 * N[(N[(N[Sqrt[a], $MachinePrecision] * z + N[(0.6666666666666666 * N[(b - c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[c, 6.4e-40], N[(x / N[(x + N[(y * N[Exp[N[(2.0 * N[(N[(N[(N[(0.6666666666666666 / t), $MachinePrecision] - 0.8333333333333334), $MachinePrecision] - a), $MachinePrecision] * b), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$1]]]]

Derivation

1. Split input into 3 regimes

2. if c < -2.00000000000000012e140 or 6.40000000000000004e-40 < c

   1. Initial program 89.8%

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

   3. Taylor expanded in c around inf

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

      1. *-commutative N/A

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \color{blue}{\left(\left(\left(\frac{5}{6} + a\right) - \frac{2}{3} \cdot \frac{1}{t}\right) \cdot c\right)}}} \]

      2. lower-*.f64 N/A

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \color{blue}{\left(\left(\left(\frac{5}{6} + a\right) - \frac{2}{3} \cdot \frac{1}{t}\right) \cdot c\right)}}} \]

      3. lower--.f64 N/A

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \left(\color{blue}{\left(\left(\frac{5}{6} + a\right) - \frac{2}{3} \cdot \frac{1}{t}\right)} \cdot c\right)}} \]

      4. lower-+.f64 N/A

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \left(\left(\color{blue}{\left(\frac{5}{6} + a\right)} - \frac{2}{3} \cdot \frac{1}{t}\right) \cdot c\right)}} \]

      5. associate-*r/ N/A

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \left(\left(\left(\frac{5}{6} + a\right) - \color{blue}{\frac{\frac{2}{3} \cdot 1}{t}}\right) \cdot c\right)}} \]

      6. metadata-eval N/A

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \left(\left(\left(\frac{5}{6} + a\right) - \frac{\color{blue}{\frac{2}{3}}}{t}\right) \cdot c\right)}} \]

      7. lower-/.f64 87.0

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \left(\left(\left(0.8333333333333334 + a\right) - \color{blue}{\frac{0.6666666666666666}{t}}\right) \cdot c\right)}} \]

   5. Applied rewrites 87.0%

      \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \color{blue}{\left(\left(\left(0.8333333333333334 + a\right) - \frac{0.6666666666666666}{t}\right) \cdot c\right)}}} \]

   if -2.00000000000000012e140 < c < -9.4999999999999995e38

   1. Initial program 95.7%

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

   3. Taylor expanded in t around 0

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

      1. lower-/.f64 N/A

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

      2. fp-cancel-sub-sign-inv N/A

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \frac{\color{blue}{\sqrt{a} \cdot z + \left(\mathsf{neg}\left(\frac{-2}{3}\right)\right) \cdot \left(b - c\right)}}{t}}} \]

      3. metadata-eval N/A

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

      4. lower-fma.f64 N/A

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \frac{\color{blue}{\mathsf{fma}\left(\sqrt{a}, z, \frac{2}{3} \cdot \left(b - c\right)\right)}}{t}}} \]

      5. lower-sqrt.f64 N/A

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \frac{\mathsf{fma}\left(\color{blue}{\sqrt{a}}, z, \frac{2}{3} \cdot \left(b - c\right)\right)}{t}}} \]

      6. lower-*.f64 N/A

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \frac{\mathsf{fma}\left(\sqrt{a}, z, \color{blue}{\frac{2}{3} \cdot \left(b - c\right)}\right)}{t}}} \]

      7. lower--.f64 87.3

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \frac{\mathsf{fma}\left(\sqrt{a}, z, 0.6666666666666666 \cdot \color{blue}{\left(b - c\right)}\right)}{t}}} \]

   5. Applied rewrites 87.3%

      \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \color{blue}{\frac{\mathsf{fma}\left(\sqrt{a}, z, 0.6666666666666666 \cdot \left(b - c\right)\right)}{t}}}} \]

   if -9.4999999999999995e38 < c < 6.40000000000000004e-40

   1. Initial program 96.0%

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

   3. Taylor expanded in b around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. associate--r+ N/A

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

      4. lower--.f64 N/A

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

      5. lower--.f64 N/A

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

      6. associate-*r/ N/A

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

      7. metadata-eval N/A

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

      8. lower-/.f64 85.3

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

   5. Applied rewrites 85.3%

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

Alternative 12: 80.3% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;c \leq -4.5 \cdot 10^{+49} \lor \neg \left(c \leq 6.4 \cdot 10^{-40}\right):\\ \;\;\;\;\frac{x}{x + y \cdot e^{2 \cdot \left(\left(\left(0.8333333333333334 + a\right) - \frac{0.6666666666666666}{t}\right) \cdot c\right)}}\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{x + y \cdot e^{2 \cdot \left(\left(\left(\frac{0.6666666666666666}{t} - 0.8333333333333334\right) - a\right) \cdot b\right)}}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c)
 :precision binary64
 (if (or (<= c -4.5e+49) (not (<= c 6.4e-40)))
   (/
    x
    (+
     x
     (*
      y
      (exp
       (* 2.0 (* (- (+ 0.8333333333333334 a) (/ 0.6666666666666666 t)) c))))))
   (/
    x
    (+
     x
     (*
      y
      (exp
       (*
        2.0
        (* (- (- (/ 0.6666666666666666 t) 0.8333333333333334) a) b))))))))

C

double code(double x, double y, double z, double t, double a, double b, double c) {
	double tmp;
	if ((c <= -4.5e+49) || !(c <= 6.4e-40)) {
		tmp = x / (x + (y * exp((2.0 * (((0.8333333333333334 + a) - (0.6666666666666666 / t)) * c)))));
	} else {
		tmp = x / (x + (y * exp((2.0 * ((((0.6666666666666666 / t) - 0.8333333333333334) - a) * b)))));
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b, c)
    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), intent (in) :: c
    real(8) :: tmp
    if ((c <= (-4.5d+49)) .or. (.not. (c <= 6.4d-40))) then
        tmp = x / (x + (y * exp((2.0d0 * (((0.8333333333333334d0 + a) - (0.6666666666666666d0 / t)) * c)))))
    else
        tmp = x / (x + (y * exp((2.0d0 * ((((0.6666666666666666d0 / t) - 0.8333333333333334d0) - a) * b)))))
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b, double c) {
	double tmp;
	if ((c <= -4.5e+49) || !(c <= 6.4e-40)) {
		tmp = x / (x + (y * Math.exp((2.0 * (((0.8333333333333334 + a) - (0.6666666666666666 / t)) * c)))));
	} else {
		tmp = x / (x + (y * Math.exp((2.0 * ((((0.6666666666666666 / t) - 0.8333333333333334) - a) * b)))));
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b, c):
	tmp = 0
	if (c <= -4.5e+49) or not (c <= 6.4e-40):
		tmp = x / (x + (y * math.exp((2.0 * (((0.8333333333333334 + a) - (0.6666666666666666 / t)) * c)))))
	else:
		tmp = x / (x + (y * math.exp((2.0 * ((((0.6666666666666666 / t) - 0.8333333333333334) - a) * b)))))
	return tmp

Julia

function code(x, y, z, t, a, b, c)
	tmp = 0.0
	if ((c <= -4.5e+49) || !(c <= 6.4e-40))
		tmp = Float64(x / Float64(x + Float64(y * exp(Float64(2.0 * Float64(Float64(Float64(0.8333333333333334 + a) - Float64(0.6666666666666666 / t)) * c))))));
	else
		tmp = Float64(x / Float64(x + Float64(y * exp(Float64(2.0 * Float64(Float64(Float64(Float64(0.6666666666666666 / t) - 0.8333333333333334) - a) * b))))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b, c)
	tmp = 0.0;
	if ((c <= -4.5e+49) || ~((c <= 6.4e-40)))
		tmp = x / (x + (y * exp((2.0 * (((0.8333333333333334 + a) - (0.6666666666666666 / t)) * c)))));
	else
		tmp = x / (x + (y * exp((2.0 * ((((0.6666666666666666 / t) - 0.8333333333333334) - a) * b)))));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_] := If[Or[LessEqual[c, -4.5e+49], N[Not[LessEqual[c, 6.4e-40]], $MachinePrecision]], N[(x / N[(x + N[(y * N[Exp[N[(2.0 * N[(N[(N[(0.8333333333333334 + a), $MachinePrecision] - N[(0.6666666666666666 / t), $MachinePrecision]), $MachinePrecision] * c), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(x / N[(x + N[(y * N[Exp[N[(2.0 * N[(N[(N[(N[(0.6666666666666666 / t), $MachinePrecision] - 0.8333333333333334), $MachinePrecision] - a), $MachinePrecision] * b), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if c < -4.49999999999999982e49 or 6.40000000000000004e-40 < c

   1. Initial program 90.7%

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

   3. Taylor expanded in c around inf

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

      1. *-commutative N/A

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \color{blue}{\left(\left(\left(\frac{5}{6} + a\right) - \frac{2}{3} \cdot \frac{1}{t}\right) \cdot c\right)}}} \]

      2. lower-*.f64 N/A

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \color{blue}{\left(\left(\left(\frac{5}{6} + a\right) - \frac{2}{3} \cdot \frac{1}{t}\right) \cdot c\right)}}} \]

      3. lower--.f64 N/A

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \left(\color{blue}{\left(\left(\frac{5}{6} + a\right) - \frac{2}{3} \cdot \frac{1}{t}\right)} \cdot c\right)}} \]

      4. lower-+.f64 N/A

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \left(\left(\color{blue}{\left(\frac{5}{6} + a\right)} - \frac{2}{3} \cdot \frac{1}{t}\right) \cdot c\right)}} \]

      5. associate-*r/ N/A

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \left(\left(\left(\frac{5}{6} + a\right) - \color{blue}{\frac{\frac{2}{3} \cdot 1}{t}}\right) \cdot c\right)}} \]

      6. metadata-eval N/A

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \left(\left(\left(\frac{5}{6} + a\right) - \frac{\color{blue}{\frac{2}{3}}}{t}\right) \cdot c\right)}} \]

      7. lower-/.f64 83.8

         \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \left(\left(\left(0.8333333333333334 + a\right) - \color{blue}{\frac{0.6666666666666666}{t}}\right) \cdot c\right)}} \]

   5. Applied rewrites 83.8%

      \[\leadsto \frac{x}{x + y \cdot e^{2 \cdot \color{blue}{\left(\left(\left(0.8333333333333334 + a\right) - \frac{0.6666666666666666}{t}\right) \cdot c\right)}}} \]

   if -4.49999999999999982e49 < c < 6.40000000000000004e-40

   1. Initial program 96.1%

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

   3. Taylor expanded in b around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. associate--r+ N/A

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

      4. lower--.f64 N/A

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

      5. lower--.f64 N/A

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

      6. associate-*r/ N/A

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

      7. metadata-eval N/A

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

      8. lower-/.f64 84.8

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

   5. Applied rewrites 84.8%

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

4. Final simplification 84.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;c \leq -4.5 \cdot 10^{+49} \lor \neg \left(c \leq 6.4 \cdot 10^{-40}\right):\\ \;\;\;\;\frac{x}{x + y \cdot e^{2 \cdot \left(\left(\left(0.8333333333333334 + a\right) - \frac{0.6666666666666666}{t}\right) \cdot c\right)}}\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{x + y \cdot e^{2 \cdot \left(\left(\left(\frac{0.6666666666666666}{t} - 0.8333333333333334\right) - a\right) \cdot b\right)}}\\ \end{array} \]
5. Add Preprocessing

Alternative 13: 51.5% accurate, 198.0× speedup

Math

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

FPCore

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

C

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

Fortran

real(8) function code(x, y, z, t, a, b, c)
    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), intent (in) :: c
    code = 1.0d0
end function

Java

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

Python

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

Julia

function code(x, y, z, t, a, b, c)
	return 1.0
end

MATLAB

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

Wolfram

code[x_, y_, z_, t_, a_, b_, c_] := 1.0

Derivation

1. Initial program 93.4%

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

3. Taylor expanded in x around inf

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

5. Applied rewrites 45.1%

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

Developer Target 1: 95.5% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := z \cdot \sqrt{t + a}\\ t_2 := a - \frac{5}{6}\\ \mathbf{if}\;t < -2.118326644891581 \cdot 10^{-50}:\\ \;\;\;\;\frac{x}{x + y \cdot e^{2 \cdot \left(\left(a \cdot c + 0.8333333333333334 \cdot c\right) - a \cdot b\right)}}\\ \mathbf{elif}\;t < 5.196588770651547 \cdot 10^{-123}:\\ \;\;\;\;\frac{x}{x + y \cdot e^{2 \cdot \frac{t\_1 \cdot \left(\left(3 \cdot t\right) \cdot t\_2\right) - \left(\left(\frac{5}{6} + a\right) \cdot \left(3 \cdot t\right) - 2\right) \cdot \left(t\_2 \cdot \left(\left(b - c\right) \cdot t\right)\right)}{\left(\left(t \cdot t\right) \cdot 3\right) \cdot t\_2}}}\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{x + y \cdot e^{2 \cdot \left(\frac{t\_1}{t} - \left(b - c\right) \cdot \left(\left(a + \frac{5}{6}\right) - \frac{2}{t \cdot 3}\right)\right)}}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c)
 :precision binary64
 (let* ((t_1 (* z (sqrt (+ t a)))) (t_2 (- a (/ 5.0 6.0))))
   (if (< t -2.118326644891581e-50)
     (/
      x
      (+
       x
       (* y (exp (* 2.0 (- (+ (* a c) (* 0.8333333333333334 c)) (* a b)))))))
     (if (< t 5.196588770651547e-123)
       (/
        x
        (+
         x
         (*
          y
          (exp
           (*
            2.0
            (/
             (-
              (* t_1 (* (* 3.0 t) t_2))
              (*
               (- (* (+ (/ 5.0 6.0) a) (* 3.0 t)) 2.0)
               (* t_2 (* (- b c) t))))
             (* (* (* t t) 3.0) t_2)))))))
       (/
        x
        (+
         x
         (*
          y
          (exp
           (*
            2.0
            (-
             (/ t_1 t)
             (* (- b c) (- (+ a (/ 5.0 6.0)) (/ 2.0 (* t 3.0))))))))))))))

C

double code(double x, double y, double z, double t, double a, double b, double c) {
	double t_1 = z * sqrt((t + a));
	double t_2 = a - (5.0 / 6.0);
	double tmp;
	if (t < -2.118326644891581e-50) {
		tmp = x / (x + (y * exp((2.0 * (((a * c) + (0.8333333333333334 * c)) - (a * b))))));
	} else if (t < 5.196588770651547e-123) {
		tmp = x / (x + (y * exp((2.0 * (((t_1 * ((3.0 * t) * t_2)) - (((((5.0 / 6.0) + a) * (3.0 * t)) - 2.0) * (t_2 * ((b - c) * t)))) / (((t * t) * 3.0) * t_2))))));
	} else {
		tmp = x / (x + (y * exp((2.0 * ((t_1 / t) - ((b - c) * ((a + (5.0 / 6.0)) - (2.0 / (t * 3.0)))))))));
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b, c)
    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), intent (in) :: c
    real(8) :: t_1
    real(8) :: t_2
    real(8) :: tmp
    t_1 = z * sqrt((t + a))
    t_2 = a - (5.0d0 / 6.0d0)
    if (t < (-2.118326644891581d-50)) then
        tmp = x / (x + (y * exp((2.0d0 * (((a * c) + (0.8333333333333334d0 * c)) - (a * b))))))
    else if (t < 5.196588770651547d-123) then
        tmp = x / (x + (y * exp((2.0d0 * (((t_1 * ((3.0d0 * t) * t_2)) - (((((5.0d0 / 6.0d0) + a) * (3.0d0 * t)) - 2.0d0) * (t_2 * ((b - c) * t)))) / (((t * t) * 3.0d0) * t_2))))))
    else
        tmp = x / (x + (y * exp((2.0d0 * ((t_1 / t) - ((b - c) * ((a + (5.0d0 / 6.0d0)) - (2.0d0 / (t * 3.0d0)))))))))
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b, double c) {
	double t_1 = z * Math.sqrt((t + a));
	double t_2 = a - (5.0 / 6.0);
	double tmp;
	if (t < -2.118326644891581e-50) {
		tmp = x / (x + (y * Math.exp((2.0 * (((a * c) + (0.8333333333333334 * c)) - (a * b))))));
	} else if (t < 5.196588770651547e-123) {
		tmp = x / (x + (y * Math.exp((2.0 * (((t_1 * ((3.0 * t) * t_2)) - (((((5.0 / 6.0) + a) * (3.0 * t)) - 2.0) * (t_2 * ((b - c) * t)))) / (((t * t) * 3.0) * t_2))))));
	} else {
		tmp = x / (x + (y * Math.exp((2.0 * ((t_1 / t) - ((b - c) * ((a + (5.0 / 6.0)) - (2.0 / (t * 3.0)))))))));
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b, c):
	t_1 = z * math.sqrt((t + a))
	t_2 = a - (5.0 / 6.0)
	tmp = 0
	if t < -2.118326644891581e-50:
		tmp = x / (x + (y * math.exp((2.0 * (((a * c) + (0.8333333333333334 * c)) - (a * b))))))
	elif t < 5.196588770651547e-123:
		tmp = x / (x + (y * math.exp((2.0 * (((t_1 * ((3.0 * t) * t_2)) - (((((5.0 / 6.0) + a) * (3.0 * t)) - 2.0) * (t_2 * ((b - c) * t)))) / (((t * t) * 3.0) * t_2))))))
	else:
		tmp = x / (x + (y * math.exp((2.0 * ((t_1 / t) - ((b - c) * ((a + (5.0 / 6.0)) - (2.0 / (t * 3.0)))))))))
	return tmp

Julia

function code(x, y, z, t, a, b, c)
	t_1 = Float64(z * sqrt(Float64(t + a)))
	t_2 = Float64(a - Float64(5.0 / 6.0))
	tmp = 0.0
	if (t < -2.118326644891581e-50)
		tmp = Float64(x / Float64(x + Float64(y * exp(Float64(2.0 * Float64(Float64(Float64(a * c) + Float64(0.8333333333333334 * c)) - Float64(a * b)))))));
	elseif (t < 5.196588770651547e-123)
		tmp = Float64(x / Float64(x + Float64(y * exp(Float64(2.0 * Float64(Float64(Float64(t_1 * Float64(Float64(3.0 * t) * t_2)) - Float64(Float64(Float64(Float64(Float64(5.0 / 6.0) + a) * Float64(3.0 * t)) - 2.0) * Float64(t_2 * Float64(Float64(b - c) * t)))) / Float64(Float64(Float64(t * t) * 3.0) * t_2)))))));
	else
		tmp = Float64(x / Float64(x + Float64(y * exp(Float64(2.0 * Float64(Float64(t_1 / t) - Float64(Float64(b - c) * Float64(Float64(a + Float64(5.0 / 6.0)) - Float64(2.0 / Float64(t * 3.0))))))))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b, c)
	t_1 = z * sqrt((t + a));
	t_2 = a - (5.0 / 6.0);
	tmp = 0.0;
	if (t < -2.118326644891581e-50)
		tmp = x / (x + (y * exp((2.0 * (((a * c) + (0.8333333333333334 * c)) - (a * b))))));
	elseif (t < 5.196588770651547e-123)
		tmp = x / (x + (y * exp((2.0 * (((t_1 * ((3.0 * t) * t_2)) - (((((5.0 / 6.0) + a) * (3.0 * t)) - 2.0) * (t_2 * ((b - c) * t)))) / (((t * t) * 3.0) * t_2))))));
	else
		tmp = x / (x + (y * exp((2.0 * ((t_1 / t) - ((b - c) * ((a + (5.0 / 6.0)) - (2.0 / (t * 3.0)))))))));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(z * N[Sqrt[N[(t + a), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(a - N[(5.0 / 6.0), $MachinePrecision]), $MachinePrecision]}, If[Less[t, -2.118326644891581e-50], N[(x / N[(x + N[(y * N[Exp[N[(2.0 * N[(N[(N[(a * c), $MachinePrecision] + N[(0.8333333333333334 * c), $MachinePrecision]), $MachinePrecision] - N[(a * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[Less[t, 5.196588770651547e-123], N[(x / N[(x + N[(y * N[Exp[N[(2.0 * N[(N[(N[(t$95$1 * N[(N[(3.0 * t), $MachinePrecision] * t$95$2), $MachinePrecision]), $MachinePrecision] - N[(N[(N[(N[(N[(5.0 / 6.0), $MachinePrecision] + a), $MachinePrecision] * N[(3.0 * t), $MachinePrecision]), $MachinePrecision] - 2.0), $MachinePrecision] * N[(t$95$2 * N[(N[(b - c), $MachinePrecision] * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(N[(N[(t * t), $MachinePrecision] * 3.0), $MachinePrecision] * t$95$2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(x / N[(x + N[(y * N[Exp[N[(2.0 * N[(N[(t$95$1 / t), $MachinePrecision] - N[(N[(b - c), $MachinePrecision] * N[(N[(a + N[(5.0 / 6.0), $MachinePrecision]), $MachinePrecision] - N[(2.0 / N[(t * 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]

Reproduce

herbie shell --seed 2024337 
(FPCore (x y z t a b c)
  :name "Numeric.SpecFunctions:invIncompleteBetaWorker from math-functions-0.1.5.2, I"
  :precision binary64

  :alt
  (! :herbie-platform default (if (< t -2118326644891581/100000000000000000000000000000000000000000000000000000000000000000) (/ x (+ x (* y (exp (* 2 (- (+ (* a c) (* 4166666666666667/5000000000000000 c)) (* a b))))))) (if (< t 5196588770651547/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) (/ x (+ x (* y (exp (* 2 (/ (- (* (* z (sqrt (+ t a))) (* (* 3 t) (- a (/ 5 6)))) (* (- (* (+ (/ 5 6) a) (* 3 t)) 2) (* (- a (/ 5 6)) (* (- b c) t)))) (* (* (* t t) 3) (- a (/ 5 6))))))))) (/ x (+ x (* y (exp (* 2 (- (/ (* z (sqrt (+ t a))) t) (* (- b c) (- (+ a (/ 5 6)) (/ 2 (* t 3)))))))))))))

  (/ x (+ x (* y (exp (* 2.0 (- (/ (* z (sqrt (+ t a))) t) (* (- b c) (- (+ a (/ 5.0 6.0)) (/ 2.0 (* t 3.0)))))))))))