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

Percentage Accurate: 97.5% → 98.2%

Time: 9.7s

Alternatives: 11

Speedup: 1.6×

• 33.2% 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.5% 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.2% accurate, 1.6× speedup

Math

\[\begin{array}{l} \\ \mathsf{fma}\left(a, b \cdot -0.25, \mathsf{fma}\left(0.0625, z \cdot t, \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 (* z t) (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, (z * t), 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(z * t), 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[(z * t), $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.8

       \[\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.8%

   \[\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. Final simplification 98.8%

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

Alternative 2: 62.3% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \mathsf{fma}\left(a, b \cdot -0.25, c\right)\\ t_2 := 0.0625 \cdot \left(z \cdot t\right)\\ \mathbf{if}\;z \cdot t \leq -5 \cdot 10^{+185}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;z \cdot t \leq -0.004:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;z \cdot t \leq 5 \cdot 10^{-189}:\\ \;\;\;\;\mathsf{fma}\left(x, y, c\right)\\ \mathbf{elif}\;z \cdot t \leq 2 \cdot 10^{+23}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;z \cdot t \leq 5 \cdot 10^{+220}:\\ \;\;\;\;\mathsf{fma}\left(x, y, c\right)\\ \mathbf{else}:\\ \;\;\;\;t\_2\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c)
 :precision binary64
 (let* ((t_1 (fma a (* b -0.25) c)) (t_2 (* 0.0625 (* z t))))
   (if (<= (* z t) -5e+185)
     t_2
     (if (<= (* z t) -0.004)
       t_1
       (if (<= (* z t) 5e-189)
         (fma x y c)
         (if (<= (* z t) 2e+23)
           t_1
           (if (<= (* z t) 5e+220) (fma x y c) t_2)))))))

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 t_2 = 0.0625 * (z * t);
	double tmp;
	if ((z * t) <= -5e+185) {
		tmp = t_2;
	} else if ((z * t) <= -0.004) {
		tmp = t_1;
	} else if ((z * t) <= 5e-189) {
		tmp = fma(x, y, c);
	} else if ((z * t) <= 2e+23) {
		tmp = t_1;
	} else if ((z * t) <= 5e+220) {
		tmp = fma(x, y, c);
	} else {
		tmp = t_2;
	}
	return tmp;
}

Julia

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

Derivation

1. Split input into 3 regimes

2. if (*.f64 z t) < -4.9999999999999999e185 or 5.0000000000000002e220 < (*.f64 z t)

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

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

   5. Applied rewrites 87.7%

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

   if -4.9999999999999999e185 < (*.f64 z t) < -0.0040000000000000001 or 4.9999999999999997e-189 < (*.f64 z t) < 1.9999999999999998e23

   1. Initial program 98.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 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 79.7%

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

   if -0.0040000000000000001 < (*.f64 z t) < 4.9999999999999997e-189 or 1.9999999999999998e23 < (*.f64 z t) < 5.0000000000000002e220

   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 84.3

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

   5. Applied rewrites 84.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 68.5%

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

4. Final simplification 76.0%

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

Alternative 3: 65.0% accurate, 0.8× speedup

Math

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

Derivation

1. Split input into 4 regimes

2. if (*.f64 z t) < -4.9999999999999995e164 or 9.99999999999999953e67 < (*.f64 z t)

   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 inf

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

      1. lower-*.f64 N/A

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

      2. lower-*.f64 81.5

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

   5. Applied rewrites 81.5%

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

   if -4.9999999999999995e164 < (*.f64 z t) < -0.0040000000000000001

   1. Initial program 97.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 84.3

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

   5. Applied rewrites 84.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 86.9%

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

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

   if -0.0040000000000000001 < (*.f64 z t) < 4.9999999999999997e-189

   1. Initial program 97.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 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 95.4

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

   5. Applied rewrites 95.4%

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

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

   if 4.9999999999999997e-189 < (*.f64 z t) < 9.99999999999999953e67

   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 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 95.3

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

   5. Applied rewrites 95.3%

      \[\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.1%

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

4. Final simplification 78.4%

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

Alternative 4: 65.1% accurate, 0.8× speedup

Math

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

Derivation

1. Split input into 4 regimes

2. if (*.f64 z t) < -4.9999999999999995e164 or 9.99999999999999953e67 < (*.f64 z t)

   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 inf

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

      1. lower-*.f64 N/A

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

      2. lower-*.f64 81.5

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

   5. Applied rewrites 81.5%

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

   if -4.9999999999999995e164 < (*.f64 z t) < -0.0040000000000000001

   1. Initial program 97.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 84.3

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

   5. Applied rewrites 84.3%

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

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

   if -0.0040000000000000001 < (*.f64 z t) < 4.9999999999999997e-189

   1. Initial program 97.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 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 95.4

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

   5. Applied rewrites 95.4%

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

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

   if 4.9999999999999997e-189 < (*.f64 z t) < 9.99999999999999953e67

   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 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 95.3

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

   5. Applied rewrites 95.3%

      \[\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.1%

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

4. Final simplification 78.0%

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

Alternative 5: 64.0% accurate, 0.8× speedup

Math

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

FPCore

(FPCore (x y z t a b c)
 :precision binary64
 (let* ((t_1 (fma a (* b -0.25) c)) (t_2 (+ c (* 0.0625 (* z t)))))
   (if (<= (* z t) -5e+185)
     t_2
     (if (<= (* z t) -0.004)
       t_1
       (if (<= (* z t) 5e-189) (fma x y c) (if (<= (* z t) 1e+68) t_1 t_2))))))

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 t_2 = c + (0.0625 * (z * t));
	double tmp;
	if ((z * t) <= -5e+185) {
		tmp = t_2;
	} else if ((z * t) <= -0.004) {
		tmp = t_1;
	} else if ((z * t) <= 5e-189) {
		tmp = fma(x, y, c);
	} else if ((z * t) <= 1e+68) {
		tmp = t_1;
	} else {
		tmp = t_2;
	}
	return tmp;
}

Julia

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

Derivation

1. Split input into 3 regimes

2. if (*.f64 z t) < -4.9999999999999999e185 or 9.99999999999999953e67 < (*.f64 z t)

   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 inf

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

      1. lower-*.f64 N/A

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

      2. lower-*.f64 81.3

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

   5. Applied rewrites 81.3%

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

   if -4.9999999999999999e185 < (*.f64 z t) < -0.0040000000000000001 or 4.9999999999999997e-189 < (*.f64 z t) < 9.99999999999999953e67

   1. Initial program 98.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 90.6

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

   5. Applied rewrites 90.6%

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

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

   if -0.0040000000000000001 < (*.f64 z t) < 4.9999999999999997e-189

   1. Initial program 97.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 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 95.4

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

   5. Applied rewrites 95.4%

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

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

4. Final simplification 77.5%

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

Alternative 6: 89.3% accurate, 1.0× 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}\;x \cdot y \leq -5 \cdot 10^{+193}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;x \cdot y \leq 2 \cdot 10^{+35}:\\ \;\;\;\;\mathsf{fma}\left(0.0625, z \cdot t, \mathsf{fma}\left(a, b \cdot -0.25, 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 (<= (* x y) -5e+193)
     t_1
     (if (<= (* x y) 2e+35) (fma 0.0625 (* z t) (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(a, (b * -0.25), fma(x, y, c));
	double tmp;
	if ((x * y) <= -5e+193) {
		tmp = t_1;
	} else if ((x * y) <= 2e+35) {
		tmp = fma(0.0625, (z * t), 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(a, Float64(b * -0.25), fma(x, y, c))
	tmp = 0.0
	if (Float64(x * y) <= -5e+193)
		tmp = t_1;
	elseif (Float64(x * y) <= 2e+35)
		tmp = fma(0.0625, Float64(z * t), 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[(a * N[(b * -0.25), $MachinePrecision] + N[(x * y + c), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(x * y), $MachinePrecision], -5e+193], t$95$1, If[LessEqual[N[(x * y), $MachinePrecision], 2e+35], N[(0.0625 * N[(z * t), $MachinePrecision] + N[(a * N[(b * -0.25), $MachinePrecision] + c), $MachinePrecision]), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 x y) < -4.99999999999999972e193 or 1.9999999999999999e35 < (*.f64 x y)

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

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

   5. Applied rewrites 86.9%

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

   if -4.99999999999999972e193 < (*.f64 x y) < 1.9999999999999999e35

   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 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 96.2

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

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

4. Final simplification 93.2%

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

Alternative 7: 86.6% accurate, 1.2× speedup

Math

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

FPCore

(FPCore (x y z t a b c)
 :precision binary64
 (let* ((t_1 (* 0.0625 (* z t))))
   (if (<= (* z t) -5e+205)
     (fma a (* b -0.25) t_1)
     (if (<= (* z t) 4e+95) (fma a (* b -0.25) (fma x y c)) (+ 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 * (z * t);
	double tmp;
	if ((z * t) <= -5e+205) {
		tmp = fma(a, (b * -0.25), t_1);
	} else if ((z * t) <= 4e+95) {
		tmp = fma(a, (b * -0.25), fma(x, y, c));
	} else {
		tmp = c + t_1;
	}
	return tmp;
}

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (*.f64 z t) < -5.0000000000000002e205

   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 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 100.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 100.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. 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) \]
   7. Step-by-step derivation

   8. Applied rewrites 96.2%

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

   if -5.0000000000000002e205 < (*.f64 z t) < 4.00000000000000008e95

   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 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.2

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

   5. Applied rewrites 91.2%

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

   if 4.00000000000000008e95 < (*.f64 z t)

   1. Initial program 94.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)} + c \]
   4. Step-by-step derivation

      1. lower-*.f64 N/A

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

      2. lower-*.f64 81.8

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

   5. Applied rewrites 81.8%

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

4. Final simplification 89.7%

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

Alternative 8: 85.9% accurate, 1.2× speedup

Math

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

FPCore

(FPCore (x y z t a b c)
 :precision binary64
 (let* ((t_1 (* 0.0625 (* z t))))
   (if (<= (* z t) -5e+205)
     t_1
     (if (<= (* z t) 4e+95) (fma a (* b -0.25) (fma x y c)) (+ 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 * (z * t);
	double tmp;
	if ((z * t) <= -5e+205) {
		tmp = t_1;
	} else if ((z * t) <= 4e+95) {
		tmp = fma(a, (b * -0.25), fma(x, y, c));
	} else {
		tmp = c + t_1;
	}
	return tmp;
}

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (*.f64 z t) < -5.0000000000000002e205

   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 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 92.2

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

   5. Applied rewrites 92.2%

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

   if -5.0000000000000002e205 < (*.f64 z t) < 4.00000000000000008e95

   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 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.2

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

   5. Applied rewrites 91.2%

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

   if 4.00000000000000008e95 < (*.f64 z t)

   1. Initial program 94.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)} + c \]
   4. Step-by-step derivation

      1. lower-*.f64 N/A

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

      2. lower-*.f64 81.8

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

   5. Applied rewrites 81.8%

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

4. Final simplification 89.3%

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

Alternative 9: 62.6% accurate, 1.4× speedup

Math

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 z t) < -5.0000000000000002e205 or 5.0000000000000002e220 < (*.f64 z t)

   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 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 92.1

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

   5. Applied rewrites 92.1%

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

   if -5.0000000000000002e205 < (*.f64 z t) < 5.0000000000000002e220

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

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

   8. Applied rewrites 62.0%

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

4. Final simplification 68.3%

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

Alternative 10: 48.9% 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 72.2

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

5. Applied rewrites 72.2%

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

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

Alternative 11: 28.4% 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.2

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

5. Applied rewrites 26.2%

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

Reproduce

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