Bouland and Aaronson, Equation (26)

Percentage Accurate: 99.9% → 99.7%

Time: 8.9s

Alternatives: 10

Speedup: 1.0×

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

Specification

Math

\[\begin{array}{l} \\ \left({\left(a \cdot a + b \cdot b\right)}^{2} + 4 \cdot \left(b \cdot b\right)\right) - 1 \end{array} \]

FPCore

(FPCore (a b)
 :precision binary64
 (- (+ (pow (+ (* a a) (* b b)) 2.0) (* 4.0 (* b b))) 1.0))

C

double code(double a, double b) {
	return (pow(((a * a) + (b * b)), 2.0) + (4.0 * (b * b))) - 1.0;
}

Fortran

real(8) function code(a, b)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    code = ((((a * a) + (b * b)) ** 2.0d0) + (4.0d0 * (b * b))) - 1.0d0
end function

Java

public static double code(double a, double b) {
	return (Math.pow(((a * a) + (b * b)), 2.0) + (4.0 * (b * b))) - 1.0;
}

Python

def code(a, b):
	return (math.pow(((a * a) + (b * b)), 2.0) + (4.0 * (b * b))) - 1.0

Julia

function code(a, b)
	return Float64(Float64((Float64(Float64(a * a) + Float64(b * b)) ^ 2.0) + Float64(4.0 * Float64(b * b))) - 1.0)
end

MATLAB

function tmp = code(a, b)
	tmp = ((((a * a) + (b * b)) ^ 2.0) + (4.0 * (b * b))) - 1.0;
end

Wolfram

code[a_, b_] := N[(N[(N[Power[N[(N[(a * a), $MachinePrecision] + N[(b * b), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] + N[(4.0 * N[(b * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - 1.0), $MachinePrecision]

Initial Program: 99.9% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \left({\left(a \cdot a + b \cdot b\right)}^{2} + 4 \cdot \left(b \cdot b\right)\right) - 1 \end{array} \]

FPCore

(FPCore (a b)
 :precision binary64
 (- (+ (pow (+ (* a a) (* b b)) 2.0) (* 4.0 (* b b))) 1.0))

C

double code(double a, double b) {
	return (pow(((a * a) + (b * b)), 2.0) + (4.0 * (b * b))) - 1.0;
}

Fortran

real(8) function code(a, b)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    code = ((((a * a) + (b * b)) ** 2.0d0) + (4.0d0 * (b * b))) - 1.0d0
end function

Java

public static double code(double a, double b) {
	return (Math.pow(((a * a) + (b * b)), 2.0) + (4.0 * (b * b))) - 1.0;
}

Python

def code(a, b):
	return (math.pow(((a * a) + (b * b)), 2.0) + (4.0 * (b * b))) - 1.0

Julia

function code(a, b)
	return Float64(Float64((Float64(Float64(a * a) + Float64(b * b)) ^ 2.0) + Float64(4.0 * Float64(b * b))) - 1.0)
end

MATLAB

function tmp = code(a, b)
	tmp = ((((a * a) + (b * b)) ^ 2.0) + (4.0 * (b * b))) - 1.0;
end

Wolfram

code[a_, b_] := N[(N[(N[Power[N[(N[(a * a), $MachinePrecision] + N[(b * b), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] + N[(4.0 * N[(b * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - 1.0), $MachinePrecision]

Alternative 1: 99.7% accurate, 1.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \cdot b \leq 10^{+148}:\\ \;\;\;\;\left(\mathsf{fma}\left(\mathsf{fma}\left(2 \cdot b, b, a \cdot a\right), a \cdot a, \left(b \cdot b\right) \cdot \left(b \cdot b\right)\right) + 4 \cdot \left(b \cdot b\right)\right) - 1\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{\frac{1}{\mathsf{fma}\left(\mathsf{fma}\left(b, b, 4\right), b \cdot b, -1\right)}}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b)
 :precision binary64
 (if (<= (* b b) 1e+148)
   (-
    (+
     (fma (fma (* 2.0 b) b (* a a)) (* a a) (* (* b b) (* b b)))
     (* 4.0 (* b b)))
    1.0)
   (/ 1.0 (/ 1.0 (fma (fma b b 4.0) (* b b) -1.0)))))

C

double code(double a, double b) {
	double tmp;
	if ((b * b) <= 1e+148) {
		tmp = (fma(fma((2.0 * b), b, (a * a)), (a * a), ((b * b) * (b * b))) + (4.0 * (b * b))) - 1.0;
	} else {
		tmp = 1.0 / (1.0 / fma(fma(b, b, 4.0), (b * b), -1.0));
	}
	return tmp;
}

Julia

function code(a, b)
	tmp = 0.0
	if (Float64(b * b) <= 1e+148)
		tmp = Float64(Float64(fma(fma(Float64(2.0 * b), b, Float64(a * a)), Float64(a * a), Float64(Float64(b * b) * Float64(b * b))) + Float64(4.0 * Float64(b * b))) - 1.0);
	else
		tmp = Float64(1.0 / Float64(1.0 / fma(fma(b, b, 4.0), Float64(b * b), -1.0)));
	end
	return tmp
end

Wolfram

code[a_, b_] := If[LessEqual[N[(b * b), $MachinePrecision], 1e+148], N[(N[(N[(N[(N[(2.0 * b), $MachinePrecision] * b + N[(a * a), $MachinePrecision]), $MachinePrecision] * N[(a * a), $MachinePrecision] + N[(N[(b * b), $MachinePrecision] * N[(b * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(4.0 * N[(b * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - 1.0), $MachinePrecision], N[(1.0 / N[(1.0 / N[(N[(b * b + 4.0), $MachinePrecision] * N[(b * b), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 b b) < 1e148

   1. Initial program 99.9%

      \[\left({\left(a \cdot a + b \cdot b\right)}^{2} + 4 \cdot \left(b \cdot b\right)\right) - 1 \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-+.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lower-fma.f64 99.9

         \[\leadsto \left({\color{blue}{\left(\mathsf{fma}\left(a, a, b \cdot b\right)\right)}}^{2} + 4 \cdot \left(b \cdot b\right)\right) - 1 \]

   4. Applied rewrites 99.9%

      \[\leadsto \left({\color{blue}{\left(\mathsf{fma}\left(a, a, b \cdot b\right)\right)}}^{2} + 4 \cdot \left(b \cdot b\right)\right) - 1 \]

   5. Taylor expanded in a around inf

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

      1. associate-+r+ N/A

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

      2. distribute-lft-in N/A

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

      3. *-commutative N/A

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

      4. metadata-eval N/A

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

      5. pow-sqr N/A

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

      6. metadata-eval N/A

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

      7. pow-sqr N/A

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

      8. metadata-eval N/A

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

      9. pow-sqr N/A

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

      10. times-frac N/A

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

      11. unswap-sqr N/A

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

   7. Applied rewrites 91.6%

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

   8. Taylor expanded in b around 0

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

   10. Applied rewrites 100.0%

       \[\leadsto \left(\color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(b \cdot 2, b, a \cdot a\right), a \cdot a, {b}^{4}\right)} + 4 \cdot \left(b \cdot b\right)\right) - 1 \]
   11. Step-by-step derivation

   12. Applied rewrites 99.9%

       \[\leadsto \left(\mathsf{fma}\left(\mathsf{fma}\left(b \cdot 2, b, a \cdot a\right), a \cdot a, \left(b \cdot b\right) \cdot \left(b \cdot b\right)\right) + 4 \cdot \left(b \cdot b\right)\right) - 1 \]

   if 1e148 < (*.f64 b b)

   1. Initial program 100.0%

      \[\left({\left(a \cdot a + b \cdot b\right)}^{2} + 4 \cdot \left(b \cdot b\right)\right) - 1 \]
   2. Add Preprocessing

   3. Taylor expanded in a around 0

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

      1. sub-neg N/A

         \[\leadsto \color{blue}{\left(4 \cdot {b}^{2} + {b}^{4}\right) + \left(\mathsf{neg}\left(1\right)\right)} \]

      2. metadata-eval N/A

         \[\leadsto \left(4 \cdot {b}^{2} + {b}^{\color{blue}{\left(2 \cdot 2\right)}}\right) + \left(\mathsf{neg}\left(1\right)\right) \]

      3. pow-sqr N/A

         \[\leadsto \left(4 \cdot {b}^{2} + \color{blue}{{b}^{2} \cdot {b}^{2}}\right) + \left(\mathsf{neg}\left(1\right)\right) \]

      4. distribute-rgt-out N/A

         \[\leadsto \color{blue}{{b}^{2} \cdot \left(4 + {b}^{2}\right)} + \left(\mathsf{neg}\left(1\right)\right) \]

      5. lower-fma.f64 N/A

         \[\leadsto \color{blue}{\mathsf{fma}\left({b}^{2}, 4 + {b}^{2}, \mathsf{neg}\left(1\right)\right)} \]

      6. unpow2 N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{b \cdot b}, 4 + {b}^{2}, \mathsf{neg}\left(1\right)\right) \]

      7. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{b \cdot b}, 4 + {b}^{2}, \mathsf{neg}\left(1\right)\right) \]

      8. +-commutative N/A

         \[\leadsto \mathsf{fma}\left(b \cdot b, \color{blue}{{b}^{2} + 4}, \mathsf{neg}\left(1\right)\right) \]

      9. unpow2 N/A

         \[\leadsto \mathsf{fma}\left(b \cdot b, \color{blue}{b \cdot b} + 4, \mathsf{neg}\left(1\right)\right) \]

      10. lower-fma.f64 N/A

          \[\leadsto \mathsf{fma}\left(b \cdot b, \color{blue}{\mathsf{fma}\left(b, b, 4\right)}, \mathsf{neg}\left(1\right)\right) \]

      11. metadata-eval 100.0

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

   5. Applied rewrites 100.0%

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

   7. Applied rewrites 100.0%

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

4. Final simplification 99.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \cdot b \leq 10^{+148}:\\ \;\;\;\;\left(\mathsf{fma}\left(\mathsf{fma}\left(2 \cdot b, b, a \cdot a\right), a \cdot a, \left(b \cdot b\right) \cdot \left(b \cdot b\right)\right) + 4 \cdot \left(b \cdot b\right)\right) - 1\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{\frac{1}{\mathsf{fma}\left(\mathsf{fma}\left(b, b, 4\right), b \cdot b, -1\right)}}\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 99.9% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \left(4 \cdot \left(b \cdot b\right) + {\left(\mathsf{fma}\left(a, a, b \cdot b\right)\right)}^{2}\right) - 1 \end{array} \]

FPCore

(FPCore (a b)
 :precision binary64
 (- (+ (* 4.0 (* b b)) (pow (fma a a (* b b)) 2.0)) 1.0))

C

double code(double a, double b) {
	return ((4.0 * (b * b)) + pow(fma(a, a, (b * b)), 2.0)) - 1.0;
}

Julia

function code(a, b)
	return Float64(Float64(Float64(4.0 * Float64(b * b)) + (fma(a, a, Float64(b * b)) ^ 2.0)) - 1.0)
end

Wolfram

code[a_, b_] := N[(N[(N[(4.0 * N[(b * b), $MachinePrecision]), $MachinePrecision] + N[Power[N[(a * a + N[(b * b), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] - 1.0), $MachinePrecision]

Derivation

1. Initial program 99.9%

   \[\left({\left(a \cdot a + b \cdot b\right)}^{2} + 4 \cdot \left(b \cdot b\right)\right) - 1 \]
2. Add Preprocessing
3. Step-by-step derivation

   1. lift-+.f64 N/A

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

   2. lift-*.f64 N/A

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

   3. lower-fma.f64 99.9

      \[\leadsto \left({\color{blue}{\left(\mathsf{fma}\left(a, a, b \cdot b\right)\right)}}^{2} + 4 \cdot \left(b \cdot b\right)\right) - 1 \]

4. Applied rewrites 99.9%

   \[\leadsto \left({\color{blue}{\left(\mathsf{fma}\left(a, a, b \cdot b\right)\right)}}^{2} + 4 \cdot \left(b \cdot b\right)\right) - 1 \]

5. Final simplification 99.9%

   \[\leadsto \left(4 \cdot \left(b \cdot b\right) + {\left(\mathsf{fma}\left(a, a, b \cdot b\right)\right)}^{2}\right) - 1 \]
6. Add Preprocessing

Alternative 3: 98.2% accurate, 2.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \cdot a \leq 50000:\\ \;\;\;\;\frac{1}{\frac{1}{\mathsf{fma}\left(\mathsf{fma}\left(b, b, 4\right), b \cdot b, -1\right)}}\\ \mathbf{else}:\\ \;\;\;\;\left(\mathsf{fma}\left(b \cdot b, 2, a \cdot a\right) \cdot a\right) \cdot a\\ \end{array} \end{array} \]

FPCore

(FPCore (a b)
 :precision binary64
 (if (<= (* a a) 50000.0)
   (/ 1.0 (/ 1.0 (fma (fma b b 4.0) (* b b) -1.0)))
   (* (* (fma (* b b) 2.0 (* a a)) a) a)))

C

double code(double a, double b) {
	double tmp;
	if ((a * a) <= 50000.0) {
		tmp = 1.0 / (1.0 / fma(fma(b, b, 4.0), (b * b), -1.0));
	} else {
		tmp = (fma((b * b), 2.0, (a * a)) * a) * a;
	}
	return tmp;
}

Julia

function code(a, b)
	tmp = 0.0
	if (Float64(a * a) <= 50000.0)
		tmp = Float64(1.0 / Float64(1.0 / fma(fma(b, b, 4.0), Float64(b * b), -1.0)));
	else
		tmp = Float64(Float64(fma(Float64(b * b), 2.0, Float64(a * a)) * a) * a);
	end
	return tmp
end

Wolfram

code[a_, b_] := If[LessEqual[N[(a * a), $MachinePrecision], 50000.0], N[(1.0 / N[(1.0 / N[(N[(b * b + 4.0), $MachinePrecision] * N[(b * b), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(b * b), $MachinePrecision] * 2.0 + N[(a * a), $MachinePrecision]), $MachinePrecision] * a), $MachinePrecision] * a), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 a a) < 5e4

   1. Initial program 99.9%

      \[\left({\left(a \cdot a + b \cdot b\right)}^{2} + 4 \cdot \left(b \cdot b\right)\right) - 1 \]
   2. Add Preprocessing

   3. Taylor expanded in a around 0

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

      1. sub-neg N/A

         \[\leadsto \color{blue}{\left(4 \cdot {b}^{2} + {b}^{4}\right) + \left(\mathsf{neg}\left(1\right)\right)} \]

      2. metadata-eval N/A

         \[\leadsto \left(4 \cdot {b}^{2} + {b}^{\color{blue}{\left(2 \cdot 2\right)}}\right) + \left(\mathsf{neg}\left(1\right)\right) \]

      3. pow-sqr N/A

         \[\leadsto \left(4 \cdot {b}^{2} + \color{blue}{{b}^{2} \cdot {b}^{2}}\right) + \left(\mathsf{neg}\left(1\right)\right) \]

      4. distribute-rgt-out N/A

         \[\leadsto \color{blue}{{b}^{2} \cdot \left(4 + {b}^{2}\right)} + \left(\mathsf{neg}\left(1\right)\right) \]

      5. lower-fma.f64 N/A

         \[\leadsto \color{blue}{\mathsf{fma}\left({b}^{2}, 4 + {b}^{2}, \mathsf{neg}\left(1\right)\right)} \]

      6. unpow2 N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{b \cdot b}, 4 + {b}^{2}, \mathsf{neg}\left(1\right)\right) \]

      7. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{b \cdot b}, 4 + {b}^{2}, \mathsf{neg}\left(1\right)\right) \]

      8. +-commutative N/A

         \[\leadsto \mathsf{fma}\left(b \cdot b, \color{blue}{{b}^{2} + 4}, \mathsf{neg}\left(1\right)\right) \]

      9. unpow2 N/A

         \[\leadsto \mathsf{fma}\left(b \cdot b, \color{blue}{b \cdot b} + 4, \mathsf{neg}\left(1\right)\right) \]

      10. lower-fma.f64 N/A

          \[\leadsto \mathsf{fma}\left(b \cdot b, \color{blue}{\mathsf{fma}\left(b, b, 4\right)}, \mathsf{neg}\left(1\right)\right) \]

      11. metadata-eval 99.9

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

   5. Applied rewrites 99.9%

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

   7. Applied rewrites 99.9%

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

   if 5e4 < (*.f64 a a)

   1. Initial program 99.9%

      \[\left({\left(a \cdot a + b \cdot b\right)}^{2} + 4 \cdot \left(b \cdot b\right)\right) - 1 \]
   2. Add Preprocessing

   3. Taylor expanded in a around inf

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

      1. distribute-rgt-in N/A

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

      2. *-lft-identity N/A

         \[\leadsto \color{blue}{{a}^{4}} + \left(2 \cdot \frac{{b}^{2}}{{a}^{2}}\right) \cdot {a}^{4} \]

      3. metadata-eval N/A

         \[\leadsto {a}^{\color{blue}{\left(2 \cdot 2\right)}} + \left(2 \cdot \frac{{b}^{2}}{{a}^{2}}\right) \cdot {a}^{4} \]

      4. pow-sqr N/A

         \[\leadsto \color{blue}{{a}^{2} \cdot {a}^{2}} + \left(2 \cdot \frac{{b}^{2}}{{a}^{2}}\right) \cdot {a}^{4} \]

      5. *-commutative N/A

         \[\leadsto {a}^{2} \cdot {a}^{2} + \color{blue}{{a}^{4} \cdot \left(2 \cdot \frac{{b}^{2}}{{a}^{2}}\right)} \]

      6. associate-*r/ N/A

         \[\leadsto {a}^{2} \cdot {a}^{2} + {a}^{4} \cdot \color{blue}{\frac{2 \cdot {b}^{2}}{{a}^{2}}} \]

      7. associate-*r/ N/A

         \[\leadsto {a}^{2} \cdot {a}^{2} + \color{blue}{\frac{{a}^{4} \cdot \left(2 \cdot {b}^{2}\right)}{{a}^{2}}} \]

      8. associate-*l/ N/A

         \[\leadsto {a}^{2} \cdot {a}^{2} + \color{blue}{\frac{{a}^{4}}{{a}^{2}} \cdot \left(2 \cdot {b}^{2}\right)} \]

      9. metadata-eval N/A

         \[\leadsto {a}^{2} \cdot {a}^{2} + \frac{{a}^{\color{blue}{\left(2 \cdot 2\right)}}}{{a}^{2}} \cdot \left(2 \cdot {b}^{2}\right) \]

      10. pow-sqr N/A

          \[\leadsto {a}^{2} \cdot {a}^{2} + \frac{\color{blue}{{a}^{2} \cdot {a}^{2}}}{{a}^{2}} \cdot \left(2 \cdot {b}^{2}\right) \]

      11. associate-/l* N/A

          \[\leadsto {a}^{2} \cdot {a}^{2} + \color{blue}{\left({a}^{2} \cdot \frac{{a}^{2}}{{a}^{2}}\right)} \cdot \left(2 \cdot {b}^{2}\right) \]

      12. *-inverses N/A

          \[\leadsto {a}^{2} \cdot {a}^{2} + \left({a}^{2} \cdot \color{blue}{1}\right) \cdot \left(2 \cdot {b}^{2}\right) \]

      13. *-rgt-identity N/A

          \[\leadsto {a}^{2} \cdot {a}^{2} + \color{blue}{{a}^{2}} \cdot \left(2 \cdot {b}^{2}\right) \]

      14. distribute-lft-in N/A

          \[\leadsto \color{blue}{{a}^{2} \cdot \left({a}^{2} + 2 \cdot {b}^{2}\right)} \]

      15. +-commutative N/A

          \[\leadsto {a}^{2} \cdot \color{blue}{\left(2 \cdot {b}^{2} + {a}^{2}\right)} \]

      16. unpow2 N/A

          \[\leadsto \color{blue}{\left(a \cdot a\right)} \cdot \left(2 \cdot {b}^{2} + {a}^{2}\right) \]

      17. associate-*l* N/A

          \[\leadsto \color{blue}{a \cdot \left(a \cdot \left(2 \cdot {b}^{2} + {a}^{2}\right)\right)} \]

      18. *-commutative N/A

          \[\leadsto \color{blue}{\left(a \cdot \left(2 \cdot {b}^{2} + {a}^{2}\right)\right) \cdot a} \]

      19. lower-*.f64 N/A

          \[\leadsto \color{blue}{\left(a \cdot \left(2 \cdot {b}^{2} + {a}^{2}\right)\right) \cdot a} \]

   5. Applied rewrites 97.7%

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

Alternative 4: 98.2% accurate, 3.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \cdot a \leq 50000:\\ \;\;\;\;\mathsf{fma}\left(b \cdot b, \mathsf{fma}\left(b, b, 4\right), -1\right)\\ \mathbf{else}:\\ \;\;\;\;\left(\mathsf{fma}\left(b \cdot b, 2, a \cdot a\right) \cdot a\right) \cdot a\\ \end{array} \end{array} \]

FPCore

(FPCore (a b)
 :precision binary64
 (if (<= (* a a) 50000.0)
   (fma (* b b) (fma b b 4.0) -1.0)
   (* (* (fma (* b b) 2.0 (* a a)) a) a)))

C

double code(double a, double b) {
	double tmp;
	if ((a * a) <= 50000.0) {
		tmp = fma((b * b), fma(b, b, 4.0), -1.0);
	} else {
		tmp = (fma((b * b), 2.0, (a * a)) * a) * a;
	}
	return tmp;
}

Julia

function code(a, b)
	tmp = 0.0
	if (Float64(a * a) <= 50000.0)
		tmp = fma(Float64(b * b), fma(b, b, 4.0), -1.0);
	else
		tmp = Float64(Float64(fma(Float64(b * b), 2.0, Float64(a * a)) * a) * a);
	end
	return tmp
end

Wolfram

code[a_, b_] := If[LessEqual[N[(a * a), $MachinePrecision], 50000.0], N[(N[(b * b), $MachinePrecision] * N[(b * b + 4.0), $MachinePrecision] + -1.0), $MachinePrecision], N[(N[(N[(N[(b * b), $MachinePrecision] * 2.0 + N[(a * a), $MachinePrecision]), $MachinePrecision] * a), $MachinePrecision] * a), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 a a) < 5e4

   1. Initial program 99.9%

      \[\left({\left(a \cdot a + b \cdot b\right)}^{2} + 4 \cdot \left(b \cdot b\right)\right) - 1 \]
   2. Add Preprocessing

   3. Taylor expanded in a around 0

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

      1. sub-neg N/A

         \[\leadsto \color{blue}{\left(4 \cdot {b}^{2} + {b}^{4}\right) + \left(\mathsf{neg}\left(1\right)\right)} \]

      2. metadata-eval N/A

         \[\leadsto \left(4 \cdot {b}^{2} + {b}^{\color{blue}{\left(2 \cdot 2\right)}}\right) + \left(\mathsf{neg}\left(1\right)\right) \]

      3. pow-sqr N/A

         \[\leadsto \left(4 \cdot {b}^{2} + \color{blue}{{b}^{2} \cdot {b}^{2}}\right) + \left(\mathsf{neg}\left(1\right)\right) \]

      4. distribute-rgt-out N/A

         \[\leadsto \color{blue}{{b}^{2} \cdot \left(4 + {b}^{2}\right)} + \left(\mathsf{neg}\left(1\right)\right) \]

      5. lower-fma.f64 N/A

         \[\leadsto \color{blue}{\mathsf{fma}\left({b}^{2}, 4 + {b}^{2}, \mathsf{neg}\left(1\right)\right)} \]

      6. unpow2 N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{b \cdot b}, 4 + {b}^{2}, \mathsf{neg}\left(1\right)\right) \]

      7. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{b \cdot b}, 4 + {b}^{2}, \mathsf{neg}\left(1\right)\right) \]

      8. +-commutative N/A

         \[\leadsto \mathsf{fma}\left(b \cdot b, \color{blue}{{b}^{2} + 4}, \mathsf{neg}\left(1\right)\right) \]

      9. unpow2 N/A

         \[\leadsto \mathsf{fma}\left(b \cdot b, \color{blue}{b \cdot b} + 4, \mathsf{neg}\left(1\right)\right) \]

      10. lower-fma.f64 N/A

          \[\leadsto \mathsf{fma}\left(b \cdot b, \color{blue}{\mathsf{fma}\left(b, b, 4\right)}, \mathsf{neg}\left(1\right)\right) \]

      11. metadata-eval 99.9

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

   5. Applied rewrites 99.9%

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

   if 5e4 < (*.f64 a a)

   1. Initial program 99.9%

      \[\left({\left(a \cdot a + b \cdot b\right)}^{2} + 4 \cdot \left(b \cdot b\right)\right) - 1 \]
   2. Add Preprocessing

   3. Taylor expanded in a around inf

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

      1. distribute-rgt-in N/A

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

      2. *-lft-identity N/A

         \[\leadsto \color{blue}{{a}^{4}} + \left(2 \cdot \frac{{b}^{2}}{{a}^{2}}\right) \cdot {a}^{4} \]

      3. metadata-eval N/A

         \[\leadsto {a}^{\color{blue}{\left(2 \cdot 2\right)}} + \left(2 \cdot \frac{{b}^{2}}{{a}^{2}}\right) \cdot {a}^{4} \]

      4. pow-sqr N/A

         \[\leadsto \color{blue}{{a}^{2} \cdot {a}^{2}} + \left(2 \cdot \frac{{b}^{2}}{{a}^{2}}\right) \cdot {a}^{4} \]

      5. *-commutative N/A

         \[\leadsto {a}^{2} \cdot {a}^{2} + \color{blue}{{a}^{4} \cdot \left(2 \cdot \frac{{b}^{2}}{{a}^{2}}\right)} \]

      6. associate-*r/ N/A

         \[\leadsto {a}^{2} \cdot {a}^{2} + {a}^{4} \cdot \color{blue}{\frac{2 \cdot {b}^{2}}{{a}^{2}}} \]

      7. associate-*r/ N/A

         \[\leadsto {a}^{2} \cdot {a}^{2} + \color{blue}{\frac{{a}^{4} \cdot \left(2 \cdot {b}^{2}\right)}{{a}^{2}}} \]

      8. associate-*l/ N/A

         \[\leadsto {a}^{2} \cdot {a}^{2} + \color{blue}{\frac{{a}^{4}}{{a}^{2}} \cdot \left(2 \cdot {b}^{2}\right)} \]

      9. metadata-eval N/A

         \[\leadsto {a}^{2} \cdot {a}^{2} + \frac{{a}^{\color{blue}{\left(2 \cdot 2\right)}}}{{a}^{2}} \cdot \left(2 \cdot {b}^{2}\right) \]

      10. pow-sqr N/A

          \[\leadsto {a}^{2} \cdot {a}^{2} + \frac{\color{blue}{{a}^{2} \cdot {a}^{2}}}{{a}^{2}} \cdot \left(2 \cdot {b}^{2}\right) \]

      11. associate-/l* N/A

          \[\leadsto {a}^{2} \cdot {a}^{2} + \color{blue}{\left({a}^{2} \cdot \frac{{a}^{2}}{{a}^{2}}\right)} \cdot \left(2 \cdot {b}^{2}\right) \]

      12. *-inverses N/A

          \[\leadsto {a}^{2} \cdot {a}^{2} + \left({a}^{2} \cdot \color{blue}{1}\right) \cdot \left(2 \cdot {b}^{2}\right) \]

      13. *-rgt-identity N/A

          \[\leadsto {a}^{2} \cdot {a}^{2} + \color{blue}{{a}^{2}} \cdot \left(2 \cdot {b}^{2}\right) \]

      14. distribute-lft-in N/A

          \[\leadsto \color{blue}{{a}^{2} \cdot \left({a}^{2} + 2 \cdot {b}^{2}\right)} \]

      15. +-commutative N/A

          \[\leadsto {a}^{2} \cdot \color{blue}{\left(2 \cdot {b}^{2} + {a}^{2}\right)} \]

      16. unpow2 N/A

          \[\leadsto \color{blue}{\left(a \cdot a\right)} \cdot \left(2 \cdot {b}^{2} + {a}^{2}\right) \]

      17. associate-*l* N/A

          \[\leadsto \color{blue}{a \cdot \left(a \cdot \left(2 \cdot {b}^{2} + {a}^{2}\right)\right)} \]

      18. *-commutative N/A

          \[\leadsto \color{blue}{\left(a \cdot \left(2 \cdot {b}^{2} + {a}^{2}\right)\right) \cdot a} \]

      19. lower-*.f64 N/A

          \[\leadsto \color{blue}{\left(a \cdot \left(2 \cdot {b}^{2} + {a}^{2}\right)\right) \cdot a} \]

   5. Applied rewrites 97.7%

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

Alternative 5: 93.3% accurate, 4.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \cdot a \leq 4 \cdot 10^{+127}:\\ \;\;\;\;\mathsf{fma}\left(b \cdot b, \mathsf{fma}\left(b, b, 4\right), -1\right)\\ \mathbf{else}:\\ \;\;\;\;\left(a \cdot a\right) \cdot \left(a \cdot a\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (a b)
 :precision binary64
 (if (<= (* a a) 4e+127) (fma (* b b) (fma b b 4.0) -1.0) (* (* a a) (* a a))))

C

double code(double a, double b) {
	double tmp;
	if ((a * a) <= 4e+127) {
		tmp = fma((b * b), fma(b, b, 4.0), -1.0);
	} else {
		tmp = (a * a) * (a * a);
	}
	return tmp;
}

Julia

function code(a, b)
	tmp = 0.0
	if (Float64(a * a) <= 4e+127)
		tmp = fma(Float64(b * b), fma(b, b, 4.0), -1.0);
	else
		tmp = Float64(Float64(a * a) * Float64(a * a));
	end
	return tmp
end

Wolfram

code[a_, b_] := If[LessEqual[N[(a * a), $MachinePrecision], 4e+127], N[(N[(b * b), $MachinePrecision] * N[(b * b + 4.0), $MachinePrecision] + -1.0), $MachinePrecision], N[(N[(a * a), $MachinePrecision] * N[(a * a), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 a a) < 3.99999999999999982e127

   1. Initial program 99.9%

      \[\left({\left(a \cdot a + b \cdot b\right)}^{2} + 4 \cdot \left(b \cdot b\right)\right) - 1 \]
   2. Add Preprocessing

   3. Taylor expanded in a around 0

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

      1. sub-neg N/A

         \[\leadsto \color{blue}{\left(4 \cdot {b}^{2} + {b}^{4}\right) + \left(\mathsf{neg}\left(1\right)\right)} \]

      2. metadata-eval N/A

         \[\leadsto \left(4 \cdot {b}^{2} + {b}^{\color{blue}{\left(2 \cdot 2\right)}}\right) + \left(\mathsf{neg}\left(1\right)\right) \]

      3. pow-sqr N/A

         \[\leadsto \left(4 \cdot {b}^{2} + \color{blue}{{b}^{2} \cdot {b}^{2}}\right) + \left(\mathsf{neg}\left(1\right)\right) \]

      4. distribute-rgt-out N/A

         \[\leadsto \color{blue}{{b}^{2} \cdot \left(4 + {b}^{2}\right)} + \left(\mathsf{neg}\left(1\right)\right) \]

      5. lower-fma.f64 N/A

         \[\leadsto \color{blue}{\mathsf{fma}\left({b}^{2}, 4 + {b}^{2}, \mathsf{neg}\left(1\right)\right)} \]

      6. unpow2 N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{b \cdot b}, 4 + {b}^{2}, \mathsf{neg}\left(1\right)\right) \]

      7. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{b \cdot b}, 4 + {b}^{2}, \mathsf{neg}\left(1\right)\right) \]

      8. +-commutative N/A

         \[\leadsto \mathsf{fma}\left(b \cdot b, \color{blue}{{b}^{2} + 4}, \mathsf{neg}\left(1\right)\right) \]

      9. unpow2 N/A

         \[\leadsto \mathsf{fma}\left(b \cdot b, \color{blue}{b \cdot b} + 4, \mathsf{neg}\left(1\right)\right) \]

      10. lower-fma.f64 N/A

          \[\leadsto \mathsf{fma}\left(b \cdot b, \color{blue}{\mathsf{fma}\left(b, b, 4\right)}, \mathsf{neg}\left(1\right)\right) \]

      11. metadata-eval 93.9

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

   5. Applied rewrites 93.9%

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

   if 3.99999999999999982e127 < (*.f64 a a)

   1. Initial program 100.0%

      \[\left({\left(a \cdot a + b \cdot b\right)}^{2} + 4 \cdot \left(b \cdot b\right)\right) - 1 \]
   2. Add Preprocessing

   3. Taylor expanded in a around inf

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

      1. lower-pow.f64 99.1

         \[\leadsto \color{blue}{{a}^{4}} \]

   5. Applied rewrites 99.1%

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

   7. Applied rewrites 99.1%

      \[\leadsto \left(a \cdot a\right) \cdot \color{blue}{\left(a \cdot a\right)} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 6: 92.9% accurate, 4.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \cdot a \leq 4 \cdot 10^{+127}:\\ \;\;\;\;\mathsf{fma}\left(b \cdot b, b \cdot b, -1\right)\\ \mathbf{else}:\\ \;\;\;\;\left(a \cdot a\right) \cdot \left(a \cdot a\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (a b)
 :precision binary64
 (if (<= (* a a) 4e+127) (fma (* b b) (* b b) -1.0) (* (* a a) (* a a))))

C

double code(double a, double b) {
	double tmp;
	if ((a * a) <= 4e+127) {
		tmp = fma((b * b), (b * b), -1.0);
	} else {
		tmp = (a * a) * (a * a);
	}
	return tmp;
}

Julia

function code(a, b)
	tmp = 0.0
	if (Float64(a * a) <= 4e+127)
		tmp = fma(Float64(b * b), Float64(b * b), -1.0);
	else
		tmp = Float64(Float64(a * a) * Float64(a * a));
	end
	return tmp
end

Wolfram

code[a_, b_] := If[LessEqual[N[(a * a), $MachinePrecision], 4e+127], N[(N[(b * b), $MachinePrecision] * N[(b * b), $MachinePrecision] + -1.0), $MachinePrecision], N[(N[(a * a), $MachinePrecision] * N[(a * a), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 a a) < 3.99999999999999982e127

   1. Initial program 99.9%

      \[\left({\left(a \cdot a + b \cdot b\right)}^{2} + 4 \cdot \left(b \cdot b\right)\right) - 1 \]
   2. Add Preprocessing

   3. Taylor expanded in a around 0

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

      1. sub-neg N/A

         \[\leadsto \color{blue}{\left(4 \cdot {b}^{2} + {b}^{4}\right) + \left(\mathsf{neg}\left(1\right)\right)} \]

      2. metadata-eval N/A

         \[\leadsto \left(4 \cdot {b}^{2} + {b}^{\color{blue}{\left(2 \cdot 2\right)}}\right) + \left(\mathsf{neg}\left(1\right)\right) \]

      3. pow-sqr N/A

         \[\leadsto \left(4 \cdot {b}^{2} + \color{blue}{{b}^{2} \cdot {b}^{2}}\right) + \left(\mathsf{neg}\left(1\right)\right) \]

      4. distribute-rgt-out N/A

         \[\leadsto \color{blue}{{b}^{2} \cdot \left(4 + {b}^{2}\right)} + \left(\mathsf{neg}\left(1\right)\right) \]

      5. lower-fma.f64 N/A

         \[\leadsto \color{blue}{\mathsf{fma}\left({b}^{2}, 4 + {b}^{2}, \mathsf{neg}\left(1\right)\right)} \]

      6. unpow2 N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{b \cdot b}, 4 + {b}^{2}, \mathsf{neg}\left(1\right)\right) \]

      7. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{b \cdot b}, 4 + {b}^{2}, \mathsf{neg}\left(1\right)\right) \]

      8. +-commutative N/A

         \[\leadsto \mathsf{fma}\left(b \cdot b, \color{blue}{{b}^{2} + 4}, \mathsf{neg}\left(1\right)\right) \]

      9. unpow2 N/A

         \[\leadsto \mathsf{fma}\left(b \cdot b, \color{blue}{b \cdot b} + 4, \mathsf{neg}\left(1\right)\right) \]

      10. lower-fma.f64 N/A

          \[\leadsto \mathsf{fma}\left(b \cdot b, \color{blue}{\mathsf{fma}\left(b, b, 4\right)}, \mathsf{neg}\left(1\right)\right) \]

      11. metadata-eval 93.9

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

   5. Applied rewrites 93.9%

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

   6. Taylor expanded in b around inf

      \[\leadsto \mathsf{fma}\left(b \cdot b, {b}^{\color{blue}{2}}, -1\right) \]
   7. Step-by-step derivation

   8. Applied rewrites 93.0%

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

   if 3.99999999999999982e127 < (*.f64 a a)

   1. Initial program 100.0%

      \[\left({\left(a \cdot a + b \cdot b\right)}^{2} + 4 \cdot \left(b \cdot b\right)\right) - 1 \]
   2. Add Preprocessing

   3. Taylor expanded in a around inf

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

      1. lower-pow.f64 99.1

         \[\leadsto \color{blue}{{a}^{4}} \]

   5. Applied rewrites 99.1%

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

   7. Applied rewrites 99.1%

      \[\leadsto \left(a \cdot a\right) \cdot \color{blue}{\left(a \cdot a\right)} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 7: 82.9% accurate, 4.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \cdot a \leq 50000:\\ \;\;\;\;\mathsf{fma}\left(b \cdot b, 4, -1\right)\\ \mathbf{else}:\\ \;\;\;\;\left(\left(a \cdot a\right) \cdot a\right) \cdot a\\ \end{array} \end{array} \]

FPCore

(FPCore (a b)
 :precision binary64
 (if (<= (* a a) 50000.0) (fma (* b b) 4.0 -1.0) (* (* (* a a) a) a)))

C

double code(double a, double b) {
	double tmp;
	if ((a * a) <= 50000.0) {
		tmp = fma((b * b), 4.0, -1.0);
	} else {
		tmp = ((a * a) * a) * a;
	}
	return tmp;
}

Julia

function code(a, b)
	tmp = 0.0
	if (Float64(a * a) <= 50000.0)
		tmp = fma(Float64(b * b), 4.0, -1.0);
	else
		tmp = Float64(Float64(Float64(a * a) * a) * a);
	end
	return tmp
end

Wolfram

code[a_, b_] := If[LessEqual[N[(a * a), $MachinePrecision], 50000.0], N[(N[(b * b), $MachinePrecision] * 4.0 + -1.0), $MachinePrecision], N[(N[(N[(a * a), $MachinePrecision] * a), $MachinePrecision] * a), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 a a) < 5e4

   1. Initial program 99.9%

      \[\left({\left(a \cdot a + b \cdot b\right)}^{2} + 4 \cdot \left(b \cdot b\right)\right) - 1 \]
   2. Add Preprocessing

   3. Taylor expanded in a around 0

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

      1. sub-neg N/A

         \[\leadsto \color{blue}{\left(4 \cdot {b}^{2} + {b}^{4}\right) + \left(\mathsf{neg}\left(1\right)\right)} \]

      2. metadata-eval N/A

         \[\leadsto \left(4 \cdot {b}^{2} + {b}^{\color{blue}{\left(2 \cdot 2\right)}}\right) + \left(\mathsf{neg}\left(1\right)\right) \]

      3. pow-sqr N/A

         \[\leadsto \left(4 \cdot {b}^{2} + \color{blue}{{b}^{2} \cdot {b}^{2}}\right) + \left(\mathsf{neg}\left(1\right)\right) \]

      4. distribute-rgt-out N/A

         \[\leadsto \color{blue}{{b}^{2} \cdot \left(4 + {b}^{2}\right)} + \left(\mathsf{neg}\left(1\right)\right) \]

      5. lower-fma.f64 N/A

         \[\leadsto \color{blue}{\mathsf{fma}\left({b}^{2}, 4 + {b}^{2}, \mathsf{neg}\left(1\right)\right)} \]

      6. unpow2 N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{b \cdot b}, 4 + {b}^{2}, \mathsf{neg}\left(1\right)\right) \]

      7. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{b \cdot b}, 4 + {b}^{2}, \mathsf{neg}\left(1\right)\right) \]

      8. +-commutative N/A

         \[\leadsto \mathsf{fma}\left(b \cdot b, \color{blue}{{b}^{2} + 4}, \mathsf{neg}\left(1\right)\right) \]

      9. unpow2 N/A

         \[\leadsto \mathsf{fma}\left(b \cdot b, \color{blue}{b \cdot b} + 4, \mathsf{neg}\left(1\right)\right) \]

      10. lower-fma.f64 N/A

          \[\leadsto \mathsf{fma}\left(b \cdot b, \color{blue}{\mathsf{fma}\left(b, b, 4\right)}, \mathsf{neg}\left(1\right)\right) \]

      11. metadata-eval 99.9

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

   5. Applied rewrites 99.9%

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

   6. Taylor expanded in b around 0

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

   8. Applied rewrites 72.7%

      \[\leadsto \mathsf{fma}\left(b \cdot b, 4, -1\right) \]

   if 5e4 < (*.f64 a a)

   1. Initial program 99.9%

      \[\left({\left(a \cdot a + b \cdot b\right)}^{2} + 4 \cdot \left(b \cdot b\right)\right) - 1 \]
   2. Add Preprocessing

   3. Taylor expanded in a around inf

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

      1. distribute-rgt-in N/A

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

      2. *-lft-identity N/A

         \[\leadsto \color{blue}{{a}^{4}} + \left(2 \cdot \frac{{b}^{2}}{{a}^{2}}\right) \cdot {a}^{4} \]

      3. metadata-eval N/A

         \[\leadsto {a}^{\color{blue}{\left(2 \cdot 2\right)}} + \left(2 \cdot \frac{{b}^{2}}{{a}^{2}}\right) \cdot {a}^{4} \]

      4. pow-sqr N/A

         \[\leadsto \color{blue}{{a}^{2} \cdot {a}^{2}} + \left(2 \cdot \frac{{b}^{2}}{{a}^{2}}\right) \cdot {a}^{4} \]

      5. *-commutative N/A

         \[\leadsto {a}^{2} \cdot {a}^{2} + \color{blue}{{a}^{4} \cdot \left(2 \cdot \frac{{b}^{2}}{{a}^{2}}\right)} \]

      6. associate-*r/ N/A

         \[\leadsto {a}^{2} \cdot {a}^{2} + {a}^{4} \cdot \color{blue}{\frac{2 \cdot {b}^{2}}{{a}^{2}}} \]

      7. associate-*r/ N/A

         \[\leadsto {a}^{2} \cdot {a}^{2} + \color{blue}{\frac{{a}^{4} \cdot \left(2 \cdot {b}^{2}\right)}{{a}^{2}}} \]

      8. associate-*l/ N/A

         \[\leadsto {a}^{2} \cdot {a}^{2} + \color{blue}{\frac{{a}^{4}}{{a}^{2}} \cdot \left(2 \cdot {b}^{2}\right)} \]

      9. metadata-eval N/A

         \[\leadsto {a}^{2} \cdot {a}^{2} + \frac{{a}^{\color{blue}{\left(2 \cdot 2\right)}}}{{a}^{2}} \cdot \left(2 \cdot {b}^{2}\right) \]

      10. pow-sqr N/A

          \[\leadsto {a}^{2} \cdot {a}^{2} + \frac{\color{blue}{{a}^{2} \cdot {a}^{2}}}{{a}^{2}} \cdot \left(2 \cdot {b}^{2}\right) \]

      11. associate-/l* N/A

          \[\leadsto {a}^{2} \cdot {a}^{2} + \color{blue}{\left({a}^{2} \cdot \frac{{a}^{2}}{{a}^{2}}\right)} \cdot \left(2 \cdot {b}^{2}\right) \]

      12. *-inverses N/A

          \[\leadsto {a}^{2} \cdot {a}^{2} + \left({a}^{2} \cdot \color{blue}{1}\right) \cdot \left(2 \cdot {b}^{2}\right) \]

      13. *-rgt-identity N/A

          \[\leadsto {a}^{2} \cdot {a}^{2} + \color{blue}{{a}^{2}} \cdot \left(2 \cdot {b}^{2}\right) \]

      14. distribute-lft-in N/A

          \[\leadsto \color{blue}{{a}^{2} \cdot \left({a}^{2} + 2 \cdot {b}^{2}\right)} \]

      15. +-commutative N/A

          \[\leadsto {a}^{2} \cdot \color{blue}{\left(2 \cdot {b}^{2} + {a}^{2}\right)} \]

      16. unpow2 N/A

          \[\leadsto \color{blue}{\left(a \cdot a\right)} \cdot \left(2 \cdot {b}^{2} + {a}^{2}\right) \]

      17. associate-*l* N/A

          \[\leadsto \color{blue}{a \cdot \left(a \cdot \left(2 \cdot {b}^{2} + {a}^{2}\right)\right)} \]

      18. *-commutative N/A

          \[\leadsto \color{blue}{\left(a \cdot \left(2 \cdot {b}^{2} + {a}^{2}\right)\right) \cdot a} \]

      19. lower-*.f64 N/A

          \[\leadsto \color{blue}{\left(a \cdot \left(2 \cdot {b}^{2} + {a}^{2}\right)\right) \cdot a} \]

   5. Applied rewrites 97.7%

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

   6. Taylor expanded in b around 0

      \[\leadsto \left({a}^{2} \cdot a\right) \cdot a \]
   7. Step-by-step derivation

   8. Applied rewrites 91.3%

      \[\leadsto \left(\left(a \cdot a\right) \cdot a\right) \cdot a \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 8: 82.9% accurate, 4.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \cdot a \leq 66000:\\ \;\;\;\;\mathsf{fma}\left(b \cdot b, 4, -1\right)\\ \mathbf{else}:\\ \;\;\;\;\left(a \cdot a\right) \cdot \left(a \cdot a\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (a b)
 :precision binary64
 (if (<= (* a a) 66000.0) (fma (* b b) 4.0 -1.0) (* (* a a) (* a a))))

C

double code(double a, double b) {
	double tmp;
	if ((a * a) <= 66000.0) {
		tmp = fma((b * b), 4.0, -1.0);
	} else {
		tmp = (a * a) * (a * a);
	}
	return tmp;
}

Julia

function code(a, b)
	tmp = 0.0
	if (Float64(a * a) <= 66000.0)
		tmp = fma(Float64(b * b), 4.0, -1.0);
	else
		tmp = Float64(Float64(a * a) * Float64(a * a));
	end
	return tmp
end

Wolfram

code[a_, b_] := If[LessEqual[N[(a * a), $MachinePrecision], 66000.0], N[(N[(b * b), $MachinePrecision] * 4.0 + -1.0), $MachinePrecision], N[(N[(a * a), $MachinePrecision] * N[(a * a), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 a a) < 66000

   1. Initial program 99.9%

      \[\left({\left(a \cdot a + b \cdot b\right)}^{2} + 4 \cdot \left(b \cdot b\right)\right) - 1 \]
   2. Add Preprocessing

   3. Taylor expanded in a around 0

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

      1. sub-neg N/A

         \[\leadsto \color{blue}{\left(4 \cdot {b}^{2} + {b}^{4}\right) + \left(\mathsf{neg}\left(1\right)\right)} \]

      2. metadata-eval N/A

         \[\leadsto \left(4 \cdot {b}^{2} + {b}^{\color{blue}{\left(2 \cdot 2\right)}}\right) + \left(\mathsf{neg}\left(1\right)\right) \]

      3. pow-sqr N/A

         \[\leadsto \left(4 \cdot {b}^{2} + \color{blue}{{b}^{2} \cdot {b}^{2}}\right) + \left(\mathsf{neg}\left(1\right)\right) \]

      4. distribute-rgt-out N/A

         \[\leadsto \color{blue}{{b}^{2} \cdot \left(4 + {b}^{2}\right)} + \left(\mathsf{neg}\left(1\right)\right) \]

      5. lower-fma.f64 N/A

         \[\leadsto \color{blue}{\mathsf{fma}\left({b}^{2}, 4 + {b}^{2}, \mathsf{neg}\left(1\right)\right)} \]

      6. unpow2 N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{b \cdot b}, 4 + {b}^{2}, \mathsf{neg}\left(1\right)\right) \]

      7. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{b \cdot b}, 4 + {b}^{2}, \mathsf{neg}\left(1\right)\right) \]

      8. +-commutative N/A

         \[\leadsto \mathsf{fma}\left(b \cdot b, \color{blue}{{b}^{2} + 4}, \mathsf{neg}\left(1\right)\right) \]

      9. unpow2 N/A

         \[\leadsto \mathsf{fma}\left(b \cdot b, \color{blue}{b \cdot b} + 4, \mathsf{neg}\left(1\right)\right) \]

      10. lower-fma.f64 N/A

          \[\leadsto \mathsf{fma}\left(b \cdot b, \color{blue}{\mathsf{fma}\left(b, b, 4\right)}, \mathsf{neg}\left(1\right)\right) \]

      11. metadata-eval 99.9

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

   5. Applied rewrites 99.9%

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

   6. Taylor expanded in b around 0

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

   8. Applied rewrites 72.7%

      \[\leadsto \mathsf{fma}\left(b \cdot b, 4, -1\right) \]

   if 66000 < (*.f64 a a)

   1. Initial program 99.9%

      \[\left({\left(a \cdot a + b \cdot b\right)}^{2} + 4 \cdot \left(b \cdot b\right)\right) - 1 \]
   2. Add Preprocessing

   3. Taylor expanded in a around inf

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

      1. lower-pow.f64 91.3

         \[\leadsto \color{blue}{{a}^{4}} \]

   5. Applied rewrites 91.3%

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

   7. Applied rewrites 91.3%

      \[\leadsto \left(a \cdot a\right) \cdot \color{blue}{\left(a \cdot a\right)} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 9: 52.1% accurate, 10.9× speedup

Math

\[\begin{array}{l} \\ \mathsf{fma}\left(b \cdot b, 4, -1\right) \end{array} \]

FPCore

(FPCore (a b) :precision binary64 (fma (* b b) 4.0 -1.0))

C

double code(double a, double b) {
	return fma((b * b), 4.0, -1.0);
}

Julia

function code(a, b)
	return fma(Float64(b * b), 4.0, -1.0)
end

Wolfram

code[a_, b_] := N[(N[(b * b), $MachinePrecision] * 4.0 + -1.0), $MachinePrecision]

Derivation

1. Initial program 99.9%

   \[\left({\left(a \cdot a + b \cdot b\right)}^{2} + 4 \cdot \left(b \cdot b\right)\right) - 1 \]
2. Add Preprocessing

3. Taylor expanded in a around 0

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

   1. sub-neg N/A

      \[\leadsto \color{blue}{\left(4 \cdot {b}^{2} + {b}^{4}\right) + \left(\mathsf{neg}\left(1\right)\right)} \]

   2. metadata-eval N/A

      \[\leadsto \left(4 \cdot {b}^{2} + {b}^{\color{blue}{\left(2 \cdot 2\right)}}\right) + \left(\mathsf{neg}\left(1\right)\right) \]

   3. pow-sqr N/A

      \[\leadsto \left(4 \cdot {b}^{2} + \color{blue}{{b}^{2} \cdot {b}^{2}}\right) + \left(\mathsf{neg}\left(1\right)\right) \]

   4. distribute-rgt-out N/A

      \[\leadsto \color{blue}{{b}^{2} \cdot \left(4 + {b}^{2}\right)} + \left(\mathsf{neg}\left(1\right)\right) \]

   5. lower-fma.f64 N/A

      \[\leadsto \color{blue}{\mathsf{fma}\left({b}^{2}, 4 + {b}^{2}, \mathsf{neg}\left(1\right)\right)} \]

   6. unpow2 N/A

      \[\leadsto \mathsf{fma}\left(\color{blue}{b \cdot b}, 4 + {b}^{2}, \mathsf{neg}\left(1\right)\right) \]

   7. lower-*.f64 N/A

      \[\leadsto \mathsf{fma}\left(\color{blue}{b \cdot b}, 4 + {b}^{2}, \mathsf{neg}\left(1\right)\right) \]

   8. +-commutative N/A

      \[\leadsto \mathsf{fma}\left(b \cdot b, \color{blue}{{b}^{2} + 4}, \mathsf{neg}\left(1\right)\right) \]

   9. unpow2 N/A

      \[\leadsto \mathsf{fma}\left(b \cdot b, \color{blue}{b \cdot b} + 4, \mathsf{neg}\left(1\right)\right) \]

   10. lower-fma.f64 N/A

       \[\leadsto \mathsf{fma}\left(b \cdot b, \color{blue}{\mathsf{fma}\left(b, b, 4\right)}, \mathsf{neg}\left(1\right)\right) \]

   11. metadata-eval 71.3

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

5. Applied rewrites 71.3%

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

6. Taylor expanded in b around 0

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

8. Applied rewrites 52.9%

   \[\leadsto \mathsf{fma}\left(b \cdot b, 4, -1\right) \]
9. Add Preprocessing

Alternative 10: 25.8% accurate, 131.0× speedup

Math

\[\begin{array}{l} \\ -1 \end{array} \]

FPCore

(FPCore (a b) :precision binary64 -1.0)

C

double code(double a, double b) {
	return -1.0;
}

Fortran

real(8) function code(a, b)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    code = -1.0d0
end function

Java

public static double code(double a, double b) {
	return -1.0;
}

Python

def code(a, b):
	return -1.0

Julia

function code(a, b)
	return -1.0
end

MATLAB

function tmp = code(a, b)
	tmp = -1.0;
end

Wolfram

code[a_, b_] := -1.0

Derivation

1. Initial program 99.9%

   \[\left({\left(a \cdot a + b \cdot b\right)}^{2} + 4 \cdot \left(b \cdot b\right)\right) - 1 \]
2. Add Preprocessing

3. Taylor expanded in a around 0

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

   1. sub-neg N/A

      \[\leadsto \color{blue}{\left(4 \cdot {b}^{2} + {b}^{4}\right) + \left(\mathsf{neg}\left(1\right)\right)} \]

   2. metadata-eval N/A

      \[\leadsto \left(4 \cdot {b}^{2} + {b}^{\color{blue}{\left(2 \cdot 2\right)}}\right) + \left(\mathsf{neg}\left(1\right)\right) \]

   3. pow-sqr N/A

      \[\leadsto \left(4 \cdot {b}^{2} + \color{blue}{{b}^{2} \cdot {b}^{2}}\right) + \left(\mathsf{neg}\left(1\right)\right) \]

   4. distribute-rgt-out N/A

      \[\leadsto \color{blue}{{b}^{2} \cdot \left(4 + {b}^{2}\right)} + \left(\mathsf{neg}\left(1\right)\right) \]

   5. lower-fma.f64 N/A

      \[\leadsto \color{blue}{\mathsf{fma}\left({b}^{2}, 4 + {b}^{2}, \mathsf{neg}\left(1\right)\right)} \]

   6. unpow2 N/A

      \[\leadsto \mathsf{fma}\left(\color{blue}{b \cdot b}, 4 + {b}^{2}, \mathsf{neg}\left(1\right)\right) \]

   7. lower-*.f64 N/A

      \[\leadsto \mathsf{fma}\left(\color{blue}{b \cdot b}, 4 + {b}^{2}, \mathsf{neg}\left(1\right)\right) \]

   8. +-commutative N/A

      \[\leadsto \mathsf{fma}\left(b \cdot b, \color{blue}{{b}^{2} + 4}, \mathsf{neg}\left(1\right)\right) \]

   9. unpow2 N/A

      \[\leadsto \mathsf{fma}\left(b \cdot b, \color{blue}{b \cdot b} + 4, \mathsf{neg}\left(1\right)\right) \]

   10. lower-fma.f64 N/A

       \[\leadsto \mathsf{fma}\left(b \cdot b, \color{blue}{\mathsf{fma}\left(b, b, 4\right)}, \mathsf{neg}\left(1\right)\right) \]

   11. metadata-eval 71.3

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

5. Applied rewrites 71.3%

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

6. Taylor expanded in b around 0

   \[\leadsto -1 \]
7. Step-by-step derivation

8. Applied rewrites 25.8%

   \[\leadsto -1 \]
9. Add Preprocessing

Reproduce

herbie shell --seed 2024263 
(FPCore (a b)
  :name "Bouland and Aaronson, Equation (26)"
  :precision binary64
  (- (+ (pow (+ (* a a) (* b b)) 2.0) (* 4.0 (* b b))) 1.0))