Bouland and Aaronson, Equation (25)

Percentage Accurate: 73.9% → 98.2%

Time: 9.5s

Alternatives: 6

Speedup: 1.2×

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 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(1 - 3 \cdot a\right)\right)\right) - 1 \end{array} \]

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 98.2% accurate, 0.5× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[a_, b_] := Block[{t$95$0 = 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[(a + 1.0), $MachinePrecision]), $MachinePrecision] + N[(N[(b * b), $MachinePrecision] * N[(1.0 - N[(a * 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, Infinity], N[(t$95$0 + -1.0), $MachinePrecision], N[(N[(a * N[(a * N[(a * N[(a + 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

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

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

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

   1. Initial program 0.0%

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

      1. sub-neg 0.0%

         \[\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(1 - 3 \cdot a\right)\right)\right) + \left(-1\right)} \]

   3. Simplified 1.5%

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

   5. Taylor expanded in b around 0 33.9%

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

   6. Taylor expanded in a around inf 33.9%

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

      1. metadata-eval 33.9%

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

      2. pow-prod-up 33.9%

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

      3. pow1 33.9%

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

      4. distribute-rgt-in 91.5%

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

      5. unpow3 91.5%

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

      6. unpow2 91.5%

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

      7. associate-*r* 91.5%

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

      8. *-commutative 91.5%

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

      9. unpow2 91.5%

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

      10. associate-*r* 91.5%

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

      11. +-commutative 91.5%

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

   8. Applied egg-rr 91.5%

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

4. Final simplification 97.7%

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

Alternative 2: 82.0% accurate, 1.1× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if b < 1050

   1. Initial program 76.2%

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

      1. sub-neg 76.2%

         \[\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(1 - 3 \cdot a\right)\right)\right) + \left(-1\right)} \]

   3. Simplified 76.7%

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

   5. Taylor expanded in b around 0 64.7%

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

   6. Taylor expanded in a around 0 80.1%

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

   if 1050 < b

   1. Initial program 67.5%

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

      1. sub-neg 67.5%

         \[\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(1 - 3 \cdot a\right)\right)\right) + \left(-1\right)} \]

   3. Simplified 67.5%

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

   5. Taylor expanded in b around inf 90.8%

      \[\leadsto \color{blue}{{b}^{4}} + -1 \]
3. Recombined 2 regimes into one program.

4. Final simplification 82.7%

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

Alternative 3: 81.4% accurate, 1.1× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if b < 880

   1. Initial program 76.2%

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

      1. sub-neg 76.2%

         \[\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(1 - 3 \cdot a\right)\right)\right) + \left(-1\right)} \]

   3. Simplified 76.7%

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

   5. Taylor expanded in a around inf 79.9%

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

      1. associate-*r/ 79.9%

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

      2. metadata-eval 79.9%

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

   7. Simplified 79.9%

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

   if 880 < b

   1. Initial program 67.5%

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

      1. sub-neg 67.5%

         \[\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(1 - 3 \cdot a\right)\right)\right) + \left(-1\right)} \]

   3. Simplified 67.5%

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

   5. Taylor expanded in b around inf 90.8%

      \[\leadsto \color{blue}{{b}^{4}} + -1 \]
3. Recombined 2 regimes into one program.

4. Final simplification 82.5%

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

Alternative 4: 81.5% accurate, 1.2× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if b < 1050

   1. Initial program 76.2%

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

      1. sub-neg 76.2%

         \[\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(1 - 3 \cdot a\right)\right)\right) + \left(-1\right)} \]

   3. Simplified 76.7%

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

   5. Taylor expanded in a around inf 79.9%

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

      1. associate-*r/ 79.9%

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

      2. metadata-eval 79.9%

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

   7. Simplified 79.9%

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

   8. Taylor expanded in a around 0 79.9%

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

   if 1050 < b

   1. Initial program 67.5%

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

      1. sub-neg 67.5%

         \[\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(1 - 3 \cdot a\right)\right)\right) + \left(-1\right)} \]

   3. Simplified 67.5%

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

   5. Taylor expanded in b around inf 90.8%

      \[\leadsto \color{blue}{{b}^{4}} + -1 \]
3. Recombined 2 regimes into one program.

4. Final simplification 82.5%

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

Alternative 5: 81.5% accurate, 1.2× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if b < 1050

   1. Initial program 76.2%

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

      1. sub-neg 76.2%

         \[\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(1 - 3 \cdot a\right)\right)\right) + \left(-1\right)} \]

   3. Simplified 76.7%

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

   5. Taylor expanded in b around 0 64.7%

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

   6. Taylor expanded in a around inf 64.4%

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

      1. metadata-eval 64.4%

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

      2. pow-prod-up 64.4%

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

      3. pow1 64.4%

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

      4. distribute-rgt-in 79.9%

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

      5. unpow3 79.8%

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

      6. unpow2 79.8%

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

      7. associate-*r* 79.8%

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

      8. *-commutative 79.8%

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

      9. unpow2 79.8%

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

      10. associate-*r* 79.8%

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

      11. +-commutative 79.8%

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

   8. Applied egg-rr 79.8%

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

   if 1050 < b

   1. Initial program 67.5%

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

      1. sub-neg 67.5%

         \[\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(1 - 3 \cdot a\right)\right)\right) + \left(-1\right)} \]

   3. Simplified 67.5%

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

   5. Taylor expanded in b around inf 90.8%

      \[\leadsto \color{blue}{{b}^{4}} + -1 \]
3. Recombined 2 regimes into one program.

4. Final simplification 82.5%

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

Alternative 6: 68.7% accurate, 11.8× speedup

Math

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

FPCore

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

C

double code(double a, double b) {
	return (a * (a * (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 * (a * (a + 4.0d0)))) + (-1.0d0)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 74.1%

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

   1. sub-neg 74.1%

      \[\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(1 - 3 \cdot a\right)\right)\right) + \left(-1\right)} \]

3. Simplified 74.5%

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

5. Taylor expanded in b around 0 53.6%

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

6. Taylor expanded in a around inf 53.4%

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

   1. metadata-eval 53.4%

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

   2. pow-prod-up 53.4%

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

   3. pow1 53.4%

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

   4. distribute-rgt-in 68.2%

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

   5. unpow3 68.2%

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

   6. unpow2 68.2%

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

   7. associate-*r* 68.2%

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

   8. *-commutative 68.2%

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

   9. unpow2 68.2%

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

   10. associate-*r* 68.2%

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

   11. +-commutative 68.2%

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

8. Applied egg-rr 68.2%

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

9. Final simplification 68.2%

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

Reproduce

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