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

Percentage Accurate: 97.8% → 99.0%

Time: 11.1s

Alternatives: 14

Speedup: 1.5×

• 33.1% 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.8% 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: 99.0% accurate, 1.5× speedup

Math

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

FPCore

(FPCore (x y z t a b c)
 :precision binary64
 (+ (fma (* t 0.0625) z (fma x y (* (* 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, fma(x, y, ((a * b) * -0.25))) + c;
}

Julia

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

Wolfram

code[x_, y_, z_, t_, a_, b_, c_] := N[(N[(N[(t * 0.0625), $MachinePrecision] * z + N[(x * y + N[(N[(a * b), $MachinePrecision] * -0.25), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + 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. 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. sub-neg N/A

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

   3. lift-+.f64 N/A

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

   4. +-commutative N/A

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

   5. associate-+l+ N/A

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

   6. lift-/.f64 N/A

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

   7. lift-*.f64 N/A

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

   8. associate-/l* N/A

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

   9. *-commutative N/A

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

   10. lower-fma.f64 N/A

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

   11. div-inv N/A

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

   12. lower-*.f64 N/A

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

   13. metadata-eval N/A

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

   14. lift-*.f64 N/A

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

   15. lower-fma.f64 N/A

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

   16. lift-/.f64 N/A

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

   17. div-inv N/A

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

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

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

   19. metadata-eval N/A

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

   20. metadata-eval N/A

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

   21. metadata-eval N/A

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

   22. metadata-eval N/A

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

   23. lower-*.f64 N/A

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

   24. metadata-eval N/A

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

   25. metadata-eval 99.2

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

4. Applied rewrites 99.2%

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

Alternative 2: 75.6% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \mathsf{fma}\left(t \cdot 0.0625, z, x \cdot y\right)\\ t_2 := x \cdot y + \frac{t \cdot z}{16}\\ \mathbf{if}\;t\_2 \leq -2 \cdot 10^{+73}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t\_2 \leq 2 \cdot 10^{+21}:\\ \;\;\;\;\mathsf{fma}\left(a, b \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 (* t 0.0625) z (* x y))) (t_2 (+ (* x y) (/ (* t z) 16.0))))
   (if (<= t_2 -2e+73) t_1 (if (<= t_2 2e+21) (fma a (* b -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((t * 0.0625), z, (x * y));
	double t_2 = (x * y) + ((t * z) / 16.0);
	double tmp;
	if (t_2 <= -2e+73) {
		tmp = t_1;
	} else if (t_2 <= 2e+21) {
		tmp = fma(a, (b * -0.25), 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(x * y))
	t_2 = Float64(Float64(x * y) + Float64(Float64(t * z) / 16.0))
	tmp = 0.0
	if (t_2 <= -2e+73)
		tmp = t_1;
	elseif (t_2 <= 2e+21)
		tmp = fma(a, Float64(b * -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[(N[(t * 0.0625), $MachinePrecision] * z + N[(x * y), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(x * y), $MachinePrecision] + N[(N[(t * z), $MachinePrecision] / 16.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, -2e+73], t$95$1, If[LessEqual[t$95$2, 2e+21], N[(a * N[(b * -0.25), $MachinePrecision] + c), $MachinePrecision], t$95$1]]]]

Derivation

1. Split input into 2 regimes

2. if (+.f64 (*.f64 x y) (/.f64 (*.f64 z t) #s(literal 16 binary64))) < -1.99999999999999997e73 or 2e21 < (+.f64 (*.f64 x y) (/.f64 (*.f64 z t) #s(literal 16 binary64)))

   1. Initial program 96.5%

      \[\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 0

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

      1. associate-+r+ N/A

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

      2. +-commutative N/A

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

      3. associate-+l+ N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-*.f64 N/A

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

      6. +-commutative N/A

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

      7. lower-fma.f64 81.5

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

   5. Applied rewrites 81.5%

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

   7. Applied rewrites 82.7%

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

   8. Taylor expanded in x around inf

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

   10. Applied rewrites 74.3%

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

   if -1.99999999999999997e73 < (+.f64 (*.f64 x y) (/.f64 (*.f64 z t) #s(literal 16 binary64))) < 2e21

   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 89.4

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

   5. Applied rewrites 89.4%

      \[\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 85.7%

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

4. Final simplification 78.0%

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

Alternative 3: 75.0% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \mathsf{fma}\left(0.0625, t \cdot z, x \cdot y\right)\\ t_2 := x \cdot y + \frac{t \cdot z}{16}\\ \mathbf{if}\;t\_2 \leq -2 \cdot 10^{+73}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t\_2 \leq 2 \cdot 10^{+21}:\\ \;\;\;\;\mathsf{fma}\left(a, b \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 0.0625 (* t z) (* x y))) (t_2 (+ (* x y) (/ (* t z) 16.0))))
   (if (<= t_2 -2e+73) t_1 (if (<= t_2 2e+21) (fma a (* b -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(0.0625, (t * z), (x * y));
	double t_2 = (x * y) + ((t * z) / 16.0);
	double tmp;
	if (t_2 <= -2e+73) {
		tmp = t_1;
	} else if (t_2 <= 2e+21) {
		tmp = fma(a, (b * -0.25), c);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b, c)
	t_1 = fma(0.0625, Float64(t * z), Float64(x * y))
	t_2 = Float64(Float64(x * y) + Float64(Float64(t * z) / 16.0))
	tmp = 0.0
	if (t_2 <= -2e+73)
		tmp = t_1;
	elseif (t_2 <= 2e+21)
		tmp = fma(a, Float64(b * -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[(0.0625 * N[(t * z), $MachinePrecision] + N[(x * y), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(x * y), $MachinePrecision] + N[(N[(t * z), $MachinePrecision] / 16.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, -2e+73], t$95$1, If[LessEqual[t$95$2, 2e+21], N[(a * N[(b * -0.25), $MachinePrecision] + c), $MachinePrecision], t$95$1]]]]

Derivation

1. Split input into 2 regimes

2. if (+.f64 (*.f64 x y) (/.f64 (*.f64 z t) #s(literal 16 binary64))) < -1.99999999999999997e73 or 2e21 < (+.f64 (*.f64 x y) (/.f64 (*.f64 z t) #s(literal 16 binary64)))

   1. Initial program 96.5%

      \[\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 0

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

      1. associate-+r+ N/A

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

      2. +-commutative N/A

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

      3. associate-+l+ N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-*.f64 N/A

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

      6. +-commutative N/A

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

      7. lower-fma.f64 81.5

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

   5. Applied rewrites 81.5%

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

   6. Taylor expanded in x around inf

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

   8. Applied rewrites 73.1%

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

   if -1.99999999999999997e73 < (+.f64 (*.f64 x y) (/.f64 (*.f64 z t) #s(literal 16 binary64))) < 2e21

   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 89.4

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

   5. Applied rewrites 89.4%

      \[\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 85.7%

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

4. Final simplification 77.2%

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

Alternative 4: 64.3% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \mathsf{fma}\left(a, b \cdot -0.25, c\right)\\ \mathbf{if}\;a \cdot b \leq -1 \cdot 10^{+192}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;a \cdot b \leq 0.0004:\\ \;\;\;\;\mathsf{fma}\left(0.0625 \cdot z, t, c\right)\\ \mathbf{elif}\;a \cdot b \leq 5 \cdot 10^{+108}:\\ \;\;\;\;\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 a (* b -0.25) c)))
   (if (<= (* a b) -1e+192)
     t_1
     (if (<= (* a b) 0.0004)
       (fma (* 0.0625 z) t c)
       (if (<= (* a b) 5e+108) (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), c);
	double tmp;
	if ((a * b) <= -1e+192) {
		tmp = t_1;
	} else if ((a * b) <= 0.0004) {
		tmp = fma((0.0625 * z), t, c);
	} else if ((a * b) <= 5e+108) {
		tmp = 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), c)
	tmp = 0.0
	if (Float64(a * b) <= -1e+192)
		tmp = t_1;
	elseif (Float64(a * b) <= 0.0004)
		tmp = fma(Float64(0.0625 * z), t, c);
	elseif (Float64(a * b) <= 5e+108)
		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] + c), $MachinePrecision]}, If[LessEqual[N[(a * b), $MachinePrecision], -1e+192], t$95$1, If[LessEqual[N[(a * b), $MachinePrecision], 0.0004], N[(N[(0.0625 * z), $MachinePrecision] * t + c), $MachinePrecision], If[LessEqual[N[(a * b), $MachinePrecision], 5e+108], N[(x * y + c), $MachinePrecision], t$95$1]]]]

Derivation

1. Split input into 3 regimes

2. if (*.f64 a b) < -1.00000000000000004e192 or 4.99999999999999991e108 < (*.f64 a b)

   1. Initial program 95.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 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 92.0

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

   5. Applied rewrites 92.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 0

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

   8. Applied rewrites 82.7%

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

   if -1.00000000000000004e192 < (*.f64 a b) < 4.00000000000000019e-4

   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 a around 0

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

      1. associate-+r+ N/A

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

      2. +-commutative N/A

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

      3. associate-+l+ N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-*.f64 N/A

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

      6. +-commutative N/A

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

      7. lower-fma.f64 92.3

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

   5. Applied rewrites 92.3%

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

   7. Applied rewrites 93.5%

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

   8. Taylor expanded in x around 0

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

   10. Applied rewrites 65.7%

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

   12. Applied rewrites 65.7%

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

   if 4.00000000000000019e-4 < (*.f64 a b) < 4.99999999999999991e108

   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 a around 0

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

      1. associate-+r+ N/A

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

      2. +-commutative N/A

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

      3. associate-+l+ N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-*.f64 N/A

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

      6. +-commutative N/A

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

      7. lower-fma.f64 85.1

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

   5. Applied rewrites 85.1%

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

   6. Taylor expanded in t around 0

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

   8. Applied rewrites 72.4%

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

4. Final simplification 71.2%

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

Alternative 5: 64.3% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \mathsf{fma}\left(a, b \cdot -0.25, c\right)\\ \mathbf{if}\;a \cdot b \leq -1 \cdot 10^{+192}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;a \cdot b \leq 0.0004:\\ \;\;\;\;\mathsf{fma}\left(0.0625, t \cdot z, c\right)\\ \mathbf{elif}\;a \cdot b \leq 5 \cdot 10^{+108}:\\ \;\;\;\;\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 a (* b -0.25) c)))
   (if (<= (* a b) -1e+192)
     t_1
     (if (<= (* a b) 0.0004)
       (fma 0.0625 (* t z) c)
       (if (<= (* a b) 5e+108) (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), c);
	double tmp;
	if ((a * b) <= -1e+192) {
		tmp = t_1;
	} else if ((a * b) <= 0.0004) {
		tmp = fma(0.0625, (t * z), c);
	} else if ((a * b) <= 5e+108) {
		tmp = 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), c)
	tmp = 0.0
	if (Float64(a * b) <= -1e+192)
		tmp = t_1;
	elseif (Float64(a * b) <= 0.0004)
		tmp = fma(0.0625, Float64(t * z), c);
	elseif (Float64(a * b) <= 5e+108)
		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] + c), $MachinePrecision]}, If[LessEqual[N[(a * b), $MachinePrecision], -1e+192], t$95$1, If[LessEqual[N[(a * b), $MachinePrecision], 0.0004], N[(0.0625 * N[(t * z), $MachinePrecision] + c), $MachinePrecision], If[LessEqual[N[(a * b), $MachinePrecision], 5e+108], N[(x * y + c), $MachinePrecision], t$95$1]]]]

Derivation

1. Split input into 3 regimes

2. if (*.f64 a b) < -1.00000000000000004e192 or 4.99999999999999991e108 < (*.f64 a b)

   1. Initial program 95.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 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 92.0

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

   5. Applied rewrites 92.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 0

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

   8. Applied rewrites 82.7%

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

   if -1.00000000000000004e192 < (*.f64 a b) < 4.00000000000000019e-4

   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 a around 0

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

      1. associate-+r+ N/A

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

      2. +-commutative N/A

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

      3. associate-+l+ N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-*.f64 N/A

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

      6. +-commutative N/A

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

      7. lower-fma.f64 92.3

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

   5. Applied rewrites 92.3%

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

   6. Taylor expanded in x around 0

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

   8. Applied rewrites 65.7%

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

   if 4.00000000000000019e-4 < (*.f64 a b) < 4.99999999999999991e108

   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 a around 0

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

      1. associate-+r+ N/A

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

      2. +-commutative N/A

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

      3. associate-+l+ N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-*.f64 N/A

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

      6. +-commutative N/A

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

      7. lower-fma.f64 85.1

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

   5. Applied rewrites 85.1%

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

   6. Taylor expanded in t around 0

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

   8. Applied rewrites 72.4%

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

Alternative 6: 62.5% 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 -1 \cdot 10^{+192}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;a \cdot b \leq 0.0004:\\ \;\;\;\;\mathsf{fma}\left(0.0625, t \cdot z, c\right)\\ \mathbf{elif}\;a \cdot b \leq 5 \cdot 10^{+108}:\\ \;\;\;\;\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) -1e+192)
     t_1
     (if (<= (* a b) 0.0004)
       (fma 0.0625 (* t z) c)
       (if (<= (* a b) 5e+108) (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) <= -1e+192) {
		tmp = t_1;
	} else if ((a * b) <= 0.0004) {
		tmp = fma(0.0625, (t * z), c);
	} else if ((a * b) <= 5e+108) {
		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) <= -1e+192)
		tmp = t_1;
	elseif (Float64(a * b) <= 0.0004)
		tmp = fma(0.0625, Float64(t * z), c);
	elseif (Float64(a * b) <= 5e+108)
		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], -1e+192], t$95$1, If[LessEqual[N[(a * b), $MachinePrecision], 0.0004], N[(0.0625 * N[(t * z), $MachinePrecision] + c), $MachinePrecision], If[LessEqual[N[(a * b), $MachinePrecision], 5e+108], N[(x * y + c), $MachinePrecision], t$95$1]]]]

Derivation

1. Split input into 3 regimes

2. if (*.f64 a b) < -1.00000000000000004e192 or 4.99999999999999991e108 < (*.f64 a b)

   1. Initial program 95.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 79.9

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

   5. Applied rewrites 79.9%

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

   if -1.00000000000000004e192 < (*.f64 a b) < 4.00000000000000019e-4

   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 a around 0

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

      1. associate-+r+ N/A

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

      2. +-commutative N/A

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

      3. associate-+l+ N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-*.f64 N/A

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

      6. +-commutative N/A

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

      7. lower-fma.f64 92.3

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

   5. Applied rewrites 92.3%

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

   6. Taylor expanded in x around 0

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

   8. Applied rewrites 65.7%

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

   if 4.00000000000000019e-4 < (*.f64 a b) < 4.99999999999999991e108

   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 a around 0

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

      1. associate-+r+ N/A

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

      2. +-commutative N/A

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

      3. associate-+l+ N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-*.f64 N/A

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

      6. +-commutative N/A

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

      7. lower-fma.f64 85.1

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

   5. Applied rewrites 85.1%

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

   6. Taylor expanded in t around 0

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

   8. Applied rewrites 72.4%

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

Alternative 7: 89.1% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \mathsf{fma}\left(y, x, c + a \cdot \left(b \cdot -0.25\right)\right)\\ \mathbf{if}\;a \cdot b \leq -1 \cdot 10^{+192}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;a \cdot b \leq 10^{+18}:\\ \;\;\;\;\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 y x (+ c (* a (* b -0.25))))))
   (if (<= (* a b) -1e+192)
     t_1
     (if (<= (* a b) 1e+18) (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(y, x, (c + (a * (b * -0.25))));
	double tmp;
	if ((a * b) <= -1e+192) {
		tmp = t_1;
	} else if ((a * b) <= 1e+18) {
		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(y, x, Float64(c + Float64(a * Float64(b * -0.25))))
	tmp = 0.0
	if (Float64(a * b) <= -1e+192)
		tmp = t_1;
	elseif (Float64(a * b) <= 1e+18)
		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[(y * x + N[(c + N[(a * N[(b * -0.25), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(a * b), $MachinePrecision], -1e+192], t$95$1, If[LessEqual[N[(a * b), $MachinePrecision], 1e+18], 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) < -1.00000000000000004e192 or 1e18 < (*.f64 a b)

   1. Initial program 96.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 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.5

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

   5. Applied rewrites 91.5%

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

   7. Applied rewrites 92.6%

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

   if -1.00000000000000004e192 < (*.f64 a b) < 1e18

   1. Initial program 98.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 a around 0

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

      1. associate-+r+ N/A

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

      2. +-commutative N/A

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

      3. associate-+l+ N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-*.f64 N/A

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

      6. +-commutative N/A

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

      7. lower-fma.f64 92.5

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

   5. Applied rewrites 92.5%

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

   7. Applied rewrites 93.7%

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

Alternative 8: 89.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^{+192}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;a \cdot b \leq 10^{+18}:\\ \;\;\;\;\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+192)
     t_1
     (if (<= (* a b) 1e+18) (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+192) {
		tmp = t_1;
	} else if ((a * b) <= 1e+18) {
		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+192)
		tmp = t_1;
	elseif (Float64(a * b) <= 1e+18)
		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+192], t$95$1, If[LessEqual[N[(a * b), $MachinePrecision], 1e+18], 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) < -1.00000000000000004e192 or 1e18 < (*.f64 a b)

   1. Initial program 96.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 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.5

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

   5. Applied rewrites 91.5%

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

   if -1.00000000000000004e192 < (*.f64 a b) < 1e18

   1. Initial program 98.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 a around 0

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

      1. associate-+r+ N/A

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

      2. +-commutative N/A

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

      3. associate-+l+ N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-*.f64 N/A

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

      6. +-commutative N/A

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

      7. lower-fma.f64 92.5

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

   5. Applied rewrites 92.5%

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

   7. Applied rewrites 93.7%

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

Alternative 9: 88.8% 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^{+192}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;a \cdot b \leq 10^{+18}:\\ \;\;\;\;\mathsf{fma}\left(0.0625, t \cdot 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+192)
     t_1
     (if (<= (* a b) 1e+18) (fma 0.0625 (* t 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+192) {
		tmp = t_1;
	} else if ((a * b) <= 1e+18) {
		tmp = fma(0.0625, (t * 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+192)
		tmp = t_1;
	elseif (Float64(a * b) <= 1e+18)
		tmp = fma(0.0625, Float64(t * 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+192], t$95$1, If[LessEqual[N[(a * b), $MachinePrecision], 1e+18], N[(0.0625 * N[(t * z), $MachinePrecision] + N[(x * y + c), $MachinePrecision]), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 a b) < -1.00000000000000004e192 or 1e18 < (*.f64 a b)

   1. Initial program 96.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 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.5

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

   5. Applied rewrites 91.5%

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

   if -1.00000000000000004e192 < (*.f64 a b) < 1e18

   1. Initial program 98.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 a around 0

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

      1. associate-+r+ N/A

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

      2. +-commutative N/A

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

      3. associate-+l+ N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-*.f64 N/A

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

      6. +-commutative N/A

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

      7. lower-fma.f64 92.5

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

   5. Applied rewrites 92.5%

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

Alternative 10: 86.8% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \mathsf{fma}\left(y, x, \left(a \cdot b\right) \cdot -0.25\right)\\ \mathbf{if}\;a \cdot b \leq -1 \cdot 10^{+192}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;a \cdot b \leq 2 \cdot 10^{+87}:\\ \;\;\;\;\mathsf{fma}\left(0.0625, t \cdot 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 y x (* (* a b) -0.25))))
   (if (<= (* a b) -1e+192)
     t_1
     (if (<= (* a b) 2e+87) (fma 0.0625 (* t 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(y, x, ((a * b) * -0.25));
	double tmp;
	if ((a * b) <= -1e+192) {
		tmp = t_1;
	} else if ((a * b) <= 2e+87) {
		tmp = fma(0.0625, (t * z), fma(x, y, c));
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b, c)
	t_1 = fma(y, x, Float64(Float64(a * b) * -0.25))
	tmp = 0.0
	if (Float64(a * b) <= -1e+192)
		tmp = t_1;
	elseif (Float64(a * b) <= 2e+87)
		tmp = fma(0.0625, Float64(t * 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[(y * x + N[(N[(a * b), $MachinePrecision] * -0.25), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(a * b), $MachinePrecision], -1e+192], t$95$1, If[LessEqual[N[(a * b), $MachinePrecision], 2e+87], N[(0.0625 * N[(t * z), $MachinePrecision] + N[(x * y + c), $MachinePrecision]), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 a b) < -1.00000000000000004e192 or 1.9999999999999999e87 < (*.f64 a b)

   1. Initial program 96.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 92.3

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

   5. Applied rewrites 92.3%

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

   7. Applied rewrites 93.6%

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

   8. Taylor expanded in c around 0

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

   10. Applied rewrites 90.8%

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

   if -1.00000000000000004e192 < (*.f64 a b) < 1.9999999999999999e87

   1. Initial program 98.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 a around 0

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

      1. associate-+r+ N/A

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

      2. +-commutative N/A

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

      3. associate-+l+ N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-*.f64 N/A

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

      6. +-commutative N/A

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

      7. lower-fma.f64 91.5

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

   5. Applied rewrites 91.5%

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

4. Final simplification 91.3%

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

Alternative 11: 62.7% 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 -1 \cdot 10^{+162}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;a \cdot b \leq 5 \cdot 10^{+108}:\\ \;\;\;\;\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) -1e+162) t_1 (if (<= (* a b) 5e+108) (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) <= -1e+162) {
		tmp = t_1;
	} else if ((a * b) <= 5e+108) {
		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) <= -1e+162)
		tmp = t_1;
	elseif (Float64(a * b) <= 5e+108)
		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], -1e+162], t$95$1, If[LessEqual[N[(a * b), $MachinePrecision], 5e+108], N[(x * y + c), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 a b) < -9.9999999999999994e161 or 4.99999999999999991e108 < (*.f64 a b)

   1. Initial program 96.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 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 78.1

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

   5. Applied rewrites 78.1%

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

   if -9.9999999999999994e161 < (*.f64 a b) < 4.99999999999999991e108

   1. Initial program 98.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 a around 0

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

      1. associate-+r+ N/A

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

      2. +-commutative N/A

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

      3. associate-+l+ N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-*.f64 N/A

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

      6. +-commutative N/A

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

      7. lower-fma.f64 91.7

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

   5. Applied rewrites 91.7%

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

   6. Taylor expanded in t around 0

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

   8. Applied rewrites 55.5%

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

Alternative 12: 62.8% 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^{+158}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t \cdot z \leq 2 \cdot 10^{+90}:\\ \;\;\;\;\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+158) t_1 (if (<= (* t z) 2e+90) (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+158) {
		tmp = t_1;
	} else if ((t * z) <= 2e+90) {
		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+158)
		tmp = t_1;
	elseif (Float64(t * z) <= 2e+90)
		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+158], t$95$1, If[LessEqual[N[(t * z), $MachinePrecision], 2e+90], N[(x * y + c), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 z t) < -9.99999999999999953e157 or 1.99999999999999993e90 < (*.f64 z t)

   1. Initial program 92.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 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 68.6

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

   5. Applied rewrites 68.6%

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

   if -9.99999999999999953e157 < (*.f64 z t) < 1.99999999999999993e90

   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 a around 0

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

      1. associate-+r+ N/A

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

      2. +-commutative N/A

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

      3. associate-+l+ N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-*.f64 N/A

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

      6. +-commutative N/A

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

      7. lower-fma.f64 67.4

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

   5. Applied rewrites 67.4%

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

   6. Taylor expanded in t around 0

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

   8. Applied rewrites 56.4%

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

4. Final simplification 60.5%

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

Alternative 13: 49.1% 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 a around 0

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

   1. associate-+r+ N/A

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

   2. +-commutative N/A

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

   3. associate-+l+ N/A

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

   4. lower-fma.f64 N/A

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

   5. lower-*.f64 N/A

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

   6. +-commutative N/A

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

   7. lower-fma.f64 72.1

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

5. Applied rewrites 72.1%

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

6. Taylor expanded in t around 0

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

8. Applied rewrites 43.5%

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

Alternative 14: 28.7% 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 26.7

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

5. Applied rewrites 26.7%

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

Reproduce

herbie shell --seed 2024216 
(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))