Bouland and Aaronson, Equation (26)

Percentage Accurate: 99.9% → 99.9%

Time: 8.2s

Alternatives: 12

Speedup: 2.8×

• 60.5% 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({\left(\mathsf{fma}\left(a, a, b \cdot b\right)\right)}^{2} + 4 \cdot \left(b \cdot b\right)\right) - 1 \end{array} \]

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 99.9%

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

   1. lift-+.f64 N/A

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

   2. lift-*.f64 N/A

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

   3. lower-fma.f64 99.9

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

4. Applied rewrites 99.9%

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

Alternative 2: 70.8% accurate, 0.9× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

code[a_, b_] := If[LessEqual[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], 0.002], N[(N[(b * b), $MachinePrecision] * 4.0 + -1.0), $MachinePrecision], N[(N[(b * b + 4.0), $MachinePrecision] * N[(b * b), $MachinePrecision]), $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 100.0

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

   5. Applied rewrites 100.0%

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

   6. Taylor expanded in b around 0

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

   8. Applied rewrites 99.0%

      \[\leadsto \mathsf{fma}\left(b \cdot b, 4, -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.5%

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

   10. Applied rewrites 55.5%

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

Alternative 3: 70.8% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;{\left(a \cdot a + b \cdot b\right)}^{2} + 4 \cdot \left(b \cdot b\right) \leq 0.002:\\ \;\;\;\;\mathsf{fma}\left(b \cdot b, 4, -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 (<= (+ (pow (+ (* a a) (* b b)) 2.0) (* 4.0 (* b b))) 0.002)
   (fma (* b b) 4.0 -1.0)
   (* (* (fma b b 4.0) b) b)))

C

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

Julia

function code(a, b)
	tmp = 0.0
	if (Float64((Float64(Float64(a * a) + Float64(b * b)) ^ 2.0) + Float64(4.0 * Float64(b * b))) <= 0.002)
		tmp = fma(Float64(b * b), 4.0, -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[Power[N[(N[(a * a), $MachinePrecision] + N[(b * b), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] + N[(4.0 * N[(b * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.002], N[(N[(b * b), $MachinePrecision] * 4.0 + -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 100.0

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

   5. Applied rewrites 100.0%

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

   6. Taylor expanded in b around 0

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

   8. Applied rewrites 99.0%

      \[\leadsto \mathsf{fma}\left(b \cdot b, 4, -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.5%

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

Alternative 4: 52.8% accurate, 0.9× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[a_, b_] := If[LessEqual[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], 0.002], -1.0, N[(N[(b * b), $MachinePrecision] * 4.0), $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 100.0

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

   5. Applied rewrites 100.0%

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

   6. Taylor expanded in b around 0

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

   8. Applied rewrites 97.3%

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

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

   9. Taylor expanded in b around 0

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

   11. Applied rewrites 28.8%

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

Alternative 5: 99.9% accurate, 2.8× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 99.9%

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

   1. lift-+.f64 N/A

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

   2. lift-*.f64 N/A

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

   3. lower-fma.f64 99.9

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

4. Applied rewrites 99.9%

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

5. Taylor expanded in a around 0

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

7. Applied rewrites 94.1%

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

9. Applied rewrites 99.9%

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

Alternative 6: 98.2% accurate, 3.2× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 b b) < 1.99999999999999989e-20

   1. Initial program 99.9%

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

      1. lift-+.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lower-fma.f64 99.9

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

   4. Applied rewrites 99.9%

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

   5. Taylor expanded in a around inf

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

      1. distribute-rgt-in N/A

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

      2. *-lft-identity N/A

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

      3. metadata-eval N/A

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

      4. pow-sqr N/A

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

      5. associate-*l* N/A

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

      6. *-commutative N/A

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

      7. metadata-eval N/A

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

      8. pow-sqr N/A

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

      9. associate-*l* N/A

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

      10. associate-*r/ N/A

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

      11. *-commutative N/A

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

      12. associate-/l* N/A

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

      13. *-inverses N/A

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

      14. *-rgt-identity N/A

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

      15. *-commutative N/A

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

      16. associate-*r* N/A

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

      17. *-commutative N/A

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

   7. Applied rewrites 99.9%

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

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

      1. sub-neg N/A

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

      2. associate-+r+ N/A

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

      3. associate-*r* N/A

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

      4. distribute-rgt-in N/A

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

      5. +-commutative N/A

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

      6. metadata-eval N/A

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

      7. pow-sqr N/A

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

      8. distribute-lft-in N/A

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

      9. associate-+r+ N/A

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

      10. *-commutative N/A

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

      11. lower-fma.f64 N/A

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

   5. Applied rewrites 97.3%

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

Alternative 7: 86.4% accurate, 3.3× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 b b) < 0.0

   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(2 \cdot \left({a}^{2} \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(2 \cdot \left({a}^{2} \cdot {b}^{2}\right) + 4 \cdot {b}^{2}\right) + {b}^{4}\right)} - 1 \]

      2. associate-*r* N/A

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

      3. distribute-rgt-in N/A

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

      4. +-commutative N/A

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

      5. metadata-eval N/A

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

      6. pow-sqr N/A

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

      7. distribute-lft-in N/A

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

      8. associate-+r+ N/A

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

      9. *-commutative N/A

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

      10. unpow2 N/A

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

      11. associate-*r* N/A

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

      12. lower-*.f64 N/A

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

   5. Applied rewrites 78.3%

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

   6. Taylor expanded in a around inf

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

   8. Applied rewrites 78.3%

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

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

      1. sub-neg N/A

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

      2. associate-+r+ N/A

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

      3. associate-*r* N/A

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

      4. distribute-rgt-in N/A

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

      5. +-commutative N/A

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

      6. metadata-eval N/A

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

      7. pow-sqr N/A

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

      8. distribute-lft-in N/A

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

      9. associate-+r+ N/A

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

      10. *-commutative N/A

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

      11. lower-fma.f64 N/A

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

   5. Applied rewrites 88.8%

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

Alternative 8: 86.2% accurate, 3.7× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 a a) < 5.00000000000000046e105

   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 87.9

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

   5. Applied rewrites 87.9%

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

   if 5.00000000000000046e105 < (*.f64 a a)

   1. Initial program 100.0%

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

   3. Taylor expanded in a around 0

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

      2. associate-*r* N/A

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

      3. distribute-rgt-in N/A

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

      4. +-commutative N/A

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

      5. metadata-eval N/A

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

      6. pow-sqr N/A

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

      7. distribute-lft-in N/A

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

      8. associate-+r+ N/A

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

      9. *-commutative N/A

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

      10. unpow2 N/A

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

      11. associate-*r* N/A

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

      12. lower-*.f64 N/A

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

   5. Applied rewrites 81.5%

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

   6. Taylor expanded in a around inf

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

   8. Applied rewrites 81.5%

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

Alternative 9: 80.3% accurate, 4.0× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 a a) < 5.00000000000000046e105

   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 87.9

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

   5. Applied rewrites 87.9%

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

   if 5.00000000000000046e105 < (*.f64 a a)

   1. Initial program 100.0%

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

   3. Taylor expanded in a around 0

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

      1. sub-neg N/A

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

      2. associate-+r+ N/A

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

      3. associate-*r* N/A

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

      4. distribute-rgt-in N/A

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

      5. +-commutative N/A

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

      6. metadata-eval N/A

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

      7. pow-sqr N/A

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

      8. distribute-lft-in N/A

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

      9. associate-+r+ N/A

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

      10. *-commutative N/A

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

      11. lower-fma.f64 N/A

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

   5. Applied rewrites 64.7%

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

   6. Taylor expanded in a around inf

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

   8. Applied rewrites 64.7%

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

Alternative 10: 70.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 69.0

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

5. Applied rewrites 69.0%

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

Alternative 11: 52.7% accurate, 10.9× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 99.9%

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

3. Taylor expanded in a around 0

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

   1. sub-neg N/A

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

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

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

5. Applied rewrites 69.0%

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

6. Taylor expanded in b around 0

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

8. Applied rewrites 50.4%

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

Alternative 12: 25.6% 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 69.0

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

5. Applied rewrites 69.0%

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

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

Reproduce

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