Bouland and Aaronson, Equation (24)

Percentage Accurate: 74.4% → 99.4%

Time: 8.2s

Alternatives: 9

Speedup: 6.2×

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

Specification

Math

\[\begin{array}{l} \\ \left({\left(a \cdot a + b \cdot b\right)}^{2} + 4 \cdot \left(\left(a \cdot a\right) \cdot \left(1 - a\right) + \left(b \cdot b\right) \cdot \left(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

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 74.4% 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

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(a, b)
use fmin_fmax_functions
    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.4% accurate, 2.7× speedup

Math

\[\begin{array}{l} b_m = \left|b\right| \\ \begin{array}{l} t_0 := \mathsf{fma}\left(a, a + -4, 4\right)\\ \mathbf{if}\;b\_m \leq 6.2 \cdot 10^{-171}:\\ \;\;\;\;\left(t\_0 \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\_m, b\_m, 12\right)\right), b\_m \cdot b\_m, t\_0 \cdot \left(a \cdot a\right)\right) - 1\\ \end{array} \end{array} \]

FPCore

b_m = (fabs.f64 b)
(FPCore (a b_m)
 :precision binary64
 (let* ((t_0 (fma a (+ a -4.0) 4.0)))
   (if (<= b_m 6.2e-171)
     (- (* (* t_0 a) a) 1.0)
     (-
      (fma
       (fma (fma 2.0 a 4.0) a (fma b_m b_m 12.0))
       (* b_m b_m)
       (* t_0 (* a a)))
      1.0))))

C

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

Julia

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

Wolfram

b_m = N[Abs[b], $MachinePrecision]
code[a_, b$95$m_] := Block[{t$95$0 = N[(a * N[(a + -4.0), $MachinePrecision] + 4.0), $MachinePrecision]}, If[LessEqual[b$95$m, 6.2e-171], N[(N[(N[(t$95$0 * a), $MachinePrecision] * a), $MachinePrecision] - 1.0), $MachinePrecision], N[(N[(N[(N[(2.0 * a + 4.0), $MachinePrecision] * a + N[(b$95$m * b$95$m + 12.0), $MachinePrecision]), $MachinePrecision] * N[(b$95$m * b$95$m), $MachinePrecision] + N[(t$95$0 * N[(a * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - 1.0), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if b < 6.2000000000000001e-171

   1. Initial program 74.8%

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

   3. Taylor expanded in 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 78.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 78.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. Step-by-step derivation

   7. Applied rewrites 78.2%

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

   if 6.2000000000000001e-171 < b

   1. Initial program 76.1%

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

   7. Applied rewrites 99.9%

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

   8. Taylor expanded in a around 0

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

   10. Applied rewrites 99.9%

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

Alternative 2: 99.8% accurate, 2.6× speedup

Math

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

FPCore

b_m = (fabs.f64 b)
(FPCore (a b_m)
 :precision binary64
 (-
  (fma
   (* (fma (* a a) 2.0 (fma b_m b_m (fma 4.0 a 12.0))) b_m)
   b_m
   (* (* a a) (fma a a (fma -4.0 a 4.0))))
  1.0))

C

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

Julia

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

Wolfram

b_m = N[Abs[b], $MachinePrecision]
code[a_, b$95$m_] := N[(N[(N[(N[(N[(a * a), $MachinePrecision] * 2.0 + N[(b$95$m * b$95$m + N[(4.0 * a + 12.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * b$95$m), $MachinePrecision] * b$95$m + 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 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. 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 3: 98.3% accurate, 3.2× speedup

Math

\[\begin{array}{l} b_m = \left|b\right| \\ \begin{array}{l} \mathbf{if}\;b\_m \leq 0.00034:\\ \;\;\;\;\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\_m, b\_m, 12\right)\right), b\_m \cdot b\_m, \left(a \cdot a\right) \cdot 4\right) - 1\\ \end{array} \end{array} \]

FPCore

b_m = (fabs.f64 b)
(FPCore (a b_m)
 :precision binary64
 (if (<= b_m 0.00034)
   (- (* (* (fma a (+ a -4.0) 4.0) a) a) 1.0)
   (-
    (fma
     (fma (fma 2.0 a 4.0) a (fma b_m b_m 12.0))
     (* b_m b_m)
     (* (* a a) 4.0))
    1.0)))

C

b_m = fabs(b);
double code(double a, double b_m) {
	double tmp;
	if (b_m <= 0.00034) {
		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_m, b_m, 12.0)), (b_m * b_m), ((a * a) * 4.0)) - 1.0;
	}
	return tmp;
}

Julia

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

Wolfram

b_m = N[Abs[b], $MachinePrecision]
code[a_, b$95$m_] := If[LessEqual[b$95$m, 0.00034], N[(N[(N[(N[(a * N[(a + -4.0), $MachinePrecision] + 4.0), $MachinePrecision] * a), $MachinePrecision] * a), $MachinePrecision] - 1.0), $MachinePrecision], N[(N[(N[(N[(2.0 * a + 4.0), $MachinePrecision] * a + N[(b$95$m * b$95$m + 12.0), $MachinePrecision]), $MachinePrecision] * N[(b$95$m * b$95$m), $MachinePrecision] + N[(N[(a * a), $MachinePrecision] * 4.0), $MachinePrecision]), $MachinePrecision] - 1.0), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if b < 3.4e-4

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

   7. Applied rewrites 82.3%

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

   if 3.4e-4 < 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(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. Step-by-step derivation

   7. Applied rewrites 99.8%

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

   8. Taylor expanded in a around 0

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

   10. Applied rewrites 99.8%

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

   11. Taylor expanded in a around 0

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

   13. Applied rewrites 97.0%

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

Alternative 4: 93.8% accurate, 4.8× speedup

Math

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

FPCore

b_m = (fabs.f64 b)
(FPCore (a b_m)
 :precision binary64
 (if (<= b_m 6.5e+34)
   (- (* (* (fma a (+ a -4.0) 4.0) a) a) 1.0)
   (- (* (* (fma b_m b_m (fma 4.0 a 12.0)) b_m) b_m) 1.0)))

C

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

Julia

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

Wolfram

b_m = N[Abs[b], $MachinePrecision]
code[a_, b$95$m_] := If[LessEqual[b$95$m, 6.5e+34], 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$95$m * b$95$m + N[(4.0 * a + 12.0), $MachinePrecision]), $MachinePrecision] * b$95$m), $MachinePrecision] * b$95$m), $MachinePrecision] - 1.0), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if b < 6.50000000000000017e34

   1. Initial program 78.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) + {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 81.4

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

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

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

   if 6.50000000000000017e34 < b

   1. Initial program 65.4%

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

   3. Taylor expanded in a around 0

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

      1. +-commutative N/A

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

      2. +-commutative N/A

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

      3. associate-+l+ N/A

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

      4. metadata-eval N/A

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

      5. pow-sqr N/A

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

      6. associate-*r* N/A

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

      7. distribute-rgt-in N/A

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

      8. metadata-eval N/A

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

      9. distribute-lft-in N/A

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

      10. distribute-lft-in N/A

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

      11. +-commutative N/A

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

      12. *-commutative N/A

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

      13. unpow2 N/A

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

      14. associate-*r* N/A

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

      15. 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 97.8%

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

Alternative 5: 94.1% accurate, 5.3× speedup

Math

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

FPCore

b_m = (fabs.f64 b)
(FPCore (a b_m)
 :precision binary64
 (if (<= b_m 6.5e+34)
   (- (* (* (fma a (+ a -4.0) 4.0) a) a) 1.0)
   (- (* (* (fma b_m b_m 12.0) b_m) b_m) 1.0)))

C

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

Julia

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

Wolfram

b_m = N[Abs[b], $MachinePrecision]
code[a_, b$95$m_] := If[LessEqual[b$95$m, 6.5e+34], 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$95$m * b$95$m + 12.0), $MachinePrecision] * b$95$m), $MachinePrecision] * b$95$m), $MachinePrecision] - 1.0), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if b < 6.50000000000000017e34

   1. Initial program 78.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) + {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 81.4

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

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

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

   if 6.50000000000000017e34 < b

   1. Initial program 65.4%

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

   3. Taylor expanded in a around 0

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

      1. +-commutative N/A

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

      2. +-commutative N/A

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

      3. associate-+l+ N/A

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

      4. metadata-eval N/A

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

      5. pow-sqr N/A

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

      6. associate-*r* N/A

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

      7. distribute-rgt-in N/A

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

      8. metadata-eval N/A

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

      9. distribute-lft-in N/A

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

      10. distribute-lft-in N/A

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

      11. +-commutative N/A

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

      12. *-commutative N/A

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

      13. unpow2 N/A

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

      14. associate-*r* N/A

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

      15. 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 97.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 98.0%

      \[\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 6: 93.3% accurate, 6.0× speedup

Math

\[\begin{array}{l} b_m = \left|b\right| \\ \begin{array}{l} \mathbf{if}\;b\_m \leq 6.5 \cdot 10^{+34}:\\ \;\;\;\;\left(a \cdot a\right) \cdot \left(a \cdot a\right) - 1\\ \mathbf{else}:\\ \;\;\;\;\left(\mathsf{fma}\left(b\_m, b\_m, 12\right) \cdot b\_m\right) \cdot b\_m - 1\\ \end{array} \end{array} \]

FPCore

b_m = (fabs.f64 b)
(FPCore (a b_m)
 :precision binary64
 (if (<= b_m 6.5e+34)
   (- (* (* a a) (* a a)) 1.0)
   (- (* (* (fma b_m b_m 12.0) b_m) b_m) 1.0)))

C

b_m = fabs(b);
double code(double a, double b_m) {
	double tmp;
	if (b_m <= 6.5e+34) {
		tmp = ((a * a) * (a * a)) - 1.0;
	} else {
		tmp = ((fma(b_m, b_m, 12.0) * b_m) * b_m) - 1.0;
	}
	return tmp;
}

Julia

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

Wolfram

b_m = N[Abs[b], $MachinePrecision]
code[a_, b$95$m_] := If[LessEqual[b$95$m, 6.5e+34], N[(N[(N[(a * a), $MachinePrecision] * N[(a * a), $MachinePrecision]), $MachinePrecision] - 1.0), $MachinePrecision], N[(N[(N[(N[(b$95$m * b$95$m + 12.0), $MachinePrecision] * b$95$m), $MachinePrecision] * b$95$m), $MachinePrecision] - 1.0), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if b < 6.50000000000000017e34

   1. Initial program 78.2%

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

   3. Taylor expanded in a around inf

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

      1. lower-pow.f64 81.2

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

   5. Applied rewrites 81.2%

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

   7. Applied rewrites 81.2%

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

   if 6.50000000000000017e34 < b

   1. Initial program 65.4%

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

   3. Taylor expanded in a around 0

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

      1. +-commutative N/A

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

      2. +-commutative N/A

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

      3. associate-+l+ N/A

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

      4. metadata-eval N/A

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

      5. pow-sqr N/A

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

      6. associate-*r* N/A

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

      7. distribute-rgt-in N/A

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

      8. metadata-eval N/A

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

      9. distribute-lft-in N/A

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

      10. distribute-lft-in N/A

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

      11. +-commutative N/A

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

      12. *-commutative N/A

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

      13. unpow2 N/A

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

      14. associate-*r* N/A

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

      15. 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 97.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 98.0%

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

Math

\[\begin{array}{l} b_m = \left|b\right| \\ \begin{array}{l} \mathbf{if}\;b\_m \leq 1.7 \cdot 10^{+142}:\\ \;\;\;\;\left(a \cdot a\right) \cdot \left(a \cdot a\right) - 1\\ \mathbf{else}:\\ \;\;\;\;\left(b\_m \cdot b\_m\right) \cdot 12 - 1\\ \end{array} \end{array} \]

FPCore

b_m = (fabs.f64 b)
(FPCore (a b_m)
 :precision binary64
 (if (<= b_m 1.7e+142)
   (- (* (* a a) (* a a)) 1.0)
   (- (* (* b_m b_m) 12.0) 1.0)))

C

b_m = fabs(b);
double code(double a, double b_m) {
	double tmp;
	if (b_m <= 1.7e+142) {
		tmp = ((a * a) * (a * a)) - 1.0;
	} else {
		tmp = ((b_m * b_m) * 12.0) - 1.0;
	}
	return tmp;
}

Fortran

b_m =     private
module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(a, b_m)
use fmin_fmax_functions
    real(8), intent (in) :: a
    real(8), intent (in) :: b_m
    real(8) :: tmp
    if (b_m <= 1.7d+142) then
        tmp = ((a * a) * (a * a)) - 1.0d0
    else
        tmp = ((b_m * b_m) * 12.0d0) - 1.0d0
    end if
    code = tmp
end function

Java

b_m = Math.abs(b);
public static double code(double a, double b_m) {
	double tmp;
	if (b_m <= 1.7e+142) {
		tmp = ((a * a) * (a * a)) - 1.0;
	} else {
		tmp = ((b_m * b_m) * 12.0) - 1.0;
	}
	return tmp;
}

Python

b_m = math.fabs(b)
def code(a, b_m):
	tmp = 0
	if b_m <= 1.7e+142:
		tmp = ((a * a) * (a * a)) - 1.0
	else:
		tmp = ((b_m * b_m) * 12.0) - 1.0
	return tmp

Julia

b_m = abs(b)
function code(a, b_m)
	tmp = 0.0
	if (b_m <= 1.7e+142)
		tmp = Float64(Float64(Float64(a * a) * Float64(a * a)) - 1.0);
	else
		tmp = Float64(Float64(Float64(b_m * b_m) * 12.0) - 1.0);
	end
	return tmp
end

MATLAB

b_m = abs(b);
function tmp_2 = code(a, b_m)
	tmp = 0.0;
	if (b_m <= 1.7e+142)
		tmp = ((a * a) * (a * a)) - 1.0;
	else
		tmp = ((b_m * b_m) * 12.0) - 1.0;
	end
	tmp_2 = tmp;
end

Wolfram

b_m = N[Abs[b], $MachinePrecision]
code[a_, b$95$m_] := If[LessEqual[b$95$m, 1.7e+142], N[(N[(N[(a * a), $MachinePrecision] * N[(a * a), $MachinePrecision]), $MachinePrecision] - 1.0), $MachinePrecision], N[(N[(N[(b$95$m * b$95$m), $MachinePrecision] * 12.0), $MachinePrecision] - 1.0), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if b < 1.6999999999999999e142

   1. Initial program 78.1%

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

   3. Taylor expanded in a around inf

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

      1. lower-pow.f64 76.9

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

   5. Applied rewrites 76.9%

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

   7. Applied rewrites 76.8%

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

   if 1.6999999999999999e142 < b

   1. Initial program 58.3%

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

   3. Taylor expanded in a around 0

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. unpow2 N/A

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

      4. lower-*.f64 N/A

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

      5. lower-pow.f64 100.0

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

   5. Applied rewrites 100.0%

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

   6. Taylor expanded in b around 0

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

   8. Applied rewrites 95.0%

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

Alternative 8: 68.9% accurate, 7.7× speedup

Math

\[\begin{array}{l} b_m = \left|b\right| \\ \begin{array}{l} \mathbf{if}\;b\_m \leq 1.06 \cdot 10^{+123}:\\ \;\;\;\;\left(a \cdot a\right) \cdot 4 - 1\\ \mathbf{else}:\\ \;\;\;\;\left(b\_m \cdot b\_m\right) \cdot 12 - 1\\ \end{array} \end{array} \]

FPCore

b_m = (fabs.f64 b)
(FPCore (a b_m)
 :precision binary64
 (if (<= b_m 1.06e+123) (- (* (* a a) 4.0) 1.0) (- (* (* b_m b_m) 12.0) 1.0)))

C

b_m = fabs(b);
double code(double a, double b_m) {
	double tmp;
	if (b_m <= 1.06e+123) {
		tmp = ((a * a) * 4.0) - 1.0;
	} else {
		tmp = ((b_m * b_m) * 12.0) - 1.0;
	}
	return tmp;
}

Fortran

b_m =     private
module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(a, b_m)
use fmin_fmax_functions
    real(8), intent (in) :: a
    real(8), intent (in) :: b_m
    real(8) :: tmp
    if (b_m <= 1.06d+123) then
        tmp = ((a * a) * 4.0d0) - 1.0d0
    else
        tmp = ((b_m * b_m) * 12.0d0) - 1.0d0
    end if
    code = tmp
end function

Java

b_m = Math.abs(b);
public static double code(double a, double b_m) {
	double tmp;
	if (b_m <= 1.06e+123) {
		tmp = ((a * a) * 4.0) - 1.0;
	} else {
		tmp = ((b_m * b_m) * 12.0) - 1.0;
	}
	return tmp;
}

Python

b_m = math.fabs(b)
def code(a, b_m):
	tmp = 0
	if b_m <= 1.06e+123:
		tmp = ((a * a) * 4.0) - 1.0
	else:
		tmp = ((b_m * b_m) * 12.0) - 1.0
	return tmp

Julia

b_m = abs(b)
function code(a, b_m)
	tmp = 0.0
	if (b_m <= 1.06e+123)
		tmp = Float64(Float64(Float64(a * a) * 4.0) - 1.0);
	else
		tmp = Float64(Float64(Float64(b_m * b_m) * 12.0) - 1.0);
	end
	return tmp
end

MATLAB

b_m = abs(b);
function tmp_2 = code(a, b_m)
	tmp = 0.0;
	if (b_m <= 1.06e+123)
		tmp = ((a * a) * 4.0) - 1.0;
	else
		tmp = ((b_m * b_m) * 12.0) - 1.0;
	end
	tmp_2 = tmp;
end

Wolfram

b_m = N[Abs[b], $MachinePrecision]
code[a_, b$95$m_] := If[LessEqual[b$95$m, 1.06e+123], N[(N[(N[(a * a), $MachinePrecision] * 4.0), $MachinePrecision] - 1.0), $MachinePrecision], N[(N[(N[(b$95$m * b$95$m), $MachinePrecision] * 12.0), $MachinePrecision] - 1.0), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if b < 1.06e123

   1. Initial program 77.7%

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

   3. Taylor expanded in b around 0

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

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

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

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

   if 1.06e123 < b

   1. Initial program 62.5%

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

   3. Taylor expanded in a around 0

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. unpow2 N/A

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

      4. lower-*.f64 N/A

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

      5. lower-pow.f64 100.0

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

   5. Applied rewrites 100.0%

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

   6. Taylor expanded in b around 0

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

   8. Applied rewrites 86.3%

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

Alternative 9: 51.9% accurate, 11.1× speedup

Math

\[\begin{array}{l} b_m = \left|b\right| \\ \left(b\_m \cdot b\_m\right) \cdot 12 - 1 \end{array} \]

FPCore

b_m = (fabs.f64 b)
(FPCore (a b_m) :precision binary64 (- (* (* b_m b_m) 12.0) 1.0))

C

b_m = fabs(b);
double code(double a, double b_m) {
	return ((b_m * b_m) * 12.0) - 1.0;
}

Fortran

b_m =     private
module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(a, b_m)
use fmin_fmax_functions
    real(8), intent (in) :: a
    real(8), intent (in) :: b_m
    code = ((b_m * b_m) * 12.0d0) - 1.0d0
end function

Java

b_m = Math.abs(b);
public static double code(double a, double b_m) {
	return ((b_m * b_m) * 12.0) - 1.0;
}

Python

b_m = math.fabs(b)
def code(a, b_m):
	return ((b_m * b_m) * 12.0) - 1.0

Julia

b_m = abs(b)
function code(a, b_m)
	return Float64(Float64(Float64(b_m * b_m) * 12.0) - 1.0)
end

MATLAB

b_m = abs(b);
function tmp = code(a, b_m)
	tmp = ((b_m * b_m) * 12.0) - 1.0;
end

Wolfram

b_m = N[Abs[b], $MachinePrecision]
code[a_, b$95$m_] := N[(N[(N[(b$95$m * b$95$m), $MachinePrecision] * 12.0), $MachinePrecision] - 1.0), $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. Add Preprocessing

3. Taylor expanded in a around 0

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

   1. *-commutative N/A

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

   2. lower-fma.f64 N/A

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

   3. unpow2 N/A

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

   4. lower-*.f64 N/A

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

   5. lower-pow.f64 73.6

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

5. Applied rewrites 73.6%

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

6. Taylor expanded in b around 0

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

8. Applied rewrites 57.2%

   \[\leadsto \left(b \cdot b\right) \cdot \color{blue}{12} - 1 \]
9. Add Preprocessing

Reproduce

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