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

Percentage Accurate: 91.4% → 97.3%

Time: 11.9s

Alternatives: 14

Speedup: 0.8×

• 27.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.4% 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: 97.3% accurate, 0.4× speedup

Math

\[\begin{array}{l} [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:\\ \;\;\;\;\mathsf{fma}\left(x \cdot \frac{0.5}{a}, y, \frac{t \cdot 4.5}{a} \cdot \left(-z\right)\right)\\ \mathbf{elif}\;t\_1 \leq 2 \cdot 10^{+277}:\\ \;\;\;\;\frac{\mathsf{fma}\left(z \cdot -9, t, x \cdot y\right)}{a \cdot 2}\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\frac{x}{a \cdot 2}, y, z \cdot \frac{t \cdot -4.5}{a}\right)\\ \end{array} \end{array} \]

FPCore

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 (<= t_1 (- INFINITY))
     (fma (* x (/ 0.5 a)) y (* (/ (* t 4.5) a) (- z)))
     (if (<= t_1 2e+277)
       (/ (fma (* z -9.0) t (* x y)) (* a 2.0))
       (fma (/ x (* a 2.0)) y (* z (/ (* t -4.5) a)))))))

C

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)) {
		tmp = fma((x * (0.5 / a)), y, (((t * 4.5) / a) * -z));
	} else if (t_1 <= 2e+277) {
		tmp = fma((z * -9.0), t, (x * y)) / (a * 2.0);
	} else {
		tmp = fma((x / (a * 2.0)), y, (z * ((t * -4.5) / a)));
	}
	return tmp;
}

Julia

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))
		tmp = fma(Float64(x * Float64(0.5 / a)), y, Float64(Float64(Float64(t * 4.5) / a) * Float64(-z)));
	elseif (t_1 <= 2e+277)
		tmp = Float64(fma(Float64(z * -9.0), t, Float64(x * y)) / Float64(a * 2.0));
	else
		tmp = fma(Float64(x / Float64(a * 2.0)), y, Float64(z * Float64(Float64(t * -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.
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[LessEqual[t$95$1, (-Infinity)], N[(N[(x * N[(0.5 / a), $MachinePrecision]), $MachinePrecision] * y + N[(N[(N[(t * 4.5), $MachinePrecision] / a), $MachinePrecision] * (-z)), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 2e+277], N[(N[(N[(z * -9.0), $MachinePrecision] * t + N[(x * y), $MachinePrecision]), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(x / N[(a * 2.0), $MachinePrecision]), $MachinePrecision] * y + N[(z * N[(N[(t * -4.5), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

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

   1. Initial program 62.4%

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

      1. div-sub N/A

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

      2. sub-neg N/A

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

      3. *-commutative N/A

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

      4. associate-/l* N/A

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

      5. *-commutative N/A

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

      6. accelerator-lowering-fma.f64 N/A

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

      7. /-lowering-/.f64 N/A

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

      8. *-lowering-*.f64 N/A

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

      9. neg-lowering-neg.f64 N/A

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

      10. associate-*l* N/A

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

      11. associate-/l* N/A

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

      12. *-lowering-*.f64 N/A

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

      13. *-commutative N/A

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

      14. associate-/r* N/A

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

      15. /-lowering-/.f64 N/A

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

      16. *-commutative N/A

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

      17. associate-/l* N/A

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

      18. *-lowering-*.f64 N/A

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

      19. metadata-eval 93.0

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

   4. Applied egg-rr 93.0%

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

      1. clear-num N/A

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

      2. associate-/r/ N/A

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

      3. *-commutative N/A

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

      4. associate-/r* N/A

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

      5. metadata-eval N/A

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

      6. *-lowering-*.f64 N/A

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

      7. /-lowering-/.f64 93.0

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

   6. Applied egg-rr 93.0%

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

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

   1. Initial program 98.7%

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

      1. sub-neg N/A

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

      2. +-commutative N/A

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

      3. distribute-lft-neg-in N/A

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

      4. accelerator-lowering-fma.f64 N/A

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

      5. distribute-rgt-neg-in N/A

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

      6. *-lowering-*.f64 N/A

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

      7. metadata-eval N/A

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

      8. *-lowering-*.f64 98.7

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

   4. Applied egg-rr 98.7%

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

   if 2.00000000000000001e277 < (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t))

   1. Initial program 65.4%

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

      1. div-sub N/A

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

      2. sub-neg N/A

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

      3. *-commutative N/A

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

      4. associate-/l* N/A

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

      5. *-commutative N/A

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

      6. accelerator-lowering-fma.f64 N/A

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

      7. /-lowering-/.f64 N/A

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

      8. *-lowering-*.f64 N/A

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

      9. neg-lowering-neg.f64 N/A

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

      10. associate-*l* N/A

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

      11. associate-/l* N/A

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

      12. *-lowering-*.f64 N/A

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

      13. *-commutative N/A

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

      14. associate-/r* N/A

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

      15. /-lowering-/.f64 N/A

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

      16. *-commutative N/A

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

      17. associate-/l* N/A

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

      18. *-lowering-*.f64 N/A

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

      19. metadata-eval 96.3

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

   4. Applied egg-rr 96.3%

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

      1. *-commutative N/A

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

      2. distribute-lft-neg-in N/A

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

      3. *-lowering-*.f64 N/A

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

      4. distribute-neg-frac N/A

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

      5. /-lowering-/.f64 N/A

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

      6. distribute-rgt-neg-in N/A

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

      7. metadata-eval N/A

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

      8. *-lowering-*.f64 96.3

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

   6. Applied egg-rr 96.3%

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

4. Final simplification 97.8%

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

Alternative 2: 97.3% accurate, 0.4× speedup

Math

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

FPCore

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 (fma (/ x (* a 2.0)) y (* z (/ (* t -4.5) a))))
        (t_2 (- (* x y) (* t (* z 9.0)))))
   (if (<= t_2 (- INFINITY))
     t_1
     (if (<= t_2 2e+277) (/ (fma (* z -9.0) t (* x y)) (* a 2.0)) t_1))))

C

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

Julia

x, y, z, t, a = sort([x, y, z, t, a])
function code(x, y, z, t, a)
	t_1 = fma(Float64(x / Float64(a * 2.0)), y, Float64(z * Float64(Float64(t * -4.5) / a)))
	t_2 = Float64(Float64(x * y) - Float64(t * Float64(z * 9.0)))
	tmp = 0.0
	if (t_2 <= Float64(-Inf))
		tmp = t_1;
	elseif (t_2 <= 2e+277)
		tmp = Float64(fma(Float64(z * -9.0), t, Float64(x * y)) / Float64(a * 2.0));
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

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 / N[(a * 2.0), $MachinePrecision]), $MachinePrecision] * y + N[(z * N[(N[(t * -4.5), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(x * y), $MachinePrecision] - N[(t * N[(z * 9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, (-Infinity)], t$95$1, If[LessEqual[t$95$2, 2e+277], N[(N[(N[(z * -9.0), $MachinePrecision] * t + N[(x * y), $MachinePrecision]), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision], t$95$1]]]]

Derivation

1. Split input into 2 regimes

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

   1. Initial program 63.9%

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

      1. div-sub N/A

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

      2. sub-neg N/A

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

      3. *-commutative N/A

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

      4. associate-/l* N/A

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

      5. *-commutative N/A

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

      6. accelerator-lowering-fma.f64 N/A

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

      7. /-lowering-/.f64 N/A

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

      8. *-lowering-*.f64 N/A

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

      9. neg-lowering-neg.f64 N/A

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

      10. associate-*l* N/A

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

      11. associate-/l* N/A

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

      12. *-lowering-*.f64 N/A

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

      13. *-commutative N/A

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

      14. associate-/r* N/A

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

      15. /-lowering-/.f64 N/A

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

      16. *-commutative N/A

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

      17. associate-/l* N/A

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

      18. *-lowering-*.f64 N/A

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

      19. metadata-eval 94.6

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

   4. Applied egg-rr 94.6%

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

      1. *-commutative N/A

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

      2. distribute-lft-neg-in N/A

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

      3. *-lowering-*.f64 N/A

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

      4. distribute-neg-frac N/A

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

      5. /-lowering-/.f64 N/A

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

      6. distribute-rgt-neg-in N/A

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

      7. metadata-eval N/A

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

      8. *-lowering-*.f64 94.6

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

   6. Applied egg-rr 94.6%

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

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

   1. Initial program 98.7%

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

      1. sub-neg N/A

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

      2. +-commutative N/A

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

      3. distribute-lft-neg-in N/A

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

      4. accelerator-lowering-fma.f64 N/A

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

      5. distribute-rgt-neg-in N/A

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

      6. *-lowering-*.f64 N/A

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

      7. metadata-eval N/A

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

      8. *-lowering-*.f64 98.7

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

   4. Applied egg-rr 98.7%

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

4. Final simplification 97.8%

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

Alternative 3: 93.3% accurate, 0.6× speedup

Math

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

FPCore

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 (<= (* a 2.0) 1e+94)
   (* (fma z (* t -9.0) (* x y)) (/ 0.5 a))
   (fma (/ y (* a 2.0)) x (* (/ (* t 4.5) a) (- z)))))

C

assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((a * 2.0) <= 1e+94) {
		tmp = fma(z, (t * -9.0), (x * y)) * (0.5 / a);
	} else {
		tmp = fma((y / (a * 2.0)), x, (((t * 4.5) / a) * -z));
	}
	return tmp;
}

Julia

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

Wolfram

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[(a * 2.0), $MachinePrecision], 1e+94], N[(N[(z * N[(t * -9.0), $MachinePrecision] + N[(x * y), $MachinePrecision]), $MachinePrecision] * N[(0.5 / a), $MachinePrecision]), $MachinePrecision], N[(N[(y / N[(a * 2.0), $MachinePrecision]), $MachinePrecision] * x + N[(N[(N[(t * 4.5), $MachinePrecision] / a), $MachinePrecision] * (-z)), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 a #s(literal 2 binary64)) < 1e94

   1. Initial program 92.6%

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

      1. div-inv N/A

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

      2. *-lowering-*.f64 N/A

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

      3. sub-neg N/A

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

      4. +-commutative N/A

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

      5. associate-*l* N/A

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

      6. distribute-rgt-neg-in N/A

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

      7. accelerator-lowering-fma.f64 N/A

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

      8. *-commutative N/A

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

      9. distribute-rgt-neg-in N/A

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

      10. *-lowering-*.f64 N/A

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

      11. metadata-eval N/A

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

      12. *-lowering-*.f64 N/A

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

      13. *-commutative N/A

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

      14. associate-/r* N/A

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

      15. /-lowering-/.f64 N/A

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

      16. metadata-eval 93.1

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

   4. Applied egg-rr 93.1%

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

   if 1e94 < (*.f64 a #s(literal 2 binary64))

   1. Initial program 81.3%

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

      1. div-sub N/A

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

      2. sub-neg N/A

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

      3. associate-/l* N/A

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

      4. *-commutative N/A

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

      5. accelerator-lowering-fma.f64 N/A

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

      6. /-lowering-/.f64 N/A

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

      7. *-lowering-*.f64 N/A

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

      8. neg-lowering-neg.f64 N/A

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

      9. associate-*l* N/A

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

      10. associate-/l* N/A

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

      11. *-lowering-*.f64 N/A

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

      12. *-commutative N/A

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

      13. associate-/r* N/A

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

      14. /-lowering-/.f64 N/A

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

      15. *-commutative N/A

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

      16. associate-/l* N/A

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

      17. *-lowering-*.f64 N/A

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

      18. metadata-eval 90.4

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

   4. Applied egg-rr 90.4%

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

4. Final simplification 92.7%

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

Alternative 4: 74.1% accurate, 0.6× speedup

Math

\[\begin{array}{l} [x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\ \\ \begin{array}{l} t_1 := x \cdot \frac{y}{a \cdot 2}\\ \mathbf{if}\;x \cdot y \leq -4 \cdot 10^{+48}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;x \cdot y \leq 10^{-68}:\\ \;\;\;\;\frac{t}{a} \cdot \left(z \cdot -4.5\right)\\ \mathbf{elif}\;x \cdot y \leq 4 \cdot 10^{+109}:\\ \;\;\;\;\frac{x \cdot \left(y \cdot 0.5\right)}{a}\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

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 (* a 2.0)))))
   (if (<= (* x y) -4e+48)
     t_1
     (if (<= (* x y) 1e-68)
       (* (/ t a) (* z -4.5))
       (if (<= (* x y) 4e+109) (/ (* x (* y 0.5)) a) t_1)))))

C

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 / (a * 2.0));
	double tmp;
	if ((x * y) <= -4e+48) {
		tmp = t_1;
	} else if ((x * y) <= 1e-68) {
		tmp = (t / a) * (z * -4.5);
	} else if ((x * y) <= 4e+109) {
		tmp = (x * (y * 0.5)) / a;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Fortran

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) :: t_1
    real(8) :: tmp
    t_1 = x * (y / (a * 2.0d0))
    if ((x * y) <= (-4d+48)) then
        tmp = t_1
    else if ((x * y) <= 1d-68) then
        tmp = (t / a) * (z * (-4.5d0))
    else if ((x * y) <= 4d+109) then
        tmp = (x * (y * 0.5d0)) / a
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

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 / (a * 2.0));
	double tmp;
	if ((x * y) <= -4e+48) {
		tmp = t_1;
	} else if ((x * y) <= 1e-68) {
		tmp = (t / a) * (z * -4.5);
	} else if ((x * y) <= 4e+109) {
		tmp = (x * (y * 0.5)) / a;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

[x, y, z, t, a] = sort([x, y, z, t, a])
def code(x, y, z, t, a):
	t_1 = x * (y / (a * 2.0))
	tmp = 0
	if (x * y) <= -4e+48:
		tmp = t_1
	elif (x * y) <= 1e-68:
		tmp = (t / a) * (z * -4.5)
	elif (x * y) <= 4e+109:
		tmp = (x * (y * 0.5)) / a
	else:
		tmp = t_1
	return tmp

Julia

x, y, z, t, a = sort([x, y, z, t, a])
function code(x, y, z, t, a)
	t_1 = Float64(x * Float64(y / Float64(a * 2.0)))
	tmp = 0.0
	if (Float64(x * y) <= -4e+48)
		tmp = t_1;
	elseif (Float64(x * y) <= 1e-68)
		tmp = Float64(Float64(t / a) * Float64(z * -4.5));
	elseif (Float64(x * y) <= 4e+109)
		tmp = Float64(Float64(x * Float64(y * 0.5)) / a);
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

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 / (a * 2.0));
	tmp = 0.0;
	if ((x * y) <= -4e+48)
		tmp = t_1;
	elseif ((x * y) <= 1e-68)
		tmp = (t / a) * (z * -4.5);
	elseif ((x * y) <= 4e+109)
		tmp = (x * (y * 0.5)) / a;
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

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[(x * N[(y / N[(a * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(x * y), $MachinePrecision], -4e+48], t$95$1, If[LessEqual[N[(x * y), $MachinePrecision], 1e-68], N[(N[(t / a), $MachinePrecision] * N[(z * -4.5), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(x * y), $MachinePrecision], 4e+109], N[(N[(x * N[(y * 0.5), $MachinePrecision]), $MachinePrecision] / a), $MachinePrecision], t$95$1]]]]

Derivation

1. Split input into 3 regimes

2. if (*.f64 x y) < -4.00000000000000018e48 or 3.99999999999999993e109 < (*.f64 x y)

   1. Initial program 83.7%

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

      1. div-inv N/A

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

      2. *-lowering-*.f64 N/A

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

      3. sub-neg N/A

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

      4. +-commutative N/A

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

      5. associate-*l* N/A

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

      6. distribute-rgt-neg-in N/A

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

      7. accelerator-lowering-fma.f64 N/A

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

      8. *-commutative N/A

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

      9. distribute-rgt-neg-in N/A

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

      10. *-lowering-*.f64 N/A

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

      11. metadata-eval N/A

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

      12. *-lowering-*.f64 N/A

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

      13. *-commutative N/A

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

      14. associate-/r* N/A

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

      15. /-lowering-/.f64 N/A

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

      16. metadata-eval 84.9

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

   4. Applied egg-rr 84.9%

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

   5. Taylor expanded in z around 0

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

      1. *-lowering-*.f64 70.3

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

   7. Simplified 70.3%

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

      1. associate-*l* N/A

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

      2. *-commutative N/A

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

      3. *-commutative N/A

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

      4. *-lowering-*.f64 N/A

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

      5. *-commutative N/A

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

      6. clear-num N/A

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

      7. un-div-inv N/A

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

      8. /-lowering-/.f64 N/A

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

      9. div-inv N/A

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

      10. metadata-eval N/A

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

      11. *-lowering-*.f64 79.2

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

   9. Applied egg-rr 79.2%

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

   if -4.00000000000000018e48 < (*.f64 x y) < 1.00000000000000007e-68

   1. Initial program 93.8%

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

   3. Taylor expanded in x around 0

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

      1. *-lowering-*.f64 N/A

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

      2. associate-/l* N/A

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

      3. *-lowering-*.f64 N/A

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

      4. /-lowering-/.f64 73.9

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

   5. Simplified 73.9%

      \[\leadsto \color{blue}{-4.5 \cdot \left(t \cdot \frac{z}{a}\right)} \]
   6. Step-by-step derivation

      1. *-commutative N/A

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

      2. div-inv N/A

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

      3. associate-*l* N/A

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

      4. *-lowering-*.f64 N/A

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

      5. *-lowering-*.f64 N/A

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

      6. /-lowering-/.f64 76.2

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

   7. Applied egg-rr 76.2%

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

      1. associate-*r* N/A

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

      2. *-commutative N/A

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

      3. *-lowering-*.f64 N/A

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

      4. *-commutative N/A

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

      5. un-div-inv N/A

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

      6. /-lowering-/.f64 N/A

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

      7. *-commutative N/A

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

      8. *-lowering-*.f64 76.3

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

   9. Applied egg-rr 76.3%

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

   if 1.00000000000000007e-68 < (*.f64 x y) < 3.99999999999999993e109

   1. Initial program 99.7%

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

   3. Taylor expanded in x around inf

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

      1. associate-*r/ N/A

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

      2. /-lowering-/.f64 N/A

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

      3. *-commutative N/A

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

      4. associate-*r* N/A

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

      5. *-commutative N/A

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

      6. *-lowering-*.f64 N/A

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

      7. *-commutative N/A

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

      8. *-lowering-*.f64 70.0

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

   5. Simplified 70.0%

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

4. Final simplification 76.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \cdot y \leq -4 \cdot 10^{+48}:\\ \;\;\;\;x \cdot \frac{y}{a \cdot 2}\\ \mathbf{elif}\;x \cdot y \leq 10^{-68}:\\ \;\;\;\;\frac{t}{a} \cdot \left(z \cdot -4.5\right)\\ \mathbf{elif}\;x \cdot y \leq 4 \cdot 10^{+109}:\\ \;\;\;\;\frac{x \cdot \left(y \cdot 0.5\right)}{a}\\ \mathbf{else}:\\ \;\;\;\;x \cdot \frac{y}{a \cdot 2}\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 74.1% accurate, 0.6× speedup

Math

\[\begin{array}{l} [x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\ \\ \begin{array}{l} t_1 := x \cdot \left(y \cdot \frac{0.5}{a}\right)\\ \mathbf{if}\;x \cdot y \leq -4 \cdot 10^{+48}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;x \cdot y \leq 10^{-68}:\\ \;\;\;\;\frac{t}{a} \cdot \left(z \cdot -4.5\right)\\ \mathbf{elif}\;x \cdot y \leq 4 \cdot 10^{+109}:\\ \;\;\;\;\left(x \cdot y\right) \cdot \frac{0.5}{a}\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

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 (/ 0.5 a)))))
   (if (<= (* x y) -4e+48)
     t_1
     (if (<= (* x y) 1e-68)
       (* (/ t a) (* z -4.5))
       (if (<= (* x y) 4e+109) (* (* x y) (/ 0.5 a)) t_1)))))

C

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 * (0.5 / a));
	double tmp;
	if ((x * y) <= -4e+48) {
		tmp = t_1;
	} else if ((x * y) <= 1e-68) {
		tmp = (t / a) * (z * -4.5);
	} else if ((x * y) <= 4e+109) {
		tmp = (x * y) * (0.5 / a);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Fortran

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) :: t_1
    real(8) :: tmp
    t_1 = x * (y * (0.5d0 / a))
    if ((x * y) <= (-4d+48)) then
        tmp = t_1
    else if ((x * y) <= 1d-68) then
        tmp = (t / a) * (z * (-4.5d0))
    else if ((x * y) <= 4d+109) then
        tmp = (x * y) * (0.5d0 / a)
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

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 * (0.5 / a));
	double tmp;
	if ((x * y) <= -4e+48) {
		tmp = t_1;
	} else if ((x * y) <= 1e-68) {
		tmp = (t / a) * (z * -4.5);
	} else if ((x * y) <= 4e+109) {
		tmp = (x * y) * (0.5 / a);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

[x, y, z, t, a] = sort([x, y, z, t, a])
def code(x, y, z, t, a):
	t_1 = x * (y * (0.5 / a))
	tmp = 0
	if (x * y) <= -4e+48:
		tmp = t_1
	elif (x * y) <= 1e-68:
		tmp = (t / a) * (z * -4.5)
	elif (x * y) <= 4e+109:
		tmp = (x * y) * (0.5 / a)
	else:
		tmp = t_1
	return tmp

Julia

x, y, z, t, a = sort([x, y, z, t, a])
function code(x, y, z, t, a)
	t_1 = Float64(x * Float64(y * Float64(0.5 / a)))
	tmp = 0.0
	if (Float64(x * y) <= -4e+48)
		tmp = t_1;
	elseif (Float64(x * y) <= 1e-68)
		tmp = Float64(Float64(t / a) * Float64(z * -4.5));
	elseif (Float64(x * y) <= 4e+109)
		tmp = Float64(Float64(x * y) * Float64(0.5 / a));
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

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 * (0.5 / a));
	tmp = 0.0;
	if ((x * y) <= -4e+48)
		tmp = t_1;
	elseif ((x * y) <= 1e-68)
		tmp = (t / a) * (z * -4.5);
	elseif ((x * y) <= 4e+109)
		tmp = (x * y) * (0.5 / a);
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

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[(x * N[(y * N[(0.5 / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(x * y), $MachinePrecision], -4e+48], t$95$1, If[LessEqual[N[(x * y), $MachinePrecision], 1e-68], N[(N[(t / a), $MachinePrecision] * N[(z * -4.5), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(x * y), $MachinePrecision], 4e+109], N[(N[(x * y), $MachinePrecision] * N[(0.5 / a), $MachinePrecision]), $MachinePrecision], t$95$1]]]]

Derivation

1. Split input into 3 regimes

2. if (*.f64 x y) < -4.00000000000000018e48 or 3.99999999999999993e109 < (*.f64 x y)

   1. Initial program 83.7%

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

      1. div-inv N/A

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

      2. *-lowering-*.f64 N/A

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

      3. sub-neg N/A

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

      4. +-commutative N/A

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

      5. associate-*l* N/A

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

      6. distribute-rgt-neg-in N/A

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

      7. accelerator-lowering-fma.f64 N/A

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

      8. *-commutative N/A

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

      9. distribute-rgt-neg-in N/A

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

      10. *-lowering-*.f64 N/A

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

      11. metadata-eval N/A

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

      12. *-lowering-*.f64 N/A

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

      13. *-commutative N/A

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

      14. associate-/r* N/A

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

      15. /-lowering-/.f64 N/A

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

      16. metadata-eval 84.9

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

   4. Applied egg-rr 84.9%

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

   5. Taylor expanded in z around 0

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

      1. *-lowering-*.f64 70.3

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

   7. Simplified 70.3%

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

      1. associate-*l* N/A

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

      2. *-commutative N/A

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

      3. *-commutative N/A

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

      4. *-lowering-*.f64 N/A

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

      5. *-commutative N/A

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

      6. clear-num N/A

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

      7. un-div-inv N/A

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

      8. /-lowering-/.f64 N/A

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

      9. div-inv N/A

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

      10. metadata-eval N/A

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

      11. *-lowering-*.f64 79.2

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

   9. Applied egg-rr 79.2%

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

       1. clear-num N/A

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

       2. associate-/r/ N/A

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

       3. *-commutative N/A

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

       4. associate-/r* N/A

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

       5. metadata-eval N/A

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

       6. *-lowering-*.f64 N/A

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

       7. /-lowering-/.f64 79.2

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

   11. Applied egg-rr 79.2%

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

   if -4.00000000000000018e48 < (*.f64 x y) < 1.00000000000000007e-68

   1. Initial program 93.8%

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

   3. Taylor expanded in x around 0

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

      1. *-lowering-*.f64 N/A

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

      2. associate-/l* N/A

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

      3. *-lowering-*.f64 N/A

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

      4. /-lowering-/.f64 73.9

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

   5. Simplified 73.9%

      \[\leadsto \color{blue}{-4.5 \cdot \left(t \cdot \frac{z}{a}\right)} \]
   6. Step-by-step derivation

      1. *-commutative N/A

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

      2. div-inv N/A

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

      3. associate-*l* N/A

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

      4. *-lowering-*.f64 N/A

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

      5. *-lowering-*.f64 N/A

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

      6. /-lowering-/.f64 76.2

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

   7. Applied egg-rr 76.2%

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

      1. associate-*r* N/A

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

      2. *-commutative N/A

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

      3. *-lowering-*.f64 N/A

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

      4. *-commutative N/A

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

      5. un-div-inv N/A

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

      6. /-lowering-/.f64 N/A

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

      7. *-commutative N/A

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

      8. *-lowering-*.f64 76.3

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

   9. Applied egg-rr 76.3%

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

   if 1.00000000000000007e-68 < (*.f64 x y) < 3.99999999999999993e109

   1. Initial program 99.7%

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

      1. div-inv N/A

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

      2. *-lowering-*.f64 N/A

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

      3. sub-neg N/A

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

      4. +-commutative N/A

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

      5. associate-*l* N/A

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

      6. distribute-rgt-neg-in N/A

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

      7. accelerator-lowering-fma.f64 N/A

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

      8. *-commutative N/A

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

      9. distribute-rgt-neg-in N/A

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

      10. *-lowering-*.f64 N/A

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

      11. metadata-eval N/A

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

      12. *-lowering-*.f64 N/A

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

      13. *-commutative N/A

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

      14. associate-/r* N/A

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

      15. /-lowering-/.f64 N/A

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

      16. metadata-eval 99.7

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

   4. Applied egg-rr 99.7%

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

   5. Taylor expanded in z around 0

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

      1. *-lowering-*.f64 70.0

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

   7. Simplified 70.0%

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

4. Final simplification 76.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \cdot y \leq -4 \cdot 10^{+48}:\\ \;\;\;\;x \cdot \left(y \cdot \frac{0.5}{a}\right)\\ \mathbf{elif}\;x \cdot y \leq 10^{-68}:\\ \;\;\;\;\frac{t}{a} \cdot \left(z \cdot -4.5\right)\\ \mathbf{elif}\;x \cdot y \leq 4 \cdot 10^{+109}:\\ \;\;\;\;\left(x \cdot y\right) \cdot \frac{0.5}{a}\\ \mathbf{else}:\\ \;\;\;\;x \cdot \left(y \cdot \frac{0.5}{a}\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 74.1% accurate, 0.6× speedup

Math

\[\begin{array}{l} [x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\ \\ \begin{array}{l} t_1 := x \cdot \left(y \cdot \frac{0.5}{a}\right)\\ \mathbf{if}\;x \cdot y \leq -4 \cdot 10^{+48}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;x \cdot y \leq 10^{-68}:\\ \;\;\;\;-4.5 \cdot \left(z \cdot \frac{t}{a}\right)\\ \mathbf{elif}\;x \cdot y \leq 4 \cdot 10^{+109}:\\ \;\;\;\;\left(x \cdot y\right) \cdot \frac{0.5}{a}\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

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 (/ 0.5 a)))))
   (if (<= (* x y) -4e+48)
     t_1
     (if (<= (* x y) 1e-68)
       (* -4.5 (* z (/ t a)))
       (if (<= (* x y) 4e+109) (* (* x y) (/ 0.5 a)) t_1)))))

C

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 * (0.5 / a));
	double tmp;
	if ((x * y) <= -4e+48) {
		tmp = t_1;
	} else if ((x * y) <= 1e-68) {
		tmp = -4.5 * (z * (t / a));
	} else if ((x * y) <= 4e+109) {
		tmp = (x * y) * (0.5 / a);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Fortran

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) :: t_1
    real(8) :: tmp
    t_1 = x * (y * (0.5d0 / a))
    if ((x * y) <= (-4d+48)) then
        tmp = t_1
    else if ((x * y) <= 1d-68) then
        tmp = (-4.5d0) * (z * (t / a))
    else if ((x * y) <= 4d+109) then
        tmp = (x * y) * (0.5d0 / a)
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

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 * (0.5 / a));
	double tmp;
	if ((x * y) <= -4e+48) {
		tmp = t_1;
	} else if ((x * y) <= 1e-68) {
		tmp = -4.5 * (z * (t / a));
	} else if ((x * y) <= 4e+109) {
		tmp = (x * y) * (0.5 / a);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

[x, y, z, t, a] = sort([x, y, z, t, a])
def code(x, y, z, t, a):
	t_1 = x * (y * (0.5 / a))
	tmp = 0
	if (x * y) <= -4e+48:
		tmp = t_1
	elif (x * y) <= 1e-68:
		tmp = -4.5 * (z * (t / a))
	elif (x * y) <= 4e+109:
		tmp = (x * y) * (0.5 / a)
	else:
		tmp = t_1
	return tmp

Julia

x, y, z, t, a = sort([x, y, z, t, a])
function code(x, y, z, t, a)
	t_1 = Float64(x * Float64(y * Float64(0.5 / a)))
	tmp = 0.0
	if (Float64(x * y) <= -4e+48)
		tmp = t_1;
	elseif (Float64(x * y) <= 1e-68)
		tmp = Float64(-4.5 * Float64(z * Float64(t / a)));
	elseif (Float64(x * y) <= 4e+109)
		tmp = Float64(Float64(x * y) * Float64(0.5 / a));
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

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 * (0.5 / a));
	tmp = 0.0;
	if ((x * y) <= -4e+48)
		tmp = t_1;
	elseif ((x * y) <= 1e-68)
		tmp = -4.5 * (z * (t / a));
	elseif ((x * y) <= 4e+109)
		tmp = (x * y) * (0.5 / a);
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

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[(x * N[(y * N[(0.5 / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(x * y), $MachinePrecision], -4e+48], t$95$1, If[LessEqual[N[(x * y), $MachinePrecision], 1e-68], N[(-4.5 * N[(z * N[(t / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(x * y), $MachinePrecision], 4e+109], N[(N[(x * y), $MachinePrecision] * N[(0.5 / a), $MachinePrecision]), $MachinePrecision], t$95$1]]]]

Derivation

1. Split input into 3 regimes

2. if (*.f64 x y) < -4.00000000000000018e48 or 3.99999999999999993e109 < (*.f64 x y)

   1. Initial program 83.7%

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

      1. div-inv N/A

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

      2. *-lowering-*.f64 N/A

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

      3. sub-neg N/A

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

      4. +-commutative N/A

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

      5. associate-*l* N/A

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

      6. distribute-rgt-neg-in N/A

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

      7. accelerator-lowering-fma.f64 N/A

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

      8. *-commutative N/A

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

      9. distribute-rgt-neg-in N/A

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

      10. *-lowering-*.f64 N/A

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

      11. metadata-eval N/A

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

      12. *-lowering-*.f64 N/A

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

      13. *-commutative N/A

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

      14. associate-/r* N/A

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

      15. /-lowering-/.f64 N/A

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

      16. metadata-eval 84.9

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

   4. Applied egg-rr 84.9%

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

   5. Taylor expanded in z around 0

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

      1. *-lowering-*.f64 70.3

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

   7. Simplified 70.3%

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

      1. associate-*l* N/A

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

      2. *-commutative N/A

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

      3. *-commutative N/A

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

      4. *-lowering-*.f64 N/A

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

      5. *-commutative N/A

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

      6. clear-num N/A

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

      7. un-div-inv N/A

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

      8. /-lowering-/.f64 N/A

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

      9. div-inv N/A

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

      10. metadata-eval N/A

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

      11. *-lowering-*.f64 79.2

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

   9. Applied egg-rr 79.2%

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

       1. clear-num N/A

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

       2. associate-/r/ N/A

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

       3. *-commutative N/A

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

       4. associate-/r* N/A

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

       5. metadata-eval N/A

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

       6. *-lowering-*.f64 N/A

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

       7. /-lowering-/.f64 79.2

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

   11. Applied egg-rr 79.2%

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

   if -4.00000000000000018e48 < (*.f64 x y) < 1.00000000000000007e-68

   1. Initial program 93.8%

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

   3. Taylor expanded in x around 0

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

      1. *-lowering-*.f64 N/A

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

      2. associate-/l* N/A

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

      3. *-lowering-*.f64 N/A

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

      4. /-lowering-/.f64 73.9

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

   5. Simplified 73.9%

      \[\leadsto \color{blue}{-4.5 \cdot \left(t \cdot \frac{z}{a}\right)} \]
   6. Step-by-step derivation

      1. *-commutative N/A

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

      2. div-inv N/A

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

      3. associate-*l* N/A

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

      4. *-lowering-*.f64 N/A

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

      5. *-lowering-*.f64 N/A

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

      6. /-lowering-/.f64 76.2

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

   7. Applied egg-rr 76.2%

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

      1. *-commutative N/A

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

      2. *-lowering-*.f64 N/A

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

      3. *-commutative N/A

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

      4. un-div-inv N/A

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

      5. /-lowering-/.f64 76.2

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

   9. Applied egg-rr 76.2%

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

   if 1.00000000000000007e-68 < (*.f64 x y) < 3.99999999999999993e109

   1. Initial program 99.7%

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

      1. div-inv N/A

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

      2. *-lowering-*.f64 N/A

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

      3. sub-neg N/A

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

      4. +-commutative N/A

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

      5. associate-*l* N/A

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

      6. distribute-rgt-neg-in N/A

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

      7. accelerator-lowering-fma.f64 N/A

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

      8. *-commutative N/A

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

      9. distribute-rgt-neg-in N/A

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

      10. *-lowering-*.f64 N/A

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

      11. metadata-eval N/A

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

      12. *-lowering-*.f64 N/A

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

      13. *-commutative N/A

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

      14. associate-/r* N/A

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

      15. /-lowering-/.f64 N/A

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

      16. metadata-eval 99.7

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

   4. Applied egg-rr 99.7%

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

   5. Taylor expanded in z around 0

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

      1. *-lowering-*.f64 70.0

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

   7. Simplified 70.0%

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

4. Final simplification 76.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \cdot y \leq -4 \cdot 10^{+48}:\\ \;\;\;\;x \cdot \left(y \cdot \frac{0.5}{a}\right)\\ \mathbf{elif}\;x \cdot y \leq 10^{-68}:\\ \;\;\;\;-4.5 \cdot \left(z \cdot \frac{t}{a}\right)\\ \mathbf{elif}\;x \cdot y \leq 4 \cdot 10^{+109}:\\ \;\;\;\;\left(x \cdot y\right) \cdot \frac{0.5}{a}\\ \mathbf{else}:\\ \;\;\;\;x \cdot \left(y \cdot \frac{0.5}{a}\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 73.8% accurate, 0.6× speedup

Math

\[\begin{array}{l} [x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\ \\ \begin{array}{l} t_1 := t \cdot \left(z \cdot 9\right)\\ \mathbf{if}\;t\_1 \leq -5 \cdot 10^{-59}:\\ \;\;\;\;\left(z \cdot t\right) \cdot \frac{-4.5}{a}\\ \mathbf{elif}\;t\_1 \leq 0.02:\\ \;\;\;\;\left(x \cdot y\right) \cdot \frac{0.5}{a}\\ \mathbf{else}:\\ \;\;\;\;t \cdot \left(z \cdot \frac{-4.5}{a}\right)\\ \end{array} \end{array} \]

FPCore

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 (* t (* z 9.0))))
   (if (<= t_1 -5e-59)
     (* (* z t) (/ -4.5 a))
     (if (<= t_1 0.02) (* (* x y) (/ 0.5 a)) (* t (* z (/ -4.5 a)))))))

C

assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
	double t_1 = t * (z * 9.0);
	double tmp;
	if (t_1 <= -5e-59) {
		tmp = (z * t) * (-4.5 / a);
	} else if (t_1 <= 0.02) {
		tmp = (x * y) * (0.5 / 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.
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) :: tmp
    t_1 = t * (z * 9.0d0)
    if (t_1 <= (-5d-59)) then
        tmp = (z * t) * ((-4.5d0) / a)
    else if (t_1 <= 0.02d0) then
        tmp = (x * y) * (0.5d0 / a)
    else
        tmp = t * (z * ((-4.5d0) / a))
    end if
    code = tmp
end function

Java

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 = t * (z * 9.0);
	double tmp;
	if (t_1 <= -5e-59) {
		tmp = (z * t) * (-4.5 / a);
	} else if (t_1 <= 0.02) {
		tmp = (x * y) * (0.5 / a);
	} else {
		tmp = t * (z * (-4.5 / a));
	}
	return tmp;
}

Python

[x, y, z, t, a] = sort([x, y, z, t, a])
def code(x, y, z, t, a):
	t_1 = t * (z * 9.0)
	tmp = 0
	if t_1 <= -5e-59:
		tmp = (z * t) * (-4.5 / a)
	elif t_1 <= 0.02:
		tmp = (x * y) * (0.5 / a)
	else:
		tmp = t * (z * (-4.5 / a))
	return tmp

Julia

x, y, z, t, a = sort([x, y, z, t, a])
function code(x, y, z, t, a)
	t_1 = Float64(t * Float64(z * 9.0))
	tmp = 0.0
	if (t_1 <= -5e-59)
		tmp = Float64(Float64(z * t) * Float64(-4.5 / a));
	elseif (t_1 <= 0.02)
		tmp = Float64(Float64(x * y) * Float64(0.5 / a));
	else
		tmp = Float64(t * Float64(z * Float64(-4.5 / a)));
	end
	return tmp
end

MATLAB

x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
function tmp_2 = code(x, y, z, t, a)
	t_1 = t * (z * 9.0);
	tmp = 0.0;
	if (t_1 <= -5e-59)
		tmp = (z * t) * (-4.5 / a);
	elseif (t_1 <= 0.02)
		tmp = (x * y) * (0.5 / 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.
code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(t * N[(z * 9.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -5e-59], N[(N[(z * t), $MachinePrecision] * N[(-4.5 / a), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 0.02], N[(N[(x * y), $MachinePrecision] * N[(0.5 / a), $MachinePrecision]), $MachinePrecision], N[(t * N[(z * N[(-4.5 / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if (*.f64 (*.f64 z #s(literal 9 binary64)) t) < -5.0000000000000001e-59

   1. Initial program 89.8%

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

   3. Taylor expanded in x around 0

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

      1. *-lowering-*.f64 N/A

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

      2. associate-/l* N/A

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

      3. *-lowering-*.f64 N/A

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

      4. /-lowering-/.f64 68.3

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

   5. Simplified 68.3%

      \[\leadsto \color{blue}{-4.5 \cdot \left(t \cdot \frac{z}{a}\right)} \]
   6. Step-by-step derivation

      1. *-commutative N/A

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

      2. associate-*r/ N/A

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

      3. associate-*l/ N/A

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

      4. *-commutative N/A

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

      5. metadata-eval N/A

         \[\leadsto \frac{\left(z \cdot t\right) \cdot \color{blue}{\left(\mathsf{neg}\left(\frac{9}{2}\right)\right)}}{a} \]

      6. distribute-rgt-neg-in N/A

         \[\leadsto \frac{\color{blue}{\mathsf{neg}\left(\left(z \cdot t\right) \cdot \frac{9}{2}\right)}}{a} \]

      7. associate-*r* N/A

         \[\leadsto \frac{\mathsf{neg}\left(\color{blue}{z \cdot \left(t \cdot \frac{9}{2}\right)}\right)}{a} \]

      8. distribute-neg-frac N/A

         \[\leadsto \color{blue}{\mathsf{neg}\left(\frac{z \cdot \left(t \cdot \frac{9}{2}\right)}{a}\right)} \]

      9. associate-*r/ N/A

         \[\leadsto \mathsf{neg}\left(\color{blue}{z \cdot \frac{t \cdot \frac{9}{2}}{a}}\right) \]

      10. associate-/l* N/A

          \[\leadsto \mathsf{neg}\left(z \cdot \color{blue}{\left(t \cdot \frac{\frac{9}{2}}{a}\right)}\right) \]

      11. associate-*r* N/A

          \[\leadsto \mathsf{neg}\left(\color{blue}{\left(z \cdot t\right) \cdot \frac{\frac{9}{2}}{a}}\right) \]

      12. distribute-rgt-neg-in N/A

          \[\leadsto \color{blue}{\left(z \cdot t\right) \cdot \left(\mathsf{neg}\left(\frac{\frac{9}{2}}{a}\right)\right)} \]

      13. *-lowering-*.f64 N/A

          \[\leadsto \color{blue}{\left(z \cdot t\right) \cdot \left(\mathsf{neg}\left(\frac{\frac{9}{2}}{a}\right)\right)} \]

      14. *-lowering-*.f64 N/A

          \[\leadsto \color{blue}{\left(z \cdot t\right)} \cdot \left(\mathsf{neg}\left(\frac{\frac{9}{2}}{a}\right)\right) \]

      15. distribute-neg-frac N/A

          \[\leadsto \left(z \cdot t\right) \cdot \color{blue}{\frac{\mathsf{neg}\left(\frac{9}{2}\right)}{a}} \]

      16. metadata-eval N/A

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

      17. /-lowering-/.f64 70.5

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

   7. Applied egg-rr 70.5%

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

   if -5.0000000000000001e-59 < (*.f64 (*.f64 z #s(literal 9 binary64)) t) < 0.0200000000000000004

   1. Initial program 95.0%

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

      1. div-inv N/A

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

      2. *-lowering-*.f64 N/A

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

      3. sub-neg N/A

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

      4. +-commutative N/A

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

      5. associate-*l* N/A

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

      6. distribute-rgt-neg-in N/A

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

      7. accelerator-lowering-fma.f64 N/A

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

      8. *-commutative N/A

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

      9. distribute-rgt-neg-in N/A

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

      10. *-lowering-*.f64 N/A

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

      11. metadata-eval N/A

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

      12. *-lowering-*.f64 N/A

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

      13. *-commutative N/A

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

      14. associate-/r* N/A

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

      15. /-lowering-/.f64 N/A

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

      16. metadata-eval 95.0

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

   4. Applied egg-rr 95.0%

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

   5. Taylor expanded in z around 0

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

      1. *-lowering-*.f64 76.2

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

   7. Simplified 76.2%

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

   if 0.0200000000000000004 < (*.f64 (*.f64 z #s(literal 9 binary64)) t)

   1. Initial program 83.5%

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

   3. Taylor expanded in x around 0

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

      1. *-lowering-*.f64 N/A

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

      2. associate-/l* N/A

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

      3. *-lowering-*.f64 N/A

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

      4. /-lowering-/.f64 72.5

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

   5. Simplified 72.5%

      \[\leadsto \color{blue}{-4.5 \cdot \left(t \cdot \frac{z}{a}\right)} \]
   6. Step-by-step derivation

      1. *-commutative N/A

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

      2. div-inv N/A

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

      3. associate-*l* N/A

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

      4. *-lowering-*.f64 N/A

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

      5. *-lowering-*.f64 N/A

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

      6. /-lowering-/.f64 76.8

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

   7. Applied egg-rr 76.8%

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

      1. *-commutative N/A

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

      2. associate-*r* N/A

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

      3. associate-*l* N/A

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

      4. *-commutative N/A

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

      5. div-inv N/A

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

      6. associate-/l* N/A

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

      7. *-commutative N/A

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

      8. associate-*l* N/A

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

      9. *-lowering-*.f64 N/A

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

      10. *-lowering-*.f64 N/A

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

      11. /-lowering-/.f64 72.6

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

   9. Applied egg-rr 72.6%

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

4. Final simplification 73.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;t \cdot \left(z \cdot 9\right) \leq -5 \cdot 10^{-59}:\\ \;\;\;\;\left(z \cdot t\right) \cdot \frac{-4.5}{a}\\ \mathbf{elif}\;t \cdot \left(z \cdot 9\right) \leq 0.02:\\ \;\;\;\;\left(x \cdot y\right) \cdot \frac{0.5}{a}\\ \mathbf{else}:\\ \;\;\;\;t \cdot \left(z \cdot \frac{-4.5}{a}\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 8: 74.1% accurate, 0.6× speedup

Math

\[\begin{array}{l} [x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\ \\ \begin{array}{l} t_1 := t \cdot \left(z \cdot 9\right)\\ t_2 := t \cdot \left(z \cdot \frac{-4.5}{a}\right)\\ \mathbf{if}\;t\_1 \leq -5 \cdot 10^{-59}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;t\_1 \leq 0.02:\\ \;\;\;\;\left(x \cdot y\right) \cdot \frac{0.5}{a}\\ \mathbf{else}:\\ \;\;\;\;t\_2\\ \end{array} \end{array} \]

FPCore

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 (* t (* z 9.0))) (t_2 (* t (* z (/ -4.5 a)))))
   (if (<= t_1 -5e-59) t_2 (if (<= t_1 0.02) (* (* x y) (/ 0.5 a)) t_2))))

C

assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
	double t_1 = t * (z * 9.0);
	double t_2 = t * (z * (-4.5 / a));
	double tmp;
	if (t_1 <= -5e-59) {
		tmp = t_2;
	} else if (t_1 <= 0.02) {
		tmp = (x * y) * (0.5 / a);
	} else {
		tmp = t_2;
	}
	return tmp;
}

Fortran

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) :: t_1
    real(8) :: t_2
    real(8) :: tmp
    t_1 = t * (z * 9.0d0)
    t_2 = t * (z * ((-4.5d0) / a))
    if (t_1 <= (-5d-59)) then
        tmp = t_2
    else if (t_1 <= 0.02d0) then
        tmp = (x * y) * (0.5d0 / a)
    else
        tmp = t_2
    end if
    code = tmp
end function

Java

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 = t * (z * 9.0);
	double t_2 = t * (z * (-4.5 / a));
	double tmp;
	if (t_1 <= -5e-59) {
		tmp = t_2;
	} else if (t_1 <= 0.02) {
		tmp = (x * y) * (0.5 / a);
	} else {
		tmp = t_2;
	}
	return tmp;
}

Python

[x, y, z, t, a] = sort([x, y, z, t, a])
def code(x, y, z, t, a):
	t_1 = t * (z * 9.0)
	t_2 = t * (z * (-4.5 / a))
	tmp = 0
	if t_1 <= -5e-59:
		tmp = t_2
	elif t_1 <= 0.02:
		tmp = (x * y) * (0.5 / a)
	else:
		tmp = t_2
	return tmp

Julia

x, y, z, t, a = sort([x, y, z, t, a])
function code(x, y, z, t, a)
	t_1 = Float64(t * Float64(z * 9.0))
	t_2 = Float64(t * Float64(z * Float64(-4.5 / a)))
	tmp = 0.0
	if (t_1 <= -5e-59)
		tmp = t_2;
	elseif (t_1 <= 0.02)
		tmp = Float64(Float64(x * y) * Float64(0.5 / a));
	else
		tmp = t_2;
	end
	return tmp
end

MATLAB

x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
function tmp_2 = code(x, y, z, t, a)
	t_1 = t * (z * 9.0);
	t_2 = t * (z * (-4.5 / a));
	tmp = 0.0;
	if (t_1 <= -5e-59)
		tmp = t_2;
	elseif (t_1 <= 0.02)
		tmp = (x * y) * (0.5 / a);
	else
		tmp = t_2;
	end
	tmp_2 = tmp;
end

Wolfram

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[(t * N[(z * 9.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(t * N[(z * N[(-4.5 / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -5e-59], t$95$2, If[LessEqual[t$95$1, 0.02], N[(N[(x * y), $MachinePrecision] * N[(0.5 / a), $MachinePrecision]), $MachinePrecision], t$95$2]]]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (*.f64 z #s(literal 9 binary64)) t) < -5.0000000000000001e-59 or 0.0200000000000000004 < (*.f64 (*.f64 z #s(literal 9 binary64)) t)

   1. Initial program 87.1%

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

   3. Taylor expanded in x around 0

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

      1. *-lowering-*.f64 N/A

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

      2. associate-/l* N/A

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

      3. *-lowering-*.f64 N/A

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

      4. /-lowering-/.f64 70.1

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

   5. Simplified 70.1%

      \[\leadsto \color{blue}{-4.5 \cdot \left(t \cdot \frac{z}{a}\right)} \]
   6. Step-by-step derivation

      1. *-commutative N/A

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

      2. div-inv N/A

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

      3. associate-*l* N/A

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

      4. *-lowering-*.f64 N/A

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

      5. *-lowering-*.f64 N/A

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

      6. /-lowering-/.f64 73.9

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

   7. Applied egg-rr 73.9%

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

      1. *-commutative N/A

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

      2. associate-*r* N/A

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

      3. associate-*l* N/A

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

      4. *-commutative N/A

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

      5. div-inv N/A

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

      6. associate-/l* N/A

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

      7. *-commutative N/A

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

      8. associate-*l* N/A

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

      9. *-lowering-*.f64 N/A

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

      10. *-lowering-*.f64 N/A

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

      11. /-lowering-/.f64 70.2

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

   9. Applied egg-rr 70.2%

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

   if -5.0000000000000001e-59 < (*.f64 (*.f64 z #s(literal 9 binary64)) t) < 0.0200000000000000004

   1. Initial program 95.0%

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

      1. div-inv N/A

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

      2. *-lowering-*.f64 N/A

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

      3. sub-neg N/A

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

      4. +-commutative N/A

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

      5. associate-*l* N/A

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

      6. distribute-rgt-neg-in N/A

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

      7. accelerator-lowering-fma.f64 N/A

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

      8. *-commutative N/A

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

      9. distribute-rgt-neg-in N/A

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

      10. *-lowering-*.f64 N/A

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

      11. metadata-eval N/A

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

      12. *-lowering-*.f64 N/A

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

      13. *-commutative N/A

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

      14. associate-/r* N/A

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

      15. /-lowering-/.f64 N/A

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

      16. metadata-eval 95.0

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

   4. Applied egg-rr 95.0%

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

   5. Taylor expanded in z around 0

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

      1. *-lowering-*.f64 76.2

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

   7. Simplified 76.2%

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

4. Final simplification 73.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;t \cdot \left(z \cdot 9\right) \leq -5 \cdot 10^{-59}:\\ \;\;\;\;t \cdot \left(z \cdot \frac{-4.5}{a}\right)\\ \mathbf{elif}\;t \cdot \left(z \cdot 9\right) \leq 0.02:\\ \;\;\;\;\left(x \cdot y\right) \cdot \frac{0.5}{a}\\ \mathbf{else}:\\ \;\;\;\;t \cdot \left(z \cdot \frac{-4.5}{a}\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 9: 72.9% accurate, 0.8× speedup

Math

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

FPCore

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 (* a 2.0)))))
   (if (<= (* x y) -4e+48)
     t_1
     (if (<= (* x y) 1e-68) (* (/ t a) (* z -4.5)) t_1))))

C

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 / (a * 2.0));
	double tmp;
	if ((x * y) <= -4e+48) {
		tmp = t_1;
	} else if ((x * y) <= 1e-68) {
		tmp = (t / a) * (z * -4.5);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Fortran

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) :: t_1
    real(8) :: tmp
    t_1 = x * (y / (a * 2.0d0))
    if ((x * y) <= (-4d+48)) then
        tmp = t_1
    else if ((x * y) <= 1d-68) then
        tmp = (t / a) * (z * (-4.5d0))
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

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 / (a * 2.0));
	double tmp;
	if ((x * y) <= -4e+48) {
		tmp = t_1;
	} else if ((x * y) <= 1e-68) {
		tmp = (t / a) * (z * -4.5);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

[x, y, z, t, a] = sort([x, y, z, t, a])
def code(x, y, z, t, a):
	t_1 = x * (y / (a * 2.0))
	tmp = 0
	if (x * y) <= -4e+48:
		tmp = t_1
	elif (x * y) <= 1e-68:
		tmp = (t / a) * (z * -4.5)
	else:
		tmp = t_1
	return tmp

Julia

x, y, z, t, a = sort([x, y, z, t, a])
function code(x, y, z, t, a)
	t_1 = Float64(x * Float64(y / Float64(a * 2.0)))
	tmp = 0.0
	if (Float64(x * y) <= -4e+48)
		tmp = t_1;
	elseif (Float64(x * y) <= 1e-68)
		tmp = Float64(Float64(t / a) * Float64(z * -4.5));
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

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 / (a * 2.0));
	tmp = 0.0;
	if ((x * y) <= -4e+48)
		tmp = t_1;
	elseif ((x * y) <= 1e-68)
		tmp = (t / a) * (z * -4.5);
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

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[(x * N[(y / N[(a * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(x * y), $MachinePrecision], -4e+48], t$95$1, If[LessEqual[N[(x * y), $MachinePrecision], 1e-68], N[(N[(t / a), $MachinePrecision] * N[(z * -4.5), $MachinePrecision]), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 x y) < -4.00000000000000018e48 or 1.00000000000000007e-68 < (*.f64 x y)

   1. Initial program 87.7%

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

      1. div-inv N/A

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

      2. *-lowering-*.f64 N/A

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

      3. sub-neg N/A

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

      4. +-commutative N/A

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

      5. associate-*l* N/A

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

      6. distribute-rgt-neg-in N/A

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

      7. accelerator-lowering-fma.f64 N/A

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

      8. *-commutative N/A

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

      9. distribute-rgt-neg-in N/A

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

      10. *-lowering-*.f64 N/A

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

      11. metadata-eval N/A

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

      12. *-lowering-*.f64 N/A

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

      13. *-commutative N/A

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

      14. associate-/r* N/A

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

      15. /-lowering-/.f64 N/A

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

      16. metadata-eval 88.6

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

   4. Applied egg-rr 88.6%

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

   5. Taylor expanded in z around 0

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

      1. *-lowering-*.f64 70.2

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

   7. Simplified 70.2%

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

      1. associate-*l* N/A

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

      2. *-commutative N/A

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

      3. *-commutative N/A

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

      4. *-lowering-*.f64 N/A

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

      5. *-commutative N/A

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

      6. clear-num N/A

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

      7. un-div-inv N/A

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

      8. /-lowering-/.f64 N/A

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

      9. div-inv N/A

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

      10. metadata-eval N/A

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

      11. *-lowering-*.f64 73.9

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

   9. Applied egg-rr 73.9%

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

   if -4.00000000000000018e48 < (*.f64 x y) < 1.00000000000000007e-68

   1. Initial program 93.8%

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

   3. Taylor expanded in x around 0

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

      1. *-lowering-*.f64 N/A

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

      2. associate-/l* N/A

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

      3. *-lowering-*.f64 N/A

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

      4. /-lowering-/.f64 73.9

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

   5. Simplified 73.9%

      \[\leadsto \color{blue}{-4.5 \cdot \left(t \cdot \frac{z}{a}\right)} \]
   6. Step-by-step derivation

      1. *-commutative N/A

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

      2. div-inv N/A

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

      3. associate-*l* N/A

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

      4. *-lowering-*.f64 N/A

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

      5. *-lowering-*.f64 N/A

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

      6. /-lowering-/.f64 76.2

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

   7. Applied egg-rr 76.2%

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

      1. associate-*r* N/A

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

      2. *-commutative N/A

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

      3. *-lowering-*.f64 N/A

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

      4. *-commutative N/A

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

      5. un-div-inv N/A

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

      6. /-lowering-/.f64 N/A

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

      7. *-commutative N/A

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

      8. *-lowering-*.f64 76.3

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

   9. Applied egg-rr 76.3%

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

4. Final simplification 75.1%

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

Alternative 10: 93.7% accurate, 0.8× speedup

Math

\[\begin{array}{l} [x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\ \\ \begin{array}{l} \mathbf{if}\;x \cdot y \leq -\infty:\\ \;\;\;\;y \cdot \left(x \cdot \frac{-0.5}{-a}\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{\mathsf{fma}\left(z \cdot -9, t, x \cdot y\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.
(FPCore (x y z t a)
 :precision binary64
 (if (<= (* x y) (- INFINITY))
   (* y (* x (/ -0.5 (- a))))
   (/ (fma (* z -9.0) t (* x y)) (* a 2.0))))

C

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 * (-0.5 / -a));
	} else {
		tmp = fma((z * -9.0), t, (x * y)) / (a * 2.0);
	}
	return tmp;
}

Julia

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(y * Float64(x * Float64(-0.5 / Float64(-a))));
	else
		tmp = Float64(fma(Float64(z * -9.0), t, Float64(x * y)) / 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.
code[x_, y_, z_, t_, a_] := If[LessEqual[N[(x * y), $MachinePrecision], (-Infinity)], N[(y * N[(x * N[(-0.5 / (-a)), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(z * -9.0), $MachinePrecision] * t + N[(x * y), $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 54.9%

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

      1. div-inv N/A

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

      2. *-lowering-*.f64 N/A

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

      3. sub-neg N/A

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

      4. +-commutative N/A

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

      5. associate-*l* N/A

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

      6. distribute-rgt-neg-in N/A

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

      7. accelerator-lowering-fma.f64 N/A

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

      8. *-commutative N/A

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

      9. distribute-rgt-neg-in N/A

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

      10. *-lowering-*.f64 N/A

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

      11. metadata-eval N/A

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

      12. *-lowering-*.f64 N/A

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

      13. *-commutative N/A

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

      14. associate-/r* N/A

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

      15. /-lowering-/.f64 N/A

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

      16. metadata-eval 60.4

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

   4. Applied egg-rr 60.4%

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

   5. Taylor expanded in z around 0

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

      1. *-lowering-*.f64 60.4

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

   7. Simplified 60.4%

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

      1. associate-*l* N/A

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

      2. *-commutative N/A

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

      3. *-commutative N/A

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

      4. *-lowering-*.f64 N/A

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

      5. *-commutative N/A

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

      6. clear-num N/A

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

      7. un-div-inv N/A

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

      8. /-lowering-/.f64 N/A

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

      9. div-inv N/A

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

      10. metadata-eval N/A

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

      11. *-lowering-*.f64 99.9

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

   9. Applied egg-rr 99.9%

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

       1. frac-2neg N/A

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

       2. div-inv N/A

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

       3. associate-*l* N/A

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

       4. metadata-eval N/A

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

       5. div-inv N/A

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

       6. distribute-neg-frac2 N/A

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

       7. clear-num N/A

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

       8. *-lowering-*.f64 N/A

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

       9. neg-lowering-neg.f64 N/A

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

       10. *-lowering-*.f64 N/A

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

       11. /-lowering-/.f64 N/A

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

       12. metadata-eval 99.6

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

   11. Applied egg-rr 99.6%

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

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

   1. Initial program 93.7%

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

      1. sub-neg N/A

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

      2. +-commutative N/A

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

      3. distribute-lft-neg-in N/A

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

      4. accelerator-lowering-fma.f64 N/A

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

      5. distribute-rgt-neg-in N/A

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

      6. *-lowering-*.f64 N/A

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

      7. metadata-eval N/A

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

      8. *-lowering-*.f64 93.7

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

   4. Applied egg-rr 93.7%

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

4. Final simplification 94.1%

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

Alternative 11: 93.7% accurate, 0.8× speedup

Math

\[\begin{array}{l} [x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\ \\ \begin{array}{l} \mathbf{if}\;x \cdot y \leq -\infty:\\ \;\;\;\;y \cdot \left(x \cdot \frac{-0.5}{-a}\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{\mathsf{fma}\left(t \cdot -9, z, x \cdot y\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.
(FPCore (x y z t a)
 :precision binary64
 (if (<= (* x y) (- INFINITY))
   (* y (* x (/ -0.5 (- a))))
   (/ (fma (* t -9.0) z (* x y)) (* a 2.0))))

C

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 * (-0.5 / -a));
	} else {
		tmp = fma((t * -9.0), z, (x * y)) / (a * 2.0);
	}
	return tmp;
}

Julia

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(y * Float64(x * Float64(-0.5 / Float64(-a))));
	else
		tmp = Float64(fma(Float64(t * -9.0), z, Float64(x * y)) / 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.
code[x_, y_, z_, t_, a_] := If[LessEqual[N[(x * y), $MachinePrecision], (-Infinity)], N[(y * N[(x * N[(-0.5 / (-a)), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(t * -9.0), $MachinePrecision] * z + N[(x * y), $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 54.9%

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

      1. div-inv N/A

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

      2. *-lowering-*.f64 N/A

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

      3. sub-neg N/A

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

      4. +-commutative N/A

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

      5. associate-*l* N/A

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

      6. distribute-rgt-neg-in N/A

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

      7. accelerator-lowering-fma.f64 N/A

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

      8. *-commutative N/A

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

      9. distribute-rgt-neg-in N/A

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

      10. *-lowering-*.f64 N/A

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

      11. metadata-eval N/A

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

      12. *-lowering-*.f64 N/A

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

      13. *-commutative N/A

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

      14. associate-/r* N/A

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

      15. /-lowering-/.f64 N/A

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

      16. metadata-eval 60.4

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

   4. Applied egg-rr 60.4%

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

   5. Taylor expanded in z around 0

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

      1. *-lowering-*.f64 60.4

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

   7. Simplified 60.4%

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

      1. associate-*l* N/A

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

      2. *-commutative N/A

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

      3. *-commutative N/A

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

      4. *-lowering-*.f64 N/A

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

      5. *-commutative N/A

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

      6. clear-num N/A

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

      7. un-div-inv N/A

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

      8. /-lowering-/.f64 N/A

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

      9. div-inv N/A

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

      10. metadata-eval N/A

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

      11. *-lowering-*.f64 99.9

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

   9. Applied egg-rr 99.9%

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

       1. frac-2neg N/A

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

       2. div-inv N/A

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

       3. associate-*l* N/A

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

       4. metadata-eval N/A

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

       5. div-inv N/A

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

       6. distribute-neg-frac2 N/A

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

       7. clear-num N/A

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

       8. *-lowering-*.f64 N/A

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

       9. neg-lowering-neg.f64 N/A

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

       10. *-lowering-*.f64 N/A

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

       11. /-lowering-/.f64 N/A

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

       12. metadata-eval 99.6

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

   11. Applied egg-rr 99.6%

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

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

   1. Initial program 93.7%

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

      1. sub-neg N/A

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

      2. +-commutative N/A

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

      3. associate-*l* N/A

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

      4. *-commutative N/A

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

      5. distribute-lft-neg-in N/A

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

      6. accelerator-lowering-fma.f64 N/A

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

      7. *-commutative N/A

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

      8. distribute-rgt-neg-in N/A

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

      9. *-lowering-*.f64 N/A

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

      10. metadata-eval N/A

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

      11. *-lowering-*.f64 93.7

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

   4. Applied egg-rr 93.7%

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

4. Final simplification 94.1%

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

Alternative 12: 93.6% accurate, 0.8× speedup

Math

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

FPCore

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 (/ -0.5 (- a))))
   (* (fma z (* t -9.0) (* x y)) (/ 0.5 a))))

C

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 * (-0.5 / -a));
	} else {
		tmp = fma(z, (t * -9.0), (x * y)) * (0.5 / a);
	}
	return tmp;
}

Julia

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(y * Float64(x * Float64(-0.5 / Float64(-a))));
	else
		tmp = Float64(fma(z, Float64(t * -9.0), Float64(x * y)) * Float64(0.5 / a));
	end
	return tmp
end

Wolfram

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[(y * N[(x * N[(-0.5 / (-a)), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(z * N[(t * -9.0), $MachinePrecision] + N[(x * y), $MachinePrecision]), $MachinePrecision] * N[(0.5 / a), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

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

   1. Initial program 54.9%

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

      1. div-inv N/A

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

      2. *-lowering-*.f64 N/A

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

      3. sub-neg N/A

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

      4. +-commutative N/A

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

      5. associate-*l* N/A

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

      6. distribute-rgt-neg-in N/A

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

      7. accelerator-lowering-fma.f64 N/A

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

      8. *-commutative N/A

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

      9. distribute-rgt-neg-in N/A

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

      10. *-lowering-*.f64 N/A

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

      11. metadata-eval N/A

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

      12. *-lowering-*.f64 N/A

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

      13. *-commutative N/A

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

      14. associate-/r* N/A

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

      15. /-lowering-/.f64 N/A

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

      16. metadata-eval 60.4

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

   4. Applied egg-rr 60.4%

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

   5. Taylor expanded in z around 0

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

      1. *-lowering-*.f64 60.4

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

   7. Simplified 60.4%

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

      1. associate-*l* N/A

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

      2. *-commutative N/A

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

      3. *-commutative N/A

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

      4. *-lowering-*.f64 N/A

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

      5. *-commutative N/A

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

      6. clear-num N/A

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

      7. un-div-inv N/A

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

      8. /-lowering-/.f64 N/A

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

      9. div-inv N/A

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

      10. metadata-eval N/A

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

      11. *-lowering-*.f64 99.9

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

   9. Applied egg-rr 99.9%

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

       1. frac-2neg N/A

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

       2. div-inv N/A

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

       3. associate-*l* N/A

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

       4. metadata-eval N/A

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

       5. div-inv N/A

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

       6. distribute-neg-frac2 N/A

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

       7. clear-num N/A

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

       8. *-lowering-*.f64 N/A

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

       9. neg-lowering-neg.f64 N/A

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

       10. *-lowering-*.f64 N/A

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

       11. /-lowering-/.f64 N/A

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

       12. metadata-eval 99.6

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

   11. Applied egg-rr 99.6%

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

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

   1. Initial program 93.7%

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

      1. div-inv N/A

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

      2. *-lowering-*.f64 N/A

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

      3. sub-neg N/A

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

      4. +-commutative N/A

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

      5. associate-*l* N/A

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

      6. distribute-rgt-neg-in N/A

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

      7. accelerator-lowering-fma.f64 N/A

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

      8. *-commutative N/A

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

      9. distribute-rgt-neg-in N/A

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

      10. *-lowering-*.f64 N/A

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

      11. metadata-eval N/A

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

      12. *-lowering-*.f64 N/A

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

      13. *-commutative N/A

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

      14. associate-/r* N/A

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

      15. /-lowering-/.f64 N/A

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

      16. metadata-eval 93.7

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

   4. Applied egg-rr 93.7%

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

4. Final simplification 94.1%

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

Alternative 13: 51.2% accurate, 1.6× speedup

Math

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

FPCore

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 (* t (* z (/ -4.5 a))))

C

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

Fortran

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 = t * (z * ((-4.5d0) / a))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 90.8%

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

3. Taylor expanded in x around 0

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

   1. *-lowering-*.f64 N/A

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

   2. associate-/l* N/A

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

   3. *-lowering-*.f64 N/A

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

   4. /-lowering-/.f64 50.3

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

5. Simplified 50.3%

   \[\leadsto \color{blue}{-4.5 \cdot \left(t \cdot \frac{z}{a}\right)} \]
6. Step-by-step derivation

   1. *-commutative N/A

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

   2. div-inv N/A

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

   3. associate-*l* N/A

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

   4. *-lowering-*.f64 N/A

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

   5. *-lowering-*.f64 N/A

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

   6. /-lowering-/.f64 51.9

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

7. Applied egg-rr 51.9%

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

   1. *-commutative N/A

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

   2. associate-*r* N/A

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

   3. associate-*l* N/A

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

   4. *-commutative N/A

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

   5. div-inv N/A

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

   6. associate-/l* N/A

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

   7. *-commutative N/A

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

   8. associate-*l* N/A

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

   9. *-lowering-*.f64 N/A

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

   10. *-lowering-*.f64 N/A

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

   11. /-lowering-/.f64 50.3

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

9. Applied egg-rr 50.3%

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

Alternative 14: 51.2% accurate, 1.6× speedup

Math

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

FPCore

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 (* t (/ z a))))

C

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

Fortran

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

Java

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 * (t * (z / a));
}

Python

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

Julia

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

MATLAB

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

Wolfram

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[(t * N[(z / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 90.8%

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

3. Taylor expanded in x around 0

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

   1. *-lowering-*.f64 N/A

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

   2. associate-/l* N/A

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

   3. *-lowering-*.f64 N/A

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

   4. /-lowering-/.f64 50.3

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

5. Simplified 50.3%

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

Developer Target 1: 93.8% accurate, 0.6× 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 2024199 
(FPCore (x y z t a)
  :name "Diagrams.Solve.Polynomial:cubForm  from diagrams-solve-0.1, I"
  :precision binary64

  :alt
  (! :herbie-platform default (if (< a -209046455797670900000000000000000000000000000000000000000000000000000000000000000000000) (- (* 1/2 (/ (* y x) a)) (* 9/2 (/ t (/ a z)))) (if (< a 2144030707833976000000000000000000000000000000000000000000000000000000000000000000000000000000000000) (/ (- (* x y) (* z (* 9 t))) (* a 2)) (- (* (/ y a) (* x 1/2)) (* (/ t a) (* z 9/2))))))

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