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

Percentage Accurate: 91.7% → 97.0%

Time: 7.8s

Alternatives: 12

Speedup: 1.0×

• 29.2% 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.7% 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.0% accurate, 0.1× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

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

   1. Initial program 78.1%

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

      1. div-sub 74.8%

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

      2. *-commutative 74.8%

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

      3. div-sub 78.1%

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

      4. cancel-sign-sub-inv 78.1%

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

      5. *-commutative 78.1%

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

      6. fma-define 78.1%

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

      7. distribute-rgt-neg-in 78.1%

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

      8. associate-*r* 78.1%

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

      9. distribute-lft-neg-in 78.1%

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

      10. *-commutative 78.1%

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

      11. distribute-rgt-neg-in 78.1%

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

      12. metadata-eval 78.1%

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

   3. Simplified 78.1%

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

      1. *-commutative 78.1%

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

      2. associate-*r* 78.1%

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

      3. metadata-eval 78.1%

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

      4. distribute-rgt-neg-in 78.1%

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

      5. distribute-lft-neg-in 78.1%

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

      6. fma-neg 78.1%

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

      7. associate-*l* 78.1%

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

   6. Applied egg-rr 78.1%

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

      1. div-sub 74.8%

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

      2. times-frac 77.8%

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

      3. times-frac 93.2%

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

   8. Applied egg-rr 93.2%

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

   9. Taylor expanded in z around 0 77.8%

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

       1. associate-*l/ 93.3%

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

       2. associate-/r/ 93.3%

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

       3. associate-/l* 93.2%

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

       4. *-commutative 93.2%

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

       5. associate-/l* 93.3%

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

   11. Simplified 93.3%

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

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

   1. Initial program 99.1%

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

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

   1. Initial program 70.8%

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

   3. Taylor expanded in z around inf 68.6%

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

   4. Taylor expanded in z around 0 65.3%

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

      1. fma-define 65.3%

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

      2. associate-/l* 78.4%

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

      3. associate-*r/ 81.2%

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

      4. associate-*l/ 81.2%

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

      5. *-commutative 81.2%

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

      6. associate-*r* 94.4%

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

   6. Simplified 94.4%

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

Alternative 2: 97.0% accurate, 0.1× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

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

   1. Initial program 78.1%

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

      1. div-sub 74.8%

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

      2. *-commutative 74.8%

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

      3. div-sub 78.1%

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

      4. cancel-sign-sub-inv 78.1%

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

      5. *-commutative 78.1%

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

      6. fma-define 78.1%

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

      7. distribute-rgt-neg-in 78.1%

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

      8. associate-*r* 78.1%

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

      9. distribute-lft-neg-in 78.1%

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

      10. *-commutative 78.1%

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

      11. distribute-rgt-neg-in 78.1%

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

      12. metadata-eval 78.1%

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

   3. Simplified 78.1%

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

      1. *-commutative 78.1%

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

      2. associate-*r* 78.1%

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

      3. metadata-eval 78.1%

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

      4. distribute-rgt-neg-in 78.1%

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

      5. distribute-lft-neg-in 78.1%

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

      6. fma-neg 78.1%

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

      7. associate-*l* 78.1%

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

   6. Applied egg-rr 78.1%

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

      1. div-sub 74.8%

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

      2. times-frac 77.8%

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

      3. times-frac 93.2%

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

   8. Applied egg-rr 93.2%

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

   9. Taylor expanded in z around 0 77.8%

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

       1. associate-*l/ 93.3%

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

       2. associate-/r/ 93.3%

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

       3. associate-/l* 93.2%

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

       4. *-commutative 93.2%

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

       5. associate-/l* 93.3%

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

   11. Simplified 93.3%

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

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

   1. Initial program 99.1%

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

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

   1. Initial program 68.2%

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

   3. Taylor expanded in x around 0 65.1%

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

      1. fma-define 65.1%

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

      2. associate-/l* 79.5%

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

      3. associate-/l* 93.9%

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

   5. Simplified 93.9%

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

Alternative 3: 96.9% accurate, 0.3× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 3 regimes

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

   1. Initial program 78.1%

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

      1. div-sub 74.8%

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

      2. *-commutative 74.8%

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

      3. div-sub 78.1%

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

      4. cancel-sign-sub-inv 78.1%

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

      5. *-commutative 78.1%

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

      6. fma-define 78.1%

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

      7. distribute-rgt-neg-in 78.1%

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

      8. associate-*r* 78.1%

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

      9. distribute-lft-neg-in 78.1%

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

      10. *-commutative 78.1%

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

      11. distribute-rgt-neg-in 78.1%

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

      12. metadata-eval 78.1%

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

   3. Simplified 78.1%

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

      1. *-commutative 78.1%

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

      2. associate-*r* 78.1%

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

      3. metadata-eval 78.1%

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

      4. distribute-rgt-neg-in 78.1%

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

      5. distribute-lft-neg-in 78.1%

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

      6. fma-neg 78.1%

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

      7. associate-*l* 78.1%

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

   6. Applied egg-rr 78.1%

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

      1. div-sub 74.8%

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

      2. times-frac 77.8%

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

      3. times-frac 93.2%

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

   8. Applied egg-rr 93.2%

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

   9. Taylor expanded in z around 0 77.8%

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

       1. associate-*l/ 93.3%

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

       2. associate-/r/ 93.3%

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

       3. associate-/l* 93.2%

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

       4. *-commutative 93.2%

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

       5. associate-/l* 93.3%

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

   11. Simplified 93.3%

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

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

   1. Initial program 99.1%

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

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

   1. Initial program 68.2%

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

      1. div-sub 65.1%

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

      2. *-commutative 65.1%

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

      3. div-sub 68.2%

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

      4. cancel-sign-sub-inv 68.2%

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

      5. *-commutative 68.2%

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

      6. fma-define 68.3%

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

      7. distribute-rgt-neg-in 68.3%

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

      8. associate-*r* 68.3%

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

      9. distribute-lft-neg-in 68.3%

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

      10. *-commutative 68.3%

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

      11. distribute-rgt-neg-in 68.3%

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

      12. metadata-eval 68.3%

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

   3. Simplified 68.3%

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

      1. *-commutative 68.3%

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

      2. associate-*r* 68.3%

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

      3. metadata-eval 68.3%

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

      4. distribute-rgt-neg-in 68.3%

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

      5. distribute-lft-neg-in 68.3%

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

      6. fma-neg 68.2%

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

      7. associate-*l* 68.2%

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

   6. Applied egg-rr 68.2%

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

      1. div-sub 65.1%

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

      2. times-frac 70.9%

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

      3. times-frac 93.8%

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

   8. Applied egg-rr 93.8%

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

Alternative 4: 97.0% accurate, 0.3× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
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[Or[LessEqual[t$95$1, (-Infinity)], N[Not[LessEqual[t$95$1, 1e+282]], $MachinePrecision]], N[(N[(N[(x / a), $MachinePrecision] * N[(y / 2.0), $MachinePrecision]), $MachinePrecision] - N[(t * N[(4.5 / N[(a / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(t$95$1 / N[(a * 2.0), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

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

   1. Initial program 72.9%

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

      1. div-sub 69.7%

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

      2. *-commutative 69.7%

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

      3. div-sub 72.9%

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

      4. cancel-sign-sub-inv 72.9%

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

      5. *-commutative 72.9%

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

      6. fma-define 73.0%

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

      7. distribute-rgt-neg-in 73.0%

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

      8. associate-*r* 73.0%

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

      9. distribute-lft-neg-in 73.0%

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

      10. *-commutative 73.0%

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

      11. distribute-rgt-neg-in 73.0%

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

      12. metadata-eval 73.0%

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

   3. Simplified 73.0%

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

      1. *-commutative 73.0%

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

      2. associate-*r* 73.0%

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

      3. metadata-eval 73.0%

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

      4. distribute-rgt-neg-in 73.0%

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

      5. distribute-lft-neg-in 73.0%

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

      6. fma-neg 72.9%

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

      7. associate-*l* 72.9%

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

   6. Applied egg-rr 72.9%

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

      1. div-sub 69.7%

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

      2. times-frac 74.2%

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

      3. times-frac 93.6%

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

   8. Applied egg-rr 93.6%

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

   9. Taylor expanded in z around 0 74.2%

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

       1. associate-*l/ 93.6%

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

       2. associate-/r/ 93.6%

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

       3. associate-/l* 93.5%

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

       4. *-commutative 93.5%

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

       5. associate-/l* 93.6%

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

   11. Simplified 93.6%

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

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

   1. Initial program 99.1%

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

4. Final simplification 97.8%

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

Alternative 5: 94.8% accurate, 0.4× speedup

Math

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

FPCore

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

C

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

Java

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

Python

[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 <= -math.inf:
		tmp = -4.5 * (t * (z / a))
	elif t_1 <= 5e+184:
		tmp = ((x * y) - t_1) / (a * 2.0)
	else:
		tmp = z * (-4.5 * (t / a))
	return tmp

Julia

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

MATLAB

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

Derivation

1. Split input into 3 regimes

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

   1. Initial program 46.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 46.3%

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

      1. associate-/l* 84.4%

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

   5. Simplified 84.4%

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

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

   1. Initial program 97.5%

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

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

   1. Initial program 82.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 82.6%

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

      1. associate-*r/ 82.7%

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

      2. associate-*r* 82.5%

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

      3. associate-*l/ 99.9%

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

      4. associate-*r/ 99.9%

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

      5. *-commutative 99.9%

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

      6. associate-*r/ 99.9%

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

   5. Simplified 99.9%

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

   6. Taylor expanded in t around 0 99.9%

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

Alternative 6: 74.2% accurate, 0.6× speedup

Math

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

FPCore

NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
(FPCore (x y z t a)
 :precision binary64
 (if (or (<= (* x y) -1e+92) (not (<= (* x y) 2e+15)))
   (* y (/ (* x 0.5) a))
   (/ (* t (* z -9.0)) (* a 2.0))))

C

assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (((x * y) <= -1e+92) || !((x * y) <= 2e+15)) {
		tmp = y * ((x * 0.5) / a);
	} else {
		tmp = (t * (z * -9.0)) / (a * 2.0);
	}
	return tmp;
}

Fortran

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

Java

assert x < y && y < z && z < t && t < a;
public static double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (((x * y) <= -1e+92) || !((x * y) <= 2e+15)) {
		tmp = y * ((x * 0.5) / a);
	} else {
		tmp = (t * (z * -9.0)) / (a * 2.0);
	}
	return tmp;
}

Python

[x, y, z, t, a] = sort([x, y, z, t, a])
def code(x, y, z, t, a):
	tmp = 0
	if ((x * y) <= -1e+92) or not ((x * y) <= 2e+15):
		tmp = y * ((x * 0.5) / a)
	else:
		tmp = (t * (z * -9.0)) / (a * 2.0)
	return tmp

Julia

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

MATLAB

x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if (((x * y) <= -1e+92) || ~(((x * y) <= 2e+15)))
		tmp = y * ((x * 0.5) / a);
	else
		tmp = (t * (z * -9.0)) / (a * 2.0);
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 x y) < -1e92 or 2e15 < (*.f64 x y)

   1. Initial program 90.1%

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

   3. Taylor expanded in y around inf 82.8%

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

   4. Taylor expanded in t around 0 82.0%

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

      1. associate-*r/ 82.0%

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

   6. Simplified 82.0%

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

   if -1e92 < (*.f64 x y) < 2e15

   1. Initial program 94.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 75.5%

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

      1. *-commutative 75.5%

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

      2. associate-*r* 75.6%

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

   5. Simplified 75.6%

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

4. Final simplification 78.3%

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

Alternative 7: 74.4% accurate, 0.6× speedup

Math

\[\begin{array}{l} [x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\ \\ \begin{array}{l} \mathbf{if}\;x \cdot y \leq -1 \cdot 10^{+92} \lor \neg \left(x \cdot y \leq 2 \cdot 10^{+15}\right):\\ \;\;\;\;y \cdot \frac{x \cdot 0.5}{a}\\ \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.
(FPCore (x y z t a)
 :precision binary64
 (if (or (<= (* x y) -1e+92) (not (<= (* x y) 2e+15)))
   (* y (/ (* x 0.5) a))
   (* -4.5 (/ (* z t) a))))

C

assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (((x * y) <= -1e+92) || !((x * y) <= 2e+15)) {
		tmp = y * ((x * 0.5) / 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.
real(8) function code(x, y, z, t, a)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8) :: tmp
    if (((x * y) <= (-1d+92)) .or. (.not. ((x * y) <= 2d+15))) then
        tmp = y * ((x * 0.5d0) / a)
    else
        tmp = (-4.5d0) * ((z * t) / a)
    end if
    code = tmp
end function

Java

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

Python

[x, y, z, t, a] = sort([x, y, z, t, a])
def code(x, y, z, t, a):
	tmp = 0
	if ((x * y) <= -1e+92) or not ((x * y) <= 2e+15):
		tmp = y * ((x * 0.5) / a)
	else:
		tmp = -4.5 * ((z * t) / a)
	return tmp

Julia

x, y, z, t, a = sort([x, y, z, t, a])
function code(x, y, z, t, a)
	tmp = 0.0
	if ((Float64(x * y) <= -1e+92) || !(Float64(x * y) <= 2e+15))
		tmp = Float64(y * Float64(Float64(x * 0.5) / 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])){:}
function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if (((x * y) <= -1e+92) || ~(((x * y) <= 2e+15)))
		tmp = y * ((x * 0.5) / 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.
code[x_, y_, z_, t_, a_] := If[Or[LessEqual[N[(x * y), $MachinePrecision], -1e+92], N[Not[LessEqual[N[(x * y), $MachinePrecision], 2e+15]], $MachinePrecision]], N[(y * N[(N[(x * 0.5), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision], N[(-4.5 * N[(N[(z * t), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 x y) < -1e92 or 2e15 < (*.f64 x y)

   1. Initial program 90.1%

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

   3. Taylor expanded in y around inf 82.8%

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

   4. Taylor expanded in t around 0 82.0%

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

      1. associate-*r/ 82.0%

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

   6. Simplified 82.0%

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

   if -1e92 < (*.f64 x y) < 2e15

   1. Initial program 94.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 75.5%

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

4. Final simplification 78.3%

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

Alternative 8: 66.9% accurate, 0.8× speedup

Math

\[\begin{array}{l} [x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\ \\ \begin{array}{l} \mathbf{if}\;y \leq -4.7 \cdot 10^{-61} \lor \neg \left(y \leq 7.8 \cdot 10^{+74}\right):\\ \;\;\;\;x \cdot \frac{y \cdot 0.5}{a}\\ \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.
(FPCore (x y z t a)
 :precision binary64
 (if (or (<= y -4.7e-61) (not (<= y 7.8e+74)))
   (* x (/ (* y 0.5) a))
   (* -4.5 (/ (* z t) a))))

C

assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((y <= -4.7e-61) || !(y <= 7.8e+74)) {
		tmp = x * ((y * 0.5) / 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.
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 ((y <= (-4.7d-61)) .or. (.not. (y <= 7.8d+74))) then
        tmp = x * ((y * 0.5d0) / a)
    else
        tmp = (-4.5d0) * ((z * t) / a)
    end if
    code = tmp
end function

Java

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

Python

[x, y, z, t, a] = sort([x, y, z, t, a])
def code(x, y, z, t, a):
	tmp = 0
	if (y <= -4.7e-61) or not (y <= 7.8e+74):
		tmp = x * ((y * 0.5) / a)
	else:
		tmp = -4.5 * ((z * t) / a)
	return tmp

Julia

x, y, z, t, a = sort([x, y, z, t, a])
function code(x, y, z, t, a)
	tmp = 0.0
	if ((y <= -4.7e-61) || !(y <= 7.8e+74))
		tmp = Float64(x * Float64(Float64(y * 0.5) / 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])){:}
function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if ((y <= -4.7e-61) || ~((y <= 7.8e+74)))
		tmp = x * ((y * 0.5) / 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.
code[x_, y_, z_, t_, a_] := If[Or[LessEqual[y, -4.7e-61], N[Not[LessEqual[y, 7.8e+74]], $MachinePrecision]], N[(x * N[(N[(y * 0.5), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision], N[(-4.5 * N[(N[(z * t), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -4.6999999999999997e-61 or 7.80000000000000015e74 < y

   1. Initial program 90.3%

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

   3. Taylor expanded in x around inf 72.4%

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

      1. *-commutative 72.4%

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

      2. associate-/l* 75.2%

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

      3. associate-*r* 75.2%

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

      4. *-commutative 75.2%

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

      5. associate-*r/ 75.2%

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

   5. Simplified 75.2%

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

   if -4.6999999999999997e-61 < y < 7.80000000000000015e74

   1. Initial program 94.7%

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

   3. Taylor expanded in x around 0 68.3%

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

4. Final simplification 71.5%

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

Alternative 9: 91.7% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    code = ((x * y) - (z * (9.0d0 * t))) / (a * 2.0d0)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 92.7%

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

   1. div-sub 90.3%

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

   2. *-commutative 90.3%

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

   3. div-sub 92.7%

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

   4. cancel-sign-sub-inv 92.7%

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

   5. *-commutative 92.7%

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

   6. fma-define 92.7%

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

   7. distribute-rgt-neg-in 92.7%

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

   8. associate-*r* 92.7%

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

   9. distribute-lft-neg-in 92.7%

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

   10. *-commutative 92.7%

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

   11. distribute-rgt-neg-in 92.7%

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

   12. metadata-eval 92.7%

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

3. Simplified 92.7%

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

   1. *-commutative 92.7%

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

   2. associate-*r* 92.7%

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

   3. metadata-eval 92.7%

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

   4. distribute-rgt-neg-in 92.7%

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

   5. distribute-lft-neg-in 92.7%

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

   6. fma-neg 92.7%

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

   7. associate-*l* 92.7%

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

6. Applied egg-rr 92.7%

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

Alternative 10: 52.7% accurate, 1.1× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if a < 1.4e13

   1. Initial program 95.2%

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

   3. Taylor expanded in x around 0 49.8%

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

   if 1.4e13 < a

   1. Initial program 85.0%

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

      1. div-sub 85.0%

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

      2. *-commutative 85.0%

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

      3. div-sub 85.0%

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

      4. cancel-sign-sub-inv 85.0%

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

      5. *-commutative 85.0%

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

      6. fma-define 85.1%

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

      7. distribute-rgt-neg-in 85.1%

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

      8. associate-*r* 85.1%

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

      9. distribute-lft-neg-in 85.1%

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

      10. *-commutative 85.1%

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

      11. distribute-rgt-neg-in 85.1%

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

      12. metadata-eval 85.1%

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

   3. Simplified 85.1%

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

      1. *-commutative 85.1%

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

      2. associate-*r* 85.1%

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

      3. metadata-eval 85.1%

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

      4. distribute-rgt-neg-in 85.1%

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

      5. distribute-lft-neg-in 85.1%

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

      6. fma-neg 85.0%

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

      7. associate-*l* 85.0%

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

   6. Applied egg-rr 85.0%

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

   7. Taylor expanded in x around 0 48.9%

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

      1. associate-*r/ 49.6%

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

      2. *-commutative 49.6%

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

      3. associate-*l* 49.7%

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

      4. *-commutative 49.7%

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

      5. associate-*r/ 49.6%

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

   9. Simplified 49.6%

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

4. Final simplification 49.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;a \leq 14000000000000:\\ \;\;\;\;-4.5 \cdot \frac{z \cdot t}{a}\\ \mathbf{else}:\\ \;\;\;\;t \cdot \frac{z \cdot -4.5}{a}\\ \end{array} \]
5. Add Preprocessing

Alternative 11: 52.7% accurate, 1.1× speedup

Math

\[\begin{array}{l} [x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\ \\ \begin{array}{l} \mathbf{if}\;a \leq 20000:\\ \;\;\;\;-4.5 \cdot \frac{z \cdot t}{a}\\ \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.
(FPCore (x y z t a)
 :precision binary64
 (if (<= a 20000.0) (* -4.5 (/ (* z t) a)) (* -4.5 (* t (/ z a)))))

C

assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (a <= 20000.0) {
		tmp = -4.5 * ((z * t) / a);
	} 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.
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 <= 20000.0d0) then
        tmp = (-4.5d0) * ((z * t) / a)
    else
        tmp = (-4.5d0) * (t * (z / a))
    end if
    code = tmp
end function

Java

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

Python

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

Julia

x, y, z, t, a = sort([x, y, z, t, a])
function code(x, y, z, t, a)
	tmp = 0.0
	if (a <= 20000.0)
		tmp = Float64(-4.5 * Float64(Float64(z * t) / a));
	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])){:}
function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if (a <= 20000.0)
		tmp = -4.5 * ((z * t) / a);
	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.
code[x_, y_, z_, t_, a_] := If[LessEqual[a, 20000.0], N[(-4.5 * N[(N[(z * t), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision], N[(-4.5 * N[(t * N[(z / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if a < 2e4

   1. Initial program 95.2%

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

   3. Taylor expanded in x around 0 49.8%

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

   if 2e4 < a

   1. Initial program 85.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 48.9%

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

      1. associate-/l* 49.6%

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

   5. Simplified 49.6%

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

4. Final simplification 49.7%

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

Alternative 12: 52.5% accurate, 1.9× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 92.7%

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

3. Taylor expanded in x around 0 49.6%

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

   1. associate-/l* 50.7%

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

5. Simplified 50.7%

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

Developer target: 93.9% accurate, 0.5× speedup

Math

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

FPCore

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

C

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

Fortran

real(8) function code(x, y, z, t, a)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8) :: tmp
    if (a < (-2.090464557976709d+86)) then
        tmp = (0.5d0 * ((y * x) / a)) - (4.5d0 * (t / (a / z)))
    else if (a < 2.144030707833976d+99) then
        tmp = ((x * y) - (z * (9.0d0 * t))) / (a * 2.0d0)
    else
        tmp = ((y / a) * (x * 0.5d0)) - ((t / a) * (z * 4.5d0))
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Reproduce

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

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

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