Diagrams.Solve.Polynomial:cubForm from diagrams-solve-0.1, I

Percentage Accurate: 91.2% → 96.9%

Time: 8.1s

Alternatives: 7

Speedup: 0.6×

• 28.6% of points produce a very large (infinite) output. You may want to add a precondition.

Specification

Math

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

FPCore

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

C

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

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 * 9.0d0) * t)) / (a * 2.0d0)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 91.2% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

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 * 9.0d0) * t)) / (a * 2.0d0)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 96.9% accurate, 0.3× speedup

Math

\[\begin{array}{l} [x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\\\ [x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\ \\ \begin{array}{l} t_1 := x \cdot y - t \cdot \left(z \cdot 9\right)\\ \mathbf{if}\;t\_1 \leq -\infty \lor \neg \left(t\_1 \leq 4 \cdot 10^{+282}\right):\\ \;\;\;\;\frac{x}{a} \cdot \frac{y}{2} - \left(z \cdot \frac{t}{a}\right) \cdot 4.5\\ \mathbf{else}:\\ \;\;\;\;\frac{x \cdot y - 9 \cdot \left(t \cdot z\right)}{a \cdot 2}\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (- (* x y) (* t (* z 9.0)))))
   (if (or (<= t_1 (- INFINITY)) (not (<= t_1 4e+282)))
     (- (* (/ x a) (/ y 2.0)) (* (* z (/ t a)) 4.5))
     (/ (- (* x y) (* 9.0 (* t z))) (* a 2.0)))))

C

assert(x < y && y < z && z < t && t < a);
assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
	double t_1 = (x * y) - (t * (z * 9.0));
	double tmp;
	if ((t_1 <= -((double) INFINITY)) || !(t_1 <= 4e+282)) {
		tmp = ((x / a) * (y / 2.0)) - ((z * (t / a)) * 4.5);
	} else {
		tmp = ((x * y) - (9.0 * (t * z))) / (a * 2.0);
	}
	return tmp;
}

Java

assert x < y && y < z && z < t && t < a;
assert x < y && y < z && z < t && t < a;
public static double code(double x, double y, double z, double t, double a) {
	double t_1 = (x * y) - (t * (z * 9.0));
	double tmp;
	if ((t_1 <= -Double.POSITIVE_INFINITY) || !(t_1 <= 4e+282)) {
		tmp = ((x / a) * (y / 2.0)) - ((z * (t / a)) * 4.5);
	} else {
		tmp = ((x * y) - (9.0 * (t * z))) / (a * 2.0);
	}
	return tmp;
}

Python

[x, y, z, t, a] = sort([x, y, z, t, a])
[x, y, z, t, a] = sort([x, y, z, t, a])
def code(x, y, z, t, a):
	t_1 = (x * y) - (t * (z * 9.0))
	tmp = 0
	if (t_1 <= -math.inf) or not (t_1 <= 4e+282):
		tmp = ((x / a) * (y / 2.0)) - ((z * (t / a)) * 4.5)
	else:
		tmp = ((x * y) - (9.0 * (t * z))) / (a * 2.0)
	return tmp

Julia

x, y, z, t, a = sort([x, y, z, t, a])
x, y, z, t, a = sort([x, y, z, t, a])
function code(x, y, z, t, a)
	t_1 = Float64(Float64(x * y) - Float64(t * Float64(z * 9.0)))
	tmp = 0.0
	if ((t_1 <= Float64(-Inf)) || !(t_1 <= 4e+282))
		tmp = Float64(Float64(Float64(x / a) * Float64(y / 2.0)) - Float64(Float64(z * Float64(t / a)) * 4.5));
	else
		tmp = Float64(Float64(Float64(x * y) - Float64(9.0 * Float64(t * z))) / Float64(a * 2.0));
	end
	return tmp
end

MATLAB

x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
function tmp_2 = code(x, y, z, t, a)
	t_1 = (x * y) - (t * (z * 9.0));
	tmp = 0.0;
	if ((t_1 <= -Inf) || ~((t_1 <= 4e+282)))
		tmp = ((x / a) * (y / 2.0)) - ((z * (t / a)) * 4.5);
	else
		tmp = ((x * y) - (9.0 * (t * z))) / (a * 2.0);
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(N[(x * y), $MachinePrecision] - N[(t * N[(z * 9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[Or[LessEqual[t$95$1, (-Infinity)], N[Not[LessEqual[t$95$1, 4e+282]], $MachinePrecision]], N[(N[(N[(x / a), $MachinePrecision] * N[(y / 2.0), $MachinePrecision]), $MachinePrecision] - N[(N[(z * N[(t / a), $MachinePrecision]), $MachinePrecision] * 4.5), $MachinePrecision]), $MachinePrecision], N[(N[(N[(x * y), $MachinePrecision] - N[(9.0 * N[(t * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) < -inf.0 or 4.00000000000000013e282 < (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t))

   1. Initial program 63.0%

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

      1. div-sub 58.7%

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

      2. *-commutative 58.7%

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

      3. div-sub 63.0%

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

      4. cancel-sign-sub-inv 63.0%

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

      5. *-commutative 63.0%

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

      6. fma-define 67.4%

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

      7. distribute-rgt-neg-in 67.4%

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

      8. associate-*r* 67.4%

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

      9. distribute-lft-neg-in 67.4%

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

      10. *-commutative 67.4%

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

      11. distribute-rgt-neg-in 67.4%

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

      12. metadata-eval 67.4%

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

   3. Simplified 67.4%

      \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(x, y, z \cdot \left(t \cdot -9\right)\right)}{a \cdot 2}} \]
   4. Add Preprocessing
   5. Step-by-step derivation

      1. *-commutative 67.4%

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

      2. associate-*r* 67.4%

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

      3. metadata-eval 67.4%

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

      4. distribute-rgt-neg-in 67.4%

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

      5. distribute-lft-neg-in 67.4%

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

      6. fma-neg 63.0%

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

      7. *-commutative 63.0%

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

      8. associate-*l* 63.0%

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

   6. Applied egg-rr 63.0%

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

      1. div-sub 58.7%

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

      2. times-frac 72.2%

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

      3. *-commutative 72.2%

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

      4. times-frac 72.2%

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

      5. associate-*r/ 88.3%

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

      6. metadata-eval 88.3%

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

   8. Applied egg-rr 88.3%

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

   if -inf.0 < (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) < 4.00000000000000013e282

   1. Initial program 99.2%

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

      1. div-sub 97.1%

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

      2. *-commutative 97.1%

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

      3. div-sub 99.2%

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

      4. cancel-sign-sub-inv 99.2%

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

      5. *-commutative 99.2%

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

      6. fma-define 99.2%

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

      7. distribute-rgt-neg-in 99.2%

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

      8. associate-*r* 99.2%

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

      9. distribute-lft-neg-in 99.2%

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

      10. *-commutative 99.2%

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

      11. distribute-rgt-neg-in 99.2%

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

      12. metadata-eval 99.2%

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

   3. Simplified 99.2%

      \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(x, y, z \cdot \left(t \cdot -9\right)\right)}{a \cdot 2}} \]
   4. Add Preprocessing
   5. Step-by-step derivation

      1. *-commutative 99.2%

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

      2. associate-*r* 99.2%

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

      3. metadata-eval 99.2%

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

      4. distribute-rgt-neg-in 99.2%

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

      5. distribute-lft-neg-in 99.2%

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

      6. fma-neg 99.2%

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

      7. *-commutative 99.2%

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

      8. associate-*l* 99.2%

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

   6. Applied egg-rr 99.2%

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

4. Final simplification 96.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \cdot y - t \cdot \left(z \cdot 9\right) \leq -\infty \lor \neg \left(x \cdot y - t \cdot \left(z \cdot 9\right) \leq 4 \cdot 10^{+282}\right):\\ \;\;\;\;\frac{x}{a} \cdot \frac{y}{2} - \left(z \cdot \frac{t}{a}\right) \cdot 4.5\\ \mathbf{else}:\\ \;\;\;\;\frac{x \cdot y - 9 \cdot \left(t \cdot z\right)}{a \cdot 2}\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 93.3% accurate, 0.1× speedup

Math

\[\begin{array}{l} [x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\\\ [x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\ \\ \begin{array}{l} \mathbf{if}\;x \cdot y \leq -\infty:\\ \;\;\;\;\frac{y \cdot \frac{x}{a}}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{\mathsf{fma}\left(x, \frac{y}{2}, t \cdot \left(z \cdot -4.5\right)\right)}{a}\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
(FPCore (x y z t a)
 :precision binary64
 (if (<= (* x y) (- INFINITY))
   (/ (* y (/ x a)) 2.0)
   (/ (fma x (/ y 2.0) (* t (* z -4.5))) a)))

C

assert(x < y && y < z && z < t && t < a);
assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((x * y) <= -((double) INFINITY)) {
		tmp = (y * (x / a)) / 2.0;
	} else {
		tmp = fma(x, (y / 2.0), (t * (z * -4.5))) / a;
	}
	return tmp;
}

Julia

x, y, z, t, a = sort([x, y, z, t, a])
x, y, z, t, a = sort([x, y, z, t, a])
function code(x, y, z, t, a)
	tmp = 0.0
	if (Float64(x * y) <= Float64(-Inf))
		tmp = Float64(Float64(y * Float64(x / a)) / 2.0);
	else
		tmp = Float64(fma(x, Float64(y / 2.0), Float64(t * Float64(z * -4.5))) / a);
	end
	return tmp
end

Wolfram

NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_] := If[LessEqual[N[(x * y), $MachinePrecision], (-Infinity)], N[(N[(y * N[(x / a), $MachinePrecision]), $MachinePrecision] / 2.0), $MachinePrecision], N[(N[(x * N[(y / 2.0), $MachinePrecision] + N[(t * N[(z * -4.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / a), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 x y) < -inf.0

   1. Initial program 56.6%

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

   3. Taylor expanded in x around inf 61.2%

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

      1. associate-/l* 99.9%

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

   5. Simplified 99.9%

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

      1. metadata-eval 99.9%

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

      2. associate-*r/ 61.2%

         \[\leadsto \frac{1}{2} \cdot \color{blue}{\frac{x \cdot y}{a}} \]

      3. times-frac 61.2%

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

      4. *-un-lft-identity 61.2%

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

      5. *-commutative 61.2%

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

      6. frac-times 99.9%

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

      7. associate-*r/ 99.9%

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

   7. Applied egg-rr 99.9%

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

   if -inf.0 < (*.f64 x y)

   1. Initial program 92.8%

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

      1. associate-/l/ 92.9%

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

      2. div-sub 92.9%

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

      3. associate-/l* 92.9%

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

      4. fma-neg 94.2%

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

      5. *-commutative 94.2%

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

      6. associate-/l* 94.2%

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

      7. distribute-rgt-neg-out 94.2%

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

      8. distribute-frac-neg 94.2%

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

      9. distribute-rgt-neg-in 94.2%

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

      10. associate-/l* 94.2%

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

      11. metadata-eval 94.2%

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

      12. metadata-eval 94.2%

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

   3. Simplified 94.2%

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

4. Final simplification 94.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \cdot y \leq -\infty:\\ \;\;\;\;\frac{y \cdot \frac{x}{a}}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{\mathsf{fma}\left(x, \frac{y}{2}, t \cdot \left(z \cdot -4.5\right)\right)}{a}\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 93.3% accurate, 0.1× speedup

Math

\[\begin{array}{l} [x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\\\ [x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\ \\ \begin{array}{l} \mathbf{if}\;x \cdot y \leq -\infty:\\ \;\;\;\;\frac{y \cdot \frac{x}{a}}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{\mathsf{fma}\left(x, y, z \cdot \left(t \cdot -9\right)\right)}{a \cdot 2}\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
(FPCore (x y z t a)
 :precision binary64
 (if (<= (* x y) (- INFINITY))
   (/ (* y (/ x a)) 2.0)
   (/ (fma x y (* z (* t -9.0))) (* a 2.0))))

C

assert(x < y && y < z && z < t && t < a);
assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((x * y) <= -((double) INFINITY)) {
		tmp = (y * (x / a)) / 2.0;
	} else {
		tmp = fma(x, y, (z * (t * -9.0))) / (a * 2.0);
	}
	return tmp;
}

Julia

x, y, z, t, a = sort([x, y, z, t, a])
x, y, z, t, a = sort([x, y, z, t, a])
function code(x, y, z, t, a)
	tmp = 0.0
	if (Float64(x * y) <= Float64(-Inf))
		tmp = Float64(Float64(y * Float64(x / a)) / 2.0);
	else
		tmp = Float64(fma(x, y, Float64(z * Float64(t * -9.0))) / Float64(a * 2.0));
	end
	return tmp
end

Wolfram

NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_] := If[LessEqual[N[(x * y), $MachinePrecision], (-Infinity)], N[(N[(y * N[(x / a), $MachinePrecision]), $MachinePrecision] / 2.0), $MachinePrecision], N[(N[(x * y + N[(z * N[(t * -9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 x y) < -inf.0

   1. Initial program 56.6%

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

   3. Taylor expanded in x around inf 61.2%

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

      1. associate-/l* 99.9%

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

   5. Simplified 99.9%

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

      1. metadata-eval 99.9%

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

      2. associate-*r/ 61.2%

         \[\leadsto \frac{1}{2} \cdot \color{blue}{\frac{x \cdot y}{a}} \]

      3. times-frac 61.2%

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

      4. *-un-lft-identity 61.2%

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

      5. *-commutative 61.2%

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

      6. frac-times 99.9%

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

      7. associate-*r/ 99.9%

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

   7. Applied egg-rr 99.9%

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

   if -inf.0 < (*.f64 x y)

   1. Initial program 92.8%

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

      1. div-sub 90.3%

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

      2. *-commutative 90.3%

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

      3. div-sub 92.8%

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

      4. cancel-sign-sub-inv 92.8%

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

      5. *-commutative 92.8%

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

      6. fma-define 94.1%

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

      7. distribute-rgt-neg-in 94.1%

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

      8. associate-*r* 94.1%

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

      9. distribute-lft-neg-in 94.1%

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

      10. *-commutative 94.1%

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

      11. distribute-rgt-neg-in 94.1%

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

      12. metadata-eval 94.1%

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

   3. Simplified 94.1%

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

4. Final simplification 94.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \cdot y \leq -\infty:\\ \;\;\;\;\frac{y \cdot \frac{x}{a}}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{\mathsf{fma}\left(x, y, z \cdot \left(t \cdot -9\right)\right)}{a \cdot 2}\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 74.5% accurate, 0.6× speedup

Math

\[\begin{array}{l} [x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\\\ [x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\ \\ \begin{array}{l} \mathbf{if}\;x \cdot y \leq -100000000000 \lor \neg \left(x \cdot y \leq 2000000000\right):\\ \;\;\;\;0.5 \cdot \left(x \cdot \frac{y}{a}\right)\\ \mathbf{else}:\\ \;\;\;\;t \cdot \frac{z \cdot -4.5}{a}\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
(FPCore (x y z t a)
 :precision binary64
 (if (or (<= (* x y) -100000000000.0) (not (<= (* x y) 2000000000.0)))
   (* 0.5 (* x (/ y a)))
   (* t (/ (* z -4.5) a))))

C

assert(x < y && y < z && z < t && t < a);
assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (((x * y) <= -100000000000.0) || !((x * y) <= 2000000000.0)) {
		tmp = 0.5 * (x * (y / a));
	} else {
		tmp = t * ((z * -4.5) / a);
	}
	return tmp;
}

Fortran

NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
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 (((x * y) <= (-100000000000.0d0)) .or. (.not. ((x * y) <= 2000000000.0d0))) then
        tmp = 0.5d0 * (x * (y / a))
    else
        tmp = t * ((z * (-4.5d0)) / a)
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t && t < a;
assert x < y && y < z && z < t && t < a;
public static double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (((x * y) <= -100000000000.0) || !((x * y) <= 2000000000.0)) {
		tmp = 0.5 * (x * (y / a));
	} else {
		tmp = t * ((z * -4.5) / a);
	}
	return tmp;
}

Python

[x, y, z, t, a] = sort([x, y, z, t, a])
[x, y, z, t, a] = sort([x, y, z, t, a])
def code(x, y, z, t, a):
	tmp = 0
	if ((x * y) <= -100000000000.0) or not ((x * y) <= 2000000000.0):
		tmp = 0.5 * (x * (y / a))
	else:
		tmp = t * ((z * -4.5) / a)
	return tmp

Julia

x, y, z, t, a = sort([x, y, z, t, a])
x, y, z, t, a = sort([x, y, z, t, a])
function code(x, y, z, t, a)
	tmp = 0.0
	if ((Float64(x * y) <= -100000000000.0) || !(Float64(x * y) <= 2000000000.0))
		tmp = Float64(0.5 * Float64(x * Float64(y / a)));
	else
		tmp = Float64(t * Float64(Float64(z * -4.5) / a));
	end
	return tmp
end

MATLAB

x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if (((x * y) <= -100000000000.0) || ~(((x * y) <= 2000000000.0)))
		tmp = 0.5 * (x * (y / a));
	else
		tmp = t * ((z * -4.5) / a);
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_] := If[Or[LessEqual[N[(x * y), $MachinePrecision], -100000000000.0], N[Not[LessEqual[N[(x * y), $MachinePrecision], 2000000000.0]], $MachinePrecision]], N[(0.5 * N[(x * N[(y / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(t * N[(N[(z * -4.5), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 x y) < -1e11 or 2e9 < (*.f64 x y)

   1. Initial program 84.5%

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

   3. Taylor expanded in x around inf 69.5%

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

      1. associate-/l* 76.8%

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

   5. Simplified 76.8%

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

   if -1e11 < (*.f64 x y) < 2e9

   1. Initial program 94.1%

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

      1. div-sub 94.1%

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

      2. *-commutative 94.1%

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

      3. div-sub 94.1%

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

      4. cancel-sign-sub-inv 94.1%

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

      5. *-commutative 94.1%

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

      6. fma-define 94.1%

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

      7. distribute-rgt-neg-in 94.1%

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

      8. associate-*r* 94.0%

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

      9. distribute-lft-neg-in 94.0%

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

      10. *-commutative 94.0%

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

      11. distribute-rgt-neg-in 94.0%

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

      12. metadata-eval 94.0%

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

   3. Simplified 94.0%

      \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(x, y, z \cdot \left(t \cdot -9\right)\right)}{a \cdot 2}} \]
   4. Add Preprocessing
   5. Step-by-step derivation

      1. *-commutative 94.0%

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

      2. associate-*r* 94.1%

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

      3. metadata-eval 94.1%

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

      4. distribute-rgt-neg-in 94.1%

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

      5. distribute-lft-neg-in 94.1%

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

      6. fma-neg 94.1%

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

      7. *-commutative 94.1%

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

      8. associate-*l* 94.1%

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

   6. Applied egg-rr 94.1%

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

   7. Taylor expanded in x around 0 76.4%

      \[\leadsto \color{blue}{-4.5 \cdot \frac{t \cdot z}{a}} \]
   8. Step-by-step derivation

      1. associate-*r/ 80.1%

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

      2. associate-*r* 80.1%

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

      3. *-commutative 80.1%

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

      4. associate-*r* 80.0%

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

      5. associate-*r/ 80.1%

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

   9. Simplified 80.1%

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

4. Final simplification 78.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \cdot y \leq -100000000000 \lor \neg \left(x \cdot y \leq 2000000000\right):\\ \;\;\;\;0.5 \cdot \left(x \cdot \frac{y}{a}\right)\\ \mathbf{else}:\\ \;\;\;\;t \cdot \frac{z \cdot -4.5}{a}\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 93.2% accurate, 0.6× speedup

Math

\[\begin{array}{l} [x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\\\ [x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\ \\ \begin{array}{l} \mathbf{if}\;x \cdot y \leq -\infty:\\ \;\;\;\;\frac{y \cdot \frac{x}{a}}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{x \cdot y - 9 \cdot \left(t \cdot z\right)}{a \cdot 2}\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
(FPCore (x y z t a)
 :precision binary64
 (if (<= (* x y) (- INFINITY))
   (/ (* y (/ x a)) 2.0)
   (/ (- (* x y) (* 9.0 (* t z))) (* a 2.0))))

C

assert(x < y && y < z && z < t && t < a);
assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((x * y) <= -((double) INFINITY)) {
		tmp = (y * (x / a)) / 2.0;
	} else {
		tmp = ((x * y) - (9.0 * (t * z))) / (a * 2.0);
	}
	return tmp;
}

Java

assert x < y && y < z && z < t && t < a;
assert x < y && y < z && z < t && t < a;
public static double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((x * y) <= -Double.POSITIVE_INFINITY) {
		tmp = (y * (x / a)) / 2.0;
	} else {
		tmp = ((x * y) - (9.0 * (t * z))) / (a * 2.0);
	}
	return tmp;
}

Python

[x, y, z, t, a] = sort([x, y, z, t, a])
[x, y, z, t, a] = sort([x, y, z, t, a])
def code(x, y, z, t, a):
	tmp = 0
	if (x * y) <= -math.inf:
		tmp = (y * (x / a)) / 2.0
	else:
		tmp = ((x * y) - (9.0 * (t * z))) / (a * 2.0)
	return tmp

Julia

x, y, z, t, a = sort([x, y, z, t, a])
x, y, z, t, a = sort([x, y, z, t, a])
function code(x, y, z, t, a)
	tmp = 0.0
	if (Float64(x * y) <= Float64(-Inf))
		tmp = Float64(Float64(y * Float64(x / a)) / 2.0);
	else
		tmp = Float64(Float64(Float64(x * y) - Float64(9.0 * Float64(t * z))) / Float64(a * 2.0));
	end
	return tmp
end

MATLAB

x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if ((x * y) <= -Inf)
		tmp = (y * (x / a)) / 2.0;
	else
		tmp = ((x * y) - (9.0 * (t * z))) / (a * 2.0);
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_] := If[LessEqual[N[(x * y), $MachinePrecision], (-Infinity)], N[(N[(y * N[(x / a), $MachinePrecision]), $MachinePrecision] / 2.0), $MachinePrecision], N[(N[(N[(x * y), $MachinePrecision] - N[(9.0 * N[(t * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 x y) < -inf.0

   1. Initial program 56.6%

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

   3. Taylor expanded in x around inf 61.2%

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

      1. associate-/l* 99.9%

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

   5. Simplified 99.9%

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

      1. metadata-eval 99.9%

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

      2. associate-*r/ 61.2%

         \[\leadsto \frac{1}{2} \cdot \color{blue}{\frac{x \cdot y}{a}} \]

      3. times-frac 61.2%

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

      4. *-un-lft-identity 61.2%

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

      5. *-commutative 61.2%

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

      6. frac-times 99.9%

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

      7. associate-*r/ 99.9%

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

   7. Applied egg-rr 99.9%

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

   if -inf.0 < (*.f64 x y)

   1. Initial program 92.8%

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

      1. div-sub 90.3%

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

      2. *-commutative 90.3%

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

      3. div-sub 92.8%

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

      4. cancel-sign-sub-inv 92.8%

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

      5. *-commutative 92.8%

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

      6. fma-define 94.1%

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

      7. distribute-rgt-neg-in 94.1%

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

      8. associate-*r* 94.1%

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

      9. distribute-lft-neg-in 94.1%

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

      10. *-commutative 94.1%

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

      11. distribute-rgt-neg-in 94.1%

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

      12. metadata-eval 94.1%

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

   3. Simplified 94.1%

      \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(x, y, z \cdot \left(t \cdot -9\right)\right)}{a \cdot 2}} \]
   4. Add Preprocessing
   5. Step-by-step derivation

      1. *-commutative 94.1%

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

      2. associate-*r* 94.1%

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

      3. metadata-eval 94.1%

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

      4. distribute-rgt-neg-in 94.1%

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

      5. distribute-lft-neg-in 94.1%

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

      6. fma-neg 92.8%

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

      7. *-commutative 92.8%

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

      8. associate-*l* 92.8%

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

   6. Applied egg-rr 92.8%

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

4. Final simplification 93.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \cdot y \leq -\infty:\\ \;\;\;\;\frac{y \cdot \frac{x}{a}}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{x \cdot y - 9 \cdot \left(t \cdot z\right)}{a \cdot 2}\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 67.5% accurate, 0.8× speedup

Math

\[\begin{array}{l} [x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\\\ [x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\ \\ \begin{array}{l} \mathbf{if}\;t \leq -6.3 \cdot 10^{-27} \lor \neg \left(t \leq 2.5 \cdot 10^{+21}\right):\\ \;\;\;\;-4.5 \cdot \left(z \cdot \frac{t}{a}\right)\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \left(x \cdot \frac{y}{a}\right)\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
(FPCore (x y z t a)
 :precision binary64
 (if (or (<= t -6.3e-27) (not (<= t 2.5e+21)))
   (* -4.5 (* z (/ t a)))
   (* 0.5 (* x (/ y a)))))

C

assert(x < y && y < z && z < t && t < a);
assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((t <= -6.3e-27) || !(t <= 2.5e+21)) {
		tmp = -4.5 * (z * (t / a));
	} else {
		tmp = 0.5 * (x * (y / a));
	}
	return tmp;
}

Fortran

NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
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 ((t <= (-6.3d-27)) .or. (.not. (t <= 2.5d+21))) then
        tmp = (-4.5d0) * (z * (t / a))
    else
        tmp = 0.5d0 * (x * (y / a))
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t && t < a;
assert x < y && y < z && z < t && t < a;
public static double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((t <= -6.3e-27) || !(t <= 2.5e+21)) {
		tmp = -4.5 * (z * (t / a));
	} else {
		tmp = 0.5 * (x * (y / a));
	}
	return tmp;
}

Python

[x, y, z, t, a] = sort([x, y, z, t, a])
[x, y, z, t, a] = sort([x, y, z, t, a])
def code(x, y, z, t, a):
	tmp = 0
	if (t <= -6.3e-27) or not (t <= 2.5e+21):
		tmp = -4.5 * (z * (t / a))
	else:
		tmp = 0.5 * (x * (y / a))
	return tmp

Julia

x, y, z, t, a = sort([x, y, z, t, a])
x, y, z, t, a = sort([x, y, z, t, a])
function code(x, y, z, t, a)
	tmp = 0.0
	if ((t <= -6.3e-27) || !(t <= 2.5e+21))
		tmp = Float64(-4.5 * Float64(z * Float64(t / a)));
	else
		tmp = Float64(0.5 * Float64(x * Float64(y / a)));
	end
	return tmp
end

MATLAB

x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if ((t <= -6.3e-27) || ~((t <= 2.5e+21)))
		tmp = -4.5 * (z * (t / a));
	else
		tmp = 0.5 * (x * (y / a));
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_] := If[Or[LessEqual[t, -6.3e-27], N[Not[LessEqual[t, 2.5e+21]], $MachinePrecision]], N[(-4.5 * N[(z * N[(t / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(0.5 * N[(x * N[(y / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if t < -6.3000000000000001e-27 or 2.5e21 < t

   1. Initial program 81.2%

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

   3. Taylor expanded in x around 0 61.8%

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

      1. associate-*r/ 61.8%

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

      2. associate-*r* 61.7%

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

      3. associate-*l/ 71.8%

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

      4. associate-*r/ 71.8%

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

      5. associate-*l* 71.9%

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

   5. Simplified 71.9%

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

   if -6.3000000000000001e-27 < t < 2.5e21

   1. Initial program 96.9%

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

   3. Taylor expanded in x around inf 65.8%

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

      1. associate-/l* 65.7%

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

   5. Simplified 65.7%

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

4. Final simplification 68.7%

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

Alternative 7: 51.2% accurate, 1.9× speedup

Math

\[\begin{array}{l} [x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\\\ [x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\ \\ -4.5 \cdot \left(z \cdot \frac{t}{a}\right) \end{array} \]

FPCore

NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
(FPCore (x y z t a) :precision binary64 (* -4.5 (* z (/ t a))))

C

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

Fortran

NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
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 = (-4.5d0) * (z * (t / a))
end function

Java

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

Python

[x, y, z, t, a] = sort([x, y, z, t, a])
[x, y, z, t, a] = sort([x, y, z, t, a])
def code(x, y, z, t, a):
	return -4.5 * (z * (t / a))

Julia

x, y, z, t, a = sort([x, y, z, t, a])
x, y, z, t, a = sort([x, y, z, t, a])
function code(x, y, z, t, a)
	return Float64(-4.5 * Float64(z * Float64(t / a)))
end

MATLAB

x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
function tmp = code(x, y, z, t, a)
	tmp = -4.5 * (z * (t / a));
end

Wolfram

NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_] := N[(-4.5 * N[(z * N[(t / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 89.4%

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

3. Taylor expanded in x around 0 51.9%

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

   1. associate-*r/ 51.9%

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

   2. associate-*r* 51.9%

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

   3. associate-*l/ 53.9%

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

   4. associate-*r/ 53.9%

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

   5. associate-*l* 53.9%

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

5. Simplified 53.9%

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

6. Final simplification 53.9%

   \[\leadsto -4.5 \cdot \left(z \cdot \frac{t}{a}\right) \]
7. Add Preprocessing

Developer target: 93.6% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a < -2.090464557976709 \cdot 10^{+86}:\\ \;\;\;\;0.5 \cdot \frac{y \cdot x}{a} - 4.5 \cdot \frac{t}{\frac{a}{z}}\\ \mathbf{elif}\;a < 2.144030707833976 \cdot 10^{+99}:\\ \;\;\;\;\frac{x \cdot y - z \cdot \left(9 \cdot t\right)}{a \cdot 2}\\ \mathbf{else}:\\ \;\;\;\;\frac{y}{a} \cdot \left(x \cdot 0.5\right) - \frac{t}{a} \cdot \left(z \cdot 4.5\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (< a -2.090464557976709e+86)
   (- (* 0.5 (/ (* y x) a)) (* 4.5 (/ t (/ a z))))
   (if (< a 2.144030707833976e+99)
     (/ (- (* x y) (* z (* 9.0 t))) (* a 2.0))
     (- (* (/ y a) (* x 0.5)) (* (/ t a) (* z 4.5))))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (a < -2.090464557976709e+86) {
		tmp = (0.5 * ((y * x) / a)) - (4.5 * (t / (a / z)));
	} else if (a < 2.144030707833976e+99) {
		tmp = ((x * y) - (z * (9.0 * t))) / (a * 2.0);
	} else {
		tmp = ((y / a) * (x * 0.5)) - ((t / a) * (z * 4.5));
	}
	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 (a < (-2.090464557976709d+86)) then
        tmp = (0.5d0 * ((y * x) / a)) - (4.5d0 * (t / (a / z)))
    else if (a < 2.144030707833976d+99) then
        tmp = ((x * y) - (z * (9.0d0 * t))) / (a * 2.0d0)
    else
        tmp = ((y / a) * (x * 0.5d0)) - ((t / a) * (z * 4.5d0))
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (a < -2.090464557976709e+86) {
		tmp = (0.5 * ((y * x) / a)) - (4.5 * (t / (a / z)));
	} else if (a < 2.144030707833976e+99) {
		tmp = ((x * y) - (z * (9.0 * t))) / (a * 2.0);
	} else {
		tmp = ((y / a) * (x * 0.5)) - ((t / a) * (z * 4.5));
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	tmp = 0
	if a < -2.090464557976709e+86:
		tmp = (0.5 * ((y * x) / a)) - (4.5 * (t / (a / z)))
	elif a < 2.144030707833976e+99:
		tmp = ((x * y) - (z * (9.0 * t))) / (a * 2.0)
	else:
		tmp = ((y / a) * (x * 0.5)) - ((t / a) * (z * 4.5))
	return tmp

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if (a < -2.090464557976709e+86)
		tmp = Float64(Float64(0.5 * Float64(Float64(y * x) / a)) - Float64(4.5 * Float64(t / Float64(a / z))));
	elseif (a < 2.144030707833976e+99)
		tmp = Float64(Float64(Float64(x * y) - Float64(z * Float64(9.0 * t))) / Float64(a * 2.0));
	else
		tmp = Float64(Float64(Float64(y / a) * Float64(x * 0.5)) - Float64(Float64(t / a) * Float64(z * 4.5)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if (a < -2.090464557976709e+86)
		tmp = (0.5 * ((y * x) / a)) - (4.5 * (t / (a / z)));
	elseif (a < 2.144030707833976e+99)
		tmp = ((x * y) - (z * (9.0 * t))) / (a * 2.0);
	else
		tmp = ((y / a) * (x * 0.5)) - ((t / a) * (z * 4.5));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := If[Less[a, -2.090464557976709e+86], N[(N[(0.5 * N[(N[(y * x), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision] - N[(4.5 * N[(t / N[(a / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[Less[a, 2.144030707833976e+99], N[(N[(N[(x * y), $MachinePrecision] - N[(z * N[(9.0 * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(y / a), $MachinePrecision] * N[(x * 0.5), $MachinePrecision]), $MachinePrecision] - N[(N[(t / a), $MachinePrecision] * N[(z * 4.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Reproduce

herbie shell --seed 2024096 
(FPCore (x y z t a)
  :name "Diagrams.Solve.Polynomial:cubForm  from diagrams-solve-0.1, I"
  :precision binary64

  :alt
  (if (< a -2.090464557976709e+86) (- (* 0.5 (/ (* y x) a)) (* 4.5 (/ t (/ a z)))) (if (< a 2.144030707833976e+99) (/ (- (* x y) (* z (* 9.0 t))) (* a 2.0)) (- (* (/ y a) (* x 0.5)) (* (/ t a) (* z 4.5)))))

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