Numeric.SpecFunctions:logGamma from math-functions-0.1.5.2

Percentage Accurate: 55.4% → 84.9%

Time: 30.6s

Alternatives: 15

Speedup: 1.6×

Specification

Math

\[\begin{array}{l} \\ \frac{\left(\left(\left(x \cdot y + z\right) \cdot y + 27464.7644705\right) \cdot y + 230661.510616\right) \cdot y + t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \end{array} \]

FPCore

(FPCore (x y z t a b c i)
 :precision binary64
 (/
  (+ (* (+ (* (+ (* (+ (* x y) z) y) 27464.7644705) y) 230661.510616) y) t)
  (+ (* (+ (* (+ (* (+ y a) y) b) y) c) y) i)))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	return ((((((((x * y) + z) * y) + 27464.7644705) * y) + 230661.510616) * y) + t) / (((((((y + a) * y) + b) * y) + c) * y) + i);
}

Fortran

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

Java

public static double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	return ((((((((x * y) + z) * y) + 27464.7644705) * y) + 230661.510616) * y) + t) / (((((((y + a) * y) + b) * y) + c) * y) + i);
}

Python

def code(x, y, z, t, a, b, c, i):
	return ((((((((x * y) + z) * y) + 27464.7644705) * y) + 230661.510616) * y) + t) / (((((((y + a) * y) + b) * y) + c) * y) + i)

Julia

function code(x, y, z, t, a, b, c, i)
	return Float64(Float64(Float64(Float64(Float64(Float64(Float64(Float64(Float64(x * y) + z) * y) + 27464.7644705) * y) + 230661.510616) * y) + t) / Float64(Float64(Float64(Float64(Float64(Float64(Float64(y + a) * y) + b) * y) + c) * y) + i))
end

MATLAB

function tmp = code(x, y, z, t, a, b, c, i)
	tmp = ((((((((x * y) + z) * y) + 27464.7644705) * y) + 230661.510616) * y) + t) / (((((((y + a) * y) + b) * y) + c) * y) + i);
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_] := N[(N[(N[(N[(N[(N[(N[(N[(N[(x * y), $MachinePrecision] + z), $MachinePrecision] * y), $MachinePrecision] + 27464.7644705), $MachinePrecision] * y), $MachinePrecision] + 230661.510616), $MachinePrecision] * y), $MachinePrecision] + t), $MachinePrecision] / N[(N[(N[(N[(N[(N[(N[(y + a), $MachinePrecision] * y), $MachinePrecision] + b), $MachinePrecision] * y), $MachinePrecision] + c), $MachinePrecision] * y), $MachinePrecision] + i), $MachinePrecision]), $MachinePrecision]

Initial Program: 55.4% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{\left(\left(\left(x \cdot y + z\right) \cdot y + 27464.7644705\right) \cdot y + 230661.510616\right) \cdot y + t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \end{array} \]

FPCore

(FPCore (x y z t a b c i)
 :precision binary64
 (/
  (+ (* (+ (* (+ (* (+ (* x y) z) y) 27464.7644705) y) 230661.510616) y) t)
  (+ (* (+ (* (+ (* (+ y a) y) b) y) c) y) i)))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	return ((((((((x * y) + z) * y) + 27464.7644705) * y) + 230661.510616) * y) + t) / (((((((y + a) * y) + b) * y) + c) * y) + i);
}

Fortran

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

Java

public static double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	return ((((((((x * y) + z) * y) + 27464.7644705) * y) + 230661.510616) * y) + t) / (((((((y + a) * y) + b) * y) + c) * y) + i);
}

Python

def code(x, y, z, t, a, b, c, i):
	return ((((((((x * y) + z) * y) + 27464.7644705) * y) + 230661.510616) * y) + t) / (((((((y + a) * y) + b) * y) + c) * y) + i)

Julia

function code(x, y, z, t, a, b, c, i)
	return Float64(Float64(Float64(Float64(Float64(Float64(Float64(Float64(Float64(x * y) + z) * y) + 27464.7644705) * y) + 230661.510616) * y) + t) / Float64(Float64(Float64(Float64(Float64(Float64(Float64(y + a) * y) + b) * y) + c) * y) + i))
end

MATLAB

function tmp = code(x, y, z, t, a, b, c, i)
	tmp = ((((((((x * y) + z) * y) + 27464.7644705) * y) + 230661.510616) * y) + t) / (((((((y + a) * y) + b) * y) + c) * y) + i);
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_] := N[(N[(N[(N[(N[(N[(N[(N[(N[(x * y), $MachinePrecision] + z), $MachinePrecision] * y), $MachinePrecision] + 27464.7644705), $MachinePrecision] * y), $MachinePrecision] + 230661.510616), $MachinePrecision] * y), $MachinePrecision] + t), $MachinePrecision] / N[(N[(N[(N[(N[(N[(N[(y + a), $MachinePrecision] * y), $MachinePrecision] + b), $MachinePrecision] * y), $MachinePrecision] + c), $MachinePrecision] * y), $MachinePrecision] + i), $MachinePrecision]), $MachinePrecision]

Alternative 1: 84.9% accurate, 0.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -9.2 \cdot 10^{+62} \lor \neg \left(y \leq 10^{+57}\right):\\ \;\;\;\;\frac{z}{y} + \left(x - \frac{a}{\frac{y}{x}}\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(x, y, z\right), y, 27464.7644705\right), y, 230661.510616\right), y, t\right)}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(y + a, y, b\right), y, c\right), y, i\right)}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c i)
 :precision binary64
 (if (or (<= y -9.2e+62) (not (<= y 1e+57)))
   (+ (/ z y) (- x (/ a (/ y x))))
   (/
    (fma (fma (fma (fma x y z) y 27464.7644705) y 230661.510616) y t)
    (fma (fma (fma (+ y a) y b) y c) y i))))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	double tmp;
	if ((y <= -9.2e+62) || !(y <= 1e+57)) {
		tmp = (z / y) + (x - (a / (y / x)));
	} else {
		tmp = fma(fma(fma(fma(x, y, z), y, 27464.7644705), y, 230661.510616), y, t) / fma(fma(fma((y + a), y, b), y, c), y, i);
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b, c, i)
	tmp = 0.0
	if ((y <= -9.2e+62) || !(y <= 1e+57))
		tmp = Float64(Float64(z / y) + Float64(x - Float64(a / Float64(y / x))));
	else
		tmp = Float64(fma(fma(fma(fma(x, y, z), y, 27464.7644705), y, 230661.510616), y, t) / fma(fma(fma(Float64(y + a), y, b), y, c), y, i));
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_] := If[Or[LessEqual[y, -9.2e+62], N[Not[LessEqual[y, 1e+57]], $MachinePrecision]], N[(N[(z / y), $MachinePrecision] + N[(x - N[(a / N[(y / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(N[(x * y + z), $MachinePrecision] * y + 27464.7644705), $MachinePrecision] * y + 230661.510616), $MachinePrecision] * y + t), $MachinePrecision] / N[(N[(N[(N[(y + a), $MachinePrecision] * y + b), $MachinePrecision] * y + c), $MachinePrecision] * y + i), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -9.19999999999999936e62 or 1.00000000000000005e57 < y

   1. Initial program 0.6%

      \[\frac{\left(\left(\left(x \cdot y + z\right) \cdot y + 27464.7644705\right) \cdot y + 230661.510616\right) \cdot y + t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \]
   2. Add Preprocessing

   3. Taylor expanded in y around inf 64.8%

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

      1. +-commutative 64.8%

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

      2. associate--l+ 64.8%

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

      3. associate-/l* 66.8%

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

   5. Simplified 66.8%

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

   if -9.19999999999999936e62 < y < 1.00000000000000005e57

   1. Initial program 93.6%

      \[\frac{\left(\left(\left(x \cdot y + z\right) \cdot y + 27464.7644705\right) \cdot y + 230661.510616\right) \cdot y + t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \]
   2. Step-by-step derivation

      1. fma-define 93.6%

         \[\leadsto \frac{\color{blue}{\mathsf{fma}\left(\left(\left(x \cdot y + z\right) \cdot y + 27464.7644705\right) \cdot y + 230661.510616, y, t\right)}}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \]

      2. fma-define 93.6%

         \[\leadsto \frac{\mathsf{fma}\left(\color{blue}{\mathsf{fma}\left(\left(x \cdot y + z\right) \cdot y + 27464.7644705, y, 230661.510616\right)}, y, t\right)}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \]

      3. fma-define 93.6%

         \[\leadsto \frac{\mathsf{fma}\left(\mathsf{fma}\left(\color{blue}{\mathsf{fma}\left(x \cdot y + z, y, 27464.7644705\right)}, y, 230661.510616\right), y, t\right)}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \]

      4. fma-define 93.6%

         \[\leadsto \frac{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(\color{blue}{\mathsf{fma}\left(x, y, z\right)}, y, 27464.7644705\right), y, 230661.510616\right), y, t\right)}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \]

      5. fma-define 93.6%

         \[\leadsto \frac{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(x, y, z\right), y, 27464.7644705\right), y, 230661.510616\right), y, t\right)}{\color{blue}{\mathsf{fma}\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c, y, i\right)}} \]

      6. fma-define 93.6%

         \[\leadsto \frac{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(x, y, z\right), y, 27464.7644705\right), y, 230661.510616\right), y, t\right)}{\mathsf{fma}\left(\color{blue}{\mathsf{fma}\left(\left(y + a\right) \cdot y + b, y, c\right)}, y, i\right)} \]

      7. fma-define 93.6%

         \[\leadsto \frac{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(x, y, z\right), y, 27464.7644705\right), y, 230661.510616\right), y, t\right)}{\mathsf{fma}\left(\mathsf{fma}\left(\color{blue}{\mathsf{fma}\left(y + a, y, b\right)}, y, c\right), y, i\right)} \]

   3. Simplified 93.6%

      \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(x, y, z\right), y, 27464.7644705\right), y, 230661.510616\right), y, t\right)}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(y + a, y, b\right), y, c\right), y, i\right)}} \]
   4. Add Preprocessing
3. Recombined 2 regimes into one program.

4. Final simplification 83.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -9.2 \cdot 10^{+62} \lor \neg \left(y \leq 10^{+57}\right):\\ \;\;\;\;\frac{z}{y} + \left(x - \frac{a}{\frac{y}{x}}\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(x, y, z\right), y, 27464.7644705\right), y, 230661.510616\right), y, t\right)}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(y + a, y, b\right), y, c\right), y, i\right)}\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 84.8% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(y + a\right)\right)\right)\\ \mathbf{if}\;y \leq -8 \cdot 10^{+60} \lor \neg \left(y \leq 1.4 \cdot 10^{+58}\right):\\ \;\;\;\;\frac{z}{y} + \left(x - \frac{a}{\frac{y}{x}}\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{t}{t\_1} + \frac{y \cdot \left(230661.510616 + y \cdot \left(27464.7644705 + y \cdot \left(z + y \cdot x\right)\right)\right)}{t\_1}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c i)
 :precision binary64
 (let* ((t_1 (+ i (* y (+ c (* y (+ b (* y (+ y a)))))))))
   (if (or (<= y -8e+60) (not (<= y 1.4e+58)))
     (+ (/ z y) (- x (/ a (/ y x))))
     (+
      (/ t t_1)
      (/
       (* y (+ 230661.510616 (* y (+ 27464.7644705 (* y (+ z (* y x)))))))
       t_1)))))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	double t_1 = i + (y * (c + (y * (b + (y * (y + a))))));
	double tmp;
	if ((y <= -8e+60) || !(y <= 1.4e+58)) {
		tmp = (z / y) + (x - (a / (y / x)));
	} else {
		tmp = (t / t_1) + ((y * (230661.510616 + (y * (27464.7644705 + (y * (z + (y * x))))))) / t_1);
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b, c, i)
    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), intent (in) :: i
    real(8) :: t_1
    real(8) :: tmp
    t_1 = i + (y * (c + (y * (b + (y * (y + a))))))
    if ((y <= (-8d+60)) .or. (.not. (y <= 1.4d+58))) then
        tmp = (z / y) + (x - (a / (y / x)))
    else
        tmp = (t / t_1) + ((y * (230661.510616d0 + (y * (27464.7644705d0 + (y * (z + (y * x))))))) / t_1)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	double t_1 = i + (y * (c + (y * (b + (y * (y + a))))));
	double tmp;
	if ((y <= -8e+60) || !(y <= 1.4e+58)) {
		tmp = (z / y) + (x - (a / (y / x)));
	} else {
		tmp = (t / t_1) + ((y * (230661.510616 + (y * (27464.7644705 + (y * (z + (y * x))))))) / t_1);
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b, c, i):
	t_1 = i + (y * (c + (y * (b + (y * (y + a))))))
	tmp = 0
	if (y <= -8e+60) or not (y <= 1.4e+58):
		tmp = (z / y) + (x - (a / (y / x)))
	else:
		tmp = (t / t_1) + ((y * (230661.510616 + (y * (27464.7644705 + (y * (z + (y * x))))))) / t_1)
	return tmp

Julia

function code(x, y, z, t, a, b, c, i)
	t_1 = Float64(i + Float64(y * Float64(c + Float64(y * Float64(b + Float64(y * Float64(y + a)))))))
	tmp = 0.0
	if ((y <= -8e+60) || !(y <= 1.4e+58))
		tmp = Float64(Float64(z / y) + Float64(x - Float64(a / Float64(y / x))));
	else
		tmp = Float64(Float64(t / t_1) + Float64(Float64(y * Float64(230661.510616 + Float64(y * Float64(27464.7644705 + Float64(y * Float64(z + Float64(y * x))))))) / t_1));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b, c, i)
	t_1 = i + (y * (c + (y * (b + (y * (y + a))))));
	tmp = 0.0;
	if ((y <= -8e+60) || ~((y <= 1.4e+58)))
		tmp = (z / y) + (x - (a / (y / x)));
	else
		tmp = (t / t_1) + ((y * (230661.510616 + (y * (27464.7644705 + (y * (z + (y * x))))))) / t_1);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_] := Block[{t$95$1 = N[(i + N[(y * N[(c + N[(y * N[(b + N[(y * N[(y + a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[Or[LessEqual[y, -8e+60], N[Not[LessEqual[y, 1.4e+58]], $MachinePrecision]], N[(N[(z / y), $MachinePrecision] + N[(x - N[(a / N[(y / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(t / t$95$1), $MachinePrecision] + N[(N[(y * N[(230661.510616 + N[(y * N[(27464.7644705 + N[(y * N[(z + N[(y * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if y < -7.9999999999999996e60 or 1.3999999999999999e58 < y

   1. Initial program 0.6%

      \[\frac{\left(\left(\left(x \cdot y + z\right) \cdot y + 27464.7644705\right) \cdot y + 230661.510616\right) \cdot y + t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \]
   2. Add Preprocessing

   3. Taylor expanded in y around inf 64.8%

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

      1. +-commutative 64.8%

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

      2. associate--l+ 64.8%

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

      3. associate-/l* 66.8%

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

   5. Simplified 66.8%

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

   if -7.9999999999999996e60 < y < 1.3999999999999999e58

   1. Initial program 93.6%

      \[\frac{\left(\left(\left(x \cdot y + z\right) \cdot y + 27464.7644705\right) \cdot y + 230661.510616\right) \cdot y + t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \]
   2. Add Preprocessing

   3. Taylor expanded in t around 0 93.6%

      \[\leadsto \color{blue}{\frac{t}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right)} + \frac{y \cdot \left(230661.510616 + y \cdot \left(27464.7644705 + y \cdot \left(z + x \cdot y\right)\right)\right)}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right)}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 83.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -8 \cdot 10^{+60} \lor \neg \left(y \leq 1.4 \cdot 10^{+58}\right):\\ \;\;\;\;\frac{z}{y} + \left(x - \frac{a}{\frac{y}{x}}\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{t}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(y + a\right)\right)\right)} + \frac{y \cdot \left(230661.510616 + y \cdot \left(27464.7644705 + y \cdot \left(z + y \cdot x\right)\right)\right)}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(y + a\right)\right)\right)}\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 81.6% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(y + a\right)\right)\right)\\ t_2 := \frac{z}{y} + \left(x - \frac{a}{\frac{y}{x}}\right)\\ \mathbf{if}\;y \leq -1.9 \cdot 10^{+56}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;y \leq -2.75 \cdot 10^{-14}:\\ \;\;\;\;\frac{y \cdot \left(230661.510616 + y \cdot \left(27464.7644705 + y \cdot \left(z + y \cdot x\right)\right)\right)}{t\_1}\\ \mathbf{elif}\;y \leq 3.9 \cdot 10^{+55}:\\ \;\;\;\;\frac{t + y \cdot \left(230661.510616 + y \cdot \left(27464.7644705 + y \cdot z\right)\right)}{t\_1}\\ \mathbf{else}:\\ \;\;\;\;t\_2\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c i)
 :precision binary64
 (let* ((t_1 (+ i (* y (+ c (* y (+ b (* y (+ y a))))))))
        (t_2 (+ (/ z y) (- x (/ a (/ y x))))))
   (if (<= y -1.9e+56)
     t_2
     (if (<= y -2.75e-14)
       (/
        (* y (+ 230661.510616 (* y (+ 27464.7644705 (* y (+ z (* y x)))))))
        t_1)
       (if (<= y 3.9e+55)
         (/ (+ t (* y (+ 230661.510616 (* y (+ 27464.7644705 (* y z)))))) t_1)
         t_2)))))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	double t_1 = i + (y * (c + (y * (b + (y * (y + a))))));
	double t_2 = (z / y) + (x - (a / (y / x)));
	double tmp;
	if (y <= -1.9e+56) {
		tmp = t_2;
	} else if (y <= -2.75e-14) {
		tmp = (y * (230661.510616 + (y * (27464.7644705 + (y * (z + (y * x))))))) / t_1;
	} else if (y <= 3.9e+55) {
		tmp = (t + (y * (230661.510616 + (y * (27464.7644705 + (y * z)))))) / t_1;
	} else {
		tmp = t_2;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b, c, i)
    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), intent (in) :: i
    real(8) :: t_1
    real(8) :: t_2
    real(8) :: tmp
    t_1 = i + (y * (c + (y * (b + (y * (y + a))))))
    t_2 = (z / y) + (x - (a / (y / x)))
    if (y <= (-1.9d+56)) then
        tmp = t_2
    else if (y <= (-2.75d-14)) then
        tmp = (y * (230661.510616d0 + (y * (27464.7644705d0 + (y * (z + (y * x))))))) / t_1
    else if (y <= 3.9d+55) then
        tmp = (t + (y * (230661.510616d0 + (y * (27464.7644705d0 + (y * z)))))) / t_1
    else
        tmp = t_2
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	double t_1 = i + (y * (c + (y * (b + (y * (y + a))))));
	double t_2 = (z / y) + (x - (a / (y / x)));
	double tmp;
	if (y <= -1.9e+56) {
		tmp = t_2;
	} else if (y <= -2.75e-14) {
		tmp = (y * (230661.510616 + (y * (27464.7644705 + (y * (z + (y * x))))))) / t_1;
	} else if (y <= 3.9e+55) {
		tmp = (t + (y * (230661.510616 + (y * (27464.7644705 + (y * z)))))) / t_1;
	} else {
		tmp = t_2;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b, c, i):
	t_1 = i + (y * (c + (y * (b + (y * (y + a))))))
	t_2 = (z / y) + (x - (a / (y / x)))
	tmp = 0
	if y <= -1.9e+56:
		tmp = t_2
	elif y <= -2.75e-14:
		tmp = (y * (230661.510616 + (y * (27464.7644705 + (y * (z + (y * x))))))) / t_1
	elif y <= 3.9e+55:
		tmp = (t + (y * (230661.510616 + (y * (27464.7644705 + (y * z)))))) / t_1
	else:
		tmp = t_2
	return tmp

Julia

function code(x, y, z, t, a, b, c, i)
	t_1 = Float64(i + Float64(y * Float64(c + Float64(y * Float64(b + Float64(y * Float64(y + a)))))))
	t_2 = Float64(Float64(z / y) + Float64(x - Float64(a / Float64(y / x))))
	tmp = 0.0
	if (y <= -1.9e+56)
		tmp = t_2;
	elseif (y <= -2.75e-14)
		tmp = Float64(Float64(y * Float64(230661.510616 + Float64(y * Float64(27464.7644705 + Float64(y * Float64(z + Float64(y * x))))))) / t_1);
	elseif (y <= 3.9e+55)
		tmp = Float64(Float64(t + Float64(y * Float64(230661.510616 + Float64(y * Float64(27464.7644705 + Float64(y * z)))))) / t_1);
	else
		tmp = t_2;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b, c, i)
	t_1 = i + (y * (c + (y * (b + (y * (y + a))))));
	t_2 = (z / y) + (x - (a / (y / x)));
	tmp = 0.0;
	if (y <= -1.9e+56)
		tmp = t_2;
	elseif (y <= -2.75e-14)
		tmp = (y * (230661.510616 + (y * (27464.7644705 + (y * (z + (y * x))))))) / t_1;
	elseif (y <= 3.9e+55)
		tmp = (t + (y * (230661.510616 + (y * (27464.7644705 + (y * z)))))) / t_1;
	else
		tmp = t_2;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_] := Block[{t$95$1 = N[(i + N[(y * N[(c + N[(y * N[(b + N[(y * N[(y + a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(z / y), $MachinePrecision] + N[(x - N[(a / N[(y / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[y, -1.9e+56], t$95$2, If[LessEqual[y, -2.75e-14], N[(N[(y * N[(230661.510616 + N[(y * N[(27464.7644705 + N[(y * N[(z + N[(y * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision], If[LessEqual[y, 3.9e+55], N[(N[(t + N[(y * N[(230661.510616 + N[(y * N[(27464.7644705 + N[(y * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision], t$95$2]]]]]

Derivation

1. Split input into 3 regimes

2. if y < -1.89999999999999998e56 or 3.90000000000000027e55 < y

   1. Initial program 0.6%

      \[\frac{\left(\left(\left(x \cdot y + z\right) \cdot y + 27464.7644705\right) \cdot y + 230661.510616\right) \cdot y + t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \]
   2. Add Preprocessing

   3. Taylor expanded in y around inf 64.8%

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

      1. +-commutative 64.8%

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

      2. associate--l+ 64.8%

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

      3. associate-/l* 66.8%

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

   5. Simplified 66.8%

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

   if -1.89999999999999998e56 < y < -2.74999999999999996e-14

   1. Initial program 72.1%

      \[\frac{\left(\left(\left(x \cdot y + z\right) \cdot y + 27464.7644705\right) \cdot y + 230661.510616\right) \cdot y + t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \]
   2. Add Preprocessing

   3. Taylor expanded in t around 0 67.6%

      \[\leadsto \color{blue}{\frac{y \cdot \left(230661.510616 + y \cdot \left(27464.7644705 + y \cdot \left(z + x \cdot y\right)\right)\right)}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right)}} \]

   if -2.74999999999999996e-14 < y < 3.90000000000000027e55

   1. Initial program 96.9%

      \[\frac{\left(\left(\left(x \cdot y + z\right) \cdot y + 27464.7644705\right) \cdot y + 230661.510616\right) \cdot y + t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0 90.3%

      \[\leadsto \frac{\left(\color{blue}{y \cdot \left(27464.7644705 + y \cdot z\right)} + 230661.510616\right) \cdot y + t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \]
3. Recombined 3 regimes into one program.

4. Final simplification 79.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -1.9 \cdot 10^{+56}:\\ \;\;\;\;\frac{z}{y} + \left(x - \frac{a}{\frac{y}{x}}\right)\\ \mathbf{elif}\;y \leq -2.75 \cdot 10^{-14}:\\ \;\;\;\;\frac{y \cdot \left(230661.510616 + y \cdot \left(27464.7644705 + y \cdot \left(z + y \cdot x\right)\right)\right)}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(y + a\right)\right)\right)}\\ \mathbf{elif}\;y \leq 3.9 \cdot 10^{+55}:\\ \;\;\;\;\frac{t + y \cdot \left(230661.510616 + y \cdot \left(27464.7644705 + y \cdot z\right)\right)}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(y + a\right)\right)\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{z}{y} + \left(x - \frac{a}{\frac{y}{x}}\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 84.8% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -2.7 \cdot 10^{+58} \lor \neg \left(y \leq 5.2 \cdot 10^{+58}\right):\\ \;\;\;\;\frac{z}{y} + \left(x - \frac{a}{\frac{y}{x}}\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{t + y \cdot \left(230661.510616 + y \cdot \left(27464.7644705 + y \cdot \left(z + y \cdot x\right)\right)\right)}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(y + a\right)\right)\right)}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c i)
 :precision binary64
 (if (or (<= y -2.7e+58) (not (<= y 5.2e+58)))
   (+ (/ z y) (- x (/ a (/ y x))))
   (/
    (+ t (* y (+ 230661.510616 (* y (+ 27464.7644705 (* y (+ z (* y x))))))))
    (+ i (* y (+ c (* y (+ b (* y (+ y a))))))))))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	double tmp;
	if ((y <= -2.7e+58) || !(y <= 5.2e+58)) {
		tmp = (z / y) + (x - (a / (y / x)));
	} else {
		tmp = (t + (y * (230661.510616 + (y * (27464.7644705 + (y * (z + (y * x)))))))) / (i + (y * (c + (y * (b + (y * (y + a)))))));
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b, c, i)
    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), intent (in) :: i
    real(8) :: tmp
    if ((y <= (-2.7d+58)) .or. (.not. (y <= 5.2d+58))) then
        tmp = (z / y) + (x - (a / (y / x)))
    else
        tmp = (t + (y * (230661.510616d0 + (y * (27464.7644705d0 + (y * (z + (y * x)))))))) / (i + (y * (c + (y * (b + (y * (y + 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 i) {
	double tmp;
	if ((y <= -2.7e+58) || !(y <= 5.2e+58)) {
		tmp = (z / y) + (x - (a / (y / x)));
	} else {
		tmp = (t + (y * (230661.510616 + (y * (27464.7644705 + (y * (z + (y * x)))))))) / (i + (y * (c + (y * (b + (y * (y + a)))))));
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b, c, i):
	tmp = 0
	if (y <= -2.7e+58) or not (y <= 5.2e+58):
		tmp = (z / y) + (x - (a / (y / x)))
	else:
		tmp = (t + (y * (230661.510616 + (y * (27464.7644705 + (y * (z + (y * x)))))))) / (i + (y * (c + (y * (b + (y * (y + a)))))))
	return tmp

Julia

function code(x, y, z, t, a, b, c, i)
	tmp = 0.0
	if ((y <= -2.7e+58) || !(y <= 5.2e+58))
		tmp = Float64(Float64(z / y) + Float64(x - Float64(a / Float64(y / x))));
	else
		tmp = Float64(Float64(t + Float64(y * Float64(230661.510616 + Float64(y * Float64(27464.7644705 + Float64(y * Float64(z + Float64(y * x)))))))) / Float64(i + Float64(y * Float64(c + Float64(y * Float64(b + Float64(y * Float64(y + a))))))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b, c, i)
	tmp = 0.0;
	if ((y <= -2.7e+58) || ~((y <= 5.2e+58)))
		tmp = (z / y) + (x - (a / (y / x)));
	else
		tmp = (t + (y * (230661.510616 + (y * (27464.7644705 + (y * (z + (y * x)))))))) / (i + (y * (c + (y * (b + (y * (y + a)))))));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_] := If[Or[LessEqual[y, -2.7e+58], N[Not[LessEqual[y, 5.2e+58]], $MachinePrecision]], N[(N[(z / y), $MachinePrecision] + N[(x - N[(a / N[(y / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(t + N[(y * N[(230661.510616 + N[(y * N[(27464.7644705 + N[(y * N[(z + N[(y * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(i + N[(y * N[(c + N[(y * N[(b + N[(y * N[(y + a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -2.7000000000000001e58 or 5.19999999999999976e58 < y

   1. Initial program 0.6%

      \[\frac{\left(\left(\left(x \cdot y + z\right) \cdot y + 27464.7644705\right) \cdot y + 230661.510616\right) \cdot y + t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \]
   2. Add Preprocessing

   3. Taylor expanded in y around inf 64.8%

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

      1. +-commutative 64.8%

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

      2. associate--l+ 64.8%

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

      3. associate-/l* 66.8%

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

   5. Simplified 66.8%

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

   if -2.7000000000000001e58 < y < 5.19999999999999976e58

   1. Initial program 93.6%

      \[\frac{\left(\left(\left(x \cdot y + z\right) \cdot y + 27464.7644705\right) \cdot y + 230661.510616\right) \cdot y + t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \]
   2. Add Preprocessing
3. Recombined 2 regimes into one program.

4. Final simplification 83.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -2.7 \cdot 10^{+58} \lor \neg \left(y \leq 5.2 \cdot 10^{+58}\right):\\ \;\;\;\;\frac{z}{y} + \left(x - \frac{a}{\frac{y}{x}}\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{t + y \cdot \left(230661.510616 + y \cdot \left(27464.7644705 + y \cdot \left(z + y \cdot x\right)\right)\right)}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(y + a\right)\right)\right)}\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 77.4% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := y \cdot \left(c + y \cdot \left(b + y \cdot \left(y + a\right)\right)\right)\\ t_2 := \frac{z}{y} + \left(x - \frac{a}{\frac{y}{x}}\right)\\ \mathbf{if}\;y \leq -1.38 \cdot 10^{+56}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;y \leq -6 \cdot 10^{-17}:\\ \;\;\;\;\frac{t + y \cdot \left(230661.510616 + y \cdot \left(27464.7644705 + y \cdot z\right)\right)}{t\_1}\\ \mathbf{elif}\;y \leq 5.5 \cdot 10^{+61}:\\ \;\;\;\;\frac{t + y \cdot \left(230661.510616 + y \cdot 27464.7644705\right)}{i + t\_1}\\ \mathbf{else}:\\ \;\;\;\;t\_2\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c i)
 :precision binary64
 (let* ((t_1 (* y (+ c (* y (+ b (* y (+ y a)))))))
        (t_2 (+ (/ z y) (- x (/ a (/ y x))))))
   (if (<= y -1.38e+56)
     t_2
     (if (<= y -6e-17)
       (/ (+ t (* y (+ 230661.510616 (* y (+ 27464.7644705 (* y z)))))) t_1)
       (if (<= y 5.5e+61)
         (/ (+ t (* y (+ 230661.510616 (* y 27464.7644705)))) (+ i t_1))
         t_2)))))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	double t_1 = y * (c + (y * (b + (y * (y + a)))));
	double t_2 = (z / y) + (x - (a / (y / x)));
	double tmp;
	if (y <= -1.38e+56) {
		tmp = t_2;
	} else if (y <= -6e-17) {
		tmp = (t + (y * (230661.510616 + (y * (27464.7644705 + (y * z)))))) / t_1;
	} else if (y <= 5.5e+61) {
		tmp = (t + (y * (230661.510616 + (y * 27464.7644705)))) / (i + t_1);
	} else {
		tmp = t_2;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b, c, i)
    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), intent (in) :: i
    real(8) :: t_1
    real(8) :: t_2
    real(8) :: tmp
    t_1 = y * (c + (y * (b + (y * (y + a)))))
    t_2 = (z / y) + (x - (a / (y / x)))
    if (y <= (-1.38d+56)) then
        tmp = t_2
    else if (y <= (-6d-17)) then
        tmp = (t + (y * (230661.510616d0 + (y * (27464.7644705d0 + (y * z)))))) / t_1
    else if (y <= 5.5d+61) then
        tmp = (t + (y * (230661.510616d0 + (y * 27464.7644705d0)))) / (i + t_1)
    else
        tmp = t_2
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	double t_1 = y * (c + (y * (b + (y * (y + a)))));
	double t_2 = (z / y) + (x - (a / (y / x)));
	double tmp;
	if (y <= -1.38e+56) {
		tmp = t_2;
	} else if (y <= -6e-17) {
		tmp = (t + (y * (230661.510616 + (y * (27464.7644705 + (y * z)))))) / t_1;
	} else if (y <= 5.5e+61) {
		tmp = (t + (y * (230661.510616 + (y * 27464.7644705)))) / (i + t_1);
	} else {
		tmp = t_2;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b, c, i):
	t_1 = y * (c + (y * (b + (y * (y + a)))))
	t_2 = (z / y) + (x - (a / (y / x)))
	tmp = 0
	if y <= -1.38e+56:
		tmp = t_2
	elif y <= -6e-17:
		tmp = (t + (y * (230661.510616 + (y * (27464.7644705 + (y * z)))))) / t_1
	elif y <= 5.5e+61:
		tmp = (t + (y * (230661.510616 + (y * 27464.7644705)))) / (i + t_1)
	else:
		tmp = t_2
	return tmp

Julia

function code(x, y, z, t, a, b, c, i)
	t_1 = Float64(y * Float64(c + Float64(y * Float64(b + Float64(y * Float64(y + a))))))
	t_2 = Float64(Float64(z / y) + Float64(x - Float64(a / Float64(y / x))))
	tmp = 0.0
	if (y <= -1.38e+56)
		tmp = t_2;
	elseif (y <= -6e-17)
		tmp = Float64(Float64(t + Float64(y * Float64(230661.510616 + Float64(y * Float64(27464.7644705 + Float64(y * z)))))) / t_1);
	elseif (y <= 5.5e+61)
		tmp = Float64(Float64(t + Float64(y * Float64(230661.510616 + Float64(y * 27464.7644705)))) / Float64(i + t_1));
	else
		tmp = t_2;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b, c, i)
	t_1 = y * (c + (y * (b + (y * (y + a)))));
	t_2 = (z / y) + (x - (a / (y / x)));
	tmp = 0.0;
	if (y <= -1.38e+56)
		tmp = t_2;
	elseif (y <= -6e-17)
		tmp = (t + (y * (230661.510616 + (y * (27464.7644705 + (y * z)))))) / t_1;
	elseif (y <= 5.5e+61)
		tmp = (t + (y * (230661.510616 + (y * 27464.7644705)))) / (i + t_1);
	else
		tmp = t_2;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_] := Block[{t$95$1 = N[(y * N[(c + N[(y * N[(b + N[(y * N[(y + a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(z / y), $MachinePrecision] + N[(x - N[(a / N[(y / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[y, -1.38e+56], t$95$2, If[LessEqual[y, -6e-17], N[(N[(t + N[(y * N[(230661.510616 + N[(y * N[(27464.7644705 + N[(y * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision], If[LessEqual[y, 5.5e+61], N[(N[(t + N[(y * N[(230661.510616 + N[(y * 27464.7644705), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(i + t$95$1), $MachinePrecision]), $MachinePrecision], t$95$2]]]]]

Derivation

1. Split input into 3 regimes

2. if y < -1.3800000000000001e56 or 5.50000000000000036e61 < y

   1. Initial program 1.6%

      \[\frac{\left(\left(\left(x \cdot y + z\right) \cdot y + 27464.7644705\right) \cdot y + 230661.510616\right) \cdot y + t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \]
   2. Add Preprocessing

   3. Taylor expanded in y around inf 64.9%

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

      1. +-commutative 64.9%

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

      2. associate--l+ 64.9%

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

      3. associate-/l* 66.9%

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

   5. Simplified 66.9%

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

   if -1.3800000000000001e56 < y < -6.00000000000000012e-17

   1. Initial program 72.0%

      \[\frac{\left(\left(\left(x \cdot y + z\right) \cdot y + 27464.7644705\right) \cdot y + 230661.510616\right) \cdot y + t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0 46.7%

      \[\leadsto \frac{\left(\color{blue}{y \cdot \left(27464.7644705 + y \cdot z\right)} + 230661.510616\right) \cdot y + t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \]

   4. Taylor expanded in i around 0 42.0%

      \[\leadsto \color{blue}{\frac{t + y \cdot \left(230661.510616 + y \cdot \left(27464.7644705 + y \cdot z\right)\right)}{y \cdot \left(c + y \cdot \left(b + y \cdot \left(a + y\right)\right)\right)}} \]

   if -6.00000000000000012e-17 < y < 5.50000000000000036e61

   1. Initial program 96.2%

      \[\frac{\left(\left(\left(x \cdot y + z\right) \cdot y + 27464.7644705\right) \cdot y + 230661.510616\right) \cdot y + t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0 85.9%

      \[\leadsto \frac{\left(\color{blue}{27464.7644705 \cdot y} + 230661.510616\right) \cdot y + t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \]
   4. Step-by-step derivation

      1. *-commutative 85.9%

         \[\leadsto \frac{\left(\color{blue}{y \cdot 27464.7644705} + 230661.510616\right) \cdot y + t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \]

   5. Simplified 85.9%

      \[\leadsto \frac{\left(\color{blue}{y \cdot 27464.7644705} + 230661.510616\right) \cdot y + t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \]
3. Recombined 3 regimes into one program.

4. Final simplification 75.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -1.38 \cdot 10^{+56}:\\ \;\;\;\;\frac{z}{y} + \left(x - \frac{a}{\frac{y}{x}}\right)\\ \mathbf{elif}\;y \leq -6 \cdot 10^{-17}:\\ \;\;\;\;\frac{t + y \cdot \left(230661.510616 + y \cdot \left(27464.7644705 + y \cdot z\right)\right)}{y \cdot \left(c + y \cdot \left(b + y \cdot \left(y + a\right)\right)\right)}\\ \mathbf{elif}\;y \leq 5.5 \cdot 10^{+61}:\\ \;\;\;\;\frac{t + y \cdot \left(230661.510616 + y \cdot 27464.7644705\right)}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(y + a\right)\right)\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{z}{y} + \left(x - \frac{a}{\frac{y}{x}}\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 81.5% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -1.45 \cdot 10^{+56} \lor \neg \left(y \leq 4.35 \cdot 10^{+55}\right):\\ \;\;\;\;\frac{z}{y} + \left(x - \frac{a}{\frac{y}{x}}\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{t + y \cdot \left(230661.510616 + y \cdot \left(27464.7644705 + y \cdot z\right)\right)}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(y + a\right)\right)\right)}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c i)
 :precision binary64
 (if (or (<= y -1.45e+56) (not (<= y 4.35e+55)))
   (+ (/ z y) (- x (/ a (/ y x))))
   (/
    (+ t (* y (+ 230661.510616 (* y (+ 27464.7644705 (* y z))))))
    (+ i (* y (+ c (* y (+ b (* y (+ y a))))))))))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	double tmp;
	if ((y <= -1.45e+56) || !(y <= 4.35e+55)) {
		tmp = (z / y) + (x - (a / (y / x)));
	} else {
		tmp = (t + (y * (230661.510616 + (y * (27464.7644705 + (y * z)))))) / (i + (y * (c + (y * (b + (y * (y + a)))))));
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b, c, i)
    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), intent (in) :: i
    real(8) :: tmp
    if ((y <= (-1.45d+56)) .or. (.not. (y <= 4.35d+55))) then
        tmp = (z / y) + (x - (a / (y / x)))
    else
        tmp = (t + (y * (230661.510616d0 + (y * (27464.7644705d0 + (y * z)))))) / (i + (y * (c + (y * (b + (y * (y + 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 i) {
	double tmp;
	if ((y <= -1.45e+56) || !(y <= 4.35e+55)) {
		tmp = (z / y) + (x - (a / (y / x)));
	} else {
		tmp = (t + (y * (230661.510616 + (y * (27464.7644705 + (y * z)))))) / (i + (y * (c + (y * (b + (y * (y + a)))))));
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b, c, i):
	tmp = 0
	if (y <= -1.45e+56) or not (y <= 4.35e+55):
		tmp = (z / y) + (x - (a / (y / x)))
	else:
		tmp = (t + (y * (230661.510616 + (y * (27464.7644705 + (y * z)))))) / (i + (y * (c + (y * (b + (y * (y + a)))))))
	return tmp

Julia

function code(x, y, z, t, a, b, c, i)
	tmp = 0.0
	if ((y <= -1.45e+56) || !(y <= 4.35e+55))
		tmp = Float64(Float64(z / y) + Float64(x - Float64(a / Float64(y / x))));
	else
		tmp = Float64(Float64(t + Float64(y * Float64(230661.510616 + Float64(y * Float64(27464.7644705 + Float64(y * z)))))) / Float64(i + Float64(y * Float64(c + Float64(y * Float64(b + Float64(y * Float64(y + a))))))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b, c, i)
	tmp = 0.0;
	if ((y <= -1.45e+56) || ~((y <= 4.35e+55)))
		tmp = (z / y) + (x - (a / (y / x)));
	else
		tmp = (t + (y * (230661.510616 + (y * (27464.7644705 + (y * z)))))) / (i + (y * (c + (y * (b + (y * (y + a)))))));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_] := If[Or[LessEqual[y, -1.45e+56], N[Not[LessEqual[y, 4.35e+55]], $MachinePrecision]], N[(N[(z / y), $MachinePrecision] + N[(x - N[(a / N[(y / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(t + N[(y * N[(230661.510616 + N[(y * N[(27464.7644705 + N[(y * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(i + N[(y * N[(c + N[(y * N[(b + N[(y * N[(y + a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -1.45000000000000004e56 or 4.34999999999999978e55 < y

   1. Initial program 1.6%

      \[\frac{\left(\left(\left(x \cdot y + z\right) \cdot y + 27464.7644705\right) \cdot y + 230661.510616\right) \cdot y + t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \]
   2. Add Preprocessing

   3. Taylor expanded in y around inf 64.3%

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

      1. +-commutative 64.3%

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

      2. associate--l+ 64.3%

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

      3. associate-/l* 66.2%

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

   5. Simplified 66.2%

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

   if -1.45000000000000004e56 < y < 4.34999999999999978e55

   1. Initial program 93.6%

      \[\frac{\left(\left(\left(x \cdot y + z\right) \cdot y + 27464.7644705\right) \cdot y + 230661.510616\right) \cdot y + t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0 84.4%

      \[\leadsto \frac{\left(\color{blue}{y \cdot \left(27464.7644705 + y \cdot z\right)} + 230661.510616\right) \cdot y + t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \]
3. Recombined 2 regimes into one program.

4. Final simplification 77.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -1.45 \cdot 10^{+56} \lor \neg \left(y \leq 4.35 \cdot 10^{+55}\right):\\ \;\;\;\;\frac{z}{y} + \left(x - \frac{a}{\frac{y}{x}}\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{t + y \cdot \left(230661.510616 + y \cdot \left(27464.7644705 + y \cdot z\right)\right)}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(y + a\right)\right)\right)}\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 76.8% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -1.28 \cdot 10^{+17} \lor \neg \left(y \leq 5.5 \cdot 10^{+61}\right):\\ \;\;\;\;\frac{z}{y} + \left(x - \frac{a}{\frac{y}{x}}\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{t + y \cdot \left(230661.510616 + y \cdot 27464.7644705\right)}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(y + a\right)\right)\right)}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c i)
 :precision binary64
 (if (or (<= y -1.28e+17) (not (<= y 5.5e+61)))
   (+ (/ z y) (- x (/ a (/ y x))))
   (/
    (+ t (* y (+ 230661.510616 (* y 27464.7644705))))
    (+ i (* y (+ c (* y (+ b (* y (+ y a))))))))))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	double tmp;
	if ((y <= -1.28e+17) || !(y <= 5.5e+61)) {
		tmp = (z / y) + (x - (a / (y / x)));
	} else {
		tmp = (t + (y * (230661.510616 + (y * 27464.7644705)))) / (i + (y * (c + (y * (b + (y * (y + a)))))));
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b, c, i)
    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), intent (in) :: i
    real(8) :: tmp
    if ((y <= (-1.28d+17)) .or. (.not. (y <= 5.5d+61))) then
        tmp = (z / y) + (x - (a / (y / x)))
    else
        tmp = (t + (y * (230661.510616d0 + (y * 27464.7644705d0)))) / (i + (y * (c + (y * (b + (y * (y + 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 i) {
	double tmp;
	if ((y <= -1.28e+17) || !(y <= 5.5e+61)) {
		tmp = (z / y) + (x - (a / (y / x)));
	} else {
		tmp = (t + (y * (230661.510616 + (y * 27464.7644705)))) / (i + (y * (c + (y * (b + (y * (y + a)))))));
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b, c, i):
	tmp = 0
	if (y <= -1.28e+17) or not (y <= 5.5e+61):
		tmp = (z / y) + (x - (a / (y / x)))
	else:
		tmp = (t + (y * (230661.510616 + (y * 27464.7644705)))) / (i + (y * (c + (y * (b + (y * (y + a)))))))
	return tmp

Julia

function code(x, y, z, t, a, b, c, i)
	tmp = 0.0
	if ((y <= -1.28e+17) || !(y <= 5.5e+61))
		tmp = Float64(Float64(z / y) + Float64(x - Float64(a / Float64(y / x))));
	else
		tmp = Float64(Float64(t + Float64(y * Float64(230661.510616 + Float64(y * 27464.7644705)))) / Float64(i + Float64(y * Float64(c + Float64(y * Float64(b + Float64(y * Float64(y + a))))))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b, c, i)
	tmp = 0.0;
	if ((y <= -1.28e+17) || ~((y <= 5.5e+61)))
		tmp = (z / y) + (x - (a / (y / x)));
	else
		tmp = (t + (y * (230661.510616 + (y * 27464.7644705)))) / (i + (y * (c + (y * (b + (y * (y + a)))))));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_] := If[Or[LessEqual[y, -1.28e+17], N[Not[LessEqual[y, 5.5e+61]], $MachinePrecision]], N[(N[(z / y), $MachinePrecision] + N[(x - N[(a / N[(y / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(t + N[(y * N[(230661.510616 + N[(y * 27464.7644705), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(i + N[(y * N[(c + N[(y * N[(b + N[(y * N[(y + a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -1.28e17 or 5.50000000000000036e61 < y

   1. Initial program 6.3%

      \[\frac{\left(\left(\left(x \cdot y + z\right) \cdot y + 27464.7644705\right) \cdot y + 230661.510616\right) \cdot y + t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \]
   2. Add Preprocessing

   3. Taylor expanded in y around inf 61.0%

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

      1. +-commutative 61.0%

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

      2. associate--l+ 61.0%

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

      3. associate-/l* 62.8%

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

   5. Simplified 62.8%

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

   if -1.28e17 < y < 5.50000000000000036e61

   1. Initial program 95.7%

      \[\frac{\left(\left(\left(x \cdot y + z\right) \cdot y + 27464.7644705\right) \cdot y + 230661.510616\right) \cdot y + t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0 81.1%

      \[\leadsto \frac{\left(\color{blue}{27464.7644705 \cdot y} + 230661.510616\right) \cdot y + t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \]
   4. Step-by-step derivation

      1. *-commutative 81.1%

         \[\leadsto \frac{\left(\color{blue}{y \cdot 27464.7644705} + 230661.510616\right) \cdot y + t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \]

   5. Simplified 81.1%

      \[\leadsto \frac{\left(\color{blue}{y \cdot 27464.7644705} + 230661.510616\right) \cdot y + t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \]
3. Recombined 2 regimes into one program.

4. Final simplification 73.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -1.28 \cdot 10^{+17} \lor \neg \left(y \leq 5.5 \cdot 10^{+61}\right):\\ \;\;\;\;\frac{z}{y} + \left(x - \frac{a}{\frac{y}{x}}\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{t + y \cdot \left(230661.510616 + y \cdot 27464.7644705\right)}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(y + a\right)\right)\right)}\\ \end{array} \]
5. Add Preprocessing

Alternative 8: 76.0% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -440000000 \lor \neg \left(y \leq 5.5 \cdot 10^{+61}\right):\\ \;\;\;\;\frac{z}{y} + \left(x - \frac{a}{\frac{y}{x}}\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{t + y \cdot 230661.510616}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(y + a\right)\right)\right)}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c i)
 :precision binary64
 (if (or (<= y -440000000.0) (not (<= y 5.5e+61)))
   (+ (/ z y) (- x (/ a (/ y x))))
   (/ (+ t (* y 230661.510616)) (+ i (* y (+ c (* y (+ b (* y (+ y a))))))))))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	double tmp;
	if ((y <= -440000000.0) || !(y <= 5.5e+61)) {
		tmp = (z / y) + (x - (a / (y / x)));
	} else {
		tmp = (t + (y * 230661.510616)) / (i + (y * (c + (y * (b + (y * (y + a)))))));
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b, c, i)
    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), intent (in) :: i
    real(8) :: tmp
    if ((y <= (-440000000.0d0)) .or. (.not. (y <= 5.5d+61))) then
        tmp = (z / y) + (x - (a / (y / x)))
    else
        tmp = (t + (y * 230661.510616d0)) / (i + (y * (c + (y * (b + (y * (y + 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 i) {
	double tmp;
	if ((y <= -440000000.0) || !(y <= 5.5e+61)) {
		tmp = (z / y) + (x - (a / (y / x)));
	} else {
		tmp = (t + (y * 230661.510616)) / (i + (y * (c + (y * (b + (y * (y + a)))))));
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b, c, i):
	tmp = 0
	if (y <= -440000000.0) or not (y <= 5.5e+61):
		tmp = (z / y) + (x - (a / (y / x)))
	else:
		tmp = (t + (y * 230661.510616)) / (i + (y * (c + (y * (b + (y * (y + a)))))))
	return tmp

Julia

function code(x, y, z, t, a, b, c, i)
	tmp = 0.0
	if ((y <= -440000000.0) || !(y <= 5.5e+61))
		tmp = Float64(Float64(z / y) + Float64(x - Float64(a / Float64(y / x))));
	else
		tmp = Float64(Float64(t + Float64(y * 230661.510616)) / Float64(i + Float64(y * Float64(c + Float64(y * Float64(b + Float64(y * Float64(y + a))))))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b, c, i)
	tmp = 0.0;
	if ((y <= -440000000.0) || ~((y <= 5.5e+61)))
		tmp = (z / y) + (x - (a / (y / x)));
	else
		tmp = (t + (y * 230661.510616)) / (i + (y * (c + (y * (b + (y * (y + a)))))));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_] := If[Or[LessEqual[y, -440000000.0], N[Not[LessEqual[y, 5.5e+61]], $MachinePrecision]], N[(N[(z / y), $MachinePrecision] + N[(x - N[(a / N[(y / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(t + N[(y * 230661.510616), $MachinePrecision]), $MachinePrecision] / N[(i + N[(y * N[(c + N[(y * N[(b + N[(y * N[(y + a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -4.4e8 or 5.50000000000000036e61 < y

   1. Initial program 9.6%

      \[\frac{\left(\left(\left(x \cdot y + z\right) \cdot y + 27464.7644705\right) \cdot y + 230661.510616\right) \cdot y + t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \]
   2. Add Preprocessing

   3. Taylor expanded in y around inf 59.3%

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

      1. +-commutative 59.3%

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

      2. associate--l+ 59.3%

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

      3. associate-/l* 61.0%

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

   5. Simplified 61.0%

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

   if -4.4e8 < y < 5.50000000000000036e61

   1. Initial program 96.3%

      \[\frac{\left(\left(\left(x \cdot y + z\right) \cdot y + 27464.7644705\right) \cdot y + 230661.510616\right) \cdot y + t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0 82.6%

      \[\leadsto \frac{\color{blue}{230661.510616 \cdot y} + t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \]
   4. Step-by-step derivation

      1. *-commutative 82.6%

         \[\leadsto \frac{\color{blue}{y \cdot 230661.510616} + t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \]

   5. Simplified 82.6%

      \[\leadsto \frac{\color{blue}{y \cdot 230661.510616} + t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \]
3. Recombined 2 regimes into one program.

4. Final simplification 73.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -440000000 \lor \neg \left(y \leq 5.5 \cdot 10^{+61}\right):\\ \;\;\;\;\frac{z}{y} + \left(x - \frac{a}{\frac{y}{x}}\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{t + y \cdot 230661.510616}{i + y \cdot \left(c + y \cdot \left(b + y \cdot \left(y + a\right)\right)\right)}\\ \end{array} \]
5. Add Preprocessing

Alternative 9: 74.1% accurate, 1.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -10500000 \lor \neg \left(y \leq 5.5 \cdot 10^{+61}\right):\\ \;\;\;\;\frac{z}{y} + \left(x - \frac{a}{\frac{y}{x}}\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{t + y \cdot 230661.510616}{i + y \cdot \left(c + y \cdot b\right)}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c i)
 :precision binary64
 (if (or (<= y -10500000.0) (not (<= y 5.5e+61)))
   (+ (/ z y) (- x (/ a (/ y x))))
   (/ (+ t (* y 230661.510616)) (+ i (* y (+ c (* y b)))))))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	double tmp;
	if ((y <= -10500000.0) || !(y <= 5.5e+61)) {
		tmp = (z / y) + (x - (a / (y / x)));
	} else {
		tmp = (t + (y * 230661.510616)) / (i + (y * (c + (y * b))));
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b, c, i)
    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), intent (in) :: i
    real(8) :: tmp
    if ((y <= (-10500000.0d0)) .or. (.not. (y <= 5.5d+61))) then
        tmp = (z / y) + (x - (a / (y / x)))
    else
        tmp = (t + (y * 230661.510616d0)) / (i + (y * (c + (y * 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 i) {
	double tmp;
	if ((y <= -10500000.0) || !(y <= 5.5e+61)) {
		tmp = (z / y) + (x - (a / (y / x)));
	} else {
		tmp = (t + (y * 230661.510616)) / (i + (y * (c + (y * b))));
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b, c, i):
	tmp = 0
	if (y <= -10500000.0) or not (y <= 5.5e+61):
		tmp = (z / y) + (x - (a / (y / x)))
	else:
		tmp = (t + (y * 230661.510616)) / (i + (y * (c + (y * b))))
	return tmp

Julia

function code(x, y, z, t, a, b, c, i)
	tmp = 0.0
	if ((y <= -10500000.0) || !(y <= 5.5e+61))
		tmp = Float64(Float64(z / y) + Float64(x - Float64(a / Float64(y / x))));
	else
		tmp = Float64(Float64(t + Float64(y * 230661.510616)) / Float64(i + Float64(y * Float64(c + Float64(y * b)))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b, c, i)
	tmp = 0.0;
	if ((y <= -10500000.0) || ~((y <= 5.5e+61)))
		tmp = (z / y) + (x - (a / (y / x)));
	else
		tmp = (t + (y * 230661.510616)) / (i + (y * (c + (y * b))));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_] := If[Or[LessEqual[y, -10500000.0], N[Not[LessEqual[y, 5.5e+61]], $MachinePrecision]], N[(N[(z / y), $MachinePrecision] + N[(x - N[(a / N[(y / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(t + N[(y * 230661.510616), $MachinePrecision]), $MachinePrecision] / N[(i + N[(y * N[(c + N[(y * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -1.05e7 or 5.50000000000000036e61 < y

   1. Initial program 9.6%

      \[\frac{\left(\left(\left(x \cdot y + z\right) \cdot y + 27464.7644705\right) \cdot y + 230661.510616\right) \cdot y + t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \]
   2. Add Preprocessing

   3. Taylor expanded in y around inf 59.3%

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

      1. +-commutative 59.3%

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

      2. associate--l+ 59.3%

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

      3. associate-/l* 61.0%

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

   5. Simplified 61.0%

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

   if -1.05e7 < y < 5.50000000000000036e61

   1. Initial program 96.3%

      \[\frac{\left(\left(\left(x \cdot y + z\right) \cdot y + 27464.7644705\right) \cdot y + 230661.510616\right) \cdot y + t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0 82.6%

      \[\leadsto \frac{\color{blue}{230661.510616 \cdot y} + t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \]
   4. Step-by-step derivation

      1. *-commutative 82.6%

         \[\leadsto \frac{\color{blue}{y \cdot 230661.510616} + t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \]

   5. Simplified 82.6%

      \[\leadsto \frac{\color{blue}{y \cdot 230661.510616} + t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \]

   6. Taylor expanded in y around 0 78.5%

      \[\leadsto \frac{y \cdot 230661.510616 + t}{\left(\color{blue}{b \cdot y} + c\right) \cdot y + i} \]
   7. Step-by-step derivation

      1. *-commutative 78.5%

         \[\leadsto \frac{y \cdot 230661.510616 + t}{\left(\color{blue}{y \cdot b} + c\right) \cdot y + i} \]

   8. Simplified 78.5%

      \[\leadsto \frac{y \cdot 230661.510616 + t}{\left(\color{blue}{y \cdot b} + c\right) \cdot y + i} \]
3. Recombined 2 regimes into one program.

4. Final simplification 70.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -10500000 \lor \neg \left(y \leq 5.5 \cdot 10^{+61}\right):\\ \;\;\;\;\frac{z}{y} + \left(x - \frac{a}{\frac{y}{x}}\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{t + y \cdot 230661.510616}{i + y \cdot \left(c + y \cdot b\right)}\\ \end{array} \]
5. Add Preprocessing

Alternative 10: 61.1% accurate, 1.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -270000 \lor \neg \left(y \leq 2.36 \cdot 10^{-23}\right):\\ \;\;\;\;\frac{z}{y} + \left(x - \frac{a}{\frac{y}{x}}\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{t + y \cdot 230661.510616}{i}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c i)
 :precision binary64
 (if (or (<= y -270000.0) (not (<= y 2.36e-23)))
   (+ (/ z y) (- x (/ a (/ y x))))
   (/ (+ t (* y 230661.510616)) i)))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	double tmp;
	if ((y <= -270000.0) || !(y <= 2.36e-23)) {
		tmp = (z / y) + (x - (a / (y / x)));
	} else {
		tmp = (t + (y * 230661.510616)) / i;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b, c, i)
    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), intent (in) :: i
    real(8) :: tmp
    if ((y <= (-270000.0d0)) .or. (.not. (y <= 2.36d-23))) then
        tmp = (z / y) + (x - (a / (y / x)))
    else
        tmp = (t + (y * 230661.510616d0)) / i
    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 i) {
	double tmp;
	if ((y <= -270000.0) || !(y <= 2.36e-23)) {
		tmp = (z / y) + (x - (a / (y / x)));
	} else {
		tmp = (t + (y * 230661.510616)) / i;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b, c, i):
	tmp = 0
	if (y <= -270000.0) or not (y <= 2.36e-23):
		tmp = (z / y) + (x - (a / (y / x)))
	else:
		tmp = (t + (y * 230661.510616)) / i
	return tmp

Julia

function code(x, y, z, t, a, b, c, i)
	tmp = 0.0
	if ((y <= -270000.0) || !(y <= 2.36e-23))
		tmp = Float64(Float64(z / y) + Float64(x - Float64(a / Float64(y / x))));
	else
		tmp = Float64(Float64(t + Float64(y * 230661.510616)) / i);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b, c, i)
	tmp = 0.0;
	if ((y <= -270000.0) || ~((y <= 2.36e-23)))
		tmp = (z / y) + (x - (a / (y / x)));
	else
		tmp = (t + (y * 230661.510616)) / i;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_] := If[Or[LessEqual[y, -270000.0], N[Not[LessEqual[y, 2.36e-23]], $MachinePrecision]], N[(N[(z / y), $MachinePrecision] + N[(x - N[(a / N[(y / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(t + N[(y * 230661.510616), $MachinePrecision]), $MachinePrecision] / i), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -2.7e5 or 2.3600000000000001e-23 < y

   1. Initial program 15.6%

      \[\frac{\left(\left(\left(x \cdot y + z\right) \cdot y + 27464.7644705\right) \cdot y + 230661.510616\right) \cdot y + t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \]
   2. Add Preprocessing

   3. Taylor expanded in y around inf 53.1%

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

      1. +-commutative 53.1%

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

      2. associate--l+ 53.1%

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

      3. associate-/l* 54.6%

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

   5. Simplified 54.6%

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

   if -2.7e5 < y < 2.3600000000000001e-23

   1. Initial program 99.7%

      \[\frac{\left(\left(\left(x \cdot y + z\right) \cdot y + 27464.7644705\right) \cdot y + 230661.510616\right) \cdot y + t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0 86.7%

      \[\leadsto \frac{\color{blue}{230661.510616 \cdot y} + t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \]
   4. Step-by-step derivation

      1. *-commutative 86.7%

         \[\leadsto \frac{\color{blue}{y \cdot 230661.510616} + t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \]

   5. Simplified 86.7%

      \[\leadsto \frac{\color{blue}{y \cdot 230661.510616} + t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \]

   6. Taylor expanded in i around inf 61.8%

      \[\leadsto \color{blue}{\frac{t + 230661.510616 \cdot y}{i}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 58.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -270000 \lor \neg \left(y \leq 2.36 \cdot 10^{-23}\right):\\ \;\;\;\;\frac{z}{y} + \left(x - \frac{a}{\frac{y}{x}}\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{t + y \cdot 230661.510616}{i}\\ \end{array} \]
5. Add Preprocessing

Alternative 11: 61.2% accurate, 1.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -5700000 \lor \neg \left(y \leq 5.7 \cdot 10^{-24}\right):\\ \;\;\;\;\frac{z}{y} + \left(x - \frac{a}{\frac{y}{x}}\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{t + y \cdot \left(230661.510616 + y \cdot 27464.7644705\right)}{i}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c i)
 :precision binary64
 (if (or (<= y -5700000.0) (not (<= y 5.7e-24)))
   (+ (/ z y) (- x (/ a (/ y x))))
   (/ (+ t (* y (+ 230661.510616 (* y 27464.7644705)))) i)))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	double tmp;
	if ((y <= -5700000.0) || !(y <= 5.7e-24)) {
		tmp = (z / y) + (x - (a / (y / x)));
	} else {
		tmp = (t + (y * (230661.510616 + (y * 27464.7644705)))) / i;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b, c, i)
    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), intent (in) :: i
    real(8) :: tmp
    if ((y <= (-5700000.0d0)) .or. (.not. (y <= 5.7d-24))) then
        tmp = (z / y) + (x - (a / (y / x)))
    else
        tmp = (t + (y * (230661.510616d0 + (y * 27464.7644705d0)))) / i
    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 i) {
	double tmp;
	if ((y <= -5700000.0) || !(y <= 5.7e-24)) {
		tmp = (z / y) + (x - (a / (y / x)));
	} else {
		tmp = (t + (y * (230661.510616 + (y * 27464.7644705)))) / i;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b, c, i):
	tmp = 0
	if (y <= -5700000.0) or not (y <= 5.7e-24):
		tmp = (z / y) + (x - (a / (y / x)))
	else:
		tmp = (t + (y * (230661.510616 + (y * 27464.7644705)))) / i
	return tmp

Julia

function code(x, y, z, t, a, b, c, i)
	tmp = 0.0
	if ((y <= -5700000.0) || !(y <= 5.7e-24))
		tmp = Float64(Float64(z / y) + Float64(x - Float64(a / Float64(y / x))));
	else
		tmp = Float64(Float64(t + Float64(y * Float64(230661.510616 + Float64(y * 27464.7644705)))) / i);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b, c, i)
	tmp = 0.0;
	if ((y <= -5700000.0) || ~((y <= 5.7e-24)))
		tmp = (z / y) + (x - (a / (y / x)));
	else
		tmp = (t + (y * (230661.510616 + (y * 27464.7644705)))) / i;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_] := If[Or[LessEqual[y, -5700000.0], N[Not[LessEqual[y, 5.7e-24]], $MachinePrecision]], N[(N[(z / y), $MachinePrecision] + N[(x - N[(a / N[(y / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(t + N[(y * N[(230661.510616 + N[(y * 27464.7644705), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / i), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -5.7e6 or 5.70000000000000002e-24 < y

   1. Initial program 15.6%

      \[\frac{\left(\left(\left(x \cdot y + z\right) \cdot y + 27464.7644705\right) \cdot y + 230661.510616\right) \cdot y + t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \]
   2. Add Preprocessing

   3. Taylor expanded in y around inf 53.1%

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

      1. +-commutative 53.1%

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

      2. associate--l+ 53.1%

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

      3. associate-/l* 54.6%

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

   5. Simplified 54.6%

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

   if -5.7e6 < y < 5.70000000000000002e-24

   1. Initial program 99.7%

      \[\frac{\left(\left(\left(x \cdot y + z\right) \cdot y + 27464.7644705\right) \cdot y + 230661.510616\right) \cdot y + t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0 86.7%

      \[\leadsto \frac{\left(\color{blue}{27464.7644705 \cdot y} + 230661.510616\right) \cdot y + t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \]
   4. Step-by-step derivation

      1. *-commutative 86.7%

         \[\leadsto \frac{\left(\color{blue}{y \cdot 27464.7644705} + 230661.510616\right) \cdot y + t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \]

   5. Simplified 86.7%

      \[\leadsto \frac{\left(\color{blue}{y \cdot 27464.7644705} + 230661.510616\right) \cdot y + t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \]

   6. Taylor expanded in i around inf 61.8%

      \[\leadsto \color{blue}{\frac{t + y \cdot \left(230661.510616 + 27464.7644705 \cdot y\right)}{i}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 58.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -5700000 \lor \neg \left(y \leq 5.7 \cdot 10^{-24}\right):\\ \;\;\;\;\frac{z}{y} + \left(x - \frac{a}{\frac{y}{x}}\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{t + y \cdot \left(230661.510616 + y \cdot 27464.7644705\right)}{i}\\ \end{array} \]
5. Add Preprocessing

Alternative 12: 70.8% accurate, 1.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -64000000 \lor \neg \left(y \leq 5.5 \cdot 10^{+61}\right):\\ \;\;\;\;\frac{z}{y} + \left(x - \frac{a}{\frac{y}{x}}\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{t + y \cdot 230661.510616}{i + y \cdot c}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c i)
 :precision binary64
 (if (or (<= y -64000000.0) (not (<= y 5.5e+61)))
   (+ (/ z y) (- x (/ a (/ y x))))
   (/ (+ t (* y 230661.510616)) (+ i (* y c)))))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	double tmp;
	if ((y <= -64000000.0) || !(y <= 5.5e+61)) {
		tmp = (z / y) + (x - (a / (y / x)));
	} else {
		tmp = (t + (y * 230661.510616)) / (i + (y * c));
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b, c, i)
    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), intent (in) :: i
    real(8) :: tmp
    if ((y <= (-64000000.0d0)) .or. (.not. (y <= 5.5d+61))) then
        tmp = (z / y) + (x - (a / (y / x)))
    else
        tmp = (t + (y * 230661.510616d0)) / (i + (y * 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 i) {
	double tmp;
	if ((y <= -64000000.0) || !(y <= 5.5e+61)) {
		tmp = (z / y) + (x - (a / (y / x)));
	} else {
		tmp = (t + (y * 230661.510616)) / (i + (y * c));
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b, c, i):
	tmp = 0
	if (y <= -64000000.0) or not (y <= 5.5e+61):
		tmp = (z / y) + (x - (a / (y / x)))
	else:
		tmp = (t + (y * 230661.510616)) / (i + (y * c))
	return tmp

Julia

function code(x, y, z, t, a, b, c, i)
	tmp = 0.0
	if ((y <= -64000000.0) || !(y <= 5.5e+61))
		tmp = Float64(Float64(z / y) + Float64(x - Float64(a / Float64(y / x))));
	else
		tmp = Float64(Float64(t + Float64(y * 230661.510616)) / Float64(i + Float64(y * c)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b, c, i)
	tmp = 0.0;
	if ((y <= -64000000.0) || ~((y <= 5.5e+61)))
		tmp = (z / y) + (x - (a / (y / x)));
	else
		tmp = (t + (y * 230661.510616)) / (i + (y * c));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_] := If[Or[LessEqual[y, -64000000.0], N[Not[LessEqual[y, 5.5e+61]], $MachinePrecision]], N[(N[(z / y), $MachinePrecision] + N[(x - N[(a / N[(y / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(t + N[(y * 230661.510616), $MachinePrecision]), $MachinePrecision] / N[(i + N[(y * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -6.4e7 or 5.50000000000000036e61 < y

   1. Initial program 9.6%

      \[\frac{\left(\left(\left(x \cdot y + z\right) \cdot y + 27464.7644705\right) \cdot y + 230661.510616\right) \cdot y + t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \]
   2. Add Preprocessing

   3. Taylor expanded in y around inf 59.3%

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

      1. +-commutative 59.3%

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

      2. associate--l+ 59.3%

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

      3. associate-/l* 61.0%

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

   5. Simplified 61.0%

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

   if -6.4e7 < y < 5.50000000000000036e61

   1. Initial program 96.3%

      \[\frac{\left(\left(\left(x \cdot y + z\right) \cdot y + 27464.7644705\right) \cdot y + 230661.510616\right) \cdot y + t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0 82.6%

      \[\leadsto \frac{\color{blue}{230661.510616 \cdot y} + t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \]
   4. Step-by-step derivation

      1. *-commutative 82.6%

         \[\leadsto \frac{\color{blue}{y \cdot 230661.510616} + t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \]

   5. Simplified 82.6%

      \[\leadsto \frac{\color{blue}{y \cdot 230661.510616} + t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \]

   6. Taylor expanded in y around 0 70.8%

      \[\leadsto \frac{y \cdot 230661.510616 + t}{\color{blue}{c \cdot y} + i} \]
   7. Step-by-step derivation

      1. *-commutative 70.8%

         \[\leadsto \frac{y \cdot 230661.510616 + t}{\color{blue}{y \cdot c} + i} \]

   8. Simplified 70.8%

      \[\leadsto \frac{y \cdot 230661.510616 + t}{\color{blue}{y \cdot c} + i} \]
3. Recombined 2 regimes into one program.

4. Final simplification 66.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -64000000 \lor \neg \left(y \leq 5.5 \cdot 10^{+61}\right):\\ \;\;\;\;\frac{z}{y} + \left(x - \frac{a}{\frac{y}{x}}\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{t + y \cdot 230661.510616}{i + y \cdot c}\\ \end{array} \]
5. Add Preprocessing

Alternative 13: 54.2% accurate, 1.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -0.022:\\ \;\;\;\;x\\ \mathbf{elif}\;y \leq 10^{-23}:\\ \;\;\;\;\frac{t + y \cdot 230661.510616}{i}\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c i)
 :precision binary64
 (if (<= y -0.022) x (if (<= y 1e-23) (/ (+ t (* y 230661.510616)) i) x)))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	double tmp;
	if (y <= -0.022) {
		tmp = x;
	} else if (y <= 1e-23) {
		tmp = (t + (y * 230661.510616)) / i;
	} else {
		tmp = x;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b, c, i)
    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), intent (in) :: i
    real(8) :: tmp
    if (y <= (-0.022d0)) then
        tmp = x
    else if (y <= 1d-23) then
        tmp = (t + (y * 230661.510616d0)) / i
    else
        tmp = x
    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 i) {
	double tmp;
	if (y <= -0.022) {
		tmp = x;
	} else if (y <= 1e-23) {
		tmp = (t + (y * 230661.510616)) / i;
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b, c, i):
	tmp = 0
	if y <= -0.022:
		tmp = x
	elif y <= 1e-23:
		tmp = (t + (y * 230661.510616)) / i
	else:
		tmp = x
	return tmp

Julia

function code(x, y, z, t, a, b, c, i)
	tmp = 0.0
	if (y <= -0.022)
		tmp = x;
	elseif (y <= 1e-23)
		tmp = Float64(Float64(t + Float64(y * 230661.510616)) / i);
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b, c, i)
	tmp = 0.0;
	if (y <= -0.022)
		tmp = x;
	elseif (y <= 1e-23)
		tmp = (t + (y * 230661.510616)) / i;
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_] := If[LessEqual[y, -0.022], x, If[LessEqual[y, 1e-23], N[(N[(t + N[(y * 230661.510616), $MachinePrecision]), $MachinePrecision] / i), $MachinePrecision], x]]

Derivation

1. Split input into 2 regimes

2. if y < -0.021999999999999999 or 9.9999999999999996e-24 < y

   1. Initial program 18.2%

      \[\frac{\left(\left(\left(x \cdot y + z\right) \cdot y + 27464.7644705\right) \cdot y + 230661.510616\right) \cdot y + t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \]
   2. Add Preprocessing

   3. Taylor expanded in y around inf 40.2%

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

   if -0.021999999999999999 < y < 9.9999999999999996e-24

   1. Initial program 99.7%

      \[\frac{\left(\left(\left(x \cdot y + z\right) \cdot y + 27464.7644705\right) \cdot y + 230661.510616\right) \cdot y + t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0 88.6%

      \[\leadsto \frac{\color{blue}{230661.510616 \cdot y} + t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \]
   4. Step-by-step derivation

      1. *-commutative 88.6%

         \[\leadsto \frac{\color{blue}{y \cdot 230661.510616} + t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \]

   5. Simplified 88.6%

      \[\leadsto \frac{\color{blue}{y \cdot 230661.510616} + t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \]

   6. Taylor expanded in i around inf 63.7%

      \[\leadsto \color{blue}{\frac{t + 230661.510616 \cdot y}{i}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 51.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -0.022:\\ \;\;\;\;x\\ \mathbf{elif}\;y \leq 10^{-23}:\\ \;\;\;\;\frac{t + y \cdot 230661.510616}{i}\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \]
5. Add Preprocessing

Alternative 14: 51.0% accurate, 2.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -7.8 \cdot 10^{-5}:\\ \;\;\;\;x\\ \mathbf{elif}\;y \leq 2.1 \cdot 10^{-23}:\\ \;\;\;\;\frac{t}{i}\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c i)
 :precision binary64
 (if (<= y -7.8e-5) x (if (<= y 2.1e-23) (/ t i) x)))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	double tmp;
	if (y <= -7.8e-5) {
		tmp = x;
	} else if (y <= 2.1e-23) {
		tmp = t / i;
	} else {
		tmp = x;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b, c, i)
    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), intent (in) :: i
    real(8) :: tmp
    if (y <= (-7.8d-5)) then
        tmp = x
    else if (y <= 2.1d-23) then
        tmp = t / i
    else
        tmp = x
    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 i) {
	double tmp;
	if (y <= -7.8e-5) {
		tmp = x;
	} else if (y <= 2.1e-23) {
		tmp = t / i;
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b, c, i):
	tmp = 0
	if y <= -7.8e-5:
		tmp = x
	elif y <= 2.1e-23:
		tmp = t / i
	else:
		tmp = x
	return tmp

Julia

function code(x, y, z, t, a, b, c, i)
	tmp = 0.0
	if (y <= -7.8e-5)
		tmp = x;
	elseif (y <= 2.1e-23)
		tmp = Float64(t / i);
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b, c, i)
	tmp = 0.0;
	if (y <= -7.8e-5)
		tmp = x;
	elseif (y <= 2.1e-23)
		tmp = t / i;
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_] := If[LessEqual[y, -7.8e-5], x, If[LessEqual[y, 2.1e-23], N[(t / i), $MachinePrecision], x]]

Derivation

1. Split input into 2 regimes

2. if y < -7.7999999999999999e-5 or 2.1000000000000001e-23 < y

   1. Initial program 18.2%

      \[\frac{\left(\left(\left(x \cdot y + z\right) \cdot y + 27464.7644705\right) \cdot y + 230661.510616\right) \cdot y + t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \]
   2. Add Preprocessing

   3. Taylor expanded in y around inf 40.2%

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

   if -7.7999999999999999e-5 < y < 2.1000000000000001e-23

   1. Initial program 99.7%

      \[\frac{\left(\left(\left(x \cdot y + z\right) \cdot y + 27464.7644705\right) \cdot y + 230661.510616\right) \cdot y + t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0 55.5%

      \[\leadsto \color{blue}{\frac{t}{i}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 47.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -7.8 \cdot 10^{-5}:\\ \;\;\;\;x\\ \mathbf{elif}\;y \leq 2.1 \cdot 10^{-23}:\\ \;\;\;\;\frac{t}{i}\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \]
5. Add Preprocessing

Alternative 15: 26.2% accurate, 33.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 58.0%

   \[\frac{\left(\left(\left(x \cdot y + z\right) \cdot y + 27464.7644705\right) \cdot y + 230661.510616\right) \cdot y + t}{\left(\left(\left(y + a\right) \cdot y + b\right) \cdot y + c\right) \cdot y + i} \]
2. Add Preprocessing

3. Taylor expanded in y around inf 22.2%

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

4. Final simplification 22.2%

   \[\leadsto x \]
5. Add Preprocessing

Reproduce

herbie shell --seed 2024034 
(FPCore (x y z t a b c i)
  :name "Numeric.SpecFunctions:logGamma from math-functions-0.1.5.2"
  :precision binary64
  (/ (+ (* (+ (* (+ (* (+ (* x y) z) y) 27464.7644705) y) 230661.510616) y) t) (+ (* (+ (* (+ (* (+ y a) y) b) y) c) y) i)))