Development.Shake.Progress:decay from shake-0.15.5

Percentage Accurate: 65.6% → 85.5%

Time: 16.2s

Alternatives: 12

Speedup: 0.9×

Specification

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 65.6% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 85.5% accurate, 0.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{t - a}{b - y}\\ \mathbf{if}\;z \leq -6.2 \cdot 10^{+63}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;z \leq 1.85 \cdot 10^{+89}:\\ \;\;\;\;\frac{y \cdot x + \left(z \cdot t - z \cdot a\right)}{y + z \cdot \left(b - y\right)}\\ \mathbf{else}:\\ \;\;\;\;t\_1 - \frac{y \cdot \frac{t - a}{{\left(b - y\right)}^{2}} - x \cdot \frac{y}{b - y}}{z}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (/ (- t a) (- b y))))
   (if (<= z -6.2e+63)
     t_1
     (if (<= z 1.85e+89)
       (/ (+ (* y x) (- (* z t) (* z a))) (+ y (* z (- b y))))
       (-
        t_1
        (/ (- (* y (/ (- t a) (pow (- b y) 2.0))) (* x (/ y (- b y)))) z))))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = (t - a) / (b - y);
	double tmp;
	if (z <= -6.2e+63) {
		tmp = t_1;
	} else if (z <= 1.85e+89) {
		tmp = ((y * x) + ((z * t) - (z * a))) / (y + (z * (b - y)));
	} else {
		tmp = t_1 - (((y * ((t - a) / pow((b - y), 2.0))) - (x * (y / (b - y)))) / z);
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: t_1
    real(8) :: tmp
    t_1 = (t - a) / (b - y)
    if (z <= (-6.2d+63)) then
        tmp = t_1
    else if (z <= 1.85d+89) then
        tmp = ((y * x) + ((z * t) - (z * a))) / (y + (z * (b - y)))
    else
        tmp = t_1 - (((y * ((t - a) / ((b - y) ** 2.0d0))) - (x * (y / (b - y)))) / z)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = (t - a) / (b - y);
	double tmp;
	if (z <= -6.2e+63) {
		tmp = t_1;
	} else if (z <= 1.85e+89) {
		tmp = ((y * x) + ((z * t) - (z * a))) / (y + (z * (b - y)));
	} else {
		tmp = t_1 - (((y * ((t - a) / Math.pow((b - y), 2.0))) - (x * (y / (b - y)))) / z);
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	t_1 = (t - a) / (b - y)
	tmp = 0
	if z <= -6.2e+63:
		tmp = t_1
	elif z <= 1.85e+89:
		tmp = ((y * x) + ((z * t) - (z * a))) / (y + (z * (b - y)))
	else:
		tmp = t_1 - (((y * ((t - a) / math.pow((b - y), 2.0))) - (x * (y / (b - y)))) / z)
	return tmp

Julia

function code(x, y, z, t, a, b)
	t_1 = Float64(Float64(t - a) / Float64(b - y))
	tmp = 0.0
	if (z <= -6.2e+63)
		tmp = t_1;
	elseif (z <= 1.85e+89)
		tmp = Float64(Float64(Float64(y * x) + Float64(Float64(z * t) - Float64(z * a))) / Float64(y + Float64(z * Float64(b - y))));
	else
		tmp = Float64(t_1 - Float64(Float64(Float64(y * Float64(Float64(t - a) / (Float64(b - y) ^ 2.0))) - Float64(x * Float64(y / Float64(b - y)))) / z));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	t_1 = (t - a) / (b - y);
	tmp = 0.0;
	if (z <= -6.2e+63)
		tmp = t_1;
	elseif (z <= 1.85e+89)
		tmp = ((y * x) + ((z * t) - (z * a))) / (y + (z * (b - y)));
	else
		tmp = t_1 - (((y * ((t - a) / ((b - y) ^ 2.0))) - (x * (y / (b - y)))) / z);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(N[(t - a), $MachinePrecision] / N[(b - y), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[z, -6.2e+63], t$95$1, If[LessEqual[z, 1.85e+89], N[(N[(N[(y * x), $MachinePrecision] + N[(N[(z * t), $MachinePrecision] - N[(z * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(y + N[(z * N[(b - y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(t$95$1 - N[(N[(N[(y * N[(N[(t - a), $MachinePrecision] / N[Power[N[(b - y), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(x * N[(y / N[(b - y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if z < -6.2000000000000001e63

   1. Initial program 42.2%

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

      1. fma-define 42.2%

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

      2. +-commutative 42.2%

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

      3. fma-define 42.2%

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

   3. Simplified 42.2%

      \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(x, y, z \cdot \left(t - a\right)\right)}{\mathsf{fma}\left(z, b - y, y\right)}} \]
   4. Add Preprocessing

   5. Taylor expanded in z around inf 91.7%

      \[\leadsto \color{blue}{\frac{t - a}{b - y}} \]

   if -6.2000000000000001e63 < z < 1.8499999999999999e89

   1. Initial program 88.4%

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

      1. sub-neg 88.4%

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

      2. distribute-lft-in 88.4%

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

   4. Applied egg-rr 88.4%

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

   if 1.8499999999999999e89 < z

   1. Initial program 23.4%

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

      1. fma-define 23.4%

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

      2. +-commutative 23.4%

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

      3. fma-define 23.4%

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

   3. Simplified 23.4%

      \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(x, y, z \cdot \left(t - a\right)\right)}{\mathsf{fma}\left(z, b - y, y\right)}} \]
   4. Add Preprocessing

   5. Taylor expanded in z around -inf 64.2%

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

      1. associate--l+ 64.2%

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

      2. mul-1-neg 64.2%

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

      3. distribute-lft-out-- 64.2%

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

      4. associate-/l* 72.3%

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

      5. associate-/l* 100.0%

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

      6. div-sub 100.0%

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

   7. Simplified 100.0%

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

4. Final simplification 90.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -6.2 \cdot 10^{+63}:\\ \;\;\;\;\frac{t - a}{b - y}\\ \mathbf{elif}\;z \leq 1.85 \cdot 10^{+89}:\\ \;\;\;\;\frac{y \cdot x + \left(z \cdot t - z \cdot a\right)}{y + z \cdot \left(b - y\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{t - a}{b - y} - \frac{y \cdot \frac{t - a}{{\left(b - y\right)}^{2}} - x \cdot \frac{y}{b - y}}{z}\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 86.6% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := y + z \cdot \left(b - y\right)\\ t_2 := b + \frac{y}{z}\\ t_3 := t\_2 - y\\ \mathbf{if}\;z \leq -7.6 \cdot 10^{-31} \lor \neg \left(z \leq 1.2 \cdot 10^{-86}\right):\\ \;\;\;\;\left(\frac{t}{t\_3} + \frac{y \cdot x}{z \cdot t\_3}\right) + \frac{a}{y - t\_2}\\ \mathbf{else}:\\ \;\;\;\;x \cdot \left(\frac{y}{t\_1} + \frac{z \cdot \left(t - a\right)}{x \cdot t\_1}\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (+ y (* z (- b y)))) (t_2 (+ b (/ y z))) (t_3 (- t_2 y)))
   (if (or (<= z -7.6e-31) (not (<= z 1.2e-86)))
     (+ (+ (/ t t_3) (/ (* y x) (* z t_3))) (/ a (- y t_2)))
     (* x (+ (/ y t_1) (/ (* z (- t a)) (* x t_1)))))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = y + (z * (b - y));
	double t_2 = b + (y / z);
	double t_3 = t_2 - y;
	double tmp;
	if ((z <= -7.6e-31) || !(z <= 1.2e-86)) {
		tmp = ((t / t_3) + ((y * x) / (z * t_3))) + (a / (y - t_2));
	} else {
		tmp = x * ((y / t_1) + ((z * (t - a)) / (x * t_1)));
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: t_1
    real(8) :: t_2
    real(8) :: t_3
    real(8) :: tmp
    t_1 = y + (z * (b - y))
    t_2 = b + (y / z)
    t_3 = t_2 - y
    if ((z <= (-7.6d-31)) .or. (.not. (z <= 1.2d-86))) then
        tmp = ((t / t_3) + ((y * x) / (z * t_3))) + (a / (y - t_2))
    else
        tmp = x * ((y / t_1) + ((z * (t - a)) / (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 t_1 = y + (z * (b - y));
	double t_2 = b + (y / z);
	double t_3 = t_2 - y;
	double tmp;
	if ((z <= -7.6e-31) || !(z <= 1.2e-86)) {
		tmp = ((t / t_3) + ((y * x) / (z * t_3))) + (a / (y - t_2));
	} else {
		tmp = x * ((y / t_1) + ((z * (t - a)) / (x * t_1)));
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	t_1 = y + (z * (b - y))
	t_2 = b + (y / z)
	t_3 = t_2 - y
	tmp = 0
	if (z <= -7.6e-31) or not (z <= 1.2e-86):
		tmp = ((t / t_3) + ((y * x) / (z * t_3))) + (a / (y - t_2))
	else:
		tmp = x * ((y / t_1) + ((z * (t - a)) / (x * t_1)))
	return tmp

Julia

function code(x, y, z, t, a, b)
	t_1 = Float64(y + Float64(z * Float64(b - y)))
	t_2 = Float64(b + Float64(y / z))
	t_3 = Float64(t_2 - y)
	tmp = 0.0
	if ((z <= -7.6e-31) || !(z <= 1.2e-86))
		tmp = Float64(Float64(Float64(t / t_3) + Float64(Float64(y * x) / Float64(z * t_3))) + Float64(a / Float64(y - t_2)));
	else
		tmp = Float64(x * Float64(Float64(y / t_1) + Float64(Float64(z * Float64(t - a)) / Float64(x * t_1))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	t_1 = y + (z * (b - y));
	t_2 = b + (y / z);
	t_3 = t_2 - y;
	tmp = 0.0;
	if ((z <= -7.6e-31) || ~((z <= 1.2e-86)))
		tmp = ((t / t_3) + ((y * x) / (z * t_3))) + (a / (y - t_2));
	else
		tmp = x * ((y / t_1) + ((z * (t - a)) / (x * t_1)));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(y + N[(z * N[(b - y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(b + N[(y / z), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(t$95$2 - y), $MachinePrecision]}, If[Or[LessEqual[z, -7.6e-31], N[Not[LessEqual[z, 1.2e-86]], $MachinePrecision]], N[(N[(N[(t / t$95$3), $MachinePrecision] + N[(N[(y * x), $MachinePrecision] / N[(z * t$95$3), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(a / N[(y - t$95$2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(x * N[(N[(y / t$95$1), $MachinePrecision] + N[(N[(z * N[(t - a), $MachinePrecision]), $MachinePrecision] / N[(x * t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]

Derivation

1. Split input into 2 regimes

2. if z < -7.5999999999999999e-31 or 1.20000000000000007e-86 < z

   1. Initial program 57.0%

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

   3. Taylor expanded in z around inf 57.0%

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

   4. Taylor expanded in x around 0 86.4%

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

   if -7.5999999999999999e-31 < z < 1.20000000000000007e-86

   1. Initial program 88.9%

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

      1. fma-define 88.9%

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

      2. +-commutative 88.9%

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

      3. fma-define 88.9%

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

   3. Simplified 88.9%

      \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(x, y, z \cdot \left(t - a\right)\right)}{\mathsf{fma}\left(z, b - y, y\right)}} \]
   4. Add Preprocessing

   5. Taylor expanded in x around inf 93.0%

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

4. Final simplification 89.3%

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

Alternative 3: 84.5% accurate, 0.6× speedup

Math

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

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (or (<= z -3.1e+65) (not (<= z 2.35e+21)))
   (/ (- t a) (- b y))
   (/ (+ (* y x) (- (* z t) (* z a))) (+ y (* z (- b y))))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((z <= -3.1e+65) || !(z <= 2.35e+21)) {
		tmp = (t - a) / (b - y);
	} else {
		tmp = ((y * x) + ((z * t) - (z * a))) / (y + (z * (b - y)));
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: tmp
    if ((z <= (-3.1d+65)) .or. (.not. (z <= 2.35d+21))) then
        tmp = (t - a) / (b - y)
    else
        tmp = ((y * x) + ((z * t) - (z * a))) / (y + (z * (b - y)))
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((z <= -3.1e+65) || !(z <= 2.35e+21)) {
		tmp = (t - a) / (b - y);
	} else {
		tmp = ((y * x) + ((z * t) - (z * a))) / (y + (z * (b - y)));
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	tmp = 0
	if (z <= -3.1e+65) or not (z <= 2.35e+21):
		tmp = (t - a) / (b - y)
	else:
		tmp = ((y * x) + ((z * t) - (z * a))) / (y + (z * (b - y)))
	return tmp

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if ((z <= -3.1e+65) || !(z <= 2.35e+21))
		tmp = Float64(Float64(t - a) / Float64(b - y));
	else
		tmp = Float64(Float64(Float64(y * x) + Float64(Float64(z * t) - Float64(z * a))) / Float64(y + Float64(z * Float64(b - y))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if ((z <= -3.1e+65) || ~((z <= 2.35e+21)))
		tmp = (t - a) / (b - y);
	else
		tmp = ((y * x) + ((z * t) - (z * a))) / (y + (z * (b - y)));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[Or[LessEqual[z, -3.1e+65], N[Not[LessEqual[z, 2.35e+21]], $MachinePrecision]], N[(N[(t - a), $MachinePrecision] / N[(b - y), $MachinePrecision]), $MachinePrecision], N[(N[(N[(y * x), $MachinePrecision] + N[(N[(z * t), $MachinePrecision] - N[(z * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(y + N[(z * N[(b - y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -3.09999999999999991e65 or 2.35e21 < z

   1. Initial program 39.9%

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

      1. fma-define 39.9%

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

      2. +-commutative 39.9%

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

      3. fma-define 39.9%

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

   3. Simplified 39.9%

      \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(x, y, z \cdot \left(t - a\right)\right)}{\mathsf{fma}\left(z, b - y, y\right)}} \]
   4. Add Preprocessing

   5. Taylor expanded in z around inf 86.8%

      \[\leadsto \color{blue}{\frac{t - a}{b - y}} \]

   if -3.09999999999999991e65 < z < 2.35e21

   1. Initial program 89.3%

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

      1. sub-neg 89.3%

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

      2. distribute-lft-in 89.3%

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

   4. Applied egg-rr 89.3%

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

4. Final simplification 88.4%

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

Alternative 4: 84.5% accurate, 0.6× speedup

Math

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

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (or (<= z -1.6e+62) (not (<= z 2.6e+21)))
   (/ (- t a) (- b y))
   (/ (+ (* y x) (* z (- t a))) (+ y (* z (- b y))))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((z <= -1.6e+62) || !(z <= 2.6e+21)) {
		tmp = (t - a) / (b - y);
	} else {
		tmp = ((y * x) + (z * (t - a))) / (y + (z * (b - y)));
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: tmp
    if ((z <= (-1.6d+62)) .or. (.not. (z <= 2.6d+21))) then
        tmp = (t - a) / (b - y)
    else
        tmp = ((y * x) + (z * (t - a))) / (y + (z * (b - y)))
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((z <= -1.6e+62) || !(z <= 2.6e+21)) {
		tmp = (t - a) / (b - y);
	} else {
		tmp = ((y * x) + (z * (t - a))) / (y + (z * (b - y)));
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	tmp = 0
	if (z <= -1.6e+62) or not (z <= 2.6e+21):
		tmp = (t - a) / (b - y)
	else:
		tmp = ((y * x) + (z * (t - a))) / (y + (z * (b - y)))
	return tmp

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if ((z <= -1.6e+62) || !(z <= 2.6e+21))
		tmp = Float64(Float64(t - a) / Float64(b - y));
	else
		tmp = Float64(Float64(Float64(y * x) + Float64(z * Float64(t - a))) / Float64(y + Float64(z * Float64(b - y))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if ((z <= -1.6e+62) || ~((z <= 2.6e+21)))
		tmp = (t - a) / (b - y);
	else
		tmp = ((y * x) + (z * (t - a))) / (y + (z * (b - y)));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[Or[LessEqual[z, -1.6e+62], N[Not[LessEqual[z, 2.6e+21]], $MachinePrecision]], N[(N[(t - a), $MachinePrecision] / N[(b - y), $MachinePrecision]), $MachinePrecision], N[(N[(N[(y * x), $MachinePrecision] + N[(z * N[(t - a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(y + N[(z * N[(b - y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -1.59999999999999992e62 or 2.6e21 < z

   1. Initial program 39.9%

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

      1. fma-define 39.9%

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

      2. +-commutative 39.9%

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

      3. fma-define 39.9%

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

   3. Simplified 39.9%

      \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(x, y, z \cdot \left(t - a\right)\right)}{\mathsf{fma}\left(z, b - y, y\right)}} \]
   4. Add Preprocessing

   5. Taylor expanded in z around inf 86.8%

      \[\leadsto \color{blue}{\frac{t - a}{b - y}} \]

   if -1.59999999999999992e62 < z < 2.6e21

   1. Initial program 89.3%

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

4. Final simplification 88.4%

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

Alternative 5: 76.1% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -8.5 \cdot 10^{-37} \lor \neg \left(z \leq 3.7 \cdot 10^{-99}\right):\\ \;\;\;\;\frac{t - a}{\left(b + \frac{y}{z}\right) - y}\\ \mathbf{else}:\\ \;\;\;\;x + \frac{z \cdot \left(t - a\right)}{y}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (or (<= z -8.5e-37) (not (<= z 3.7e-99)))
   (/ (- t a) (- (+ b (/ y z)) y))
   (+ x (/ (* z (- t a)) y))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((z <= -8.5e-37) || !(z <= 3.7e-99)) {
		tmp = (t - a) / ((b + (y / z)) - y);
	} else {
		tmp = x + ((z * (t - a)) / y);
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: tmp
    if ((z <= (-8.5d-37)) .or. (.not. (z <= 3.7d-99))) then
        tmp = (t - a) / ((b + (y / z)) - y)
    else
        tmp = x + ((z * (t - a)) / y)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((z <= -8.5e-37) || !(z <= 3.7e-99)) {
		tmp = (t - a) / ((b + (y / z)) - y);
	} else {
		tmp = x + ((z * (t - a)) / y);
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	tmp = 0
	if (z <= -8.5e-37) or not (z <= 3.7e-99):
		tmp = (t - a) / ((b + (y / z)) - y)
	else:
		tmp = x + ((z * (t - a)) / y)
	return tmp

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if ((z <= -8.5e-37) || !(z <= 3.7e-99))
		tmp = Float64(Float64(t - a) / Float64(Float64(b + Float64(y / z)) - y));
	else
		tmp = Float64(x + Float64(Float64(z * Float64(t - a)) / y));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if ((z <= -8.5e-37) || ~((z <= 3.7e-99)))
		tmp = (t - a) / ((b + (y / z)) - y);
	else
		tmp = x + ((z * (t - a)) / y);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[Or[LessEqual[z, -8.5e-37], N[Not[LessEqual[z, 3.7e-99]], $MachinePrecision]], N[(N[(t - a), $MachinePrecision] / N[(N[(b + N[(y / z), $MachinePrecision]), $MachinePrecision] - y), $MachinePrecision]), $MachinePrecision], N[(x + N[(N[(z * N[(t - a), $MachinePrecision]), $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -8.5000000000000007e-37 or 3.7e-99 < z

   1. Initial program 58.1%

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

   3. Taylor expanded in z around inf 58.0%

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

   4. Taylor expanded in x around 0 80.0%

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

   if -8.5000000000000007e-37 < z < 3.7e-99

   1. Initial program 89.2%

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

   3. Taylor expanded in z around 0 71.2%

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

   4. Taylor expanded in x around 0 81.9%

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

4. Final simplification 80.8%

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

Alternative 6: 75.3% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (or (<= z -5.8e-33) (not (<= z 8e-33)))
   (/ (- t a) (- b y))
   (+ x (/ (* z (- t a)) y))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((z <= -5.8e-33) || !(z <= 8e-33)) {
		tmp = (t - a) / (b - y);
	} else {
		tmp = x + ((z * (t - a)) / y);
	}
	return tmp;
}

Fortran

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

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((z <= -5.8e-33) || !(z <= 8e-33)) {
		tmp = (t - a) / (b - y);
	} else {
		tmp = x + ((z * (t - a)) / y);
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	tmp = 0
	if (z <= -5.8e-33) or not (z <= 8e-33):
		tmp = (t - a) / (b - y)
	else:
		tmp = x + ((z * (t - a)) / y)
	return tmp

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if ((z <= -5.8e-33) || !(z <= 8e-33))
		tmp = Float64(Float64(t - a) / Float64(b - y));
	else
		tmp = Float64(x + Float64(Float64(z * Float64(t - a)) / y));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if ((z <= -5.8e-33) || ~((z <= 8e-33)))
		tmp = (t - a) / (b - y);
	else
		tmp = x + ((z * (t - a)) / y);
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < -5.80000000000000005e-33 or 8.0000000000000004e-33 < z

   1. Initial program 53.1%

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

      1. fma-define 53.1%

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

      2. +-commutative 53.1%

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

      3. fma-define 53.1%

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

   3. Simplified 53.1%

      \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(x, y, z \cdot \left(t - a\right)\right)}{\mathsf{fma}\left(z, b - y, y\right)}} \]
   4. Add Preprocessing

   5. Taylor expanded in z around inf 79.0%

      \[\leadsto \color{blue}{\frac{t - a}{b - y}} \]

   if -5.80000000000000005e-33 < z < 8.0000000000000004e-33

   1. Initial program 90.0%

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

   3. Taylor expanded in z around 0 68.6%

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

   4. Taylor expanded in x around 0 78.5%

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

4. Final simplification 78.7%

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

Alternative 7: 64.7% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -4.6 \cdot 10^{-36} \lor \neg \left(z \leq 3.7 \cdot 10^{-99}\right):\\ \;\;\;\;\frac{t - a}{b - y}\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (or (<= z -4.6e-36) (not (<= z 3.7e-99))) (/ (- t a) (- b y)) x))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((z <= -4.6e-36) || !(z <= 3.7e-99)) {
		tmp = (t - a) / (b - y);
	} else {
		tmp = x;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: tmp
    if ((z <= (-4.6d-36)) .or. (.not. (z <= 3.7d-99))) then
        tmp = (t - a) / (b - y)
    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 tmp;
	if ((z <= -4.6e-36) || !(z <= 3.7e-99)) {
		tmp = (t - a) / (b - y);
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	tmp = 0
	if (z <= -4.6e-36) or not (z <= 3.7e-99):
		tmp = (t - a) / (b - y)
	else:
		tmp = x
	return tmp

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if ((z <= -4.6e-36) || !(z <= 3.7e-99))
		tmp = Float64(Float64(t - a) / Float64(b - y));
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if ((z <= -4.6e-36) || ~((z <= 3.7e-99)))
		tmp = (t - a) / (b - y);
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[Or[LessEqual[z, -4.6e-36], N[Not[LessEqual[z, 3.7e-99]], $MachinePrecision]], N[(N[(t - a), $MachinePrecision] / N[(b - y), $MachinePrecision]), $MachinePrecision], x]

Derivation

1. Split input into 2 regimes

2. if z < -4.59999999999999993e-36 or 3.7e-99 < z

   1. Initial program 58.1%

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

      1. fma-define 58.1%

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

      2. +-commutative 58.1%

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

      3. fma-define 58.1%

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

   3. Simplified 58.1%

      \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(x, y, z \cdot \left(t - a\right)\right)}{\mathsf{fma}\left(z, b - y, y\right)}} \]
   4. Add Preprocessing

   5. Taylor expanded in z around inf 73.0%

      \[\leadsto \color{blue}{\frac{t - a}{b - y}} \]

   if -4.59999999999999993e-36 < z < 3.7e-99

   1. Initial program 89.2%

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

      1. fma-define 89.2%

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

      2. +-commutative 89.2%

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

      3. fma-define 89.2%

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

   3. Simplified 89.2%

      \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(x, y, z \cdot \left(t - a\right)\right)}{\mathsf{fma}\left(z, b - y, y\right)}} \]
   4. Add Preprocessing

   5. Taylor expanded in z around 0 55.7%

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

4. Final simplification 65.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -4.6 \cdot 10^{-36} \lor \neg \left(z \leq 3.7 \cdot 10^{-99}\right):\\ \;\;\;\;\frac{t - a}{b - y}\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \]
5. Add Preprocessing

Alternative 8: 54.9% accurate, 1.1× speedup

Math

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

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (or (<= y -0.7) (not (<= y 6e-32))) (/ x (- 1.0 z)) (/ (- t a) b)))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((y <= -0.7) || !(y <= 6e-32)) {
		tmp = x / (1.0 - z);
	} else {
		tmp = (t - a) / b;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: tmp
    if ((y <= (-0.7d0)) .or. (.not. (y <= 6d-32))) then
        tmp = x / (1.0d0 - z)
    else
        tmp = (t - 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 tmp;
	if ((y <= -0.7) || !(y <= 6e-32)) {
		tmp = x / (1.0 - z);
	} else {
		tmp = (t - a) / b;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	tmp = 0
	if (y <= -0.7) or not (y <= 6e-32):
		tmp = x / (1.0 - z)
	else:
		tmp = (t - a) / b
	return tmp

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if ((y <= -0.7) || !(y <= 6e-32))
		tmp = Float64(x / Float64(1.0 - z));
	else
		tmp = Float64(Float64(t - a) / b);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if ((y <= -0.7) || ~((y <= 6e-32)))
		tmp = x / (1.0 - z);
	else
		tmp = (t - a) / b;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[Or[LessEqual[y, -0.7], N[Not[LessEqual[y, 6e-32]], $MachinePrecision]], N[(x / N[(1.0 - z), $MachinePrecision]), $MachinePrecision], N[(N[(t - a), $MachinePrecision] / b), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -0.69999999999999996 or 6.0000000000000001e-32 < y

   1. Initial program 56.3%

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

      1. fma-define 56.3%

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

      2. +-commutative 56.3%

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

      3. fma-define 56.3%

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

   3. Simplified 56.3%

      \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(x, y, z \cdot \left(t - a\right)\right)}{\mathsf{fma}\left(z, b - y, y\right)}} \]
   4. Add Preprocessing

   5. Taylor expanded in y around inf 51.0%

      \[\leadsto \color{blue}{\frac{x}{1 + -1 \cdot z}} \]
   6. Step-by-step derivation

      1. mul-1-neg 51.0%

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

      2. unsub-neg 51.0%

         \[\leadsto \frac{x}{\color{blue}{1 - z}} \]

   7. Simplified 51.0%

      \[\leadsto \color{blue}{\frac{x}{1 - z}} \]

   if -0.69999999999999996 < y < 6.0000000000000001e-32

   1. Initial program 86.4%

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

      1. fma-define 86.3%

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

      2. +-commutative 86.3%

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

      3. fma-define 86.3%

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

   3. Simplified 86.3%

      \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(x, y, z \cdot \left(t - a\right)\right)}{\mathsf{fma}\left(z, b - y, y\right)}} \]
   4. Add Preprocessing

   5. Taylor expanded in y around 0 55.3%

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

4. Final simplification 53.1%

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

Alternative 9: 45.4% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -1.15 \cdot 10^{-38} \lor \neg \left(z \leq 2.3 \cdot 10^{+22}\right):\\ \;\;\;\;\frac{t}{b - y}\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{1 - z}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (or (<= z -1.15e-38) (not (<= z 2.3e+22))) (/ t (- b y)) (/ x (- 1.0 z))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((z <= -1.15e-38) || !(z <= 2.3e+22)) {
		tmp = t / (b - y);
	} else {
		tmp = x / (1.0 - z);
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: tmp
    if ((z <= (-1.15d-38)) .or. (.not. (z <= 2.3d+22))) then
        tmp = t / (b - y)
    else
        tmp = x / (1.0d0 - z)
    end if
    code = tmp
end function

Java

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

Python

def code(x, y, z, t, a, b):
	tmp = 0
	if (z <= -1.15e-38) or not (z <= 2.3e+22):
		tmp = t / (b - y)
	else:
		tmp = x / (1.0 - z)
	return tmp

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if ((z <= -1.15e-38) || !(z <= 2.3e+22))
		tmp = Float64(t / Float64(b - y));
	else
		tmp = Float64(x / Float64(1.0 - z));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if ((z <= -1.15e-38) || ~((z <= 2.3e+22)))
		tmp = t / (b - y);
	else
		tmp = x / (1.0 - z);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[Or[LessEqual[z, -1.15e-38], N[Not[LessEqual[z, 2.3e+22]], $MachinePrecision]], N[(t / N[(b - y), $MachinePrecision]), $MachinePrecision], N[(x / N[(1.0 - z), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -1.15000000000000001e-38 or 2.3000000000000002e22 < z

   1. Initial program 49.1%

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

      1. fma-define 49.1%

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

      2. +-commutative 49.1%

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

      3. fma-define 49.1%

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

   3. Simplified 49.1%

      \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(x, y, z \cdot \left(t - a\right)\right)}{\mathsf{fma}\left(z, b - y, y\right)}} \]
   4. Add Preprocessing

   5. Taylor expanded in t around inf 27.6%

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

   6. Taylor expanded in z around inf 51.0%

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

   if -1.15000000000000001e-38 < z < 2.3000000000000002e22

   1. Initial program 88.5%

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

      1. fma-define 88.5%

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

      2. +-commutative 88.5%

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

      3. fma-define 88.5%

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

   3. Simplified 88.5%

      \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(x, y, z \cdot \left(t - a\right)\right)}{\mathsf{fma}\left(z, b - y, y\right)}} \]
   4. Add Preprocessing

   5. Taylor expanded in y around inf 49.5%

      \[\leadsto \color{blue}{\frac{x}{1 + -1 \cdot z}} \]
   6. Step-by-step derivation

      1. mul-1-neg 49.5%

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

      2. unsub-neg 49.5%

         \[\leadsto \frac{x}{\color{blue}{1 - z}} \]

   7. Simplified 49.5%

      \[\leadsto \color{blue}{\frac{x}{1 - z}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 50.2%

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

Alternative 10: 45.3% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -1.55 \cdot 10^{-37} \lor \neg \left(z \leq 6.5 \cdot 10^{-37}\right):\\ \;\;\;\;\frac{t}{b - y}\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (or (<= z -1.55e-37) (not (<= z 6.5e-37))) (/ t (- b y)) x))

C

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

Fortran

real(8) function code(x, y, z, t, a, b)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: tmp
    if ((z <= (-1.55d-37)) .or. (.not. (z <= 6.5d-37))) then
        tmp = t / (b - y)
    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 tmp;
	if ((z <= -1.55e-37) || !(z <= 6.5e-37)) {
		tmp = t / (b - y);
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	tmp = 0
	if (z <= -1.55e-37) or not (z <= 6.5e-37):
		tmp = t / (b - y)
	else:
		tmp = x
	return tmp

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[Or[LessEqual[z, -1.55e-37], N[Not[LessEqual[z, 6.5e-37]], $MachinePrecision]], N[(t / N[(b - y), $MachinePrecision]), $MachinePrecision], x]

Derivation

1. Split input into 2 regimes

2. if z < -1.54999999999999997e-37 or 6.5000000000000001e-37 < z

   1. Initial program 53.8%

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

      1. fma-define 53.8%

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

      2. +-commutative 53.8%

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

      3. fma-define 53.8%

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

   3. Simplified 53.8%

      \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(x, y, z \cdot \left(t - a\right)\right)}{\mathsf{fma}\left(z, b - y, y\right)}} \]
   4. Add Preprocessing

   5. Taylor expanded in t around inf 28.9%

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

   6. Taylor expanded in z around inf 46.8%

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

   if -1.54999999999999997e-37 < z < 6.5000000000000001e-37

   1. Initial program 89.8%

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

      1. fma-define 89.8%

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

      2. +-commutative 89.8%

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

      3. fma-define 89.8%

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

   3. Simplified 89.8%

      \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(x, y, z \cdot \left(t - a\right)\right)}{\mathsf{fma}\left(z, b - y, y\right)}} \]
   4. Add Preprocessing

   5. Taylor expanded in z around 0 52.4%

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

4. Final simplification 49.4%

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

Alternative 11: 37.5% accurate, 1.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -2.05 \cdot 10^{-34} \lor \neg \left(z \leq 6.8 \cdot 10^{-35}\right):\\ \;\;\;\;\frac{t}{b}\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (or (<= z -2.05e-34) (not (<= z 6.8e-35))) (/ t b) x))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((z <= -2.05e-34) || !(z <= 6.8e-35)) {
		tmp = t / b;
	} else {
		tmp = x;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: tmp
    if ((z <= (-2.05d-34)) .or. (.not. (z <= 6.8d-35))) then
        tmp = t / b
    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 tmp;
	if ((z <= -2.05e-34) || !(z <= 6.8e-35)) {
		tmp = t / b;
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	tmp = 0
	if (z <= -2.05e-34) or not (z <= 6.8e-35):
		tmp = t / b
	else:
		tmp = x
	return tmp

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if ((z <= -2.05e-34) || !(z <= 6.8e-35))
		tmp = Float64(t / b);
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if ((z <= -2.05e-34) || ~((z <= 6.8e-35)))
		tmp = t / b;
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[Or[LessEqual[z, -2.05e-34], N[Not[LessEqual[z, 6.8e-35]], $MachinePrecision]], N[(t / b), $MachinePrecision], x]

Derivation

1. Split input into 2 regimes

2. if z < -2.0500000000000002e-34 or 6.8000000000000005e-35 < z

   1. Initial program 53.8%

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

      1. fma-define 53.8%

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

      2. +-commutative 53.8%

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

      3. fma-define 53.8%

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

   3. Simplified 53.8%

      \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(x, y, z \cdot \left(t - a\right)\right)}{\mathsf{fma}\left(z, b - y, y\right)}} \]
   4. Add Preprocessing

   5. Taylor expanded in t around inf 28.9%

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

   6. Taylor expanded in y around 0 31.7%

      \[\leadsto \color{blue}{\frac{t}{b}} \]

   if -2.0500000000000002e-34 < z < 6.8000000000000005e-35

   1. Initial program 89.8%

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

      1. fma-define 89.8%

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

      2. +-commutative 89.8%

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

      3. fma-define 89.8%

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

   3. Simplified 89.8%

      \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(x, y, z \cdot \left(t - a\right)\right)}{\mathsf{fma}\left(z, b - y, y\right)}} \]
   4. Add Preprocessing

   5. Taylor expanded in z around 0 52.4%

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

4. Final simplification 41.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -2.05 \cdot 10^{-34} \lor \neg \left(z \leq 6.8 \cdot 10^{-35}\right):\\ \;\;\;\;\frac{t}{b}\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \]
5. Add Preprocessing

Alternative 12: 25.8% accurate, 17.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 71.0%

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

   1. fma-define 71.0%

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

   2. +-commutative 71.0%

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

   3. fma-define 71.0%

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

3. Simplified 71.0%

   \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(x, y, z \cdot \left(t - a\right)\right)}{\mathsf{fma}\left(z, b - y, y\right)}} \]
4. Add Preprocessing

5. Taylor expanded in z around 0 27.8%

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

Developer Target 1: 73.1% accurate, 0.7× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Reproduce

herbie shell --seed 2024185 
(FPCore (x y z t a b)
  :name "Development.Shake.Progress:decay from shake-0.15.5"
  :precision binary64

  :alt
  (! :herbie-platform default (- (/ (+ (* z t) (* y x)) (+ y (* z (- b y)))) (/ a (+ (- b y) (/ y z)))))

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