Bouland and Aaronson, Equation (24)

Percentage Accurate: 73.3% → 99.7%

Time: 6.9s

Alternatives: 8

Speedup: 5.2×

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

Specification

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 73.3% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 99.7% accurate, 3.6× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 77.6%

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

3. Taylor expanded in a around 0

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

   1. lower-*.f64 N/A

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

   2. unpow2 N/A

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

   3. lower-*.f64 99.1

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

5. Applied rewrites 99.1%

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

   2. +-commutative N/A

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

   3. lift-*.f64 N/A

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

   4. lower-fma.f64 99.1

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

7. Applied rewrites 99.1%

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

8. Taylor expanded in b around 0

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

10. Applied rewrites 95.6%

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

11. Taylor expanded in a around 0

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

13. Applied rewrites 99.5%

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

14. Final simplification 99.5%

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

Alternative 2: 93.3% accurate, 4.2× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 b b) < 1.99999999999999997e77

   1. Initial program 86.1%

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

   3. Taylor expanded in b around 0

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. unpow2 N/A

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

      4. associate-*r* N/A

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

      5. sub-neg N/A

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

      6. mul-1-neg N/A

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

      7. *-commutative N/A

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

      8. lower-*.f64 N/A

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

      9. +-commutative N/A

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

      10. distribute-rgt-in N/A

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

      11. *-lft-identity N/A

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

      12. lower-fma.f64 N/A

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

      13. mul-1-neg N/A

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

      14. lower-neg.f64 N/A

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

      15. lower-pow.f64 82.3

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

   5. Applied rewrites 82.3%

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

   6. Taylor expanded in a around 0

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

   8. Applied rewrites 95.3%

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

   if 1.99999999999999997e77 < (*.f64 b b)

   1. Initial program 66.6%

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

   3. Taylor expanded in a around 0

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

      1. associate-+r+ N/A

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

      2. associate-*r* N/A

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

      3. distribute-rgt-out N/A

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

      4. metadata-eval N/A

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

      5. distribute-lft-in N/A

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

      6. +-commutative N/A

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

      7. metadata-eval N/A

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

      8. pow-sqr N/A

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

      9. distribute-lft-in N/A

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

      10. *-commutative N/A

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

      11. unpow2 N/A

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

      12. associate-*r* N/A

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

      13. lower-*.f64 N/A

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

   5. Applied rewrites 95.7%

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

Alternative 3: 93.9% accurate, 4.6× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 b b) < 4.00000000000000019e57

   1. Initial program 86.6%

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

   3. Taylor expanded in b around 0

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. unpow2 N/A

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

      4. associate-*r* N/A

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

      5. sub-neg N/A

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

      6. mul-1-neg N/A

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

      7. *-commutative N/A

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

      8. lower-*.f64 N/A

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

      9. +-commutative N/A

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

      10. distribute-rgt-in N/A

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

      11. *-lft-identity N/A

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

      12. lower-fma.f64 N/A

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

      13. mul-1-neg N/A

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

      14. lower-neg.f64 N/A

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

      15. lower-pow.f64 82.7

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

   5. Applied rewrites 82.7%

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

   6. Taylor expanded in a around 0

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

   8. Applied rewrites 95.9%

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

   if 4.00000000000000019e57 < (*.f64 b b)

   1. Initial program 66.3%

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

   3. Taylor expanded in a around 0

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

      1. lower-*.f64 N/A

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

      2. unpow2 N/A

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

      3. lower-*.f64 99.9

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

   5. Applied rewrites 99.9%

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

   6. Taylor expanded in a around 0

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

      1. sub-neg N/A

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

      2. +-commutative N/A

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

      3. metadata-eval N/A

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

      4. metadata-eval N/A

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

      5. pow-sqr N/A

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

      6. distribute-rgt-in N/A

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

      7. +-commutative N/A

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

      8. unpow2 N/A

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

      9. associate-*l* N/A

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

      10. *-commutative N/A

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

      11. lower-fma.f64 N/A

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

      12. *-commutative N/A

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

      13. lower-*.f64 N/A

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

      14. +-commutative N/A

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

      15. unpow2 N/A

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

      16. lower-fma.f64 94.2

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

   8. Applied rewrites 94.2%

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

Alternative 4: 84.0% accurate, 5.2× speedup

Math

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

FPCore

(FPCore (a b)
 :precision binary64
 (if (or (<= a -1e+142) (not (<= a 6.3e+128)))
   (- (* (* a a) 4.0) 1.0)
   (fma (* (fma b b 12.0) b) b -1.0)))

C

double code(double a, double b) {
	double tmp;
	if ((a <= -1e+142) || !(a <= 6.3e+128)) {
		tmp = ((a * a) * 4.0) - 1.0;
	} else {
		tmp = fma((fma(b, b, 12.0) * b), b, -1.0);
	}
	return tmp;
}

Julia

function code(a, b)
	tmp = 0.0
	if ((a <= -1e+142) || !(a <= 6.3e+128))
		tmp = Float64(Float64(Float64(a * a) * 4.0) - 1.0);
	else
		tmp = fma(Float64(fma(b, b, 12.0) * b), b, -1.0);
	end
	return tmp
end

Wolfram

code[a_, b_] := If[Or[LessEqual[a, -1e+142], N[Not[LessEqual[a, 6.3e+128]], $MachinePrecision]], N[(N[(N[(a * a), $MachinePrecision] * 4.0), $MachinePrecision] - 1.0), $MachinePrecision], N[(N[(N[(b * b + 12.0), $MachinePrecision] * b), $MachinePrecision] * b + -1.0), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if a < -1.00000000000000005e142 or 6.2999999999999999e128 < a

   1. Initial program 41.8%

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

   3. Taylor expanded in b around 0

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. unpow2 N/A

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

      4. associate-*r* N/A

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

      5. sub-neg N/A

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

      6. mul-1-neg N/A

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

      7. *-commutative N/A

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

      8. lower-*.f64 N/A

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

      9. +-commutative N/A

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

      10. distribute-rgt-in N/A

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

      11. *-lft-identity N/A

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

      12. lower-fma.f64 N/A

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

      13. mul-1-neg N/A

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

      14. lower-neg.f64 N/A

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

      15. lower-pow.f64 62.7

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

   5. Applied rewrites 62.7%

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

   6. Taylor expanded in a around 0

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

   8. Applied rewrites 90.5%

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

   if -1.00000000000000005e142 < a < 6.2999999999999999e128

   1. Initial program 90.3%

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

   3. Taylor expanded in a around 0

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

      1. lower-*.f64 N/A

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

      2. unpow2 N/A

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

      3. lower-*.f64 98.8

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

   5. Applied rewrites 98.8%

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

   6. Taylor expanded in a around 0

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

      1. sub-neg N/A

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

      2. +-commutative N/A

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

      3. metadata-eval N/A

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

      4. metadata-eval N/A

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

      5. pow-sqr N/A

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

      6. distribute-rgt-in N/A

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

      7. +-commutative N/A

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

      8. unpow2 N/A

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

      9. associate-*l* N/A

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

      10. *-commutative N/A

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

      11. lower-fma.f64 N/A

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

      12. *-commutative N/A

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

      13. lower-*.f64 N/A

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

      14. +-commutative N/A

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

      15. unpow2 N/A

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

      16. lower-fma.f64 81.4

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

   8. Applied rewrites 81.4%

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

4. Final simplification 83.8%

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

Alternative 5: 93.1% accurate, 5.2× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 b b) < 4.00000000000000019e57

   1. Initial program 86.6%

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

   3. Taylor expanded in a around inf

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

      1. lower-pow.f64 94.6

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

   5. Applied rewrites 94.6%

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

   7. Applied rewrites 94.5%

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

   if 4.00000000000000019e57 < (*.f64 b b)

   1. Initial program 66.3%

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

   3. Taylor expanded in a around 0

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

      1. lower-*.f64 N/A

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

      2. unpow2 N/A

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

      3. lower-*.f64 99.9

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

   5. Applied rewrites 99.9%

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

   6. Taylor expanded in a around 0

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

      1. sub-neg N/A

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

      2. +-commutative N/A

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

      3. metadata-eval N/A

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

      4. metadata-eval N/A

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

      5. pow-sqr N/A

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

      6. distribute-rgt-in N/A

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

      7. +-commutative N/A

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

      8. unpow2 N/A

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

      9. associate-*l* N/A

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

      10. *-commutative N/A

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

      11. lower-fma.f64 N/A

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

      12. *-commutative N/A

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

      13. lower-*.f64 N/A

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

      14. +-commutative N/A

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

      15. unpow2 N/A

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

      16. lower-fma.f64 94.2

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

   8. Applied rewrites 94.2%

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

Alternative 6: 69.6% accurate, 6.2× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

public static double code(double a, double b) {
	double tmp;
	if ((b * b) <= 5e+298) {
		tmp = ((a * a) * 4.0) - 1.0;
	} else {
		tmp = (b * b) * 12.0;
	}
	return tmp;
}

Python

def code(a, b):
	tmp = 0
	if (b * b) <= 5e+298:
		tmp = ((a * a) * 4.0) - 1.0
	else:
		tmp = (b * b) * 12.0
	return tmp

Julia

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

MATLAB

function tmp_2 = code(a, b)
	tmp = 0.0;
	if ((b * b) <= 5e+298)
		tmp = ((a * a) * 4.0) - 1.0;
	else
		tmp = (b * b) * 12.0;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 b b) < 5.0000000000000003e298

   1. Initial program 82.9%

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

   3. Taylor expanded in b around 0

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. unpow2 N/A

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

      4. associate-*r* N/A

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

      5. sub-neg N/A

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

      6. mul-1-neg N/A

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

      7. *-commutative N/A

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

      8. lower-*.f64 N/A

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

      9. +-commutative N/A

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

      10. distribute-rgt-in N/A

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

      11. *-lft-identity N/A

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

      12. lower-fma.f64 N/A

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

      13. mul-1-neg N/A

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

      14. lower-neg.f64 N/A

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

      15. lower-pow.f64 66.9

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

   5. Applied rewrites 66.9%

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

   6. Taylor expanded in a around 0

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

   8. Applied rewrites 59.0%

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

   if 5.0000000000000003e298 < (*.f64 b b)

   1. Initial program 62.7%

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

   3. Taylor expanded in a around 0

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

      1. lower-*.f64 N/A

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

      2. unpow2 N/A

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

      3. lower-*.f64 100.0

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

   5. Applied rewrites 100.0%

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

   6. Taylor expanded in b around 0

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

      1. +-commutative N/A

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

      2. associate-+l+ N/A

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

      3. +-commutative N/A

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

      4. associate--l+ N/A

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

      5. *-commutative N/A

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

      6. distribute-lft-in N/A

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

      7. metadata-eval N/A

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

      8. unpow2 N/A

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

      9. associate-*r* N/A

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

      10. lower-fma.f64 N/A

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

   8. Applied rewrites 98.7%

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

   9. Taylor expanded in a around 0

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

   11. Applied rewrites 98.7%

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

   12. Taylor expanded in b around inf

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

   14. Applied rewrites 98.7%

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

Alternative 7: 51.5% accurate, 12.9× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 77.6%

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

3. Taylor expanded in a around 0

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

   1. lower-*.f64 N/A

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

   2. unpow2 N/A

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

   3. lower-*.f64 99.1

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

5. Applied rewrites 99.1%

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

6. Taylor expanded in b around 0

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

   1. +-commutative N/A

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

   2. associate-+l+ N/A

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

   3. +-commutative N/A

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

   4. associate--l+ N/A

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

   5. *-commutative N/A

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

   6. distribute-lft-in N/A

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

   7. metadata-eval N/A

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

   8. unpow2 N/A

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

   9. associate-*r* N/A

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

   10. lower-fma.f64 N/A

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

8. Applied rewrites 87.5%

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

9. Taylor expanded in a around 0

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

11. Applied rewrites 51.7%

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

Alternative 8: 27.8% accurate, 14.1× speedup

Math

\[\begin{array}{l} \\ \left(b \cdot b\right) \cdot 12 \end{array} \]

FPCore

(FPCore (a b) :precision binary64 (* (* b b) 12.0))

C

double code(double a, double b) {
	return (b * b) * 12.0;
}

Fortran

real(8) function code(a, b)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    code = (b * b) * 12.0d0
end function

Java

public static double code(double a, double b) {
	return (b * b) * 12.0;
}

Python

def code(a, b):
	return (b * b) * 12.0

Julia

function code(a, b)
	return Float64(Float64(b * b) * 12.0)
end

MATLAB

function tmp = code(a, b)
	tmp = (b * b) * 12.0;
end

Wolfram

code[a_, b_] := N[(N[(b * b), $MachinePrecision] * 12.0), $MachinePrecision]

Derivation

1. Initial program 77.6%

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

3. Taylor expanded in a around 0

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

   1. lower-*.f64 N/A

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

   2. unpow2 N/A

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

   3. lower-*.f64 99.1

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

5. Applied rewrites 99.1%

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

6. Taylor expanded in b around 0

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

   1. +-commutative N/A

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

   2. associate-+l+ N/A

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

   3. +-commutative N/A

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

   4. associate--l+ N/A

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

   5. *-commutative N/A

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

   6. distribute-lft-in N/A

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

   7. metadata-eval N/A

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

   8. unpow2 N/A

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

   9. associate-*r* N/A

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

   10. lower-fma.f64 N/A

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

8. Applied rewrites 87.5%

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

9. Taylor expanded in a around 0

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

11. Applied rewrites 51.7%

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

12. Taylor expanded in b around inf

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

14. Applied rewrites 28.5%

    \[\leadsto \left(b \cdot b\right) \cdot 12 \]
15. Add Preprocessing

Reproduce

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