Diagrams.Solve.Tridiagonal:solveTriDiagonal from diagrams-solve-0.1, A

Percentage Accurate: 85.7% → 90.4%

Time: 9.4s

Alternatives: 6

Speedup: 0.7×

Specification

Math

\[\begin{array}{l} \\ \frac{x - y \cdot z}{t - a \cdot z} \end{array} \]

FPCore

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

C

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

Fortran

real(8) function code(x, y, z, t, a)
    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
    code = (x - (y * z)) / (t - (a * z))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 85.7% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{x - y \cdot z}{t - a \cdot z} \end{array} \]

FPCore

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

C

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

Fortran

real(8) function code(x, y, z, t, a)
    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
    code = (x - (y * z)) / (t - (a * z))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 90.4% accurate, 0.7× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (or (<= z -6.8e+156) (not (<= z 3e+77)))
   (/ (- y (/ x z)) a)
   (/ (- x (* z y)) (- t (* z a)))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((z <= -6.8e+156) || !(z <= 3e+77)) {
		tmp = (y - (x / z)) / a;
	} else {
		tmp = (x - (z * y)) / (t - (z * a));
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a)
    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) :: tmp
    if ((z <= (-6.8d+156)) .or. (.not. (z <= 3d+77))) then
        tmp = (y - (x / z)) / a
    else
        tmp = (x - (z * y)) / (t - (z * a))
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((z <= -6.8e+156) || !(z <= 3e+77)) {
		tmp = (y - (x / z)) / a;
	} else {
		tmp = (x - (z * y)) / (t - (z * a));
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	tmp = 0
	if (z <= -6.8e+156) or not (z <= 3e+77):
		tmp = (y - (x / z)) / a
	else:
		tmp = (x - (z * y)) / (t - (z * a))
	return tmp

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if ((z <= -6.8e+156) || !(z <= 3e+77))
		tmp = Float64(Float64(y - Float64(x / z)) / a);
	else
		tmp = Float64(Float64(x - Float64(z * y)) / Float64(t - Float64(z * a)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if ((z <= -6.8e+156) || ~((z <= 3e+77)))
		tmp = (y - (x / z)) / a;
	else
		tmp = (x - (z * y)) / (t - (z * a));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := If[Or[LessEqual[z, -6.8e+156], N[Not[LessEqual[z, 3e+77]], $MachinePrecision]], N[(N[(y - N[(x / z), $MachinePrecision]), $MachinePrecision] / a), $MachinePrecision], N[(N[(x - N[(z * y), $MachinePrecision]), $MachinePrecision] / N[(t - N[(z * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -6.8000000000000002e156 or 2.9999999999999998e77 < z

   1. Initial program 55.1%

      \[\frac{x - y \cdot z}{t - a \cdot z} \]
   2. Step-by-step derivation

      1. sub-neg 55.1%

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

      2. +-commutative 55.1%

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

      3. neg-sub0 55.1%

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

      4. associate-+l- 55.1%

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

      5. sub0-neg 55.1%

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

      6. neg-mul-1 55.1%

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

      7. sub-neg 55.1%

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

      8. +-commutative 55.1%

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

      9. neg-sub0 55.1%

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

      10. associate-+l- 55.1%

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

      11. sub0-neg 55.1%

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

      12. neg-mul-1 55.1%

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

      13. times-frac 55.1%

          \[\leadsto \color{blue}{\frac{-1}{-1} \cdot \frac{y \cdot z - x}{a \cdot z - t}} \]

      14. metadata-eval 55.1%

          \[\leadsto \color{blue}{1} \cdot \frac{y \cdot z - x}{a \cdot z - t} \]

      15. *-lft-identity 55.1%

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

      16. *-commutative 55.1%

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

   3. Simplified 55.1%

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

   4. Taylor expanded in a around inf 44.6%

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

      1. *-commutative 44.6%

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

   6. Simplified 44.6%

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

   7. Taylor expanded in z around 0 79.2%

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

      1. +-commutative 79.2%

         \[\leadsto \color{blue}{\frac{y}{a} + -1 \cdot \frac{x}{a \cdot z}} \]

      2. mul-1-neg 79.2%

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

      3. unsub-neg 79.2%

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

   9. Simplified 79.2%

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

   10. Taylor expanded in a around 0 88.2%

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

   if -6.8000000000000002e156 < z < 2.9999999999999998e77

   1. Initial program 92.9%

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

4. Final simplification 91.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -6.8 \cdot 10^{+156} \lor \neg \left(z \leq 3 \cdot 10^{+77}\right):\\ \;\;\;\;\frac{y - \frac{x}{z}}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{x - z \cdot y}{t - z \cdot a}\\ \end{array} \]

Alternative 2: 65.1% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (or (<= z -2e-8) (not (<= z 1.36e-43))) (/ y (- a (/ t z))) (/ x t)))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((z <= -2e-8) || !(z <= 1.36e-43)) {
		tmp = y / (a - (t / z));
	} else {
		tmp = x / t;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a)
    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) :: tmp
    if ((z <= (-2d-8)) .or. (.not. (z <= 1.36d-43))) then
        tmp = y / (a - (t / z))
    else
        tmp = x / t
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((z <= -2e-8) || !(z <= 1.36e-43)) {
		tmp = y / (a - (t / z));
	} else {
		tmp = x / t;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	tmp = 0
	if (z <= -2e-8) or not (z <= 1.36e-43):
		tmp = y / (a - (t / z))
	else:
		tmp = x / t
	return tmp

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if ((z <= -2e-8) || !(z <= 1.36e-43))
		tmp = Float64(y / Float64(a - Float64(t / z)));
	else
		tmp = Float64(x / t);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if ((z <= -2e-8) || ~((z <= 1.36e-43)))
		tmp = y / (a - (t / z));
	else
		tmp = x / t;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := If[Or[LessEqual[z, -2e-8], N[Not[LessEqual[z, 1.36e-43]], $MachinePrecision]], N[(y / N[(a - N[(t / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(x / t), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -2e-8 or 1.36000000000000007e-43 < z

   1. Initial program 68.6%

      \[\frac{x - y \cdot z}{t - a \cdot z} \]
   2. Step-by-step derivation

      1. sub-neg 68.6%

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

      2. +-commutative 68.6%

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

      3. neg-sub0 68.6%

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

      4. associate-+l- 68.6%

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

      5. sub0-neg 68.6%

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

      6. neg-mul-1 68.6%

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

      7. sub-neg 68.6%

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

      8. +-commutative 68.6%

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

      9. neg-sub0 68.6%

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

      10. associate-+l- 68.6%

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

      11. sub0-neg 68.6%

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

      12. neg-mul-1 68.6%

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

      13. times-frac 68.6%

          \[\leadsto \color{blue}{\frac{-1}{-1} \cdot \frac{y \cdot z - x}{a \cdot z - t}} \]

      14. metadata-eval 68.6%

          \[\leadsto \color{blue}{1} \cdot \frac{y \cdot z - x}{a \cdot z - t} \]

      15. *-lft-identity 68.6%

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

      16. *-commutative 68.6%

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

   3. Simplified 68.6%

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

      1. clear-num 68.5%

         \[\leadsto \color{blue}{\frac{1}{\frac{z \cdot a - t}{y \cdot z - x}}} \]

      2. inv-pow 68.5%

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

   5. Applied egg-rr 68.5%

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

   6. Taylor expanded in a around 0 67.0%

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

      1. +-commutative 67.0%

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

      2. mul-1-neg 67.0%

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

      3. unsub-neg 67.0%

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

   8. Simplified 67.0%

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

   9. Taylor expanded in y around inf 74.1%

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

   if -2e-8 < z < 1.36000000000000007e-43

   1. Initial program 99.8%

      \[\frac{x - y \cdot z}{t - a \cdot z} \]
   2. Step-by-step derivation

      1. sub-neg 99.8%

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

      2. +-commutative 99.8%

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

      3. neg-sub0 99.8%

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

      4. associate-+l- 99.8%

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

      5. sub0-neg 99.8%

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

      6. neg-mul-1 99.8%

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

      7. sub-neg 99.8%

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

      8. +-commutative 99.8%

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

      9. neg-sub0 99.8%

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

      10. associate-+l- 99.8%

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

      11. sub0-neg 99.8%

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

      12. neg-mul-1 99.8%

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

      13. times-frac 99.8%

          \[\leadsto \color{blue}{\frac{-1}{-1} \cdot \frac{y \cdot z - x}{a \cdot z - t}} \]

      14. metadata-eval 99.8%

          \[\leadsto \color{blue}{1} \cdot \frac{y \cdot z - x}{a \cdot z - t} \]

      15. *-lft-identity 99.8%

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

      16. *-commutative 99.8%

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

   3. Simplified 99.8%

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

   4. Taylor expanded in z around 0 64.4%

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

4. Final simplification 70.0%

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

Alternative 3: 72.4% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -360000 \lor \neg \left(z \leq 7 \cdot 10^{-44}\right):\\ \;\;\;\;\frac{y}{a - \frac{t}{z}}\\ \mathbf{else}:\\ \;\;\;\;\frac{x - z \cdot y}{t}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (or (<= z -360000.0) (not (<= z 7e-44)))
   (/ y (- a (/ t z)))
   (/ (- x (* z y)) t)))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((z <= -360000.0) || !(z <= 7e-44)) {
		tmp = y / (a - (t / z));
	} else {
		tmp = (x - (z * y)) / t;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a)
    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) :: tmp
    if ((z <= (-360000.0d0)) .or. (.not. (z <= 7d-44))) then
        tmp = y / (a - (t / z))
    else
        tmp = (x - (z * y)) / t
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((z <= -360000.0) || !(z <= 7e-44)) {
		tmp = y / (a - (t / z));
	} else {
		tmp = (x - (z * y)) / t;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	tmp = 0
	if (z <= -360000.0) or not (z <= 7e-44):
		tmp = y / (a - (t / z))
	else:
		tmp = (x - (z * y)) / t
	return tmp

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if ((z <= -360000.0) || !(z <= 7e-44))
		tmp = Float64(y / Float64(a - Float64(t / z)));
	else
		tmp = Float64(Float64(x - Float64(z * y)) / t);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if ((z <= -360000.0) || ~((z <= 7e-44)))
		tmp = y / (a - (t / z));
	else
		tmp = (x - (z * y)) / t;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := If[Or[LessEqual[z, -360000.0], N[Not[LessEqual[z, 7e-44]], $MachinePrecision]], N[(y / N[(a - N[(t / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(x - N[(z * y), $MachinePrecision]), $MachinePrecision] / t), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -3.6e5 or 6.9999999999999995e-44 < z

   1. Initial program 67.7%

      \[\frac{x - y \cdot z}{t - a \cdot z} \]
   2. Step-by-step derivation

      1. sub-neg 67.7%

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

      2. +-commutative 67.7%

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

      3. neg-sub0 67.7%

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

      4. associate-+l- 67.7%

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

      5. sub0-neg 67.7%

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

      6. neg-mul-1 67.7%

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

      7. sub-neg 67.7%

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

      8. +-commutative 67.7%

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

      9. neg-sub0 67.7%

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

      10. associate-+l- 67.7%

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

      11. sub0-neg 67.7%

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

      12. neg-mul-1 67.7%

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

      13. times-frac 67.7%

          \[\leadsto \color{blue}{\frac{-1}{-1} \cdot \frac{y \cdot z - x}{a \cdot z - t}} \]

      14. metadata-eval 67.7%

          \[\leadsto \color{blue}{1} \cdot \frac{y \cdot z - x}{a \cdot z - t} \]

      15. *-lft-identity 67.7%

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

      16. *-commutative 67.7%

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

   3. Simplified 67.7%

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

      1. clear-num 67.7%

         \[\leadsto \color{blue}{\frac{1}{\frac{z \cdot a - t}{y \cdot z - x}}} \]

      2. inv-pow 67.7%

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

   5. Applied egg-rr 67.7%

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

   6. Taylor expanded in a around 0 66.0%

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

      1. +-commutative 66.0%

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

      2. mul-1-neg 66.0%

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

      3. unsub-neg 66.0%

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

   8. Simplified 66.0%

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

   9. Taylor expanded in y around inf 74.1%

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

   if -3.6e5 < z < 6.9999999999999995e-44

   1. Initial program 99.8%

      \[\frac{x - y \cdot z}{t - a \cdot z} \]
   2. Step-by-step derivation

      1. sub-neg 99.8%

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

      2. +-commutative 99.8%

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

      3. neg-sub0 99.8%

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

      4. associate-+l- 99.8%

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

      5. sub0-neg 99.8%

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

      6. neg-mul-1 99.8%

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

      7. sub-neg 99.8%

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

      8. +-commutative 99.8%

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

      9. neg-sub0 99.8%

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

      10. associate-+l- 99.8%

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

      11. sub0-neg 99.8%

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

      12. neg-mul-1 99.8%

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

      13. times-frac 99.8%

          \[\leadsto \color{blue}{\frac{-1}{-1} \cdot \frac{y \cdot z - x}{a \cdot z - t}} \]

      14. metadata-eval 99.8%

          \[\leadsto \color{blue}{1} \cdot \frac{y \cdot z - x}{a \cdot z - t} \]

      15. *-lft-identity 99.8%

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

      16. *-commutative 99.8%

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

   3. Simplified 99.8%

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

   4. Taylor expanded in a around 0 78.1%

      \[\leadsto \color{blue}{-1 \cdot \frac{y \cdot z - x}{t}} \]
   5. Step-by-step derivation

      1. associate-*r/ 78.1%

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

      2. neg-mul-1 78.1%

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

      3. neg-sub0 78.1%

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

      4. sub-neg 78.1%

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

      5. +-commutative 78.1%

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

      6. associate--r+ 78.1%

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

      7. neg-sub0 78.1%

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

      8. remove-double-neg 78.1%

         \[\leadsto \frac{\color{blue}{x} - y \cdot z}{t} \]

      9. *-commutative 78.1%

         \[\leadsto \frac{x - \color{blue}{z \cdot y}}{t} \]

   6. Simplified 78.1%

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

4. Final simplification 75.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -360000 \lor \neg \left(z \leq 7 \cdot 10^{-44}\right):\\ \;\;\;\;\frac{y}{a - \frac{t}{z}}\\ \mathbf{else}:\\ \;\;\;\;\frac{x - z \cdot y}{t}\\ \end{array} \]

Alternative 4: 72.1% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -4.5 \cdot 10^{+14}:\\ \;\;\;\;\frac{y - \frac{x}{z}}{a}\\ \mathbf{elif}\;z \leq 2.2 \cdot 10^{-44}:\\ \;\;\;\;\frac{x - z \cdot y}{t}\\ \mathbf{else}:\\ \;\;\;\;\frac{y}{a - \frac{t}{z}}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= z -4.5e+14)
   (/ (- y (/ x z)) a)
   (if (<= z 2.2e-44) (/ (- x (* z y)) t) (/ y (- a (/ t z))))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (z <= -4.5e+14) {
		tmp = (y - (x / z)) / a;
	} else if (z <= 2.2e-44) {
		tmp = (x - (z * y)) / t;
	} else {
		tmp = y / (a - (t / z));
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a)
    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) :: tmp
    if (z <= (-4.5d+14)) then
        tmp = (y - (x / z)) / a
    else if (z <= 2.2d-44) then
        tmp = (x - (z * y)) / t
    else
        tmp = y / (a - (t / z))
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (z <= -4.5e+14) {
		tmp = (y - (x / z)) / a;
	} else if (z <= 2.2e-44) {
		tmp = (x - (z * y)) / t;
	} else {
		tmp = y / (a - (t / z));
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	tmp = 0
	if z <= -4.5e+14:
		tmp = (y - (x / z)) / a
	elif z <= 2.2e-44:
		tmp = (x - (z * y)) / t
	else:
		tmp = y / (a - (t / z))
	return tmp

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if (z <= -4.5e+14)
		tmp = Float64(Float64(y - Float64(x / z)) / a);
	elseif (z <= 2.2e-44)
		tmp = Float64(Float64(x - Float64(z * y)) / t);
	else
		tmp = Float64(y / Float64(a - Float64(t / z)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if (z <= -4.5e+14)
		tmp = (y - (x / z)) / a;
	elseif (z <= 2.2e-44)
		tmp = (x - (z * y)) / t;
	else
		tmp = y / (a - (t / z));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := If[LessEqual[z, -4.5e+14], N[(N[(y - N[(x / z), $MachinePrecision]), $MachinePrecision] / a), $MachinePrecision], If[LessEqual[z, 2.2e-44], N[(N[(x - N[(z * y), $MachinePrecision]), $MachinePrecision] / t), $MachinePrecision], N[(y / N[(a - N[(t / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if z < -4.5e14

   1. Initial program 65.2%

      \[\frac{x - y \cdot z}{t - a \cdot z} \]
   2. Step-by-step derivation

      1. sub-neg 65.2%

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

      2. +-commutative 65.2%

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

      3. neg-sub0 65.2%

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

      4. associate-+l- 65.2%

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

      5. sub0-neg 65.2%

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

      6. neg-mul-1 65.2%

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

      7. sub-neg 65.2%

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

      8. +-commutative 65.2%

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

      9. neg-sub0 65.2%

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

      10. associate-+l- 65.2%

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

      11. sub0-neg 65.2%

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

      12. neg-mul-1 65.2%

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

      13. times-frac 65.2%

          \[\leadsto \color{blue}{\frac{-1}{-1} \cdot \frac{y \cdot z - x}{a \cdot z - t}} \]

      14. metadata-eval 65.2%

          \[\leadsto \color{blue}{1} \cdot \frac{y \cdot z - x}{a \cdot z - t} \]

      15. *-lft-identity 65.2%

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

      16. *-commutative 65.2%

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

   3. Simplified 65.2%

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

   4. Taylor expanded in a around inf 46.6%

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

      1. *-commutative 46.6%

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

   6. Simplified 46.6%

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

   7. Taylor expanded in z around 0 68.9%

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

      1. +-commutative 68.9%

         \[\leadsto \color{blue}{\frac{y}{a} + -1 \cdot \frac{x}{a \cdot z}} \]

      2. mul-1-neg 68.9%

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

      3. unsub-neg 68.9%

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

   9. Simplified 68.9%

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

   10. Taylor expanded in a around 0 76.6%

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

   if -4.5e14 < z < 2.20000000000000012e-44

   1. Initial program 99.8%

      \[\frac{x - y \cdot z}{t - a \cdot z} \]
   2. Step-by-step derivation

      1. sub-neg 99.8%

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

      2. +-commutative 99.8%

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

      3. neg-sub0 99.8%

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

      4. associate-+l- 99.8%

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

      5. sub0-neg 99.8%

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

      6. neg-mul-1 99.8%

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

      7. sub-neg 99.8%

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

      8. +-commutative 99.8%

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

      9. neg-sub0 99.8%

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

      10. associate-+l- 99.8%

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

      11. sub0-neg 99.8%

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

      12. neg-mul-1 99.8%

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

      13. times-frac 99.8%

          \[\leadsto \color{blue}{\frac{-1}{-1} \cdot \frac{y \cdot z - x}{a \cdot z - t}} \]

      14. metadata-eval 99.8%

          \[\leadsto \color{blue}{1} \cdot \frac{y \cdot z - x}{a \cdot z - t} \]

      15. *-lft-identity 99.8%

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

      16. *-commutative 99.8%

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

   3. Simplified 99.8%

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

   4. Taylor expanded in a around 0 77.7%

      \[\leadsto \color{blue}{-1 \cdot \frac{y \cdot z - x}{t}} \]
   5. Step-by-step derivation

      1. associate-*r/ 77.7%

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

      2. neg-mul-1 77.7%

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

      3. neg-sub0 77.7%

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

      4. sub-neg 77.7%

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

      5. +-commutative 77.7%

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

      6. associate--r+ 77.7%

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

      7. neg-sub0 77.7%

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

      8. remove-double-neg 77.7%

         \[\leadsto \frac{\color{blue}{x} - y \cdot z}{t} \]

      9. *-commutative 77.7%

         \[\leadsto \frac{x - \color{blue}{z \cdot y}}{t} \]

   6. Simplified 77.7%

      \[\leadsto \color{blue}{\frac{x - z \cdot y}{t}} \]

   if 2.20000000000000012e-44 < z

   1. Initial program 68.8%

      \[\frac{x - y \cdot z}{t - a \cdot z} \]
   2. Step-by-step derivation

      1. sub-neg 68.8%

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

      2. +-commutative 68.8%

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

      3. neg-sub0 68.8%

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

      4. associate-+l- 68.8%

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

      5. sub0-neg 68.8%

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

      6. neg-mul-1 68.8%

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

      7. sub-neg 68.8%

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

      8. +-commutative 68.8%

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

      9. neg-sub0 68.8%

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

      10. associate-+l- 68.8%

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

      11. sub0-neg 68.8%

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

      12. neg-mul-1 68.8%

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

      13. times-frac 68.8%

          \[\leadsto \color{blue}{\frac{-1}{-1} \cdot \frac{y \cdot z - x}{a \cdot z - t}} \]

      14. metadata-eval 68.8%

          \[\leadsto \color{blue}{1} \cdot \frac{y \cdot z - x}{a \cdot z - t} \]

      15. *-lft-identity 68.8%

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

      16. *-commutative 68.8%

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

   3. Simplified 68.8%

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

      1. clear-num 68.9%

         \[\leadsto \color{blue}{\frac{1}{\frac{z \cdot a - t}{y \cdot z - x}}} \]

      2. inv-pow 68.9%

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

   5. Applied egg-rr 68.9%

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

   6. Taylor expanded in a around 0 66.0%

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

      1. +-commutative 66.0%

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

      2. mul-1-neg 66.0%

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

      3. unsub-neg 66.0%

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

   8. Simplified 66.0%

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

   9. Taylor expanded in y around inf 78.0%

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

4. Final simplification 77.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -4.5 \cdot 10^{+14}:\\ \;\;\;\;\frac{y - \frac{x}{z}}{a}\\ \mathbf{elif}\;z \leq 2.2 \cdot 10^{-44}:\\ \;\;\;\;\frac{x - z \cdot y}{t}\\ \mathbf{else}:\\ \;\;\;\;\frac{y}{a - \frac{t}{z}}\\ \end{array} \]

Alternative 5: 54.9% accurate, 1.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -0.0255:\\ \;\;\;\;\frac{y}{a}\\ \mathbf{elif}\;z \leq 2.4 \cdot 10^{+17}:\\ \;\;\;\;\frac{x}{t}\\ \mathbf{else}:\\ \;\;\;\;\frac{y}{a}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= z -0.0255) (/ y a) (if (<= z 2.4e+17) (/ x t) (/ y a))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (z <= -0.0255) {
		tmp = y / a;
	} else if (z <= 2.4e+17) {
		tmp = x / t;
	} else {
		tmp = y / a;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a)
    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) :: tmp
    if (z <= (-0.0255d0)) then
        tmp = y / a
    else if (z <= 2.4d+17) then
        tmp = x / t
    else
        tmp = y / a
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (z <= -0.0255) {
		tmp = y / a;
	} else if (z <= 2.4e+17) {
		tmp = x / t;
	} else {
		tmp = y / a;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	tmp = 0
	if z <= -0.0255:
		tmp = y / a
	elif z <= 2.4e+17:
		tmp = x / t
	else:
		tmp = y / a
	return tmp

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if (z <= -0.0255)
		tmp = Float64(y / a);
	elseif (z <= 2.4e+17)
		tmp = Float64(x / t);
	else
		tmp = Float64(y / a);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if (z <= -0.0255)
		tmp = y / a;
	elseif (z <= 2.4e+17)
		tmp = x / t;
	else
		tmp = y / a;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := If[LessEqual[z, -0.0255], N[(y / a), $MachinePrecision], If[LessEqual[z, 2.4e+17], N[(x / t), $MachinePrecision], N[(y / a), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if z < -0.0254999999999999984 or 2.4e17 < z

   1. Initial program 65.3%

      \[\frac{x - y \cdot z}{t - a \cdot z} \]
   2. Step-by-step derivation

      1. sub-neg 65.3%

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

      2. +-commutative 65.3%

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

      3. neg-sub0 65.3%

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

      4. associate-+l- 65.3%

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

      5. sub0-neg 65.3%

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

      6. neg-mul-1 65.3%

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

      7. sub-neg 65.3%

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

      8. +-commutative 65.3%

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

      9. neg-sub0 65.3%

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

      10. associate-+l- 65.3%

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

      11. sub0-neg 65.3%

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

      12. neg-mul-1 65.3%

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

      13. times-frac 65.3%

          \[\leadsto \color{blue}{\frac{-1}{-1} \cdot \frac{y \cdot z - x}{a \cdot z - t}} \]

      14. metadata-eval 65.3%

          \[\leadsto \color{blue}{1} \cdot \frac{y \cdot z - x}{a \cdot z - t} \]

      15. *-lft-identity 65.3%

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

      16. *-commutative 65.3%

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

   3. Simplified 65.3%

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

   4. Taylor expanded in z around inf 59.3%

      \[\leadsto \color{blue}{\frac{y}{a}} \]

   if -0.0254999999999999984 < z < 2.4e17

   1. Initial program 99.8%

      \[\frac{x - y \cdot z}{t - a \cdot z} \]
   2. Step-by-step derivation

      1. sub-neg 99.8%

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

      2. +-commutative 99.8%

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

      3. neg-sub0 99.8%

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

      4. associate-+l- 99.8%

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

      5. sub0-neg 99.8%

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

      6. neg-mul-1 99.8%

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

      7. sub-neg 99.8%

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

      8. +-commutative 99.8%

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

      9. neg-sub0 99.8%

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

      10. associate-+l- 99.8%

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

      11. sub0-neg 99.8%

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

      12. neg-mul-1 99.8%

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

      13. times-frac 99.8%

          \[\leadsto \color{blue}{\frac{-1}{-1} \cdot \frac{y \cdot z - x}{a \cdot z - t}} \]

      14. metadata-eval 99.8%

          \[\leadsto \color{blue}{1} \cdot \frac{y \cdot z - x}{a \cdot z - t} \]

      15. *-lft-identity 99.8%

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

      16. *-commutative 99.8%

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

   3. Simplified 99.8%

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

   4. Taylor expanded in z around 0 59.9%

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

4. Final simplification 59.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -0.0255:\\ \;\;\;\;\frac{y}{a}\\ \mathbf{elif}\;z \leq 2.4 \cdot 10^{+17}:\\ \;\;\;\;\frac{x}{t}\\ \mathbf{else}:\\ \;\;\;\;\frac{y}{a}\\ \end{array} \]

Alternative 6: 35.6% accurate, 3.7× speedup

Math

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

FPCore

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

C

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

Fortran

real(8) function code(x, y, z, t, a)
    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
    code = x / t
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 82.0%

   \[\frac{x - y \cdot z}{t - a \cdot z} \]
2. Step-by-step derivation

   1. sub-neg 82.0%

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

   2. +-commutative 82.0%

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

   3. neg-sub0 82.0%

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

   4. associate-+l- 82.0%

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

   5. sub0-neg 82.0%

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

   6. neg-mul-1 82.0%

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

   7. sub-neg 82.0%

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

   8. +-commutative 82.0%

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

   9. neg-sub0 82.0%

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

   10. associate-+l- 82.0%

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

   11. sub0-neg 82.0%

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

   12. neg-mul-1 82.0%

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

   13. times-frac 82.0%

       \[\leadsto \color{blue}{\frac{-1}{-1} \cdot \frac{y \cdot z - x}{a \cdot z - t}} \]

   14. metadata-eval 82.0%

       \[\leadsto \color{blue}{1} \cdot \frac{y \cdot z - x}{a \cdot z - t} \]

   15. *-lft-identity 82.0%

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

   16. *-commutative 82.0%

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

3. Simplified 82.0%

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

4. Taylor expanded in z around 0 34.8%

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

5. Final simplification 34.8%

   \[\leadsto \frac{x}{t} \]

Developer target: 97.6% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := t - a \cdot z\\ t_2 := \frac{x}{t_1} - \frac{y}{\frac{t}{z} - a}\\ \mathbf{if}\;z < -32113435955957344:\\ \;\;\;\;t_2\\ \mathbf{elif}\;z < 3.5139522372978296 \cdot 10^{-86}:\\ \;\;\;\;\left(x - y \cdot z\right) \cdot \frac{1}{t_1}\\ \mathbf{else}:\\ \;\;\;\;t_2\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (- t (* a z))) (t_2 (- (/ x t_1) (/ y (- (/ t z) a)))))
   (if (< z -32113435955957344.0)
     t_2
     (if (< z 3.5139522372978296e-86) (* (- x (* y z)) (/ 1.0 t_1)) t_2))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = t - (a * z);
	double t_2 = (x / t_1) - (y / ((t / z) - a));
	double tmp;
	if (z < -32113435955957344.0) {
		tmp = t_2;
	} else if (z < 3.5139522372978296e-86) {
		tmp = (x - (y * z)) * (1.0 / t_1);
	} else {
		tmp = t_2;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a)
    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) :: t_1
    real(8) :: t_2
    real(8) :: tmp
    t_1 = t - (a * z)
    t_2 = (x / t_1) - (y / ((t / z) - a))
    if (z < (-32113435955957344.0d0)) then
        tmp = t_2
    else if (z < 3.5139522372978296d-86) then
        tmp = (x - (y * z)) * (1.0d0 / 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 t_1 = t - (a * z);
	double t_2 = (x / t_1) - (y / ((t / z) - a));
	double tmp;
	if (z < -32113435955957344.0) {
		tmp = t_2;
	} else if (z < 3.5139522372978296e-86) {
		tmp = (x - (y * z)) * (1.0 / t_1);
	} else {
		tmp = t_2;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	t_1 = t - (a * z)
	t_2 = (x / t_1) - (y / ((t / z) - a))
	tmp = 0
	if z < -32113435955957344.0:
		tmp = t_2
	elif z < 3.5139522372978296e-86:
		tmp = (x - (y * z)) * (1.0 / t_1)
	else:
		tmp = t_2
	return tmp

Julia

function code(x, y, z, t, a)
	t_1 = Float64(t - Float64(a * z))
	t_2 = Float64(Float64(x / t_1) - Float64(y / Float64(Float64(t / z) - a)))
	tmp = 0.0
	if (z < -32113435955957344.0)
		tmp = t_2;
	elseif (z < 3.5139522372978296e-86)
		tmp = Float64(Float64(x - Float64(y * z)) * Float64(1.0 / t_1));
	else
		tmp = t_2;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	t_1 = t - (a * z);
	t_2 = (x / t_1) - (y / ((t / z) - a));
	tmp = 0.0;
	if (z < -32113435955957344.0)
		tmp = t_2;
	elseif (z < 3.5139522372978296e-86)
		tmp = (x - (y * z)) * (1.0 / t_1);
	else
		tmp = t_2;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(t - N[(a * z), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(x / t$95$1), $MachinePrecision] - N[(y / N[(N[(t / z), $MachinePrecision] - a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[Less[z, -32113435955957344.0], t$95$2, If[Less[z, 3.5139522372978296e-86], N[(N[(x - N[(y * z), $MachinePrecision]), $MachinePrecision] * N[(1.0 / t$95$1), $MachinePrecision]), $MachinePrecision], t$95$2]]]]

Reproduce

herbie shell --seed 2023200 
(FPCore (x y z t a)
  :name "Diagrams.Solve.Tridiagonal:solveTriDiagonal from diagrams-solve-0.1, A"
  :precision binary64

  :herbie-target
  (if (< z -32113435955957344.0) (- (/ x (- t (* a z))) (/ y (- (/ t z) a))) (if (< z 3.5139522372978296e-86) (* (- x (* y z)) (/ 1.0 (- t (* a z)))) (- (/ x (- t (* a z))) (/ y (- (/ t z) a)))))

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