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

Percentage Accurate: 91.2% → 94.7%

Time: 9.5s

Alternatives: 9

Speedup: 0.6×

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

Specification

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 91.2% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 94.7% accurate, 0.6× speedup

Math

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

FPCore

a\_m = (fabs.f64 a)
a\_s = (copysign.f64 #s(literal 1 binary64) a)
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
(FPCore (a_s x y z t a_m)
 :precision binary64
 (*
  a_s
  (if (<= (* 2.0 a_m) 4e+27)
    (/ (fma y x (* -9.0 (* z t))) (* 2.0 a_m))
    (fma (/ x a_m) (* 0.5 y) (* (* (/ t a_m) -4.5) z)))))

C

a\_m = fabs(a);
a\_s = copysign(1.0, a);
assert(x < y && y < z && z < t && t < a_m);
assert(x < y && y < z && z < t && t < a_m);
double code(double a_s, double x, double y, double z, double t, double a_m) {
	double tmp;
	if ((2.0 * a_m) <= 4e+27) {
		tmp = fma(y, x, (-9.0 * (z * t))) / (2.0 * a_m);
	} else {
		tmp = fma((x / a_m), (0.5 * y), (((t / a_m) * -4.5) * z));
	}
	return a_s * tmp;
}

Julia

a\_m = abs(a)
a\_s = copysign(1.0, a)
x, y, z, t, a_m = sort([x, y, z, t, a_m])
x, y, z, t, a_m = sort([x, y, z, t, a_m])
function code(a_s, x, y, z, t, a_m)
	tmp = 0.0
	if (Float64(2.0 * a_m) <= 4e+27)
		tmp = Float64(fma(y, x, Float64(-9.0 * Float64(z * t))) / Float64(2.0 * a_m));
	else
		tmp = fma(Float64(x / a_m), Float64(0.5 * y), Float64(Float64(Float64(t / a_m) * -4.5) * z));
	end
	return Float64(a_s * tmp)
end

Wolfram

a\_m = N[Abs[a], $MachinePrecision]
a\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[a]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
code[a$95$s_, x_, y_, z_, t_, a$95$m_] := N[(a$95$s * If[LessEqual[N[(2.0 * a$95$m), $MachinePrecision], 4e+27], N[(N[(y * x + N[(-9.0 * N[(z * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(2.0 * a$95$m), $MachinePrecision]), $MachinePrecision], N[(N[(x / a$95$m), $MachinePrecision] * N[(0.5 * y), $MachinePrecision] + N[(N[(N[(t / a$95$m), $MachinePrecision] * -4.5), $MachinePrecision] * z), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if (*.f64 a #s(literal 2 binary64)) < 4.0000000000000001e27

   1. Initial program 90.6%

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

      1. lift--.f64 N/A

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

      2. 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} \]

      3. lift-*.f64 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} \]

      4. *-commutative N/A

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

      5. lower-fma.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. *-commutative N/A

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

      8. lift-*.f64 N/A

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

      9. associate-*r* N/A

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

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

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

      11. lower-*.f64 N/A

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

      12. lower-*.f64 N/A

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

      13. metadata-eval 91.1

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

   4. Applied rewrites 91.1%

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

   if 4.0000000000000001e27 < (*.f64 a #s(literal 2 binary64))

   1. Initial program 80.9%

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

      1. lift-/.f64 N/A

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

      2. lift--.f64 N/A

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

      3. 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}} \]

      4. 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)} \]

      5. +-commutative N/A

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

      6. lift-*.f64 N/A

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

      7. *-commutative N/A

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

      8. lift-*.f64 N/A

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

      9. times-frac N/A

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

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

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

      11. lower-fma.f64 N/A

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

      12. lower-/.f64 N/A

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

      13. lower-neg.f64 N/A

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

      14. lift-*.f64 N/A

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

      15. associate-/l* N/A

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

      16. lower-*.f64 N/A

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

      17. metadata-eval N/A

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

      18. lift-*.f64 N/A

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

      19. *-commutative N/A

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

      20. associate-/l* N/A

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

      21. *-commutative N/A

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

      22. lower-*.f64 N/A

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

   4. Applied rewrites 91.2%

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

      1. lift-fma.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-*.f64 N/A

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

      4. *-commutative N/A

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

      5. lift-*.f64 N/A

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

      6. lift-/.f64 N/A

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

      7. metadata-eval N/A

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

      8. associate-/r* N/A

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

      9. *-commutative N/A

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

      10. lift-*.f64 N/A

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

      11. un-div-inv N/A

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

      12. associate-/l* N/A

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

      13. *-commutative N/A

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

      14. lift-*.f64 N/A

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

      15. times-frac N/A

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

      16. lower-fma.f64 N/A

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

      17. lower-/.f64 N/A

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

      18. div-inv N/A

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

      19. metadata-eval N/A

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

      20. lower-*.f64 N/A

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

      21. lift-neg.f64 N/A

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

      22. lift-*.f64 N/A

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

      23. *-commutative N/A

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

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

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

      25. metadata-eval N/A

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

   6. Applied rewrites 91.2%

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

4. Final simplification 91.1%

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

Alternative 2: 95.0% accurate, 0.5× speedup

Math

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

FPCore

a\_m = (fabs.f64 a)
a\_s = (copysign.f64 #s(literal 1 binary64) a)
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
(FPCore (a_s x y z t a_m)
 :precision binary64
 (let* ((t_1 (* (* (/ -4.5 a_m) z) t)) (t_2 (* (* 9.0 z) t)))
   (*
    a_s
    (if (<= t_2 (- INFINITY))
      t_1
      (if (<= t_2 1e+295) (/ (fma y x (* -9.0 (* z t))) (* 2.0 a_m)) t_1)))))

C

a\_m = fabs(a);
a\_s = copysign(1.0, a);
assert(x < y && y < z && z < t && t < a_m);
assert(x < y && y < z && z < t && t < a_m);
double code(double a_s, double x, double y, double z, double t, double a_m) {
	double t_1 = ((-4.5 / a_m) * z) * t;
	double t_2 = (9.0 * z) * t;
	double tmp;
	if (t_2 <= -((double) INFINITY)) {
		tmp = t_1;
	} else if (t_2 <= 1e+295) {
		tmp = fma(y, x, (-9.0 * (z * t))) / (2.0 * a_m);
	} else {
		tmp = t_1;
	}
	return a_s * tmp;
}

Julia

a\_m = abs(a)
a\_s = copysign(1.0, a)
x, y, z, t, a_m = sort([x, y, z, t, a_m])
x, y, z, t, a_m = sort([x, y, z, t, a_m])
function code(a_s, x, y, z, t, a_m)
	t_1 = Float64(Float64(Float64(-4.5 / a_m) * z) * t)
	t_2 = Float64(Float64(9.0 * z) * t)
	tmp = 0.0
	if (t_2 <= Float64(-Inf))
		tmp = t_1;
	elseif (t_2 <= 1e+295)
		tmp = Float64(fma(y, x, Float64(-9.0 * Float64(z * t))) / Float64(2.0 * a_m));
	else
		tmp = t_1;
	end
	return Float64(a_s * tmp)
end

Wolfram

a\_m = N[Abs[a], $MachinePrecision]
a\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[a]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
code[a$95$s_, x_, y_, z_, t_, a$95$m_] := Block[{t$95$1 = N[(N[(N[(-4.5 / a$95$m), $MachinePrecision] * z), $MachinePrecision] * t), $MachinePrecision]}, Block[{t$95$2 = N[(N[(9.0 * z), $MachinePrecision] * t), $MachinePrecision]}, N[(a$95$s * If[LessEqual[t$95$2, (-Infinity)], t$95$1, If[LessEqual[t$95$2, 1e+295], N[(N[(y * x + N[(-9.0 * N[(z * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(2.0 * a$95$m), $MachinePrecision]), $MachinePrecision], t$95$1]]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (*.f64 z #s(literal 9 binary64)) t) < -inf.0 or 9.9999999999999998e294 < (*.f64 (*.f64 z #s(literal 9 binary64)) t)

   1. Initial program 58.9%

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

   3. Taylor expanded in t around inf

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

      1. associate-*l/ N/A

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

      2. associate-*l* N/A

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

      3. lower-*.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. lower-/.f64 97.7

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

   5. Applied rewrites 97.7%

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

   6. Taylor expanded in t around inf

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

      1. associate-/l* N/A

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

      2. *-commutative N/A

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

      3. associate-*l* N/A

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

      4. lower-*.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 N/A

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

      7. lower-/.f64 97.6

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

   8. Applied rewrites 97.6%

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

   10. Applied rewrites 97.7%

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

   if -inf.0 < (*.f64 (*.f64 z #s(literal 9 binary64)) t) < 9.9999999999999998e294

   1. Initial program 94.0%

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

      1. lift--.f64 N/A

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

      2. 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} \]

      3. lift-*.f64 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} \]

      4. *-commutative N/A

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

      5. lower-fma.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. *-commutative N/A

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

      8. lift-*.f64 N/A

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

      9. associate-*r* N/A

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

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

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

      11. lower-*.f64 N/A

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

      12. lower-*.f64 N/A

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

      13. metadata-eval 93.9

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

   4. Applied rewrites 93.9%

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

4. Final simplification 94.6%

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

Alternative 3: 94.9% accurate, 0.5× speedup

Math

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

FPCore

a\_m = (fabs.f64 a)
a\_s = (copysign.f64 #s(literal 1 binary64) a)
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
(FPCore (a_s x y z t a_m)
 :precision binary64
 (let* ((t_1 (* (* (/ -4.5 a_m) z) t)) (t_2 (* (* 9.0 z) t)))
   (*
    a_s
    (if (<= t_2 (- INFINITY))
      t_1
      (if (<= t_2 1e+295) (* (/ 0.5 a_m) (fma (* z t) -9.0 (* x y))) t_1)))))

C

a\_m = fabs(a);
a\_s = copysign(1.0, a);
assert(x < y && y < z && z < t && t < a_m);
assert(x < y && y < z && z < t && t < a_m);
double code(double a_s, double x, double y, double z, double t, double a_m) {
	double t_1 = ((-4.5 / a_m) * z) * t;
	double t_2 = (9.0 * z) * t;
	double tmp;
	if (t_2 <= -((double) INFINITY)) {
		tmp = t_1;
	} else if (t_2 <= 1e+295) {
		tmp = (0.5 / a_m) * fma((z * t), -9.0, (x * y));
	} else {
		tmp = t_1;
	}
	return a_s * tmp;
}

Julia

a\_m = abs(a)
a\_s = copysign(1.0, a)
x, y, z, t, a_m = sort([x, y, z, t, a_m])
x, y, z, t, a_m = sort([x, y, z, t, a_m])
function code(a_s, x, y, z, t, a_m)
	t_1 = Float64(Float64(Float64(-4.5 / a_m) * z) * t)
	t_2 = Float64(Float64(9.0 * z) * t)
	tmp = 0.0
	if (t_2 <= Float64(-Inf))
		tmp = t_1;
	elseif (t_2 <= 1e+295)
		tmp = Float64(Float64(0.5 / a_m) * fma(Float64(z * t), -9.0, Float64(x * y)));
	else
		tmp = t_1;
	end
	return Float64(a_s * tmp)
end

Wolfram

a\_m = N[Abs[a], $MachinePrecision]
a\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[a]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
code[a$95$s_, x_, y_, z_, t_, a$95$m_] := Block[{t$95$1 = N[(N[(N[(-4.5 / a$95$m), $MachinePrecision] * z), $MachinePrecision] * t), $MachinePrecision]}, Block[{t$95$2 = N[(N[(9.0 * z), $MachinePrecision] * t), $MachinePrecision]}, N[(a$95$s * If[LessEqual[t$95$2, (-Infinity)], t$95$1, If[LessEqual[t$95$2, 1e+295], N[(N[(0.5 / a$95$m), $MachinePrecision] * N[(N[(z * t), $MachinePrecision] * -9.0 + N[(x * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$1]]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (*.f64 z #s(literal 9 binary64)) t) < -inf.0 or 9.9999999999999998e294 < (*.f64 (*.f64 z #s(literal 9 binary64)) t)

   1. Initial program 58.9%

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

   3. Taylor expanded in t around inf

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

      1. associate-*l/ N/A

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

      2. associate-*l* N/A

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

      3. lower-*.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. lower-/.f64 97.7

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

   5. Applied rewrites 97.7%

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

   6. Taylor expanded in t around inf

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

      1. associate-/l* N/A

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

      2. *-commutative N/A

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

      3. associate-*l* N/A

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

      4. lower-*.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 N/A

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

      7. lower-/.f64 97.6

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

   8. Applied rewrites 97.6%

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

   10. Applied rewrites 97.7%

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

   if -inf.0 < (*.f64 (*.f64 z #s(literal 9 binary64)) t) < 9.9999999999999998e294

   1. Initial program 94.0%

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

      1. lift-/.f64 N/A

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

      2. 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}} \]

      3. lower-*.f64 N/A

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

      4. lift--.f64 N/A

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

      5. 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} \]

      6. +-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} \]

      7. lift-*.f64 N/A

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

      8. *-commutative N/A

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

      9. lift-*.f64 N/A

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

      10. associate-*r* N/A

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

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

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

      12. lower-fma.f64 N/A

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

      13. lower-*.f64 N/A

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

      14. metadata-eval N/A

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

      15. lift-*.f64 N/A

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

      16. *-commutative N/A

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

      17. lower-*.f64 N/A

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

      18. lift-*.f64 N/A

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

      19. *-commutative N/A

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

      20. associate-/r* N/A

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

      21. lower-/.f64 N/A

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

      22. metadata-eval 93.8

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

   4. Applied rewrites 93.8%

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

4. Final simplification 94.5%

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

Alternative 4: 72.6% accurate, 0.6× speedup

Math

\[\begin{array}{l} a\_m = \left|a\right| \\ a\_s = \mathsf{copysign}\left(1, a\right) \\ [x, y, z, t, a_m] = \mathsf{sort}([x, y, z, t, a_m])\\\\ [x, y, z, t, a_m] = \mathsf{sort}([x, y, z, t, a_m])\\ \\ \begin{array}{l} t_1 := \left(9 \cdot z\right) \cdot t\\ a\_s \cdot \begin{array}{l} \mathbf{if}\;t\_1 \leq -1 \cdot 10^{+55}:\\ \;\;\;\;\left(\frac{-4.5}{a\_m} \cdot z\right) \cdot t\\ \mathbf{elif}\;t\_1 \leq 5 \cdot 10^{+30}:\\ \;\;\;\;\frac{0.5 \cdot y}{\frac{a\_m}{x}}\\ \mathbf{else}:\\ \;\;\;\;\left(\frac{z}{a\_m} \cdot -4.5\right) \cdot t\\ \end{array} \end{array} \end{array} \]

FPCore

a\_m = (fabs.f64 a)
a\_s = (copysign.f64 #s(literal 1 binary64) a)
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
(FPCore (a_s x y z t a_m)
 :precision binary64
 (let* ((t_1 (* (* 9.0 z) t)))
   (*
    a_s
    (if (<= t_1 -1e+55)
      (* (* (/ -4.5 a_m) z) t)
      (if (<= t_1 5e+30) (/ (* 0.5 y) (/ a_m x)) (* (* (/ z a_m) -4.5) t))))))

C

a\_m = fabs(a);
a\_s = copysign(1.0, a);
assert(x < y && y < z && z < t && t < a_m);
assert(x < y && y < z && z < t && t < a_m);
double code(double a_s, double x, double y, double z, double t, double a_m) {
	double t_1 = (9.0 * z) * t;
	double tmp;
	if (t_1 <= -1e+55) {
		tmp = ((-4.5 / a_m) * z) * t;
	} else if (t_1 <= 5e+30) {
		tmp = (0.5 * y) / (a_m / x);
	} else {
		tmp = ((z / a_m) * -4.5) * t;
	}
	return a_s * tmp;
}

Fortran

a\_m = abs(a)
a\_s = copysign(1.0d0, a)
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
real(8) function code(a_s, x, y, z, t, a_m)
    real(8), intent (in) :: a_s
    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_m
    real(8) :: t_1
    real(8) :: tmp
    t_1 = (9.0d0 * z) * t
    if (t_1 <= (-1d+55)) then
        tmp = (((-4.5d0) / a_m) * z) * t
    else if (t_1 <= 5d+30) then
        tmp = (0.5d0 * y) / (a_m / x)
    else
        tmp = ((z / a_m) * (-4.5d0)) * t
    end if
    code = a_s * tmp
end function

Java

a\_m = Math.abs(a);
a\_s = Math.copySign(1.0, a);
assert x < y && y < z && z < t && t < a_m;
assert x < y && y < z && z < t && t < a_m;
public static double code(double a_s, double x, double y, double z, double t, double a_m) {
	double t_1 = (9.0 * z) * t;
	double tmp;
	if (t_1 <= -1e+55) {
		tmp = ((-4.5 / a_m) * z) * t;
	} else if (t_1 <= 5e+30) {
		tmp = (0.5 * y) / (a_m / x);
	} else {
		tmp = ((z / a_m) * -4.5) * t;
	}
	return a_s * tmp;
}

Python

a\_m = math.fabs(a)
a\_s = math.copysign(1.0, a)
[x, y, z, t, a_m] = sort([x, y, z, t, a_m])
[x, y, z, t, a_m] = sort([x, y, z, t, a_m])
def code(a_s, x, y, z, t, a_m):
	t_1 = (9.0 * z) * t
	tmp = 0
	if t_1 <= -1e+55:
		tmp = ((-4.5 / a_m) * z) * t
	elif t_1 <= 5e+30:
		tmp = (0.5 * y) / (a_m / x)
	else:
		tmp = ((z / a_m) * -4.5) * t
	return a_s * tmp

Julia

a\_m = abs(a)
a\_s = copysign(1.0, a)
x, y, z, t, a_m = sort([x, y, z, t, a_m])
x, y, z, t, a_m = sort([x, y, z, t, a_m])
function code(a_s, x, y, z, t, a_m)
	t_1 = Float64(Float64(9.0 * z) * t)
	tmp = 0.0
	if (t_1 <= -1e+55)
		tmp = Float64(Float64(Float64(-4.5 / a_m) * z) * t);
	elseif (t_1 <= 5e+30)
		tmp = Float64(Float64(0.5 * y) / Float64(a_m / x));
	else
		tmp = Float64(Float64(Float64(z / a_m) * -4.5) * t);
	end
	return Float64(a_s * tmp)
end

MATLAB

a\_m = abs(a);
a\_s = sign(a) * abs(1.0);
x, y, z, t, a_m = num2cell(sort([x, y, z, t, a_m])){:}
x, y, z, t, a_m = num2cell(sort([x, y, z, t, a_m])){:}
function tmp_2 = code(a_s, x, y, z, t, a_m)
	t_1 = (9.0 * z) * t;
	tmp = 0.0;
	if (t_1 <= -1e+55)
		tmp = ((-4.5 / a_m) * z) * t;
	elseif (t_1 <= 5e+30)
		tmp = (0.5 * y) / (a_m / x);
	else
		tmp = ((z / a_m) * -4.5) * t;
	end
	tmp_2 = a_s * tmp;
end

Wolfram

a\_m = N[Abs[a], $MachinePrecision]
a\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[a]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
code[a$95$s_, x_, y_, z_, t_, a$95$m_] := Block[{t$95$1 = N[(N[(9.0 * z), $MachinePrecision] * t), $MachinePrecision]}, N[(a$95$s * If[LessEqual[t$95$1, -1e+55], N[(N[(N[(-4.5 / a$95$m), $MachinePrecision] * z), $MachinePrecision] * t), $MachinePrecision], If[LessEqual[t$95$1, 5e+30], N[(N[(0.5 * y), $MachinePrecision] / N[(a$95$m / x), $MachinePrecision]), $MachinePrecision], N[(N[(N[(z / a$95$m), $MachinePrecision] * -4.5), $MachinePrecision] * t), $MachinePrecision]]]), $MachinePrecision]]

Derivation

1. Split input into 3 regimes

2. if (*.f64 (*.f64 z #s(literal 9 binary64)) t) < -1.00000000000000001e55

   1. Initial program 81.8%

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

   3. Taylor expanded in t around inf

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

      1. associate-*l/ N/A

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

      2. associate-*l* N/A

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

      3. lower-*.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. lower-/.f64 73.9

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

   5. Applied rewrites 73.9%

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

   6. Taylor expanded in t around inf

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

      1. associate-/l* N/A

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

      2. *-commutative N/A

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

      3. associate-*l* N/A

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

      4. lower-*.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 N/A

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

      7. lower-/.f64 79.0

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

   8. Applied rewrites 79.0%

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

   10. Applied rewrites 79.2%

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

   if -1.00000000000000001e55 < (*.f64 (*.f64 z #s(literal 9 binary64)) t) < 4.9999999999999998e30

   1. Initial program 92.7%

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

   3. Taylor expanded in t around 0

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

      1. associate-/l* N/A

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

      2. *-commutative N/A

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

      3. associate-*l* N/A

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

      4. lower-*.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 N/A

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

      7. lower-/.f64 70.8

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

   5. Applied rewrites 70.8%

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

   7. Applied rewrites 73.3%

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

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

   1. Initial program 83.3%

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

   3. Taylor expanded in t around inf

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

      1. associate-*l/ N/A

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

      2. associate-*l* N/A

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

      3. lower-*.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. lower-/.f64 88.1

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

   5. Applied rewrites 88.1%

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

   6. Taylor expanded in t around inf

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

      1. associate-/l* N/A

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

      2. *-commutative N/A

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

      3. associate-*l* N/A

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

      4. lower-*.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 N/A

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

      7. lower-/.f64 85.8

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

   8. Applied rewrites 85.8%

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

4. Final simplification 77.9%

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

Alternative 5: 72.7% accurate, 0.6× speedup

Math

\[\begin{array}{l} a\_m = \left|a\right| \\ a\_s = \mathsf{copysign}\left(1, a\right) \\ [x, y, z, t, a_m] = \mathsf{sort}([x, y, z, t, a_m])\\\\ [x, y, z, t, a_m] = \mathsf{sort}([x, y, z, t, a_m])\\ \\ \begin{array}{l} t_1 := \left(9 \cdot z\right) \cdot t\\ a\_s \cdot \begin{array}{l} \mathbf{if}\;t\_1 \leq -5 \cdot 10^{+47}:\\ \;\;\;\;\left(\frac{-4.5}{a\_m} \cdot z\right) \cdot t\\ \mathbf{elif}\;t\_1 \leq 5 \cdot 10^{+30}:\\ \;\;\;\;\left(0.5 \cdot y\right) \cdot \frac{x}{a\_m}\\ \mathbf{else}:\\ \;\;\;\;\left(\frac{z}{a\_m} \cdot -4.5\right) \cdot t\\ \end{array} \end{array} \end{array} \]

FPCore

a\_m = (fabs.f64 a)
a\_s = (copysign.f64 #s(literal 1 binary64) a)
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
(FPCore (a_s x y z t a_m)
 :precision binary64
 (let* ((t_1 (* (* 9.0 z) t)))
   (*
    a_s
    (if (<= t_1 -5e+47)
      (* (* (/ -4.5 a_m) z) t)
      (if (<= t_1 5e+30) (* (* 0.5 y) (/ x a_m)) (* (* (/ z a_m) -4.5) t))))))

C

a\_m = fabs(a);
a\_s = copysign(1.0, a);
assert(x < y && y < z && z < t && t < a_m);
assert(x < y && y < z && z < t && t < a_m);
double code(double a_s, double x, double y, double z, double t, double a_m) {
	double t_1 = (9.0 * z) * t;
	double tmp;
	if (t_1 <= -5e+47) {
		tmp = ((-4.5 / a_m) * z) * t;
	} else if (t_1 <= 5e+30) {
		tmp = (0.5 * y) * (x / a_m);
	} else {
		tmp = ((z / a_m) * -4.5) * t;
	}
	return a_s * tmp;
}

Fortran

a\_m = abs(a)
a\_s = copysign(1.0d0, a)
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
real(8) function code(a_s, x, y, z, t, a_m)
    real(8), intent (in) :: a_s
    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_m
    real(8) :: t_1
    real(8) :: tmp
    t_1 = (9.0d0 * z) * t
    if (t_1 <= (-5d+47)) then
        tmp = (((-4.5d0) / a_m) * z) * t
    else if (t_1 <= 5d+30) then
        tmp = (0.5d0 * y) * (x / a_m)
    else
        tmp = ((z / a_m) * (-4.5d0)) * t
    end if
    code = a_s * tmp
end function

Java

a\_m = Math.abs(a);
a\_s = Math.copySign(1.0, a);
assert x < y && y < z && z < t && t < a_m;
assert x < y && y < z && z < t && t < a_m;
public static double code(double a_s, double x, double y, double z, double t, double a_m) {
	double t_1 = (9.0 * z) * t;
	double tmp;
	if (t_1 <= -5e+47) {
		tmp = ((-4.5 / a_m) * z) * t;
	} else if (t_1 <= 5e+30) {
		tmp = (0.5 * y) * (x / a_m);
	} else {
		tmp = ((z / a_m) * -4.5) * t;
	}
	return a_s * tmp;
}

Python

a\_m = math.fabs(a)
a\_s = math.copysign(1.0, a)
[x, y, z, t, a_m] = sort([x, y, z, t, a_m])
[x, y, z, t, a_m] = sort([x, y, z, t, a_m])
def code(a_s, x, y, z, t, a_m):
	t_1 = (9.0 * z) * t
	tmp = 0
	if t_1 <= -5e+47:
		tmp = ((-4.5 / a_m) * z) * t
	elif t_1 <= 5e+30:
		tmp = (0.5 * y) * (x / a_m)
	else:
		tmp = ((z / a_m) * -4.5) * t
	return a_s * tmp

Julia

a\_m = abs(a)
a\_s = copysign(1.0, a)
x, y, z, t, a_m = sort([x, y, z, t, a_m])
x, y, z, t, a_m = sort([x, y, z, t, a_m])
function code(a_s, x, y, z, t, a_m)
	t_1 = Float64(Float64(9.0 * z) * t)
	tmp = 0.0
	if (t_1 <= -5e+47)
		tmp = Float64(Float64(Float64(-4.5 / a_m) * z) * t);
	elseif (t_1 <= 5e+30)
		tmp = Float64(Float64(0.5 * y) * Float64(x / a_m));
	else
		tmp = Float64(Float64(Float64(z / a_m) * -4.5) * t);
	end
	return Float64(a_s * tmp)
end

MATLAB

a\_m = abs(a);
a\_s = sign(a) * abs(1.0);
x, y, z, t, a_m = num2cell(sort([x, y, z, t, a_m])){:}
x, y, z, t, a_m = num2cell(sort([x, y, z, t, a_m])){:}
function tmp_2 = code(a_s, x, y, z, t, a_m)
	t_1 = (9.0 * z) * t;
	tmp = 0.0;
	if (t_1 <= -5e+47)
		tmp = ((-4.5 / a_m) * z) * t;
	elseif (t_1 <= 5e+30)
		tmp = (0.5 * y) * (x / a_m);
	else
		tmp = ((z / a_m) * -4.5) * t;
	end
	tmp_2 = a_s * tmp;
end

Wolfram

a\_m = N[Abs[a], $MachinePrecision]
a\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[a]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
code[a$95$s_, x_, y_, z_, t_, a$95$m_] := Block[{t$95$1 = N[(N[(9.0 * z), $MachinePrecision] * t), $MachinePrecision]}, N[(a$95$s * If[LessEqual[t$95$1, -5e+47], N[(N[(N[(-4.5 / a$95$m), $MachinePrecision] * z), $MachinePrecision] * t), $MachinePrecision], If[LessEqual[t$95$1, 5e+30], N[(N[(0.5 * y), $MachinePrecision] * N[(x / a$95$m), $MachinePrecision]), $MachinePrecision], N[(N[(N[(z / a$95$m), $MachinePrecision] * -4.5), $MachinePrecision] * t), $MachinePrecision]]]), $MachinePrecision]]

Derivation

1. Split input into 3 regimes

2. if (*.f64 (*.f64 z #s(literal 9 binary64)) t) < -5.00000000000000022e47

   1. Initial program 82.7%

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

   3. Taylor expanded in t around inf

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

      1. associate-*l/ N/A

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

      2. associate-*l* N/A

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

      3. lower-*.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. lower-/.f64 71.8

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

   5. Applied rewrites 71.8%

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

   6. Taylor expanded in t around inf

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

      1. associate-/l* N/A

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

      2. *-commutative N/A

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

      3. associate-*l* N/A

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

      4. lower-*.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 N/A

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

      7. lower-/.f64 78.3

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

   8. Applied rewrites 78.3%

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

   10. Applied rewrites 78.6%

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

   if -5.00000000000000022e47 < (*.f64 (*.f64 z #s(literal 9 binary64)) t) < 4.9999999999999998e30

   1. Initial program 92.5%

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

   3. Taylor expanded in t around 0

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

      1. associate-/l* N/A

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

      2. *-commutative N/A

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

      3. associate-*l* N/A

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

      4. lower-*.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 N/A

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

      7. lower-/.f64 71.6

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

   5. Applied rewrites 71.6%

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

   7. Applied rewrites 74.2%

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

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

   1. Initial program 83.3%

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

   3. Taylor expanded in t around inf

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

      1. associate-*l/ N/A

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

      2. associate-*l* N/A

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

      3. lower-*.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. lower-/.f64 88.1

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

   5. Applied rewrites 88.1%

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

   6. Taylor expanded in t around inf

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

      1. associate-/l* N/A

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

      2. *-commutative N/A

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

      3. associate-*l* N/A

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

      4. lower-*.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 N/A

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

      7. lower-/.f64 85.8

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

   8. Applied rewrites 85.8%

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

4. Final simplification 78.3%

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

Alternative 6: 72.9% accurate, 0.6× speedup

Math

\[\begin{array}{l} a\_m = \left|a\right| \\ a\_s = \mathsf{copysign}\left(1, a\right) \\ [x, y, z, t, a_m] = \mathsf{sort}([x, y, z, t, a_m])\\\\ [x, y, z, t, a_m] = \mathsf{sort}([x, y, z, t, a_m])\\ \\ \begin{array}{l} t_1 := \left(9 \cdot z\right) \cdot t\\ a\_s \cdot \begin{array}{l} \mathbf{if}\;t\_1 \leq -5 \cdot 10^{+47}:\\ \;\;\;\;\left(\frac{-4.5}{a\_m} \cdot z\right) \cdot t\\ \mathbf{elif}\;t\_1 \leq 5 \cdot 10^{+30}:\\ \;\;\;\;\left(\frac{y}{a\_m} \cdot 0.5\right) \cdot x\\ \mathbf{else}:\\ \;\;\;\;\left(\frac{z}{a\_m} \cdot -4.5\right) \cdot t\\ \end{array} \end{array} \end{array} \]

FPCore

a\_m = (fabs.f64 a)
a\_s = (copysign.f64 #s(literal 1 binary64) a)
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
(FPCore (a_s x y z t a_m)
 :precision binary64
 (let* ((t_1 (* (* 9.0 z) t)))
   (*
    a_s
    (if (<= t_1 -5e+47)
      (* (* (/ -4.5 a_m) z) t)
      (if (<= t_1 5e+30) (* (* (/ y a_m) 0.5) x) (* (* (/ z a_m) -4.5) t))))))

C

a\_m = fabs(a);
a\_s = copysign(1.0, a);
assert(x < y && y < z && z < t && t < a_m);
assert(x < y && y < z && z < t && t < a_m);
double code(double a_s, double x, double y, double z, double t, double a_m) {
	double t_1 = (9.0 * z) * t;
	double tmp;
	if (t_1 <= -5e+47) {
		tmp = ((-4.5 / a_m) * z) * t;
	} else if (t_1 <= 5e+30) {
		tmp = ((y / a_m) * 0.5) * x;
	} else {
		tmp = ((z / a_m) * -4.5) * t;
	}
	return a_s * tmp;
}

Fortran

a\_m = abs(a)
a\_s = copysign(1.0d0, a)
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
real(8) function code(a_s, x, y, z, t, a_m)
    real(8), intent (in) :: a_s
    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_m
    real(8) :: t_1
    real(8) :: tmp
    t_1 = (9.0d0 * z) * t
    if (t_1 <= (-5d+47)) then
        tmp = (((-4.5d0) / a_m) * z) * t
    else if (t_1 <= 5d+30) then
        tmp = ((y / a_m) * 0.5d0) * x
    else
        tmp = ((z / a_m) * (-4.5d0)) * t
    end if
    code = a_s * tmp
end function

Java

a\_m = Math.abs(a);
a\_s = Math.copySign(1.0, a);
assert x < y && y < z && z < t && t < a_m;
assert x < y && y < z && z < t && t < a_m;
public static double code(double a_s, double x, double y, double z, double t, double a_m) {
	double t_1 = (9.0 * z) * t;
	double tmp;
	if (t_1 <= -5e+47) {
		tmp = ((-4.5 / a_m) * z) * t;
	} else if (t_1 <= 5e+30) {
		tmp = ((y / a_m) * 0.5) * x;
	} else {
		tmp = ((z / a_m) * -4.5) * t;
	}
	return a_s * tmp;
}

Python

a\_m = math.fabs(a)
a\_s = math.copysign(1.0, a)
[x, y, z, t, a_m] = sort([x, y, z, t, a_m])
[x, y, z, t, a_m] = sort([x, y, z, t, a_m])
def code(a_s, x, y, z, t, a_m):
	t_1 = (9.0 * z) * t
	tmp = 0
	if t_1 <= -5e+47:
		tmp = ((-4.5 / a_m) * z) * t
	elif t_1 <= 5e+30:
		tmp = ((y / a_m) * 0.5) * x
	else:
		tmp = ((z / a_m) * -4.5) * t
	return a_s * tmp

Julia

a\_m = abs(a)
a\_s = copysign(1.0, a)
x, y, z, t, a_m = sort([x, y, z, t, a_m])
x, y, z, t, a_m = sort([x, y, z, t, a_m])
function code(a_s, x, y, z, t, a_m)
	t_1 = Float64(Float64(9.0 * z) * t)
	tmp = 0.0
	if (t_1 <= -5e+47)
		tmp = Float64(Float64(Float64(-4.5 / a_m) * z) * t);
	elseif (t_1 <= 5e+30)
		tmp = Float64(Float64(Float64(y / a_m) * 0.5) * x);
	else
		tmp = Float64(Float64(Float64(z / a_m) * -4.5) * t);
	end
	return Float64(a_s * tmp)
end

MATLAB

a\_m = abs(a);
a\_s = sign(a) * abs(1.0);
x, y, z, t, a_m = num2cell(sort([x, y, z, t, a_m])){:}
x, y, z, t, a_m = num2cell(sort([x, y, z, t, a_m])){:}
function tmp_2 = code(a_s, x, y, z, t, a_m)
	t_1 = (9.0 * z) * t;
	tmp = 0.0;
	if (t_1 <= -5e+47)
		tmp = ((-4.5 / a_m) * z) * t;
	elseif (t_1 <= 5e+30)
		tmp = ((y / a_m) * 0.5) * x;
	else
		tmp = ((z / a_m) * -4.5) * t;
	end
	tmp_2 = a_s * tmp;
end

Wolfram

a\_m = N[Abs[a], $MachinePrecision]
a\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[a]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
code[a$95$s_, x_, y_, z_, t_, a$95$m_] := Block[{t$95$1 = N[(N[(9.0 * z), $MachinePrecision] * t), $MachinePrecision]}, N[(a$95$s * If[LessEqual[t$95$1, -5e+47], N[(N[(N[(-4.5 / a$95$m), $MachinePrecision] * z), $MachinePrecision] * t), $MachinePrecision], If[LessEqual[t$95$1, 5e+30], N[(N[(N[(y / a$95$m), $MachinePrecision] * 0.5), $MachinePrecision] * x), $MachinePrecision], N[(N[(N[(z / a$95$m), $MachinePrecision] * -4.5), $MachinePrecision] * t), $MachinePrecision]]]), $MachinePrecision]]

Derivation

1. Split input into 3 regimes

2. if (*.f64 (*.f64 z #s(literal 9 binary64)) t) < -5.00000000000000022e47

   1. Initial program 82.7%

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

   3. Taylor expanded in t around inf

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

      1. associate-*l/ N/A

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

      2. associate-*l* N/A

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

      3. lower-*.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. lower-/.f64 71.8

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

   5. Applied rewrites 71.8%

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

   6. Taylor expanded in t around inf

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

      1. associate-/l* N/A

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

      2. *-commutative N/A

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

      3. associate-*l* N/A

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

      4. lower-*.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 N/A

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

      7. lower-/.f64 78.3

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

   8. Applied rewrites 78.3%

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

   10. Applied rewrites 78.6%

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

   if -5.00000000000000022e47 < (*.f64 (*.f64 z #s(literal 9 binary64)) t) < 4.9999999999999998e30

   1. Initial program 92.5%

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

   3. Taylor expanded in t around 0

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

      1. associate-/l* N/A

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

      2. *-commutative N/A

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

      3. associate-*l* N/A

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

      4. lower-*.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 N/A

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

      7. lower-/.f64 71.6

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

   5. Applied rewrites 71.6%

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

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

   1. Initial program 83.3%

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

   3. Taylor expanded in t around inf

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

      1. associate-*l/ N/A

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

      2. associate-*l* N/A

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

      3. lower-*.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. lower-/.f64 88.1

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

   5. Applied rewrites 88.1%

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

   6. Taylor expanded in t around inf

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

      1. associate-/l* N/A

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

      2. *-commutative N/A

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

      3. associate-*l* N/A

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

      4. lower-*.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 N/A

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

      7. lower-/.f64 85.8

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

   8. Applied rewrites 85.8%

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

4. Final simplification 76.9%

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

Alternative 7: 72.9% accurate, 0.6× speedup

Math

\[\begin{array}{l} a\_m = \left|a\right| \\ a\_s = \mathsf{copysign}\left(1, a\right) \\ [x, y, z, t, a_m] = \mathsf{sort}([x, y, z, t, a_m])\\\\ [x, y, z, t, a_m] = \mathsf{sort}([x, y, z, t, a_m])\\ \\ \begin{array}{l} t_1 := \left(\frac{-4.5}{a\_m} \cdot z\right) \cdot t\\ t_2 := \left(9 \cdot z\right) \cdot t\\ a\_s \cdot \begin{array}{l} \mathbf{if}\;t\_2 \leq -5 \cdot 10^{+47}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t\_2 \leq 5 \cdot 10^{+30}:\\ \;\;\;\;\left(\frac{y}{a\_m} \cdot 0.5\right) \cdot x\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \end{array} \]

FPCore

a\_m = (fabs.f64 a)
a\_s = (copysign.f64 #s(literal 1 binary64) a)
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
(FPCore (a_s x y z t a_m)
 :precision binary64
 (let* ((t_1 (* (* (/ -4.5 a_m) z) t)) (t_2 (* (* 9.0 z) t)))
   (*
    a_s
    (if (<= t_2 -5e+47) t_1 (if (<= t_2 5e+30) (* (* (/ y a_m) 0.5) x) t_1)))))

C

a\_m = fabs(a);
a\_s = copysign(1.0, a);
assert(x < y && y < z && z < t && t < a_m);
assert(x < y && y < z && z < t && t < a_m);
double code(double a_s, double x, double y, double z, double t, double a_m) {
	double t_1 = ((-4.5 / a_m) * z) * t;
	double t_2 = (9.0 * z) * t;
	double tmp;
	if (t_2 <= -5e+47) {
		tmp = t_1;
	} else if (t_2 <= 5e+30) {
		tmp = ((y / a_m) * 0.5) * x;
	} else {
		tmp = t_1;
	}
	return a_s * tmp;
}

Fortran

a\_m = abs(a)
a\_s = copysign(1.0d0, a)
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
real(8) function code(a_s, x, y, z, t, a_m)
    real(8), intent (in) :: a_s
    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_m
    real(8) :: t_1
    real(8) :: t_2
    real(8) :: tmp
    t_1 = (((-4.5d0) / a_m) * z) * t
    t_2 = (9.0d0 * z) * t
    if (t_2 <= (-5d+47)) then
        tmp = t_1
    else if (t_2 <= 5d+30) then
        tmp = ((y / a_m) * 0.5d0) * x
    else
        tmp = t_1
    end if
    code = a_s * tmp
end function

Java

a\_m = Math.abs(a);
a\_s = Math.copySign(1.0, a);
assert x < y && y < z && z < t && t < a_m;
assert x < y && y < z && z < t && t < a_m;
public static double code(double a_s, double x, double y, double z, double t, double a_m) {
	double t_1 = ((-4.5 / a_m) * z) * t;
	double t_2 = (9.0 * z) * t;
	double tmp;
	if (t_2 <= -5e+47) {
		tmp = t_1;
	} else if (t_2 <= 5e+30) {
		tmp = ((y / a_m) * 0.5) * x;
	} else {
		tmp = t_1;
	}
	return a_s * tmp;
}

Python

a\_m = math.fabs(a)
a\_s = math.copysign(1.0, a)
[x, y, z, t, a_m] = sort([x, y, z, t, a_m])
[x, y, z, t, a_m] = sort([x, y, z, t, a_m])
def code(a_s, x, y, z, t, a_m):
	t_1 = ((-4.5 / a_m) * z) * t
	t_2 = (9.0 * z) * t
	tmp = 0
	if t_2 <= -5e+47:
		tmp = t_1
	elif t_2 <= 5e+30:
		tmp = ((y / a_m) * 0.5) * x
	else:
		tmp = t_1
	return a_s * tmp

Julia

a\_m = abs(a)
a\_s = copysign(1.0, a)
x, y, z, t, a_m = sort([x, y, z, t, a_m])
x, y, z, t, a_m = sort([x, y, z, t, a_m])
function code(a_s, x, y, z, t, a_m)
	t_1 = Float64(Float64(Float64(-4.5 / a_m) * z) * t)
	t_2 = Float64(Float64(9.0 * z) * t)
	tmp = 0.0
	if (t_2 <= -5e+47)
		tmp = t_1;
	elseif (t_2 <= 5e+30)
		tmp = Float64(Float64(Float64(y / a_m) * 0.5) * x);
	else
		tmp = t_1;
	end
	return Float64(a_s * tmp)
end

MATLAB

a\_m = abs(a);
a\_s = sign(a) * abs(1.0);
x, y, z, t, a_m = num2cell(sort([x, y, z, t, a_m])){:}
x, y, z, t, a_m = num2cell(sort([x, y, z, t, a_m])){:}
function tmp_2 = code(a_s, x, y, z, t, a_m)
	t_1 = ((-4.5 / a_m) * z) * t;
	t_2 = (9.0 * z) * t;
	tmp = 0.0;
	if (t_2 <= -5e+47)
		tmp = t_1;
	elseif (t_2 <= 5e+30)
		tmp = ((y / a_m) * 0.5) * x;
	else
		tmp = t_1;
	end
	tmp_2 = a_s * tmp;
end

Wolfram

a\_m = N[Abs[a], $MachinePrecision]
a\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[a]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
code[a$95$s_, x_, y_, z_, t_, a$95$m_] := Block[{t$95$1 = N[(N[(N[(-4.5 / a$95$m), $MachinePrecision] * z), $MachinePrecision] * t), $MachinePrecision]}, Block[{t$95$2 = N[(N[(9.0 * z), $MachinePrecision] * t), $MachinePrecision]}, N[(a$95$s * If[LessEqual[t$95$2, -5e+47], t$95$1, If[LessEqual[t$95$2, 5e+30], N[(N[(N[(y / a$95$m), $MachinePrecision] * 0.5), $MachinePrecision] * x), $MachinePrecision], t$95$1]]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (*.f64 z #s(literal 9 binary64)) t) < -5.00000000000000022e47 or 4.9999999999999998e30 < (*.f64 (*.f64 z #s(literal 9 binary64)) t)

   1. Initial program 83.0%

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

   3. Taylor expanded in t around inf

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

      1. associate-*l/ N/A

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

      2. associate-*l* N/A

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

      3. lower-*.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. lower-/.f64 80.8

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

   5. Applied rewrites 80.8%

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

   6. Taylor expanded in t around inf

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

      1. associate-/l* N/A

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

      2. *-commutative N/A

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

      3. associate-*l* N/A

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

      4. lower-*.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 N/A

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

      7. lower-/.f64 82.5

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

   8. Applied rewrites 82.5%

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

   10. Applied rewrites 82.6%

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

   if -5.00000000000000022e47 < (*.f64 (*.f64 z #s(literal 9 binary64)) t) < 4.9999999999999998e30

   1. Initial program 92.5%

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

   3. Taylor expanded in t around 0

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

      1. associate-/l* N/A

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

      2. *-commutative N/A

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

      3. associate-*l* N/A

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

      4. lower-*.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 N/A

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

      7. lower-/.f64 71.6

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

   5. Applied rewrites 71.6%

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

4. Final simplification 76.9%

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

Alternative 8: 51.9% accurate, 1.6× speedup

Math

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

FPCore

a\_m = (fabs.f64 a)
a\_s = (copysign.f64 #s(literal 1 binary64) a)
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
(FPCore (a_s x y z t a_m) :precision binary64 (* a_s (* (* (/ t a_m) -4.5) z)))

C

a\_m = fabs(a);
a\_s = copysign(1.0, a);
assert(x < y && y < z && z < t && t < a_m);
assert(x < y && y < z && z < t && t < a_m);
double code(double a_s, double x, double y, double z, double t, double a_m) {
	return a_s * (((t / a_m) * -4.5) * z);
}

Fortran

a\_m = abs(a)
a\_s = copysign(1.0d0, a)
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
real(8) function code(a_s, x, y, z, t, a_m)
    real(8), intent (in) :: a_s
    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_m
    code = a_s * (((t / a_m) * (-4.5d0)) * z)
end function

Java

a\_m = Math.abs(a);
a\_s = Math.copySign(1.0, a);
assert x < y && y < z && z < t && t < a_m;
assert x < y && y < z && z < t && t < a_m;
public static double code(double a_s, double x, double y, double z, double t, double a_m) {
	return a_s * (((t / a_m) * -4.5) * z);
}

Python

a\_m = math.fabs(a)
a\_s = math.copysign(1.0, a)
[x, y, z, t, a_m] = sort([x, y, z, t, a_m])
[x, y, z, t, a_m] = sort([x, y, z, t, a_m])
def code(a_s, x, y, z, t, a_m):
	return a_s * (((t / a_m) * -4.5) * z)

Julia

a\_m = abs(a)
a\_s = copysign(1.0, a)
x, y, z, t, a_m = sort([x, y, z, t, a_m])
x, y, z, t, a_m = sort([x, y, z, t, a_m])
function code(a_s, x, y, z, t, a_m)
	return Float64(a_s * Float64(Float64(Float64(t / a_m) * -4.5) * z))
end

MATLAB

a\_m = abs(a);
a\_s = sign(a) * abs(1.0);
x, y, z, t, a_m = num2cell(sort([x, y, z, t, a_m])){:}
x, y, z, t, a_m = num2cell(sort([x, y, z, t, a_m])){:}
function tmp = code(a_s, x, y, z, t, a_m)
	tmp = a_s * (((t / a_m) * -4.5) * z);
end

Wolfram

a\_m = N[Abs[a], $MachinePrecision]
a\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[a]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
code[a$95$s_, x_, y_, z_, t_, a$95$m_] := N[(a$95$s * N[(N[(N[(t / a$95$m), $MachinePrecision] * -4.5), $MachinePrecision] * z), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 87.9%

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

3. Taylor expanded in t around inf

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

   1. associate-*l/ N/A

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

   2. associate-*l* N/A

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

   3. lower-*.f64 N/A

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

   4. *-commutative N/A

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

   5. lower-*.f64 N/A

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

   6. lower-/.f64 53.4

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

5. Applied rewrites 53.4%

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

Alternative 9: 52.0% accurate, 1.6× speedup

Math

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

FPCore

a\_m = (fabs.f64 a)
a\_s = (copysign.f64 #s(literal 1 binary64) a)
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
(FPCore (a_s x y z t a_m) :precision binary64 (* a_s (* (* (/ -4.5 a_m) z) t)))

C

a\_m = fabs(a);
a\_s = copysign(1.0, a);
assert(x < y && y < z && z < t && t < a_m);
assert(x < y && y < z && z < t && t < a_m);
double code(double a_s, double x, double y, double z, double t, double a_m) {
	return a_s * (((-4.5 / a_m) * z) * t);
}

Fortran

a\_m = abs(a)
a\_s = copysign(1.0d0, a)
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
real(8) function code(a_s, x, y, z, t, a_m)
    real(8), intent (in) :: a_s
    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_m
    code = a_s * ((((-4.5d0) / a_m) * z) * t)
end function

Java

a\_m = Math.abs(a);
a\_s = Math.copySign(1.0, a);
assert x < y && y < z && z < t && t < a_m;
assert x < y && y < z && z < t && t < a_m;
public static double code(double a_s, double x, double y, double z, double t, double a_m) {
	return a_s * (((-4.5 / a_m) * z) * t);
}

Python

a\_m = math.fabs(a)
a\_s = math.copysign(1.0, a)
[x, y, z, t, a_m] = sort([x, y, z, t, a_m])
[x, y, z, t, a_m] = sort([x, y, z, t, a_m])
def code(a_s, x, y, z, t, a_m):
	return a_s * (((-4.5 / a_m) * z) * t)

Julia

a\_m = abs(a)
a\_s = copysign(1.0, a)
x, y, z, t, a_m = sort([x, y, z, t, a_m])
x, y, z, t, a_m = sort([x, y, z, t, a_m])
function code(a_s, x, y, z, t, a_m)
	return Float64(a_s * Float64(Float64(Float64(-4.5 / a_m) * z) * t))
end

MATLAB

a\_m = abs(a);
a\_s = sign(a) * abs(1.0);
x, y, z, t, a_m = num2cell(sort([x, y, z, t, a_m])){:}
x, y, z, t, a_m = num2cell(sort([x, y, z, t, a_m])){:}
function tmp = code(a_s, x, y, z, t, a_m)
	tmp = a_s * (((-4.5 / a_m) * z) * t);
end

Wolfram

a\_m = N[Abs[a], $MachinePrecision]
a\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[a]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
code[a$95$s_, x_, y_, z_, t_, a$95$m_] := N[(a$95$s * N[(N[(N[(-4.5 / a$95$m), $MachinePrecision] * z), $MachinePrecision] * t), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 87.9%

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

3. Taylor expanded in t around inf

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

   1. associate-*l/ N/A

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

   2. associate-*l* N/A

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

   3. lower-*.f64 N/A

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

   4. *-commutative N/A

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

   5. lower-*.f64 N/A

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

   6. lower-/.f64 53.4

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

5. Applied rewrites 53.4%

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

6. Taylor expanded in t around inf

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

   1. associate-/l* N/A

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

   2. *-commutative N/A

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

   3. associate-*l* N/A

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

   4. lower-*.f64 N/A

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

   5. *-commutative N/A

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

   6. lower-*.f64 N/A

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

   7. lower-/.f64 56.4

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

8. Applied rewrites 56.4%

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

10. Applied rewrites 56.4%

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

Developer Target 1: 94.1% 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 2024244 
(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)))