Bouland and Aaronson, Equation (24)

Percentage Accurate: 73.7% → 98.0%

Time: 6.0s

Alternatives: 5

Speedup: 1.2×

• 60.9% 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.7% 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: 98.0% accurate, 0.2× speedup

Math

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

FPCore

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

C

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

Julia

function code(a, b)
	t_0 = Float64(Float64(b * b) * Float64(a + 3.0))
	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)) + t_0))) <= Inf)
		tmp = Float64((hypot(a, b) ^ 4.0) + fma(4.0, fma(a, Float64(a * Float64(1.0 - a)), t_0), -1.0));
	else
		tmp = Float64(-1.0 + (a ^ 4.0));
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (+.f64 (pow.f64 (+.f64 (*.f64 a a) (*.f64 b b)) 2) (*.f64 4 (+.f64 (*.f64 (*.f64 a a) (-.f64 1 a)) (*.f64 (*.f64 b b) (+.f64 3 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(3 + a\right)\right)\right) - 1 \]
   2. Step-by-step derivation

      1. associate--l+ 99.8%

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

      2. sqr-pow 99.8%

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

   3. Simplified 100.0%

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

   if +inf.0 < (+.f64 (pow.f64 (+.f64 (*.f64 a a) (*.f64 b b)) 2) (*.f64 4 (+.f64 (*.f64 (*.f64 a a) (-.f64 1 a)) (*.f64 (*.f64 b b) (+.f64 3 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(3 + 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(3 + a\right)\right)\right) + \left(-1\right)} \]

      2. sqr-neg 0.0%

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

      3. +-commutative 0.0%

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

      4. sqr-neg 0.0%

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

      5. +-commutative 0.0%

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

   3. Simplified 4.8%

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

   4. Taylor expanded in a around inf 98.5%

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

4. Final simplification 99.6%

   \[\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 \infty:\\ \;\;\;\;{\left(\mathsf{hypot}\left(a, b\right)\right)}^{4} + \mathsf{fma}\left(4, \mathsf{fma}\left(a, a \cdot \left(1 - a\right), \left(b \cdot b\right) \cdot \left(a + 3\right)\right), -1\right)\\ \mathbf{else}:\\ \;\;\;\;-1 + {a}^{4}\\ \end{array} \]

Alternative 2: 97.9% accurate, 0.3× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (+.f64 (pow.f64 (+.f64 (*.f64 a a) (*.f64 b b)) 2) (*.f64 4 (+.f64 (*.f64 (*.f64 a a) (-.f64 1 a)) (*.f64 (*.f64 b b) (+.f64 3 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(3 + a\right)\right)\right) - 1 \]
   2. Step-by-step derivation

      1. +-commutative 99.8%

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

      2. associate-*l* 99.8%

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

      3. fma-def 99.9%

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

      4. +-commutative 99.9%

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

      5. pow2 99.9%

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

   3. Applied egg-rr 99.9%

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

   if +inf.0 < (+.f64 (pow.f64 (+.f64 (*.f64 a a) (*.f64 b b)) 2) (*.f64 4 (+.f64 (*.f64 (*.f64 a a) (-.f64 1 a)) (*.f64 (*.f64 b b) (+.f64 3 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(3 + 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(3 + a\right)\right)\right) + \left(-1\right)} \]

      2. sqr-neg 0.0%

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

      3. +-commutative 0.0%

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

      4. sqr-neg 0.0%

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

      5. +-commutative 0.0%

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

   3. Simplified 4.8%

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

   4. Taylor expanded in a around inf 98.5%

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

4. Final simplification 99.5%

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

Alternative 3: 97.9% 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(1 - a\right) + \left(b \cdot b\right) \cdot \left(a + 3\right)\right)\\ \mathbf{if}\;t_0 \leq \infty:\\ \;\;\;\;t_0 + -1\\ \mathbf{else}:\\ \;\;\;\;-1 + {a}^{4}\\ \end{array} \end{array} \]

FPCore

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

C

double code(double a, double b) {
	double t_0 = pow(((a * a) + (b * b)), 2.0) + (4.0 * (((a * a) * (1.0 - a)) + ((b * b) * (a + 3.0))));
	double tmp;
	if (t_0 <= ((double) INFINITY)) {
		tmp = t_0 + -1.0;
	} else {
		tmp = -1.0 + pow(a, 4.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) * (1.0 - a)) + ((b * b) * (a + 3.0))));
	double tmp;
	if (t_0 <= Double.POSITIVE_INFINITY) {
		tmp = t_0 + -1.0;
	} else {
		tmp = -1.0 + Math.pow(a, 4.0);
	}
	return tmp;
}

Python

def code(a, b):
	t_0 = math.pow(((a * a) + (b * b)), 2.0) + (4.0 * (((a * a) * (1.0 - a)) + ((b * b) * (a + 3.0))))
	tmp = 0
	if t_0 <= math.inf:
		tmp = t_0 + -1.0
	else:
		tmp = -1.0 + math.pow(a, 4.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(1.0 - a)) + Float64(Float64(b * b) * Float64(a + 3.0)))))
	tmp = 0.0
	if (t_0 <= Inf)
		tmp = Float64(t_0 + -1.0);
	else
		tmp = Float64(-1.0 + (a ^ 4.0));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b)
	t_0 = (((a * a) + (b * b)) ^ 2.0) + (4.0 * (((a * a) * (1.0 - a)) + ((b * b) * (a + 3.0))));
	tmp = 0.0;
	if (t_0 <= Inf)
		tmp = t_0 + -1.0;
	else
		tmp = -1.0 + (a ^ 4.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[(1.0 - a), $MachinePrecision]), $MachinePrecision] + N[(N[(b * b), $MachinePrecision] * N[(a + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, Infinity], N[(t$95$0 + -1.0), $MachinePrecision], N[(-1.0 + N[Power[a, 4.0], $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (+.f64 (pow.f64 (+.f64 (*.f64 a a) (*.f64 b b)) 2) (*.f64 4 (+.f64 (*.f64 (*.f64 a a) (-.f64 1 a)) (*.f64 (*.f64 b b) (+.f64 3 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(3 + a\right)\right)\right) - 1 \]

   if +inf.0 < (+.f64 (pow.f64 (+.f64 (*.f64 a a) (*.f64 b b)) 2) (*.f64 4 (+.f64 (*.f64 (*.f64 a a) (-.f64 1 a)) (*.f64 (*.f64 b b) (+.f64 3 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(3 + 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(3 + a\right)\right)\right) + \left(-1\right)} \]

      2. sqr-neg 0.0%

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

      3. +-commutative 0.0%

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

      4. sqr-neg 0.0%

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

      5. +-commutative 0.0%

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

   3. Simplified 4.8%

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

   4. Taylor expanded in a around inf 98.5%

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

4. Final simplification 99.5%

   \[\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 \infty:\\ \;\;\;\;\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(a + 3\right)\right)\right) + -1\\ \mathbf{else}:\\ \;\;\;\;-1 + {a}^{4}\\ \end{array} \]

Alternative 4: 80.7% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq 330000000:\\ \;\;\;\;-1 + {a}^{4}\\ \mathbf{else}:\\ \;\;\;\;-1 + {b}^{4}\\ \end{array} \end{array} \]

FPCore

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

C

double code(double a, double b) {
	double tmp;
	if (b <= 330000000.0) {
		tmp = -1.0 + pow(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 <= 330000000.0d0) then
        tmp = (-1.0d0) + (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 <= 330000000.0) {
		tmp = -1.0 + Math.pow(a, 4.0);
	} else {
		tmp = -1.0 + Math.pow(b, 4.0);
	}
	return tmp;
}

Python

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

Julia

function code(a, b)
	tmp = 0.0
	if (b <= 330000000.0)
		tmp = Float64(-1.0 + (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 <= 330000000.0)
		tmp = -1.0 + (a ^ 4.0);
	else
		tmp = -1.0 + (b ^ 4.0);
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if b < 3.3e8

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

      1. sub-neg 77.8%

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

      2. sqr-neg 77.8%

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

      3. +-commutative 77.8%

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

      4. sqr-neg 77.8%

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

      5. +-commutative 77.8%

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

   3. Simplified 78.8%

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

   4. Taylor expanded in a around inf 80.4%

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

   if 3.3e8 < b

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

      1. sub-neg 68.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(3 + a\right)\right)\right) + \left(-1\right)} \]

      2. sqr-neg 68.1%

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

      3. +-commutative 68.1%

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

      4. sqr-neg 68.1%

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

      5. +-commutative 68.1%

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

   3. Simplified 69.6%

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

   4. Taylor expanded in b around inf 95.7%

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

4. Final simplification 84.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq 330000000:\\ \;\;\;\;-1 + {a}^{4}\\ \mathbf{else}:\\ \;\;\;\;-1 + {b}^{4}\\ \end{array} \]

Alternative 5: 68.9% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ -1 + {a}^{4} \end{array} \]

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

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

   1. sub-neg 75.3%

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

   2. sqr-neg 75.3%

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

   3. +-commutative 75.3%

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

   4. sqr-neg 75.3%

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

   5. +-commutative 75.3%

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

3. Simplified 76.4%

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

4. Taylor expanded in a around inf 69.2%

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

5. Final simplification 69.2%

   \[\leadsto -1 + {a}^{4} \]

Reproduce

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