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

Percentage Accurate: 79.7% → 88.6%

Time: 12.8s

Alternatives: 16

Speedup: 0.9×

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

Specification

Math

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

FPCore

(FPCore (x y z t a b c)
 :precision binary64
 (/ (+ (- (* (* x 9.0) y) (* (* (* z 4.0) t) a)) b) (* z c)))

C

double code(double x, double y, double z, double t, double a, double b, double c) {
	return ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c);
}

Fortran

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

Java

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

Python

def code(x, y, z, t, a, b, c):
	return ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c)

Julia

function code(x, y, z, t, a, b, c)
	return Float64(Float64(Float64(Float64(Float64(x * 9.0) * y) - Float64(Float64(Float64(z * 4.0) * t) * a)) + b) / Float64(z * c))
end

MATLAB

function tmp = code(x, y, z, t, a, b, c)
	tmp = ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c);
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_] := N[(N[(N[(N[(N[(x * 9.0), $MachinePrecision] * y), $MachinePrecision] - N[(N[(N[(z * 4.0), $MachinePrecision] * t), $MachinePrecision] * a), $MachinePrecision]), $MachinePrecision] + b), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]

Initial Program: 79.7% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y z t a b c)
 :precision binary64
 (/ (+ (- (* (* x 9.0) y) (* (* (* z 4.0) t) a)) b) (* z c)))

C

double code(double x, double y, double z, double t, double a, double b, double c) {
	return ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c);
}

Fortran

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

Java

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

Python

def code(x, y, z, t, a, b, c):
	return ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c)

Julia

function code(x, y, z, t, a, b, c)
	return Float64(Float64(Float64(Float64(Float64(x * 9.0) * y) - Float64(Float64(Float64(z * 4.0) * t) * a)) + b) / Float64(z * c))
end

MATLAB

function tmp = code(x, y, z, t, a, b, c)
	tmp = ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c);
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_] := N[(N[(N[(N[(N[(x * 9.0), $MachinePrecision] * y), $MachinePrecision] - N[(N[(N[(z * 4.0), $MachinePrecision] * t), $MachinePrecision] * a), $MachinePrecision]), $MachinePrecision] + b), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]

Alternative 1: 88.6% accurate, 0.7× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\ [x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\ \\ \begin{array}{l} \mathbf{if}\;z \leq -1.55 \cdot 10^{+37}:\\ \;\;\;\;\mathsf{fma}\left(\frac{x}{c \cdot z} \cdot 9, y, \mathsf{fma}\left(-4, \frac{a \cdot t}{c}, \frac{b}{c \cdot z}\right)\right)\\ \mathbf{elif}\;z \leq 2.35 \cdot 10^{+150}:\\ \;\;\;\;\frac{-1}{-z} \cdot \frac{\mathsf{fma}\left(\left(-4 \cdot z\right) \cdot a, t, \mathsf{fma}\left(x \cdot y, 9, b\right)\right)}{c}\\ \mathbf{else}:\\ \;\;\;\;\frac{\mathsf{fma}\left(\frac{x}{z} \cdot y, 9, \left(t \cdot a\right) \cdot -4\right)}{c}\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
 :precision binary64
 (if (<= z -1.55e+37)
   (fma (* (/ x (* c z)) 9.0) y (fma -4.0 (/ (* a t) c) (/ b (* c z))))
   (if (<= z 2.35e+150)
     (* (/ -1.0 (- z)) (/ (fma (* (* -4.0 z) a) t (fma (* x y) 9.0 b)) c))
     (/ (fma (* (/ x z) y) 9.0 (* (* t a) -4.0)) c))))

C

assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
	double tmp;
	if (z <= -1.55e+37) {
		tmp = fma(((x / (c * z)) * 9.0), y, fma(-4.0, ((a * t) / c), (b / (c * z))));
	} else if (z <= 2.35e+150) {
		tmp = (-1.0 / -z) * (fma(((-4.0 * z) * a), t, fma((x * y), 9.0, b)) / c);
	} else {
		tmp = fma(((x / z) * y), 9.0, ((t * a) * -4.0)) / c;
	}
	return tmp;
}

Julia

x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c])
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c])
function code(x, y, z, t, a, b, c)
	tmp = 0.0
	if (z <= -1.55e+37)
		tmp = fma(Float64(Float64(x / Float64(c * z)) * 9.0), y, fma(-4.0, Float64(Float64(a * t) / c), Float64(b / Float64(c * z))));
	elseif (z <= 2.35e+150)
		tmp = Float64(Float64(-1.0 / Float64(-z)) * Float64(fma(Float64(Float64(-4.0 * z) * a), t, fma(Float64(x * y), 9.0, b)) / c));
	else
		tmp = Float64(fma(Float64(Float64(x / z) * y), 9.0, Float64(Float64(t * a) * -4.0)) / c);
	end
	return tmp
end

Wolfram

NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_] := If[LessEqual[z, -1.55e+37], N[(N[(N[(x / N[(c * z), $MachinePrecision]), $MachinePrecision] * 9.0), $MachinePrecision] * y + N[(-4.0 * N[(N[(a * t), $MachinePrecision] / c), $MachinePrecision] + N[(b / N[(c * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 2.35e+150], N[(N[(-1.0 / (-z)), $MachinePrecision] * N[(N[(N[(N[(-4.0 * z), $MachinePrecision] * a), $MachinePrecision] * t + N[(N[(x * y), $MachinePrecision] * 9.0 + b), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(x / z), $MachinePrecision] * y), $MachinePrecision] * 9.0 + N[(N[(t * a), $MachinePrecision] * -4.0), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if z < -1.5500000000000001e37

   1. Initial program 69.2%

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

   3. Taylor expanded in x around 0

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

      1. associate--l+ N/A

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

      2. associate-*r/ N/A

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

      3. associate-*r* N/A

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

      4. associate-*l/ N/A

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

      5. associate-*r/ N/A

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

      6. lower-fma.f64 N/A

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

      7. *-commutative N/A

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

      8. lower-*.f64 N/A

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

      9. lower-/.f64 N/A

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

      10. lower-*.f64 N/A

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

      11. cancel-sign-sub-inv N/A

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

      12. metadata-eval N/A

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

      13. +-commutative N/A

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

      14. lower-fma.f64 N/A

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

      15. lower-/.f64 N/A

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

      16. lower-*.f64 N/A

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

      17. lower-/.f64 N/A

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

      18. lower-*.f64 87.6

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

   5. Applied rewrites 87.6%

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

   if -1.5500000000000001e37 < z < 2.35000000000000002e150

   1. Initial program 90.3%

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

      1. lift-/.f64 N/A

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

      2. frac-2neg N/A

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

      3. neg-mul-1 N/A

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

      4. lift-*.f64 N/A

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

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

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

      6. times-frac N/A

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

      7. lower-*.f64 N/A

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

      8. lower-/.f64 N/A

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

      9. lower-/.f64 N/A

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

   4. Applied rewrites 93.5%

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

   if 2.35000000000000002e150 < z

   1. Initial program 44.1%

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

   3. Taylor expanded in b around 0

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

      1. associate-/l/ N/A

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

      2. lower-/.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. cancel-sign-sub-inv N/A

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

      5. metadata-eval N/A

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

      6. +-commutative N/A

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

      7. lower-fma.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. lower-*.f64 N/A

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

      11. *-commutative N/A

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

      12. lower-*.f64 N/A

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

      13. *-commutative N/A

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

      14. lower-*.f64 48.5

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

   5. Applied rewrites 48.5%

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

   6. Taylor expanded in x around 0

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

   8. Applied rewrites 71.7%

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

   10. Applied rewrites 84.4%

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

4. Final simplification 91.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -1.55 \cdot 10^{+37}:\\ \;\;\;\;\mathsf{fma}\left(\frac{x}{c \cdot z} \cdot 9, y, \mathsf{fma}\left(-4, \frac{a \cdot t}{c}, \frac{b}{c \cdot z}\right)\right)\\ \mathbf{elif}\;z \leq 2.35 \cdot 10^{+150}:\\ \;\;\;\;\frac{-1}{-z} \cdot \frac{\mathsf{fma}\left(\left(-4 \cdot z\right) \cdot a, t, \mathsf{fma}\left(x \cdot y, 9, b\right)\right)}{c}\\ \mathbf{else}:\\ \;\;\;\;\frac{\mathsf{fma}\left(\frac{x}{z} \cdot y, 9, \left(t \cdot a\right) \cdot -4\right)}{c}\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 86.8% accurate, 0.3× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\ [x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\ \\ \begin{array}{l} \mathbf{if}\;z \leq -1.55 \cdot 10^{+132} \lor \neg \left(z \leq 1.2 \cdot 10^{+79}\right):\\ \;\;\;\;\frac{\mathsf{fma}\left(\frac{x}{z} \cdot y, 9, \left(t \cdot a\right) \cdot -4\right)}{c}\\ \mathbf{else}:\\ \;\;\;\;{\left(\frac{c \cdot z}{\mathsf{fma}\left(\left(-4 \cdot z\right) \cdot a, t, \mathsf{fma}\left(x \cdot y, 9, b\right)\right)}\right)}^{-1}\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
 :precision binary64
 (if (or (<= z -1.55e+132) (not (<= z 1.2e+79)))
   (/ (fma (* (/ x z) y) 9.0 (* (* t a) -4.0)) c)
   (pow (/ (* c z) (fma (* (* -4.0 z) a) t (fma (* x y) 9.0 b))) -1.0)))

C

assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
	double tmp;
	if ((z <= -1.55e+132) || !(z <= 1.2e+79)) {
		tmp = fma(((x / z) * y), 9.0, ((t * a) * -4.0)) / c;
	} else {
		tmp = pow(((c * z) / fma(((-4.0 * z) * a), t, fma((x * y), 9.0, b))), -1.0);
	}
	return tmp;
}

Julia

x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c])
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c])
function code(x, y, z, t, a, b, c)
	tmp = 0.0
	if ((z <= -1.55e+132) || !(z <= 1.2e+79))
		tmp = Float64(fma(Float64(Float64(x / z) * y), 9.0, Float64(Float64(t * a) * -4.0)) / c);
	else
		tmp = Float64(Float64(c * z) / fma(Float64(Float64(-4.0 * z) * a), t, fma(Float64(x * y), 9.0, b))) ^ -1.0;
	end
	return tmp
end

Wolfram

NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_] := If[Or[LessEqual[z, -1.55e+132], N[Not[LessEqual[z, 1.2e+79]], $MachinePrecision]], N[(N[(N[(N[(x / z), $MachinePrecision] * y), $MachinePrecision] * 9.0 + N[(N[(t * a), $MachinePrecision] * -4.0), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], N[Power[N[(N[(c * z), $MachinePrecision] / N[(N[(N[(-4.0 * z), $MachinePrecision] * a), $MachinePrecision] * t + N[(N[(x * y), $MachinePrecision] * 9.0 + b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -1.0], $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -1.5499999999999999e132 or 1.19999999999999993e79 < z

   1. Initial program 54.2%

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

   3. Taylor expanded in b around 0

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

      1. associate-/l/ N/A

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

      2. lower-/.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. cancel-sign-sub-inv N/A

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

      5. metadata-eval N/A

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

      6. +-commutative N/A

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

      7. lower-fma.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. lower-*.f64 N/A

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

      11. *-commutative N/A

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

      12. lower-*.f64 N/A

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

      13. *-commutative N/A

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

      14. lower-*.f64 51.7

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

   5. Applied rewrites 51.7%

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

   6. Taylor expanded in x around 0

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

   8. Applied rewrites 71.1%

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

   10. Applied rewrites 81.6%

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

   if -1.5499999999999999e132 < z < 1.19999999999999993e79

   1. Initial program 90.4%

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

      1. lift-/.f64 N/A

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

      2. clear-num N/A

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

      3. lower-/.f64 N/A

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

      4. lower-/.f64 90.3

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

      5. lift-*.f64 N/A

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

      6. *-commutative N/A

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

      7. lower-*.f64 90.3

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

      8. lift-+.f64 N/A

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

      9. lift--.f64 N/A

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

      10. sub-neg N/A

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

      11. +-commutative N/A

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

      12. associate-+l+ N/A

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

      13. lift-*.f64 N/A

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

      14. lift-*.f64 N/A

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

      15. associate-*l* N/A

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

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

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

      17. *-commutative N/A

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

      18. associate-*r* N/A

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

   4. Applied rewrites 93.1%

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

4. Final simplification 89.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -1.55 \cdot 10^{+132} \lor \neg \left(z \leq 1.2 \cdot 10^{+79}\right):\\ \;\;\;\;\frac{\mathsf{fma}\left(\frac{x}{z} \cdot y, 9, \left(t \cdot a\right) \cdot -4\right)}{c}\\ \mathbf{else}:\\ \;\;\;\;{\left(\frac{c \cdot z}{\mathsf{fma}\left(\left(-4 \cdot z\right) \cdot a, t, \mathsf{fma}\left(x \cdot y, 9, b\right)\right)}\right)}^{-1}\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 50.9% accurate, 0.3× speedup

Math

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

FPCore

NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
 :precision binary64
 (let* ((t_1 (* (* x 9.0) y)))
   (if (or (<= t_1 -1e-29) (not (<= t_1 1e+38)))
     (/ (* (* x y) 9.0) (* z c))
     (pow (* (/ c b) z) -1.0))))

C

assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
	double t_1 = (x * 9.0) * y;
	double tmp;
	if ((t_1 <= -1e-29) || !(t_1 <= 1e+38)) {
		tmp = ((x * y) * 9.0) / (z * c);
	} else {
		tmp = pow(((c / b) * z), -1.0);
	}
	return tmp;
}

Fortran

NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8) :: t_1
    real(8) :: tmp
    t_1 = (x * 9.0d0) * y
    if ((t_1 <= (-1d-29)) .or. (.not. (t_1 <= 1d+38))) then
        tmp = ((x * y) * 9.0d0) / (z * c)
    else
        tmp = ((c / b) * z) ** (-1.0d0)
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t && t < a && a < b && b < c;
assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
	double t_1 = (x * 9.0) * y;
	double tmp;
	if ((t_1 <= -1e-29) || !(t_1 <= 1e+38)) {
		tmp = ((x * y) * 9.0) / (z * c);
	} else {
		tmp = Math.pow(((c / b) * z), -1.0);
	}
	return tmp;
}

Python

[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c])
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c])
def code(x, y, z, t, a, b, c):
	t_1 = (x * 9.0) * y
	tmp = 0
	if (t_1 <= -1e-29) or not (t_1 <= 1e+38):
		tmp = ((x * y) * 9.0) / (z * c)
	else:
		tmp = math.pow(((c / b) * z), -1.0)
	return tmp

Julia

x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c])
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c])
function code(x, y, z, t, a, b, c)
	t_1 = Float64(Float64(x * 9.0) * y)
	tmp = 0.0
	if ((t_1 <= -1e-29) || !(t_1 <= 1e+38))
		tmp = Float64(Float64(Float64(x * y) * 9.0) / Float64(z * c));
	else
		tmp = Float64(Float64(c / b) * z) ^ -1.0;
	end
	return tmp
end

MATLAB

x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
	t_1 = (x * 9.0) * y;
	tmp = 0.0;
	if ((t_1 <= -1e-29) || ~((t_1 <= 1e+38)))
		tmp = ((x * y) * 9.0) / (z * c);
	else
		tmp = ((c / b) * z) ^ -1.0;
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(N[(x * 9.0), $MachinePrecision] * y), $MachinePrecision]}, If[Or[LessEqual[t$95$1, -1e-29], N[Not[LessEqual[t$95$1, 1e+38]], $MachinePrecision]], N[(N[(N[(x * y), $MachinePrecision] * 9.0), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision], N[Power[N[(N[(c / b), $MachinePrecision] * z), $MachinePrecision], -1.0], $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -9.99999999999999943e-30 or 9.99999999999999977e37 < (*.f64 (*.f64 x #s(literal 9 binary64)) y)

   1. Initial program 75.4%

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

      1. lift-+.f64 N/A

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

      2. lift--.f64 N/A

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

      3. associate-+l- N/A

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

      4. sub-neg N/A

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

      5. lift-*.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. associate-*l* N/A

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

      8. *-commutative N/A

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

      9. lower-fma.f64 N/A

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

      10. *-commutative N/A

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

      11. lower-*.f64 N/A

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

      12. neg-sub0 N/A

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

      13. associate-+l- N/A

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

      14. neg-sub0 N/A

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

   4. Applied rewrites 76.9%

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

   5. Taylor expanded in x around inf

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

      1. *-commutative N/A

         \[\leadsto \frac{\color{blue}{\left(x \cdot y\right) \cdot 9}}{z \cdot c} \]

      2. lower-*.f64 N/A

         \[\leadsto \frac{\color{blue}{\left(x \cdot y\right) \cdot 9}}{z \cdot c} \]

      3. lower-*.f64 66.0

         \[\leadsto \frac{\color{blue}{\left(x \cdot y\right)} \cdot 9}{z \cdot c} \]

   7. Applied rewrites 66.0%

      \[\leadsto \frac{\color{blue}{\left(x \cdot y\right) \cdot 9}}{z \cdot c} \]

   if -9.99999999999999943e-30 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 9.99999999999999977e37

   1. Initial program 82.5%

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

   3. Taylor expanded in b around inf

      \[\leadsto \color{blue}{\frac{b}{c \cdot z}} \]
   4. Step-by-step derivation

      1. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{b}{c \cdot z}} \]

      2. lower-*.f64 49.3

         \[\leadsto \frac{b}{\color{blue}{c \cdot z}} \]

   5. Applied rewrites 49.3%

      \[\leadsto \color{blue}{\frac{b}{c \cdot z}} \]
   6. Step-by-step derivation

   7. Applied rewrites 52.3%

      \[\leadsto \frac{1}{\color{blue}{\frac{z}{\frac{b}{c}}}} \]
   8. Step-by-step derivation

   9. Applied rewrites 53.1%

      \[\leadsto \frac{1}{\frac{c}{b} \cdot \color{blue}{z}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 59.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\left(x \cdot 9\right) \cdot y \leq -1 \cdot 10^{-29} \lor \neg \left(\left(x \cdot 9\right) \cdot y \leq 10^{+38}\right):\\ \;\;\;\;\frac{\left(x \cdot y\right) \cdot 9}{z \cdot c}\\ \mathbf{else}:\\ \;\;\;\;{\left(\frac{c}{b} \cdot z\right)}^{-1}\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 74.7% accurate, 0.6× speedup

Math

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

FPCore

NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
 :precision binary64
 (let* ((t_1 (* (* x 9.0) y)))
   (if (<= t_1 (- INFINITY))
     (* (* 9.0 (/ x c)) (/ y z))
     (if (or (<= t_1 -4e-138) (not (<= t_1 2e-21)))
       (/ (fma (* 9.0 y) x b) (* c z))
       (/ (fma (* -4.0 t) a (/ b z)) c)))))

C

assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
	double t_1 = (x * 9.0) * y;
	double tmp;
	if (t_1 <= -((double) INFINITY)) {
		tmp = (9.0 * (x / c)) * (y / z);
	} else if ((t_1 <= -4e-138) || !(t_1 <= 2e-21)) {
		tmp = fma((9.0 * y), x, b) / (c * z);
	} else {
		tmp = fma((-4.0 * t), a, (b / z)) / c;
	}
	return tmp;
}

Julia

x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c])
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c])
function code(x, y, z, t, a, b, c)
	t_1 = Float64(Float64(x * 9.0) * y)
	tmp = 0.0
	if (t_1 <= Float64(-Inf))
		tmp = Float64(Float64(9.0 * Float64(x / c)) * Float64(y / z));
	elseif ((t_1 <= -4e-138) || !(t_1 <= 2e-21))
		tmp = Float64(fma(Float64(9.0 * y), x, b) / Float64(c * z));
	else
		tmp = Float64(fma(Float64(-4.0 * t), a, Float64(b / z)) / c);
	end
	return tmp
end

Wolfram

NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(N[(x * 9.0), $MachinePrecision] * y), $MachinePrecision]}, If[LessEqual[t$95$1, (-Infinity)], N[(N[(9.0 * N[(x / c), $MachinePrecision]), $MachinePrecision] * N[(y / z), $MachinePrecision]), $MachinePrecision], If[Or[LessEqual[t$95$1, -4e-138], N[Not[LessEqual[t$95$1, 2e-21]], $MachinePrecision]], N[(N[(N[(9.0 * y), $MachinePrecision] * x + b), $MachinePrecision] / N[(c * z), $MachinePrecision]), $MachinePrecision], N[(N[(N[(-4.0 * t), $MachinePrecision] * a + N[(b / z), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

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

   1. Initial program 59.9%

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

      1. lift-+.f64 N/A

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

      2. lift--.f64 N/A

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

      3. associate-+l- N/A

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

      4. sub-neg N/A

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

      5. lift-*.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. associate-*l* N/A

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

      8. *-commutative N/A

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

      9. lower-fma.f64 N/A

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

      10. *-commutative N/A

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

      11. lower-*.f64 N/A

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

      12. neg-sub0 N/A

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

      13. associate-+l- N/A

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

      14. neg-sub0 N/A

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

   4. Applied rewrites 65.8%

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

   5. Taylor expanded in x around inf

      \[\leadsto \color{blue}{9 \cdot \frac{x \cdot y}{c \cdot z}} \]
   6. Step-by-step derivation

      1. times-frac N/A

         \[\leadsto 9 \cdot \color{blue}{\left(\frac{x}{c} \cdot \frac{y}{z}\right)} \]

      2. associate-*r* N/A

         \[\leadsto \color{blue}{\left(9 \cdot \frac{x}{c}\right) \cdot \frac{y}{z}} \]

      3. lower-*.f64 N/A

         \[\leadsto \color{blue}{\left(9 \cdot \frac{x}{c}\right) \cdot \frac{y}{z}} \]

      4. lower-*.f64 N/A

         \[\leadsto \color{blue}{\left(9 \cdot \frac{x}{c}\right)} \cdot \frac{y}{z} \]

      5. lower-/.f64 N/A

         \[\leadsto \left(9 \cdot \color{blue}{\frac{x}{c}}\right) \cdot \frac{y}{z} \]

      6. lower-/.f64 88.6

         \[\leadsto \left(9 \cdot \frac{x}{c}\right) \cdot \color{blue}{\frac{y}{z}} \]

   7. Applied rewrites 88.6%

      \[\leadsto \color{blue}{\left(9 \cdot \frac{x}{c}\right) \cdot \frac{y}{z}} \]

   if -inf.0 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -4.00000000000000027e-138 or 1.99999999999999982e-21 < (*.f64 (*.f64 x #s(literal 9 binary64)) y)

   1. Initial program 81.0%

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

   3. Taylor expanded in z around 0

      \[\leadsto \color{blue}{\frac{b + 9 \cdot \left(x \cdot y\right)}{c \cdot z}} \]
   4. Step-by-step derivation

      1. associate-/r* N/A

         \[\leadsto \color{blue}{\frac{\frac{b + 9 \cdot \left(x \cdot y\right)}{c}}{z}} \]

      2. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{\frac{b + 9 \cdot \left(x \cdot y\right)}{c}}{z}} \]

      3. lower-/.f64 N/A

         \[\leadsto \frac{\color{blue}{\frac{b + 9 \cdot \left(x \cdot y\right)}{c}}}{z} \]

      4. +-commutative N/A

         \[\leadsto \frac{\frac{\color{blue}{9 \cdot \left(x \cdot y\right) + b}}{c}}{z} \]

      5. *-commutative N/A

         \[\leadsto \frac{\frac{\color{blue}{\left(x \cdot y\right) \cdot 9} + b}{c}}{z} \]

      6. lower-fma.f64 N/A

         \[\leadsto \frac{\frac{\color{blue}{\mathsf{fma}\left(x \cdot y, 9, b\right)}}{c}}{z} \]

      7. *-commutative N/A

         \[\leadsto \frac{\frac{\mathsf{fma}\left(\color{blue}{y \cdot x}, 9, b\right)}{c}}{z} \]

      8. lower-*.f64 72.6

         \[\leadsto \frac{\frac{\mathsf{fma}\left(\color{blue}{y \cdot x}, 9, b\right)}{c}}{z} \]

   5. Applied rewrites 72.6%

      \[\leadsto \color{blue}{\frac{\frac{\mathsf{fma}\left(y \cdot x, 9, b\right)}{c}}{z}} \]
   6. Step-by-step derivation

   7. Applied rewrites 75.7%

      \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(9 \cdot y, x, b\right)}{c \cdot z}} \]

   if -4.00000000000000027e-138 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 1.99999999999999982e-21

   1. Initial program 80.0%

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

      1. lift-/.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. lift--.f64 N/A

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

      4. associate-+l- N/A

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

      5. div-sub N/A

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

      6. sub-neg N/A

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

      7. lift-*.f64 N/A

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

      8. lift-*.f64 N/A

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

      9. *-commutative N/A

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

      10. times-frac N/A

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

      11. lower-fma.f64 N/A

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

      12. lower-/.f64 N/A

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

      13. lift-*.f64 N/A

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

      14. *-commutative N/A

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

      15. lower-*.f64 N/A

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

      16. lower-/.f64 N/A

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

      17. lower-neg.f64 N/A

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

   4. Applied rewrites 75.9%

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

   5. Taylor expanded in x around 0

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

      1. associate-/l/ N/A

         \[\leadsto \color{blue}{\frac{\frac{b}{z}}{c}} - 4 \cdot \frac{a \cdot t}{c} \]

      2. associate-*r/ N/A

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

      3. div-sub N/A

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

      4. lower-/.f64 N/A

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

      5. cancel-sign-sub-inv N/A

         \[\leadsto \frac{\color{blue}{\frac{b}{z} + \left(\mathsf{neg}\left(4\right)\right) \cdot \left(a \cdot t\right)}}{c} \]

      6. metadata-eval N/A

         \[\leadsto \frac{\frac{b}{z} + \color{blue}{-4} \cdot \left(a \cdot t\right)}{c} \]

      7. +-commutative N/A

         \[\leadsto \frac{\color{blue}{-4 \cdot \left(a \cdot t\right) + \frac{b}{z}}}{c} \]

      8. *-commutative N/A

         \[\leadsto \frac{-4 \cdot \color{blue}{\left(t \cdot a\right)} + \frac{b}{z}}{c} \]

      9. associate-*r* N/A

         \[\leadsto \frac{\color{blue}{\left(-4 \cdot t\right) \cdot a} + \frac{b}{z}}{c} \]

      10. lower-fma.f64 N/A

          \[\leadsto \frac{\color{blue}{\mathsf{fma}\left(-4 \cdot t, a, \frac{b}{z}\right)}}{c} \]

      11. lower-*.f64 N/A

          \[\leadsto \frac{\mathsf{fma}\left(\color{blue}{-4 \cdot t}, a, \frac{b}{z}\right)}{c} \]

      12. lower-/.f64 81.6

          \[\leadsto \frac{\mathsf{fma}\left(-4 \cdot t, a, \color{blue}{\frac{b}{z}}\right)}{c} \]

   7. Applied rewrites 81.6%

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

4. Final simplification 79.0%

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

Alternative 5: 71.1% accurate, 0.6× speedup

Math

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

FPCore

NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
 :precision binary64
 (let* ((t_1 (* (* x 9.0) y)))
   (if (<= t_1 (- INFINITY))
     (* (* 9.0 (/ x c)) (/ y z))
     (if (or (<= t_1 -4e-138) (not (<= t_1 2e-21)))
       (/ (fma (* 9.0 y) x b) (* c z))
       (/ (fma -4.0 (* (* t z) a) b) (* z c))))))

C

assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
	double t_1 = (x * 9.0) * y;
	double tmp;
	if (t_1 <= -((double) INFINITY)) {
		tmp = (9.0 * (x / c)) * (y / z);
	} else if ((t_1 <= -4e-138) || !(t_1 <= 2e-21)) {
		tmp = fma((9.0 * y), x, b) / (c * z);
	} else {
		tmp = fma(-4.0, ((t * z) * a), b) / (z * c);
	}
	return tmp;
}

Julia

x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c])
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c])
function code(x, y, z, t, a, b, c)
	t_1 = Float64(Float64(x * 9.0) * y)
	tmp = 0.0
	if (t_1 <= Float64(-Inf))
		tmp = Float64(Float64(9.0 * Float64(x / c)) * Float64(y / z));
	elseif ((t_1 <= -4e-138) || !(t_1 <= 2e-21))
		tmp = Float64(fma(Float64(9.0 * y), x, b) / Float64(c * z));
	else
		tmp = Float64(fma(-4.0, Float64(Float64(t * z) * a), b) / Float64(z * c));
	end
	return tmp
end

Wolfram

NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(N[(x * 9.0), $MachinePrecision] * y), $MachinePrecision]}, If[LessEqual[t$95$1, (-Infinity)], N[(N[(9.0 * N[(x / c), $MachinePrecision]), $MachinePrecision] * N[(y / z), $MachinePrecision]), $MachinePrecision], If[Or[LessEqual[t$95$1, -4e-138], N[Not[LessEqual[t$95$1, 2e-21]], $MachinePrecision]], N[(N[(N[(9.0 * y), $MachinePrecision] * x + b), $MachinePrecision] / N[(c * z), $MachinePrecision]), $MachinePrecision], N[(N[(-4.0 * N[(N[(t * z), $MachinePrecision] * a), $MachinePrecision] + b), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

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

   1. Initial program 59.9%

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

      1. lift-+.f64 N/A

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

      2. lift--.f64 N/A

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

      3. associate-+l- N/A

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

      4. sub-neg N/A

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

      5. lift-*.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. associate-*l* N/A

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

      8. *-commutative N/A

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

      9. lower-fma.f64 N/A

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

      10. *-commutative N/A

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

      11. lower-*.f64 N/A

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

      12. neg-sub0 N/A

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

      13. associate-+l- N/A

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

      14. neg-sub0 N/A

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

   4. Applied rewrites 65.8%

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

   5. Taylor expanded in x around inf

      \[\leadsto \color{blue}{9 \cdot \frac{x \cdot y}{c \cdot z}} \]
   6. Step-by-step derivation

      1. times-frac N/A

         \[\leadsto 9 \cdot \color{blue}{\left(\frac{x}{c} \cdot \frac{y}{z}\right)} \]

      2. associate-*r* N/A

         \[\leadsto \color{blue}{\left(9 \cdot \frac{x}{c}\right) \cdot \frac{y}{z}} \]

      3. lower-*.f64 N/A

         \[\leadsto \color{blue}{\left(9 \cdot \frac{x}{c}\right) \cdot \frac{y}{z}} \]

      4. lower-*.f64 N/A

         \[\leadsto \color{blue}{\left(9 \cdot \frac{x}{c}\right)} \cdot \frac{y}{z} \]

      5. lower-/.f64 N/A

         \[\leadsto \left(9 \cdot \color{blue}{\frac{x}{c}}\right) \cdot \frac{y}{z} \]

      6. lower-/.f64 88.6

         \[\leadsto \left(9 \cdot \frac{x}{c}\right) \cdot \color{blue}{\frac{y}{z}} \]

   7. Applied rewrites 88.6%

      \[\leadsto \color{blue}{\left(9 \cdot \frac{x}{c}\right) \cdot \frac{y}{z}} \]

   if -inf.0 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -4.00000000000000027e-138 or 1.99999999999999982e-21 < (*.f64 (*.f64 x #s(literal 9 binary64)) y)

   1. Initial program 81.0%

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

   3. Taylor expanded in z around 0

      \[\leadsto \color{blue}{\frac{b + 9 \cdot \left(x \cdot y\right)}{c \cdot z}} \]
   4. Step-by-step derivation

      1. associate-/r* N/A

         \[\leadsto \color{blue}{\frac{\frac{b + 9 \cdot \left(x \cdot y\right)}{c}}{z}} \]

      2. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{\frac{b + 9 \cdot \left(x \cdot y\right)}{c}}{z}} \]

      3. lower-/.f64 N/A

         \[\leadsto \frac{\color{blue}{\frac{b + 9 \cdot \left(x \cdot y\right)}{c}}}{z} \]

      4. +-commutative N/A

         \[\leadsto \frac{\frac{\color{blue}{9 \cdot \left(x \cdot y\right) + b}}{c}}{z} \]

      5. *-commutative N/A

         \[\leadsto \frac{\frac{\color{blue}{\left(x \cdot y\right) \cdot 9} + b}{c}}{z} \]

      6. lower-fma.f64 N/A

         \[\leadsto \frac{\frac{\color{blue}{\mathsf{fma}\left(x \cdot y, 9, b\right)}}{c}}{z} \]

      7. *-commutative N/A

         \[\leadsto \frac{\frac{\mathsf{fma}\left(\color{blue}{y \cdot x}, 9, b\right)}{c}}{z} \]

      8. lower-*.f64 72.6

         \[\leadsto \frac{\frac{\mathsf{fma}\left(\color{blue}{y \cdot x}, 9, b\right)}{c}}{z} \]

   5. Applied rewrites 72.6%

      \[\leadsto \color{blue}{\frac{\frac{\mathsf{fma}\left(y \cdot x, 9, b\right)}{c}}{z}} \]
   6. Step-by-step derivation

   7. Applied rewrites 75.7%

      \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(9 \cdot y, x, b\right)}{c \cdot z}} \]

   if -4.00000000000000027e-138 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 1.99999999999999982e-21

   1. Initial program 80.0%

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

   3. Taylor expanded in x around 0

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

      1. cancel-sign-sub-inv N/A

         \[\leadsto \frac{\color{blue}{b + \left(\mathsf{neg}\left(4\right)\right) \cdot \left(a \cdot \left(t \cdot z\right)\right)}}{z \cdot c} \]

      2. metadata-eval N/A

         \[\leadsto \frac{b + \color{blue}{-4} \cdot \left(a \cdot \left(t \cdot z\right)\right)}{z \cdot c} \]

      3. +-commutative N/A

         \[\leadsto \frac{\color{blue}{-4 \cdot \left(a \cdot \left(t \cdot z\right)\right) + b}}{z \cdot c} \]

      4. lower-fma.f64 N/A

         \[\leadsto \frac{\color{blue}{\mathsf{fma}\left(-4, a \cdot \left(t \cdot z\right), b\right)}}{z \cdot c} \]

      5. *-commutative N/A

         \[\leadsto \frac{\mathsf{fma}\left(-4, \color{blue}{\left(t \cdot z\right) \cdot a}, b\right)}{z \cdot c} \]

      6. lower-*.f64 N/A

         \[\leadsto \frac{\mathsf{fma}\left(-4, \color{blue}{\left(t \cdot z\right) \cdot a}, b\right)}{z \cdot c} \]

      7. lower-*.f64 77.2

         \[\leadsto \frac{\mathsf{fma}\left(-4, \color{blue}{\left(t \cdot z\right)} \cdot a, b\right)}{z \cdot c} \]

   5. Applied rewrites 77.2%

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

4. Final simplification 77.2%

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

Alternative 6: 71.5% accurate, 0.6× speedup

Math

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

FPCore

NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
 :precision binary64
 (let* ((t_1 (* (* x 9.0) y)))
   (if (<= t_1 (- INFINITY))
     (* (* 9.0 (/ x c)) (/ y z))
     (if (or (<= t_1 -4e-138) (not (<= t_1 2e-21)))
       (/ (fma (* 9.0 y) x b) (* c z))
       (/ (fma (* (* -4.0 z) a) t b) (* c z))))))

C

assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
	double t_1 = (x * 9.0) * y;
	double tmp;
	if (t_1 <= -((double) INFINITY)) {
		tmp = (9.0 * (x / c)) * (y / z);
	} else if ((t_1 <= -4e-138) || !(t_1 <= 2e-21)) {
		tmp = fma((9.0 * y), x, b) / (c * z);
	} else {
		tmp = fma(((-4.0 * z) * a), t, b) / (c * z);
	}
	return tmp;
}

Julia

x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c])
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c])
function code(x, y, z, t, a, b, c)
	t_1 = Float64(Float64(x * 9.0) * y)
	tmp = 0.0
	if (t_1 <= Float64(-Inf))
		tmp = Float64(Float64(9.0 * Float64(x / c)) * Float64(y / z));
	elseif ((t_1 <= -4e-138) || !(t_1 <= 2e-21))
		tmp = Float64(fma(Float64(9.0 * y), x, b) / Float64(c * z));
	else
		tmp = Float64(fma(Float64(Float64(-4.0 * z) * a), t, b) / Float64(c * z));
	end
	return tmp
end

Wolfram

NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(N[(x * 9.0), $MachinePrecision] * y), $MachinePrecision]}, If[LessEqual[t$95$1, (-Infinity)], N[(N[(9.0 * N[(x / c), $MachinePrecision]), $MachinePrecision] * N[(y / z), $MachinePrecision]), $MachinePrecision], If[Or[LessEqual[t$95$1, -4e-138], N[Not[LessEqual[t$95$1, 2e-21]], $MachinePrecision]], N[(N[(N[(9.0 * y), $MachinePrecision] * x + b), $MachinePrecision] / N[(c * z), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(-4.0 * z), $MachinePrecision] * a), $MachinePrecision] * t + b), $MachinePrecision] / N[(c * z), $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

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

   1. Initial program 59.9%

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

      1. lift-+.f64 N/A

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

      2. lift--.f64 N/A

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

      3. associate-+l- N/A

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

      4. sub-neg N/A

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

      5. lift-*.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. associate-*l* N/A

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

      8. *-commutative N/A

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

      9. lower-fma.f64 N/A

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

      10. *-commutative N/A

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

      11. lower-*.f64 N/A

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

      12. neg-sub0 N/A

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

      13. associate-+l- N/A

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

      14. neg-sub0 N/A

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

   4. Applied rewrites 65.8%

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

   5. Taylor expanded in x around inf

      \[\leadsto \color{blue}{9 \cdot \frac{x \cdot y}{c \cdot z}} \]
   6. Step-by-step derivation

      1. times-frac N/A

         \[\leadsto 9 \cdot \color{blue}{\left(\frac{x}{c} \cdot \frac{y}{z}\right)} \]

      2. associate-*r* N/A

         \[\leadsto \color{blue}{\left(9 \cdot \frac{x}{c}\right) \cdot \frac{y}{z}} \]

      3. lower-*.f64 N/A

         \[\leadsto \color{blue}{\left(9 \cdot \frac{x}{c}\right) \cdot \frac{y}{z}} \]

      4. lower-*.f64 N/A

         \[\leadsto \color{blue}{\left(9 \cdot \frac{x}{c}\right)} \cdot \frac{y}{z} \]

      5. lower-/.f64 N/A

         \[\leadsto \left(9 \cdot \color{blue}{\frac{x}{c}}\right) \cdot \frac{y}{z} \]

      6. lower-/.f64 88.6

         \[\leadsto \left(9 \cdot \frac{x}{c}\right) \cdot \color{blue}{\frac{y}{z}} \]

   7. Applied rewrites 88.6%

      \[\leadsto \color{blue}{\left(9 \cdot \frac{x}{c}\right) \cdot \frac{y}{z}} \]

   if -inf.0 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -4.00000000000000027e-138 or 1.99999999999999982e-21 < (*.f64 (*.f64 x #s(literal 9 binary64)) y)

   1. Initial program 81.0%

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

   3. Taylor expanded in z around 0

      \[\leadsto \color{blue}{\frac{b + 9 \cdot \left(x \cdot y\right)}{c \cdot z}} \]
   4. Step-by-step derivation

      1. associate-/r* N/A

         \[\leadsto \color{blue}{\frac{\frac{b + 9 \cdot \left(x \cdot y\right)}{c}}{z}} \]

      2. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{\frac{b + 9 \cdot \left(x \cdot y\right)}{c}}{z}} \]

      3. lower-/.f64 N/A

         \[\leadsto \frac{\color{blue}{\frac{b + 9 \cdot \left(x \cdot y\right)}{c}}}{z} \]

      4. +-commutative N/A

         \[\leadsto \frac{\frac{\color{blue}{9 \cdot \left(x \cdot y\right) + b}}{c}}{z} \]

      5. *-commutative N/A

         \[\leadsto \frac{\frac{\color{blue}{\left(x \cdot y\right) \cdot 9} + b}{c}}{z} \]

      6. lower-fma.f64 N/A

         \[\leadsto \frac{\frac{\color{blue}{\mathsf{fma}\left(x \cdot y, 9, b\right)}}{c}}{z} \]

      7. *-commutative N/A

         \[\leadsto \frac{\frac{\mathsf{fma}\left(\color{blue}{y \cdot x}, 9, b\right)}{c}}{z} \]

      8. lower-*.f64 72.6

         \[\leadsto \frac{\frac{\mathsf{fma}\left(\color{blue}{y \cdot x}, 9, b\right)}{c}}{z} \]

   5. Applied rewrites 72.6%

      \[\leadsto \color{blue}{\frac{\frac{\mathsf{fma}\left(y \cdot x, 9, b\right)}{c}}{z}} \]
   6. Step-by-step derivation

   7. Applied rewrites 75.7%

      \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(9 \cdot y, x, b\right)}{c \cdot z}} \]

   if -4.00000000000000027e-138 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 1.99999999999999982e-21

   1. Initial program 80.0%

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

   3. Taylor expanded in b around inf

      \[\leadsto \color{blue}{\frac{b}{c \cdot z}} \]
   4. Step-by-step derivation

      1. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{b}{c \cdot z}} \]

      2. lower-*.f64 46.7

         \[\leadsto \frac{b}{\color{blue}{c \cdot z}} \]

   5. Applied rewrites 46.7%

      \[\leadsto \color{blue}{\frac{b}{c \cdot z}} \]

   6. Taylor expanded in x around 0

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

      1. div-sub N/A

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

      2. associate-/r* N/A

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

      3. associate-/r* N/A

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

      4. associate-*r/ N/A

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

      5. div-sub N/A

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

      6. cancel-sign-sub-inv N/A

         \[\leadsto \frac{\color{blue}{\frac{b}{c} + \left(\mathsf{neg}\left(4\right)\right) \cdot \frac{a \cdot \left(t \cdot z\right)}{c}}}{z} \]

      7. metadata-eval N/A

         \[\leadsto \frac{\frac{b}{c} + \color{blue}{-4} \cdot \frac{a \cdot \left(t \cdot z\right)}{c}}{z} \]

      8. +-commutative N/A

         \[\leadsto \frac{\color{blue}{-4 \cdot \frac{a \cdot \left(t \cdot z\right)}{c} + \frac{b}{c}}}{z} \]

      9. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{-4 \cdot \frac{a \cdot \left(t \cdot z\right)}{c} + \frac{b}{c}}{z}} \]

   8. Applied rewrites 78.0%

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

   10. Applied rewrites 72.6%

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

4. Final simplification 75.3%

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

Alternative 7: 87.2% accurate, 0.7× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\ [x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\ \\ \begin{array}{l} \mathbf{if}\;z \leq -2.4 \cdot 10^{+128} \lor \neg \left(z \leq 2.35 \cdot 10^{+150}\right):\\ \;\;\;\;\frac{\mathsf{fma}\left(\frac{x}{z} \cdot y, 9, \left(t \cdot a\right) \cdot -4\right)}{c}\\ \mathbf{else}:\\ \;\;\;\;\frac{-1}{-z} \cdot \frac{\mathsf{fma}\left(\left(-4 \cdot z\right) \cdot a, t, \mathsf{fma}\left(x \cdot y, 9, b\right)\right)}{c}\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
 :precision binary64
 (if (or (<= z -2.4e+128) (not (<= z 2.35e+150)))
   (/ (fma (* (/ x z) y) 9.0 (* (* t a) -4.0)) c)
   (* (/ -1.0 (- z)) (/ (fma (* (* -4.0 z) a) t (fma (* x y) 9.0 b)) c))))

C

assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
	double tmp;
	if ((z <= -2.4e+128) || !(z <= 2.35e+150)) {
		tmp = fma(((x / z) * y), 9.0, ((t * a) * -4.0)) / c;
	} else {
		tmp = (-1.0 / -z) * (fma(((-4.0 * z) * a), t, fma((x * y), 9.0, b)) / c);
	}
	return tmp;
}

Julia

x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c])
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c])
function code(x, y, z, t, a, b, c)
	tmp = 0.0
	if ((z <= -2.4e+128) || !(z <= 2.35e+150))
		tmp = Float64(fma(Float64(Float64(x / z) * y), 9.0, Float64(Float64(t * a) * -4.0)) / c);
	else
		tmp = Float64(Float64(-1.0 / Float64(-z)) * Float64(fma(Float64(Float64(-4.0 * z) * a), t, fma(Float64(x * y), 9.0, b)) / c));
	end
	return tmp
end

Wolfram

NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_] := If[Or[LessEqual[z, -2.4e+128], N[Not[LessEqual[z, 2.35e+150]], $MachinePrecision]], N[(N[(N[(N[(x / z), $MachinePrecision] * y), $MachinePrecision] * 9.0 + N[(N[(t * a), $MachinePrecision] * -4.0), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], N[(N[(-1.0 / (-z)), $MachinePrecision] * N[(N[(N[(N[(-4.0 * z), $MachinePrecision] * a), $MachinePrecision] * t + N[(N[(x * y), $MachinePrecision] * 9.0 + b), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -2.4000000000000002e128 or 2.35000000000000002e150 < z

   1. Initial program 53.6%

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

   3. Taylor expanded in b around 0

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

      1. associate-/l/ N/A

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

      2. lower-/.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. cancel-sign-sub-inv N/A

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

      5. metadata-eval N/A

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

      6. +-commutative N/A

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

      7. lower-fma.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. lower-*.f64 N/A

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

      11. *-commutative N/A

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

      12. lower-*.f64 N/A

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

      13. *-commutative N/A

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

      14. lower-*.f64 54.9

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

   5. Applied rewrites 54.9%

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

   6. Taylor expanded in x around 0

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

   8. Applied rewrites 74.1%

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

   10. Applied rewrites 86.0%

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

   if -2.4000000000000002e128 < z < 2.35000000000000002e150

   1. Initial program 88.8%

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

      1. lift-/.f64 N/A

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

      2. frac-2neg N/A

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

      3. neg-mul-1 N/A

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

      4. lift-*.f64 N/A

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

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

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

      6. times-frac N/A

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

      7. lower-*.f64 N/A

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

      8. lower-/.f64 N/A

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

      9. lower-/.f64 N/A

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

   4. Applied rewrites 91.8%

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

4. Final simplification 90.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -2.4 \cdot 10^{+128} \lor \neg \left(z \leq 2.35 \cdot 10^{+150}\right):\\ \;\;\;\;\frac{\mathsf{fma}\left(\frac{x}{z} \cdot y, 9, \left(t \cdot a\right) \cdot -4\right)}{c}\\ \mathbf{else}:\\ \;\;\;\;\frac{-1}{-z} \cdot \frac{\mathsf{fma}\left(\left(-4 \cdot z\right) \cdot a, t, \mathsf{fma}\left(x \cdot y, 9, b\right)\right)}{c}\\ \end{array} \]
5. Add Preprocessing

Alternative 8: 86.9% accurate, 0.8× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\ [x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\ \\ \begin{array}{l} \mathbf{if}\;z \leq -3.1 \cdot 10^{+132} \lor \neg \left(z \leq 1.2 \cdot 10^{+79}\right):\\ \;\;\;\;\frac{\mathsf{fma}\left(\frac{x}{z} \cdot y, 9, \left(t \cdot a\right) \cdot -4\right)}{c}\\ \mathbf{else}:\\ \;\;\;\;\frac{-1}{c \cdot z} \cdot \left(-\mathsf{fma}\left(\left(-4 \cdot z\right) \cdot a, t, \mathsf{fma}\left(x \cdot y, 9, b\right)\right)\right)\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
 :precision binary64
 (if (or (<= z -3.1e+132) (not (<= z 1.2e+79)))
   (/ (fma (* (/ x z) y) 9.0 (* (* t a) -4.0)) c)
   (* (/ -1.0 (* c z)) (- (fma (* (* -4.0 z) a) t (fma (* x y) 9.0 b))))))

C

assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
	double tmp;
	if ((z <= -3.1e+132) || !(z <= 1.2e+79)) {
		tmp = fma(((x / z) * y), 9.0, ((t * a) * -4.0)) / c;
	} else {
		tmp = (-1.0 / (c * z)) * -fma(((-4.0 * z) * a), t, fma((x * y), 9.0, b));
	}
	return tmp;
}

Julia

x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c])
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c])
function code(x, y, z, t, a, b, c)
	tmp = 0.0
	if ((z <= -3.1e+132) || !(z <= 1.2e+79))
		tmp = Float64(fma(Float64(Float64(x / z) * y), 9.0, Float64(Float64(t * a) * -4.0)) / c);
	else
		tmp = Float64(Float64(-1.0 / Float64(c * z)) * Float64(-fma(Float64(Float64(-4.0 * z) * a), t, fma(Float64(x * y), 9.0, b))));
	end
	return tmp
end

Wolfram

NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_] := If[Or[LessEqual[z, -3.1e+132], N[Not[LessEqual[z, 1.2e+79]], $MachinePrecision]], N[(N[(N[(N[(x / z), $MachinePrecision] * y), $MachinePrecision] * 9.0 + N[(N[(t * a), $MachinePrecision] * -4.0), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], N[(N[(-1.0 / N[(c * z), $MachinePrecision]), $MachinePrecision] * (-N[(N[(N[(-4.0 * z), $MachinePrecision] * a), $MachinePrecision] * t + N[(N[(x * y), $MachinePrecision] * 9.0 + b), $MachinePrecision]), $MachinePrecision])), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -3.0999999999999998e132 or 1.19999999999999993e79 < z

   1. Initial program 54.2%

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

   3. Taylor expanded in b around 0

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

      1. associate-/l/ N/A

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

      2. lower-/.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. cancel-sign-sub-inv N/A

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

      5. metadata-eval N/A

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

      6. +-commutative N/A

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

      7. lower-fma.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. lower-*.f64 N/A

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

      11. *-commutative N/A

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

      12. lower-*.f64 N/A

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

      13. *-commutative N/A

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

      14. lower-*.f64 51.7

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

   5. Applied rewrites 51.7%

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

   6. Taylor expanded in x around 0

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

   8. Applied rewrites 71.1%

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

   10. Applied rewrites 81.6%

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

   if -3.0999999999999998e132 < z < 1.19999999999999993e79

   1. Initial program 90.4%

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

      1. lift-/.f64 N/A

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

      2. clear-num N/A

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

      3. frac-2neg N/A

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

      4. associate-/r/ N/A

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

      5. lower-*.f64 N/A

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

      6. neg-mul-1 N/A

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

      7. associate-/r* N/A

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

      8. metadata-eval N/A

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

      9. lower-/.f64 N/A

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

      10. lift-*.f64 N/A

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

      11. *-commutative N/A

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

      12. lower-*.f64 N/A

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

      13. lower-neg.f64 90.0

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

      14. lift-+.f64 N/A

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

      15. lift--.f64 N/A

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

      16. sub-neg N/A

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

      17. +-commutative N/A

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

   4. Applied rewrites 92.8%

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

4. Final simplification 89.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -3.1 \cdot 10^{+132} \lor \neg \left(z \leq 1.2 \cdot 10^{+79}\right):\\ \;\;\;\;\frac{\mathsf{fma}\left(\frac{x}{z} \cdot y, 9, \left(t \cdot a\right) \cdot -4\right)}{c}\\ \mathbf{else}:\\ \;\;\;\;\frac{-1}{c \cdot z} \cdot \left(-\mathsf{fma}\left(\left(-4 \cdot z\right) \cdot a, t, \mathsf{fma}\left(x \cdot y, 9, b\right)\right)\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 9: 76.4% accurate, 0.8× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\ [x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\ \\ \begin{array}{l} t_1 := \frac{\mathsf{fma}\left(\frac{x}{z} \cdot y, 9, \left(t \cdot a\right) \cdot -4\right)}{c}\\ \mathbf{if}\;z \leq -1500000:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;z \leq 7.5 \cdot 10^{-90}:\\ \;\;\;\;\frac{\frac{\mathsf{fma}\left(y \cdot x, 9, b\right)}{c}}{z}\\ \mathbf{elif}\;z \leq 1.5 \cdot 10^{+131}:\\ \;\;\;\;\frac{\mathsf{fma}\left(-4 \cdot t, a, \frac{b}{z}\right)}{c}\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
 :precision binary64
 (let* ((t_1 (/ (fma (* (/ x z) y) 9.0 (* (* t a) -4.0)) c)))
   (if (<= z -1500000.0)
     t_1
     (if (<= z 7.5e-90)
       (/ (/ (fma (* y x) 9.0 b) c) z)
       (if (<= z 1.5e+131) (/ (fma (* -4.0 t) a (/ b z)) c) t_1)))))

C

assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
	double t_1 = fma(((x / z) * y), 9.0, ((t * a) * -4.0)) / c;
	double tmp;
	if (z <= -1500000.0) {
		tmp = t_1;
	} else if (z <= 7.5e-90) {
		tmp = (fma((y * x), 9.0, b) / c) / z;
	} else if (z <= 1.5e+131) {
		tmp = fma((-4.0 * t), a, (b / z)) / c;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c])
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c])
function code(x, y, z, t, a, b, c)
	t_1 = Float64(fma(Float64(Float64(x / z) * y), 9.0, Float64(Float64(t * a) * -4.0)) / c)
	tmp = 0.0
	if (z <= -1500000.0)
		tmp = t_1;
	elseif (z <= 7.5e-90)
		tmp = Float64(Float64(fma(Float64(y * x), 9.0, b) / c) / z);
	elseif (z <= 1.5e+131)
		tmp = Float64(fma(Float64(-4.0 * t), a, Float64(b / z)) / c);
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(N[(N[(N[(x / z), $MachinePrecision] * y), $MachinePrecision] * 9.0 + N[(N[(t * a), $MachinePrecision] * -4.0), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision]}, If[LessEqual[z, -1500000.0], t$95$1, If[LessEqual[z, 7.5e-90], N[(N[(N[(N[(y * x), $MachinePrecision] * 9.0 + b), $MachinePrecision] / c), $MachinePrecision] / z), $MachinePrecision], If[LessEqual[z, 1.5e+131], N[(N[(N[(-4.0 * t), $MachinePrecision] * a + N[(b / z), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], t$95$1]]]]

Derivation

1. Split input into 3 regimes

2. if z < -1.5e6 or 1.5000000000000001e131 < z

   1. Initial program 62.5%

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

   3. Taylor expanded in b around 0

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

      1. associate-/l/ N/A

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

      2. lower-/.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. cancel-sign-sub-inv N/A

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

      5. metadata-eval N/A

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

      6. +-commutative N/A

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

      7. lower-fma.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. lower-*.f64 N/A

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

      11. *-commutative N/A

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

      12. lower-*.f64 N/A

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

      13. *-commutative N/A

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

      14. lower-*.f64 59.6

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

   5. Applied rewrites 59.6%

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

   6. Taylor expanded in x around 0

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

   8. Applied rewrites 73.7%

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

   10. Applied rewrites 81.5%

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

   if -1.5e6 < z < 7.4999999999999999e-90

   1. Initial program 93.6%

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

   3. Taylor expanded in z around 0

      \[\leadsto \color{blue}{\frac{b + 9 \cdot \left(x \cdot y\right)}{c \cdot z}} \]
   4. Step-by-step derivation

      1. associate-/r* N/A

         \[\leadsto \color{blue}{\frac{\frac{b + 9 \cdot \left(x \cdot y\right)}{c}}{z}} \]

      2. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{\frac{b + 9 \cdot \left(x \cdot y\right)}{c}}{z}} \]

      3. lower-/.f64 N/A

         \[\leadsto \frac{\color{blue}{\frac{b + 9 \cdot \left(x \cdot y\right)}{c}}}{z} \]

      4. +-commutative N/A

         \[\leadsto \frac{\frac{\color{blue}{9 \cdot \left(x \cdot y\right) + b}}{c}}{z} \]

      5. *-commutative N/A

         \[\leadsto \frac{\frac{\color{blue}{\left(x \cdot y\right) \cdot 9} + b}{c}}{z} \]

      6. lower-fma.f64 N/A

         \[\leadsto \frac{\frac{\color{blue}{\mathsf{fma}\left(x \cdot y, 9, b\right)}}{c}}{z} \]

      7. *-commutative N/A

         \[\leadsto \frac{\frac{\mathsf{fma}\left(\color{blue}{y \cdot x}, 9, b\right)}{c}}{z} \]

      8. lower-*.f64 87.9

         \[\leadsto \frac{\frac{\mathsf{fma}\left(\color{blue}{y \cdot x}, 9, b\right)}{c}}{z} \]

   5. Applied rewrites 87.9%

      \[\leadsto \color{blue}{\frac{\frac{\mathsf{fma}\left(y \cdot x, 9, b\right)}{c}}{z}} \]

   if 7.4999999999999999e-90 < z < 1.5000000000000001e131

   1. Initial program 81.1%

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

      1. lift-/.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. lift--.f64 N/A

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

      4. associate-+l- N/A

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

      5. div-sub N/A

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

      6. sub-neg N/A

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

      7. lift-*.f64 N/A

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

      8. lift-*.f64 N/A

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

      9. *-commutative N/A

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

      10. times-frac N/A

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

      11. lower-fma.f64 N/A

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

      12. lower-/.f64 N/A

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

      13. lift-*.f64 N/A

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

      14. *-commutative N/A

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

      15. lower-*.f64 N/A

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

      16. lower-/.f64 N/A

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

      17. lower-neg.f64 N/A

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

   4. Applied rewrites 80.6%

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

   5. Taylor expanded in x around 0

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

      1. associate-/l/ N/A

         \[\leadsto \color{blue}{\frac{\frac{b}{z}}{c}} - 4 \cdot \frac{a \cdot t}{c} \]

      2. associate-*r/ N/A

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

      3. div-sub N/A

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

      4. lower-/.f64 N/A

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

      5. cancel-sign-sub-inv N/A

         \[\leadsto \frac{\color{blue}{\frac{b}{z} + \left(\mathsf{neg}\left(4\right)\right) \cdot \left(a \cdot t\right)}}{c} \]

      6. metadata-eval N/A

         \[\leadsto \frac{\frac{b}{z} + \color{blue}{-4} \cdot \left(a \cdot t\right)}{c} \]

      7. +-commutative N/A

         \[\leadsto \frac{\color{blue}{-4 \cdot \left(a \cdot t\right) + \frac{b}{z}}}{c} \]

      8. *-commutative N/A

         \[\leadsto \frac{-4 \cdot \color{blue}{\left(t \cdot a\right)} + \frac{b}{z}}{c} \]

      9. associate-*r* N/A

         \[\leadsto \frac{\color{blue}{\left(-4 \cdot t\right) \cdot a} + \frac{b}{z}}{c} \]

      10. lower-fma.f64 N/A

          \[\leadsto \frac{\color{blue}{\mathsf{fma}\left(-4 \cdot t, a, \frac{b}{z}\right)}}{c} \]

      11. lower-*.f64 N/A

          \[\leadsto \frac{\mathsf{fma}\left(\color{blue}{-4 \cdot t}, a, \frac{b}{z}\right)}{c} \]

      12. lower-/.f64 73.8

          \[\leadsto \frac{\mathsf{fma}\left(-4 \cdot t, a, \color{blue}{\frac{b}{z}}\right)}{c} \]

   7. Applied rewrites 73.8%

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

4. Final simplification 83.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -1500000:\\ \;\;\;\;\frac{\mathsf{fma}\left(\frac{x}{z} \cdot y, 9, \left(t \cdot a\right) \cdot -4\right)}{c}\\ \mathbf{elif}\;z \leq 7.5 \cdot 10^{-90}:\\ \;\;\;\;\frac{\frac{\mathsf{fma}\left(y \cdot x, 9, b\right)}{c}}{z}\\ \mathbf{elif}\;z \leq 1.5 \cdot 10^{+131}:\\ \;\;\;\;\frac{\mathsf{fma}\left(-4 \cdot t, a, \frac{b}{z}\right)}{c}\\ \mathbf{else}:\\ \;\;\;\;\frac{\mathsf{fma}\left(\frac{x}{z} \cdot y, 9, \left(t \cdot a\right) \cdot -4\right)}{c}\\ \end{array} \]
5. Add Preprocessing

Alternative 10: 51.0% accurate, 0.8× speedup

Math

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

FPCore

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

C

assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
	double t_1 = (x * 9.0) * y;
	double tmp;
	if ((t_1 <= -1e-29) || !(t_1 <= 1e+38)) {
		tmp = ((x * y) * 9.0) / (z * c);
	} else {
		tmp = (b / c) / z;
	}
	return tmp;
}

Fortran

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

Java

assert x < y && y < z && z < t && t < a && a < b && b < c;
assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
	double t_1 = (x * 9.0) * y;
	double tmp;
	if ((t_1 <= -1e-29) || !(t_1 <= 1e+38)) {
		tmp = ((x * y) * 9.0) / (z * c);
	} else {
		tmp = (b / c) / z;
	}
	return tmp;
}

Python

[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c])
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c])
def code(x, y, z, t, a, b, c):
	t_1 = (x * 9.0) * y
	tmp = 0
	if (t_1 <= -1e-29) or not (t_1 <= 1e+38):
		tmp = ((x * y) * 9.0) / (z * c)
	else:
		tmp = (b / c) / z
	return tmp

Julia

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

MATLAB

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

Wolfram

NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(N[(x * 9.0), $MachinePrecision] * y), $MachinePrecision]}, If[Or[LessEqual[t$95$1, -1e-29], N[Not[LessEqual[t$95$1, 1e+38]], $MachinePrecision]], N[(N[(N[(x * y), $MachinePrecision] * 9.0), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision], N[(N[(b / c), $MachinePrecision] / z), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -9.99999999999999943e-30 or 9.99999999999999977e37 < (*.f64 (*.f64 x #s(literal 9 binary64)) y)

   1. Initial program 75.4%

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

      1. lift-+.f64 N/A

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

      2. lift--.f64 N/A

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

      3. associate-+l- N/A

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

      4. sub-neg N/A

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

      5. lift-*.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. associate-*l* N/A

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

      8. *-commutative N/A

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

      9. lower-fma.f64 N/A

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

      10. *-commutative N/A

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

      11. lower-*.f64 N/A

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

      12. neg-sub0 N/A

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

      13. associate-+l- N/A

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

      14. neg-sub0 N/A

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

   4. Applied rewrites 76.9%

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

   5. Taylor expanded in x around inf

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

      1. *-commutative N/A

         \[\leadsto \frac{\color{blue}{\left(x \cdot y\right) \cdot 9}}{z \cdot c} \]

      2. lower-*.f64 N/A

         \[\leadsto \frac{\color{blue}{\left(x \cdot y\right) \cdot 9}}{z \cdot c} \]

      3. lower-*.f64 66.0

         \[\leadsto \frac{\color{blue}{\left(x \cdot y\right)} \cdot 9}{z \cdot c} \]

   7. Applied rewrites 66.0%

      \[\leadsto \frac{\color{blue}{\left(x \cdot y\right) \cdot 9}}{z \cdot c} \]

   if -9.99999999999999943e-30 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 9.99999999999999977e37

   1. Initial program 82.5%

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

   3. Taylor expanded in b around inf

      \[\leadsto \color{blue}{\frac{b}{c \cdot z}} \]
   4. Step-by-step derivation

      1. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{b}{c \cdot z}} \]

      2. lower-*.f64 49.3

         \[\leadsto \frac{b}{\color{blue}{c \cdot z}} \]

   5. Applied rewrites 49.3%

      \[\leadsto \color{blue}{\frac{b}{c \cdot z}} \]
   6. Step-by-step derivation

   7. Applied rewrites 52.3%

      \[\leadsto \frac{\frac{b}{c}}{\color{blue}{z}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 58.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\left(x \cdot 9\right) \cdot y \leq -1 \cdot 10^{-29} \lor \neg \left(\left(x \cdot 9\right) \cdot y \leq 10^{+38}\right):\\ \;\;\;\;\frac{\left(x \cdot y\right) \cdot 9}{z \cdot c}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{b}{c}}{z}\\ \end{array} \]
5. Add Preprocessing

Alternative 11: 86.8% accurate, 0.9× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\ [x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\ \\ \begin{array}{l} \mathbf{if}\;z \leq -1.55 \cdot 10^{+132} \lor \neg \left(z \leq 2.3 \cdot 10^{+70}\right):\\ \;\;\;\;\frac{\mathsf{fma}\left(\frac{x}{z} \cdot y, 9, \left(t \cdot a\right) \cdot -4\right)}{c}\\ \mathbf{else}:\\ \;\;\;\;\frac{\mathsf{fma}\left(y \cdot 9, x, \mathsf{fma}\left(\left(-4 \cdot z\right) \cdot a, t, b\right)\right)}{z \cdot c}\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
 :precision binary64
 (if (or (<= z -1.55e+132) (not (<= z 2.3e+70)))
   (/ (fma (* (/ x z) y) 9.0 (* (* t a) -4.0)) c)
   (/ (fma (* y 9.0) x (fma (* (* -4.0 z) a) t b)) (* z c))))

C

assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
	double tmp;
	if ((z <= -1.55e+132) || !(z <= 2.3e+70)) {
		tmp = fma(((x / z) * y), 9.0, ((t * a) * -4.0)) / c;
	} else {
		tmp = fma((y * 9.0), x, fma(((-4.0 * z) * a), t, b)) / (z * c);
	}
	return tmp;
}

Julia

x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c])
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c])
function code(x, y, z, t, a, b, c)
	tmp = 0.0
	if ((z <= -1.55e+132) || !(z <= 2.3e+70))
		tmp = Float64(fma(Float64(Float64(x / z) * y), 9.0, Float64(Float64(t * a) * -4.0)) / c);
	else
		tmp = Float64(fma(Float64(y * 9.0), x, fma(Float64(Float64(-4.0 * z) * a), t, b)) / Float64(z * c));
	end
	return tmp
end

Wolfram

NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_] := If[Or[LessEqual[z, -1.55e+132], N[Not[LessEqual[z, 2.3e+70]], $MachinePrecision]], N[(N[(N[(N[(x / z), $MachinePrecision] * y), $MachinePrecision] * 9.0 + N[(N[(t * a), $MachinePrecision] * -4.0), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], N[(N[(N[(y * 9.0), $MachinePrecision] * x + N[(N[(N[(-4.0 * z), $MachinePrecision] * a), $MachinePrecision] * t + b), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -1.5499999999999999e132 or 2.29999999999999994e70 < z

   1. Initial program 54.1%

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

   3. Taylor expanded in b around 0

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

      1. associate-/l/ N/A

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

      2. lower-/.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. cancel-sign-sub-inv N/A

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

      5. metadata-eval N/A

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

      6. +-commutative N/A

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

      7. lower-fma.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. lower-*.f64 N/A

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

      11. *-commutative N/A

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

      12. lower-*.f64 N/A

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

      13. *-commutative N/A

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

      14. lower-*.f64 50.5

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

   5. Applied rewrites 50.5%

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

   6. Taylor expanded in x around 0

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

   8. Applied rewrites 69.4%

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

   10. Applied rewrites 80.9%

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

   if -1.5499999999999999e132 < z < 2.29999999999999994e70

   1. Initial program 90.8%

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

      1. lift-+.f64 N/A

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

      2. lift--.f64 N/A

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

      3. associate-+l- N/A

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

      4. sub-neg N/A

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

      5. lift-*.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. associate-*l* N/A

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

      8. *-commutative N/A

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

      9. lower-fma.f64 N/A

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

      10. *-commutative N/A

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

      11. lower-*.f64 N/A

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

      12. neg-sub0 N/A

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

      13. associate-+l- N/A

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

      14. neg-sub0 N/A

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

   4. Applied rewrites 91.9%

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

4. Final simplification 88.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -1.55 \cdot 10^{+132} \lor \neg \left(z \leq 2.3 \cdot 10^{+70}\right):\\ \;\;\;\;\frac{\mathsf{fma}\left(\frac{x}{z} \cdot y, 9, \left(t \cdot a\right) \cdot -4\right)}{c}\\ \mathbf{else}:\\ \;\;\;\;\frac{\mathsf{fma}\left(y \cdot 9, x, \mathsf{fma}\left(\left(-4 \cdot z\right) \cdot a, t, b\right)\right)}{z \cdot c}\\ \end{array} \]
5. Add Preprocessing

Alternative 12: 86.8% accurate, 0.9× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\ [x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\ \\ \begin{array}{l} \mathbf{if}\;z \leq -2.4 \cdot 10^{+128} \lor \neg \left(z \leq 2.3 \cdot 10^{+70}\right):\\ \;\;\;\;\frac{\mathsf{fma}\left(\frac{x}{z} \cdot y, 9, \left(t \cdot a\right) \cdot -4\right)}{c}\\ \mathbf{else}:\\ \;\;\;\;\frac{\mathsf{fma}\left(9 \cdot x, y, \mathsf{fma}\left(\left(-4 \cdot z\right) \cdot a, t, b\right)\right)}{z \cdot c}\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
 :precision binary64
 (if (or (<= z -2.4e+128) (not (<= z 2.3e+70)))
   (/ (fma (* (/ x z) y) 9.0 (* (* t a) -4.0)) c)
   (/ (fma (* 9.0 x) y (fma (* (* -4.0 z) a) t b)) (* z c))))

C

assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
	double tmp;
	if ((z <= -2.4e+128) || !(z <= 2.3e+70)) {
		tmp = fma(((x / z) * y), 9.0, ((t * a) * -4.0)) / c;
	} else {
		tmp = fma((9.0 * x), y, fma(((-4.0 * z) * a), t, b)) / (z * c);
	}
	return tmp;
}

Julia

x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c])
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c])
function code(x, y, z, t, a, b, c)
	tmp = 0.0
	if ((z <= -2.4e+128) || !(z <= 2.3e+70))
		tmp = Float64(fma(Float64(Float64(x / z) * y), 9.0, Float64(Float64(t * a) * -4.0)) / c);
	else
		tmp = Float64(fma(Float64(9.0 * x), y, fma(Float64(Float64(-4.0 * z) * a), t, b)) / Float64(z * c));
	end
	return tmp
end

Wolfram

NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_] := If[Or[LessEqual[z, -2.4e+128], N[Not[LessEqual[z, 2.3e+70]], $MachinePrecision]], N[(N[(N[(N[(x / z), $MachinePrecision] * y), $MachinePrecision] * 9.0 + N[(N[(t * a), $MachinePrecision] * -4.0), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], N[(N[(N[(9.0 * x), $MachinePrecision] * y + N[(N[(N[(-4.0 * z), $MachinePrecision] * a), $MachinePrecision] * t + b), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -2.4000000000000002e128 or 2.29999999999999994e70 < z

   1. Initial program 53.4%

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

   3. Taylor expanded in b around 0

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

      1. associate-/l/ N/A

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

      2. lower-/.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. cancel-sign-sub-inv N/A

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

      5. metadata-eval N/A

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

      6. +-commutative N/A

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

      7. lower-fma.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. lower-*.f64 N/A

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

      11. *-commutative N/A

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

      12. lower-*.f64 N/A

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

      13. *-commutative N/A

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

      14. lower-*.f64 49.9

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

   5. Applied rewrites 49.9%

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

   6. Taylor expanded in x around 0

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

   8. Applied rewrites 69.8%

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

   10. Applied rewrites 81.1%

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

   if -2.4000000000000002e128 < z < 2.29999999999999994e70

   1. Initial program 91.3%

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

      1. lift-+.f64 N/A

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

      2. lift--.f64 N/A

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

      3. associate-+l- N/A

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

      4. sub-neg N/A

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

      5. lift-*.f64 N/A

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

      6. lower-fma.f64 N/A

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

      7. lift-*.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. neg-sub0 N/A

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

      11. associate-+l- N/A

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

      12. neg-sub0 N/A

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

      13. lift-*.f64 N/A

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

      14. lift-*.f64 N/A

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

      15. associate-*l* N/A

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

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

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

      17. *-commutative N/A

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

      18. associate-*r* N/A

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

      19. lower-fma.f64 N/A

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

   4. Applied rewrites 91.9%

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

4. Final simplification 88.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -2.4 \cdot 10^{+128} \lor \neg \left(z \leq 2.3 \cdot 10^{+70}\right):\\ \;\;\;\;\frac{\mathsf{fma}\left(\frac{x}{z} \cdot y, 9, \left(t \cdot a\right) \cdot -4\right)}{c}\\ \mathbf{else}:\\ \;\;\;\;\frac{\mathsf{fma}\left(9 \cdot x, y, \mathsf{fma}\left(\left(-4 \cdot z\right) \cdot a, t, b\right)\right)}{z \cdot c}\\ \end{array} \]
5. Add Preprocessing

Alternative 13: 75.9% accurate, 1.0× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\ [x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\ \\ \begin{array}{l} \mathbf{if}\;z \leq -1.15 \cdot 10^{+33} \lor \neg \left(z \leq 7.5 \cdot 10^{-90}\right):\\ \;\;\;\;\frac{\mathsf{fma}\left(-4 \cdot t, a, \frac{b}{z}\right)}{c}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{\mathsf{fma}\left(y \cdot x, 9, b\right)}{c}}{z}\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
 :precision binary64
 (if (or (<= z -1.15e+33) (not (<= z 7.5e-90)))
   (/ (fma (* -4.0 t) a (/ b z)) c)
   (/ (/ (fma (* y x) 9.0 b) c) z)))

C

assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
	double tmp;
	if ((z <= -1.15e+33) || !(z <= 7.5e-90)) {
		tmp = fma((-4.0 * t), a, (b / z)) / c;
	} else {
		tmp = (fma((y * x), 9.0, b) / c) / z;
	}
	return tmp;
}

Julia

x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c])
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c])
function code(x, y, z, t, a, b, c)
	tmp = 0.0
	if ((z <= -1.15e+33) || !(z <= 7.5e-90))
		tmp = Float64(fma(Float64(-4.0 * t), a, Float64(b / z)) / c);
	else
		tmp = Float64(Float64(fma(Float64(y * x), 9.0, b) / c) / z);
	end
	return tmp
end

Wolfram

NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_] := If[Or[LessEqual[z, -1.15e+33], N[Not[LessEqual[z, 7.5e-90]], $MachinePrecision]], N[(N[(N[(-4.0 * t), $MachinePrecision] * a + N[(b / z), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], N[(N[(N[(N[(y * x), $MachinePrecision] * 9.0 + b), $MachinePrecision] / c), $MachinePrecision] / z), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -1.15000000000000005e33 or 7.4999999999999999e-90 < z

   1. Initial program 66.6%

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

      1. lift-/.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. lift--.f64 N/A

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

      4. associate-+l- N/A

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

      5. div-sub N/A

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

      6. sub-neg N/A

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

      7. lift-*.f64 N/A

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

      8. lift-*.f64 N/A

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

      9. *-commutative N/A

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

      10. times-frac N/A

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

      11. lower-fma.f64 N/A

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

      12. lower-/.f64 N/A

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

      13. lift-*.f64 N/A

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

      14. *-commutative N/A

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

      15. lower-*.f64 N/A

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

      16. lower-/.f64 N/A

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

      17. lower-neg.f64 N/A

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

   4. Applied rewrites 69.7%

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

   5. Taylor expanded in x around 0

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

      1. associate-/l/ N/A

         \[\leadsto \color{blue}{\frac{\frac{b}{z}}{c}} - 4 \cdot \frac{a \cdot t}{c} \]

      2. associate-*r/ N/A

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

      3. div-sub N/A

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

      4. lower-/.f64 N/A

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

      5. cancel-sign-sub-inv N/A

         \[\leadsto \frac{\color{blue}{\frac{b}{z} + \left(\mathsf{neg}\left(4\right)\right) \cdot \left(a \cdot t\right)}}{c} \]

      6. metadata-eval N/A

         \[\leadsto \frac{\frac{b}{z} + \color{blue}{-4} \cdot \left(a \cdot t\right)}{c} \]

      7. +-commutative N/A

         \[\leadsto \frac{\color{blue}{-4 \cdot \left(a \cdot t\right) + \frac{b}{z}}}{c} \]

      8. *-commutative N/A

         \[\leadsto \frac{-4 \cdot \color{blue}{\left(t \cdot a\right)} + \frac{b}{z}}{c} \]

      9. associate-*r* N/A

         \[\leadsto \frac{\color{blue}{\left(-4 \cdot t\right) \cdot a} + \frac{b}{z}}{c} \]

      10. lower-fma.f64 N/A

          \[\leadsto \frac{\color{blue}{\mathsf{fma}\left(-4 \cdot t, a, \frac{b}{z}\right)}}{c} \]

      11. lower-*.f64 N/A

          \[\leadsto \frac{\mathsf{fma}\left(\color{blue}{-4 \cdot t}, a, \frac{b}{z}\right)}{c} \]

      12. lower-/.f64 69.3

          \[\leadsto \frac{\mathsf{fma}\left(-4 \cdot t, a, \color{blue}{\frac{b}{z}}\right)}{c} \]

   7. Applied rewrites 69.3%

      \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(-4 \cdot t, a, \frac{b}{z}\right)}{c}} \]

   if -1.15000000000000005e33 < z < 7.4999999999999999e-90

   1. Initial program 93.2%

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

   3. Taylor expanded in z around 0

      \[\leadsto \color{blue}{\frac{b + 9 \cdot \left(x \cdot y\right)}{c \cdot z}} \]
   4. Step-by-step derivation

      1. associate-/r* N/A

         \[\leadsto \color{blue}{\frac{\frac{b + 9 \cdot \left(x \cdot y\right)}{c}}{z}} \]

      2. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{\frac{b + 9 \cdot \left(x \cdot y\right)}{c}}{z}} \]

      3. lower-/.f64 N/A

         \[\leadsto \frac{\color{blue}{\frac{b + 9 \cdot \left(x \cdot y\right)}{c}}}{z} \]

      4. +-commutative N/A

         \[\leadsto \frac{\frac{\color{blue}{9 \cdot \left(x \cdot y\right) + b}}{c}}{z} \]

      5. *-commutative N/A

         \[\leadsto \frac{\frac{\color{blue}{\left(x \cdot y\right) \cdot 9} + b}{c}}{z} \]

      6. lower-fma.f64 N/A

         \[\leadsto \frac{\frac{\color{blue}{\mathsf{fma}\left(x \cdot y, 9, b\right)}}{c}}{z} \]

      7. *-commutative N/A

         \[\leadsto \frac{\frac{\mathsf{fma}\left(\color{blue}{y \cdot x}, 9, b\right)}{c}}{z} \]

      8. lower-*.f64 87.9

         \[\leadsto \frac{\frac{\mathsf{fma}\left(\color{blue}{y \cdot x}, 9, b\right)}{c}}{z} \]

   5. Applied rewrites 87.9%

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

4. Final simplification 78.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -1.15 \cdot 10^{+33} \lor \neg \left(z \leq 7.5 \cdot 10^{-90}\right):\\ \;\;\;\;\frac{\mathsf{fma}\left(-4 \cdot t, a, \frac{b}{z}\right)}{c}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{\mathsf{fma}\left(y \cdot x, 9, b\right)}{c}}{z}\\ \end{array} \]
5. Add Preprocessing

Alternative 14: 67.5% accurate, 1.2× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\ [x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\ \\ \begin{array}{l} \mathbf{if}\;z \leq -1.15 \cdot 10^{+200} \lor \neg \left(z \leq 1.4 \cdot 10^{+79}\right):\\ \;\;\;\;-4 \cdot \frac{a \cdot t}{c}\\ \mathbf{else}:\\ \;\;\;\;\frac{\mathsf{fma}\left(9 \cdot y, x, b\right)}{c \cdot z}\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
 :precision binary64
 (if (or (<= z -1.15e+200) (not (<= z 1.4e+79)))
   (* -4.0 (/ (* a t) c))
   (/ (fma (* 9.0 y) x b) (* c z))))

C

assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
	double tmp;
	if ((z <= -1.15e+200) || !(z <= 1.4e+79)) {
		tmp = -4.0 * ((a * t) / c);
	} else {
		tmp = fma((9.0 * y), x, b) / (c * z);
	}
	return tmp;
}

Julia

x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c])
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c])
function code(x, y, z, t, a, b, c)
	tmp = 0.0
	if ((z <= -1.15e+200) || !(z <= 1.4e+79))
		tmp = Float64(-4.0 * Float64(Float64(a * t) / c));
	else
		tmp = Float64(fma(Float64(9.0 * y), x, b) / Float64(c * z));
	end
	return tmp
end

Wolfram

NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_] := If[Or[LessEqual[z, -1.15e+200], N[Not[LessEqual[z, 1.4e+79]], $MachinePrecision]], N[(-4.0 * N[(N[(a * t), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision], N[(N[(N[(9.0 * y), $MachinePrecision] * x + b), $MachinePrecision] / N[(c * z), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -1.15000000000000002e200 or 1.4000000000000001e79 < z

   1. Initial program 51.8%

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

   3. Taylor expanded in z around inf

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

      1. lower-*.f64 N/A

         \[\leadsto \color{blue}{-4 \cdot \frac{a \cdot t}{c}} \]

      2. lower-/.f64 N/A

         \[\leadsto -4 \cdot \color{blue}{\frac{a \cdot t}{c}} \]

      3. lower-*.f64 58.4

         \[\leadsto -4 \cdot \frac{\color{blue}{a \cdot t}}{c} \]

   5. Applied rewrites 58.4%

      \[\leadsto \color{blue}{-4 \cdot \frac{a \cdot t}{c}} \]

   if -1.15000000000000002e200 < z < 1.4000000000000001e79

   1. Initial program 88.9%

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

   3. Taylor expanded in z around 0

      \[\leadsto \color{blue}{\frac{b + 9 \cdot \left(x \cdot y\right)}{c \cdot z}} \]
   4. Step-by-step derivation

      1. associate-/r* N/A

         \[\leadsto \color{blue}{\frac{\frac{b + 9 \cdot \left(x \cdot y\right)}{c}}{z}} \]

      2. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{\frac{b + 9 \cdot \left(x \cdot y\right)}{c}}{z}} \]

      3. lower-/.f64 N/A

         \[\leadsto \frac{\color{blue}{\frac{b + 9 \cdot \left(x \cdot y\right)}{c}}}{z} \]

      4. +-commutative N/A

         \[\leadsto \frac{\frac{\color{blue}{9 \cdot \left(x \cdot y\right) + b}}{c}}{z} \]

      5. *-commutative N/A

         \[\leadsto \frac{\frac{\color{blue}{\left(x \cdot y\right) \cdot 9} + b}{c}}{z} \]

      6. lower-fma.f64 N/A

         \[\leadsto \frac{\frac{\color{blue}{\mathsf{fma}\left(x \cdot y, 9, b\right)}}{c}}{z} \]

      7. *-commutative N/A

         \[\leadsto \frac{\frac{\mathsf{fma}\left(\color{blue}{y \cdot x}, 9, b\right)}{c}}{z} \]

      8. lower-*.f64 77.8

         \[\leadsto \frac{\frac{\mathsf{fma}\left(\color{blue}{y \cdot x}, 9, b\right)}{c}}{z} \]

   5. Applied rewrites 77.8%

      \[\leadsto \color{blue}{\frac{\frac{\mathsf{fma}\left(y \cdot x, 9, b\right)}{c}}{z}} \]
   6. Step-by-step derivation

   7. Applied rewrites 77.5%

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

4. Final simplification 72.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -1.15 \cdot 10^{+200} \lor \neg \left(z \leq 1.4 \cdot 10^{+79}\right):\\ \;\;\;\;-4 \cdot \frac{a \cdot t}{c}\\ \mathbf{else}:\\ \;\;\;\;\frac{\mathsf{fma}\left(9 \cdot y, x, b\right)}{c \cdot z}\\ \end{array} \]
5. Add Preprocessing

Alternative 15: 49.6% accurate, 1.4× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\ [x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\ \\ \begin{array}{l} \mathbf{if}\;z \leq -7 \cdot 10^{-110} \lor \neg \left(z \leq 4.2 \cdot 10^{+47}\right):\\ \;\;\;\;-4 \cdot \frac{a \cdot t}{c}\\ \mathbf{else}:\\ \;\;\;\;\frac{b}{c \cdot z}\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
 :precision binary64
 (if (or (<= z -7e-110) (not (<= z 4.2e+47)))
   (* -4.0 (/ (* a t) c))
   (/ b (* c z))))

C

assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
	double tmp;
	if ((z <= -7e-110) || !(z <= 4.2e+47)) {
		tmp = -4.0 * ((a * t) / c);
	} else {
		tmp = b / (c * z);
	}
	return tmp;
}

Fortran

NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8) :: tmp
    if ((z <= (-7d-110)) .or. (.not. (z <= 4.2d+47))) then
        tmp = (-4.0d0) * ((a * t) / c)
    else
        tmp = b / (c * z)
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t && t < a && a < b && b < c;
assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
	double tmp;
	if ((z <= -7e-110) || !(z <= 4.2e+47)) {
		tmp = -4.0 * ((a * t) / c);
	} else {
		tmp = b / (c * z);
	}
	return tmp;
}

Python

[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c])
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c])
def code(x, y, z, t, a, b, c):
	tmp = 0
	if (z <= -7e-110) or not (z <= 4.2e+47):
		tmp = -4.0 * ((a * t) / c)
	else:
		tmp = b / (c * z)
	return tmp

Julia

x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c])
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c])
function code(x, y, z, t, a, b, c)
	tmp = 0.0
	if ((z <= -7e-110) || !(z <= 4.2e+47))
		tmp = Float64(-4.0 * Float64(Float64(a * t) / c));
	else
		tmp = Float64(b / Float64(c * z));
	end
	return tmp
end

MATLAB

x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
	tmp = 0.0;
	if ((z <= -7e-110) || ~((z <= 4.2e+47)))
		tmp = -4.0 * ((a * t) / c);
	else
		tmp = b / (c * z);
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_] := If[Or[LessEqual[z, -7e-110], N[Not[LessEqual[z, 4.2e+47]], $MachinePrecision]], N[(-4.0 * N[(N[(a * t), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision], N[(b / N[(c * z), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -6.99999999999999947e-110 or 4.2e47 < z

   1. Initial program 65.3%

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

   3. Taylor expanded in z around inf

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

      1. lower-*.f64 N/A

         \[\leadsto \color{blue}{-4 \cdot \frac{a \cdot t}{c}} \]

      2. lower-/.f64 N/A

         \[\leadsto -4 \cdot \color{blue}{\frac{a \cdot t}{c}} \]

      3. lower-*.f64 49.7

         \[\leadsto -4 \cdot \frac{\color{blue}{a \cdot t}}{c} \]

   5. Applied rewrites 49.7%

      \[\leadsto \color{blue}{-4 \cdot \frac{a \cdot t}{c}} \]

   if -6.99999999999999947e-110 < z < 4.2e47

   1. Initial program 94.2%

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

   3. Taylor expanded in b around inf

      \[\leadsto \color{blue}{\frac{b}{c \cdot z}} \]
   4. Step-by-step derivation

      1. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{b}{c \cdot z}} \]

      2. lower-*.f64 49.0

         \[\leadsto \frac{b}{\color{blue}{c \cdot z}} \]

   5. Applied rewrites 49.0%

      \[\leadsto \color{blue}{\frac{b}{c \cdot z}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 49.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -7 \cdot 10^{-110} \lor \neg \left(z \leq 4.2 \cdot 10^{+47}\right):\\ \;\;\;\;-4 \cdot \frac{a \cdot t}{c}\\ \mathbf{else}:\\ \;\;\;\;\frac{b}{c \cdot z}\\ \end{array} \]
5. Add Preprocessing

Alternative 16: 35.9% accurate, 2.8× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\ [x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\ \\ \frac{b}{c \cdot z} \end{array} \]

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 79.2%

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

3. Taylor expanded in b around inf

   \[\leadsto \color{blue}{\frac{b}{c \cdot z}} \]
4. Step-by-step derivation

   1. lower-/.f64 N/A

      \[\leadsto \color{blue}{\frac{b}{c \cdot z}} \]

   2. lower-*.f64 35.1

      \[\leadsto \frac{b}{\color{blue}{c \cdot z}} \]

5. Applied rewrites 35.1%

   \[\leadsto \color{blue}{\frac{b}{c \cdot z}} \]
6. Add Preprocessing

Developer Target 1: 80.5% accurate, 0.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{b}{c \cdot z}\\ t_2 := 4 \cdot \frac{a \cdot t}{c}\\ t_3 := \left(x \cdot 9\right) \cdot y\\ t_4 := \left(t\_3 - \left(\left(z \cdot 4\right) \cdot t\right) \cdot a\right) + b\\ t_5 := \frac{t\_4}{z \cdot c}\\ t_6 := \frac{\left(t\_3 - \left(z \cdot 4\right) \cdot \left(t \cdot a\right)\right) + b}{z \cdot c}\\ \mathbf{if}\;t\_5 < -1.100156740804105 \cdot 10^{-171}:\\ \;\;\;\;t\_6\\ \mathbf{elif}\;t\_5 < 0:\\ \;\;\;\;\frac{\frac{t\_4}{z}}{c}\\ \mathbf{elif}\;t\_5 < 1.1708877911747488 \cdot 10^{-53}:\\ \;\;\;\;t\_6\\ \mathbf{elif}\;t\_5 < 2.876823679546137 \cdot 10^{+130}:\\ \;\;\;\;\left(\left(9 \cdot \frac{y}{c}\right) \cdot \frac{x}{z} + t\_1\right) - t\_2\\ \mathbf{elif}\;t\_5 < 1.3838515042456319 \cdot 10^{+158}:\\ \;\;\;\;t\_6\\ \mathbf{else}:\\ \;\;\;\;\left(9 \cdot \left(\frac{y}{c \cdot z} \cdot x\right) + t\_1\right) - t\_2\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c)
 :precision binary64
 (let* ((t_1 (/ b (* c z)))
        (t_2 (* 4.0 (/ (* a t) c)))
        (t_3 (* (* x 9.0) y))
        (t_4 (+ (- t_3 (* (* (* z 4.0) t) a)) b))
        (t_5 (/ t_4 (* z c)))
        (t_6 (/ (+ (- t_3 (* (* z 4.0) (* t a))) b) (* z c))))
   (if (< t_5 -1.100156740804105e-171)
     t_6
     (if (< t_5 0.0)
       (/ (/ t_4 z) c)
       (if (< t_5 1.1708877911747488e-53)
         t_6
         (if (< t_5 2.876823679546137e+130)
           (- (+ (* (* 9.0 (/ y c)) (/ x z)) t_1) t_2)
           (if (< t_5 1.3838515042456319e+158)
             t_6
             (- (+ (* 9.0 (* (/ y (* c z)) x)) t_1) t_2))))))))

C

double code(double x, double y, double z, double t, double a, double b, double c) {
	double t_1 = b / (c * z);
	double t_2 = 4.0 * ((a * t) / c);
	double t_3 = (x * 9.0) * y;
	double t_4 = (t_3 - (((z * 4.0) * t) * a)) + b;
	double t_5 = t_4 / (z * c);
	double t_6 = ((t_3 - ((z * 4.0) * (t * a))) + b) / (z * c);
	double tmp;
	if (t_5 < -1.100156740804105e-171) {
		tmp = t_6;
	} else if (t_5 < 0.0) {
		tmp = (t_4 / z) / c;
	} else if (t_5 < 1.1708877911747488e-53) {
		tmp = t_6;
	} else if (t_5 < 2.876823679546137e+130) {
		tmp = (((9.0 * (y / c)) * (x / z)) + t_1) - t_2;
	} else if (t_5 < 1.3838515042456319e+158) {
		tmp = t_6;
	} else {
		tmp = ((9.0 * ((y / (c * z)) * x)) + t_1) - t_2;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b, c)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8) :: t_1
    real(8) :: t_2
    real(8) :: t_3
    real(8) :: t_4
    real(8) :: t_5
    real(8) :: t_6
    real(8) :: tmp
    t_1 = b / (c * z)
    t_2 = 4.0d0 * ((a * t) / c)
    t_3 = (x * 9.0d0) * y
    t_4 = (t_3 - (((z * 4.0d0) * t) * a)) + b
    t_5 = t_4 / (z * c)
    t_6 = ((t_3 - ((z * 4.0d0) * (t * a))) + b) / (z * c)
    if (t_5 < (-1.100156740804105d-171)) then
        tmp = t_6
    else if (t_5 < 0.0d0) then
        tmp = (t_4 / z) / c
    else if (t_5 < 1.1708877911747488d-53) then
        tmp = t_6
    else if (t_5 < 2.876823679546137d+130) then
        tmp = (((9.0d0 * (y / c)) * (x / z)) + t_1) - t_2
    else if (t_5 < 1.3838515042456319d+158) then
        tmp = t_6
    else
        tmp = ((9.0d0 * ((y / (c * z)) * x)) + t_1) - t_2
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b, double c) {
	double t_1 = b / (c * z);
	double t_2 = 4.0 * ((a * t) / c);
	double t_3 = (x * 9.0) * y;
	double t_4 = (t_3 - (((z * 4.0) * t) * a)) + b;
	double t_5 = t_4 / (z * c);
	double t_6 = ((t_3 - ((z * 4.0) * (t * a))) + b) / (z * c);
	double tmp;
	if (t_5 < -1.100156740804105e-171) {
		tmp = t_6;
	} else if (t_5 < 0.0) {
		tmp = (t_4 / z) / c;
	} else if (t_5 < 1.1708877911747488e-53) {
		tmp = t_6;
	} else if (t_5 < 2.876823679546137e+130) {
		tmp = (((9.0 * (y / c)) * (x / z)) + t_1) - t_2;
	} else if (t_5 < 1.3838515042456319e+158) {
		tmp = t_6;
	} else {
		tmp = ((9.0 * ((y / (c * z)) * x)) + t_1) - t_2;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b, c):
	t_1 = b / (c * z)
	t_2 = 4.0 * ((a * t) / c)
	t_3 = (x * 9.0) * y
	t_4 = (t_3 - (((z * 4.0) * t) * a)) + b
	t_5 = t_4 / (z * c)
	t_6 = ((t_3 - ((z * 4.0) * (t * a))) + b) / (z * c)
	tmp = 0
	if t_5 < -1.100156740804105e-171:
		tmp = t_6
	elif t_5 < 0.0:
		tmp = (t_4 / z) / c
	elif t_5 < 1.1708877911747488e-53:
		tmp = t_6
	elif t_5 < 2.876823679546137e+130:
		tmp = (((9.0 * (y / c)) * (x / z)) + t_1) - t_2
	elif t_5 < 1.3838515042456319e+158:
		tmp = t_6
	else:
		tmp = ((9.0 * ((y / (c * z)) * x)) + t_1) - t_2
	return tmp

Julia

function code(x, y, z, t, a, b, c)
	t_1 = Float64(b / Float64(c * z))
	t_2 = Float64(4.0 * Float64(Float64(a * t) / c))
	t_3 = Float64(Float64(x * 9.0) * y)
	t_4 = Float64(Float64(t_3 - Float64(Float64(Float64(z * 4.0) * t) * a)) + b)
	t_5 = Float64(t_4 / Float64(z * c))
	t_6 = Float64(Float64(Float64(t_3 - Float64(Float64(z * 4.0) * Float64(t * a))) + b) / Float64(z * c))
	tmp = 0.0
	if (t_5 < -1.100156740804105e-171)
		tmp = t_6;
	elseif (t_5 < 0.0)
		tmp = Float64(Float64(t_4 / z) / c);
	elseif (t_5 < 1.1708877911747488e-53)
		tmp = t_6;
	elseif (t_5 < 2.876823679546137e+130)
		tmp = Float64(Float64(Float64(Float64(9.0 * Float64(y / c)) * Float64(x / z)) + t_1) - t_2);
	elseif (t_5 < 1.3838515042456319e+158)
		tmp = t_6;
	else
		tmp = Float64(Float64(Float64(9.0 * Float64(Float64(y / Float64(c * z)) * x)) + t_1) - t_2);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b, c)
	t_1 = b / (c * z);
	t_2 = 4.0 * ((a * t) / c);
	t_3 = (x * 9.0) * y;
	t_4 = (t_3 - (((z * 4.0) * t) * a)) + b;
	t_5 = t_4 / (z * c);
	t_6 = ((t_3 - ((z * 4.0) * (t * a))) + b) / (z * c);
	tmp = 0.0;
	if (t_5 < -1.100156740804105e-171)
		tmp = t_6;
	elseif (t_5 < 0.0)
		tmp = (t_4 / z) / c;
	elseif (t_5 < 1.1708877911747488e-53)
		tmp = t_6;
	elseif (t_5 < 2.876823679546137e+130)
		tmp = (((9.0 * (y / c)) * (x / z)) + t_1) - t_2;
	elseif (t_5 < 1.3838515042456319e+158)
		tmp = t_6;
	else
		tmp = ((9.0 * ((y / (c * z)) * x)) + t_1) - t_2;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(b / N[(c * z), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(4.0 * N[(N[(a * t), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[(x * 9.0), $MachinePrecision] * y), $MachinePrecision]}, Block[{t$95$4 = N[(N[(t$95$3 - N[(N[(N[(z * 4.0), $MachinePrecision] * t), $MachinePrecision] * a), $MachinePrecision]), $MachinePrecision] + b), $MachinePrecision]}, Block[{t$95$5 = N[(t$95$4 / N[(z * c), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$6 = N[(N[(N[(t$95$3 - N[(N[(z * 4.0), $MachinePrecision] * N[(t * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + b), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]}, If[Less[t$95$5, -1.100156740804105e-171], t$95$6, If[Less[t$95$5, 0.0], N[(N[(t$95$4 / z), $MachinePrecision] / c), $MachinePrecision], If[Less[t$95$5, 1.1708877911747488e-53], t$95$6, If[Less[t$95$5, 2.876823679546137e+130], N[(N[(N[(N[(9.0 * N[(y / c), $MachinePrecision]), $MachinePrecision] * N[(x / z), $MachinePrecision]), $MachinePrecision] + t$95$1), $MachinePrecision] - t$95$2), $MachinePrecision], If[Less[t$95$5, 1.3838515042456319e+158], t$95$6, N[(N[(N[(9.0 * N[(N[(y / N[(c * z), $MachinePrecision]), $MachinePrecision] * x), $MachinePrecision]), $MachinePrecision] + t$95$1), $MachinePrecision] - t$95$2), $MachinePrecision]]]]]]]]]]]]

Reproduce

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

  :alt
  (! :herbie-platform default (if (< (/ (+ (- (* (* x 9) y) (* (* (* z 4) t) a)) b) (* z c)) -220031348160821/200000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) (/ (+ (- (* (* x 9) y) (* (* z 4) (* t a))) b) (* z c)) (if (< (/ (+ (- (* (* x 9) y) (* (* (* z 4) t) a)) b) (* z c)) 0) (/ (/ (+ (- (* (* x 9) y) (* (* (* z 4) t) a)) b) z) c) (if (< (/ (+ (- (* (* x 9) y) (* (* (* z 4) t) a)) b) (* z c)) 365902434742109/31250000000000000000000000000000000000000000000000000000000000000000) (/ (+ (- (* (* x 9) y) (* (* z 4) (* t a))) b) (* z c)) (if (< (/ (+ (- (* (* x 9) y) (* (* (* z 4) t) a)) b) (* z c)) 28768236795461370000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) (- (+ (* (* 9 (/ y c)) (/ x z)) (/ b (* c z))) (* 4 (/ (* a t) c))) (if (< (/ (+ (- (* (* x 9) y) (* (* (* z 4) t) a)) b) (* z c)) 138385150424563190000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) (/ (+ (- (* (* x 9) y) (* (* z 4) (* t a))) b) (* z c)) (- (+ (* 9 (* (/ y (* c z)) x)) (/ b (* c z))) (* 4 (/ (* a t) c)))))))))

  (/ (+ (- (* (* x 9.0) y) (* (* (* z 4.0) t) a)) b) (* z c)))