Linear.V4:$cdot from linear-1.19.1.3, C

Percentage Accurate: 95.9% → 97.7%

Time: 8.8s

Alternatives: 14

Speedup: 1.3×

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

Specification

Math

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

FPCore

(FPCore (x y z t a b c i)
 :precision binary64
 (+ (+ (+ (* x y) (* z t)) (* a b)) (* c i)))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	return (((x * y) + (z * t)) + (a * b)) + (c * i);
}

Fortran

real(8) function code(x, y, z, t, a, b, c, i)
    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), intent (in) :: i
    code = (((x * y) + (z * t)) + (a * b)) + (c * i)
end function

Java

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

Python

def code(x, y, z, t, a, b, c, i):
	return (((x * y) + (z * t)) + (a * b)) + (c * i)

Julia

function code(x, y, z, t, a, b, c, i)
	return Float64(Float64(Float64(Float64(x * y) + Float64(z * t)) + Float64(a * b)) + Float64(c * i))
end

MATLAB

function tmp = code(x, y, z, t, a, b, c, i)
	tmp = (((x * y) + (z * t)) + (a * b)) + (c * i);
end

Wolfram

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

Initial Program: 95.9% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y z t a b c i)
 :precision binary64
 (+ (+ (+ (* x y) (* z t)) (* a b)) (* c i)))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	return (((x * y) + (z * t)) + (a * b)) + (c * i);
}

Fortran

real(8) function code(x, y, z, t, a, b, c, i)
    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), intent (in) :: i
    code = (((x * y) + (z * t)) + (a * b)) + (c * i)
end function

Java

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

Python

def code(x, y, z, t, a, b, c, i):
	return (((x * y) + (z * t)) + (a * b)) + (c * i)

Julia

function code(x, y, z, t, a, b, c, i)
	return Float64(Float64(Float64(Float64(x * y) + Float64(z * t)) + Float64(a * b)) + Float64(c * i))
end

MATLAB

function tmp = code(x, y, z, t, a, b, c, i)
	tmp = (((x * y) + (z * t)) + (a * b)) + (c * i);
end

Wolfram

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

Alternative 1: 97.7% accurate, 1.3× speedup

Math

\[\begin{array}{l} \\ \mathsf{fma}\left(z, t, \mathsf{fma}\left(y, x, \mathsf{fma}\left(i, c, a \cdot b\right)\right)\right) \end{array} \]

FPCore

(FPCore (x y z t a b c i)
 :precision binary64
 (fma z t (fma y x (fma i c (* a b)))))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	return fma(z, t, fma(y, x, fma(i, c, (a * b))));
}

Julia

function code(x, y, z, t, a, b, c, i)
	return fma(z, t, fma(y, x, fma(i, c, Float64(a * b))))
end

Wolfram

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

Derivation

1. Initial program 96.9%

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

   1. lift-+.f64 N/A

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

   2. lift-+.f64 N/A

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

   3. associate-+l+ N/A

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

   4. lift-+.f64 N/A

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

   5. +-commutative N/A

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

   6. associate-+l+ N/A

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

   7. lift-*.f64 N/A

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

   8. lower-fma.f64 N/A

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

   9. lift-*.f64 N/A

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

   10. *-commutative N/A

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

   11. lower-fma.f64 N/A

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

   12. +-commutative N/A

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

   13. lift-*.f64 N/A

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

   14. *-commutative N/A

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

   15. lower-fma.f64 98.0

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

   16. lift-*.f64 N/A

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

   17. *-commutative N/A

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

   18. lower-*.f64 98.0

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

4. Applied rewrites 98.0%

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

5. Final simplification 98.0%

   \[\leadsto \mathsf{fma}\left(z, t, \mathsf{fma}\left(y, x, \mathsf{fma}\left(i, c, a \cdot b\right)\right)\right) \]
6. Add Preprocessing

Alternative 2: 75.5% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \mathsf{fma}\left(z, t, x \cdot y\right)\\ t_2 := x \cdot y + t \cdot z\\ \mathbf{if}\;t\_2 \leq -1 \cdot 10^{+170}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t\_2 \leq 2 \cdot 10^{+15}:\\ \;\;\;\;\mathsf{fma}\left(i, c, a \cdot b\right)\\ \mathbf{elif}\;t\_2 \leq 5 \cdot 10^{+152}:\\ \;\;\;\;\mathsf{fma}\left(b, a, x \cdot y\right)\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c i)
 :precision binary64
 (let* ((t_1 (fma z t (* x y))) (t_2 (+ (* x y) (* t z))))
   (if (<= t_2 -1e+170)
     t_1
     (if (<= t_2 2e+15)
       (fma i c (* a b))
       (if (<= t_2 5e+152) (fma b a (* x y)) t_1)))))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	double t_1 = fma(z, t, (x * y));
	double t_2 = (x * y) + (t * z);
	double tmp;
	if (t_2 <= -1e+170) {
		tmp = t_1;
	} else if (t_2 <= 2e+15) {
		tmp = fma(i, c, (a * b));
	} else if (t_2 <= 5e+152) {
		tmp = fma(b, a, (x * y));
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b, c, i)
	t_1 = fma(z, t, Float64(x * y))
	t_2 = Float64(Float64(x * y) + Float64(t * z))
	tmp = 0.0
	if (t_2 <= -1e+170)
		tmp = t_1;
	elseif (t_2 <= 2e+15)
		tmp = fma(i, c, Float64(a * b));
	elseif (t_2 <= 5e+152)
		tmp = fma(b, a, Float64(x * y));
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_] := Block[{t$95$1 = N[(z * t + N[(x * y), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(x * y), $MachinePrecision] + N[(t * z), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, -1e+170], t$95$1, If[LessEqual[t$95$2, 2e+15], N[(i * c + N[(a * b), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, 5e+152], N[(b * a + N[(x * y), $MachinePrecision]), $MachinePrecision], t$95$1]]]]]

Derivation

1. Split input into 3 regimes

2. if (+.f64 (*.f64 x y) (*.f64 z t)) < -1.00000000000000003e170 or 5e152 < (+.f64 (*.f64 x y) (*.f64 z t))

   1. Initial program 93.6%

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

      1. lift-+.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. associate-+l+ N/A

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

      4. lift-+.f64 N/A

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

      5. +-commutative N/A

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

      6. associate-+l+ N/A

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

      7. lift-*.f64 N/A

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

      8. lower-fma.f64 N/A

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

      9. lift-*.f64 N/A

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

      10. *-commutative N/A

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

      11. lower-fma.f64 N/A

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

      12. +-commutative N/A

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

      13. lift-*.f64 N/A

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

      14. *-commutative N/A

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

      15. lower-fma.f64 96.0

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

      16. lift-*.f64 N/A

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

      17. *-commutative N/A

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

      18. lower-*.f64 96.0

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

   4. Applied rewrites 96.0%

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

   5. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 78.1

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

   7. Applied rewrites 78.1%

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

   if -1.00000000000000003e170 < (+.f64 (*.f64 x y) (*.f64 z t)) < 2e15

   1. Initial program 100.0%

      \[\left(\left(x \cdot y + z \cdot t\right) + a \cdot b\right) + c \cdot i \]
   2. Add Preprocessing

   3. Taylor expanded in b around inf

      \[\leadsto \color{blue}{a \cdot b} + c \cdot i \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \color{blue}{b \cdot a} + c \cdot i \]

      2. lower-*.f64 79.9

         \[\leadsto \color{blue}{b \cdot a} + c \cdot i \]

   5. Applied rewrites 79.9%

      \[\leadsto \color{blue}{b \cdot a} + c \cdot i \]
   6. Step-by-step derivation

      1. lift-+.f64 N/A

         \[\leadsto \color{blue}{b \cdot a + c \cdot i} \]

      2. +-commutative N/A

         \[\leadsto \color{blue}{c \cdot i + b \cdot a} \]

      3. lift-*.f64 N/A

         \[\leadsto \color{blue}{c \cdot i} + b \cdot a \]

      4. *-commutative N/A

         \[\leadsto \color{blue}{i \cdot c} + b \cdot a \]

      5. lower-fma.f64 79.9

         \[\leadsto \color{blue}{\mathsf{fma}\left(i, c, b \cdot a\right)} \]

   7. Applied rewrites 79.9%

      \[\leadsto \color{blue}{\mathsf{fma}\left(i, c, a \cdot b\right)} \]

   if 2e15 < (+.f64 (*.f64 x y) (*.f64 z t)) < 5e152

   1. Initial program 100.0%

      \[\left(\left(x \cdot y + z \cdot t\right) + a \cdot b\right) + c \cdot i \]
   2. Add Preprocessing

   3. Taylor expanded in c around 0

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. +-commutative N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 N/A

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

      6. *-commutative N/A

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

      7. lower-*.f64 78.5

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

   5. Applied rewrites 78.5%

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

   6. Taylor expanded in t around 0

      \[\leadsto \mathsf{fma}\left(b, a, x \cdot y\right) \]
   7. Step-by-step derivation

   8. Applied rewrites 63.9%

      \[\leadsto \mathsf{fma}\left(b, a, y \cdot x\right) \]
3. Recombined 3 regimes into one program.

4. Final simplification 76.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \cdot y + t \cdot z \leq -1 \cdot 10^{+170}:\\ \;\;\;\;\mathsf{fma}\left(z, t, x \cdot y\right)\\ \mathbf{elif}\;x \cdot y + t \cdot z \leq 2 \cdot 10^{+15}:\\ \;\;\;\;\mathsf{fma}\left(i, c, a \cdot b\right)\\ \mathbf{elif}\;x \cdot y + t \cdot z \leq 5 \cdot 10^{+152}:\\ \;\;\;\;\mathsf{fma}\left(b, a, x \cdot y\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(z, t, x \cdot y\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 67.4% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \mathsf{fma}\left(i, c, x \cdot y\right)\\ \mathbf{if}\;t \cdot z \leq -2 \cdot 10^{+69}:\\ \;\;\;\;\mathsf{fma}\left(z, t, c \cdot i\right)\\ \mathbf{elif}\;t \cdot z \leq -2 \cdot 10^{-130}:\\ \;\;\;\;\mathsf{fma}\left(b, a, x \cdot y\right)\\ \mathbf{elif}\;t \cdot z \leq -5 \cdot 10^{-234}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t \cdot z \leq 5 \cdot 10^{-108}:\\ \;\;\;\;\mathsf{fma}\left(i, c, a \cdot b\right)\\ \mathbf{elif}\;t \cdot z \leq 2 \cdot 10^{+49}:\\ \;\;\;\;t\_1\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(b, a, t \cdot z\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c i)
 :precision binary64
 (let* ((t_1 (fma i c (* x y))))
   (if (<= (* t z) -2e+69)
     (fma z t (* c i))
     (if (<= (* t z) -2e-130)
       (fma b a (* x y))
       (if (<= (* t z) -5e-234)
         t_1
         (if (<= (* t z) 5e-108)
           (fma i c (* a b))
           (if (<= (* t z) 2e+49) t_1 (fma b a (* t z)))))))))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	double t_1 = fma(i, c, (x * y));
	double tmp;
	if ((t * z) <= -2e+69) {
		tmp = fma(z, t, (c * i));
	} else if ((t * z) <= -2e-130) {
		tmp = fma(b, a, (x * y));
	} else if ((t * z) <= -5e-234) {
		tmp = t_1;
	} else if ((t * z) <= 5e-108) {
		tmp = fma(i, c, (a * b));
	} else if ((t * z) <= 2e+49) {
		tmp = t_1;
	} else {
		tmp = fma(b, a, (t * z));
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b, c, i)
	t_1 = fma(i, c, Float64(x * y))
	tmp = 0.0
	if (Float64(t * z) <= -2e+69)
		tmp = fma(z, t, Float64(c * i));
	elseif (Float64(t * z) <= -2e-130)
		tmp = fma(b, a, Float64(x * y));
	elseif (Float64(t * z) <= -5e-234)
		tmp = t_1;
	elseif (Float64(t * z) <= 5e-108)
		tmp = fma(i, c, Float64(a * b));
	elseif (Float64(t * z) <= 2e+49)
		tmp = t_1;
	else
		tmp = fma(b, a, Float64(t * z));
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_] := Block[{t$95$1 = N[(i * c + N[(x * y), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(t * z), $MachinePrecision], -2e+69], N[(z * t + N[(c * i), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(t * z), $MachinePrecision], -2e-130], N[(b * a + N[(x * y), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(t * z), $MachinePrecision], -5e-234], t$95$1, If[LessEqual[N[(t * z), $MachinePrecision], 5e-108], N[(i * c + N[(a * b), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(t * z), $MachinePrecision], 2e+49], t$95$1, N[(b * a + N[(t * z), $MachinePrecision]), $MachinePrecision]]]]]]]

Derivation

1. Split input into 5 regimes

2. if (*.f64 z t) < -2.0000000000000001e69

   1. Initial program 90.0%

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

      1. lift-+.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. associate-+l+ N/A

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

      4. lift-+.f64 N/A

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

      5. +-commutative N/A

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

      6. associate-+l+ N/A

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

      7. lift-*.f64 N/A

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

      8. lower-fma.f64 N/A

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

      9. lift-*.f64 N/A

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

      10. *-commutative N/A

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

      11. lower-fma.f64 N/A

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

      12. +-commutative N/A

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

      13. lift-*.f64 N/A

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

      14. *-commutative N/A

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

      15. lower-fma.f64 92.0

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

      16. lift-*.f64 N/A

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

      17. *-commutative N/A

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

      18. lower-*.f64 92.0

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

   4. Applied rewrites 92.0%

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

   5. Taylor expanded in c around inf

      \[\leadsto \mathsf{fma}\left(z, t, \color{blue}{c \cdot i}\right) \]
   6. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(z, t, \color{blue}{i \cdot c}\right) \]

      2. lower-*.f64 78.0

         \[\leadsto \mathsf{fma}\left(z, t, \color{blue}{i \cdot c}\right) \]

   7. Applied rewrites 78.0%

      \[\leadsto \mathsf{fma}\left(z, t, \color{blue}{i \cdot c}\right) \]

   if -2.0000000000000001e69 < (*.f64 z t) < -2.0000000000000002e-130

   1. Initial program 100.0%

      \[\left(\left(x \cdot y + z \cdot t\right) + a \cdot b\right) + c \cdot i \]
   2. Add Preprocessing

   3. Taylor expanded in c around 0

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. +-commutative N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 N/A

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

      6. *-commutative N/A

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

      7. lower-*.f64 90.6

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

   5. Applied rewrites 90.6%

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

   6. Taylor expanded in t around 0

      \[\leadsto \mathsf{fma}\left(b, a, x \cdot y\right) \]
   7. Step-by-step derivation

   8. Applied rewrites 77.3%

      \[\leadsto \mathsf{fma}\left(b, a, y \cdot x\right) \]

   if -2.0000000000000002e-130 < (*.f64 z t) < -4.99999999999999979e-234 or 5e-108 < (*.f64 z t) < 1.99999999999999989e49

   1. Initial program 97.6%

      \[\left(\left(x \cdot y + z \cdot t\right) + a \cdot b\right) + c \cdot i \]
   2. Add Preprocessing

   3. Taylor expanded in b around inf

      \[\leadsto \color{blue}{a \cdot b} + c \cdot i \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \color{blue}{b \cdot a} + c \cdot i \]

      2. lower-*.f64 47.9

         \[\leadsto \color{blue}{b \cdot a} + c \cdot i \]

   5. Applied rewrites 47.9%

      \[\leadsto \color{blue}{b \cdot a} + c \cdot i \]
   6. Step-by-step derivation

      1. lift-+.f64 N/A

         \[\leadsto \color{blue}{b \cdot a + c \cdot i} \]

      2. +-commutative N/A

         \[\leadsto \color{blue}{c \cdot i + b \cdot a} \]

      3. lift-*.f64 N/A

         \[\leadsto \color{blue}{c \cdot i} + b \cdot a \]

      4. *-commutative N/A

         \[\leadsto \color{blue}{i \cdot c} + b \cdot a \]

      5. lower-fma.f64 50.4

         \[\leadsto \color{blue}{\mathsf{fma}\left(i, c, b \cdot a\right)} \]

   7. Applied rewrites 50.4%

      \[\leadsto \color{blue}{\mathsf{fma}\left(i, c, a \cdot b\right)} \]

   8. Taylor expanded in x around inf

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

      1. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(i, c, \color{blue}{y \cdot x}\right) \]

      2. lower-*.f64 85.1

         \[\leadsto \mathsf{fma}\left(i, c, \color{blue}{y \cdot x}\right) \]

   10. Applied rewrites 85.1%

       \[\leadsto \mathsf{fma}\left(i, c, \color{blue}{y \cdot x}\right) \]

   if -4.99999999999999979e-234 < (*.f64 z t) < 5e-108

   1. Initial program 98.5%

      \[\left(\left(x \cdot y + z \cdot t\right) + a \cdot b\right) + c \cdot i \]
   2. Add Preprocessing

   3. Taylor expanded in b around inf

      \[\leadsto \color{blue}{a \cdot b} + c \cdot i \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \color{blue}{b \cdot a} + c \cdot i \]

      2. lower-*.f64 73.9

         \[\leadsto \color{blue}{b \cdot a} + c \cdot i \]

   5. Applied rewrites 73.9%

      \[\leadsto \color{blue}{b \cdot a} + c \cdot i \]
   6. Step-by-step derivation

      1. lift-+.f64 N/A

         \[\leadsto \color{blue}{b \cdot a + c \cdot i} \]

      2. +-commutative N/A

         \[\leadsto \color{blue}{c \cdot i + b \cdot a} \]

      3. lift-*.f64 N/A

         \[\leadsto \color{blue}{c \cdot i} + b \cdot a \]

      4. *-commutative N/A

         \[\leadsto \color{blue}{i \cdot c} + b \cdot a \]

      5. lower-fma.f64 73.9

         \[\leadsto \color{blue}{\mathsf{fma}\left(i, c, b \cdot a\right)} \]

   7. Applied rewrites 73.9%

      \[\leadsto \color{blue}{\mathsf{fma}\left(i, c, a \cdot b\right)} \]

   if 1.99999999999999989e49 < (*.f64 z t)

   1. Initial program 98.4%

      \[\left(\left(x \cdot y + z \cdot t\right) + a \cdot b\right) + c \cdot i \]
   2. Add Preprocessing

   3. Taylor expanded in c around 0

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. +-commutative N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 N/A

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

      6. *-commutative N/A

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

      7. lower-*.f64 86.1

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

   5. Applied rewrites 86.1%

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

   6. Taylor expanded in t around inf

      \[\leadsto \mathsf{fma}\left(b, a, t \cdot z\right) \]
   7. Step-by-step derivation

   8. Applied rewrites 75.9%

      \[\leadsto \mathsf{fma}\left(b, a, z \cdot t\right) \]
3. Recombined 5 regimes into one program.

4. Final simplification 77.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;t \cdot z \leq -2 \cdot 10^{+69}:\\ \;\;\;\;\mathsf{fma}\left(z, t, c \cdot i\right)\\ \mathbf{elif}\;t \cdot z \leq -2 \cdot 10^{-130}:\\ \;\;\;\;\mathsf{fma}\left(b, a, x \cdot y\right)\\ \mathbf{elif}\;t \cdot z \leq -5 \cdot 10^{-234}:\\ \;\;\;\;\mathsf{fma}\left(i, c, x \cdot y\right)\\ \mathbf{elif}\;t \cdot z \leq 5 \cdot 10^{-108}:\\ \;\;\;\;\mathsf{fma}\left(i, c, a \cdot b\right)\\ \mathbf{elif}\;t \cdot z \leq 2 \cdot 10^{+49}:\\ \;\;\;\;\mathsf{fma}\left(i, c, x \cdot y\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(b, a, t \cdot z\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 67.3% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \mathsf{fma}\left(i, c, x \cdot y\right)\\ t_2 := \mathsf{fma}\left(b, a, t \cdot z\right)\\ \mathbf{if}\;t \cdot z \leq -5 \cdot 10^{+134}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;t \cdot z \leq -2 \cdot 10^{-130}:\\ \;\;\;\;\mathsf{fma}\left(b, a, x \cdot y\right)\\ \mathbf{elif}\;t \cdot z \leq -5 \cdot 10^{-234}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t \cdot z \leq 5 \cdot 10^{-108}:\\ \;\;\;\;\mathsf{fma}\left(i, c, a \cdot b\right)\\ \mathbf{elif}\;t \cdot z \leq 2 \cdot 10^{+49}:\\ \;\;\;\;t\_1\\ \mathbf{else}:\\ \;\;\;\;t\_2\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c i)
 :precision binary64
 (let* ((t_1 (fma i c (* x y))) (t_2 (fma b a (* t z))))
   (if (<= (* t z) -5e+134)
     t_2
     (if (<= (* t z) -2e-130)
       (fma b a (* x y))
       (if (<= (* t z) -5e-234)
         t_1
         (if (<= (* t z) 5e-108)
           (fma i c (* a b))
           (if (<= (* t z) 2e+49) t_1 t_2)))))))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	double t_1 = fma(i, c, (x * y));
	double t_2 = fma(b, a, (t * z));
	double tmp;
	if ((t * z) <= -5e+134) {
		tmp = t_2;
	} else if ((t * z) <= -2e-130) {
		tmp = fma(b, a, (x * y));
	} else if ((t * z) <= -5e-234) {
		tmp = t_1;
	} else if ((t * z) <= 5e-108) {
		tmp = fma(i, c, (a * b));
	} else if ((t * z) <= 2e+49) {
		tmp = t_1;
	} else {
		tmp = t_2;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b, c, i)
	t_1 = fma(i, c, Float64(x * y))
	t_2 = fma(b, a, Float64(t * z))
	tmp = 0.0
	if (Float64(t * z) <= -5e+134)
		tmp = t_2;
	elseif (Float64(t * z) <= -2e-130)
		tmp = fma(b, a, Float64(x * y));
	elseif (Float64(t * z) <= -5e-234)
		tmp = t_1;
	elseif (Float64(t * z) <= 5e-108)
		tmp = fma(i, c, Float64(a * b));
	elseif (Float64(t * z) <= 2e+49)
		tmp = t_1;
	else
		tmp = t_2;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_] := Block[{t$95$1 = N[(i * c + N[(x * y), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(b * a + N[(t * z), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(t * z), $MachinePrecision], -5e+134], t$95$2, If[LessEqual[N[(t * z), $MachinePrecision], -2e-130], N[(b * a + N[(x * y), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(t * z), $MachinePrecision], -5e-234], t$95$1, If[LessEqual[N[(t * z), $MachinePrecision], 5e-108], N[(i * c + N[(a * b), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(t * z), $MachinePrecision], 2e+49], t$95$1, t$95$2]]]]]]]

Derivation

1. Split input into 4 regimes

2. if (*.f64 z t) < -4.99999999999999981e134 or 1.99999999999999989e49 < (*.f64 z t)

   1. Initial program 94.2%

      \[\left(\left(x \cdot y + z \cdot t\right) + a \cdot b\right) + c \cdot i \]
   2. Add Preprocessing

   3. Taylor expanded in c around 0

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. +-commutative N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 N/A

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

      6. *-commutative N/A

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

      7. lower-*.f64 85.0

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

   5. Applied rewrites 85.0%

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

   6. Taylor expanded in t around inf

      \[\leadsto \mathsf{fma}\left(b, a, t \cdot z\right) \]
   7. Step-by-step derivation

   8. Applied rewrites 76.4%

      \[\leadsto \mathsf{fma}\left(b, a, z \cdot t\right) \]

   if -4.99999999999999981e134 < (*.f64 z t) < -2.0000000000000002e-130

   1. Initial program 100.0%

      \[\left(\left(x \cdot y + z \cdot t\right) + a \cdot b\right) + c \cdot i \]
   2. Add Preprocessing

   3. Taylor expanded in c around 0

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. +-commutative N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 N/A

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

      6. *-commutative N/A

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

      7. lower-*.f64 85.5

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

   5. Applied rewrites 85.5%

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

   6. Taylor expanded in t around 0

      \[\leadsto \mathsf{fma}\left(b, a, x \cdot y\right) \]
   7. Step-by-step derivation

   8. Applied rewrites 69.4%

      \[\leadsto \mathsf{fma}\left(b, a, y \cdot x\right) \]

   if -2.0000000000000002e-130 < (*.f64 z t) < -4.99999999999999979e-234 or 5e-108 < (*.f64 z t) < 1.99999999999999989e49

   1. Initial program 97.6%

      \[\left(\left(x \cdot y + z \cdot t\right) + a \cdot b\right) + c \cdot i \]
   2. Add Preprocessing

   3. Taylor expanded in b around inf

      \[\leadsto \color{blue}{a \cdot b} + c \cdot i \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \color{blue}{b \cdot a} + c \cdot i \]

      2. lower-*.f64 47.9

         \[\leadsto \color{blue}{b \cdot a} + c \cdot i \]

   5. Applied rewrites 47.9%

      \[\leadsto \color{blue}{b \cdot a} + c \cdot i \]
   6. Step-by-step derivation

      1. lift-+.f64 N/A

         \[\leadsto \color{blue}{b \cdot a + c \cdot i} \]

      2. +-commutative N/A

         \[\leadsto \color{blue}{c \cdot i + b \cdot a} \]

      3. lift-*.f64 N/A

         \[\leadsto \color{blue}{c \cdot i} + b \cdot a \]

      4. *-commutative N/A

         \[\leadsto \color{blue}{i \cdot c} + b \cdot a \]

      5. lower-fma.f64 50.4

         \[\leadsto \color{blue}{\mathsf{fma}\left(i, c, b \cdot a\right)} \]

   7. Applied rewrites 50.4%

      \[\leadsto \color{blue}{\mathsf{fma}\left(i, c, a \cdot b\right)} \]

   8. Taylor expanded in x around inf

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

      1. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(i, c, \color{blue}{y \cdot x}\right) \]

      2. lower-*.f64 85.1

         \[\leadsto \mathsf{fma}\left(i, c, \color{blue}{y \cdot x}\right) \]

   10. Applied rewrites 85.1%

       \[\leadsto \mathsf{fma}\left(i, c, \color{blue}{y \cdot x}\right) \]

   if -4.99999999999999979e-234 < (*.f64 z t) < 5e-108

   1. Initial program 98.5%

      \[\left(\left(x \cdot y + z \cdot t\right) + a \cdot b\right) + c \cdot i \]
   2. Add Preprocessing

   3. Taylor expanded in b around inf

      \[\leadsto \color{blue}{a \cdot b} + c \cdot i \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \color{blue}{b \cdot a} + c \cdot i \]

      2. lower-*.f64 73.9

         \[\leadsto \color{blue}{b \cdot a} + c \cdot i \]

   5. Applied rewrites 73.9%

      \[\leadsto \color{blue}{b \cdot a} + c \cdot i \]
   6. Step-by-step derivation

      1. lift-+.f64 N/A

         \[\leadsto \color{blue}{b \cdot a + c \cdot i} \]

      2. +-commutative N/A

         \[\leadsto \color{blue}{c \cdot i + b \cdot a} \]

      3. lift-*.f64 N/A

         \[\leadsto \color{blue}{c \cdot i} + b \cdot a \]

      4. *-commutative N/A

         \[\leadsto \color{blue}{i \cdot c} + b \cdot a \]

      5. lower-fma.f64 73.9

         \[\leadsto \color{blue}{\mathsf{fma}\left(i, c, b \cdot a\right)} \]

   7. Applied rewrites 73.9%

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

4. Final simplification 75.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;t \cdot z \leq -5 \cdot 10^{+134}:\\ \;\;\;\;\mathsf{fma}\left(b, a, t \cdot z\right)\\ \mathbf{elif}\;t \cdot z \leq -2 \cdot 10^{-130}:\\ \;\;\;\;\mathsf{fma}\left(b, a, x \cdot y\right)\\ \mathbf{elif}\;t \cdot z \leq -5 \cdot 10^{-234}:\\ \;\;\;\;\mathsf{fma}\left(i, c, x \cdot y\right)\\ \mathbf{elif}\;t \cdot z \leq 5 \cdot 10^{-108}:\\ \;\;\;\;\mathsf{fma}\left(i, c, a \cdot b\right)\\ \mathbf{elif}\;t \cdot z \leq 2 \cdot 10^{+49}:\\ \;\;\;\;\mathsf{fma}\left(i, c, x \cdot y\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(b, a, t \cdot z\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 42.7% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \cdot b \leq -2 \cdot 10^{+199}:\\ \;\;\;\;a \cdot b\\ \mathbf{elif}\;a \cdot b \leq 5 \cdot 10^{-159}:\\ \;\;\;\;t \cdot z\\ \mathbf{elif}\;a \cdot b \leq 10^{-87}:\\ \;\;\;\;x \cdot y\\ \mathbf{elif}\;a \cdot b \leq 5 \cdot 10^{+132}:\\ \;\;\;\;c \cdot i\\ \mathbf{else}:\\ \;\;\;\;a \cdot b\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c i)
 :precision binary64
 (if (<= (* a b) -2e+199)
   (* a b)
   (if (<= (* a b) 5e-159)
     (* t z)
     (if (<= (* a b) 1e-87)
       (* x y)
       (if (<= (* a b) 5e+132) (* c i) (* a b))))))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	double tmp;
	if ((a * b) <= -2e+199) {
		tmp = a * b;
	} else if ((a * b) <= 5e-159) {
		tmp = t * z;
	} else if ((a * b) <= 1e-87) {
		tmp = x * y;
	} else if ((a * b) <= 5e+132) {
		tmp = c * i;
	} else {
		tmp = a * b;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b, c, i)
    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), intent (in) :: i
    real(8) :: tmp
    if ((a * b) <= (-2d+199)) then
        tmp = a * b
    else if ((a * b) <= 5d-159) then
        tmp = t * z
    else if ((a * b) <= 1d-87) then
        tmp = x * y
    else if ((a * b) <= 5d+132) then
        tmp = c * i
    else
        tmp = a * b
    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 i) {
	double tmp;
	if ((a * b) <= -2e+199) {
		tmp = a * b;
	} else if ((a * b) <= 5e-159) {
		tmp = t * z;
	} else if ((a * b) <= 1e-87) {
		tmp = x * y;
	} else if ((a * b) <= 5e+132) {
		tmp = c * i;
	} else {
		tmp = a * b;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b, c, i):
	tmp = 0
	if (a * b) <= -2e+199:
		tmp = a * b
	elif (a * b) <= 5e-159:
		tmp = t * z
	elif (a * b) <= 1e-87:
		tmp = x * y
	elif (a * b) <= 5e+132:
		tmp = c * i
	else:
		tmp = a * b
	return tmp

Julia

function code(x, y, z, t, a, b, c, i)
	tmp = 0.0
	if (Float64(a * b) <= -2e+199)
		tmp = Float64(a * b);
	elseif (Float64(a * b) <= 5e-159)
		tmp = Float64(t * z);
	elseif (Float64(a * b) <= 1e-87)
		tmp = Float64(x * y);
	elseif (Float64(a * b) <= 5e+132)
		tmp = Float64(c * i);
	else
		tmp = Float64(a * b);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b, c, i)
	tmp = 0.0;
	if ((a * b) <= -2e+199)
		tmp = a * b;
	elseif ((a * b) <= 5e-159)
		tmp = t * z;
	elseif ((a * b) <= 1e-87)
		tmp = x * y;
	elseif ((a * b) <= 5e+132)
		tmp = c * i;
	else
		tmp = a * b;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_] := If[LessEqual[N[(a * b), $MachinePrecision], -2e+199], N[(a * b), $MachinePrecision], If[LessEqual[N[(a * b), $MachinePrecision], 5e-159], N[(t * z), $MachinePrecision], If[LessEqual[N[(a * b), $MachinePrecision], 1e-87], N[(x * y), $MachinePrecision], If[LessEqual[N[(a * b), $MachinePrecision], 5e+132], N[(c * i), $MachinePrecision], N[(a * b), $MachinePrecision]]]]]

Derivation

1. Split input into 4 regimes

2. if (*.f64 a b) < -2.00000000000000019e199 or 5.0000000000000001e132 < (*.f64 a b)

   1. Initial program 96.4%

      \[\left(\left(x \cdot y + z \cdot t\right) + a \cdot b\right) + c \cdot i \]
   2. Add Preprocessing

   3. Taylor expanded in b around inf

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

      1. *-commutative N/A

         \[\leadsto \color{blue}{b \cdot a} \]

      2. lower-*.f64 87.8

         \[\leadsto \color{blue}{b \cdot a} \]

   5. Applied rewrites 87.8%

      \[\leadsto \color{blue}{b \cdot a} \]

   if -2.00000000000000019e199 < (*.f64 a b) < 5.00000000000000032e-159

   1. Initial program 97.8%

      \[\left(\left(x \cdot y + z \cdot t\right) + a \cdot b\right) + c \cdot i \]
   2. Add Preprocessing

   3. Taylor expanded in t around inf

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

      1. *-commutative N/A

         \[\leadsto \color{blue}{z \cdot t} \]

      2. lower-*.f64 41.1

         \[\leadsto \color{blue}{z \cdot t} \]

   5. Applied rewrites 41.1%

      \[\leadsto \color{blue}{z \cdot t} \]

   if 5.00000000000000032e-159 < (*.f64 a b) < 1.00000000000000002e-87

   1. Initial program 100.0%

      \[\left(\left(x \cdot y + z \cdot t\right) + a \cdot b\right) + c \cdot i \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

      1. *-commutative N/A

         \[\leadsto \color{blue}{y \cdot x} \]

      2. lower-*.f64 62.9

         \[\leadsto \color{blue}{y \cdot x} \]

   5. Applied rewrites 62.9%

      \[\leadsto \color{blue}{y \cdot x} \]

   if 1.00000000000000002e-87 < (*.f64 a b) < 5.0000000000000001e132

   1. Initial program 93.3%

      \[\left(\left(x \cdot y + z \cdot t\right) + a \cdot b\right) + c \cdot i \]
   2. Add Preprocessing

   3. Taylor expanded in c around inf

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

      1. *-commutative N/A

         \[\leadsto \color{blue}{i \cdot c} \]

      2. lower-*.f64 41.3

         \[\leadsto \color{blue}{i \cdot c} \]

   5. Applied rewrites 41.3%

      \[\leadsto \color{blue}{i \cdot c} \]
3. Recombined 4 regimes into one program.

4. Final simplification 52.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;a \cdot b \leq -2 \cdot 10^{+199}:\\ \;\;\;\;a \cdot b\\ \mathbf{elif}\;a \cdot b \leq 5 \cdot 10^{-159}:\\ \;\;\;\;t \cdot z\\ \mathbf{elif}\;a \cdot b \leq 10^{-87}:\\ \;\;\;\;x \cdot y\\ \mathbf{elif}\;a \cdot b \leq 5 \cdot 10^{+132}:\\ \;\;\;\;c \cdot i\\ \mathbf{else}:\\ \;\;\;\;a \cdot b\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 41.5% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \cdot b \leq -5 \cdot 10^{+203}:\\ \;\;\;\;a \cdot b\\ \mathbf{elif}\;a \cdot b \leq -2 \cdot 10^{-191}:\\ \;\;\;\;c \cdot i\\ \mathbf{elif}\;a \cdot b \leq 10^{-87}:\\ \;\;\;\;x \cdot y\\ \mathbf{elif}\;a \cdot b \leq 5 \cdot 10^{+132}:\\ \;\;\;\;c \cdot i\\ \mathbf{else}:\\ \;\;\;\;a \cdot b\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c i)
 :precision binary64
 (if (<= (* a b) -5e+203)
   (* a b)
   (if (<= (* a b) -2e-191)
     (* c i)
     (if (<= (* a b) 1e-87)
       (* x y)
       (if (<= (* a b) 5e+132) (* c i) (* a b))))))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	double tmp;
	if ((a * b) <= -5e+203) {
		tmp = a * b;
	} else if ((a * b) <= -2e-191) {
		tmp = c * i;
	} else if ((a * b) <= 1e-87) {
		tmp = x * y;
	} else if ((a * b) <= 5e+132) {
		tmp = c * i;
	} else {
		tmp = a * b;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b, c, i)
    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), intent (in) :: i
    real(8) :: tmp
    if ((a * b) <= (-5d+203)) then
        tmp = a * b
    else if ((a * b) <= (-2d-191)) then
        tmp = c * i
    else if ((a * b) <= 1d-87) then
        tmp = x * y
    else if ((a * b) <= 5d+132) then
        tmp = c * i
    else
        tmp = a * b
    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 i) {
	double tmp;
	if ((a * b) <= -5e+203) {
		tmp = a * b;
	} else if ((a * b) <= -2e-191) {
		tmp = c * i;
	} else if ((a * b) <= 1e-87) {
		tmp = x * y;
	} else if ((a * b) <= 5e+132) {
		tmp = c * i;
	} else {
		tmp = a * b;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b, c, i):
	tmp = 0
	if (a * b) <= -5e+203:
		tmp = a * b
	elif (a * b) <= -2e-191:
		tmp = c * i
	elif (a * b) <= 1e-87:
		tmp = x * y
	elif (a * b) <= 5e+132:
		tmp = c * i
	else:
		tmp = a * b
	return tmp

Julia

function code(x, y, z, t, a, b, c, i)
	tmp = 0.0
	if (Float64(a * b) <= -5e+203)
		tmp = Float64(a * b);
	elseif (Float64(a * b) <= -2e-191)
		tmp = Float64(c * i);
	elseif (Float64(a * b) <= 1e-87)
		tmp = Float64(x * y);
	elseif (Float64(a * b) <= 5e+132)
		tmp = Float64(c * i);
	else
		tmp = Float64(a * b);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b, c, i)
	tmp = 0.0;
	if ((a * b) <= -5e+203)
		tmp = a * b;
	elseif ((a * b) <= -2e-191)
		tmp = c * i;
	elseif ((a * b) <= 1e-87)
		tmp = x * y;
	elseif ((a * b) <= 5e+132)
		tmp = c * i;
	else
		tmp = a * b;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_] := If[LessEqual[N[(a * b), $MachinePrecision], -5e+203], N[(a * b), $MachinePrecision], If[LessEqual[N[(a * b), $MachinePrecision], -2e-191], N[(c * i), $MachinePrecision], If[LessEqual[N[(a * b), $MachinePrecision], 1e-87], N[(x * y), $MachinePrecision], If[LessEqual[N[(a * b), $MachinePrecision], 5e+132], N[(c * i), $MachinePrecision], N[(a * b), $MachinePrecision]]]]]

Derivation

1. Split input into 3 regimes

2. if (*.f64 a b) < -4.99999999999999994e203 or 5.0000000000000001e132 < (*.f64 a b)

   1. Initial program 96.3%

      \[\left(\left(x \cdot y + z \cdot t\right) + a \cdot b\right) + c \cdot i \]
   2. Add Preprocessing

   3. Taylor expanded in b around inf

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

      1. *-commutative N/A

         \[\leadsto \color{blue}{b \cdot a} \]

      2. lower-*.f64 89.3

         \[\leadsto \color{blue}{b \cdot a} \]

   5. Applied rewrites 89.3%

      \[\leadsto \color{blue}{b \cdot a} \]

   if -4.99999999999999994e203 < (*.f64 a b) < -2e-191 or 1.00000000000000002e-87 < (*.f64 a b) < 5.0000000000000001e132

   1. Initial program 96.5%

      \[\left(\left(x \cdot y + z \cdot t\right) + a \cdot b\right) + c \cdot i \]
   2. Add Preprocessing

   3. Taylor expanded in c around inf

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

      1. *-commutative N/A

         \[\leadsto \color{blue}{i \cdot c} \]

      2. lower-*.f64 35.4

         \[\leadsto \color{blue}{i \cdot c} \]

   5. Applied rewrites 35.4%

      \[\leadsto \color{blue}{i \cdot c} \]

   if -2e-191 < (*.f64 a b) < 1.00000000000000002e-87

   1. Initial program 97.7%

      \[\left(\left(x \cdot y + z \cdot t\right) + a \cdot b\right) + c \cdot i \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

      1. *-commutative N/A

         \[\leadsto \color{blue}{y \cdot x} \]

      2. lower-*.f64 41.5

         \[\leadsto \color{blue}{y \cdot x} \]

   5. Applied rewrites 41.5%

      \[\leadsto \color{blue}{y \cdot x} \]
3. Recombined 3 regimes into one program.

4. Final simplification 49.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;a \cdot b \leq -5 \cdot 10^{+203}:\\ \;\;\;\;a \cdot b\\ \mathbf{elif}\;a \cdot b \leq -2 \cdot 10^{-191}:\\ \;\;\;\;c \cdot i\\ \mathbf{elif}\;a \cdot b \leq 10^{-87}:\\ \;\;\;\;x \cdot y\\ \mathbf{elif}\;a \cdot b \leq 5 \cdot 10^{+132}:\\ \;\;\;\;c \cdot i\\ \mathbf{else}:\\ \;\;\;\;a \cdot b\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 85.6% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \cdot y \leq -1 \cdot 10^{+170}:\\ \;\;\;\;\mathsf{fma}\left(i, c, x \cdot y\right)\\ \mathbf{elif}\;x \cdot y \leq 2 \cdot 10^{+50}:\\ \;\;\;\;\mathsf{fma}\left(b, a, \mathsf{fma}\left(i, c, t \cdot z\right)\right)\\ \mathbf{elif}\;x \cdot y \leq 5 \cdot 10^{+152}:\\ \;\;\;\;\mathsf{fma}\left(b, a, x \cdot y\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(z, t, x \cdot y\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c i)
 :precision binary64
 (if (<= (* x y) -1e+170)
   (fma i c (* x y))
   (if (<= (* x y) 2e+50)
     (fma b a (fma i c (* t z)))
     (if (<= (* x y) 5e+152) (fma b a (* x y)) (fma z t (* x y))))))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	double tmp;
	if ((x * y) <= -1e+170) {
		tmp = fma(i, c, (x * y));
	} else if ((x * y) <= 2e+50) {
		tmp = fma(b, a, fma(i, c, (t * z)));
	} else if ((x * y) <= 5e+152) {
		tmp = fma(b, a, (x * y));
	} else {
		tmp = fma(z, t, (x * y));
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b, c, i)
	tmp = 0.0
	if (Float64(x * y) <= -1e+170)
		tmp = fma(i, c, Float64(x * y));
	elseif (Float64(x * y) <= 2e+50)
		tmp = fma(b, a, fma(i, c, Float64(t * z)));
	elseif (Float64(x * y) <= 5e+152)
		tmp = fma(b, a, Float64(x * y));
	else
		tmp = fma(z, t, Float64(x * y));
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_] := If[LessEqual[N[(x * y), $MachinePrecision], -1e+170], N[(i * c + N[(x * y), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(x * y), $MachinePrecision], 2e+50], N[(b * a + N[(i * c + N[(t * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(x * y), $MachinePrecision], 5e+152], N[(b * a + N[(x * y), $MachinePrecision]), $MachinePrecision], N[(z * t + N[(x * y), $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 4 regimes

2. if (*.f64 x y) < -1.00000000000000003e170

   1. Initial program 91.8%

      \[\left(\left(x \cdot y + z \cdot t\right) + a \cdot b\right) + c \cdot i \]
   2. Add Preprocessing

   3. Taylor expanded in b around inf

      \[\leadsto \color{blue}{a \cdot b} + c \cdot i \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \color{blue}{b \cdot a} + c \cdot i \]

      2. lower-*.f64 29.1

         \[\leadsto \color{blue}{b \cdot a} + c \cdot i \]

   5. Applied rewrites 29.1%

      \[\leadsto \color{blue}{b \cdot a} + c \cdot i \]
   6. Step-by-step derivation

      1. lift-+.f64 N/A

         \[\leadsto \color{blue}{b \cdot a + c \cdot i} \]

      2. +-commutative N/A

         \[\leadsto \color{blue}{c \cdot i + b \cdot a} \]

      3. lift-*.f64 N/A

         \[\leadsto \color{blue}{c \cdot i} + b \cdot a \]

      4. *-commutative N/A

         \[\leadsto \color{blue}{i \cdot c} + b \cdot a \]

      5. lower-fma.f64 31.8

         \[\leadsto \color{blue}{\mathsf{fma}\left(i, c, b \cdot a\right)} \]

   7. Applied rewrites 31.8%

      \[\leadsto \color{blue}{\mathsf{fma}\left(i, c, a \cdot b\right)} \]

   8. Taylor expanded in x around inf

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

      1. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(i, c, \color{blue}{y \cdot x}\right) \]

      2. lower-*.f64 81.2

         \[\leadsto \mathsf{fma}\left(i, c, \color{blue}{y \cdot x}\right) \]

   10. Applied rewrites 81.2%

       \[\leadsto \mathsf{fma}\left(i, c, \color{blue}{y \cdot x}\right) \]

   if -1.00000000000000003e170 < (*.f64 x y) < 2.0000000000000002e50

   1. Initial program 99.4%

      \[\left(\left(x \cdot y + z \cdot t\right) + a \cdot b\right) + c \cdot i \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 93.0

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

   5. Applied rewrites 93.0%

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

   if 2.0000000000000002e50 < (*.f64 x y) < 5e152

   1. Initial program 99.9%

      \[\left(\left(x \cdot y + z \cdot t\right) + a \cdot b\right) + c \cdot i \]
   2. Add Preprocessing

   3. Taylor expanded in c around 0

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. +-commutative N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 N/A

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

      6. *-commutative N/A

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

      7. lower-*.f64 87.6

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

   5. Applied rewrites 87.6%

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

   6. Taylor expanded in t around 0

      \[\leadsto \mathsf{fma}\left(b, a, x \cdot y\right) \]
   7. Step-by-step derivation

   8. Applied rewrites 82.8%

      \[\leadsto \mathsf{fma}\left(b, a, y \cdot x\right) \]

   if 5e152 < (*.f64 x y)

   1. Initial program 87.1%

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

      1. lift-+.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. associate-+l+ N/A

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

      4. lift-+.f64 N/A

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

      5. +-commutative N/A

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

      6. associate-+l+ N/A

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

      7. lift-*.f64 N/A

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

      8. lower-fma.f64 N/A

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

      9. lift-*.f64 N/A

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

      10. *-commutative N/A

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

      11. lower-fma.f64 N/A

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

      12. +-commutative N/A

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

      13. lift-*.f64 N/A

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

      14. *-commutative N/A

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

      15. lower-fma.f64 90.3

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

      16. lift-*.f64 N/A

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

      17. *-commutative N/A

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

      18. lower-*.f64 90.3

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

   4. Applied rewrites 90.3%

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

   5. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 81.7

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

   7. Applied rewrites 81.7%

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

4. Final simplification 89.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \cdot y \leq -1 \cdot 10^{+170}:\\ \;\;\;\;\mathsf{fma}\left(i, c, x \cdot y\right)\\ \mathbf{elif}\;x \cdot y \leq 2 \cdot 10^{+50}:\\ \;\;\;\;\mathsf{fma}\left(b, a, \mathsf{fma}\left(i, c, t \cdot z\right)\right)\\ \mathbf{elif}\;x \cdot y \leq 5 \cdot 10^{+152}:\\ \;\;\;\;\mathsf{fma}\left(b, a, x \cdot y\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(z, t, x \cdot y\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 8: 67.0% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \mathsf{fma}\left(b, a, t \cdot z\right)\\ \mathbf{if}\;t \cdot z \leq -1.65 \cdot 10^{+132}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t \cdot z \leq -1.3 \cdot 10^{-140}:\\ \;\;\;\;\mathsf{fma}\left(b, a, x \cdot y\right)\\ \mathbf{elif}\;t \cdot z \leq 1.26 \cdot 10^{+16}:\\ \;\;\;\;\mathsf{fma}\left(i, c, a \cdot b\right)\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c i)
 :precision binary64
 (let* ((t_1 (fma b a (* t z))))
   (if (<= (* t z) -1.65e+132)
     t_1
     (if (<= (* t z) -1.3e-140)
       (fma b a (* x y))
       (if (<= (* t z) 1.26e+16) (fma i c (* a b)) t_1)))))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	double t_1 = fma(b, a, (t * z));
	double tmp;
	if ((t * z) <= -1.65e+132) {
		tmp = t_1;
	} else if ((t * z) <= -1.3e-140) {
		tmp = fma(b, a, (x * y));
	} else if ((t * z) <= 1.26e+16) {
		tmp = fma(i, c, (a * b));
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b, c, i)
	t_1 = fma(b, a, Float64(t * z))
	tmp = 0.0
	if (Float64(t * z) <= -1.65e+132)
		tmp = t_1;
	elseif (Float64(t * z) <= -1.3e-140)
		tmp = fma(b, a, Float64(x * y));
	elseif (Float64(t * z) <= 1.26e+16)
		tmp = fma(i, c, Float64(a * b));
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_] := Block[{t$95$1 = N[(b * a + N[(t * z), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(t * z), $MachinePrecision], -1.65e+132], t$95$1, If[LessEqual[N[(t * z), $MachinePrecision], -1.3e-140], N[(b * a + N[(x * y), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(t * z), $MachinePrecision], 1.26e+16], N[(i * c + N[(a * b), $MachinePrecision]), $MachinePrecision], t$95$1]]]]

Derivation

1. Split input into 3 regimes

2. if (*.f64 z t) < -1.65000000000000015e132 or 1.26e16 < (*.f64 z t)

   1. Initial program 94.6%

      \[\left(\left(x \cdot y + z \cdot t\right) + a \cdot b\right) + c \cdot i \]
   2. Add Preprocessing

   3. Taylor expanded in c around 0

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. +-commutative N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 N/A

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

      6. *-commutative N/A

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

      7. lower-*.f64 86.0

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

   5. Applied rewrites 86.0%

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

   6. Taylor expanded in t around inf

      \[\leadsto \mathsf{fma}\left(b, a, t \cdot z\right) \]
   7. Step-by-step derivation

   8. Applied rewrites 74.4%

      \[\leadsto \mathsf{fma}\left(b, a, z \cdot t\right) \]

   if -1.65000000000000015e132 < (*.f64 z t) < -1.2999999999999999e-140

   1. Initial program 100.0%

      \[\left(\left(x \cdot y + z \cdot t\right) + a \cdot b\right) + c \cdot i \]
   2. Add Preprocessing

   3. Taylor expanded in c around 0

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. +-commutative N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 N/A

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

      6. *-commutative N/A

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

      7. lower-*.f64 86.1

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

   5. Applied rewrites 86.1%

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

   6. Taylor expanded in t around 0

      \[\leadsto \mathsf{fma}\left(b, a, x \cdot y\right) \]
   7. Step-by-step derivation

   8. Applied rewrites 70.8%

      \[\leadsto \mathsf{fma}\left(b, a, y \cdot x\right) \]

   if -1.2999999999999999e-140 < (*.f64 z t) < 1.26e16

   1. Initial program 98.0%

      \[\left(\left(x \cdot y + z \cdot t\right) + a \cdot b\right) + c \cdot i \]
   2. Add Preprocessing

   3. Taylor expanded in b around inf

      \[\leadsto \color{blue}{a \cdot b} + c \cdot i \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \color{blue}{b \cdot a} + c \cdot i \]

      2. lower-*.f64 68.5

         \[\leadsto \color{blue}{b \cdot a} + c \cdot i \]

   5. Applied rewrites 68.5%

      \[\leadsto \color{blue}{b \cdot a} + c \cdot i \]
   6. Step-by-step derivation

      1. lift-+.f64 N/A

         \[\leadsto \color{blue}{b \cdot a + c \cdot i} \]

      2. +-commutative N/A

         \[\leadsto \color{blue}{c \cdot i + b \cdot a} \]

      3. lift-*.f64 N/A

         \[\leadsto \color{blue}{c \cdot i} + b \cdot a \]

      4. *-commutative N/A

         \[\leadsto \color{blue}{i \cdot c} + b \cdot a \]

      5. lower-fma.f64 69.5

         \[\leadsto \color{blue}{\mathsf{fma}\left(i, c, b \cdot a\right)} \]

   7. Applied rewrites 69.5%

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

4. Final simplification 71.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;t \cdot z \leq -1.65 \cdot 10^{+132}:\\ \;\;\;\;\mathsf{fma}\left(b, a, t \cdot z\right)\\ \mathbf{elif}\;t \cdot z \leq -1.3 \cdot 10^{-140}:\\ \;\;\;\;\mathsf{fma}\left(b, a, x \cdot y\right)\\ \mathbf{elif}\;t \cdot z \leq 1.26 \cdot 10^{+16}:\\ \;\;\;\;\mathsf{fma}\left(i, c, a \cdot b\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(b, a, t \cdot z\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 9: 88.1% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;c \cdot i \leq -1 \cdot 10^{+197}:\\ \;\;\;\;\mathsf{fma}\left(b, a, \mathsf{fma}\left(i, c, t \cdot z\right)\right)\\ \mathbf{elif}\;c \cdot i \leq 200000000:\\ \;\;\;\;\mathsf{fma}\left(b, a, \mathsf{fma}\left(y, x, t \cdot z\right)\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(z, t, \mathsf{fma}\left(y, x, c \cdot i\right)\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c i)
 :precision binary64
 (if (<= (* c i) -1e+197)
   (fma b a (fma i c (* t z)))
   (if (<= (* c i) 200000000.0)
     (fma b a (fma y x (* t z)))
     (fma z t (fma y x (* c i))))))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	double tmp;
	if ((c * i) <= -1e+197) {
		tmp = fma(b, a, fma(i, c, (t * z)));
	} else if ((c * i) <= 200000000.0) {
		tmp = fma(b, a, fma(y, x, (t * z)));
	} else {
		tmp = fma(z, t, fma(y, x, (c * i)));
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b, c, i)
	tmp = 0.0
	if (Float64(c * i) <= -1e+197)
		tmp = fma(b, a, fma(i, c, Float64(t * z)));
	elseif (Float64(c * i) <= 200000000.0)
		tmp = fma(b, a, fma(y, x, Float64(t * z)));
	else
		tmp = fma(z, t, fma(y, x, Float64(c * i)));
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_] := If[LessEqual[N[(c * i), $MachinePrecision], -1e+197], N[(b * a + N[(i * c + N[(t * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(c * i), $MachinePrecision], 200000000.0], N[(b * a + N[(y * x + N[(t * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(z * t + N[(y * x + N[(c * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if (*.f64 c i) < -9.9999999999999995e196

   1. Initial program 97.1%

      \[\left(\left(x \cdot y + z \cdot t\right) + a \cdot b\right) + c \cdot i \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 94.6

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

   5. Applied rewrites 94.6%

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

   if -9.9999999999999995e196 < (*.f64 c i) < 2e8

   1. Initial program 96.9%

      \[\left(\left(x \cdot y + z \cdot t\right) + a \cdot b\right) + c \cdot i \]
   2. Add Preprocessing

   3. Taylor expanded in c around 0

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. +-commutative N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 N/A

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

      6. *-commutative N/A

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

      7. lower-*.f64 95.7

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

   5. Applied rewrites 95.7%

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

   if 2e8 < (*.f64 c i)

   1. Initial program 96.7%

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

      1. lift-+.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. associate-+l+ N/A

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

      4. lift-+.f64 N/A

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

      5. +-commutative N/A

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

      6. associate-+l+ N/A

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

      7. lift-*.f64 N/A

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

      8. lower-fma.f64 N/A

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

      9. lift-*.f64 N/A

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

      10. *-commutative N/A

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

      11. lower-fma.f64 N/A

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

      12. +-commutative N/A

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

      13. lift-*.f64 N/A

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

      14. *-commutative N/A

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

      15. lower-fma.f64 98.4

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

      16. lift-*.f64 N/A

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

      17. *-commutative N/A

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

      18. lower-*.f64 98.4

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

   4. Applied rewrites 98.4%

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

   5. Taylor expanded in c around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 88.6

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

   7. Applied rewrites 88.6%

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

4. Final simplification 93.9%

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

Alternative 10: 87.8% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \mathsf{fma}\left(b, a, \mathsf{fma}\left(i, c, t \cdot z\right)\right)\\ \mathbf{if}\;c \cdot i \leq -1 \cdot 10^{+197}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;c \cdot i \leq 2 \cdot 10^{-29}:\\ \;\;\;\;\mathsf{fma}\left(b, a, \mathsf{fma}\left(y, x, t \cdot z\right)\right)\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c i)
 :precision binary64
 (let* ((t_1 (fma b a (fma i c (* t z)))))
   (if (<= (* c i) -1e+197)
     t_1
     (if (<= (* c i) 2e-29) (fma b a (fma y x (* t z))) t_1))))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	double t_1 = fma(b, a, fma(i, c, (t * z)));
	double tmp;
	if ((c * i) <= -1e+197) {
		tmp = t_1;
	} else if ((c * i) <= 2e-29) {
		tmp = fma(b, a, fma(y, x, (t * z)));
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b, c, i)
	t_1 = fma(b, a, fma(i, c, Float64(t * z)))
	tmp = 0.0
	if (Float64(c * i) <= -1e+197)
		tmp = t_1;
	elseif (Float64(c * i) <= 2e-29)
		tmp = fma(b, a, fma(y, x, Float64(t * z)));
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_] := Block[{t$95$1 = N[(b * a + N[(i * c + N[(t * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(c * i), $MachinePrecision], -1e+197], t$95$1, If[LessEqual[N[(c * i), $MachinePrecision], 2e-29], N[(b * a + N[(y * x + N[(t * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 c i) < -9.9999999999999995e196 or 1.99999999999999989e-29 < (*.f64 c i)

   1. Initial program 97.1%

      \[\left(\left(x \cdot y + z \cdot t\right) + a \cdot b\right) + c \cdot i \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 87.0

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

   5. Applied rewrites 87.0%

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

   if -9.9999999999999995e196 < (*.f64 c i) < 1.99999999999999989e-29

   1. Initial program 96.7%

      \[\left(\left(x \cdot y + z \cdot t\right) + a \cdot b\right) + c \cdot i \]
   2. Add Preprocessing

   3. Taylor expanded in c around 0

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. +-commutative N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 N/A

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

      6. *-commutative N/A

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

      7. lower-*.f64 96.2

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

   5. Applied rewrites 96.2%

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

4. Final simplification 92.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;c \cdot i \leq -1 \cdot 10^{+197}:\\ \;\;\;\;\mathsf{fma}\left(b, a, \mathsf{fma}\left(i, c, t \cdot z\right)\right)\\ \mathbf{elif}\;c \cdot i \leq 2 \cdot 10^{-29}:\\ \;\;\;\;\mathsf{fma}\left(b, a, \mathsf{fma}\left(y, x, t \cdot z\right)\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(b, a, \mathsf{fma}\left(i, c, t \cdot z\right)\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 11: 67.1% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \mathsf{fma}\left(b, a, t \cdot z\right)\\ \mathbf{if}\;t \cdot z \leq -1.65 \cdot 10^{+132}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t \cdot z \leq 2 \cdot 10^{+72}:\\ \;\;\;\;\mathsf{fma}\left(b, a, x \cdot y\right)\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c i)
 :precision binary64
 (let* ((t_1 (fma b a (* t z))))
   (if (<= (* t z) -1.65e+132)
     t_1
     (if (<= (* t z) 2e+72) (fma b a (* x y)) t_1))))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	double t_1 = fma(b, a, (t * z));
	double tmp;
	if ((t * z) <= -1.65e+132) {
		tmp = t_1;
	} else if ((t * z) <= 2e+72) {
		tmp = fma(b, a, (x * y));
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b, c, i)
	t_1 = fma(b, a, Float64(t * z))
	tmp = 0.0
	if (Float64(t * z) <= -1.65e+132)
		tmp = t_1;
	elseif (Float64(t * z) <= 2e+72)
		tmp = fma(b, a, Float64(x * y));
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_] := Block[{t$95$1 = N[(b * a + N[(t * z), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(t * z), $MachinePrecision], -1.65e+132], t$95$1, If[LessEqual[N[(t * z), $MachinePrecision], 2e+72], N[(b * a + N[(x * y), $MachinePrecision]), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 z t) < -1.65000000000000015e132 or 1.99999999999999989e72 < (*.f64 z t)

   1. Initial program 93.8%

      \[\left(\left(x \cdot y + z \cdot t\right) + a \cdot b\right) + c \cdot i \]
   2. Add Preprocessing

   3. Taylor expanded in c around 0

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. +-commutative N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 N/A

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

      6. *-commutative N/A

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

      7. lower-*.f64 86.1

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

   5. Applied rewrites 86.1%

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

   6. Taylor expanded in t around inf

      \[\leadsto \mathsf{fma}\left(b, a, t \cdot z\right) \]
   7. Step-by-step derivation

   8. Applied rewrites 77.9%

      \[\leadsto \mathsf{fma}\left(b, a, z \cdot t\right) \]

   if -1.65000000000000015e132 < (*.f64 z t) < 1.99999999999999989e72

   1. Initial program 98.7%

      \[\left(\left(x \cdot y + z \cdot t\right) + a \cdot b\right) + c \cdot i \]
   2. Add Preprocessing

   3. Taylor expanded in c around 0

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. +-commutative N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 N/A

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

      6. *-commutative N/A

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

      7. lower-*.f64 71.7

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

   5. Applied rewrites 71.7%

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

   6. Taylor expanded in t around 0

      \[\leadsto \mathsf{fma}\left(b, a, x \cdot y\right) \]
   7. Step-by-step derivation

   8. Applied rewrites 65.0%

      \[\leadsto \mathsf{fma}\left(b, a, y \cdot x\right) \]
3. Recombined 2 regimes into one program.

4. Final simplification 69.8%

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

Alternative 12: 63.6% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;t \cdot z \leq -8.5 \cdot 10^{+130}:\\ \;\;\;\;t \cdot z\\ \mathbf{elif}\;t \cdot z \leq 9.5 \cdot 10^{+202}:\\ \;\;\;\;\mathsf{fma}\left(b, a, x \cdot y\right)\\ \mathbf{else}:\\ \;\;\;\;t \cdot z\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c i)
 :precision binary64
 (if (<= (* t z) -8.5e+130)
   (* t z)
   (if (<= (* t z) 9.5e+202) (fma b a (* x y)) (* t z))))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	double tmp;
	if ((t * z) <= -8.5e+130) {
		tmp = t * z;
	} else if ((t * z) <= 9.5e+202) {
		tmp = fma(b, a, (x * y));
	} else {
		tmp = t * z;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b, c, i)
	tmp = 0.0
	if (Float64(t * z) <= -8.5e+130)
		tmp = Float64(t * z);
	elseif (Float64(t * z) <= 9.5e+202)
		tmp = fma(b, a, Float64(x * y));
	else
		tmp = Float64(t * z);
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_] := If[LessEqual[N[(t * z), $MachinePrecision], -8.5e+130], N[(t * z), $MachinePrecision], If[LessEqual[N[(t * z), $MachinePrecision], 9.5e+202], N[(b * a + N[(x * y), $MachinePrecision]), $MachinePrecision], N[(t * z), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 z t) < -8.49999999999999965e130 or 9.50000000000000059e202 < (*.f64 z t)

   1. Initial program 91.9%

      \[\left(\left(x \cdot y + z \cdot t\right) + a \cdot b\right) + c \cdot i \]
   2. Add Preprocessing

   3. Taylor expanded in t around inf

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

      1. *-commutative N/A

         \[\leadsto \color{blue}{z \cdot t} \]

      2. lower-*.f64 74.8

         \[\leadsto \color{blue}{z \cdot t} \]

   5. Applied rewrites 74.8%

      \[\leadsto \color{blue}{z \cdot t} \]

   if -8.49999999999999965e130 < (*.f64 z t) < 9.50000000000000059e202

   1. Initial program 98.9%

      \[\left(\left(x \cdot y + z \cdot t\right) + a \cdot b\right) + c \cdot i \]
   2. Add Preprocessing

   3. Taylor expanded in c around 0

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. +-commutative N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 N/A

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

      6. *-commutative N/A

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

      7. lower-*.f64 73.5

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

   5. Applied rewrites 73.5%

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

   6. Taylor expanded in t around 0

      \[\leadsto \mathsf{fma}\left(b, a, x \cdot y\right) \]
   7. Step-by-step derivation

   8. Applied rewrites 62.6%

      \[\leadsto \mathsf{fma}\left(b, a, y \cdot x\right) \]
3. Recombined 2 regimes into one program.

4. Final simplification 66.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;t \cdot z \leq -8.5 \cdot 10^{+130}:\\ \;\;\;\;t \cdot z\\ \mathbf{elif}\;t \cdot z \leq 9.5 \cdot 10^{+202}:\\ \;\;\;\;\mathsf{fma}\left(b, a, x \cdot y\right)\\ \mathbf{else}:\\ \;\;\;\;t \cdot z\\ \end{array} \]
5. Add Preprocessing

Alternative 13: 41.3% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \cdot b \leq -5 \cdot 10^{+203}:\\ \;\;\;\;a \cdot b\\ \mathbf{elif}\;a \cdot b \leq 5 \cdot 10^{+132}:\\ \;\;\;\;c \cdot i\\ \mathbf{else}:\\ \;\;\;\;a \cdot b\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c i)
 :precision binary64
 (if (<= (* a b) -5e+203) (* a b) (if (<= (* a b) 5e+132) (* c i) (* a b))))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	double tmp;
	if ((a * b) <= -5e+203) {
		tmp = a * b;
	} else if ((a * b) <= 5e+132) {
		tmp = c * i;
	} else {
		tmp = a * b;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b, c, i)
    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), intent (in) :: i
    real(8) :: tmp
    if ((a * b) <= (-5d+203)) then
        tmp = a * b
    else if ((a * b) <= 5d+132) then
        tmp = c * i
    else
        tmp = a * b
    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 i) {
	double tmp;
	if ((a * b) <= -5e+203) {
		tmp = a * b;
	} else if ((a * b) <= 5e+132) {
		tmp = c * i;
	} else {
		tmp = a * b;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b, c, i):
	tmp = 0
	if (a * b) <= -5e+203:
		tmp = a * b
	elif (a * b) <= 5e+132:
		tmp = c * i
	else:
		tmp = a * b
	return tmp

Julia

function code(x, y, z, t, a, b, c, i)
	tmp = 0.0
	if (Float64(a * b) <= -5e+203)
		tmp = Float64(a * b);
	elseif (Float64(a * b) <= 5e+132)
		tmp = Float64(c * i);
	else
		tmp = Float64(a * b);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b, c, i)
	tmp = 0.0;
	if ((a * b) <= -5e+203)
		tmp = a * b;
	elseif ((a * b) <= 5e+132)
		tmp = c * i;
	else
		tmp = a * b;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_] := If[LessEqual[N[(a * b), $MachinePrecision], -5e+203], N[(a * b), $MachinePrecision], If[LessEqual[N[(a * b), $MachinePrecision], 5e+132], N[(c * i), $MachinePrecision], N[(a * b), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 a b) < -4.99999999999999994e203 or 5.0000000000000001e132 < (*.f64 a b)

   1. Initial program 96.3%

      \[\left(\left(x \cdot y + z \cdot t\right) + a \cdot b\right) + c \cdot i \]
   2. Add Preprocessing

   3. Taylor expanded in b around inf

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

      1. *-commutative N/A

         \[\leadsto \color{blue}{b \cdot a} \]

      2. lower-*.f64 89.3

         \[\leadsto \color{blue}{b \cdot a} \]

   5. Applied rewrites 89.3%

      \[\leadsto \color{blue}{b \cdot a} \]

   if -4.99999999999999994e203 < (*.f64 a b) < 5.0000000000000001e132

   1. Initial program 97.0%

      \[\left(\left(x \cdot y + z \cdot t\right) + a \cdot b\right) + c \cdot i \]
   2. Add Preprocessing

   3. Taylor expanded in c around inf

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

      1. *-commutative N/A

         \[\leadsto \color{blue}{i \cdot c} \]

      2. lower-*.f64 28.6

         \[\leadsto \color{blue}{i \cdot c} \]

   5. Applied rewrites 28.6%

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

4. Final simplification 41.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;a \cdot b \leq -5 \cdot 10^{+203}:\\ \;\;\;\;a \cdot b\\ \mathbf{elif}\;a \cdot b \leq 5 \cdot 10^{+132}:\\ \;\;\;\;c \cdot i\\ \mathbf{else}:\\ \;\;\;\;a \cdot b\\ \end{array} \]
5. Add Preprocessing

Alternative 14: 26.9% accurate, 5.0× speedup

Math

\[\begin{array}{l} \\ a \cdot b \end{array} \]

FPCore

(FPCore (x y z t a b c i) :precision binary64 (* a b))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	return a * b;
}

Fortran

real(8) function code(x, y, z, t, a, b, c, i)
    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), intent (in) :: i
    code = a * b
end function

Java

public static double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	return a * b;
}

Python

def code(x, y, z, t, a, b, c, i):
	return a * b

Julia

function code(x, y, z, t, a, b, c, i)
	return Float64(a * b)
end

MATLAB

function tmp = code(x, y, z, t, a, b, c, i)
	tmp = a * b;
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_] := N[(a * b), $MachinePrecision]

Derivation

1. Initial program 96.9%

   \[\left(\left(x \cdot y + z \cdot t\right) + a \cdot b\right) + c \cdot i \]
2. Add Preprocessing

3. Taylor expanded in b around inf

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

   1. *-commutative N/A

      \[\leadsto \color{blue}{b \cdot a} \]

   2. lower-*.f64 25.5

      \[\leadsto \color{blue}{b \cdot a} \]

5. Applied rewrites 25.5%

   \[\leadsto \color{blue}{b \cdot a} \]

6. Final simplification 25.5%

   \[\leadsto a \cdot b \]
7. Add Preprocessing

Reproduce

herbie shell --seed 2024276 
(FPCore (x y z t a b c i)
  :name "Linear.V4:$cdot from linear-1.19.1.3, C"
  :precision binary64
  (+ (+ (+ (* x y) (* z t)) (* a b)) (* c i)))