Bouland and Aaronson, Equation (25)

Percentage Accurate: 74.7% → 96.6%

Time: 10.2s

Alternatives: 14

Speedup: 5.7×

• 61.0% 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(\left(a \cdot a\right) \cdot \left(1 + a\right) + \left(b \cdot b\right) \cdot \left(1 - 3 \cdot a\right)\right)\right) - 1 \end{array} \]

FPCore

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

C

double code(double a, double b) {
	return (pow(((a * a) + (b * b)), 2.0) + (4.0 * (((a * a) * (1.0 + a)) + ((b * b) * (1.0 - (3.0 * a)))))) - 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 * (((a * a) * (1.0d0 + a)) + ((b * b) * (1.0d0 - (3.0d0 * a)))))) - 1.0d0
end function

Java

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

Python

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

Julia

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

MATLAB

function tmp = code(a, b)
	tmp = ((((a * a) + (b * b)) ^ 2.0) + (4.0 * (((a * a) * (1.0 + a)) + ((b * b) * (1.0 - (3.0 * a)))))) - 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[(N[(N[(a * a), $MachinePrecision] * N[(1.0 + a), $MachinePrecision]), $MachinePrecision] + N[(N[(b * b), $MachinePrecision] * N[(1.0 - N[(3.0 * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - 1.0), $MachinePrecision]

Initial Program: 74.7% accurate, 1.0× speedup

Math

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

FPCore

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

C

double code(double a, double b) {
	return (pow(((a * a) + (b * b)), 2.0) + (4.0 * (((a * a) * (1.0 + a)) + ((b * b) * (1.0 - (3.0 * a)))))) - 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 * (((a * a) * (1.0d0 + a)) + ((b * b) * (1.0d0 - (3.0d0 * a)))))) - 1.0d0
end function

Java

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

Python

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

Julia

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

MATLAB

function tmp = code(a, b)
	tmp = ((((a * a) + (b * b)) ^ 2.0) + (4.0 * (((a * a) * (1.0 + a)) + ((b * b) * (1.0 - (3.0 * a)))))) - 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[(N[(N[(a * a), $MachinePrecision] * N[(1.0 + a), $MachinePrecision]), $MachinePrecision] + N[(N[(b * b), $MachinePrecision] * N[(1.0 - N[(3.0 * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - 1.0), $MachinePrecision]

Alternative 1: 96.6% accurate, 2.7× speedup

Math

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

FPCore

(FPCore (a b)
 :precision binary64
 (if (<= (* b b) 2e-32)
   (fma (fma (+ 4.0 a) a 4.0) (* a a) -1.0)
   (-
    (fma (* (fma b b (fma -12.0 a 4.0)) b) b (* (* (fma (* b b) 2.0 4.0) a) a))
    1.0)))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 b b) < 2.00000000000000011e-32

   1. Initial program 84.8%

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

   3. Taylor expanded in a around 0

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

   5. Applied rewrites 73.6%

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

   6. Taylor expanded in b around inf

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

   8. Applied rewrites 73.6%

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

   9. Taylor expanded in b around 0

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

       1. sub-neg N/A

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

   11. Applied rewrites 99.9%

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

   13. Applied rewrites 99.9%

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

   if 2.00000000000000011e-32 < (*.f64 b b)

   1. Initial program 70.6%

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

   3. Taylor expanded in a around 0

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

   5. Applied rewrites 99.2%

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

Alternative 2: 97.4% accurate, 3.1× speedup

Math

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

FPCore

(FPCore (a b)
 :precision binary64
 (if (<= (* b b) 2e-32)
   (fma (fma (+ 4.0 a) a 4.0) (* a a) -1.0)
   (- (fma (* 4.0 a) a (* (* (fma b b (* (* a a) 2.0)) b) b)) 1.0)))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 b b) < 2.00000000000000011e-32

   1. Initial program 84.8%

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

   3. Taylor expanded in a around 0

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

   5. Applied rewrites 73.6%

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

   6. Taylor expanded in b around inf

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

   8. Applied rewrites 73.6%

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

   9. Taylor expanded in b around 0

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

       1. sub-neg N/A

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

   11. Applied rewrites 99.9%

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

   13. Applied rewrites 99.9%

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

   if 2.00000000000000011e-32 < (*.f64 b b)

   1. Initial program 70.6%

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

   3. Taylor expanded in a around 0

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

   5. Applied rewrites 89.0%

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

   6. Taylor expanded in a around inf

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

   8. Applied rewrites 87.6%

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

   9. Taylor expanded in a around 0

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

   11. Applied rewrites 98.6%

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

4. Final simplification 99.2%

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

Alternative 3: 97.7% accurate, 3.1× speedup

Math

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

FPCore

(FPCore (a b)
 :precision binary64
 (if (<= (* b b) 2e-14)
   (fma (fma (+ 4.0 a) a 4.0) (* a a) -1.0)
   (- (fma (* (* b b) b) b (* (* (* (* a b) 2.0) b) a)) 1.0)))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 b b) < 2e-14

   1. Initial program 85.3%

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

   3. Taylor expanded in a around 0

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

   5. Applied rewrites 74.5%

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

   6. Taylor expanded in b around inf

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

   8. Applied rewrites 74.4%

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

   9. Taylor expanded in b around 0

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

       1. sub-neg N/A

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

   11. Applied rewrites 99.8%

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

   13. Applied rewrites 99.8%

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

   if 2e-14 < (*.f64 b b)

   1. Initial program 69.7%

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

   3. Taylor expanded in a around 0

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

   5. Applied rewrites 99.2%

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

   6. Taylor expanded in b around inf

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

   8. Applied rewrites 98.6%

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

   9. Taylor expanded in b around inf

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

   11. Applied rewrites 98.6%

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

4. Final simplification 99.2%

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

Alternative 4: 93.2% accurate, 4.3× speedup

Math

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

FPCore

(FPCore (a b)
 :precision binary64
 (if (<= (* b b) 2e-32)
   (fma (fma (+ 4.0 a) a 4.0) (* a a) -1.0)
   (- (* (* (fma b b (fma -12.0 a 4.0)) b) b) 1.0)))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 b b) < 2.00000000000000011e-32

   1. Initial program 84.8%

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

   3. Taylor expanded in a around 0

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

   5. Applied rewrites 73.6%

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

   6. Taylor expanded in b around inf

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

   8. Applied rewrites 73.6%

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

   9. Taylor expanded in b around 0

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

       1. sub-neg N/A

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

   11. Applied rewrites 99.9%

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

   13. Applied rewrites 99.9%

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

   if 2.00000000000000011e-32 < (*.f64 b b)

   1. Initial program 70.6%

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

   3. Taylor expanded in a around 0

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

      1. associate-+r+ N/A

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

      2. associate-*r* N/A

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

      3. distribute-rgt-out N/A

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

      4. metadata-eval N/A

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

      5. pow-sqr N/A

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

      6. distribute-lft-out N/A

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

      7. metadata-eval N/A

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

      8. associate-*r* N/A

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

      9. metadata-eval N/A

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

      10. distribute-lft-neg-in N/A

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

      11. metadata-eval N/A

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

      12. distribute-lft-in N/A

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

      13. +-commutative N/A

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

      14. sub-neg N/A

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

      15. *-commutative N/A

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

      16. unpow2 N/A

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

      17. associate-*r* N/A

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

      18. lower-*.f64 N/A

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

   5. Applied rewrites 96.1%

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

Alternative 5: 93.3% accurate, 5.0× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 b b) < 2.00000000000000011e-32

   1. Initial program 84.8%

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

   3. Taylor expanded in a around 0

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

   5. Applied rewrites 73.6%

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

   6. Taylor expanded in b around inf

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

   8. Applied rewrites 73.6%

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

   9. Taylor expanded in b around 0

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

       1. sub-neg N/A

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

   11. Applied rewrites 99.9%

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

   13. Applied rewrites 99.9%

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

   if 2.00000000000000011e-32 < (*.f64 b b)

   1. Initial program 70.6%

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

   3. Taylor expanded in a around 0

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

   5. Applied rewrites 99.2%

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

   6. Taylor expanded in a around 0

      \[\leadsto \color{blue}{\left(4 \cdot {b}^{2} + {b}^{4}\right) - 1} \]
   7. 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-in N/A

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

      5. *-commutative N/A

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

      6. unpow2 N/A

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

      7. associate-*r* N/A

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

      8. *-commutative N/A

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

      9. metadata-eval N/A

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

      10. lower-fma.f64 N/A

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

      11. *-commutative N/A

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

      12. lower-*.f64 N/A

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

      13. +-commutative N/A

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

      14. unpow2 N/A

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

      15. lower-fma.f64 93.5

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

   8. Applied rewrites 93.5%

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

Alternative 6: 93.3% accurate, 5.0× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 b b) < 2.00000000000000011e-32

   1. Initial program 84.8%

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

   3. Taylor expanded in a around 0

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

   5. Applied rewrites 73.6%

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

   6. Taylor expanded in b around inf

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

   8. Applied rewrites 73.6%

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

   9. Taylor expanded in b around 0

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

       1. sub-neg N/A

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

   11. Applied rewrites 99.9%

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

   if 2.00000000000000011e-32 < (*.f64 b b)

   1. Initial program 70.6%

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

   3. Taylor expanded in a around 0

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

   5. Applied rewrites 99.2%

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

   6. Taylor expanded in a around 0

      \[\leadsto \color{blue}{\left(4 \cdot {b}^{2} + {b}^{4}\right) - 1} \]
   7. 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-in N/A

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

      5. *-commutative N/A

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

      6. unpow2 N/A

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

      7. associate-*r* N/A

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

      8. *-commutative N/A

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

      9. metadata-eval N/A

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

      10. lower-fma.f64 N/A

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

      11. *-commutative N/A

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

      12. lower-*.f64 N/A

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

      13. +-commutative N/A

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

      14. unpow2 N/A

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

      15. lower-fma.f64 93.5

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

   8. Applied rewrites 93.5%

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

4. Final simplification 96.4%

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

Alternative 7: 92.7% accurate, 5.2× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 b b) < 2.00000000000000011e-32

   1. Initial program 84.8%

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

   3. Taylor expanded in a around 0

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

   5. Applied rewrites 73.6%

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

   6. Taylor expanded in b around inf

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

   8. Applied rewrites 73.6%

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

   9. Taylor expanded in b around 0

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

       1. sub-neg N/A

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

   11. Applied rewrites 99.9%

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

   12. Taylor expanded in a around inf

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

   14. Applied rewrites 97.8%

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

   if 2.00000000000000011e-32 < (*.f64 b b)

   1. Initial program 70.6%

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

   3. Taylor expanded in a around 0

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

   5. Applied rewrites 99.2%

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

   6. Taylor expanded in a around 0

      \[\leadsto \color{blue}{\left(4 \cdot {b}^{2} + {b}^{4}\right) - 1} \]
   7. 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-in N/A

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

      5. *-commutative N/A

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

      6. unpow2 N/A

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

      7. associate-*r* N/A

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

      8. *-commutative N/A

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

      9. metadata-eval N/A

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

      10. lower-fma.f64 N/A

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

      11. *-commutative N/A

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

      12. lower-*.f64 N/A

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

      13. +-commutative N/A

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

      14. unpow2 N/A

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

      15. lower-fma.f64 93.5

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

   8. Applied rewrites 93.5%

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

4. Final simplification 95.5%

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

Alternative 8: 92.4% accurate, 5.3× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 b b) < 2.00000000000000011e-32

   1. Initial program 84.8%

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

   3. Taylor expanded in a around inf

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

      1. lower-pow.f64 97.0

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

   5. Applied rewrites 97.0%

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

   7. Applied rewrites 96.9%

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

   if 2.00000000000000011e-32 < (*.f64 b b)

   1. Initial program 70.6%

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

   3. Taylor expanded in a around 0

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

   5. Applied rewrites 99.2%

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

   6. Taylor expanded in a around 0

      \[\leadsto \color{blue}{\left(4 \cdot {b}^{2} + {b}^{4}\right) - 1} \]
   7. 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-in N/A

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

      5. *-commutative N/A

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

      6. unpow2 N/A

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

      7. associate-*r* N/A

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

      8. *-commutative N/A

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

      9. metadata-eval N/A

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

      10. lower-fma.f64 N/A

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

      11. *-commutative N/A

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

      12. lower-*.f64 N/A

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

      13. +-commutative N/A

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

      14. unpow2 N/A

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

      15. lower-fma.f64 93.5

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

   8. Applied rewrites 93.5%

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

Alternative 9: 84.8% accurate, 5.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \mathsf{fma}\left(4 \cdot a, a, -1\right)\\ \mathbf{if}\;a \leq -1 \cdot 10^{+153}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;a \leq 6.8 \cdot 10^{+153}:\\ \;\;\;\;\mathsf{fma}\left(\left(b \cdot b\right) \cdot b, b, -1\right)\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (a b)
 :precision binary64
 (let* ((t_0 (fma (* 4.0 a) a -1.0)))
   (if (<= a -1e+153)
     t_0
     (if (<= a 6.8e+153) (fma (* (* b b) b) b -1.0) t_0))))

C

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

Julia

function code(a, b)
	t_0 = fma(Float64(4.0 * a), a, -1.0)
	tmp = 0.0
	if (a <= -1e+153)
		tmp = t_0;
	elseif (a <= 6.8e+153)
		tmp = fma(Float64(Float64(b * b) * b), b, -1.0);
	else
		tmp = t_0;
	end
	return tmp
end

Wolfram

code[a_, b_] := Block[{t$95$0 = N[(N[(4.0 * a), $MachinePrecision] * a + -1.0), $MachinePrecision]}, If[LessEqual[a, -1e+153], t$95$0, If[LessEqual[a, 6.8e+153], N[(N[(N[(b * b), $MachinePrecision] * b), $MachinePrecision] * b + -1.0), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if a < -1e153 or 6.7999999999999995e153 < a

   1. Initial program 26.3%

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

   3. Taylor expanded in a around 0

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

   5. Applied rewrites 96.8%

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

   6. Taylor expanded in b around inf

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

   8. Applied rewrites 98.5%

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

   9. Taylor expanded in b around 0

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

       1. sub-neg N/A

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

   11. Applied rewrites 100.0%

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

   12. Taylor expanded in a around 0

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

   14. Applied rewrites 98.5%

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

   if -1e153 < a < 6.7999999999999995e153

   1. Initial program 91.8%

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

   3. Taylor expanded in a around 0

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

   5. Applied rewrites 84.6%

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

   6. Taylor expanded in a around 0

      \[\leadsto \color{blue}{\left(4 \cdot {b}^{2} + {b}^{4}\right) - 1} \]
   7. 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-in N/A

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

      5. *-commutative N/A

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

      6. unpow2 N/A

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

      7. associate-*r* N/A

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

      8. *-commutative N/A

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

      9. metadata-eval N/A

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

      10. lower-fma.f64 N/A

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

      11. *-commutative N/A

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

      12. lower-*.f64 N/A

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

      13. +-commutative N/A

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

      14. unpow2 N/A

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

      15. lower-fma.f64 82.9

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

   8. Applied rewrites 82.9%

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

   9. Taylor expanded in b around inf

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

   11. Applied rewrites 82.0%

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

Alternative 10: 92.4% accurate, 5.5× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 b b) < 2.00000000000000011e-32

   1. Initial program 84.8%

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

   3. Taylor expanded in a around 0

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

   5. Applied rewrites 73.6%

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

   6. Taylor expanded in b around inf

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

   8. Applied rewrites 73.6%

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

   9. Taylor expanded in b around 0

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

       1. sub-neg N/A

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

   11. Applied rewrites 99.9%

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

   12. Taylor expanded in a around inf

       \[\leadsto \mathsf{fma}\left({a}^{2} \cdot a, a, -1\right) \]
   13. Step-by-step derivation

   14. Applied rewrites 96.9%

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

   if 2.00000000000000011e-32 < (*.f64 b b)

   1. Initial program 70.6%

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

   3. Taylor expanded in a around 0

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

   5. Applied rewrites 99.2%

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

   6. Taylor expanded in a around 0

      \[\leadsto \color{blue}{\left(4 \cdot {b}^{2} + {b}^{4}\right) - 1} \]
   7. 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-in N/A

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

      5. *-commutative N/A

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

      6. unpow2 N/A

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

      7. associate-*r* N/A

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

      8. *-commutative N/A

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

      9. metadata-eval N/A

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

      10. lower-fma.f64 N/A

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

      11. *-commutative N/A

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

      12. lower-*.f64 N/A

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

      13. +-commutative N/A

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

      14. unpow2 N/A

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

      15. lower-fma.f64 93.5

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

   8. Applied rewrites 93.5%

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

Alternative 11: 91.9% accurate, 5.7× speedup

Math

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

FPCore

(FPCore (a b)
 :precision binary64
 (if (<= (* b b) 2e-32) (fma (* (* a a) a) a -1.0) (fma (* (* b b) b) b -1.0)))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 b b) < 2.00000000000000011e-32

   1. Initial program 84.8%

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

   3. Taylor expanded in a around 0

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

   5. Applied rewrites 73.6%

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

   6. Taylor expanded in b around inf

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

   8. Applied rewrites 73.6%

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

   9. Taylor expanded in b around 0

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

       1. sub-neg N/A

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

   11. Applied rewrites 99.9%

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

   12. Taylor expanded in a around inf

       \[\leadsto \mathsf{fma}\left({a}^{2} \cdot a, a, -1\right) \]
   13. Step-by-step derivation

   14. Applied rewrites 96.9%

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

   if 2.00000000000000011e-32 < (*.f64 b b)

   1. Initial program 70.6%

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

   3. Taylor expanded in a around 0

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

   5. Applied rewrites 99.2%

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

   6. Taylor expanded in a around 0

      \[\leadsto \color{blue}{\left(4 \cdot {b}^{2} + {b}^{4}\right) - 1} \]
   7. 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-in N/A

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

      5. *-commutative N/A

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

      6. unpow2 N/A

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

      7. associate-*r* N/A

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

      8. *-commutative N/A

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

      9. metadata-eval N/A

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

      10. lower-fma.f64 N/A

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

      11. *-commutative N/A

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

      12. lower-*.f64 N/A

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

      13. +-commutative N/A

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

      14. unpow2 N/A

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

      15. lower-fma.f64 93.5

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

   8. Applied rewrites 93.5%

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

   9. Taylor expanded in b around inf

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

   11. Applied rewrites 92.1%

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

Alternative 12: 69.9% accurate, 7.0× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 b b) < 4.9999999999999998e290

   1. Initial program 80.9%

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

   3. Taylor expanded in a around 0

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

   5. Applied rewrites 83.0%

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

   6. Taylor expanded in b around inf

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

   8. Applied rewrites 82.5%

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

   9. Taylor expanded in b around 0

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

       1. sub-neg N/A

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

   11. Applied rewrites 75.3%

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

   12. Taylor expanded in a around 0

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

   14. Applied rewrites 55.9%

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

   if 4.9999999999999998e290 < (*.f64 b b)

   1. Initial program 66.2%

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

   3. Taylor expanded in a around 0

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

   5. Applied rewrites 100.0%

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

   6. Taylor expanded in a around 0

      \[\leadsto \color{blue}{\left(4 \cdot {b}^{2} + {b}^{4}\right) - 1} \]
   7. 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-in N/A

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

      5. *-commutative N/A

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

      6. unpow2 N/A

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

      7. associate-*r* N/A

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

      8. *-commutative N/A

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

      9. metadata-eval N/A

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

      10. lower-fma.f64 N/A

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

      11. *-commutative N/A

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

      12. lower-*.f64 N/A

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

      13. +-commutative N/A

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

      14. unpow2 N/A

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

      15. lower-fma.f64 100.0

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

   8. Applied rewrites 100.0%

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

   9. Taylor expanded in b around 0

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

   11. Applied rewrites 98.6%

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

Alternative 13: 51.4% accurate, 13.3× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 77.2%

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

3. Taylor expanded in a around 0

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

5. Applied rewrites 87.3%

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

6. Taylor expanded in a around 0

   \[\leadsto \color{blue}{\left(4 \cdot {b}^{2} + {b}^{4}\right) - 1} \]
7. 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-in N/A

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

   5. *-commutative N/A

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

   6. unpow2 N/A

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

   7. associate-*r* N/A

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

   8. *-commutative N/A

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

   9. metadata-eval N/A

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

   10. lower-fma.f64 N/A

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

   11. *-commutative N/A

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

   12. lower-*.f64 N/A

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

   13. +-commutative N/A

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

   14. unpow2 N/A

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

   15. lower-fma.f64 72.1

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

8. Applied rewrites 72.1%

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

9. Taylor expanded in b around 0

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

11. Applied rewrites 50.5%

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

Alternative 14: 24.8% accurate, 160.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 77.2%

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

3. Taylor expanded in a around 0

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

5. Applied rewrites 87.3%

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

6. Taylor expanded in b around inf

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

8. Applied rewrites 87.0%

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

9. Taylor expanded in b around 0

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

    1. sub-neg N/A

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

11. Applied rewrites 64.2%

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

12. Taylor expanded in a around 0

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

14. Applied rewrites 24.1%

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

Reproduce

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