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

Percentage Accurate: 91.8% → 94.9%

Time: 5.8s

Alternatives: 12

Speedup: 0.7×

• 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

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x, y, z, t, a)
use fmin_fmax_functions
    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.8% 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

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 94.9% accurate, 0.7× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if a < 4e5

   1. Initial program 91.8%

      \[\frac{x \cdot y - \left(z \cdot 9\right) \cdot t}{a \cdot 2} \]
   2. 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. mult-flip 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-flip N/A

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

      6. +-commutative N/A

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

      7. lift-*.f64 N/A

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

      8. *-commutative N/A

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

      9. lift-*.f64 N/A

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

      10. associate-*r* N/A

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

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

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

      12. lower-fma.f64 N/A

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

      13. lower-*.f64 N/A

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

      14. metadata-eval N/A

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

      15. lift-*.f64 N/A

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

      16. *-commutative N/A

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

      17. lower-*.f64 N/A

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

      18. lift-*.f64 N/A

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

      19. *-commutative N/A

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

      20. associate-/r* N/A

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

      21. lower-/.f64 N/A

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

      22. metadata-eval 91.8

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

   3. Applied rewrites 91.8%

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

   if 4e5 < a

   1. Initial program 91.8%

      \[\frac{x \cdot y - \left(z \cdot 9\right) \cdot t}{a \cdot 2} \]
   2. 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. sub-flip N/A

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

      4. +-commutative N/A

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

      5. div-add N/A

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

      6. lift-*.f64 N/A

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

      7. lift-*.f64 N/A

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

      8. associate-*l* N/A

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

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

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

      10. lift-*.f64 N/A

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

      11. times-frac N/A

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

      12. lower-fma.f64 N/A

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

      13. lower-/.f64 N/A

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

      14. lower-neg.f64 N/A

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

      15. *-commutative N/A

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

      16. associate-/l* N/A

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

      17. lower-*.f64 N/A

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

      18. metadata-eval N/A

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

      19. lift-*.f64 N/A

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

      20. *-commutative N/A

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

      21. associate-/l* N/A

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

      22. *-commutative N/A

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

   3. Applied rewrites 88.0%

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

Alternative 2: 94.3% accurate, 0.5× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

   1. Initial program 91.8%

      \[\frac{x \cdot y - \left(z \cdot 9\right) \cdot t}{a \cdot 2} \]
   2. 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. mult-flip 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-flip N/A

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

      6. +-commutative N/A

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

      7. lift-*.f64 N/A

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

      8. *-commutative N/A

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

      9. lift-*.f64 N/A

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

      10. associate-*r* N/A

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

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

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

      12. lower-fma.f64 N/A

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

      13. lower-*.f64 N/A

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

      14. metadata-eval N/A

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

      15. lift-*.f64 N/A

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

      16. *-commutative N/A

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

      17. lower-*.f64 N/A

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

      18. lift-*.f64 N/A

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

      19. *-commutative N/A

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

      20. associate-/r* N/A

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

      21. lower-/.f64 N/A

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

      22. metadata-eval 91.8

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

   3. Applied rewrites 91.8%

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

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

   1. Initial program 91.8%

      \[\frac{x \cdot y - \left(z \cdot 9\right) \cdot t}{a \cdot 2} \]
   2. 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. sub-flip N/A

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

      4. div-add N/A

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

      5. lift-*.f64 N/A

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

      6. *-commutative N/A

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

      7. lift-*.f64 N/A

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

      8. times-frac N/A

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

      9. associate-*r/ N/A

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

      10. lift-*.f64 N/A

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

      11. associate-/r* N/A

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

      12. div-add-rev N/A

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

      13. lower-/.f64 N/A

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

   3. Applied rewrites 88.0%

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

Alternative 3: 94.1% accurate, 0.5× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

   1. Initial program 91.8%

      \[\frac{x \cdot y - \left(z \cdot 9\right) \cdot t}{a \cdot 2} \]
   2. 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. mult-flip 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-flip N/A

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

      6. +-commutative N/A

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

      7. lift-*.f64 N/A

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

      8. *-commutative N/A

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

      9. lift-*.f64 N/A

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

      10. associate-*r* N/A

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

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

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

      12. lower-fma.f64 N/A

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

      13. lower-*.f64 N/A

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

      14. metadata-eval N/A

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

      15. lift-*.f64 N/A

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

      16. *-commutative N/A

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

      17. lower-*.f64 N/A

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

      18. lift-*.f64 N/A

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

      19. *-commutative N/A

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

      20. associate-/r* N/A

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

      21. lower-/.f64 N/A

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

      22. metadata-eval 91.8

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

   3. Applied rewrites 91.8%

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

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

   1. Initial program 91.8%

      \[\frac{x \cdot y - \left(z \cdot 9\right) \cdot t}{a \cdot 2} \]
   2. 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. sub-flip N/A

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

      4. +-commutative N/A

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

      5. div-add N/A

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

      6. lift-*.f64 N/A

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

      7. associate-/r* N/A

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

      8. lift-*.f64 N/A

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

      9. *-commutative N/A

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

      10. lift-*.f64 N/A

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

      11. times-frac N/A

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

      12. associate-*r/ N/A

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

      13. div-add-rev N/A

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

      14. lower-/.f64 N/A

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

   3. Applied rewrites 87.3%

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

Alternative 4: 93.6% accurate, 0.7× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if a < 2.0000000000000001e26

   1. Initial program 91.8%

      \[\frac{x \cdot y - \left(z \cdot 9\right) \cdot t}{a \cdot 2} \]
   2. 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. mult-flip 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-flip N/A

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

      6. +-commutative N/A

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

      7. lift-*.f64 N/A

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

      8. *-commutative N/A

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

      9. lift-*.f64 N/A

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

      10. associate-*r* N/A

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

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

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

      12. lower-fma.f64 N/A

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

      13. lower-*.f64 N/A

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

      14. metadata-eval N/A

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

      15. lift-*.f64 N/A

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

      16. *-commutative N/A

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

      17. lower-*.f64 N/A

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

      18. lift-*.f64 N/A

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

      19. *-commutative N/A

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

      20. associate-/r* N/A

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

      21. lower-/.f64 N/A

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

      22. metadata-eval 91.8

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

   3. Applied rewrites 91.8%

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

   if 2.0000000000000001e26 < a

   1. Initial program 91.8%

      \[\frac{x \cdot y - \left(z \cdot 9\right) \cdot t}{a \cdot 2} \]
   2. 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. mult-flip 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-flip N/A

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

      6. +-commutative N/A

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

      7. lift-*.f64 N/A

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

      8. *-commutative N/A

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

      9. lift-*.f64 N/A

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

      10. associate-*r* N/A

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

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

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

      12. lower-fma.f64 N/A

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

      13. lower-*.f64 N/A

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

      14. metadata-eval N/A

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

      15. lift-*.f64 N/A

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

      16. *-commutative N/A

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

      17. lower-*.f64 N/A

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

      18. lift-*.f64 N/A

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

      19. *-commutative N/A

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

      20. associate-/r* N/A

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

      21. lower-/.f64 N/A

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

      22. metadata-eval 91.8

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

   3. Applied rewrites 91.8%

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

   5. Applied rewrites 88.7%

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

Alternative 5: 93.5% accurate, 0.7× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 91.8%

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

   2. Taylor expanded in x around 0

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

      1. lower-*.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. lower-*.f64 51.7

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

   4. Applied rewrites 51.7%

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

      1. lift-*.f64 N/A

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

      2. metadata-eval N/A

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

      3. lift-/.f64 N/A

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

      4. times-frac N/A

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

      5. *-commutative N/A

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

      6. lift-*.f64 N/A

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

      7. associate-*l* N/A

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

      8. *-commutative N/A

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

      9. times-frac N/A

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

      10. lower-*.f64 N/A

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

      11. lower-/.f64 N/A

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

      12. associate-/l* N/A

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

      13. metadata-eval N/A

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

      14. *-commutative N/A

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

      15. lower-*.f64 52.2

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

   6. Applied rewrites 52.2%

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

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

   1. Initial program 91.8%

      \[\frac{x \cdot y - \left(z \cdot 9\right) \cdot t}{a \cdot 2} \]
   2. 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. mult-flip 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-flip N/A

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

      6. +-commutative N/A

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

      7. lift-*.f64 N/A

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

      8. *-commutative N/A

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

      9. lift-*.f64 N/A

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

      10. associate-*r* N/A

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

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

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

      12. lower-fma.f64 N/A

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

      13. lower-*.f64 N/A

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

      14. metadata-eval N/A

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

      15. lift-*.f64 N/A

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

      16. *-commutative N/A

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

      17. lower-*.f64 N/A

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

      18. lift-*.f64 N/A

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

      19. *-commutative N/A

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

      20. associate-/r* N/A

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

      21. lower-/.f64 N/A

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

      22. metadata-eval 91.8

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

   3. Applied rewrites 91.8%

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

Alternative 6: 93.4% accurate, 0.7× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 91.8%

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

   2. Taylor expanded in x around 0

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

      1. lower-*.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. lower-*.f64 51.7

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

   4. Applied rewrites 51.7%

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

      1. lift-*.f64 N/A

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

      2. metadata-eval N/A

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

      3. lift-/.f64 N/A

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

      4. times-frac N/A

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

      5. *-commutative N/A

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

      6. lift-*.f64 N/A

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

      7. associate-*l* N/A

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

      8. *-commutative N/A

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

      9. times-frac N/A

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

      10. lower-*.f64 N/A

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

      11. lower-/.f64 N/A

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

      12. associate-/l* N/A

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

      13. metadata-eval N/A

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

      14. *-commutative N/A

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

      15. lower-*.f64 52.2

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

   6. Applied rewrites 52.2%

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

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

   1. Initial program 91.8%

      \[\frac{x \cdot y - \left(z \cdot 9\right) \cdot t}{a \cdot 2} \]
   2. 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. mult-flip 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-flip N/A

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

      6. +-commutative N/A

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

      7. lift-*.f64 N/A

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

      8. *-commutative N/A

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

      9. lift-*.f64 N/A

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

      10. associate-*r* N/A

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

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

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

      12. lower-fma.f64 N/A

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

      13. lower-*.f64 N/A

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

      14. metadata-eval N/A

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

      15. lift-*.f64 N/A

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

      16. *-commutative N/A

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

      17. lower-*.f64 N/A

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

      18. lift-*.f64 N/A

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

      19. *-commutative N/A

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

      20. associate-/r* N/A

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

      21. lower-/.f64 N/A

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

      22. metadata-eval 91.8

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

   3. Applied rewrites 91.8%

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

      1. lift-fma.f64 N/A

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

      2. *-commutative N/A

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

      3. lift-*.f64 N/A

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

      4. associate-*l* N/A

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

      5. lift-*.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. *-commutative N/A

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

      8. fp-cancel-sign-sub-inv N/A

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

      9. *-commutative N/A

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

      10. fp-cancel-sub-sign-inv N/A

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

      11. *-commutative N/A

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

      12. lift-*.f64 N/A

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

      13. associate-*r* N/A

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

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

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

      15. distribute-lft-neg-out N/A

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

      16. lift-*.f64 N/A

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

      17. remove-double-neg N/A

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

      18. lower-fma.f64 N/A

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

      19. *-commutative N/A

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

      20. lower-*.f64 92.0

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

      21. lift-*.f64 N/A

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

      22. *-commutative N/A

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

      23. lower-*.f64 92.0

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

   5. Applied rewrites 92.0%

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

   7. Applied rewrites 92.1%

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

Alternative 7: 75.0% accurate, 0.5× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 3 regimes

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

   1. Initial program 91.8%

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

   2. Taylor expanded in x around 0

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

      1. lower-*.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. lower-*.f64 51.7

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

   4. Applied rewrites 51.7%

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

      1. lift-*.f64 N/A

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

      2. metadata-eval N/A

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

      3. lift-/.f64 N/A

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

      4. times-frac N/A

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

      5. *-commutative N/A

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

      6. lift-*.f64 N/A

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

      7. associate-*l* N/A

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

      8. *-commutative N/A

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

      9. times-frac N/A

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

      10. lower-*.f64 N/A

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

      11. lower-/.f64 N/A

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

      12. associate-/l* N/A

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

      13. metadata-eval N/A

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

      14. *-commutative N/A

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

      15. lower-*.f64 52.2

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

   6. Applied rewrites 52.2%

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

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

   1. Initial program 91.8%

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

   2. Taylor expanded in x around 0

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

      1. lower-*.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. lower-*.f64 51.7

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

   4. Applied rewrites 51.7%

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

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. associate-*r/ N/A

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

      4. *-commutative N/A

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

      5. metadata-eval N/A

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

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

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

      7. lower-/.f64 N/A

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

      8. distribute-rgt-neg-out N/A

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

      9. metadata-eval N/A

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

      10. *-commutative N/A

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

      11. lower-*.f64 51.7

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

      12. lift-*.f64 N/A

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

      13. *-commutative N/A

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

      14. lower-*.f64 51.7

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

   6. Applied rewrites 51.7%

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

   if -2.00000000000000008e-42 < (*.f64 (*.f64 z #s(literal 9 binary64)) t) < 5.00000000000000033e-64

   1. Initial program 91.8%

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

   2. Taylor expanded in x around inf

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

      1. lower-*.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. lower-*.f64 50.3

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

   4. Applied rewrites 50.3%

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

      1. lift-*.f64 N/A

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

      2. *-commutative N/A

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

      3. metadata-eval N/A

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

      4. mult-flip-rev N/A

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

      5. lift-/.f64 N/A

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

      6. associate-/r* N/A

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

      7. lower-/.f64 N/A

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

      8. lift-*.f64 N/A

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

      9. *-commutative N/A

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

      10. lower-*.f64 N/A

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

      11. *-commutative N/A

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

      12. count-2 N/A

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

      13. lift-+.f64 50.3

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

   6. Applied rewrites 50.3%

      \[\leadsto \frac{y \cdot x}{\color{blue}{a + a}} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 8: 75.0% accurate, 0.5× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 3 regimes

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

   1. Initial program 91.8%

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

   2. Taylor expanded in x around 0

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

      1. lower-*.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. lower-*.f64 51.7

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

   4. Applied rewrites 51.7%

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

      1. lift-*.f64 N/A

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

      2. metadata-eval N/A

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

      3. lift-/.f64 N/A

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

      4. times-frac N/A

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

      5. *-commutative N/A

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

      6. lift-*.f64 N/A

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

      7. associate-*l* N/A

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

      8. *-commutative N/A

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

      9. times-frac N/A

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

      10. lower-*.f64 N/A

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

      11. lower-/.f64 N/A

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

      12. associate-/l* N/A

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

      13. metadata-eval N/A

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

      14. *-commutative N/A

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

      15. lower-*.f64 52.2

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

   6. Applied rewrites 52.2%

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

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

   1. Initial program 91.8%

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

   2. Taylor expanded in x around 0

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

      1. lower-*.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. lower-*.f64 51.7

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

   4. Applied rewrites 51.7%

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

   if -2.00000000000000008e-42 < (*.f64 (*.f64 z #s(literal 9 binary64)) t) < 5.00000000000000033e-64

   1. Initial program 91.8%

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

   2. Taylor expanded in x around inf

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

      1. lower-*.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. lower-*.f64 50.3

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

   4. Applied rewrites 50.3%

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

      1. lift-*.f64 N/A

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

      2. *-commutative N/A

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

      3. metadata-eval N/A

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

      4. mult-flip-rev N/A

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

      5. lift-/.f64 N/A

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

      6. associate-/r* N/A

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

      7. lower-/.f64 N/A

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

      8. lift-*.f64 N/A

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

      9. *-commutative N/A

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

      10. lower-*.f64 N/A

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

      11. *-commutative N/A

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

      12. count-2 N/A

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

      13. lift-+.f64 50.3

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

   6. Applied rewrites 50.3%

      \[\leadsto \frac{y \cdot x}{\color{blue}{a + a}} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 9: 74.7% accurate, 0.5× speedup

Math

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

FPCore

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

C

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

Fortran

a\_m =     private
a\_s =     private
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(a_s, x, y, z, t, a_m)
use fmin_fmax_functions
    real(8), intent (in) :: a_s
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a_m
    real(8) :: t_1
    real(8) :: t_2
    real(8) :: tmp
    t_1 = ((z / a_m) * (-4.5d0)) * t
    t_2 = (z * 9.0d0) * t
    if (t_2 <= (-1d+291)) then
        tmp = t_1
    else if (t_2 <= (-2d-42)) then
        tmp = (-4.5d0) * ((t * z) / a_m)
    else if (t_2 <= 5d-64) then
        tmp = (y * x) / (a_m + a_m)
    else
        tmp = t_1
    end if
    code = a_s * tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (*.f64 (*.f64 z #s(literal 9 binary64)) t) < -9.9999999999999996e290 or 5.00000000000000033e-64 < (*.f64 (*.f64 z #s(literal 9 binary64)) t)

   1. Initial program 91.8%

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

   2. Taylor expanded in x around 0

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

      1. lower-*.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. lower-*.f64 51.7

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

   4. Applied rewrites 51.7%

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

      1. lift-*.f64 N/A

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

      2. *-commutative N/A

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

      3. lift-/.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. associate-/l* N/A

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

      6. associate-*l* N/A

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

      7. *-commutative N/A

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

      8. lower-*.f64 N/A

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

      9. lower-*.f64 N/A

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

      10. lower-/.f64 51.6

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

   6. Applied rewrites 51.6%

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

   if -9.9999999999999996e290 < (*.f64 (*.f64 z #s(literal 9 binary64)) t) < -2.00000000000000008e-42

   1. Initial program 91.8%

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

   2. Taylor expanded in x around 0

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

      1. lower-*.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. lower-*.f64 51.7

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

   4. Applied rewrites 51.7%

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

   if -2.00000000000000008e-42 < (*.f64 (*.f64 z #s(literal 9 binary64)) t) < 5.00000000000000033e-64

   1. Initial program 91.8%

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

   2. Taylor expanded in x around inf

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

      1. lower-*.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. lower-*.f64 50.3

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

   4. Applied rewrites 50.3%

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

      1. lift-*.f64 N/A

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

      2. *-commutative N/A

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

      3. metadata-eval N/A

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

      4. mult-flip-rev N/A

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

      5. lift-/.f64 N/A

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

      6. associate-/r* N/A

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

      7. lower-/.f64 N/A

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

      8. lift-*.f64 N/A

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

      9. *-commutative N/A

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

      10. lower-*.f64 N/A

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

      11. *-commutative N/A

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

      12. count-2 N/A

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

      13. lift-+.f64 50.3

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

   6. Applied rewrites 50.3%

      \[\leadsto \frac{y \cdot x}{\color{blue}{a + a}} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 10: 74.6% accurate, 0.8× speedup

Math

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

FPCore

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

C

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

Fortran

a\_m =     private
a\_s =     private
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(a_s, x, y, z, t, a_m)
use fmin_fmax_functions
    real(8), intent (in) :: a_s
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a_m
    real(8) :: tmp
    if ((x * y) <= (-4d+64)) then
        tmp = (x / (a_m + a_m)) * y
    else if ((x * y) <= 1.0d0) then
        tmp = (-4.5d0) * ((t * z) / a_m)
    else
        tmp = (y / (a_m + a_m)) * x
    end if
    code = a_s * tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (*.f64 x y) < -4.00000000000000009e64

   1. Initial program 91.8%

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

   2. Taylor expanded in x around inf

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

      1. lower-*.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. lower-*.f64 50.3

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

   4. Applied rewrites 50.3%

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

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. associate-*r/ N/A

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

      4. associate-*l/ N/A

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

      5. lift-/.f64 N/A

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

      6. lift-/.f64 N/A

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

      7. mult-flip N/A

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

      8. metadata-eval N/A

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

      9. associate-*l/ N/A

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

      10. mult-flip N/A

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

      11. associate-/r* N/A

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

      12. lift-*.f64 N/A

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

      13. associate-*r* N/A

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

      14. lower-*.f64 N/A

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

      15. *-commutative N/A

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

      16. mult-flip N/A

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

      17. lower-/.f64 N/A

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

      18. *-commutative N/A

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

      19. count-2 N/A

          \[\leadsto \frac{x}{a + a} \cdot y \]

      20. lift-+.f64 51.3

          \[\leadsto \frac{x}{a + a} \cdot y \]

   6. Applied rewrites 51.3%

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

   if -4.00000000000000009e64 < (*.f64 x y) < 1

   1. Initial program 91.8%

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

   2. Taylor expanded in x around 0

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

      1. lower-*.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. lower-*.f64 51.7

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

   4. Applied rewrites 51.7%

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

   if 1 < (*.f64 x y)

   1. Initial program 91.8%

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

   2. Taylor expanded in x around inf

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

      1. lower-*.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. lower-*.f64 50.3

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

   4. Applied rewrites 50.3%

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

      1. lift-*.f64 N/A

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

      2. *-commutative N/A

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

      3. metadata-eval N/A

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

      4. mult-flip-rev N/A

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

      5. lift-/.f64 N/A

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

      6. associate-/r* N/A

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

      7. lift-*.f64 N/A

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

      8. *-commutative N/A

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

      9. *-commutative N/A

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

      10. count-2 N/A

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

      11. lift-+.f64 N/A

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

      12. associate-*l/ N/A

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

      13. lift-/.f64 N/A

          \[\leadsto \frac{y}{a + a} \cdot x \]

      14. lower-*.f64 50.8

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

   6. Applied rewrites 50.8%

      \[\leadsto \color{blue}{\frac{y}{a + a} \cdot x} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 11: 51.3% accurate, 1.9× speedup

Math

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

FPCore

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

C

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

Fortran

a\_m =     private
a\_s =     private
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(a_s, x, y, z, t, a_m)
use fmin_fmax_functions
    real(8), intent (in) :: a_s
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a_m
    code = a_s * ((y / (a_m + a_m)) * x)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 91.8%

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

2. Taylor expanded in x around inf

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

   1. lower-*.f64 N/A

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

   2. lower-/.f64 N/A

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

   3. lower-*.f64 50.3

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

4. Applied rewrites 50.3%

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

   1. lift-*.f64 N/A

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

   2. *-commutative N/A

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

   3. metadata-eval N/A

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

   4. mult-flip-rev N/A

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

   5. lift-/.f64 N/A

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

   6. associate-/r* N/A

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

   7. lift-*.f64 N/A

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

   8. *-commutative N/A

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

   9. *-commutative N/A

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

   10. count-2 N/A

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

   11. lift-+.f64 N/A

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

   12. associate-*l/ N/A

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

   13. lift-/.f64 N/A

       \[\leadsto \frac{y}{a + a} \cdot x \]

   14. lower-*.f64 50.8

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

6. Applied rewrites 50.8%

   \[\leadsto \color{blue}{\frac{y}{a + a} \cdot x} \]
7. Add Preprocessing

Alternative 12: 50.8% accurate, 1.9× speedup

Math

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

FPCore

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

C

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

Fortran

a\_m =     private
a\_s =     private
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(a_s, x, y, z, t, a_m)
use fmin_fmax_functions
    real(8), intent (in) :: a_s
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a_m
    code = a_s * ((x / (a_m + a_m)) * y)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 91.8%

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

2. Taylor expanded in x around inf

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

   1. lower-*.f64 N/A

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

   2. lower-/.f64 N/A

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

   3. lower-*.f64 50.3

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

4. Applied rewrites 50.3%

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

   1. lift-*.f64 N/A

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

   2. lift-/.f64 N/A

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

   3. associate-*r/ N/A

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

   4. associate-*l/ N/A

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

   5. lift-/.f64 N/A

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

   6. lift-/.f64 N/A

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

   7. mult-flip N/A

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

   8. metadata-eval N/A

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

   9. associate-*l/ N/A

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

   10. mult-flip N/A

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

   11. associate-/r* N/A

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

   12. lift-*.f64 N/A

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

   13. associate-*r* N/A

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

   14. lower-*.f64 N/A

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

   15. *-commutative N/A

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

   16. mult-flip N/A

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

   17. lower-/.f64 N/A

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

   18. *-commutative N/A

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

   19. count-2 N/A

       \[\leadsto \frac{x}{a + a} \cdot y \]

   20. lift-+.f64 51.3

       \[\leadsto \frac{x}{a + a} \cdot y \]

6. Applied rewrites 51.3%

   \[\leadsto \frac{x}{a + a} \cdot \color{blue}{y} \]
7. Add Preprocessing

Reproduce

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