Bouland and Aaronson, Equation (25)

Percentage Accurate: 74.6% → 99.1%

Time: 9.6s

Alternatives: 11

Speedup: 5.7×

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 74.6% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 99.1% accurate, 2.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \mathsf{fma}\left(a, a, b \cdot b\right)\\ \left(\frac{t\_0}{\frac{1}{t\_0}} + 4 \cdot \left(b \cdot b\right)\right) + -1 \end{array} \end{array} \]

FPCore

(FPCore (a b)
 :precision binary64
 (let* ((t_0 (fma a a (* b b))))
   (+ (+ (/ t_0 (/ 1.0 t_0)) (* 4.0 (* b b))) -1.0)))

C

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

Julia

function code(a, b)
	t_0 = fma(a, a, Float64(b * b))
	return Float64(Float64(Float64(t_0 / Float64(1.0 / t_0)) + Float64(4.0 * Float64(b * b))) + -1.0)
end

Wolfram

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

Derivation

1. Initial program 72.2%

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

   1. lift-pow.f64 N/A

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

   2. unpow2 N/A

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

   3. lift-+.f64 N/A

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

   4. flip-+ N/A

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

   5. clear-num N/A

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

   6. un-div-inv N/A

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

   7. lower-/.f64 N/A

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

   8. lift-+.f64 N/A

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

   9. lift-*.f64 N/A

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

   10. lower-fma.f64 N/A

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

   11. clear-num N/A

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

   12. flip-+ N/A

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

   13. lift-+.f64 N/A

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

   14. lower-/.f64 72.2

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

   15. lift-+.f64 N/A

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

   16. lift-*.f64 N/A

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

   17. lower-fma.f64 72.2

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

4. Applied rewrites 72.2%

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

5. Taylor expanded in a around 0

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

   1. unpow2 N/A

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

   2. lower-*.f64 98.8

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

7. Applied rewrites 98.8%

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

8. Final simplification 98.8%

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

Alternative 2: 52.7% accurate, 0.9× speedup

Math

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

FPCore

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

C

double code(double a, double b) {
	double tmp;
	if ((pow(((b * b) + (a * a)), 2.0) + (4.0 * (((a * a) * (a + 1.0)) + ((b * b) * (1.0 - (a * 3.0)))))) <= 0.4) {
		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 (((((b * b) + (a * a)) ** 2.0d0) + (4.0d0 * (((a * a) * (a + 1.0d0)) + ((b * b) * (1.0d0 - (a * 3.0d0)))))) <= 0.4d0) 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(((b * b) + (a * a)), 2.0) + (4.0 * (((a * a) * (a + 1.0)) + ((b * b) * (1.0 - (a * 3.0)))))) <= 0.4) {
		tmp = -1.0;
	} else {
		tmp = b * (b * 4.0);
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

function tmp_2 = code(a, b)
	tmp = 0.0;
	if (((((b * b) + (a * a)) ^ 2.0) + (4.0 * (((a * a) * (a + 1.0)) + ((b * b) * (1.0 - (a * 3.0)))))) <= 0.4)
		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[(b * b), $MachinePrecision] + N[(a * a), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] + N[(4.0 * N[(N[(N[(a * a), $MachinePrecision] * N[(a + 1.0), $MachinePrecision]), $MachinePrecision] + N[(N[(b * b), $MachinePrecision] * N[(1.0 - N[(a * 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.4], -1.0, N[(b * N[(b * 4.0), $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 (*.f64 (*.f64 a a) (+.f64 #s(literal 1 binary64) a)) (*.f64 (*.f64 b b) (-.f64 #s(literal 1 binary64) (*.f64 #s(literal 3 binary64) a)))))) < 0.40000000000000002

   1. Initial program 100.0%

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

   3. Taylor expanded in a around 0

      \[\leadsto \color{blue}{\left(4 \cdot {b}^{2} + {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. metadata-eval N/A

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

      7. lower-fma.f64 N/A

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

      8. unpow2 N/A

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

      9. lower-*.f64 N/A

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

      10. unpow2 N/A

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

      11. lower-fma.f64 98.1

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

   5. Applied rewrites 98.1%

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

   6. Taylor expanded in b around 0

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

   8. Applied rewrites 97.5%

      \[\leadsto -1 \]

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

   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(1 - 3 \cdot a\right)\right)\right) - 1 \]
   2. Add Preprocessing

   3. Taylor expanded in a around 0

      \[\leadsto \color{blue}{\left(4 \cdot {b}^{2} + {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. metadata-eval N/A

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

      7. lower-fma.f64 N/A

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

      8. unpow2 N/A

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

      9. lower-*.f64 N/A

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

      10. unpow2 N/A

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

      11. lower-fma.f64 51.4

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

   5. Applied rewrites 51.4%

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

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

   9. Taylor expanded in b around 0

      \[\leadsto b \cdot \left(4 \cdot b\right) \]
   10. Step-by-step derivation

   11. Applied rewrites 30.4%

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

4. Final simplification 47.4%

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

Alternative 3: 94.8% accurate, 5.0× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 b b) < 1.9999999999999999e45

   1. Initial program 79.5%

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

   3. Taylor expanded in 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. sub-neg N/A

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

      2. +-commutative N/A

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

      3. metadata-eval N/A

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

      4. pow-sqr N/A

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

      5. *-commutative N/A

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

      6. associate-*r* N/A

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

      7. distribute-rgt-out N/A

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

      8. metadata-eval N/A

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

      9. lower-fma.f64 N/A

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

      10. unpow2 N/A

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

      11. lower-*.f64 N/A

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

      12. unpow2 N/A

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

      13. lower-fma.f64 N/A

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

      14. +-commutative N/A

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

      15. distribute-lft-in N/A

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

      16. metadata-eval N/A

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

      17. lower-fma.f64 97.8

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

   5. Applied rewrites 97.8%

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

   7. Applied rewrites 97.8%

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

   if 1.9999999999999999e45 < (*.f64 b b)

   1. Initial program 60.5%

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

   3. Taylor expanded in b around inf

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

      1. metadata-eval N/A

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

      2. pow-sqr N/A

         \[\leadsto \color{blue}{{b}^{2} \cdot {b}^{2}} \]

      3. unpow2 N/A

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

      4. associate-*l* N/A

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

      5. lower-*.f64 N/A

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

      6. lower-*.f64 N/A

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

      7. unpow2 N/A

         \[\leadsto b \cdot \left(b \cdot \color{blue}{\left(b \cdot b\right)}\right) \]

      8. lower-*.f64 95.3

         \[\leadsto b \cdot \left(b \cdot \color{blue}{\left(b \cdot b\right)}\right) \]

   5. Applied rewrites 95.3%

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

Alternative 4: 94.3% accurate, 5.2× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 b b) < 1.9999999999999999e45

   1. Initial program 79.5%

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

   3. Taylor expanded in 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. sub-neg N/A

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

      2. +-commutative N/A

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

      3. metadata-eval N/A

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

      4. pow-sqr N/A

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

      5. *-commutative N/A

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

      6. associate-*r* N/A

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

      7. distribute-rgt-out N/A

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

      8. metadata-eval N/A

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

      9. lower-fma.f64 N/A

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

      10. unpow2 N/A

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

      11. lower-*.f64 N/A

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

      12. unpow2 N/A

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

      13. lower-fma.f64 N/A

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

      14. +-commutative N/A

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

      15. distribute-lft-in N/A

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

      16. metadata-eval N/A

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

      17. lower-fma.f64 97.8

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

   5. Applied rewrites 97.8%

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

   6. Taylor expanded in a around inf

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

   8. Applied rewrites 96.2%

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

   10. Applied rewrites 96.2%

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

   if 1.9999999999999999e45 < (*.f64 b b)

   1. Initial program 60.5%

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

   3. Taylor expanded in b around inf

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

      1. metadata-eval N/A

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

      2. pow-sqr N/A

         \[\leadsto \color{blue}{{b}^{2} \cdot {b}^{2}} \]

      3. unpow2 N/A

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

      4. associate-*l* N/A

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

      5. lower-*.f64 N/A

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

      6. lower-*.f64 N/A

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

      7. unpow2 N/A

         \[\leadsto b \cdot \left(b \cdot \color{blue}{\left(b \cdot b\right)}\right) \]

      8. lower-*.f64 95.3

         \[\leadsto b \cdot \left(b \cdot \color{blue}{\left(b \cdot b\right)}\right) \]

   5. Applied rewrites 95.3%

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

Alternative 5: 94.2% accurate, 5.2× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 b b) < 1.9999999999999999e45

   1. Initial program 79.5%

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

   3. Taylor expanded in 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. sub-neg N/A

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

      2. +-commutative N/A

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

      3. metadata-eval N/A

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

      4. pow-sqr N/A

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

      5. *-commutative N/A

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

      6. associate-*r* N/A

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

      7. distribute-rgt-out N/A

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

      8. metadata-eval N/A

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

      9. lower-fma.f64 N/A

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

      10. unpow2 N/A

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

      11. lower-*.f64 N/A

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

      12. unpow2 N/A

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

      13. lower-fma.f64 N/A

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

      14. +-commutative N/A

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

      15. distribute-lft-in N/A

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

      16. metadata-eval N/A

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

      17. lower-fma.f64 97.8

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

   5. Applied rewrites 97.8%

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

   6. Taylor expanded in a around inf

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

   8. Applied rewrites 96.2%

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

   if 1.9999999999999999e45 < (*.f64 b b)

   1. Initial program 60.5%

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

   3. Taylor expanded in b around inf

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

      1. metadata-eval N/A

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

      2. pow-sqr N/A

         \[\leadsto \color{blue}{{b}^{2} \cdot {b}^{2}} \]

      3. unpow2 N/A

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

      4. associate-*l* N/A

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

      5. lower-*.f64 N/A

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

      6. lower-*.f64 N/A

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

      7. unpow2 N/A

         \[\leadsto b \cdot \left(b \cdot \color{blue}{\left(b \cdot b\right)}\right) \]

      8. lower-*.f64 95.3

         \[\leadsto b \cdot \left(b \cdot \color{blue}{\left(b \cdot b\right)}\right) \]

   5. Applied rewrites 95.3%

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

4. Final simplification 95.8%

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

Alternative 6: 94.1% accurate, 5.3× speedup

Math

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

FPCore

(FPCore (a b)
 :precision binary64
 (if (<= a -2.7e+26)
   (* (* a a) (* a a))
   (if (<= a 5.1e+41) (fma (* b b) (fma b b 4.0) -1.0) (* a (* a (* a a))))))

C

double code(double a, double b) {
	double tmp;
	if (a <= -2.7e+26) {
		tmp = (a * a) * (a * a);
	} else if (a <= 5.1e+41) {
		tmp = fma((b * b), fma(b, b, 4.0), -1.0);
	} else {
		tmp = a * (a * (a * a));
	}
	return tmp;
}

Julia

function code(a, b)
	tmp = 0.0
	if (a <= -2.7e+26)
		tmp = Float64(Float64(a * a) * Float64(a * a));
	elseif (a <= 5.1e+41)
		tmp = fma(Float64(b * b), fma(b, b, 4.0), -1.0);
	else
		tmp = Float64(a * Float64(a * Float64(a * a)));
	end
	return tmp
end

Wolfram

code[a_, b_] := If[LessEqual[a, -2.7e+26], N[(N[(a * a), $MachinePrecision] * N[(a * a), $MachinePrecision]), $MachinePrecision], If[LessEqual[a, 5.1e+41], N[(N[(b * b), $MachinePrecision] * N[(b * b + 4.0), $MachinePrecision] + -1.0), $MachinePrecision], N[(a * N[(a * N[(a * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if a < -2.7e26

   1. Initial program 29.6%

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

   3. Taylor expanded in a around inf

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

      1. metadata-eval N/A

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

      2. pow-plus N/A

         \[\leadsto \color{blue}{{a}^{3} \cdot a} \]

      3. *-commutative N/A

         \[\leadsto \color{blue}{a \cdot {a}^{3}} \]

      4. lower-*.f64 N/A

         \[\leadsto \color{blue}{a \cdot {a}^{3}} \]

      5. cube-mult N/A

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

      6. unpow2 N/A

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

      7. lower-*.f64 N/A

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

      8. unpow2 N/A

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

      9. lower-*.f64 95.6

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

   5. Applied rewrites 95.6%

      \[\leadsto \color{blue}{a \cdot \left(a \cdot \left(a \cdot a\right)\right)} \]
   6. Step-by-step derivation

   7. Applied rewrites 95.7%

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

   if -2.7e26 < a < 5.09999999999999978e41

   1. Initial program 95.4%

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

   3. Taylor expanded in a around 0

      \[\leadsto \color{blue}{\left(4 \cdot {b}^{2} + {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. metadata-eval N/A

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

      7. lower-fma.f64 N/A

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

      8. unpow2 N/A

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

      9. lower-*.f64 N/A

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

      10. unpow2 N/A

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

      11. lower-fma.f64 95.3

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

   5. Applied rewrites 95.3%

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

   if 5.09999999999999978e41 < a

   1. Initial program 66.0%

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

   3. Taylor expanded in a around inf

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

      1. metadata-eval N/A

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

      2. pow-plus N/A

         \[\leadsto \color{blue}{{a}^{3} \cdot a} \]

      3. *-commutative N/A

         \[\leadsto \color{blue}{a \cdot {a}^{3}} \]

      4. lower-*.f64 N/A

         \[\leadsto \color{blue}{a \cdot {a}^{3}} \]

      5. cube-mult N/A

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

      6. unpow2 N/A

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

      7. lower-*.f64 N/A

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

      8. unpow2 N/A

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

      9. lower-*.f64 99.9

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

   5. Applied rewrites 99.9%

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

Alternative 7: 94.0% accurate, 5.3× speedup

Math

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

FPCore

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

C

double code(double a, double b) {
	double tmp;
	if ((b * b) <= 2e+45) {
		tmp = -1.0 + (a * (a * (a * a)));
	} else {
		tmp = b * (b * (b * b));
	}
	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) <= 2d+45) then
        tmp = (-1.0d0) + (a * (a * (a * a)))
    else
        tmp = b * (b * (b * b))
    end if
    code = tmp
end function

Java

public static double code(double a, double b) {
	double tmp;
	if ((b * b) <= 2e+45) {
		tmp = -1.0 + (a * (a * (a * a)));
	} else {
		tmp = b * (b * (b * b));
	}
	return tmp;
}

Python

def code(a, b):
	tmp = 0
	if (b * b) <= 2e+45:
		tmp = -1.0 + (a * (a * (a * a)))
	else:
		tmp = b * (b * (b * b))
	return tmp

Julia

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

MATLAB

function tmp_2 = code(a, b)
	tmp = 0.0;
	if ((b * b) <= 2e+45)
		tmp = -1.0 + (a * (a * (a * a)));
	else
		tmp = b * (b * (b * b));
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 b b) < 1.9999999999999999e45

   1. Initial program 79.5%

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

   3. Taylor expanded in a around inf

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

      1. metadata-eval N/A

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

      2. pow-plus N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. cube-mult N/A

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

      6. unpow2 N/A

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

      7. lower-*.f64 N/A

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

      8. unpow2 N/A

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

      9. lower-*.f64 96.0

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

   5. Applied rewrites 96.0%

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

   if 1.9999999999999999e45 < (*.f64 b b)

   1. Initial program 60.5%

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

   3. Taylor expanded in b around inf

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

      1. metadata-eval N/A

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

      2. pow-sqr N/A

         \[\leadsto \color{blue}{{b}^{2} \cdot {b}^{2}} \]

      3. unpow2 N/A

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

      4. associate-*l* N/A

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

      5. lower-*.f64 N/A

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

      6. lower-*.f64 N/A

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

      7. unpow2 N/A

         \[\leadsto b \cdot \left(b \cdot \color{blue}{\left(b \cdot b\right)}\right) \]

      8. lower-*.f64 95.3

         \[\leadsto b \cdot \left(b \cdot \color{blue}{\left(b \cdot b\right)}\right) \]

   5. Applied rewrites 95.3%

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

4. Final simplification 95.7%

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

Alternative 8: 81.4% accurate, 5.7× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if a < -2.5499999999999999e26

   1. Initial program 29.6%

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

   3. Taylor expanded in a around inf

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

      1. metadata-eval N/A

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

      2. pow-plus N/A

         \[\leadsto \color{blue}{{a}^{3} \cdot a} \]

      3. *-commutative N/A

         \[\leadsto \color{blue}{a \cdot {a}^{3}} \]

      4. lower-*.f64 N/A

         \[\leadsto \color{blue}{a \cdot {a}^{3}} \]

      5. cube-mult N/A

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

      6. unpow2 N/A

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

      7. lower-*.f64 N/A

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

      8. unpow2 N/A

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

      9. lower-*.f64 95.6

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

   5. Applied rewrites 95.6%

      \[\leadsto \color{blue}{a \cdot \left(a \cdot \left(a \cdot a\right)\right)} \]
   6. Step-by-step derivation

   7. Applied rewrites 95.7%

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

   if -2.5499999999999999e26 < a < 9.8000000000000003e32

   1. Initial program 96.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(1 - 3 \cdot a\right)\right)\right) - 1 \]
   2. Add Preprocessing

   3. Taylor expanded in a around 0

      \[\leadsto \color{blue}{\left(4 \cdot {b}^{2} + {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. metadata-eval N/A

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

      7. lower-fma.f64 N/A

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

      8. unpow2 N/A

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

      9. lower-*.f64 N/A

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

      10. unpow2 N/A

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

      11. lower-fma.f64 95.9

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

   5. Applied rewrites 95.9%

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

   6. Taylor expanded in b around 0

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

   8. Applied rewrites 72.2%

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

   if 9.8000000000000003e32 < a

   1. Initial program 66.0%

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

   3. Taylor expanded in a around inf

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

      1. metadata-eval N/A

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

      2. pow-plus N/A

         \[\leadsto \color{blue}{{a}^{3} \cdot a} \]

      3. *-commutative N/A

         \[\leadsto \color{blue}{a \cdot {a}^{3}} \]

      4. lower-*.f64 N/A

         \[\leadsto \color{blue}{a \cdot {a}^{3}} \]

      5. cube-mult N/A

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

      6. unpow2 N/A

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

      7. lower-*.f64 N/A

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

      8. unpow2 N/A

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

      9. lower-*.f64 96.9

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

   5. Applied rewrites 96.9%

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

Alternative 9: 81.4% accurate, 5.7× speedup

Math

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

FPCore

(FPCore (a b)
 :precision binary64
 (let* ((t_0 (* a (* a (* a a)))))
   (if (<= a -2.55e+26) t_0 (if (<= a 9.8e+32) (fma (* b b) 4.0 -1.0) t_0))))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if a < -2.5499999999999999e26 or 9.8000000000000003e32 < a

   1. Initial program 47.5%

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

   3. Taylor expanded in a around inf

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

      1. metadata-eval N/A

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

      2. pow-plus N/A

         \[\leadsto \color{blue}{{a}^{3} \cdot a} \]

      3. *-commutative N/A

         \[\leadsto \color{blue}{a \cdot {a}^{3}} \]

      4. lower-*.f64 N/A

         \[\leadsto \color{blue}{a \cdot {a}^{3}} \]

      5. cube-mult N/A

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

      6. unpow2 N/A

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

      7. lower-*.f64 N/A

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

      8. unpow2 N/A

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

      9. lower-*.f64 96.2

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

   5. Applied rewrites 96.2%

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

   if -2.5499999999999999e26 < a < 9.8000000000000003e32

   1. Initial program 96.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(1 - 3 \cdot a\right)\right)\right) - 1 \]
   2. Add Preprocessing

   3. Taylor expanded in a around 0

      \[\leadsto \color{blue}{\left(4 \cdot {b}^{2} + {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. metadata-eval N/A

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

      7. lower-fma.f64 N/A

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

      8. unpow2 N/A

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

      9. lower-*.f64 N/A

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

      10. unpow2 N/A

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

      11. lower-fma.f64 95.9

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

   5. Applied rewrites 95.9%

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

   6. Taylor expanded in b around 0

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

   8. Applied rewrites 72.2%

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

Alternative 10: 60.9% accurate, 8.9× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if b < 1.8499999999999999e142

   1. Initial program 76.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(1 - 3 \cdot 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. sub-neg N/A

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

      2. +-commutative N/A

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

      3. metadata-eval N/A

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

      4. pow-sqr N/A

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

      5. *-commutative N/A

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

      6. associate-*r* N/A

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

      7. distribute-rgt-out N/A

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

      8. metadata-eval N/A

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

      9. lower-fma.f64 N/A

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

      10. unpow2 N/A

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

      11. lower-*.f64 N/A

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

      12. unpow2 N/A

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

      13. lower-fma.f64 N/A

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

      14. +-commutative N/A

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

      15. distribute-lft-in N/A

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

      16. metadata-eval N/A

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

      17. lower-fma.f64 79.5

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

   5. Applied rewrites 79.5%

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

   6. Taylor expanded in a around 0

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

   8. Applied rewrites 57.3%

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

   if 1.8499999999999999e142 < b

   1. Initial program 45.5%

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

   3. Taylor expanded in a around 0

      \[\leadsto \color{blue}{\left(4 \cdot {b}^{2} + {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. metadata-eval N/A

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

      7. lower-fma.f64 N/A

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

      8. unpow2 N/A

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

      9. lower-*.f64 N/A

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

      10. unpow2 N/A

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

      11. lower-fma.f64 100.0

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

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

   8. Applied rewrites 100.0%

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

   9. Taylor expanded in b around 0

      \[\leadsto b \cdot \left(4 \cdot b\right) \]
   10. Step-by-step derivation

   11. Applied rewrites 94.6%

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

4. Final simplification 62.1%

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

Alternative 11: 25.8% accurate, 160.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

def code(a, b):
	return -1.0

Julia

function code(a, b)
	return -1.0
end

MATLAB

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

Wolfram

code[a_, b_] := -1.0

Derivation

1. Initial program 72.2%

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

3. Taylor expanded in a around 0

   \[\leadsto \color{blue}{\left(4 \cdot {b}^{2} + {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. metadata-eval N/A

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

   7. lower-fma.f64 N/A

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

   8. unpow2 N/A

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

   9. lower-*.f64 N/A

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

   10. unpow2 N/A

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

   11. lower-fma.f64 63.3

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

5. Applied rewrites 63.3%

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

6. Taylor expanded in b around 0

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

8. Applied rewrites 25.3%

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

Reproduce

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