Bouland and Aaronson, Equation (26)

Percentage Accurate: 99.9% → 99.9%

Time: 8.1s

Alternatives: 12

Speedup: 1.0×

• 60.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(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.9% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[a_, b_] := N[(N[(N[(4.0 * N[(b * b), $MachinePrecision]), $MachinePrecision] + N[Power[N[(N[(b * b), $MachinePrecision] + N[(a * a), $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. Final simplification 99.9%

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

Alternative 2: 69.8% accurate, 0.9× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (+.f64 (pow.f64 (+.f64 (*.f64 a a) (*.f64 b b)) #s(literal 2 binary64)) (*.f64 #s(literal 4 binary64) (*.f64 b b))) < 2e-3

   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. +-commutative N/A

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

      3. metadata-eval N/A

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

      4. pow-sqr N/A

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

      5. distribute-rgt-out N/A

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

      6. lower-fma.f64 N/A

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

      7. unpow2 N/A

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

      8. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{b \cdot b}, {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 98.9

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

   5. Applied rewrites 98.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 98.9%

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

   8. Taylor expanded in b around 0

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

   10. Applied rewrites 98.7%

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

   if 2e-3 < (+.f64 (pow.f64 (+.f64 (*.f64 a a) (*.f64 b b)) #s(literal 2 binary64)) (*.f64 #s(literal 4 binary64) (*.f64 b b)))

   1. Initial program 99.8%

      \[\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. +-commutative N/A

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

      3. metadata-eval N/A

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

      4. pow-sqr N/A

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

      5. distribute-rgt-out N/A

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

      6. lower-fma.f64 N/A

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

      7. unpow2 N/A

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

      8. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{b \cdot b}, {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 54.9

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

   5. Applied rewrites 54.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 {b}^{4} \cdot \color{blue}{\left(1 + 4 \cdot \frac{1}{{b}^{2}}\right)} \]
   7. Step-by-step derivation

   8. Applied rewrites 55.3%

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

   10. Applied rewrites 55.3%

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

4. Final simplification 66.3%

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

Alternative 3: 51.7% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := 4 \cdot \left(b \cdot b\right)\\ \mathbf{if}\;t\_0 + {\left(b \cdot b + a \cdot a\right)}^{2} \leq 0.002:\\ \;\;\;\;-1\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (a b)
 :precision binary64
 (let* ((t_0 (* 4.0 (* b b))))
   (if (<= (+ t_0 (pow (+ (* b b) (* a a)) 2.0)) 0.002) -1.0 t_0)))

C

double code(double a, double b) {
	double t_0 = 4.0 * (b * b);
	double tmp;
	if ((t_0 + pow(((b * b) + (a * a)), 2.0)) <= 0.002) {
		tmp = -1.0;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Fortran

real(8) function code(a, b)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: t_0
    real(8) :: tmp
    t_0 = 4.0d0 * (b * b)
    if ((t_0 + (((b * b) + (a * a)) ** 2.0d0)) <= 0.002d0) then
        tmp = -1.0d0
    else
        tmp = t_0
    end if
    code = tmp
end function

Java

public static double code(double a, double b) {
	double t_0 = 4.0 * (b * b);
	double tmp;
	if ((t_0 + Math.pow(((b * b) + (a * a)), 2.0)) <= 0.002) {
		tmp = -1.0;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(a, b):
	t_0 = 4.0 * (b * b)
	tmp = 0
	if (t_0 + math.pow(((b * b) + (a * a)), 2.0)) <= 0.002:
		tmp = -1.0
	else:
		tmp = t_0
	return tmp

Julia

function code(a, b)
	t_0 = Float64(4.0 * Float64(b * b))
	tmp = 0.0
	if (Float64(t_0 + (Float64(Float64(b * b) + Float64(a * a)) ^ 2.0)) <= 0.002)
		tmp = -1.0;
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b)
	t_0 = 4.0 * (b * b);
	tmp = 0.0;
	if ((t_0 + (((b * b) + (a * a)) ^ 2.0)) <= 0.002)
		tmp = -1.0;
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (+.f64 (pow.f64 (+.f64 (*.f64 a a) (*.f64 b b)) #s(literal 2 binary64)) (*.f64 #s(literal 4 binary64) (*.f64 b b))) < 2e-3

   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. +-commutative N/A

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

      3. metadata-eval N/A

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

      4. pow-sqr N/A

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

      5. distribute-rgt-out N/A

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

      6. lower-fma.f64 N/A

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

      7. unpow2 N/A

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

      8. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{b \cdot b}, {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 98.9

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

   5. Applied rewrites 98.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 -1 \]
   7. Step-by-step derivation

   8. Applied rewrites 98.1%

      \[\leadsto -1 \]

   if 2e-3 < (+.f64 (pow.f64 (+.f64 (*.f64 a a) (*.f64 b b)) #s(literal 2 binary64)) (*.f64 #s(literal 4 binary64) (*.f64 b b)))

   1. Initial program 99.8%

      \[\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. +-commutative N/A

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

      3. metadata-eval N/A

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

      4. pow-sqr N/A

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

      5. distribute-rgt-out N/A

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

      6. lower-fma.f64 N/A

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

      7. unpow2 N/A

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

      8. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{b \cdot b}, {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 54.9

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

   5. Applied rewrites 54.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 {b}^{4} \cdot \color{blue}{\left(1 + 4 \cdot \frac{1}{{b}^{2}}\right)} \]
   7. Step-by-step derivation

   8. Applied rewrites 55.3%

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

   9. Taylor expanded in b around 0

      \[\leadsto 4 \cdot {b}^{\color{blue}{2}} \]
   10. Step-by-step derivation

   11. Applied rewrites 35.5%

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

4. Final simplification 51.4%

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

Alternative 4: 98.4% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 a a) < 1.99999999999999991e-6

   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. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. unpow2 N/A

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

      4. lower-*.f64 N/A

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

      5. lower-pow.f64 100.0

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

   5. Applied rewrites 100.0%

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

   if 1.99999999999999991e-6 < (*.f64 a a)

   1. Initial program 99.8%

      \[\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)} - 1 \]
   4. Step-by-step derivation

      1. *-commutative N/A

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

      2. +-commutative N/A

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

      3. distribute-lft1-in N/A

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

      4. associate-*r/ N/A

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

      5. associate-*l/ N/A

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

      6. associate-/l* N/A

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

      7. metadata-eval N/A

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

      8. pow-sqr N/A

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

      9. associate-/l* N/A

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

      10. *-inverses N/A

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

      11. *-rgt-identity N/A

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

      12. metadata-eval N/A

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

      13. pow-sqr N/A

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

      14. distribute-rgt-in N/A

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

      15. *-commutative N/A

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

      16. unpow2 N/A

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

      17. associate-*r* N/A

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

   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} - 1 \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 5: 98.4% accurate, 3.2× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 a a) < 1.99999999999999991e-6

   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. +-commutative N/A

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

      3. metadata-eval N/A

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

      4. pow-sqr N/A

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

      5. distribute-rgt-out N/A

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

      6. lower-fma.f64 N/A

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

      7. unpow2 N/A

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

      8. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{b \cdot b}, {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 \mathsf{fma}\left(\mathsf{fma}\left(b, b, 4\right) \cdot b, \color{blue}{b}, -1\right) \]

   if 1.99999999999999991e-6 < (*.f64 a a)

   1. Initial program 99.8%

      \[\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)} - 1 \]
   4. Step-by-step derivation

      1. *-commutative N/A

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

      2. +-commutative N/A

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

      3. distribute-lft1-in N/A

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

      4. associate-*r/ N/A

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

      5. associate-*l/ N/A

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

      6. associate-/l* N/A

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

      7. metadata-eval N/A

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

      8. pow-sqr N/A

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

      9. associate-/l* N/A

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

      10. *-inverses N/A

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

      11. *-rgt-identity N/A

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

      12. metadata-eval N/A

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

      13. pow-sqr N/A

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

      14. distribute-rgt-in N/A

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

      15. *-commutative N/A

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

      16. unpow2 N/A

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

      17. associate-*r* N/A

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

   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} - 1 \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 6: 97.8% accurate, 3.4× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 b b) < 5e18

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

      1. *-commutative N/A

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

      2. +-commutative N/A

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

      3. distribute-lft1-in N/A

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

      4. associate-*r/ N/A

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

      5. associate-*l/ N/A

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

      6. associate-/l* N/A

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

      7. metadata-eval N/A

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

      8. pow-sqr N/A

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

      9. associate-/l* N/A

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

      10. *-inverses N/A

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

      11. *-rgt-identity N/A

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

      12. metadata-eval N/A

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

      13. pow-sqr N/A

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

      14. distribute-rgt-in N/A

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

      15. *-commutative N/A

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

      16. unpow2 N/A

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

      17. associate-*r* N/A

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

   5. Applied rewrites 98.2%

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

   6. Taylor expanded in a around inf

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

   8. Applied rewrites 98.2%

      \[\leadsto \left(\left(a \cdot a\right) \cdot a\right) \cdot a - 1 \]

   if 5e18 < (*.f64 b b)

   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 \left(\color{blue}{\left(2 \cdot \left({a}^{2} \cdot {b}^{2}\right) + {b}^{4}\right)} + 4 \cdot \left(b \cdot b\right)\right) - 1 \]
   4. Step-by-step derivation

      1. associate-*r* N/A

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

      2. metadata-eval N/A

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

      3. pow-sqr N/A

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

      4. distribute-rgt-in N/A

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

      5. *-commutative N/A

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

      6. unpow2 N/A

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

      7. associate-*r* N/A

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

      8. lower-*.f64 N/A

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

      9. lower-*.f64 N/A

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

      10. *-commutative N/A

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

      11. lower-fma.f64 N/A

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

      12. unpow2 N/A

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

      13. lower-*.f64 N/A

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

      14. unpow2 N/A

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

      15. lower-*.f64 98.3

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

   5. Applied rewrites 98.3%

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

      1. lift--.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. +-commutative N/A

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

      4. associate--l+ N/A

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

      5. lift-*.f64 N/A

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

      6. *-commutative N/A

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

      7. lower-fma.f64 N/A

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

      8. lower--.f64 98.3

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

   7. Applied rewrites 98.3%

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

   8. Taylor expanded in b around inf

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

      1. +-commutative N/A

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

      2. associate-+r+ N/A

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

      3. distribute-rgt-in N/A

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

   10. Applied rewrites 98.3%

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

Alternative 7: 94.6% accurate, 4.4× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 a a) < 1.99999999999999991e-6

   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. +-commutative N/A

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

      3. metadata-eval N/A

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

      4. pow-sqr N/A

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

      5. distribute-rgt-out N/A

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

      6. lower-fma.f64 N/A

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

      7. unpow2 N/A

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

      8. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{b \cdot b}, {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 \mathsf{fma}\left(\mathsf{fma}\left(b, b, 4\right) \cdot b, \color{blue}{b}, -1\right) \]

   if 1.99999999999999991e-6 < (*.f64 a a)

   1. Initial program 99.8%

      \[\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)} - 1 \]
   4. Step-by-step derivation

      1. *-commutative N/A

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

      2. +-commutative N/A

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

      3. distribute-lft1-in N/A

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

      4. associate-*r/ N/A

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

      5. associate-*l/ N/A

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

      6. associate-/l* N/A

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

      7. metadata-eval N/A

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

      8. pow-sqr N/A

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

      9. associate-/l* N/A

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

      10. *-inverses N/A

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

      11. *-rgt-identity N/A

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

      12. metadata-eval N/A

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

      13. pow-sqr N/A

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

      14. distribute-rgt-in N/A

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

      15. *-commutative N/A

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

      16. unpow2 N/A

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

      17. associate-*r* N/A

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

   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} - 1 \]

   6. Taylor expanded in a around inf

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

   8. Applied rewrites 94.0%

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

Alternative 8: 94.6% accurate, 4.4× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   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. +-commutative N/A

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

      3. metadata-eval N/A

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

      4. pow-sqr N/A

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

      5. distribute-rgt-out N/A

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

      6. lower-fma.f64 N/A

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

      7. unpow2 N/A

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

      8. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{b \cdot b}, {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 \mathsf{fma}\left(\mathsf{fma}\left(b, b, 4\right) \cdot b, \color{blue}{b}, -1\right) \]

   if 0.0029 < (*.f64 a a)

   1. Initial program 99.8%

      \[\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}} - 1 \]
   4. Step-by-step derivation

      1. lower-pow.f64 94.1

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

   5. Applied rewrites 94.1%

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

   7. Applied rewrites 93.9%

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

Alternative 9: 69.8% accurate, 7.3× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

code[a_, b_] := N[(N[(N[(b * b + 4.0), $MachinePrecision] * b), $MachinePrecision] * b + -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. +-commutative N/A

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

   3. metadata-eval N/A

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

   4. pow-sqr N/A

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

   5. distribute-rgt-out N/A

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

   6. lower-fma.f64 N/A

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

   7. unpow2 N/A

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

   8. lower-*.f64 N/A

      \[\leadsto \mathsf{fma}\left(\color{blue}{b \cdot b}, {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 66.1

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

5. Applied rewrites 66.1%

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

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

Alternative 10: 69.8% accurate, 7.3× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

code[a_, b_] := N[(N[(b * b), $MachinePrecision] * N[(b * b + 4.0), $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. 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. +-commutative N/A

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

   3. metadata-eval N/A

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

   4. pow-sqr N/A

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

   5. distribute-rgt-out N/A

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

   6. lower-fma.f64 N/A

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

   7. unpow2 N/A

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

   8. lower-*.f64 N/A

      \[\leadsto \mathsf{fma}\left(\color{blue}{b \cdot b}, {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 66.1

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

5. Applied rewrites 66.1%

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

Alternative 11: 51.5% accurate, 10.9× 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 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. +-commutative N/A

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

   3. metadata-eval N/A

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

   4. pow-sqr N/A

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

   5. distribute-rgt-out N/A

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

   6. lower-fma.f64 N/A

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

   7. unpow2 N/A

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

   8. lower-*.f64 N/A

      \[\leadsto \mathsf{fma}\left(\color{blue}{b \cdot b}, {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 66.1

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

5. Applied rewrites 66.1%

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

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

8. Taylor expanded in b around 0

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

10. Applied rewrites 51.2%

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

Alternative 12: 25.2% 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. +-commutative N/A

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

   3. metadata-eval N/A

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

   4. pow-sqr N/A

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

   5. distribute-rgt-out N/A

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

   6. lower-fma.f64 N/A

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

   7. unpow2 N/A

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

   8. lower-*.f64 N/A

      \[\leadsto \mathsf{fma}\left(\color{blue}{b \cdot b}, {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 66.1

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

5. Applied rewrites 66.1%

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

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

Reproduce

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