Diagrams.Solve.Polynomial:quartForm from diagrams-solve-0.1, C

Percentage Accurate: 97.6% → 98.5%

Time: 11.8s

Alternatives: 15

Speedup: 1.6×

• 33.4% 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 + \frac{z \cdot t}{16}\right) - \frac{a \cdot b}{4}\right) + c \end{array} \]

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 97.6% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 98.5% accurate, 1.4× speedup

Math

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

FPCore

(FPCore (x y z t a b c)
 :precision binary64
 (fma (* t 0.0625) z (- (* x y) (fma a (* b 0.25) (- c)))))

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 97.6%

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

   1. lift-+.f64 N/A

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

   2. lift--.f64 N/A

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

   3. associate-+l- N/A

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

   4. lift-+.f64 N/A

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

   5. +-commutative N/A

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

   6. associate--l+ N/A

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

   7. lift-/.f64 N/A

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

   8. lift-*.f64 N/A

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

   9. associate-/l* N/A

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

   10. *-commutative N/A

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

   11. lower-fma.f64 N/A

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

   12. div-inv N/A

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

   13. lower-*.f64 N/A

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

   14. metadata-eval N/A

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

   15. lower--.f64 N/A

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

   16. sub-neg N/A

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

   17. lift-/.f64 N/A

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

   18. lift-*.f64 N/A

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

   19. associate-/l* N/A

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

   20. lower-fma.f64 N/A

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

4. Applied rewrites 99.2%

   \[\leadsto \color{blue}{\mathsf{fma}\left(t \cdot 0.0625, z, x \cdot y - \mathsf{fma}\left(a, b \cdot 0.25, -c\right)\right)} \]
5. Add Preprocessing

Alternative 2: 86.3% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (x y z t a b c)
 :precision binary64
 (let* ((t_1 (fma (* t 0.0625) z (* b (* a -0.25)))))
   (if (<= (* t z) -1e+66)
     t_1
     (if (<= (* t z) 2e-11)
       (fma a (* b -0.25) (fma x y c))
       (if (<= (* t z) 2e+140) (fma (* t 0.0625) z (fma x y c)) t_1)))))

C

double code(double x, double y, double z, double t, double a, double b, double c) {
	double t_1 = fma((t * 0.0625), z, (b * (a * -0.25)));
	double tmp;
	if ((t * z) <= -1e+66) {
		tmp = t_1;
	} else if ((t * z) <= 2e-11) {
		tmp = fma(a, (b * -0.25), fma(x, y, c));
	} else if ((t * z) <= 2e+140) {
		tmp = fma((t * 0.0625), z, fma(x, y, c));
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b, c)
	t_1 = fma(Float64(t * 0.0625), z, Float64(b * Float64(a * -0.25)))
	tmp = 0.0
	if (Float64(t * z) <= -1e+66)
		tmp = t_1;
	elseif (Float64(t * z) <= 2e-11)
		tmp = fma(a, Float64(b * -0.25), fma(x, y, c));
	elseif (Float64(t * z) <= 2e+140)
		tmp = fma(Float64(t * 0.0625), z, fma(x, y, c));
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (*.f64 z t) < -9.99999999999999945e65 or 2.00000000000000012e140 < (*.f64 z t)

   1. Initial program 93.1%

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

      1. lift-+.f64 N/A

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

      2. lift--.f64 N/A

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

      3. associate-+l- N/A

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

      4. lift-+.f64 N/A

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

      5. +-commutative N/A

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

      6. associate--l+ N/A

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

      7. lift-/.f64 N/A

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

      8. lift-*.f64 N/A

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

      9. associate-/l* N/A

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

      10. *-commutative N/A

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

      11. lower-fma.f64 N/A

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

      12. div-inv N/A

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

      13. lower-*.f64 N/A

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

      14. metadata-eval N/A

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

      15. lower--.f64 N/A

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

      16. sub-neg N/A

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

      17. lift-/.f64 N/A

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

      18. lift-*.f64 N/A

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

      19. associate-/l* N/A

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

      20. lower-fma.f64 N/A

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

   4. Applied rewrites 97.7%

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

   5. Taylor expanded in a around inf

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

      1. associate-*r* N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 90.0

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

   7. Applied rewrites 90.0%

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

   if -9.99999999999999945e65 < (*.f64 z t) < 1.99999999999999988e-11

   1. Initial program 100.0%

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

   3. Taylor expanded in z around 0

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

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

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

      2. metadata-eval N/A

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

      3. +-commutative N/A

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

      4. *-commutative N/A

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

      5. associate-*l* N/A

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

      6. *-commutative N/A

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

      7. lower-fma.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. +-commutative N/A

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

      11. lower-fma.f64 99.2

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

   5. Applied rewrites 99.2%

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

   if 1.99999999999999988e-11 < (*.f64 z t) < 2.00000000000000012e140

   1. Initial program 99.9%

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

      1. lift-+.f64 N/A

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

      2. lift--.f64 N/A

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

      3. associate-+l- N/A

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

      4. lift-+.f64 N/A

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

      5. +-commutative N/A

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

      6. associate--l+ N/A

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

      7. lift-/.f64 N/A

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

      8. lift-*.f64 N/A

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

      9. associate-/l* N/A

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

      10. *-commutative N/A

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

      11. lower-fma.f64 N/A

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

      12. div-inv N/A

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

      13. lower-*.f64 N/A

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

      14. metadata-eval N/A

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

      15. lower--.f64 N/A

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

      16. sub-neg N/A

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

      17. lift-/.f64 N/A

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

      18. lift-*.f64 N/A

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

      19. associate-/l* N/A

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

      20. lower-fma.f64 N/A

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

   4. Applied rewrites 100.0%

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

   5. Taylor expanded in a around 0

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

      1. +-commutative N/A

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

      2. lower-fma.f64 91.4

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

   7. Applied rewrites 91.4%

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

4. Final simplification 95.3%

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

Alternative 3: 86.2% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (x y z t a b c)
 :precision binary64
 (let* ((t_1 (fma a (* b -0.25) (* 0.0625 (* t z)))))
   (if (<= (* t z) -1e+66)
     t_1
     (if (<= (* t z) 2e-11)
       (fma a (* b -0.25) (fma x y c))
       (if (<= (* t z) 2e+140) (fma (* t 0.0625) z (fma x y c)) t_1)))))

C

double code(double x, double y, double z, double t, double a, double b, double c) {
	double t_1 = fma(a, (b * -0.25), (0.0625 * (t * z)));
	double tmp;
	if ((t * z) <= -1e+66) {
		tmp = t_1;
	} else if ((t * z) <= 2e-11) {
		tmp = fma(a, (b * -0.25), fma(x, y, c));
	} else if ((t * z) <= 2e+140) {
		tmp = fma((t * 0.0625), z, fma(x, y, c));
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b, c)
	t_1 = fma(a, Float64(b * -0.25), Float64(0.0625 * Float64(t * z)))
	tmp = 0.0
	if (Float64(t * z) <= -1e+66)
		tmp = t_1;
	elseif (Float64(t * z) <= 2e-11)
		tmp = fma(a, Float64(b * -0.25), fma(x, y, c));
	elseif (Float64(t * z) <= 2e+140)
		tmp = fma(Float64(t * 0.0625), z, fma(x, y, c));
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (*.f64 z t) < -9.99999999999999945e65 or 2.00000000000000012e140 < (*.f64 z t)

   1. Initial program 93.1%

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

   3. Taylor expanded in x around inf

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

      1. lower-*.f64 14.4

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

   5. Applied rewrites 14.4%

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

   6. Taylor expanded in x around 0

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

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

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

      2. metadata-eval N/A

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

      3. +-commutative N/A

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

      4. *-commutative N/A

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

      5. associate-*r* N/A

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

      6. *-commutative N/A

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

      7. lower-fma.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. +-commutative N/A

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

      11. lower-fma.f64 N/A

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

      12. lower-*.f64 91.0

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

   8. Applied rewrites 91.0%

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

   9. Taylor expanded in t around inf

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

   11. Applied rewrites 87.8%

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

   if -9.99999999999999945e65 < (*.f64 z t) < 1.99999999999999988e-11

   1. Initial program 100.0%

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

   3. Taylor expanded in z around 0

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

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

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

      2. metadata-eval N/A

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

      3. +-commutative N/A

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

      4. *-commutative N/A

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

      5. associate-*l* N/A

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

      6. *-commutative N/A

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

      7. lower-fma.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. +-commutative N/A

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

      11. lower-fma.f64 99.2

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

   5. Applied rewrites 99.2%

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

   if 1.99999999999999988e-11 < (*.f64 z t) < 2.00000000000000012e140

   1. Initial program 99.9%

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

      1. lift-+.f64 N/A

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

      2. lift--.f64 N/A

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

      3. associate-+l- N/A

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

      4. lift-+.f64 N/A

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

      5. +-commutative N/A

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

      6. associate--l+ N/A

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

      7. lift-/.f64 N/A

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

      8. lift-*.f64 N/A

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

      9. associate-/l* N/A

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

      10. *-commutative N/A

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

      11. lower-fma.f64 N/A

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

      12. div-inv N/A

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

      13. lower-*.f64 N/A

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

      14. metadata-eval N/A

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

      15. lower--.f64 N/A

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

      16. sub-neg N/A

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

      17. lift-/.f64 N/A

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

      18. lift-*.f64 N/A

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

      19. associate-/l* N/A

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

      20. lower-fma.f64 N/A

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

   4. Applied rewrites 100.0%

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

   5. Taylor expanded in a around 0

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

      1. +-commutative N/A

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

      2. lower-fma.f64 91.4

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

   7. Applied rewrites 91.4%

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

4. Final simplification 94.6%

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

Alternative 4: 67.8% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \mathsf{fma}\left(a, b \cdot -0.25, x \cdot y\right)\\ \mathbf{if}\;x \cdot y \leq -5 \cdot 10^{+107}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;x \cdot y \leq -5 \cdot 10^{-60}:\\ \;\;\;\;\mathsf{fma}\left(0.0625 \cdot z, t, c\right)\\ \mathbf{elif}\;x \cdot y \leq 10^{+21}:\\ \;\;\;\;\mathsf{fma}\left(b, a \cdot -0.25, c\right)\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c)
 :precision binary64
 (let* ((t_1 (fma a (* b -0.25) (* x y))))
   (if (<= (* x y) -5e+107)
     t_1
     (if (<= (* x y) -5e-60)
       (fma (* 0.0625 z) t c)
       (if (<= (* x y) 1e+21) (fma b (* a -0.25) c) t_1)))))

C

double code(double x, double y, double z, double t, double a, double b, double c) {
	double t_1 = fma(a, (b * -0.25), (x * y));
	double tmp;
	if ((x * y) <= -5e+107) {
		tmp = t_1;
	} else if ((x * y) <= -5e-60) {
		tmp = fma((0.0625 * z), t, c);
	} else if ((x * y) <= 1e+21) {
		tmp = fma(b, (a * -0.25), c);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b, c)
	t_1 = fma(a, Float64(b * -0.25), Float64(x * y))
	tmp = 0.0
	if (Float64(x * y) <= -5e+107)
		tmp = t_1;
	elseif (Float64(x * y) <= -5e-60)
		tmp = fma(Float64(0.0625 * z), t, c);
	elseif (Float64(x * y) <= 1e+21)
		tmp = fma(b, Float64(a * -0.25), c);
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(a * N[(b * -0.25), $MachinePrecision] + N[(x * y), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(x * y), $MachinePrecision], -5e+107], t$95$1, If[LessEqual[N[(x * y), $MachinePrecision], -5e-60], N[(N[(0.0625 * z), $MachinePrecision] * t + c), $MachinePrecision], If[LessEqual[N[(x * y), $MachinePrecision], 1e+21], N[(b * N[(a * -0.25), $MachinePrecision] + c), $MachinePrecision], t$95$1]]]]

Derivation

1. Split input into 3 regimes

2. if (*.f64 x y) < -5.0000000000000002e107 or 1e21 < (*.f64 x y)

   1. Initial program 96.3%

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

   3. Taylor expanded in z around 0

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

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

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

      2. metadata-eval N/A

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

      3. +-commutative N/A

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

      4. *-commutative N/A

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

      5. associate-*l* N/A

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

      6. *-commutative N/A

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

      7. lower-fma.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. +-commutative N/A

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

      11. lower-fma.f64 87.0

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

   5. Applied rewrites 87.0%

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

   6. Taylor expanded in x around inf

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

   8. Applied rewrites 79.2%

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

   if -5.0000000000000002e107 < (*.f64 x y) < -5.0000000000000001e-60

   1. Initial program 99.9%

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

   3. Taylor expanded in x around inf

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

      1. lower-*.f64 10.5

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

   5. Applied rewrites 10.5%

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

   6. Taylor expanded in x around 0

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

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

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

      2. metadata-eval N/A

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

      3. +-commutative N/A

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

      4. *-commutative N/A

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

      5. associate-*r* N/A

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

      6. *-commutative N/A

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

      7. lower-fma.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. +-commutative N/A

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

      11. lower-fma.f64 N/A

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

      12. lower-*.f64 92.5

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

   8. Applied rewrites 92.5%

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

   9. Taylor expanded in a around 0

      \[\leadsto c + \color{blue}{\frac{1}{16} \cdot \left(t \cdot z\right)} \]
   10. Step-by-step derivation

   11. Applied rewrites 71.5%

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

   13. Applied rewrites 71.5%

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

   if -5.0000000000000001e-60 < (*.f64 x y) < 1e21

   1. Initial program 98.1%

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

   3. Taylor expanded in z around 0

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

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

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

      2. metadata-eval N/A

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

      3. +-commutative N/A

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

      4. *-commutative N/A

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

      5. associate-*l* N/A

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

      6. *-commutative N/A

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

      7. lower-fma.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. +-commutative N/A

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

      11. lower-fma.f64 79.1

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

   5. Applied rewrites 79.1%

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

   6. Taylor expanded in x around 0

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

   8. Applied rewrites 77.3%

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

Alternative 5: 65.7% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y z t a b c)
 :precision binary64
 (let* ((t_1 (fma b (* a -0.25) c)))
   (if (<= (* a b) -1e+74)
     t_1
     (if (<= (* a b) -5e-144)
       (fma 0.0625 (* t z) c)
       (if (<= (* a b) 2e+118) (fma x y c) t_1)))))

C

double code(double x, double y, double z, double t, double a, double b, double c) {
	double t_1 = fma(b, (a * -0.25), c);
	double tmp;
	if ((a * b) <= -1e+74) {
		tmp = t_1;
	} else if ((a * b) <= -5e-144) {
		tmp = fma(0.0625, (t * z), c);
	} else if ((a * b) <= 2e+118) {
		tmp = fma(x, y, c);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b, c)
	t_1 = fma(b, Float64(a * -0.25), c)
	tmp = 0.0
	if (Float64(a * b) <= -1e+74)
		tmp = t_1;
	elseif (Float64(a * b) <= -5e-144)
		tmp = fma(0.0625, Float64(t * z), c);
	elseif (Float64(a * b) <= 2e+118)
		tmp = fma(x, y, c);
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(b * N[(a * -0.25), $MachinePrecision] + c), $MachinePrecision]}, If[LessEqual[N[(a * b), $MachinePrecision], -1e+74], t$95$1, If[LessEqual[N[(a * b), $MachinePrecision], -5e-144], N[(0.0625 * N[(t * z), $MachinePrecision] + c), $MachinePrecision], If[LessEqual[N[(a * b), $MachinePrecision], 2e+118], N[(x * y + c), $MachinePrecision], t$95$1]]]]

Derivation

1. Split input into 3 regimes

2. if (*.f64 a b) < -9.99999999999999952e73 or 1.99999999999999993e118 < (*.f64 a b)

   1. Initial program 94.6%

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

   3. Taylor expanded in z around 0

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

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

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

      2. metadata-eval N/A

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

      3. +-commutative N/A

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

      4. *-commutative N/A

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

      5. associate-*l* N/A

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

      6. *-commutative N/A

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

      7. lower-fma.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. +-commutative N/A

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

      11. lower-fma.f64 84.7

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

   5. Applied rewrites 84.7%

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

   6. Taylor expanded in x around 0

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

   8. Applied rewrites 73.6%

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

   if -9.99999999999999952e73 < (*.f64 a b) < -4.9999999999999998e-144

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf

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

      1. lower-*.f64 25.7

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

   5. Applied rewrites 25.7%

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

   6. Taylor expanded in x around 0

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

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

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

      2. metadata-eval N/A

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

      3. +-commutative N/A

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

      4. *-commutative N/A

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

      5. associate-*r* N/A

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

      6. *-commutative N/A

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

      7. lower-fma.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. +-commutative N/A

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

      11. lower-fma.f64 N/A

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

      12. lower-*.f64 79.2

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

   8. Applied rewrites 79.2%

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

   9. Taylor expanded in a around 0

      \[\leadsto c + \color{blue}{\frac{1}{16} \cdot \left(t \cdot z\right)} \]
   10. Step-by-step derivation

   11. Applied rewrites 72.9%

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

   if -4.9999999999999998e-144 < (*.f64 a b) < 1.99999999999999993e118

   1. Initial program 100.0%

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

   3. Taylor expanded in z around 0

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

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

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

      2. metadata-eval N/A

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

      3. +-commutative N/A

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

      4. *-commutative N/A

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

      5. associate-*l* N/A

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

      6. *-commutative N/A

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

      7. lower-fma.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. +-commutative N/A

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

      11. lower-fma.f64 79.3

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

   5. Applied rewrites 79.3%

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

   6. Taylor expanded in a around 0

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

   8. Applied rewrites 73.6%

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

Alternative 6: 90.1% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y z t a b c)
 :precision binary64
 (let* ((t_1 (fma a (* b -0.25) (fma 0.0625 (* t z) c))))
   (if (<= (* t z) -1e+66)
     t_1
     (if (<= (* t z) 1e+84) (fma a (* b -0.25) (fma x y c)) t_1))))

C

double code(double x, double y, double z, double t, double a, double b, double c) {
	double t_1 = fma(a, (b * -0.25), fma(0.0625, (t * z), c));
	double tmp;
	if ((t * z) <= -1e+66) {
		tmp = t_1;
	} else if ((t * z) <= 1e+84) {
		tmp = fma(a, (b * -0.25), fma(x, y, c));
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b, c)
	t_1 = fma(a, Float64(b * -0.25), fma(0.0625, Float64(t * z), c))
	tmp = 0.0
	if (Float64(t * z) <= -1e+66)
		tmp = t_1;
	elseif (Float64(t * z) <= 1e+84)
		tmp = fma(a, Float64(b * -0.25), fma(x, y, c));
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 z t) < -9.99999999999999945e65 or 1.00000000000000006e84 < (*.f64 z t)

   1. Initial program 93.8%

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

   3. Taylor expanded in x around inf

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

      1. lower-*.f64 14.3

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

   5. Applied rewrites 14.3%

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

   6. Taylor expanded in x around 0

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

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

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

      2. metadata-eval N/A

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

      3. +-commutative N/A

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

      4. *-commutative N/A

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

      5. associate-*r* N/A

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

      6. *-commutative N/A

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

      7. lower-fma.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. +-commutative N/A

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

      11. lower-fma.f64 N/A

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

      12. lower-*.f64 90.8

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

   8. Applied rewrites 90.8%

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

   if -9.99999999999999945e65 < (*.f64 z t) < 1.00000000000000006e84

   1. Initial program 100.0%

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

   3. Taylor expanded in z around 0

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

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

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

      2. metadata-eval N/A

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

      3. +-commutative N/A

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

      4. *-commutative N/A

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

      5. associate-*l* N/A

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

      6. *-commutative N/A

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

      7. lower-fma.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. +-commutative N/A

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

      11. lower-fma.f64 97.3

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

   5. Applied rewrites 97.3%

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

4. Final simplification 94.9%

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

Alternative 7: 88.2% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y z t a b c)
 :precision binary64
 (if (<= (* t z) -1e+66)
   (fma (* t 0.0625) z (* b (* a -0.25)))
   (if (<= (* t z) 1e+84)
     (fma a (* b -0.25) (fma x y c))
     (fma 0.0625 (* t z) (fma a (* b -0.25) c)))))

C

double code(double x, double y, double z, double t, double a, double b, double c) {
	double tmp;
	if ((t * z) <= -1e+66) {
		tmp = fma((t * 0.0625), z, (b * (a * -0.25)));
	} else if ((t * z) <= 1e+84) {
		tmp = fma(a, (b * -0.25), fma(x, y, c));
	} else {
		tmp = fma(0.0625, (t * z), fma(a, (b * -0.25), c));
	}
	return tmp;
}

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (*.f64 z t) < -9.99999999999999945e65

   1. Initial program 94.5%

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

      1. lift-+.f64 N/A

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

      2. lift--.f64 N/A

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

      3. associate-+l- N/A

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

      4. lift-+.f64 N/A

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

      5. +-commutative N/A

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

      6. associate--l+ N/A

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

      7. lift-/.f64 N/A

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

      8. lift-*.f64 N/A

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

      9. associate-/l* N/A

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

      10. *-commutative N/A

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

      11. lower-fma.f64 N/A

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

      12. div-inv N/A

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

      13. lower-*.f64 N/A

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

      14. metadata-eval N/A

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

      15. lower--.f64 N/A

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

      16. sub-neg N/A

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

      17. lift-/.f64 N/A

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

      18. lift-*.f64 N/A

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

      19. associate-/l* N/A

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

      20. lower-fma.f64 N/A

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

   4. Applied rewrites 98.2%

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

   5. Taylor expanded in a around inf

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

      1. associate-*r* N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 89.4

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

   7. Applied rewrites 89.4%

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

   if -9.99999999999999945e65 < (*.f64 z t) < 1.00000000000000006e84

   1. Initial program 100.0%

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

   3. Taylor expanded in z around 0

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

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

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

      2. metadata-eval N/A

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

      3. +-commutative N/A

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

      4. *-commutative N/A

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

      5. associate-*l* N/A

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

      6. *-commutative N/A

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

      7. lower-fma.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. +-commutative N/A

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

      11. lower-fma.f64 97.3

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

   5. Applied rewrites 97.3%

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

   if 1.00000000000000006e84 < (*.f64 z t)

   1. Initial program 92.7%

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

   3. Taylor expanded in x around 0

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

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

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

      2. +-commutative N/A

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

      3. metadata-eval N/A

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

      4. associate-+l+ N/A

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

      5. lower-fma.f64 N/A

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

      6. lower-*.f64 N/A

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

      7. +-commutative N/A

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

      8. *-commutative N/A

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

      9. associate-*l* N/A

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

      10. *-commutative N/A

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

      11. lower-fma.f64 N/A

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

      12. *-commutative N/A

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

      13. lower-*.f64 90.4

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

   5. Applied rewrites 90.4%

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

4. Final simplification 94.5%

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

Alternative 8: 63.6% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := a \cdot \left(b \cdot -0.25\right)\\ \mathbf{if}\;a \cdot b \leq -5 \cdot 10^{+180}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;a \cdot b \leq -5 \cdot 10^{-144}:\\ \;\;\;\;\mathsf{fma}\left(0.0625, t \cdot z, c\right)\\ \mathbf{elif}\;a \cdot b \leq 5 \cdot 10^{+198}:\\ \;\;\;\;\mathsf{fma}\left(x, y, c\right)\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c)
 :precision binary64
 (let* ((t_1 (* a (* b -0.25))))
   (if (<= (* a b) -5e+180)
     t_1
     (if (<= (* a b) -5e-144)
       (fma 0.0625 (* t z) c)
       (if (<= (* a b) 5e+198) (fma x y c) t_1)))))

C

double code(double x, double y, double z, double t, double a, double b, double c) {
	double t_1 = a * (b * -0.25);
	double tmp;
	if ((a * b) <= -5e+180) {
		tmp = t_1;
	} else if ((a * b) <= -5e-144) {
		tmp = fma(0.0625, (t * z), c);
	} else if ((a * b) <= 5e+198) {
		tmp = fma(x, y, c);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b, c)
	t_1 = Float64(a * Float64(b * -0.25))
	tmp = 0.0
	if (Float64(a * b) <= -5e+180)
		tmp = t_1;
	elseif (Float64(a * b) <= -5e-144)
		tmp = fma(0.0625, Float64(t * z), c);
	elseif (Float64(a * b) <= 5e+198)
		tmp = fma(x, y, c);
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(a * N[(b * -0.25), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(a * b), $MachinePrecision], -5e+180], t$95$1, If[LessEqual[N[(a * b), $MachinePrecision], -5e-144], N[(0.0625 * N[(t * z), $MachinePrecision] + c), $MachinePrecision], If[LessEqual[N[(a * b), $MachinePrecision], 5e+198], N[(x * y + c), $MachinePrecision], t$95$1]]]]

Derivation

1. Split input into 3 regimes

2. if (*.f64 a b) < -4.9999999999999996e180 or 5.00000000000000049e198 < (*.f64 a b)

   1. Initial program 91.8%

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

   3. Taylor expanded in a around inf

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

      1. *-commutative N/A

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

      2. associate-*l* N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 81.1

         \[\leadsto a \cdot \color{blue}{\left(b \cdot -0.25\right)} \]

   5. Applied rewrites 81.1%

      \[\leadsto \color{blue}{a \cdot \left(b \cdot -0.25\right)} \]

   if -4.9999999999999996e180 < (*.f64 a b) < -4.9999999999999998e-144

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf

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

      1. lower-*.f64 24.7

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

   5. Applied rewrites 24.7%

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

   6. Taylor expanded in x around 0

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

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

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

      2. metadata-eval N/A

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

      3. +-commutative N/A

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

      4. *-commutative N/A

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

      5. associate-*r* N/A

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

      6. *-commutative N/A

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

      7. lower-fma.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. +-commutative N/A

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

      11. lower-fma.f64 N/A

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

      12. lower-*.f64 80.8

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

   8. Applied rewrites 80.8%

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

   9. Taylor expanded in a around 0

      \[\leadsto c + \color{blue}{\frac{1}{16} \cdot \left(t \cdot z\right)} \]
   10. Step-by-step derivation

   11. Applied rewrites 64.1%

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

   if -4.9999999999999998e-144 < (*.f64 a b) < 5.00000000000000049e198

   1. Initial program 100.0%

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

   3. Taylor expanded in z around 0

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

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

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

      2. metadata-eval N/A

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

      3. +-commutative N/A

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

      4. *-commutative N/A

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

      5. associate-*l* N/A

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

      6. *-commutative N/A

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

      7. lower-fma.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. +-commutative N/A

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

      11. lower-fma.f64 78.3

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

   5. Applied rewrites 78.3%

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

   6. Taylor expanded in a around 0

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

   8. Applied rewrites 69.9%

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

Alternative 9: 90.2% accurate, 1.2× speedup

Math

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

FPCore

(FPCore (x y z t a b c)
 :precision binary64
 (let* ((t_1 (fma a (* b -0.25) (fma x y c))))
   (if (<= (* a b) -1e+74)
     t_1
     (if (<= (* a b) 1e+35) (fma (* t 0.0625) z (fma x y c)) t_1))))

C

double code(double x, double y, double z, double t, double a, double b, double c) {
	double t_1 = fma(a, (b * -0.25), fma(x, y, c));
	double tmp;
	if ((a * b) <= -1e+74) {
		tmp = t_1;
	} else if ((a * b) <= 1e+35) {
		tmp = fma((t * 0.0625), z, fma(x, y, c));
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b, c)
	t_1 = fma(a, Float64(b * -0.25), fma(x, y, c))
	tmp = 0.0
	if (Float64(a * b) <= -1e+74)
		tmp = t_1;
	elseif (Float64(a * b) <= 1e+35)
		tmp = fma(Float64(t * 0.0625), z, fma(x, y, c));
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 a b) < -9.99999999999999952e73 or 9.9999999999999997e34 < (*.f64 a b)

   1. Initial program 95.2%

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

   3. Taylor expanded in z around 0

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

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

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

      2. metadata-eval N/A

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

      3. +-commutative N/A

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

      4. *-commutative N/A

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

      5. associate-*l* N/A

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

      6. *-commutative N/A

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

      7. lower-fma.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. +-commutative N/A

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

      11. lower-fma.f64 84.4

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

   5. Applied rewrites 84.4%

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

   if -9.99999999999999952e73 < (*.f64 a b) < 9.9999999999999997e34

   1. Initial program 100.0%

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

      1. lift-+.f64 N/A

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

      2. lift--.f64 N/A

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

      3. associate-+l- N/A

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

      4. lift-+.f64 N/A

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

      5. +-commutative N/A

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

      6. associate--l+ N/A

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

      7. lift-/.f64 N/A

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

      8. lift-*.f64 N/A

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

      9. associate-/l* N/A

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

      10. *-commutative N/A

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

      11. lower-fma.f64 N/A

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

      12. div-inv N/A

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

      13. lower-*.f64 N/A

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

      14. metadata-eval N/A

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

      15. lower--.f64 N/A

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

      16. sub-neg N/A

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

      17. lift-/.f64 N/A

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

      18. lift-*.f64 N/A

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

      19. associate-/l* N/A

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

      20. lower-fma.f64 N/A

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

   4. Applied rewrites 100.0%

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

   5. Taylor expanded in a around 0

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

      1. +-commutative N/A

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

      2. lower-fma.f64 95.8

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

   7. Applied rewrites 95.8%

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

Alternative 10: 85.7% accurate, 1.2× speedup

Math

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

FPCore

(FPCore (x y z t a b c)
 :precision binary64
 (if (<= (* t z) -1e+137)
   (fma 0.0625 (* t z) c)
   (if (<= (* t z) 1e+285)
     (fma a (* b -0.25) (fma x y c))
     (* 0.0625 (* t z)))))

C

double code(double x, double y, double z, double t, double a, double b, double c) {
	double tmp;
	if ((t * z) <= -1e+137) {
		tmp = fma(0.0625, (t * z), c);
	} else if ((t * z) <= 1e+285) {
		tmp = fma(a, (b * -0.25), fma(x, y, c));
	} else {
		tmp = 0.0625 * (t * z);
	}
	return tmp;
}

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (*.f64 z t) < -1e137

   1. Initial program 93.9%

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

   3. Taylor expanded in x around inf

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

      1. lower-*.f64 12.3

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

   5. Applied rewrites 12.3%

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

   6. Taylor expanded in x around 0

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

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

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

      2. metadata-eval N/A

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

      3. +-commutative N/A

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

      4. *-commutative N/A

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

      5. associate-*r* N/A

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

      6. *-commutative N/A

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

      7. lower-fma.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. +-commutative N/A

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

      11. lower-fma.f64 N/A

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

      12. lower-*.f64 92.0

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

   8. Applied rewrites 92.0%

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

   9. Taylor expanded in a around 0

      \[\leadsto c + \color{blue}{\frac{1}{16} \cdot \left(t \cdot z\right)} \]
   10. Step-by-step derivation

   11. Applied rewrites 76.9%

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

   if -1e137 < (*.f64 z t) < 9.9999999999999998e284

   1. Initial program 100.0%

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

   3. Taylor expanded in z around 0

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

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

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

      2. metadata-eval N/A

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

      3. +-commutative N/A

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

      4. *-commutative N/A

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

      5. associate-*l* N/A

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

      6. *-commutative N/A

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

      7. lower-fma.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. +-commutative N/A

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

      11. lower-fma.f64 91.8

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

   5. Applied rewrites 91.8%

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

   if 9.9999999999999998e284 < (*.f64 z t)

   1. Initial program 74.7%

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

   3. Taylor expanded in z around inf

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

      1. lower-*.f64 N/A

         \[\leadsto \color{blue}{\frac{1}{16} \cdot \left(t \cdot z\right)} \]

      2. lower-*.f64 76.4

         \[\leadsto 0.0625 \cdot \color{blue}{\left(t \cdot z\right)} \]

   5. Applied rewrites 76.4%

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

4. Final simplification 88.2%

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

Alternative 11: 63.6% accurate, 1.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := a \cdot \left(b \cdot -0.25\right)\\ \mathbf{if}\;a \cdot b \leq -5 \cdot 10^{+106}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;a \cdot b \leq 5 \cdot 10^{+198}:\\ \;\;\;\;\mathsf{fma}\left(x, y, c\right)\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c)
 :precision binary64
 (let* ((t_1 (* a (* b -0.25))))
   (if (<= (* a b) -5e+106) t_1 (if (<= (* a b) 5e+198) (fma x y c) t_1))))

C

double code(double x, double y, double z, double t, double a, double b, double c) {
	double t_1 = a * (b * -0.25);
	double tmp;
	if ((a * b) <= -5e+106) {
		tmp = t_1;
	} else if ((a * b) <= 5e+198) {
		tmp = fma(x, y, c);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b, c)
	t_1 = Float64(a * Float64(b * -0.25))
	tmp = 0.0
	if (Float64(a * b) <= -5e+106)
		tmp = t_1;
	elseif (Float64(a * b) <= 5e+198)
		tmp = fma(x, y, c);
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(a * N[(b * -0.25), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(a * b), $MachinePrecision], -5e+106], t$95$1, If[LessEqual[N[(a * b), $MachinePrecision], 5e+198], N[(x * y + c), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 a b) < -4.9999999999999998e106 or 5.00000000000000049e198 < (*.f64 a b)

   1. Initial program 92.8%

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

   3. Taylor expanded in a around inf

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

      1. *-commutative N/A

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

      2. associate-*l* N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 75.8

         \[\leadsto a \cdot \color{blue}{\left(b \cdot -0.25\right)} \]

   5. Applied rewrites 75.8%

      \[\leadsto \color{blue}{a \cdot \left(b \cdot -0.25\right)} \]

   if -4.9999999999999998e106 < (*.f64 a b) < 5.00000000000000049e198

   1. Initial program 100.0%

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

   3. Taylor expanded in z around 0

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

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

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

      2. metadata-eval N/A

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

      3. +-commutative N/A

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

      4. *-commutative N/A

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

      5. associate-*l* N/A

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

      6. *-commutative N/A

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

      7. lower-fma.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. +-commutative N/A

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

      11. lower-fma.f64 74.5

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

   5. Applied rewrites 74.5%

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

   6. Taylor expanded in a around 0

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

   8. Applied rewrites 65.1%

      \[\leadsto \mathsf{fma}\left(x, \color{blue}{y}, c\right) \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 12: 62.1% accurate, 1.4× speedup

Math

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

FPCore

(FPCore (x y z t a b c)
 :precision binary64
 (let* ((t_1 (* 0.0625 (* t z))))
   (if (<= (* t z) -1e+66) t_1 (if (<= (* t z) 1e+187) (fma x y c) t_1))))

C

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

Julia

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

Wolfram

code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(0.0625 * N[(t * z), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(t * z), $MachinePrecision], -1e+66], t$95$1, If[LessEqual[N[(t * z), $MachinePrecision], 1e+187], N[(x * y + c), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 z t) < -9.99999999999999945e65 or 9.99999999999999907e186 < (*.f64 z t)

   1. Initial program 92.4%

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

   3. Taylor expanded in z around inf

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

      1. lower-*.f64 N/A

         \[\leadsto \color{blue}{\frac{1}{16} \cdot \left(t \cdot z\right)} \]

      2. lower-*.f64 63.1

         \[\leadsto 0.0625 \cdot \color{blue}{\left(t \cdot z\right)} \]

   5. Applied rewrites 63.1%

      \[\leadsto \color{blue}{0.0625 \cdot \left(t \cdot z\right)} \]

   if -9.99999999999999945e65 < (*.f64 z t) < 9.99999999999999907e186

   1. Initial program 100.0%

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

   3. Taylor expanded in z around 0

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

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

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

      2. metadata-eval N/A

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

      3. +-commutative N/A

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

      4. *-commutative N/A

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

      5. associate-*l* N/A

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

      6. *-commutative N/A

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

      7. lower-fma.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. +-commutative N/A

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

      11. lower-fma.f64 94.1

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

   5. Applied rewrites 94.1%

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

   6. Taylor expanded in a around 0

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

   8. Applied rewrites 64.9%

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

4. Final simplification 64.3%

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

Alternative 13: 98.4% accurate, 1.6× speedup

Math

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

FPCore

(FPCore (x y z t a b c)
 :precision binary64
 (fma a (* b -0.25) (fma 0.0625 (* t z) (fma x y c))))

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 97.6%

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

3. Taylor expanded in x around 0

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

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

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

   2. metadata-eval N/A

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

   3. +-commutative N/A

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

   4. *-commutative N/A

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

   5. associate-*l* N/A

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

   6. *-commutative N/A

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

   7. lower-fma.f64 N/A

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

   8. *-commutative N/A

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

   9. lower-*.f64 N/A

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

   10. associate-+r+ N/A

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

   11. +-commutative N/A

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

   12. associate-+l+ N/A

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

   13. lower-fma.f64 N/A

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

   14. lower-*.f64 N/A

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

   15. +-commutative N/A

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

   16. lower-fma.f64 98.0

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

5. Applied rewrites 98.0%

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

Alternative 14: 49.4% accurate, 6.7× speedup

Math

\[\begin{array}{l} \\ \mathsf{fma}\left(x, y, c\right) \end{array} \]

FPCore

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

C

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

Julia

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

Wolfram

code[x_, y_, z_, t_, a_, b_, c_] := N[(x * y + c), $MachinePrecision]

Derivation

1. Initial program 97.6%

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

3. Taylor expanded in z around 0

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

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

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

   2. metadata-eval N/A

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

   3. +-commutative N/A

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

   4. *-commutative N/A

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

   5. associate-*l* N/A

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

   6. *-commutative N/A

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

   7. lower-fma.f64 N/A

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

   8. *-commutative N/A

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

   9. lower-*.f64 N/A

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

   10. +-commutative N/A

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

   11. lower-fma.f64 78.5

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

5. Applied rewrites 78.5%

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

6. Taylor expanded in a around 0

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

8. Applied rewrites 49.6%

   \[\leadsto \mathsf{fma}\left(x, \color{blue}{y}, c\right) \]
9. Add Preprocessing

Alternative 15: 29.2% accurate, 7.8× speedup

Math

\[\begin{array}{l} \\ x \cdot y \end{array} \]

FPCore

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

C

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

Fortran

real(8) function code(x, y, z, t, a, b, c)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    code = x * y
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_, t_, a_, b_, c_] := N[(x * y), $MachinePrecision]

Derivation

1. Initial program 97.6%

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

3. Taylor expanded in x around inf

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

   1. lower-*.f64 28.5

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

5. Applied rewrites 28.5%

   \[\leadsto \color{blue}{x \cdot y} \]
6. Add Preprocessing

Reproduce

herbie shell --seed 2024233 
(FPCore (x y z t a b c)
  :name "Diagrams.Solve.Polynomial:quartForm  from diagrams-solve-0.1, C"
  :precision binary64
  (+ (- (+ (* x y) (/ (* z t) 16.0)) (/ (* a b) 4.0)) c))