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

Percentage Accurate: 91.1% → 97.2%

Time: 12.0s

Alternatives: 15

Speedup: 0.8×

• 28.5% 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.1% 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.2% accurate, 0.4× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(N[(x * y), $MachinePrecision] - N[(N[(z * 9.0), $MachinePrecision] * t), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(z * N[(N[(t / a), $MachinePrecision] * (-4.5)), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, (-Infinity)], N[(N[(y / a), $MachinePrecision] * N[(x * 0.5), $MachinePrecision] + t$95$2), $MachinePrecision], If[LessEqual[t$95$1, 2e+304], N[(N[(N[(t * -9.0), $MachinePrecision] * z + N[(x * y), $MachinePrecision]), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(x / a), $MachinePrecision] * N[(y * 0.5), $MachinePrecision] + t$95$2), $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 65.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. +-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} \]

      4. lift-*.f64 N/A

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

      5. lift-*.f64 N/A

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

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

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

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

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

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

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

      12. lower-*.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} \]

      13. metadata-eval 65.6

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

   4. Applied rewrites 65.6%

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

      1. lift-/.f64 N/A

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

      2. div-inv N/A

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

      3. lift-fma.f64 N/A

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

      4. *-commutative N/A

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

      5. lift-fma.f64 N/A

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

      6. *-commutative N/A

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

      7. lift-fma.f64 N/A

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

      8. +-commutative N/A

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

      9. distribute-rgt-in N/A

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

      10. div-inv N/A

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

      11. lift-*.f64 N/A

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

      12. *-commutative N/A

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

      13. metadata-eval N/A

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

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

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

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

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

      16. associate-*l* N/A

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

      17. lift-*.f64 N/A

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

      18. *-commutative N/A

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

      19. lift-*.f64 N/A

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

      20. times-frac N/A

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

   6. Applied rewrites 88.4%

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

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

   1. Initial program 98.1%

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

      4. lift-*.f64 N/A

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

      5. lift-*.f64 N/A

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

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

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

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

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

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

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

      12. lower-*.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} \]

      13. metadata-eval 98.1

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

   4. Applied rewrites 98.1%

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

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

   1. Initial program 60.8%

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

      4. lift-*.f64 N/A

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

      5. lift-*.f64 N/A

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

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

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

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

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

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

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

      12. lower-*.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} \]

      13. metadata-eval 60.8

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

   4. Applied rewrites 60.8%

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

      1. lift-/.f64 N/A

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

      2. div-inv N/A

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

      3. lift-fma.f64 N/A

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

      4. *-commutative N/A

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

      5. lift-fma.f64 N/A

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

      6. *-commutative N/A

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

      7. lift-fma.f64 N/A

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

      8. +-commutative N/A

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

      9. distribute-rgt-in N/A

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

      10. div-inv N/A

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

      11. lift-*.f64 N/A

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

      12. *-commutative N/A

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

      13. metadata-eval N/A

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

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

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

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

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

      16. associate-*l* N/A

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

      17. lift-*.f64 N/A

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

      18. lift-*.f64 N/A

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

      19. times-frac N/A

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

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

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

   6. Applied rewrites 87.4%

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

4. Final simplification 95.4%

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

Alternative 2: 96.8% accurate, 0.4× speedup

Math

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

FPCore

NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (- (* x y) (* (* z 9.0) t))))
   (if (<= t_1 -2e+226)
     (fma (/ t a) (* z (- 4.5)) (* x (/ y (* a 2.0))))
     (if (<= t_1 2e+304)
       (/ (fma (* t -9.0) z (* x y)) (* a 2.0))
       (fma (/ x a) (* y 0.5) (* z (* (/ t a) (- 4.5))))))))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

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

   1. Initial program 70.3%

      \[\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}{\mathsf{neg}\left(\frac{z \cdot 9}{2}\right)}, \frac{x \cdot y}{a \cdot 2}\right) \]

      14. lift-*.f64 N/A

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

      15. associate-/l* N/A

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

      16. lower-*.f64 N/A

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

      17. metadata-eval N/A

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

      18. lift-*.f64 N/A

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

      19. associate-/l* N/A

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

      20. lower-*.f64 N/A

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

      21. lower-/.f64 90.0

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

   4. Applied rewrites 90.0%

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

   if -1.99999999999999992e226 < (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) < 1.9999999999999999e304

   1. Initial program 98.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. +-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} \]

      4. lift-*.f64 N/A

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

      5. lift-*.f64 N/A

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

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

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

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

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

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

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

      12. lower-*.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} \]

      13. metadata-eval 98.0

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

   4. Applied rewrites 98.0%

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

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

   1. Initial program 60.8%

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

      4. lift-*.f64 N/A

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

      5. lift-*.f64 N/A

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

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

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

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

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

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

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

      12. lower-*.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} \]

      13. metadata-eval 60.8

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

   4. Applied rewrites 60.8%

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

      1. lift-/.f64 N/A

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

      2. div-inv N/A

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

      3. lift-fma.f64 N/A

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

      4. *-commutative N/A

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

      5. lift-fma.f64 N/A

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

      6. *-commutative N/A

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

      7. lift-fma.f64 N/A

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

      8. +-commutative N/A

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

      9. distribute-rgt-in N/A

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

      10. div-inv N/A

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

      11. lift-*.f64 N/A

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

      12. *-commutative N/A

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

      13. metadata-eval N/A

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

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

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

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

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

      16. associate-*l* N/A

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

      17. lift-*.f64 N/A

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

      18. lift-*.f64 N/A

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

      19. times-frac N/A

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

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

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

   6. Applied rewrites 87.4%

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

4. Final simplification 95.4%

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

FPCore

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

C

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

Julia

x, y, z, t, a = sort([x, y, z, t, a])
x, y, z, t, a = sort([x, y, z, t, a])
function code(x, y, z, t, a)
	tmp = 0.0
	if (Float64(a * 2.0) <= 4e-21)
		tmp = Float64(fma(Float64(t * -9.0), z, Float64(x * y)) / Float64(a * 2.0));
	else
		tmp = fma(Float64(-t), Float64(Float64(z * 4.5) / a), Float64(x * Float64(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.
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], 4e-21], N[(N[(N[(t * -9.0), $MachinePrecision] * z + N[(x * y), $MachinePrecision]), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision], N[((-t) * N[(N[(z * 4.5), $MachinePrecision] / a), $MachinePrecision] + N[(x * N[(y / N[(a * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 a #s(literal 2 binary64)) < 3.99999999999999963e-21

   1. Initial program 90.3%

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

      4. lift-*.f64 N/A

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

      5. lift-*.f64 N/A

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

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

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

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

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

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

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

      12. lower-*.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} \]

      13. metadata-eval 90.3

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

   4. Applied rewrites 90.3%

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

   if 3.99999999999999963e-21 < (*.f64 a #s(literal 2 binary64))

   1. Initial program 84.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. associate-/l* N/A

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

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

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

      10. lower-fma.f64 N/A

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

      11. lower-neg.f64 N/A

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

      12. lift-*.f64 N/A

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

      13. *-commutative N/A

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

      14. associate-/r* N/A

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

      15. lower-/.f64 N/A

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

      16. lift-*.f64 N/A

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

      17. associate-/l* N/A

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

      18. lower-*.f64 N/A

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

      19. metadata-eval N/A

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

      20. lift-*.f64 N/A

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

      21. associate-/l* N/A

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

      22. lower-*.f64 N/A

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

   4. Applied rewrites 94.7%

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

Alternative 4: 72.0% accurate, 0.6× speedup

Math

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

FPCore

NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (* (* z 9.0) t)))
   (if (<= t_1 -1e+22)
     (/ -4.5 (/ a (* z t)))
     (if (<= t_1 2e+68) (* x (/ (* y 0.5) a)) (* (/ z a) (* t -4.5))))))

C

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

Fortran

NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8) :: t_1
    real(8) :: tmp
    t_1 = (z * 9.0d0) * t
    if (t_1 <= (-1d+22)) then
        tmp = (-4.5d0) / (a / (z * t))
    else if (t_1 <= 2d+68) then
        tmp = x * ((y * 0.5d0) / a)
    else
        tmp = (z / a) * (t * (-4.5d0))
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t && t < a;
assert x < y && y < z && z < t && t < a;
public static double code(double x, double y, double z, double t, double a) {
	double t_1 = (z * 9.0) * t;
	double tmp;
	if (t_1 <= -1e+22) {
		tmp = -4.5 / (a / (z * t));
	} else if (t_1 <= 2e+68) {
		tmp = x * ((y * 0.5) / a);
	} else {
		tmp = (z / a) * (t * -4.5);
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
function tmp_2 = code(x, y, z, t, a)
	t_1 = (z * 9.0) * t;
	tmp = 0.0;
	if (t_1 <= -1e+22)
		tmp = -4.5 / (a / (z * t));
	elseif (t_1 <= 2e+68)
		tmp = x * ((y * 0.5) / a);
	else
		tmp = (z / a) * (t * -4.5);
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 3 regimes

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

   1. Initial program 91.4%

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

   3. Taylor expanded in x around 0

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

      1. lower-*.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. lower-*.f64 N/A

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

      4. lower-/.f64 79.3

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

   5. Applied rewrites 79.3%

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

   7. Applied rewrites 81.2%

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

   if -1e22 < (*.f64 (*.f64 z #s(literal 9 binary64)) t) < 1.99999999999999991e68

   1. Initial program 89.2%

      \[\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. lower-/.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. lower-*.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. lower-*.f64 69.5

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

   5. Applied rewrites 69.5%

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

   7. Applied rewrites 70.8%

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

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

   1. Initial program 85.6%

      \[\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. lower-*.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. lower-*.f64 N/A

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

      4. lower-/.f64 81.5

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

   5. Applied rewrites 81.5%

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

   7. Applied rewrites 81.6%

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

4. Final simplification 75.1%

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

Alternative 5: 72.8% accurate, 0.6× speedup

Math

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

FPCore

NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (* (* z 9.0) t)))
   (if (<= t_1 -1e+22)
     (* t (* -4.5 (/ z a)))
     (if (<= t_1 2e+68) (* x (/ (* y 0.5) a)) (* (/ z a) (* t -4.5))))))

C

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

Fortran

NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8) :: t_1
    real(8) :: tmp
    t_1 = (z * 9.0d0) * t
    if (t_1 <= (-1d+22)) then
        tmp = t * ((-4.5d0) * (z / a))
    else if (t_1 <= 2d+68) then
        tmp = x * ((y * 0.5d0) / a)
    else
        tmp = (z / a) * (t * (-4.5d0))
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t && t < a;
assert x < y && y < z && z < t && t < a;
public static double code(double x, double y, double z, double t, double a) {
	double t_1 = (z * 9.0) * t;
	double tmp;
	if (t_1 <= -1e+22) {
		tmp = t * (-4.5 * (z / a));
	} else if (t_1 <= 2e+68) {
		tmp = x * ((y * 0.5) / a);
	} else {
		tmp = (z / a) * (t * -4.5);
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
function tmp_2 = code(x, y, z, t, a)
	t_1 = (z * 9.0) * t;
	tmp = 0.0;
	if (t_1 <= -1e+22)
		tmp = t * (-4.5 * (z / a));
	elseif (t_1 <= 2e+68)
		tmp = x * ((y * 0.5) / a);
	else
		tmp = (z / a) * (t * -4.5);
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 3 regimes

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

   1. Initial program 91.4%

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

   3. Taylor expanded in x around 0

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

      1. lower-*.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. lower-*.f64 N/A

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

      4. lower-/.f64 79.3

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

   5. Applied rewrites 79.3%

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

   7. Applied rewrites 79.5%

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

   if -1e22 < (*.f64 (*.f64 z #s(literal 9 binary64)) t) < 1.99999999999999991e68

   1. Initial program 89.2%

      \[\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. lower-/.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. lower-*.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. lower-*.f64 69.5

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

   5. Applied rewrites 69.5%

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

   7. Applied rewrites 70.8%

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

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

   1. Initial program 85.6%

      \[\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. lower-*.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. lower-*.f64 N/A

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

      4. lower-/.f64 81.5

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

   5. Applied rewrites 81.5%

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

   7. Applied rewrites 81.6%

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

4. Final simplification 74.7%

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

Alternative 6: 72.7% accurate, 0.6× speedup

Math

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

FPCore

NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (* (* z 9.0) t)))
   (if (<= t_1 -1e+22)
     (* t (* -4.5 (/ z a)))
     (if (<= t_1 2e+68) (* x (* y (/ 0.5 a))) (* (/ z a) (* t -4.5))))))

C

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

Fortran

NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8) :: t_1
    real(8) :: tmp
    t_1 = (z * 9.0d0) * t
    if (t_1 <= (-1d+22)) then
        tmp = t * ((-4.5d0) * (z / a))
    else if (t_1 <= 2d+68) then
        tmp = x * (y * (0.5d0 / a))
    else
        tmp = (z / a) * (t * (-4.5d0))
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t && t < a;
assert x < y && y < z && z < t && t < a;
public static double code(double x, double y, double z, double t, double a) {
	double t_1 = (z * 9.0) * t;
	double tmp;
	if (t_1 <= -1e+22) {
		tmp = t * (-4.5 * (z / a));
	} else if (t_1 <= 2e+68) {
		tmp = x * (y * (0.5 / a));
	} else {
		tmp = (z / a) * (t * -4.5);
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
function tmp_2 = code(x, y, z, t, a)
	t_1 = (z * 9.0) * t;
	tmp = 0.0;
	if (t_1 <= -1e+22)
		tmp = t * (-4.5 * (z / a));
	elseif (t_1 <= 2e+68)
		tmp = x * (y * (0.5 / a));
	else
		tmp = (z / a) * (t * -4.5);
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 3 regimes

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

   1. Initial program 91.4%

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

   3. Taylor expanded in x around 0

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

      1. lower-*.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. lower-*.f64 N/A

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

      4. lower-/.f64 79.3

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

   5. Applied rewrites 79.3%

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

   7. Applied rewrites 79.5%

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

   if -1e22 < (*.f64 (*.f64 z #s(literal 9 binary64)) t) < 1.99999999999999991e68

   1. Initial program 89.2%

      \[\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. lower-/.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. lower-*.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. lower-*.f64 69.5

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

   5. Applied rewrites 69.5%

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

   7. Applied rewrites 70.8%

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

   9. Applied rewrites 70.8%

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

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

   1. Initial program 85.6%

      \[\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. lower-*.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. lower-*.f64 N/A

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

      4. lower-/.f64 81.5

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

   5. Applied rewrites 81.5%

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

   7. Applied rewrites 81.6%

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

4. Final simplification 74.7%

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

Alternative 7: 72.8% accurate, 0.6× speedup

Math

\[\begin{array}{l} [x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\\\ [x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\ \\ \begin{array}{l} t_1 := \left(z \cdot 9\right) \cdot t\\ \mathbf{if}\;t\_1 \leq -1 \cdot 10^{+22}:\\ \;\;\;\;t \cdot \left(-4.5 \cdot \frac{z}{a}\right)\\ \mathbf{elif}\;t\_1 \leq 2 \cdot 10^{+68}:\\ \;\;\;\;x \cdot \left(y \cdot \frac{0.5}{a}\right)\\ \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.
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 (* (* z 9.0) t)))
   (if (<= t_1 -1e+22)
     (* t (* -4.5 (/ z a)))
     (if (<= t_1 2e+68) (* x (* y (/ 0.5 a))) (* t (* z (/ -4.5 a)))))))

C

assert(x < y && y < z && z < t && t < a);
assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
	double t_1 = (z * 9.0) * t;
	double tmp;
	if (t_1 <= -1e+22) {
		tmp = t * (-4.5 * (z / a));
	} else if (t_1 <= 2e+68) {
		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.
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 = (z * 9.0d0) * t
    if (t_1 <= (-1d+22)) then
        tmp = t * ((-4.5d0) * (z / a))
    else if (t_1 <= 2d+68) 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;
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 = (z * 9.0) * t;
	double tmp;
	if (t_1 <= -1e+22) {
		tmp = t * (-4.5 * (z / a));
	} else if (t_1 <= 2e+68) {
		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])
[x, y, z, t, a] = sort([x, y, z, t, a])
def code(x, y, z, t, a):
	t_1 = (z * 9.0) * t
	tmp = 0
	if t_1 <= -1e+22:
		tmp = t * (-4.5 * (z / a))
	elif t_1 <= 2e+68:
		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])
x, y, z, t, a = sort([x, y, z, t, a])
function code(x, y, z, t, a)
	t_1 = Float64(Float64(z * 9.0) * t)
	tmp = 0.0
	if (t_1 <= -1e+22)
		tmp = Float64(t * Float64(-4.5 * Float64(z / a)));
	elseif (t_1 <= 2e+68)
		tmp = Float64(x * Float64(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])){:}
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
function tmp_2 = code(x, y, z, t, a)
	t_1 = (z * 9.0) * t;
	tmp = 0.0;
	if (t_1 <= -1e+22)
		tmp = t * (-4.5 * (z / a));
	elseif (t_1 <= 2e+68)
		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.
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[(z * 9.0), $MachinePrecision] * t), $MachinePrecision]}, If[LessEqual[t$95$1, -1e+22], N[(t * N[(-4.5 * N[(z / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 2e+68], N[(x * N[(y * N[(0.5 / a), $MachinePrecision]), $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) < -1e22

   1. Initial program 91.4%

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

   3. Taylor expanded in x around 0

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

      1. lower-*.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. lower-*.f64 N/A

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

      4. lower-/.f64 79.3

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

   5. Applied rewrites 79.3%

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

   7. Applied rewrites 79.5%

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

   if -1e22 < (*.f64 (*.f64 z #s(literal 9 binary64)) t) < 1.99999999999999991e68

   1. Initial program 89.2%

      \[\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. lower-/.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. lower-*.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. lower-*.f64 69.5

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

   5. Applied rewrites 69.5%

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

   7. Applied rewrites 70.8%

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

   9. Applied rewrites 70.8%

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

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

   1. Initial program 85.6%

      \[\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. lower-*.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. lower-*.f64 N/A

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

      4. lower-/.f64 81.5

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

   5. Applied rewrites 81.5%

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

   7. Applied rewrites 81.5%

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

   9. Applied rewrites 81.6%

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

4. Final simplification 74.7%

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

Alternative 8: 72.8% accurate, 0.6× speedup

Math

\[\begin{array}{l} [x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\\\ [x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\ \\ \begin{array}{l} t_1 := \left(z \cdot 9\right) \cdot t\\ t_2 := t \cdot \left(z \cdot \frac{-4.5}{a}\right)\\ \mathbf{if}\;t\_1 \leq -1 \cdot 10^{+22}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;t\_1 \leq 2 \cdot 10^{+68}:\\ \;\;\;\;x \cdot \left(y \cdot \frac{0.5}{a}\right)\\ \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.
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 (* (* z 9.0) t)) (t_2 (* t (* z (/ -4.5 a)))))
   (if (<= t_1 -1e+22) t_2 (if (<= t_1 2e+68) (* x (* y (/ 0.5 a))) t_2))))

C

assert(x < y && y < z && z < t && t < a);
assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
	double t_1 = (z * 9.0) * t;
	double t_2 = t * (z * (-4.5 / a));
	double tmp;
	if (t_1 <= -1e+22) {
		tmp = t_2;
	} else if (t_1 <= 2e+68) {
		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.
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 = (z * 9.0d0) * t
    t_2 = t * (z * ((-4.5d0) / a))
    if (t_1 <= (-1d+22)) then
        tmp = t_2
    else if (t_1 <= 2d+68) 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;
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 = (z * 9.0) * t;
	double t_2 = t * (z * (-4.5 / a));
	double tmp;
	if (t_1 <= -1e+22) {
		tmp = t_2;
	} else if (t_1 <= 2e+68) {
		tmp = x * (y * (0.5 / a));
	} else {
		tmp = t_2;
	}
	return tmp;
}

Python

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

Julia

x, y, z, t, a = sort([x, y, z, t, a])
x, y, z, t, a = sort([x, y, z, t, a])
function code(x, y, z, t, a)
	t_1 = Float64(Float64(z * 9.0) * t)
	t_2 = Float64(t * Float64(z * Float64(-4.5 / a)))
	tmp = 0.0
	if (t_1 <= -1e+22)
		tmp = t_2;
	elseif (t_1 <= 2e+68)
		tmp = Float64(x * Float64(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])){:}
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
function tmp_2 = code(x, y, z, t, a)
	t_1 = (z * 9.0) * t;
	t_2 = t * (z * (-4.5 / a));
	tmp = 0.0;
	if (t_1 <= -1e+22)
		tmp = t_2;
	elseif (t_1 <= 2e+68)
		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.
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[(z * 9.0), $MachinePrecision] * t), $MachinePrecision]}, Block[{t$95$2 = N[(t * N[(z * N[(-4.5 / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -1e+22], t$95$2, If[LessEqual[t$95$1, 2e+68], N[(x * N[(y * N[(0.5 / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$2]]]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (*.f64 z #s(literal 9 binary64)) t) < -1e22 or 1.99999999999999991e68 < (*.f64 (*.f64 z #s(literal 9 binary64)) t)

   1. Initial program 88.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. lower-*.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. lower-*.f64 N/A

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

      4. lower-/.f64 80.3

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

   5. Applied rewrites 80.3%

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

   7. Applied rewrites 80.4%

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

   9. Applied rewrites 80.4%

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

   if -1e22 < (*.f64 (*.f64 z #s(literal 9 binary64)) t) < 1.99999999999999991e68

   1. Initial program 89.2%

      \[\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. lower-/.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. lower-*.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. lower-*.f64 69.5

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

   5. Applied rewrites 69.5%

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

   7. Applied rewrites 70.8%

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

   9. Applied rewrites 70.8%

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

4. Final simplification 74.7%

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

Alternative 9: 72.8% accurate, 0.6× speedup

Math

\[\begin{array}{l} [x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\\\ [x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\ \\ \begin{array}{l} t_1 := \left(z \cdot 9\right) \cdot t\\ t_2 := t \cdot \left(z \cdot \frac{-4.5}{a}\right)\\ \mathbf{if}\;t\_1 \leq -1 \cdot 10^{+22}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;t\_1 \leq 2 \cdot 10^{+68}:\\ \;\;\;\;\frac{x}{a} \cdot \left(y \cdot 0.5\right)\\ \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.
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 (* (* z 9.0) t)) (t_2 (* t (* z (/ -4.5 a)))))
   (if (<= t_1 -1e+22) t_2 (if (<= t_1 2e+68) (* (/ x a) (* y 0.5)) t_2))))

C

assert(x < y && y < z && z < t && t < a);
assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
	double t_1 = (z * 9.0) * t;
	double t_2 = t * (z * (-4.5 / a));
	double tmp;
	if (t_1 <= -1e+22) {
		tmp = t_2;
	} else if (t_1 <= 2e+68) {
		tmp = (x / a) * (y * 0.5);
	} else {
		tmp = t_2;
	}
	return tmp;
}

Fortran

NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8) :: t_1
    real(8) :: t_2
    real(8) :: tmp
    t_1 = (z * 9.0d0) * t
    t_2 = t * (z * ((-4.5d0) / a))
    if (t_1 <= (-1d+22)) then
        tmp = t_2
    else if (t_1 <= 2d+68) then
        tmp = (x / a) * (y * 0.5d0)
    else
        tmp = t_2
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t && t < a;
assert x < y && y < z && z < t && t < a;
public static double code(double x, double y, double z, double t, double a) {
	double t_1 = (z * 9.0) * t;
	double t_2 = t * (z * (-4.5 / a));
	double tmp;
	if (t_1 <= -1e+22) {
		tmp = t_2;
	} else if (t_1 <= 2e+68) {
		tmp = (x / a) * (y * 0.5);
	} else {
		tmp = t_2;
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
function tmp_2 = code(x, y, z, t, a)
	t_1 = (z * 9.0) * t;
	t_2 = t * (z * (-4.5 / a));
	tmp = 0.0;
	if (t_1 <= -1e+22)
		tmp = t_2;
	elseif (t_1 <= 2e+68)
		tmp = (x / a) * (y * 0.5);
	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.
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[(z * 9.0), $MachinePrecision] * t), $MachinePrecision]}, Block[{t$95$2 = N[(t * N[(z * N[(-4.5 / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -1e+22], t$95$2, If[LessEqual[t$95$1, 2e+68], N[(N[(x / a), $MachinePrecision] * N[(y * 0.5), $MachinePrecision]), $MachinePrecision], t$95$2]]]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (*.f64 z #s(literal 9 binary64)) t) < -1e22 or 1.99999999999999991e68 < (*.f64 (*.f64 z #s(literal 9 binary64)) t)

   1. Initial program 88.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. lower-*.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. lower-*.f64 N/A

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

      4. lower-/.f64 80.3

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

   5. Applied rewrites 80.3%

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

   7. Applied rewrites 80.4%

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

   9. Applied rewrites 80.4%

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

   if -1e22 < (*.f64 (*.f64 z #s(literal 9 binary64)) t) < 1.99999999999999991e68

   1. Initial program 89.2%

      \[\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. lower-/.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. lower-*.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. lower-*.f64 69.5

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

   5. Applied rewrites 69.5%

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

   7. Applied rewrites 73.4%

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

4. Final simplification 76.2%

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

Alternative 10: 72.0% accurate, 0.6× speedup

Math

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

FPCore

NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (* (* z 9.0) t)))
   (if (<= t_1 -1e+22)
     (* (* z t) (/ -4.5 a))
     (if (<= t_1 2e+68) (* (/ x a) (* y 0.5)) (* -4.5 (* t (/ z a)))))))

C

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

Fortran

NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8) :: t_1
    real(8) :: tmp
    t_1 = (z * 9.0d0) * t
    if (t_1 <= (-1d+22)) then
        tmp = (z * t) * ((-4.5d0) / a)
    else if (t_1 <= 2d+68) then
        tmp = (x / a) * (y * 0.5d0)
    else
        tmp = (-4.5d0) * (t * (z / a))
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t && t < a;
assert x < y && y < z && z < t && t < a;
public static double code(double x, double y, double z, double t, double a) {
	double t_1 = (z * 9.0) * t;
	double tmp;
	if (t_1 <= -1e+22) {
		tmp = (z * t) * (-4.5 / a);
	} else if (t_1 <= 2e+68) {
		tmp = (x / a) * (y * 0.5);
	} else {
		tmp = -4.5 * (t * (z / a));
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
function tmp_2 = code(x, y, z, t, a)
	t_1 = (z * 9.0) * t;
	tmp = 0.0;
	if (t_1 <= -1e+22)
		tmp = (z * t) * (-4.5 / a);
	elseif (t_1 <= 2e+68)
		tmp = (x / a) * (y * 0.5);
	else
		tmp = -4.5 * (t * (z / a));
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 3 regimes

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

   1. Initial program 91.4%

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

   3. Taylor expanded in x around 0

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

      1. lower-*.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. lower-*.f64 N/A

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

      4. lower-/.f64 79.3

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

   5. Applied rewrites 79.3%

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

   7. Applied rewrites 79.5%

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

   9. Applied rewrites 81.1%

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

   if -1e22 < (*.f64 (*.f64 z #s(literal 9 binary64)) t) < 1.99999999999999991e68

   1. Initial program 89.2%

      \[\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. lower-/.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. lower-*.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. lower-*.f64 69.5

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

   5. Applied rewrites 69.5%

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

   7. Applied rewrites 73.4%

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

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

   1. Initial program 85.6%

      \[\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. lower-*.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. lower-*.f64 N/A

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

      4. lower-/.f64 81.5

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

   5. Applied rewrites 81.5%

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

4. Final simplification 76.6%

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

Alternative 11: 72.8% accurate, 0.6× speedup

Math

\[\begin{array}{l} [x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\\\ [x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\ \\ \begin{array}{l} t_1 := \left(z \cdot 9\right) \cdot t\\ t_2 := -4.5 \cdot \left(t \cdot \frac{z}{a}\right)\\ \mathbf{if}\;t\_1 \leq -1 \cdot 10^{+22}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;t\_1 \leq 2 \cdot 10^{+68}:\\ \;\;\;\;\frac{x}{a} \cdot \left(y \cdot 0.5\right)\\ \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.
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 (* (* z 9.0) t)) (t_2 (* -4.5 (* t (/ z a)))))
   (if (<= t_1 -1e+22) t_2 (if (<= t_1 2e+68) (* (/ x a) (* y 0.5)) t_2))))

C

assert(x < y && y < z && z < t && t < a);
assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
	double t_1 = (z * 9.0) * t;
	double t_2 = -4.5 * (t * (z / a));
	double tmp;
	if (t_1 <= -1e+22) {
		tmp = t_2;
	} else if (t_1 <= 2e+68) {
		tmp = (x / a) * (y * 0.5);
	} else {
		tmp = t_2;
	}
	return tmp;
}

Fortran

NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8) :: t_1
    real(8) :: t_2
    real(8) :: tmp
    t_1 = (z * 9.0d0) * t
    t_2 = (-4.5d0) * (t * (z / a))
    if (t_1 <= (-1d+22)) then
        tmp = t_2
    else if (t_1 <= 2d+68) then
        tmp = (x / a) * (y * 0.5d0)
    else
        tmp = t_2
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t && t < a;
assert x < y && y < z && z < t && t < a;
public static double code(double x, double y, double z, double t, double a) {
	double t_1 = (z * 9.0) * t;
	double t_2 = -4.5 * (t * (z / a));
	double tmp;
	if (t_1 <= -1e+22) {
		tmp = t_2;
	} else if (t_1 <= 2e+68) {
		tmp = (x / a) * (y * 0.5);
	} else {
		tmp = t_2;
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
function tmp_2 = code(x, y, z, t, a)
	t_1 = (z * 9.0) * t;
	t_2 = -4.5 * (t * (z / a));
	tmp = 0.0;
	if (t_1 <= -1e+22)
		tmp = t_2;
	elseif (t_1 <= 2e+68)
		tmp = (x / a) * (y * 0.5);
	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.
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[(z * 9.0), $MachinePrecision] * t), $MachinePrecision]}, Block[{t$95$2 = N[(-4.5 * N[(t * N[(z / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -1e+22], t$95$2, If[LessEqual[t$95$1, 2e+68], N[(N[(x / a), $MachinePrecision] * N[(y * 0.5), $MachinePrecision]), $MachinePrecision], t$95$2]]]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (*.f64 z #s(literal 9 binary64)) t) < -1e22 or 1.99999999999999991e68 < (*.f64 (*.f64 z #s(literal 9 binary64)) t)

   1. Initial program 88.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. lower-*.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. lower-*.f64 N/A

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

      4. lower-/.f64 80.3

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

   5. Applied rewrites 80.3%

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

   if -1e22 < (*.f64 (*.f64 z #s(literal 9 binary64)) t) < 1.99999999999999991e68

   1. Initial program 89.2%

      \[\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. lower-/.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. lower-*.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. lower-*.f64 69.5

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

   5. Applied rewrites 69.5%

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

   7. Applied rewrites 73.4%

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

4. Final simplification 76.2%

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

Alternative 12: 93.4% accurate, 0.8× speedup

Math

\[\begin{array}{l} [x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\\\ [x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\ \\ \begin{array}{l} \mathbf{if}\;x \cdot y \leq -\infty:\\ \;\;\;\;\frac{x}{a} \cdot \left(y \cdot 0.5\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.
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))
   (* (/ x a) (* y 0.5))
   (/ (fma (* t -9.0) z (* x y)) (* a 2.0))))

C

assert(x < y && y < z && z < t && t < a);
assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((x * y) <= -((double) INFINITY)) {
		tmp = (x / a) * (y * 0.5);
	} 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])
x, y, z, t, a = sort([x, y, z, t, a])
function code(x, y, z, t, a)
	tmp = 0.0
	if (Float64(x * y) <= Float64(-Inf))
		tmp = Float64(Float64(x / a) * Float64(y * 0.5));
	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.
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_] := If[LessEqual[N[(x * y), $MachinePrecision], (-Infinity)], N[(N[(x / a), $MachinePrecision] * N[(y * 0.5), $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 55.8%

      \[\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. lower-/.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. lower-*.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. lower-*.f64 59.1

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

   5. Applied rewrites 59.1%

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

   7. Applied rewrites 93.0%

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

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

   1. Initial program 93.1%

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

      4. lift-*.f64 N/A

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

      5. lift-*.f64 N/A

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

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

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

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

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

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

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

      12. lower-*.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} \]

      13. metadata-eval 93.1

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

   4. Applied rewrites 93.1%

      \[\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 93.1%

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

Alternative 13: 93.3% accurate, 0.8× speedup

Math

\[\begin{array}{l} [x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\\\ [x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\ \\ \begin{array}{l} \mathbf{if}\;x \cdot y \leq -\infty:\\ \;\;\;\;\frac{x}{a} \cdot \left(y \cdot 0.5\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.
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))
   (* (/ x a) (* y 0.5))
   (* (fma z (* t -9.0) (* x y)) (/ 0.5 a))))

C

assert(x < y && y < z && z < t && t < a);
assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((x * y) <= -((double) INFINITY)) {
		tmp = (x / a) * (y * 0.5);
	} 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])
x, y, z, t, a = sort([x, y, z, t, a])
function code(x, y, z, t, a)
	tmp = 0.0
	if (Float64(x * y) <= Float64(-Inf))
		tmp = Float64(Float64(x / a) * Float64(y * 0.5));
	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.
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_] := If[LessEqual[N[(x * y), $MachinePrecision], (-Infinity)], N[(N[(x / a), $MachinePrecision] * N[(y * 0.5), $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 55.8%

      \[\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. lower-/.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. lower-*.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. lower-*.f64 59.1

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

   5. Applied rewrites 59.1%

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

   7. Applied rewrites 93.0%

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

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

   1. Initial program 93.1%

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

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

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

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

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

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

      14. lower-*.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} \]

      15. metadata-eval N/A

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

      16. lift-*.f64 N/A

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

      17. *-commutative N/A

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

      18. associate-/r* N/A

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

      19. lower-/.f64 N/A

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

      20. 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 rewrites 93.1%

      \[\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 93.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \cdot y \leq -\infty:\\ \;\;\;\;\frac{x}{a} \cdot \left(y \cdot 0.5\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 14: 50.2% accurate, 1.2× speedup

Math

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

FPCore

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

C

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

Fortran

NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8) :: tmp
    if (x <= (-6.2d-212)) then
        tmp = (-4.5d0) * (t * (z / a))
    else
        tmp = (-4.5d0) * ((z * t) / a)
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t && t < a;
assert x < y && y < z && z < t && t < a;
public static double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (x <= -6.2e-212) {
		tmp = -4.5 * (t * (z / a));
	} else {
		tmp = -4.5 * ((z * t) / a);
	}
	return tmp;
}

Python

[x, y, z, t, a] = sort([x, y, z, t, a])
[x, y, z, t, a] = sort([x, y, z, t, a])
def code(x, y, z, t, a):
	tmp = 0
	if x <= -6.2e-212:
		tmp = -4.5 * (t * (z / a))
	else:
		tmp = -4.5 * ((z * t) / a)
	return tmp

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < -6.20000000000000011e-212

   1. Initial program 86.6%

      \[\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. lower-*.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. lower-*.f64 N/A

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

      4. lower-/.f64 46.4

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

   5. Applied rewrites 46.4%

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

   if -6.20000000000000011e-212 < x

   1. Initial program 91.0%

      \[\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. lower-*.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. lower-*.f64 N/A

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

      4. lower-/.f64 56.9

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

   5. Applied rewrites 56.9%

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

   7. Applied rewrites 58.1%

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

4. Final simplification 52.8%

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

Alternative 15: 50.4% accurate, 1.6× speedup

Math

\[\begin{array}{l} [x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\\\ [x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\ \\ -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.
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);
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.
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;
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])
[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])
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])){:}
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.
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 89.0%

   \[\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. lower-*.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. lower-*.f64 N/A

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

   4. lower-/.f64 52.2

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

5. Applied rewrites 52.2%

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

Developer Target 1: 93.5% 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 2024220 
(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)))