Bouland and Aaronson, Equation (24)

Percentage Accurate: 73.9% → 99.8%

Time: 16.6s

Alternatives: 8

Speedup: 5.7×

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

Specification

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 73.9% 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.8% accurate, 2.6× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 77.6%

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

3. Taylor expanded in 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 \]

5. Applied rewrites 99.9%

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

Alternative 2: 97.8% accurate, 2.9× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 80.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) + {a}^{4}\right)} - 1 \]
   4. Step-by-step derivation

      1. +-commutative N/A

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

      2. 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) - 1 \]

      3. 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) - 1 \]

      4. *-commutative N/A

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

      5. 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) - 1 \]

      6. *-lft-identity N/A

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

      7. metadata-eval N/A

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

      8. fp-cancel-sign-sub-inv N/A

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

      9. mul-1-neg N/A

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

      10. distribute-lft-in N/A

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

      11. metadata-eval N/A

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

      12. distribute-rgt-neg-in N/A

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

      13. distribute-lft-neg-in N/A

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

      14. metadata-eval N/A

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

      15. distribute-rgt-out N/A

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

      16. lower-*.f64 N/A

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

      17. unpow2 N/A

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

      18. lower-*.f64 N/A

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

      19. unpow2 N/A

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

      20. lower-fma.f64 N/A

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

      21. +-commutative N/A

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

      22. lower-fma.f64 98.1

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

   5. Applied rewrites 98.1%

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

   7. Applied rewrites 98.1%

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

   if 5e18 < (*.f64 b b)

   1. Initial program 74.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 \]

   5. Applied rewrites 99.9%

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

   6. Taylor expanded in a around 0

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

   8. Applied rewrites 98.3%

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

   9. Taylor expanded in a around 0

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

   11. Applied rewrites 98.3%

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

Alternative 3: 93.6% accurate, 4.6× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 80.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) + {a}^{4}\right)} - 1 \]
   4. Step-by-step derivation

      1. +-commutative N/A

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

      2. 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) - 1 \]

      3. 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) - 1 \]

      4. *-commutative N/A

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

      5. 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) - 1 \]

      6. *-lft-identity N/A

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

      7. metadata-eval N/A

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

      8. fp-cancel-sign-sub-inv N/A

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

      9. mul-1-neg N/A

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

      10. distribute-lft-in N/A

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

      11. metadata-eval N/A

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

      12. distribute-rgt-neg-in N/A

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

      13. distribute-lft-neg-in N/A

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

      14. metadata-eval N/A

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

      15. distribute-rgt-out N/A

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

      16. lower-*.f64 N/A

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

      17. unpow2 N/A

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

      18. lower-*.f64 N/A

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

      19. unpow2 N/A

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

      20. lower-fma.f64 N/A

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

      21. +-commutative N/A

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

      22. lower-fma.f64 96.3

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

   5. Applied rewrites 96.3%

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

   7. Applied rewrites 96.3%

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

   if 2e85 < (*.f64 b b)

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

      1. associate-+r+ N/A

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

      2. associate-*r* N/A

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

      3. distribute-rgt-out N/A

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

      4. metadata-eval N/A

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

      5. distribute-lft-in N/A

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

      6. +-commutative N/A

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

      7. metadata-eval N/A

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

      8. pow-sqr N/A

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

      9. distribute-lft-in N/A

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

      10. *-commutative N/A

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

      11. unpow2 N/A

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

      12. associate-*r* N/A

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

      13. lower-*.f64 N/A

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

   5. Applied rewrites 94.8%

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

   6. Taylor expanded in a around 0

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

   8. Applied rewrites 97.9%

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

Alternative 4: 92.6% accurate, 5.0× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

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

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

      1. lower-pow.f64 94.0

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

   5. Applied rewrites 94.0%

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

   7. Applied rewrites 93.9%

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

   if 2e85 < (*.f64 b b)

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

      1. associate-+r+ N/A

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

      2. associate-*r* N/A

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

      3. distribute-rgt-out N/A

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

      4. metadata-eval N/A

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

      5. distribute-lft-in N/A

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

      6. +-commutative N/A

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

      7. metadata-eval N/A

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

      8. pow-sqr N/A

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

      9. distribute-lft-in N/A

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

      10. *-commutative N/A

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

      11. unpow2 N/A

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

      12. associate-*r* N/A

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

      13. lower-*.f64 N/A

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

   5. Applied rewrites 94.8%

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

   6. Taylor expanded in a around 0

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

   8. Applied rewrites 97.9%

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

Alternative 5: 92.6% accurate, 5.2× speedup

Math

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

FPCore

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

C

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 b b) < 1.44999999999999999e85

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

      1. lower-pow.f64 94.0

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

   5. Applied rewrites 94.0%

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

   7. Applied rewrites 93.9%

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

   if 1.44999999999999999e85 < (*.f64 b b)

   1. Initial program 73.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 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 \]

   5. Applied rewrites 100.0%

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

   6. Taylor expanded in b around inf

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

      1. lower-pow.f64 97.9

         \[\leadsto \color{blue}{{b}^{4}} \]

   8. Applied rewrites 97.9%

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

   10. Applied rewrites 97.8%

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

Alternative 6: 82.1% accurate, 5.7× speedup

Math

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

FPCore

(FPCore (a b)
 :precision binary64
 (if (<= (* b b) 4.2e+22) (- (* (* a a) 4.0) 1.0) (* (* b b) (* b b))))

C

double code(double a, double b) {
	double tmp;
	if ((b * b) <= 4.2e+22) {
		tmp = ((a * a) * 4.0) - 1.0;
	} 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) <= 4.2d+22) then
        tmp = ((a * a) * 4.0d0) - 1.0d0
    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) <= 4.2e+22) {
		tmp = ((a * a) * 4.0) - 1.0;
	} else {
		tmp = (b * b) * (b * b);
	}
	return tmp;
}

Python

def code(a, b):
	tmp = 0
	if (b * b) <= 4.2e+22:
		tmp = ((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) <= 4.2e+22)
		tmp = Float64(Float64(Float64(a * a) * 4.0) - 1.0);
	else
		tmp = Float64(Float64(b * b) * Float64(b * b));
	end
	return tmp
end

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 b b) < 4.1999999999999996e22

   1. Initial program 80.1%

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

   3. Taylor expanded in b around 0

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

      1. +-commutative N/A

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

      2. 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) - 1 \]

      3. 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) - 1 \]

      4. *-commutative N/A

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

      5. 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) - 1 \]

      6. *-lft-identity N/A

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

      7. metadata-eval N/A

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

      8. fp-cancel-sign-sub-inv N/A

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

      9. mul-1-neg N/A

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

      10. distribute-lft-in N/A

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

      11. metadata-eval N/A

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

      12. distribute-rgt-neg-in N/A

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

      13. distribute-lft-neg-in N/A

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

      14. metadata-eval N/A

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

      15. distribute-rgt-out N/A

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

      16. lower-*.f64 N/A

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

      17. unpow2 N/A

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

      18. lower-*.f64 N/A

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

      19. unpow2 N/A

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

      20. lower-fma.f64 N/A

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

      21. +-commutative N/A

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

      22. lower-fma.f64 98.1

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

   5. Applied rewrites 98.1%

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

   6. Taylor expanded in a around 0

      \[\leadsto \left(a \cdot a\right) \cdot 4 - 1 \]
   7. Step-by-step derivation

   8. Applied rewrites 67.9%

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

   if 4.1999999999999996e22 < (*.f64 b b)

   1. Initial program 74.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 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 \]

   5. Applied rewrites 99.9%

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

   6. Taylor expanded in b around inf

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

      1. lower-pow.f64 93.7

         \[\leadsto \color{blue}{{b}^{4}} \]

   8. Applied rewrites 93.7%

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

   10. Applied rewrites 93.6%

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

Alternative 7: 51.7% accurate, 11.1× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

def code(a, b):
	return ((a * a) * 4.0) - 1.0

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 77.6%

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

3. Taylor expanded in b around 0

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

   1. +-commutative N/A

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

   2. 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) - 1 \]

   3. 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) - 1 \]

   4. *-commutative N/A

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

   5. 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) - 1 \]

   6. *-lft-identity N/A

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

   7. metadata-eval N/A

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

   8. fp-cancel-sign-sub-inv N/A

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

   9. mul-1-neg N/A

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

   10. distribute-lft-in N/A

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

   11. metadata-eval N/A

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

   12. distribute-rgt-neg-in N/A

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

   13. distribute-lft-neg-in N/A

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

   14. metadata-eval N/A

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

   15. distribute-rgt-out N/A

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

   16. lower-*.f64 N/A

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

   17. unpow2 N/A

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

   18. lower-*.f64 N/A

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

   19. unpow2 N/A

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

   20. lower-fma.f64 N/A

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

   21. +-commutative N/A

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

   22. lower-fma.f64 71.2

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

5. Applied rewrites 71.2%

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

6. Taylor expanded in a around 0

   \[\leadsto \left(a \cdot a\right) \cdot 4 - 1 \]
7. Step-by-step derivation

8. Applied rewrites 49.0%

   \[\leadsto \left(a \cdot a\right) \cdot 4 - 1 \]
9. Add Preprocessing

Alternative 8: 25.0% 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 77.6%

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

3. Taylor expanded in 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. associate--l+ N/A

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

   2. *-commutative N/A

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

   3. associate-*r* N/A

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

   4. *-lft-identity N/A

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

   5. metadata-eval N/A

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

   6. fp-cancel-sign-sub-inv N/A

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

   7. mul-1-neg N/A

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

   8. distribute-lft-in N/A

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

   9. metadata-eval N/A

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

   10. distribute-rgt-neg-in N/A

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

   11. distribute-lft-neg-in N/A

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

   12. metadata-eval N/A

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

   13. lower-fma.f64 N/A

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

   14. +-commutative N/A

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

   15. lower-fma.f64 N/A

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

   16. unpow2 N/A

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

   17. lower-*.f64 N/A

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

   18. lower--.f64 N/A

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

   19. lower-pow.f64 59.5

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

5. Applied rewrites 59.5%

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

6. Taylor expanded in a around 0

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

8. Applied rewrites 25.0%

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

Reproduce

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