Bouland and Aaronson, Equation (24)

Percentage Accurate: 74.5% → 99.9%

Time: 9.4s

Alternatives: 13

Speedup: 5.5×

• 61.6% 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: 74.5% 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.9% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;{\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(a + 3\right)\right) \leq 5 \cdot 10^{+141}:\\ \;\;\;\;\mathsf{fma}\left(a \cdot a, \mathsf{fma}\left(a, a + -4, 4\right), \mathsf{fma}\left(b \cdot b, \mathsf{fma}\left(a, \mathsf{fma}\left(a, 2, 4\right), \mathsf{fma}\left(b, b, 12\right)\right), -1\right)\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(b, b \cdot \mathsf{fma}\left(b, b, \mathsf{fma}\left(a, \mathsf{fma}\left(2, a, 4\right), 12\right)\right), \left(a \cdot a\right) \cdot \left(a \cdot a\right)\right)\\ \end{array} \end{array} \]

FPCore

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

C

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

Julia

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

Wolfram

code[a_, b_] := If[LessEqual[N[(N[Power[N[(N[(a * a), $MachinePrecision] + N[(b * b), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] + N[(4.0 * N[(N[(N[(a * a), $MachinePrecision] * N[(1.0 - a), $MachinePrecision]), $MachinePrecision] + N[(N[(b * b), $MachinePrecision] * N[(a + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 5e+141], N[(N[(a * a), $MachinePrecision] * N[(a * N[(a + -4.0), $MachinePrecision] + 4.0), $MachinePrecision] + N[(N[(b * b), $MachinePrecision] * N[(a * N[(a * 2.0 + 4.0), $MachinePrecision] + N[(b * b + 12.0), $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision], N[(b * N[(b * N[(b * b + N[(a * N[(2.0 * a + 4.0), $MachinePrecision] + 12.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(a * a), $MachinePrecision] * N[(a * a), $MachinePrecision]), $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 3 binary64) a))))) < 5.00000000000000025e141

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

      1. +-commutative N/A

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

   5. Applied rewrites 99.9%

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

   6. Taylor expanded in b around 0

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

   8. Applied rewrites 99.9%

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

   if 5.00000000000000025e141 < (+.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 3 binary64) a)))))

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

      1. +-commutative N/A

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

   5. Applied rewrites 99.9%

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

   6. Taylor expanded in a around inf

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

   8. Applied rewrites 99.9%

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

4. Final simplification 99.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;{\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(a + 3\right)\right) \leq 5 \cdot 10^{+141}:\\ \;\;\;\;\mathsf{fma}\left(a \cdot a, \mathsf{fma}\left(a, a + -4, 4\right), \mathsf{fma}\left(b \cdot b, \mathsf{fma}\left(a, \mathsf{fma}\left(a, 2, 4\right), \mathsf{fma}\left(b, b, 12\right)\right), -1\right)\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(b, b \cdot \mathsf{fma}\left(b, b, \mathsf{fma}\left(a, \mathsf{fma}\left(2, a, 4\right), 12\right)\right), \left(a \cdot a\right) \cdot \left(a \cdot a\right)\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 51.3% accurate, 0.9× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[a_, b_] := If[LessEqual[N[(N[Power[N[(N[(a * a), $MachinePrecision] + N[(b * b), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] + N[(4.0 * N[(N[(N[(a * a), $MachinePrecision] * N[(1.0 - a), $MachinePrecision]), $MachinePrecision] + N[(N[(b * b), $MachinePrecision] * N[(a + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 2e-9], -1.0, N[(4.0 * N[(a * a), $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 3 binary64) a))))) < 2.00000000000000012e-9

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

   3. Taylor expanded in a around 0

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

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

      3. pow-sqr N/A

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

      4. distribute-rgt-out N/A

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

      5. +-commutative N/A

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

      6. metadata-eval N/A

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

      7. lower-fma.f64 N/A

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

      8. unpow2 N/A

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

      9. lower-*.f64 N/A

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

      10. unpow2 N/A

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

      11. lower-fma.f64 98.1

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

   5. Applied rewrites 98.1%

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

   6. Taylor expanded in b around 0

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

   8. Applied rewrites 97.6%

      \[\leadsto -1 \]

   if 2.00000000000000012e-9 < (+.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 3 binary64) a)))))

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

   3. Taylor expanded in a around 0

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

      1. associate--l+ N/A

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

      2. +-commutative N/A

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

      3. associate-+l- N/A

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

      4. +-commutative N/A

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

      5. distribute-lft-in N/A

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

      6. associate-+r+ N/A

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

      7. +-commutative N/A

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

      8. associate--l+ N/A

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

      9. +-commutative N/A

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

      10. associate-+r- N/A

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

   5. Applied rewrites 81.3%

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

   6. Taylor expanded in b around 0

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

   8. Applied rewrites 37.7%

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

   9. Taylor expanded in a around inf

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

   11. Applied rewrites 38.1%

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

4. Final simplification 52.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;{\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(a + 3\right)\right) \leq 2 \cdot 10^{-9}:\\ \;\;\;\;-1\\ \mathbf{else}:\\ \;\;\;\;4 \cdot \left(a \cdot a\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 99.4% accurate, 2.8× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 b b) < 1e-13

   1. Initial program 79.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(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) + \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} \]
   4. Step-by-step derivation

      1. +-commutative N/A

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

   5. Applied rewrites 99.9%

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

   6. Taylor expanded in b around 0

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

   8. Applied rewrites 99.7%

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

   if 1e-13 < (*.f64 b b)

   1. Initial program 67.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(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) + \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} \]
   4. Step-by-step derivation

      1. +-commutative N/A

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

   5. Applied rewrites 99.9%

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

   6. Taylor expanded in a around inf

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

   8. Applied rewrites 99.5%

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

4. Final simplification 99.6%

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

Alternative 4: 99.9% accurate, 2.8× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

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

   1. +-commutative N/A

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

5. Applied rewrites 99.9%

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

Alternative 5: 98.2% accurate, 3.8× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 b b) < 5.00000000000000024e-5

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

      1. +-commutative N/A

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

   5. Applied rewrites 99.9%

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

   6. Taylor expanded in b around 0

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

   8. Applied rewrites 99.7%

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

   if 5.00000000000000024e-5 < (*.f64 b b)

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

      1. +-commutative N/A

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

   5. Applied rewrites 99.9%

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

   6. Taylor expanded in a around 0

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

   8. Applied rewrites 95.9%

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

4. Final simplification 97.8%

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

Alternative 6: 81.9% accurate, 4.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \cdot b \leq 10^{-13}:\\ \;\;\;\;\mathsf{fma}\left(4, a \cdot a, -1\right)\\ \mathbf{elif}\;b \cdot b \leq 5 \cdot 10^{+117}:\\ \;\;\;\;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) 1e-13)
   (fma 4.0 (* a a) -1.0)
   (if (<= (* b b) 5e+117) (* a (* a (* a a))) (* b (* b (* b b))))))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (*.f64 b b) < 1e-13

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

   3. Taylor expanded in a around 0

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

      1. associate--l+ N/A

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

      2. +-commutative N/A

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

      3. associate-+l- N/A

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

      4. +-commutative N/A

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

      5. distribute-lft-in N/A

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

      6. associate-+r+ N/A

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

      7. +-commutative N/A

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

      8. associate--l+ N/A

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

      9. +-commutative N/A

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

      10. associate-+r- N/A

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

   5. Applied rewrites 80.7%

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

   6. Taylor expanded in b around 0

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

   8. Applied rewrites 81.2%

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

   if 1e-13 < (*.f64 b b) < 4.99999999999999983e117

   1. Initial program 71.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(3 + 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 62.9

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

   5. Applied rewrites 62.9%

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

   if 4.99999999999999983e117 < (*.f64 b b)

   1. Initial program 65.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(3 + 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 98.0

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

   5. Applied rewrites 98.0%

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

Alternative 7: 93.5% accurate, 4.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \cdot b \leq 5 \cdot 10^{+117}:\\ \;\;\;\;\mathsf{fma}\left(a \cdot a, \mathsf{fma}\left(a, a + -4, 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) 5e+117)
   (fma (* a a) (fma a (+ a -4.0) 4.0) -1.0)
   (* b (* b (* b b)))))

C

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

Julia

function code(a, b)
	tmp = 0.0
	if (Float64(b * b) <= 5e+117)
		tmp = fma(Float64(a * a), fma(a, Float64(a + -4.0), 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], 5e+117], N[(N[(a * a), $MachinePrecision] * N[(a * N[(a + -4.0), $MachinePrecision] + 4.0), $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) < 4.99999999999999983e117

   1. Initial program 77.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(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) + \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} \]
   4. Step-by-step derivation

      1. +-commutative N/A

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

   5. Applied rewrites 99.9%

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

   6. Taylor expanded in b around 0

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

   8. Applied rewrites 90.6%

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

   if 4.99999999999999983e117 < (*.f64 b b)

   1. Initial program 65.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(3 + 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 98.0

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

   5. Applied rewrites 98.0%

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

4. Final simplification 93.4%

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

Alternative 8: 94.0% accurate, 5.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \leq -1.45 \cdot 10^{+16}:\\ \;\;\;\;\left(a \cdot a\right) \cdot \left(a \cdot a\right)\\ \mathbf{elif}\;a \leq 5.1 \cdot 10^{+70}:\\ \;\;\;\;\mathsf{fma}\left(b \cdot b, \mathsf{fma}\left(b, b, 12\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 -1.45e+16)
   (* (* a a) (* a a))
   (if (<= a 5.1e+70) (fma (* b b) (fma b b 12.0) -1.0) (* a (* a (* a a))))))

C

double code(double a, double b) {
	double tmp;
	if (a <= -1.45e+16) {
		tmp = (a * a) * (a * a);
	} else if (a <= 5.1e+70) {
		tmp = fma((b * b), fma(b, b, 12.0), -1.0);
	} else {
		tmp = a * (a * (a * a));
	}
	return tmp;
}

Julia

function code(a, b)
	tmp = 0.0
	if (a <= -1.45e+16)
		tmp = Float64(Float64(a * a) * Float64(a * a));
	elseif (a <= 5.1e+70)
		tmp = fma(Float64(b * b), fma(b, b, 12.0), -1.0);
	else
		tmp = Float64(a * Float64(a * Float64(a * a)));
	end
	return tmp
end

Wolfram

code[a_, b_] := If[LessEqual[a, -1.45e+16], N[(N[(a * a), $MachinePrecision] * N[(a * a), $MachinePrecision]), $MachinePrecision], If[LessEqual[a, 5.1e+70], N[(N[(b * b), $MachinePrecision] * N[(b * b + 12.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 < -1.45e16

   1. Initial program 62.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. Step-by-step derivation

      1. lift--.f64 N/A

         \[\leadsto \color{blue}{\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. flip-- N/A

         \[\leadsto \color{blue}{\frac{\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) \cdot \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 \cdot 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}} \]

      3. clear-num N/A

         \[\leadsto \color{blue}{\frac{1}{\frac{\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}{\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) \cdot \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 \cdot 1}}} \]

      4. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{1}{\frac{\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}{\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) \cdot \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 \cdot 1}}} \]

   4. Applied rewrites 62.6%

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

   5. Taylor expanded in a around inf

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

      1. metadata-eval N/A

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

      2. pow-sqr N/A

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

      3. lower-*.f64 N/A

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

      4. unpow2 N/A

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

      5. lower-*.f64 N/A

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

      6. unpow2 N/A

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

      7. lower-*.f64 92.3

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

   7. Applied rewrites 92.3%

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

   if -1.45e16 < a < 5.10000000000000014e70

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

   3. Taylor expanded in a around 0

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

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

      3. pow-sqr N/A

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

      4. distribute-rgt-out N/A

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

      5. +-commutative N/A

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

      6. metadata-eval N/A

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

      7. lower-fma.f64 N/A

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

      8. unpow2 N/A

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

      9. lower-*.f64 N/A

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

      10. unpow2 N/A

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

      11. lower-fma.f64 93.1

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

   5. Applied rewrites 93.1%

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

   if 5.10000000000000014e70 < a

   1. Initial program 11.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 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 100.0

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

   5. Applied rewrites 100.0%

      \[\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: 93.4% accurate, 5.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \leq -1.45 \cdot 10^{+16}:\\ \;\;\;\;\left(a \cdot a\right) \cdot \left(a \cdot a\right)\\ \mathbf{elif}\;a \leq 5.1 \cdot 10^{+70}:\\ \;\;\;\;\mathsf{fma}\left(b \cdot b, b \cdot b, -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 -1.45e+16)
   (* (* a a) (* a a))
   (if (<= a 5.1e+70) (fma (* b b) (* b b) -1.0) (* a (* a (* a a))))))

C

double code(double a, double b) {
	double tmp;
	if (a <= -1.45e+16) {
		tmp = (a * a) * (a * a);
	} else if (a <= 5.1e+70) {
		tmp = fma((b * b), (b * b), -1.0);
	} else {
		tmp = a * (a * (a * a));
	}
	return tmp;
}

Julia

function code(a, b)
	tmp = 0.0
	if (a <= -1.45e+16)
		tmp = Float64(Float64(a * a) * Float64(a * a));
	elseif (a <= 5.1e+70)
		tmp = fma(Float64(b * b), Float64(b * b), -1.0);
	else
		tmp = Float64(a * Float64(a * Float64(a * a)));
	end
	return tmp
end

Wolfram

code[a_, b_] := If[LessEqual[a, -1.45e+16], N[(N[(a * a), $MachinePrecision] * N[(a * a), $MachinePrecision]), $MachinePrecision], If[LessEqual[a, 5.1e+70], N[(N[(b * b), $MachinePrecision] * N[(b * b), $MachinePrecision] + -1.0), $MachinePrecision], N[(a * N[(a * N[(a * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if a < -1.45e16

   1. Initial program 62.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. Step-by-step derivation

      1. lift--.f64 N/A

         \[\leadsto \color{blue}{\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. flip-- N/A

         \[\leadsto \color{blue}{\frac{\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) \cdot \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 \cdot 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}} \]

      3. clear-num N/A

         \[\leadsto \color{blue}{\frac{1}{\frac{\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}{\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) \cdot \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 \cdot 1}}} \]

      4. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{1}{\frac{\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}{\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) \cdot \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 \cdot 1}}} \]

   4. Applied rewrites 62.6%

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

   5. Taylor expanded in a around inf

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

      1. metadata-eval N/A

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

      2. pow-sqr N/A

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

      3. lower-*.f64 N/A

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

      4. unpow2 N/A

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

      5. lower-*.f64 N/A

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

      6. unpow2 N/A

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

      7. lower-*.f64 92.3

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

   7. Applied rewrites 92.3%

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

   if -1.45e16 < a < 5.10000000000000014e70

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

   3. Taylor expanded in a around 0

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

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

      3. pow-sqr N/A

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

      4. distribute-rgt-out N/A

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

      5. +-commutative N/A

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

      6. metadata-eval N/A

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

      7. lower-fma.f64 N/A

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

      8. unpow2 N/A

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

      9. lower-*.f64 N/A

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

      10. unpow2 N/A

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

      11. lower-fma.f64 93.1

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

   5. Applied rewrites 93.1%

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

   6. Taylor expanded in b around inf

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

   8. Applied rewrites 92.4%

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

   if 5.10000000000000014e70 < a

   1. Initial program 11.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 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 100.0

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

   5. Applied rewrites 100.0%

      \[\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 10: 82.7% accurate, 5.5× 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 -900000000:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;a \leq 33000000000000:\\ \;\;\;\;\mathsf{fma}\left(b \cdot b, 12, -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 -900000000.0)
     t_0
     (if (<= a 33000000000000.0) (fma (* b b) 12.0 -1.0) t_0))))

C

double code(double a, double b) {
	double t_0 = a * (a * (a * a));
	double tmp;
	if (a <= -900000000.0) {
		tmp = t_0;
	} else if (a <= 33000000000000.0) {
		tmp = fma((b * b), 12.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 <= -900000000.0)
		tmp = t_0;
	elseif (a <= 33000000000000.0)
		tmp = fma(Float64(b * b), 12.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, -900000000.0], t$95$0, If[LessEqual[a, 33000000000000.0], N[(N[(b * b), $MachinePrecision] * 12.0 + -1.0), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if a < -9e8 or 3.3e13 < a

   1. Initial program 47.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(3 + 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 89.0

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

   5. Applied rewrites 89.0%

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

   if -9e8 < a < 3.3e13

   1. Initial program 99.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 a around 0

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

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

      3. pow-sqr N/A

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

      4. distribute-rgt-out N/A

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

      5. +-commutative N/A

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

      6. metadata-eval N/A

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

      7. lower-fma.f64 N/A

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

      8. unpow2 N/A

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

      9. lower-*.f64 N/A

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

      10. unpow2 N/A

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

      11. lower-fma.f64 97.4

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

   5. Applied rewrites 97.4%

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

   6. Taylor expanded in b around 0

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

   8. Applied rewrites 74.1%

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

Alternative 11: 70.2% accurate, 6.7× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 b b) < 1.20000000000000008e307

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

   3. Taylor expanded in a around 0

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

      1. associate--l+ N/A

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

      2. +-commutative N/A

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

      3. associate-+l- N/A

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

      4. +-commutative N/A

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

      5. distribute-lft-in N/A

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

      6. associate-+r+ N/A

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

      7. +-commutative N/A

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

      8. associate--l+ N/A

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

      9. +-commutative N/A

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

      10. associate-+r- N/A

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

   5. Applied rewrites 81.4%

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

   6. Taylor expanded in b around 0

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

   8. Applied rewrites 62.3%

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

   if 1.20000000000000008e307 < (*.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 \color{blue}{\left(12 \cdot {b}^{2} + {b}^{4}\right) - 1} \]
   4. 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. metadata-eval N/A

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

      3. pow-sqr N/A

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

      4. distribute-rgt-out N/A

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

      5. +-commutative N/A

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

      6. metadata-eval N/A

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

      7. lower-fma.f64 N/A

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

      8. unpow2 N/A

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

      9. lower-*.f64 N/A

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

      10. unpow2 N/A

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

      11. lower-fma.f64 100.0

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

   5. Applied rewrites 100.0%

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

   6. Taylor expanded in b around 0

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

   8. Applied rewrites 100.0%

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

Alternative 12: 51.2% accurate, 12.9× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 72.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 a around 0

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

   1. associate--l+ N/A

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

   2. +-commutative N/A

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

   3. associate-+l- N/A

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

   4. +-commutative N/A

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

   5. distribute-lft-in N/A

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

   6. associate-+r+ N/A

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

   7. +-commutative N/A

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

   8. associate--l+ N/A

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

   9. +-commutative N/A

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

   10. associate-+r- N/A

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

5. Applied rewrites 85.7%

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

6. Taylor expanded in b around 0

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

8. Applied rewrites 52.3%

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

Alternative 13: 24.6% accurate, 155.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.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 a around 0

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

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

   3. pow-sqr N/A

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

   4. distribute-rgt-out N/A

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

   5. +-commutative N/A

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

   6. metadata-eval N/A

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

   7. lower-fma.f64 N/A

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

   8. unpow2 N/A

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

   9. lower-*.f64 N/A

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

   10. unpow2 N/A

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

   11. lower-fma.f64 65.8

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

5. Applied rewrites 65.8%

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

6. Taylor expanded in b around 0

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

8. Applied rewrites 23.8%

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

Reproduce

herbie shell --seed 2024231 
(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))