Bouland and Aaronson, Equation (25)

Percentage Accurate: 73.4% → 99.9%

Time: 8.5s

Alternatives: 10

Speedup: 5.2×

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

FPCore

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

C

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

Fortran

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) * (1.0d0 - (3.0d0 * a)))))) - 1.0d0
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

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

FPCore

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

C

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

Fortran

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) * (1.0d0 - (3.0d0 * a)))))) - 1.0d0
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 99.9% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left({\left(a \cdot a + b \cdot b\right)}^{2} + 4 \cdot \left(\left(a \cdot a\right) \cdot \left(1 + a\right) + \left(b \cdot b\right) \cdot \left(1 - 3 \cdot a\right)\right)\right) - 1\\ \mathbf{if}\;t\_0 \leq \infty:\\ \;\;\;\;t\_0\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(b \cdot b, 4, \left(\mathsf{fma}\left(b \cdot b, 2, a \cdot a\right) \cdot a\right) \cdot a - 1\right)\\ \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) (- 1.0 (* 3.0 a))))))
          1.0)))
   (if (<= t_0 INFINITY)
     t_0
     (fma (* b b) 4.0 (- (* (* (fma (* b b) 2.0 (* a a)) a) a) 1.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) * (1.0 - (3.0 * a)))))) - 1.0;
	double tmp;
	if (t_0 <= ((double) INFINITY)) {
		tmp = t_0;
	} else {
		tmp = fma((b * b), 4.0, (((fma((b * b), 2.0, (a * a)) * a) * a) - 1.0));
	}
	return tmp;
}

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 99.8%

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

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

   1. Initial program 0.0%

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

   3. Taylor expanded in b around 0

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

      1. associate-*r* N/A

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

      2. +-commutative N/A

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

      3. metadata-eval N/A

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

      4. pow-sqr N/A

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

      5. *-commutative N/A

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

      6. associate-*r* N/A

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

      7. distribute-lft-in N/A

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

      8. +-commutative N/A

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

      9. *-commutative N/A

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

      10. unpow2 N/A

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

      11. associate-*r* N/A

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

      12. lower-*.f64 N/A

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

      13. lower-*.f64 N/A

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

      14. *-commutative N/A

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

      15. lower-fma.f64 N/A

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

      16. unpow2 N/A

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

      17. lower-*.f64 N/A

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

      18. unpow2 N/A

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

      19. lower-*.f64 0.0

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

   5. Applied rewrites 0.0%

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

   6. Taylor expanded in a around 0

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

      1. unpow2 N/A

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

      2. lower-*.f64 100.0

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

   8. Applied rewrites 100.0%

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

      1. lift--.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. +-commutative N/A

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

      4. associate--l+ N/A

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

      5. lift-*.f64 N/A

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

      6. *-commutative N/A

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

   10. Applied rewrites 100.0%

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

Alternative 2: 99.0% accurate, 1.1× speedup

Math

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

FPCore

(FPCore (a b)
 :precision binary64
 (if (<= a -8.2e+68)
   (- (pow a 4.0) 1.0)
   (- (+ (pow (+ (* a a) (* b b)) 2.0) (* 4.0 (* (fma a a a) a))) 1.0)))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if a < -8.1999999999999998e68

   1. Initial program 21.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(1 - 3 \cdot 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 100.0

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

   5. Applied rewrites 100.0%

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

   if -8.1999999999999998e68 < a

   1. Initial program 87.0%

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

   3. Taylor expanded in a around inf

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

      1. unpow3 N/A

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

      2. unpow2 N/A

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

      3. associate-*l* N/A

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

      4. +-commutative N/A

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

      5. distribute-rgt-in N/A

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

      6. lft-mult-inverse N/A

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

      7. *-lft-identity N/A

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

      8. unpow2 N/A

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

      9. associate-*r* N/A

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

      10. *-commutative N/A

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

      11. lower-*.f64 N/A

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

      12. +-commutative N/A

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

      13. distribute-lft-in N/A

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

      14. *-rgt-identity N/A

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

      15. lower-fma.f64 99.0

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

   5. Applied rewrites 99.0%

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

Alternative 3: 91.6% accurate, 3.0× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if b < 0.00419999999999999974

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

   3. Taylor expanded in b around 0

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

      1. associate-*r* N/A

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

      2. +-commutative N/A

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

      3. metadata-eval N/A

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

      4. pow-sqr N/A

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

      5. *-commutative N/A

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

      6. associate-*r* N/A

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

      7. distribute-lft-in N/A

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

      8. +-commutative N/A

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

      9. *-commutative N/A

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

      10. unpow2 N/A

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

      11. associate-*r* N/A

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

      12. lower-*.f64 N/A

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

      13. lower-*.f64 N/A

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

      14. *-commutative N/A

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

      15. lower-fma.f64 N/A

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

      16. unpow2 N/A

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

      17. lower-*.f64 N/A

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

      18. unpow2 N/A

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

      19. lower-*.f64 68.7

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

   5. Applied rewrites 68.7%

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

   6. Taylor expanded in a around 0

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

      1. unpow2 N/A

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

      2. lower-*.f64 90.2

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

   8. Applied rewrites 90.2%

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

      1. lift--.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. +-commutative N/A

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

      4. associate--l+ N/A

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

      5. lift-*.f64 N/A

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

      6. *-commutative N/A

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

   10. Applied rewrites 90.2%

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

   if 0.00419999999999999974 < b

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

   3. Taylor expanded in a around 0

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

      1. +-commutative N/A

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

      2. distribute-lft-in N/A

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

      3. associate-+r+ N/A

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

      4. associate-+r+ N/A

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

   5. Applied rewrites 96.4%

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

Alternative 4: 96.9% accurate, 3.0× speedup

Math

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

FPCore

(FPCore (a b)
 :precision binary64
 (if (or (<= a -1.4e+26) (not (<= a 2e-7)))
   (fma (* b b) 4.0 (- (* (* (fma (* b b) 2.0 (* a a)) a) a) 1.0))
   (- (* (* (fma b b 4.0) b) b) 1.0)))

C

double code(double a, double b) {
	double tmp;
	if ((a <= -1.4e+26) || !(a <= 2e-7)) {
		tmp = fma((b * b), 4.0, (((fma((b * b), 2.0, (a * a)) * a) * a) - 1.0));
	} else {
		tmp = ((fma(b, b, 4.0) * b) * b) - 1.0;
	}
	return tmp;
}

Julia

function code(a, b)
	tmp = 0.0
	if ((a <= -1.4e+26) || !(a <= 2e-7))
		tmp = fma(Float64(b * b), 4.0, Float64(Float64(Float64(fma(Float64(b * b), 2.0, Float64(a * a)) * a) * a) - 1.0));
	else
		tmp = Float64(Float64(Float64(fma(b, b, 4.0) * b) * b) - 1.0);
	end
	return tmp
end

Wolfram

code[a_, b_] := If[Or[LessEqual[a, -1.4e+26], N[Not[LessEqual[a, 2e-7]], $MachinePrecision]], N[(N[(b * b), $MachinePrecision] * 4.0 + N[(N[(N[(N[(N[(b * b), $MachinePrecision] * 2.0 + N[(a * a), $MachinePrecision]), $MachinePrecision] * a), $MachinePrecision] * a), $MachinePrecision] - 1.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(b * b + 4.0), $MachinePrecision] * b), $MachinePrecision] * b), $MachinePrecision] - 1.0), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if a < -1.4e26 or 1.9999999999999999e-7 < a

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

   3. Taylor expanded in b around 0

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

      1. associate-*r* N/A

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

      2. +-commutative N/A

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

      3. metadata-eval N/A

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

      4. pow-sqr N/A

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

      5. *-commutative N/A

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

      6. associate-*r* N/A

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

      7. distribute-lft-in N/A

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

      8. +-commutative N/A

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

      9. *-commutative N/A

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

      10. unpow2 N/A

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

      11. associate-*r* N/A

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

      12. lower-*.f64 N/A

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

      13. lower-*.f64 N/A

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

      14. *-commutative N/A

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

      15. lower-fma.f64 N/A

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

      16. unpow2 N/A

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

      17. lower-*.f64 N/A

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

      18. unpow2 N/A

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

      19. lower-*.f64 47.1

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

   5. Applied rewrites 47.1%

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

   6. Taylor expanded in a around 0

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

      1. unpow2 N/A

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

      2. lower-*.f64 99.5

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

   8. Applied rewrites 99.5%

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

      1. lift--.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. +-commutative N/A

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

      4. associate--l+ N/A

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

      5. lift-*.f64 N/A

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

      6. *-commutative N/A

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

   10. Applied rewrites 99.5%

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

   if -1.4e26 < a < 1.9999999999999999e-7

   1. Initial program 99.9%

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

   3. Taylor expanded in a around 0

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

      1. associate-+r+ N/A

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

      2. +-commutative N/A

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

      3. metadata-eval N/A

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

      4. pow-sqr N/A

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

      5. associate-*r* N/A

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

      6. distribute-rgt-out N/A

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

      7. distribute-lft-out N/A

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

      8. lower-*.f64 N/A

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

      9. unpow2 N/A

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

      10. lower-*.f64 N/A

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

      11. unpow2 N/A

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

      12. lower-fma.f64 N/A

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

      13. lower-fma.f64 98.6

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

   5. Applied rewrites 98.6%

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

   6. Taylor expanded in a around 0

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

   8. Applied rewrites 98.6%

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

   10. Applied rewrites 98.7%

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

4. Final simplification 99.0%

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

Alternative 5: 93.6% accurate, 5.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \leq -1.55 \cdot 10^{+29} \lor \neg \left(a \leq 4.2 \cdot 10^{+27}\right):\\ \;\;\;\;\left(a \cdot a\right) \cdot \left(a \cdot a\right) - 1\\ \mathbf{else}:\\ \;\;\;\;\left(\mathsf{fma}\left(b, b, 4\right) \cdot b\right) \cdot b - 1\\ \end{array} \end{array} \]

FPCore

(FPCore (a b)
 :precision binary64
 (if (or (<= a -1.55e+29) (not (<= a 4.2e+27)))
   (- (* (* a a) (* a a)) 1.0)
   (- (* (* (fma b b 4.0) b) b) 1.0)))

C

double code(double a, double b) {
	double tmp;
	if ((a <= -1.55e+29) || !(a <= 4.2e+27)) {
		tmp = ((a * a) * (a * a)) - 1.0;
	} else {
		tmp = ((fma(b, b, 4.0) * b) * b) - 1.0;
	}
	return tmp;
}

Julia

function code(a, b)
	tmp = 0.0
	if ((a <= -1.55e+29) || !(a <= 4.2e+27))
		tmp = Float64(Float64(Float64(a * a) * Float64(a * a)) - 1.0);
	else
		tmp = Float64(Float64(Float64(fma(b, b, 4.0) * b) * b) - 1.0);
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if a < -1.5499999999999999e29 or 4.19999999999999989e27 < a

   1. Initial program 47.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(1 - 3 \cdot 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 96.2

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

   5. Applied rewrites 96.2%

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

   7. Applied rewrites 96.1%

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

   if -1.5499999999999999e29 < a < 4.19999999999999989e27

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

   3. Taylor expanded in a around 0

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

      1. associate-+r+ N/A

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

      2. +-commutative N/A

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

      3. metadata-eval N/A

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

      4. pow-sqr N/A

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

      5. associate-*r* N/A

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

      6. distribute-rgt-out N/A

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

      7. distribute-lft-out N/A

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

      8. lower-*.f64 N/A

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

      9. unpow2 N/A

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

      10. lower-*.f64 N/A

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

      11. unpow2 N/A

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

      12. lower-fma.f64 N/A

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

      13. lower-fma.f64 98.6

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

   5. Applied rewrites 98.6%

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

   6. Taylor expanded in a around 0

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

   8. Applied rewrites 98.6%

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

   10. Applied rewrites 98.6%

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

4. Final simplification 97.5%

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

Alternative 6: 93.6% accurate, 5.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \leq -1.55 \cdot 10^{+29} \lor \neg \left(a \leq 4.2 \cdot 10^{+27}\right):\\ \;\;\;\;\left(a \cdot a\right) \cdot \left(a \cdot a\right) - 1\\ \mathbf{else}:\\ \;\;\;\;\left(b \cdot b\right) \cdot \mathsf{fma}\left(b, b, 4\right) - 1\\ \end{array} \end{array} \]

FPCore

(FPCore (a b)
 :precision binary64
 (if (or (<= a -1.55e+29) (not (<= a 4.2e+27)))
   (- (* (* a a) (* a a)) 1.0)
   (- (* (* b b) (fma b b 4.0)) 1.0)))

C

double code(double a, double b) {
	double tmp;
	if ((a <= -1.55e+29) || !(a <= 4.2e+27)) {
		tmp = ((a * a) * (a * a)) - 1.0;
	} else {
		tmp = ((b * b) * fma(b, b, 4.0)) - 1.0;
	}
	return tmp;
}

Julia

function code(a, b)
	tmp = 0.0
	if ((a <= -1.55e+29) || !(a <= 4.2e+27))
		tmp = Float64(Float64(Float64(a * a) * Float64(a * a)) - 1.0);
	else
		tmp = Float64(Float64(Float64(b * b) * fma(b, b, 4.0)) - 1.0);
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if a < -1.5499999999999999e29 or 4.19999999999999989e27 < a

   1. Initial program 47.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(1 - 3 \cdot 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 96.2

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

   5. Applied rewrites 96.2%

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

   7. Applied rewrites 96.1%

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

   if -1.5499999999999999e29 < a < 4.19999999999999989e27

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

   3. Taylor expanded in a around 0

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

      1. associate-+r+ N/A

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

      2. +-commutative N/A

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

      3. metadata-eval N/A

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

      4. pow-sqr N/A

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

      5. associate-*r* N/A

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

      6. distribute-rgt-out N/A

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

      7. distribute-lft-out N/A

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

      8. lower-*.f64 N/A

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

      9. unpow2 N/A

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

      10. lower-*.f64 N/A

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

      11. unpow2 N/A

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

      12. lower-fma.f64 N/A

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

      13. lower-fma.f64 98.6

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

   5. Applied rewrites 98.6%

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

   6. Taylor expanded in a around 0

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

   8. Applied rewrites 98.6%

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

4. Final simplification 97.4%

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

Alternative 7: 74.9% accurate, 5.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \leq -18500000000 \lor \neg \left(a \leq 3.5 \cdot 10^{-299}\right):\\ \;\;\;\;\left(a \cdot a\right) \cdot \left(a \cdot a\right) - 1\\ \mathbf{else}:\\ \;\;\;\;\left(\left(b \cdot b\right) \cdot -12\right) \cdot a - 1\\ \end{array} \end{array} \]

FPCore

(FPCore (a b)
 :precision binary64
 (if (or (<= a -18500000000.0) (not (<= a 3.5e-299)))
   (- (* (* a a) (* a a)) 1.0)
   (- (* (* (* b b) -12.0) a) 1.0)))

C

double code(double a, double b) {
	double tmp;
	if ((a <= -18500000000.0) || !(a <= 3.5e-299)) {
		tmp = ((a * a) * (a * a)) - 1.0;
	} else {
		tmp = (((b * b) * -12.0) * a) - 1.0;
	}
	return tmp;
}

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
    real(8) :: tmp
    if ((a <= (-18500000000.0d0)) .or. (.not. (a <= 3.5d-299))) then
        tmp = ((a * a) * (a * a)) - 1.0d0
    else
        tmp = (((b * b) * (-12.0d0)) * a) - 1.0d0
    end if
    code = tmp
end function

Java

public static double code(double a, double b) {
	double tmp;
	if ((a <= -18500000000.0) || !(a <= 3.5e-299)) {
		tmp = ((a * a) * (a * a)) - 1.0;
	} else {
		tmp = (((b * b) * -12.0) * a) - 1.0;
	}
	return tmp;
}

Python

def code(a, b):
	tmp = 0
	if (a <= -18500000000.0) or not (a <= 3.5e-299):
		tmp = ((a * a) * (a * a)) - 1.0
	else:
		tmp = (((b * b) * -12.0) * a) - 1.0
	return tmp

Julia

function code(a, b)
	tmp = 0.0
	if ((a <= -18500000000.0) || !(a <= 3.5e-299))
		tmp = Float64(Float64(Float64(a * a) * Float64(a * a)) - 1.0);
	else
		tmp = Float64(Float64(Float64(Float64(b * b) * -12.0) * a) - 1.0);
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b)
	tmp = 0.0;
	if ((a <= -18500000000.0) || ~((a <= 3.5e-299)))
		tmp = ((a * a) * (a * a)) - 1.0;
	else
		tmp = (((b * b) * -12.0) * a) - 1.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_] := If[Or[LessEqual[a, -18500000000.0], N[Not[LessEqual[a, 3.5e-299]], $MachinePrecision]], N[(N[(N[(a * a), $MachinePrecision] * N[(a * a), $MachinePrecision]), $MachinePrecision] - 1.0), $MachinePrecision], N[(N[(N[(N[(b * b), $MachinePrecision] * -12.0), $MachinePrecision] * a), $MachinePrecision] - 1.0), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if a < -1.85e10 or 3.49999999999999991e-299 < a

   1. Initial program 65.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(1 - 3 \cdot 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 80.3

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

   5. Applied rewrites 80.3%

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

   7. Applied rewrites 80.2%

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

   if -1.85e10 < a < 3.49999999999999991e-299

   1. Initial program 99.9%

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

   3. Taylor expanded in a around 0

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

      1. associate-+r+ N/A

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

      2. +-commutative N/A

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

      3. metadata-eval N/A

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

      4. pow-sqr N/A

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

      5. associate-*r* N/A

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

      6. distribute-rgt-out N/A

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

      7. distribute-lft-out N/A

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

      8. lower-*.f64 N/A

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

      9. unpow2 N/A

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

      10. lower-*.f64 N/A

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

      11. unpow2 N/A

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

      12. lower-fma.f64 N/A

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

      13. lower-fma.f64 98.9

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

   5. Applied rewrites 98.9%

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

   6. Taylor expanded in a around inf

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

   8. Applied rewrites 72.2%

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

   10. Applied rewrites 72.2%

       \[\leadsto \left(\left(b \cdot b\right) \cdot -12\right) \cdot a - 1 \]
3. Recombined 2 regimes into one program.

4. Final simplification 77.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;a \leq -18500000000 \lor \neg \left(a \leq 3.5 \cdot 10^{-299}\right):\\ \;\;\;\;\left(a \cdot a\right) \cdot \left(a \cdot a\right) - 1\\ \mathbf{else}:\\ \;\;\;\;\left(\left(b \cdot b\right) \cdot -12\right) \cdot a - 1\\ \end{array} \]
5. Add Preprocessing

Alternative 8: 52.9% accurate, 6.4× speedup

Math

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

FPCore

(FPCore (a b)
 :precision binary64
 (if (<= b 2.7e+144) (- (* (* a a) 4.0) 1.0) (- (* (* (* b b) -12.0) a) 1.0)))

C

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

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
    real(8) :: tmp
    if (b <= 2.7d+144) then
        tmp = ((a * a) * 4.0d0) - 1.0d0
    else
        tmp = (((b * b) * (-12.0d0)) * a) - 1.0d0
    end if
    code = tmp
end function

Java

public static double code(double a, double b) {
	double tmp;
	if (b <= 2.7e+144) {
		tmp = ((a * a) * 4.0) - 1.0;
	} else {
		tmp = (((b * b) * -12.0) * a) - 1.0;
	}
	return tmp;
}

Python

def code(a, b):
	tmp = 0
	if b <= 2.7e+144:
		tmp = ((a * a) * 4.0) - 1.0
	else:
		tmp = (((b * b) * -12.0) * a) - 1.0
	return tmp

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if b < 2.70000000000000015e144

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

   3. Taylor expanded in a around 0

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

      1. +-commutative N/A

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

      2. distribute-lft-in N/A

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

      3. associate-+r+ N/A

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

      4. associate-+r+ N/A

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

   5. Applied rewrites 77.0%

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

   6. Taylor expanded in b around 0

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

   8. Applied rewrites 46.8%

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

   9. Taylor expanded in a around 0

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

   11. Applied rewrites 53.0%

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

   if 2.70000000000000015e144 < b

   1. Initial program 65.2%

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

   3. Taylor expanded in a around 0

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

      1. associate-+r+ N/A

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

      2. +-commutative N/A

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

      3. metadata-eval N/A

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

      4. pow-sqr N/A

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

      5. associate-*r* N/A

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

      6. distribute-rgt-out N/A

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

      7. distribute-lft-out N/A

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

      8. lower-*.f64 N/A

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

      9. unpow2 N/A

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

      10. lower-*.f64 N/A

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

      11. unpow2 N/A

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

      12. lower-fma.f64 N/A

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

      13. lower-fma.f64 100.0

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

   5. Applied rewrites 100.0%

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

   6. Taylor expanded in a around inf

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

   8. Applied rewrites 57.2%

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

   10. Applied rewrites 57.2%

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

Alternative 9: 51.6% accurate, 6.4× speedup

Math

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

FPCore

(FPCore (a b)
 :precision binary64
 (if (<= b 2.7e+144) (- (* (* a a) 4.0) 1.0) (- (* (* -12.0 b) (* b a)) 1.0)))

C

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

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
    real(8) :: tmp
    if (b <= 2.7d+144) then
        tmp = ((a * a) * 4.0d0) - 1.0d0
    else
        tmp = (((-12.0d0) * b) * (b * a)) - 1.0d0
    end if
    code = tmp
end function

Java

public static double code(double a, double b) {
	double tmp;
	if (b <= 2.7e+144) {
		tmp = ((a * a) * 4.0) - 1.0;
	} else {
		tmp = ((-12.0 * b) * (b * a)) - 1.0;
	}
	return tmp;
}

Python

def code(a, b):
	tmp = 0
	if b <= 2.7e+144:
		tmp = ((a * a) * 4.0) - 1.0
	else:
		tmp = ((-12.0 * b) * (b * a)) - 1.0
	return tmp

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if b < 2.70000000000000015e144

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

   3. Taylor expanded in a around 0

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

      1. +-commutative N/A

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

      2. distribute-lft-in N/A

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

      3. associate-+r+ N/A

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

      4. associate-+r+ N/A

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

   5. Applied rewrites 77.0%

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

   6. Taylor expanded in b around 0

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

   8. Applied rewrites 46.8%

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

   9. Taylor expanded in a around 0

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

   11. Applied rewrites 53.0%

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

   if 2.70000000000000015e144 < b

   1. Initial program 65.2%

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

   3. Taylor expanded in a around 0

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

      1. associate-+r+ N/A

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

      2. +-commutative N/A

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

      3. metadata-eval N/A

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

      4. pow-sqr N/A

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

      5. associate-*r* N/A

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

      6. distribute-rgt-out N/A

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

      7. distribute-lft-out N/A

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

      8. lower-*.f64 N/A

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

      9. unpow2 N/A

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

      10. lower-*.f64 N/A

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

      11. unpow2 N/A

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

      12. lower-fma.f64 N/A

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

      13. lower-fma.f64 100.0

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

   5. Applied rewrites 100.0%

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

   6. Taylor expanded in a around inf

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

   8. Applied rewrites 57.2%

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

   10. Applied rewrites 40.9%

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

Alternative 10: 49.9% accurate, 11.4× speedup

Math

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

FPCore

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

C

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

Fortran

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) * 4.0d0) - 1.0d0
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

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

3. Taylor expanded in a around 0

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

   1. +-commutative N/A

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

   2. distribute-lft-in N/A

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

   3. associate-+r+ N/A

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

   4. associate-+r+ N/A

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

5. Applied rewrites 79.0%

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

6. Taylor expanded in b around 0

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

8. Applied rewrites 43.8%

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

9. Taylor expanded in a around 0

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

11. Applied rewrites 50.0%

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

Reproduce

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