Complex division, real part

Percentage Accurate: 61.9% → 89.4%

Time: 6.2s

Alternatives: 11

Speedup: 1.6×

Specification

Math

\[\begin{array}{l} \\ \frac{a \cdot c + b \cdot d}{c \cdot c + d \cdot d} \end{array} \]

FPCore

(FPCore (a b c d)
 :precision binary64
 (/ (+ (* a c) (* b d)) (+ (* c c) (* d d))))

C

double code(double a, double b, double c, double d) {
	return ((a * c) + (b * d)) / ((c * c) + (d * d));
}

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, c, d)
use fmin_fmax_functions
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8), intent (in) :: d
    code = ((a * c) + (b * d)) / ((c * c) + (d * d))
end function

Java

public static double code(double a, double b, double c, double d) {
	return ((a * c) + (b * d)) / ((c * c) + (d * d));
}

Python

def code(a, b, c, d):
	return ((a * c) + (b * d)) / ((c * c) + (d * d))

Julia

function code(a, b, c, d)
	return Float64(Float64(Float64(a * c) + Float64(b * d)) / Float64(Float64(c * c) + Float64(d * d)))
end

MATLAB

function tmp = code(a, b, c, d)
	tmp = ((a * c) + (b * d)) / ((c * c) + (d * d));
end

Wolfram

code[a_, b_, c_, d_] := N[(N[(N[(a * c), $MachinePrecision] + N[(b * d), $MachinePrecision]), $MachinePrecision] / N[(N[(c * c), $MachinePrecision] + N[(d * d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Initial Program: 61.9% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{a \cdot c + b \cdot d}{c \cdot c + d \cdot d} \end{array} \]

FPCore

(FPCore (a b c d)
 :precision binary64
 (/ (+ (* a c) (* b d)) (+ (* c c) (* d d))))

C

double code(double a, double b, double c, double d) {
	return ((a * c) + (b * d)) / ((c * c) + (d * d));
}

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, c, d)
use fmin_fmax_functions
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8), intent (in) :: d
    code = ((a * c) + (b * d)) / ((c * c) + (d * d))
end function

Java

public static double code(double a, double b, double c, double d) {
	return ((a * c) + (b * d)) / ((c * c) + (d * d));
}

Python

def code(a, b, c, d):
	return ((a * c) + (b * d)) / ((c * c) + (d * d))

Julia

function code(a, b, c, d)
	return Float64(Float64(Float64(a * c) + Float64(b * d)) / Float64(Float64(c * c) + Float64(d * d)))
end

MATLAB

function tmp = code(a, b, c, d)
	tmp = ((a * c) + (b * d)) / ((c * c) + (d * d));
end

Wolfram

code[a_, b_, c_, d_] := N[(N[(N[(a * c), $MachinePrecision] + N[(b * d), $MachinePrecision]), $MachinePrecision] / N[(N[(c * c), $MachinePrecision] + N[(d * d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Alternative 1: 89.4% accurate, 0.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;c \leq -1.35 \cdot 10^{+154}:\\ \;\;\;\;\frac{\mathsf{fma}\left(\frac{b}{c}, d, a\right)}{c}\\ \mathbf{elif}\;c \leq 5 \cdot 10^{+151}:\\ \;\;\;\;\mathsf{fma}\left(\frac{d}{\mathsf{hypot}\left(c, d\right)}, \frac{b}{\mathsf{hypot}\left(c, d\right)}, \frac{c}{\mathsf{fma}\left(c, c, d \cdot d\right)} \cdot a\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\frac{\frac{\mathsf{fma}\left(-a, \frac{d}{c}, b\right)}{c}}{c}, d, \frac{a}{c}\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c d)
 :precision binary64
 (if (<= c -1.35e+154)
   (/ (fma (/ b c) d a) c)
   (if (<= c 5e+151)
     (fma (/ d (hypot c d)) (/ b (hypot c d)) (* (/ c (fma c c (* d d))) a))
     (fma (/ (/ (fma (- a) (/ d c) b) c) c) d (/ a c)))))

C

double code(double a, double b, double c, double d) {
	double tmp;
	if (c <= -1.35e+154) {
		tmp = fma((b / c), d, a) / c;
	} else if (c <= 5e+151) {
		tmp = fma((d / hypot(c, d)), (b / hypot(c, d)), ((c / fma(c, c, (d * d))) * a));
	} else {
		tmp = fma(((fma(-a, (d / c), b) / c) / c), d, (a / c));
	}
	return tmp;
}

Julia

function code(a, b, c, d)
	tmp = 0.0
	if (c <= -1.35e+154)
		tmp = Float64(fma(Float64(b / c), d, a) / c);
	elseif (c <= 5e+151)
		tmp = fma(Float64(d / hypot(c, d)), Float64(b / hypot(c, d)), Float64(Float64(c / fma(c, c, Float64(d * d))) * a));
	else
		tmp = fma(Float64(Float64(fma(Float64(-a), Float64(d / c), b) / c) / c), d, Float64(a / c));
	end
	return tmp
end

Wolfram

code[a_, b_, c_, d_] := If[LessEqual[c, -1.35e+154], N[(N[(N[(b / c), $MachinePrecision] * d + a), $MachinePrecision] / c), $MachinePrecision], If[LessEqual[c, 5e+151], N[(N[(d / N[Sqrt[c ^ 2 + d ^ 2], $MachinePrecision]), $MachinePrecision] * N[(b / N[Sqrt[c ^ 2 + d ^ 2], $MachinePrecision]), $MachinePrecision] + N[(N[(c / N[(c * c + N[(d * d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * a), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[((-a) * N[(d / c), $MachinePrecision] + b), $MachinePrecision] / c), $MachinePrecision] / c), $MachinePrecision] * d + N[(a / c), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if c < -1.35000000000000003e154

   1. Initial program 22.9%

      \[\frac{a \cdot c + b \cdot d}{c \cdot c + d \cdot d} \]
   2. Add Preprocessing

   3. Taylor expanded in c around inf

      \[\leadsto \color{blue}{\frac{a + \frac{b \cdot d}{c}}{c}} \]
   4. Step-by-step derivation

      1. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{a + \frac{b \cdot d}{c}}{c}} \]

      2. *-lft-identity N/A

         \[\leadsto \frac{\color{blue}{1 \cdot \left(a + \frac{b \cdot d}{c}\right)}}{c} \]

      3. metadata-eval N/A

         \[\leadsto \frac{\color{blue}{\left(-1 \cdot -1\right)} \cdot \left(a + \frac{b \cdot d}{c}\right)}{c} \]

      4. associate-*r* N/A

         \[\leadsto \frac{\color{blue}{-1 \cdot \left(-1 \cdot \left(a + \frac{b \cdot d}{c}\right)\right)}}{c} \]

      5. distribute-lft-out N/A

         \[\leadsto \frac{-1 \cdot \color{blue}{\left(-1 \cdot a + -1 \cdot \frac{b \cdot d}{c}\right)}}{c} \]

      6. +-commutative N/A

         \[\leadsto \frac{-1 \cdot \color{blue}{\left(-1 \cdot \frac{b \cdot d}{c} + -1 \cdot a\right)}}{c} \]

      7. distribute-rgt-in N/A

         \[\leadsto \frac{\color{blue}{\left(-1 \cdot \frac{b \cdot d}{c}\right) \cdot -1 + \left(-1 \cdot a\right) \cdot -1}}{c} \]

      8. *-commutative N/A

         \[\leadsto \frac{\color{blue}{-1 \cdot \left(-1 \cdot \frac{b \cdot d}{c}\right)} + \left(-1 \cdot a\right) \cdot -1}{c} \]

      9. mul-1-neg N/A

         \[\leadsto \frac{\color{blue}{\left(\mathsf{neg}\left(-1 \cdot \frac{b \cdot d}{c}\right)\right)} + \left(-1 \cdot a\right) \cdot -1}{c} \]

      10. mul-1-neg N/A

          \[\leadsto \frac{\left(\mathsf{neg}\left(\color{blue}{\left(\mathsf{neg}\left(\frac{b \cdot d}{c}\right)\right)}\right)\right) + \left(-1 \cdot a\right) \cdot -1}{c} \]

      11. remove-double-neg N/A

          \[\leadsto \frac{\color{blue}{\frac{b \cdot d}{c}} + \left(-1 \cdot a\right) \cdot -1}{c} \]

      12. *-commutative N/A

          \[\leadsto \frac{\frac{\color{blue}{d \cdot b}}{c} + \left(-1 \cdot a\right) \cdot -1}{c} \]

      13. associate-/l* N/A

          \[\leadsto \frac{\color{blue}{d \cdot \frac{b}{c}} + \left(-1 \cdot a\right) \cdot -1}{c} \]

      14. *-commutative N/A

          \[\leadsto \frac{\color{blue}{\frac{b}{c} \cdot d} + \left(-1 \cdot a\right) \cdot -1}{c} \]

      15. *-commutative N/A

          \[\leadsto \frac{\frac{b}{c} \cdot d + \color{blue}{-1 \cdot \left(-1 \cdot a\right)}}{c} \]

      16. mul-1-neg N/A

          \[\leadsto \frac{\frac{b}{c} \cdot d + \color{blue}{\left(\mathsf{neg}\left(-1 \cdot a\right)\right)}}{c} \]

      17. mul-1-neg N/A

          \[\leadsto \frac{\frac{b}{c} \cdot d + \left(\mathsf{neg}\left(\color{blue}{\left(\mathsf{neg}\left(a\right)\right)}\right)\right)}{c} \]

      18. remove-double-neg N/A

          \[\leadsto \frac{\frac{b}{c} \cdot d + \color{blue}{a}}{c} \]

      19. lower-fma.f64 N/A

          \[\leadsto \frac{\color{blue}{\mathsf{fma}\left(\frac{b}{c}, d, a\right)}}{c} \]

      20. lower-/.f64 84.5

          \[\leadsto \frac{\mathsf{fma}\left(\color{blue}{\frac{b}{c}}, d, a\right)}{c} \]

   5. Applied rewrites 84.5%

      \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(\frac{b}{c}, d, a\right)}{c}} \]

   if -1.35000000000000003e154 < c < 5.0000000000000002e151

   1. Initial program 71.9%

      \[\frac{a \cdot c + b \cdot d}{c \cdot c + d \cdot d} \]
   2. Add Preprocessing

   4. Applied rewrites 71.9%

      \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(d, b, c \cdot a\right)}{\mathsf{fma}\left(d, d, c \cdot c\right)}} \]
   5. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(d, b, c \cdot a\right)}{\mathsf{fma}\left(d, d, c \cdot c\right)}} \]

      2. lift-fma.f64 N/A

         \[\leadsto \frac{\color{blue}{d \cdot b + c \cdot a}}{\mathsf{fma}\left(d, d, c \cdot c\right)} \]

      3. lift-*.f64 N/A

         \[\leadsto \frac{\color{blue}{d \cdot b} + c \cdot a}{\mathsf{fma}\left(d, d, c \cdot c\right)} \]

      4. div-add N/A

         \[\leadsto \color{blue}{\frac{d \cdot b}{\mathsf{fma}\left(d, d, c \cdot c\right)} + \frac{c \cdot a}{\mathsf{fma}\left(d, d, c \cdot c\right)}} \]

      5. lift-*.f64 N/A

         \[\leadsto \frac{\color{blue}{d \cdot b}}{\mathsf{fma}\left(d, d, c \cdot c\right)} + \frac{c \cdot a}{\mathsf{fma}\left(d, d, c \cdot c\right)} \]

      6. unpow1 N/A

         \[\leadsto \frac{d \cdot b}{\color{blue}{{\left(\mathsf{fma}\left(d, d, c \cdot c\right)\right)}^{1}}} + \frac{c \cdot a}{\mathsf{fma}\left(d, d, c \cdot c\right)} \]

      7. metadata-eval N/A

         \[\leadsto \frac{d \cdot b}{{\left(\mathsf{fma}\left(d, d, c \cdot c\right)\right)}^{\color{blue}{\left(\frac{2}{2}\right)}}} + \frac{c \cdot a}{\mathsf{fma}\left(d, d, c \cdot c\right)} \]

      8. sqr-pow N/A

         \[\leadsto \frac{d \cdot b}{\color{blue}{{\left(\mathsf{fma}\left(d, d, c \cdot c\right)\right)}^{\left(\frac{\frac{2}{2}}{2}\right)} \cdot {\left(\mathsf{fma}\left(d, d, c \cdot c\right)\right)}^{\left(\frac{\frac{2}{2}}{2}\right)}}} + \frac{c \cdot a}{\mathsf{fma}\left(d, d, c \cdot c\right)} \]

      9. times-frac N/A

         \[\leadsto \color{blue}{\frac{d}{{\left(\mathsf{fma}\left(d, d, c \cdot c\right)\right)}^{\left(\frac{\frac{2}{2}}{2}\right)}} \cdot \frac{b}{{\left(\mathsf{fma}\left(d, d, c \cdot c\right)\right)}^{\left(\frac{\frac{2}{2}}{2}\right)}}} + \frac{c \cdot a}{\mathsf{fma}\left(d, d, c \cdot c\right)} \]

      10. lower-fma.f64 N/A

          \[\leadsto \color{blue}{\mathsf{fma}\left(\frac{d}{{\left(\mathsf{fma}\left(d, d, c \cdot c\right)\right)}^{\left(\frac{\frac{2}{2}}{2}\right)}}, \frac{b}{{\left(\mathsf{fma}\left(d, d, c \cdot c\right)\right)}^{\left(\frac{\frac{2}{2}}{2}\right)}}, \frac{c \cdot a}{\mathsf{fma}\left(d, d, c \cdot c\right)}\right)} \]

   6. Applied rewrites 88.6%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\frac{d}{\mathsf{hypot}\left(c, d\right)}, \frac{b}{\mathsf{hypot}\left(c, d\right)}, \frac{a \cdot c}{{\left(\mathsf{hypot}\left(c, d\right)\right)}^{2}}\right)} \]

   7. Taylor expanded in a around 0

      \[\leadsto \mathsf{fma}\left(\frac{d}{\mathsf{hypot}\left(c, d\right)}, \frac{b}{\mathsf{hypot}\left(c, d\right)}, \color{blue}{\frac{a \cdot c}{{c}^{2} + {d}^{2}}}\right) \]
   8. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(\frac{d}{\mathsf{hypot}\left(c, d\right)}, \frac{b}{\mathsf{hypot}\left(c, d\right)}, \frac{\color{blue}{c \cdot a}}{{c}^{2} + {d}^{2}}\right) \]

      2. associate-*l/ N/A

         \[\leadsto \mathsf{fma}\left(\frac{d}{\mathsf{hypot}\left(c, d\right)}, \frac{b}{\mathsf{hypot}\left(c, d\right)}, \color{blue}{\frac{c}{{c}^{2} + {d}^{2}} \cdot a}\right) \]

      3. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(\frac{d}{\mathsf{hypot}\left(c, d\right)}, \frac{b}{\mathsf{hypot}\left(c, d\right)}, \color{blue}{\frac{c}{{c}^{2} + {d}^{2}} \cdot a}\right) \]

      4. lower-/.f64 N/A

         \[\leadsto \mathsf{fma}\left(\frac{d}{\mathsf{hypot}\left(c, d\right)}, \frac{b}{\mathsf{hypot}\left(c, d\right)}, \color{blue}{\frac{c}{{c}^{2} + {d}^{2}}} \cdot a\right) \]

      5. unpow2 N/A

         \[\leadsto \mathsf{fma}\left(\frac{d}{\mathsf{hypot}\left(c, d\right)}, \frac{b}{\mathsf{hypot}\left(c, d\right)}, \frac{c}{\color{blue}{c \cdot c} + {d}^{2}} \cdot a\right) \]

      6. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(\frac{d}{\mathsf{hypot}\left(c, d\right)}, \frac{b}{\mathsf{hypot}\left(c, d\right)}, \frac{c}{\color{blue}{\mathsf{fma}\left(c, c, {d}^{2}\right)}} \cdot a\right) \]

      7. unpow2 N/A

         \[\leadsto \mathsf{fma}\left(\frac{d}{\mathsf{hypot}\left(c, d\right)}, \frac{b}{\mathsf{hypot}\left(c, d\right)}, \frac{c}{\mathsf{fma}\left(c, c, \color{blue}{d \cdot d}\right)} \cdot a\right) \]

      8. lower-*.f64 91.7

         \[\leadsto \mathsf{fma}\left(\frac{d}{\mathsf{hypot}\left(c, d\right)}, \frac{b}{\mathsf{hypot}\left(c, d\right)}, \frac{c}{\mathsf{fma}\left(c, c, \color{blue}{d \cdot d}\right)} \cdot a\right) \]

   9. Applied rewrites 91.7%

      \[\leadsto \mathsf{fma}\left(\frac{d}{\mathsf{hypot}\left(c, d\right)}, \frac{b}{\mathsf{hypot}\left(c, d\right)}, \color{blue}{\frac{c}{\mathsf{fma}\left(c, c, d \cdot d\right)} \cdot a}\right) \]

   if 5.0000000000000002e151 < c

   1. Initial program 31.7%

      \[\frac{a \cdot c + b \cdot d}{c \cdot c + d \cdot d} \]
   2. Add Preprocessing

   3. Taylor expanded in c around inf

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

   5. Applied rewrites 93.4%

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

Alternative 2: 82.6% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \mathsf{fma}\left(d, d, c \cdot c\right)\\ \mathbf{if}\;c \leq -9.4 \cdot 10^{+85}:\\ \;\;\;\;\frac{\mathsf{fma}\left(\frac{b}{c}, d, a\right)}{c}\\ \mathbf{elif}\;c \leq -1.5 \cdot 10^{-115}:\\ \;\;\;\;\frac{\mathsf{fma}\left(d, b, c \cdot a\right)}{t\_0}\\ \mathbf{elif}\;c \leq 3 \cdot 10^{-53}:\\ \;\;\;\;\frac{\mathsf{fma}\left(\frac{a}{d}, c, b\right)}{d}\\ \mathbf{elif}\;c \leq 4.6 \cdot 10^{+151}:\\ \;\;\;\;\mathsf{fma}\left(a, \frac{c}{t\_0}, d \cdot \frac{b}{t\_0}\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\frac{\frac{\mathsf{fma}\left(-a, \frac{d}{c}, b\right)}{c}}{c}, d, \frac{a}{c}\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c d)
 :precision binary64
 (let* ((t_0 (fma d d (* c c))))
   (if (<= c -9.4e+85)
     (/ (fma (/ b c) d a) c)
     (if (<= c -1.5e-115)
       (/ (fma d b (* c a)) t_0)
       (if (<= c 3e-53)
         (/ (fma (/ a d) c b) d)
         (if (<= c 4.6e+151)
           (fma a (/ c t_0) (* d (/ b t_0)))
           (fma (/ (/ (fma (- a) (/ d c) b) c) c) d (/ a c))))))))

C

double code(double a, double b, double c, double d) {
	double t_0 = fma(d, d, (c * c));
	double tmp;
	if (c <= -9.4e+85) {
		tmp = fma((b / c), d, a) / c;
	} else if (c <= -1.5e-115) {
		tmp = fma(d, b, (c * a)) / t_0;
	} else if (c <= 3e-53) {
		tmp = fma((a / d), c, b) / d;
	} else if (c <= 4.6e+151) {
		tmp = fma(a, (c / t_0), (d * (b / t_0)));
	} else {
		tmp = fma(((fma(-a, (d / c), b) / c) / c), d, (a / c));
	}
	return tmp;
}

Julia

function code(a, b, c, d)
	t_0 = fma(d, d, Float64(c * c))
	tmp = 0.0
	if (c <= -9.4e+85)
		tmp = Float64(fma(Float64(b / c), d, a) / c);
	elseif (c <= -1.5e-115)
		tmp = Float64(fma(d, b, Float64(c * a)) / t_0);
	elseif (c <= 3e-53)
		tmp = Float64(fma(Float64(a / d), c, b) / d);
	elseif (c <= 4.6e+151)
		tmp = fma(a, Float64(c / t_0), Float64(d * Float64(b / t_0)));
	else
		tmp = fma(Float64(Float64(fma(Float64(-a), Float64(d / c), b) / c) / c), d, Float64(a / c));
	end
	return tmp
end

Wolfram

code[a_, b_, c_, d_] := Block[{t$95$0 = N[(d * d + N[(c * c), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[c, -9.4e+85], N[(N[(N[(b / c), $MachinePrecision] * d + a), $MachinePrecision] / c), $MachinePrecision], If[LessEqual[c, -1.5e-115], N[(N[(d * b + N[(c * a), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision], If[LessEqual[c, 3e-53], N[(N[(N[(a / d), $MachinePrecision] * c + b), $MachinePrecision] / d), $MachinePrecision], If[LessEqual[c, 4.6e+151], N[(a * N[(c / t$95$0), $MachinePrecision] + N[(d * N[(b / t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[((-a) * N[(d / c), $MachinePrecision] + b), $MachinePrecision] / c), $MachinePrecision] / c), $MachinePrecision] * d + N[(a / c), $MachinePrecision]), $MachinePrecision]]]]]]

Derivation

1. Split input into 5 regimes

2. if c < -9.4000000000000004e85

   1. Initial program 30.6%

      \[\frac{a \cdot c + b \cdot d}{c \cdot c + d \cdot d} \]
   2. Add Preprocessing

   3. Taylor expanded in c around inf

      \[\leadsto \color{blue}{\frac{a + \frac{b \cdot d}{c}}{c}} \]
   4. Step-by-step derivation

      1. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{a + \frac{b \cdot d}{c}}{c}} \]

      2. *-lft-identity N/A

         \[\leadsto \frac{\color{blue}{1 \cdot \left(a + \frac{b \cdot d}{c}\right)}}{c} \]

      3. metadata-eval N/A

         \[\leadsto \frac{\color{blue}{\left(-1 \cdot -1\right)} \cdot \left(a + \frac{b \cdot d}{c}\right)}{c} \]

      4. associate-*r* N/A

         \[\leadsto \frac{\color{blue}{-1 \cdot \left(-1 \cdot \left(a + \frac{b \cdot d}{c}\right)\right)}}{c} \]

      5. distribute-lft-out N/A

         \[\leadsto \frac{-1 \cdot \color{blue}{\left(-1 \cdot a + -1 \cdot \frac{b \cdot d}{c}\right)}}{c} \]

      6. +-commutative N/A

         \[\leadsto \frac{-1 \cdot \color{blue}{\left(-1 \cdot \frac{b \cdot d}{c} + -1 \cdot a\right)}}{c} \]

      7. distribute-rgt-in N/A

         \[\leadsto \frac{\color{blue}{\left(-1 \cdot \frac{b \cdot d}{c}\right) \cdot -1 + \left(-1 \cdot a\right) \cdot -1}}{c} \]

      8. *-commutative N/A

         \[\leadsto \frac{\color{blue}{-1 \cdot \left(-1 \cdot \frac{b \cdot d}{c}\right)} + \left(-1 \cdot a\right) \cdot -1}{c} \]

      9. mul-1-neg N/A

         \[\leadsto \frac{\color{blue}{\left(\mathsf{neg}\left(-1 \cdot \frac{b \cdot d}{c}\right)\right)} + \left(-1 \cdot a\right) \cdot -1}{c} \]

      10. mul-1-neg N/A

          \[\leadsto \frac{\left(\mathsf{neg}\left(\color{blue}{\left(\mathsf{neg}\left(\frac{b \cdot d}{c}\right)\right)}\right)\right) + \left(-1 \cdot a\right) \cdot -1}{c} \]

      11. remove-double-neg N/A

          \[\leadsto \frac{\color{blue}{\frac{b \cdot d}{c}} + \left(-1 \cdot a\right) \cdot -1}{c} \]

      12. *-commutative N/A

          \[\leadsto \frac{\frac{\color{blue}{d \cdot b}}{c} + \left(-1 \cdot a\right) \cdot -1}{c} \]

      13. associate-/l* N/A

          \[\leadsto \frac{\color{blue}{d \cdot \frac{b}{c}} + \left(-1 \cdot a\right) \cdot -1}{c} \]

      14. *-commutative N/A

          \[\leadsto \frac{\color{blue}{\frac{b}{c} \cdot d} + \left(-1 \cdot a\right) \cdot -1}{c} \]

      15. *-commutative N/A

          \[\leadsto \frac{\frac{b}{c} \cdot d + \color{blue}{-1 \cdot \left(-1 \cdot a\right)}}{c} \]

      16. mul-1-neg N/A

          \[\leadsto \frac{\frac{b}{c} \cdot d + \color{blue}{\left(\mathsf{neg}\left(-1 \cdot a\right)\right)}}{c} \]

      17. mul-1-neg N/A

          \[\leadsto \frac{\frac{b}{c} \cdot d + \left(\mathsf{neg}\left(\color{blue}{\left(\mathsf{neg}\left(a\right)\right)}\right)\right)}{c} \]

      18. remove-double-neg N/A

          \[\leadsto \frac{\frac{b}{c} \cdot d + \color{blue}{a}}{c} \]

      19. lower-fma.f64 N/A

          \[\leadsto \frac{\color{blue}{\mathsf{fma}\left(\frac{b}{c}, d, a\right)}}{c} \]

      20. lower-/.f64 81.4

          \[\leadsto \frac{\mathsf{fma}\left(\color{blue}{\frac{b}{c}}, d, a\right)}{c} \]

   5. Applied rewrites 81.4%

      \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(\frac{b}{c}, d, a\right)}{c}} \]

   if -9.4000000000000004e85 < c < -1.5000000000000001e-115

   1. Initial program 83.0%

      \[\frac{a \cdot c + b \cdot d}{c \cdot c + d \cdot d} \]
   2. Add Preprocessing

   4. Applied rewrites 83.0%

      \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(d, b, c \cdot a\right)}{\mathsf{fma}\left(d, d, c \cdot c\right)}} \]

   if -1.5000000000000001e-115 < c < 3.0000000000000002e-53

   1. Initial program 70.4%

      \[\frac{a \cdot c + b \cdot d}{c \cdot c + d \cdot d} \]
   2. Add Preprocessing

   3. Taylor expanded in c around 0

      \[\leadsto \color{blue}{\frac{b}{d} + \frac{a \cdot c}{{d}^{2}}} \]
   4. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto \color{blue}{\frac{a \cdot c}{{d}^{2}} + \frac{b}{d}} \]

      2. associate-*l/ N/A

         \[\leadsto \color{blue}{\frac{a}{{d}^{2}} \cdot c} + \frac{b}{d} \]

      3. associate-*l/ N/A

         \[\leadsto \color{blue}{\frac{a \cdot c}{{d}^{2}}} + \frac{b}{d} \]

      4. unpow2 N/A

         \[\leadsto \frac{a \cdot c}{\color{blue}{d \cdot d}} + \frac{b}{d} \]

      5. associate-/r* N/A

         \[\leadsto \color{blue}{\frac{\frac{a \cdot c}{d}}{d}} + \frac{b}{d} \]

      6. div-add N/A

         \[\leadsto \color{blue}{\frac{\frac{a \cdot c}{d} + b}{d}} \]

      7. +-commutative N/A

         \[\leadsto \frac{\color{blue}{b + \frac{a \cdot c}{d}}}{d} \]

      8. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{b + \frac{a \cdot c}{d}}{d}} \]

      9. +-commutative N/A

         \[\leadsto \frac{\color{blue}{\frac{a \cdot c}{d} + b}}{d} \]

      10. *-commutative N/A

          \[\leadsto \frac{\frac{\color{blue}{c \cdot a}}{d} + b}{d} \]

      11. associate-/l* N/A

          \[\leadsto \frac{\color{blue}{c \cdot \frac{a}{d}} + b}{d} \]

      12. *-commutative N/A

          \[\leadsto \frac{\color{blue}{\frac{a}{d} \cdot c} + b}{d} \]

      13. lower-fma.f64 N/A

          \[\leadsto \frac{\color{blue}{\mathsf{fma}\left(\frac{a}{d}, c, b\right)}}{d} \]

      14. lower-/.f64 93.0

          \[\leadsto \frac{\mathsf{fma}\left(\color{blue}{\frac{a}{d}}, c, b\right)}{d} \]

   5. Applied rewrites 93.0%

      \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(\frac{a}{d}, c, b\right)}{d}} \]

   if 3.0000000000000002e-53 < c < 4.6000000000000002e151

   1. Initial program 75.2%

      \[\frac{a \cdot c + b \cdot d}{c \cdot c + d \cdot d} \]
   2. Add Preprocessing

   4. Applied rewrites 85.5%

      \[\leadsto \color{blue}{\mathsf{fma}\left(a, \frac{c}{\mathsf{fma}\left(d, d, c \cdot c\right)}, d \cdot \frac{b}{\mathsf{fma}\left(d, d, c \cdot c\right)}\right)} \]

   if 4.6000000000000002e151 < c

   1. Initial program 31.7%

      \[\frac{a \cdot c + b \cdot d}{c \cdot c + d \cdot d} \]
   2. Add Preprocessing

   3. Taylor expanded in c around inf

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

   5. Applied rewrites 93.4%

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

Alternative 3: 83.0% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \mathsf{fma}\left(d, d, c \cdot c\right)\\ t_1 := \frac{\mathsf{fma}\left(\frac{b}{c}, d, a\right)}{c}\\ \mathbf{if}\;c \leq -9.4 \cdot 10^{+85}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;c \leq -1.5 \cdot 10^{-115}:\\ \;\;\;\;\frac{\mathsf{fma}\left(d, b, c \cdot a\right)}{t\_0}\\ \mathbf{elif}\;c \leq 3 \cdot 10^{-53}:\\ \;\;\;\;\frac{\mathsf{fma}\left(\frac{a}{d}, c, b\right)}{d}\\ \mathbf{elif}\;c \leq 4.7 \cdot 10^{+151}:\\ \;\;\;\;\mathsf{fma}\left(a, \frac{c}{t\_0}, d \cdot \frac{b}{t\_0}\right)\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c d)
 :precision binary64
 (let* ((t_0 (fma d d (* c c))) (t_1 (/ (fma (/ b c) d a) c)))
   (if (<= c -9.4e+85)
     t_1
     (if (<= c -1.5e-115)
       (/ (fma d b (* c a)) t_0)
       (if (<= c 3e-53)
         (/ (fma (/ a d) c b) d)
         (if (<= c 4.7e+151) (fma a (/ c t_0) (* d (/ b t_0))) t_1))))))

C

double code(double a, double b, double c, double d) {
	double t_0 = fma(d, d, (c * c));
	double t_1 = fma((b / c), d, a) / c;
	double tmp;
	if (c <= -9.4e+85) {
		tmp = t_1;
	} else if (c <= -1.5e-115) {
		tmp = fma(d, b, (c * a)) / t_0;
	} else if (c <= 3e-53) {
		tmp = fma((a / d), c, b) / d;
	} else if (c <= 4.7e+151) {
		tmp = fma(a, (c / t_0), (d * (b / t_0)));
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(a, b, c, d)
	t_0 = fma(d, d, Float64(c * c))
	t_1 = Float64(fma(Float64(b / c), d, a) / c)
	tmp = 0.0
	if (c <= -9.4e+85)
		tmp = t_1;
	elseif (c <= -1.5e-115)
		tmp = Float64(fma(d, b, Float64(c * a)) / t_0);
	elseif (c <= 3e-53)
		tmp = Float64(fma(Float64(a / d), c, b) / d);
	elseif (c <= 4.7e+151)
		tmp = fma(a, Float64(c / t_0), Float64(d * Float64(b / t_0)));
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

code[a_, b_, c_, d_] := Block[{t$95$0 = N[(d * d + N[(c * c), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(N[(b / c), $MachinePrecision] * d + a), $MachinePrecision] / c), $MachinePrecision]}, If[LessEqual[c, -9.4e+85], t$95$1, If[LessEqual[c, -1.5e-115], N[(N[(d * b + N[(c * a), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision], If[LessEqual[c, 3e-53], N[(N[(N[(a / d), $MachinePrecision] * c + b), $MachinePrecision] / d), $MachinePrecision], If[LessEqual[c, 4.7e+151], N[(a * N[(c / t$95$0), $MachinePrecision] + N[(d * N[(b / t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$1]]]]]]

Derivation

1. Split input into 4 regimes

2. if c < -9.4000000000000004e85 or 4.69999999999999989e151 < c

   1. Initial program 31.0%

      \[\frac{a \cdot c + b \cdot d}{c \cdot c + d \cdot d} \]
   2. Add Preprocessing

   3. Taylor expanded in c around inf

      \[\leadsto \color{blue}{\frac{a + \frac{b \cdot d}{c}}{c}} \]
   4. Step-by-step derivation

      1. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{a + \frac{b \cdot d}{c}}{c}} \]

      2. *-lft-identity N/A

         \[\leadsto \frac{\color{blue}{1 \cdot \left(a + \frac{b \cdot d}{c}\right)}}{c} \]

      3. metadata-eval N/A

         \[\leadsto \frac{\color{blue}{\left(-1 \cdot -1\right)} \cdot \left(a + \frac{b \cdot d}{c}\right)}{c} \]

      4. associate-*r* N/A

         \[\leadsto \frac{\color{blue}{-1 \cdot \left(-1 \cdot \left(a + \frac{b \cdot d}{c}\right)\right)}}{c} \]

      5. distribute-lft-out N/A

         \[\leadsto \frac{-1 \cdot \color{blue}{\left(-1 \cdot a + -1 \cdot \frac{b \cdot d}{c}\right)}}{c} \]

      6. +-commutative N/A

         \[\leadsto \frac{-1 \cdot \color{blue}{\left(-1 \cdot \frac{b \cdot d}{c} + -1 \cdot a\right)}}{c} \]

      7. distribute-rgt-in N/A

         \[\leadsto \frac{\color{blue}{\left(-1 \cdot \frac{b \cdot d}{c}\right) \cdot -1 + \left(-1 \cdot a\right) \cdot -1}}{c} \]

      8. *-commutative N/A

         \[\leadsto \frac{\color{blue}{-1 \cdot \left(-1 \cdot \frac{b \cdot d}{c}\right)} + \left(-1 \cdot a\right) \cdot -1}{c} \]

      9. mul-1-neg N/A

         \[\leadsto \frac{\color{blue}{\left(\mathsf{neg}\left(-1 \cdot \frac{b \cdot d}{c}\right)\right)} + \left(-1 \cdot a\right) \cdot -1}{c} \]

      10. mul-1-neg N/A

          \[\leadsto \frac{\left(\mathsf{neg}\left(\color{blue}{\left(\mathsf{neg}\left(\frac{b \cdot d}{c}\right)\right)}\right)\right) + \left(-1 \cdot a\right) \cdot -1}{c} \]

      11. remove-double-neg N/A

          \[\leadsto \frac{\color{blue}{\frac{b \cdot d}{c}} + \left(-1 \cdot a\right) \cdot -1}{c} \]

      12. *-commutative N/A

          \[\leadsto \frac{\frac{\color{blue}{d \cdot b}}{c} + \left(-1 \cdot a\right) \cdot -1}{c} \]

      13. associate-/l* N/A

          \[\leadsto \frac{\color{blue}{d \cdot \frac{b}{c}} + \left(-1 \cdot a\right) \cdot -1}{c} \]

      14. *-commutative N/A

          \[\leadsto \frac{\color{blue}{\frac{b}{c} \cdot d} + \left(-1 \cdot a\right) \cdot -1}{c} \]

      15. *-commutative N/A

          \[\leadsto \frac{\frac{b}{c} \cdot d + \color{blue}{-1 \cdot \left(-1 \cdot a\right)}}{c} \]

      16. mul-1-neg N/A

          \[\leadsto \frac{\frac{b}{c} \cdot d + \color{blue}{\left(\mathsf{neg}\left(-1 \cdot a\right)\right)}}{c} \]

      17. mul-1-neg N/A

          \[\leadsto \frac{\frac{b}{c} \cdot d + \left(\mathsf{neg}\left(\color{blue}{\left(\mathsf{neg}\left(a\right)\right)}\right)\right)}{c} \]

      18. remove-double-neg N/A

          \[\leadsto \frac{\frac{b}{c} \cdot d + \color{blue}{a}}{c} \]

      19. lower-fma.f64 N/A

          \[\leadsto \frac{\color{blue}{\mathsf{fma}\left(\frac{b}{c}, d, a\right)}}{c} \]

      20. lower-/.f64 84.2

          \[\leadsto \frac{\mathsf{fma}\left(\color{blue}{\frac{b}{c}}, d, a\right)}{c} \]

   5. Applied rewrites 84.2%

      \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(\frac{b}{c}, d, a\right)}{c}} \]

   if -9.4000000000000004e85 < c < -1.5000000000000001e-115

   1. Initial program 83.0%

      \[\frac{a \cdot c + b \cdot d}{c \cdot c + d \cdot d} \]
   2. Add Preprocessing

   4. Applied rewrites 83.0%

      \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(d, b, c \cdot a\right)}{\mathsf{fma}\left(d, d, c \cdot c\right)}} \]

   if -1.5000000000000001e-115 < c < 3.0000000000000002e-53

   1. Initial program 70.4%

      \[\frac{a \cdot c + b \cdot d}{c \cdot c + d \cdot d} \]
   2. Add Preprocessing

   3. Taylor expanded in c around 0

      \[\leadsto \color{blue}{\frac{b}{d} + \frac{a \cdot c}{{d}^{2}}} \]
   4. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto \color{blue}{\frac{a \cdot c}{{d}^{2}} + \frac{b}{d}} \]

      2. associate-*l/ N/A

         \[\leadsto \color{blue}{\frac{a}{{d}^{2}} \cdot c} + \frac{b}{d} \]

      3. associate-*l/ N/A

         \[\leadsto \color{blue}{\frac{a \cdot c}{{d}^{2}}} + \frac{b}{d} \]

      4. unpow2 N/A

         \[\leadsto \frac{a \cdot c}{\color{blue}{d \cdot d}} + \frac{b}{d} \]

      5. associate-/r* N/A

         \[\leadsto \color{blue}{\frac{\frac{a \cdot c}{d}}{d}} + \frac{b}{d} \]

      6. div-add N/A

         \[\leadsto \color{blue}{\frac{\frac{a \cdot c}{d} + b}{d}} \]

      7. +-commutative N/A

         \[\leadsto \frac{\color{blue}{b + \frac{a \cdot c}{d}}}{d} \]

      8. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{b + \frac{a \cdot c}{d}}{d}} \]

      9. +-commutative N/A

         \[\leadsto \frac{\color{blue}{\frac{a \cdot c}{d} + b}}{d} \]

      10. *-commutative N/A

          \[\leadsto \frac{\frac{\color{blue}{c \cdot a}}{d} + b}{d} \]

      11. associate-/l* N/A

          \[\leadsto \frac{\color{blue}{c \cdot \frac{a}{d}} + b}{d} \]

      12. *-commutative N/A

          \[\leadsto \frac{\color{blue}{\frac{a}{d} \cdot c} + b}{d} \]

      13. lower-fma.f64 N/A

          \[\leadsto \frac{\color{blue}{\mathsf{fma}\left(\frac{a}{d}, c, b\right)}}{d} \]

      14. lower-/.f64 93.0

          \[\leadsto \frac{\mathsf{fma}\left(\color{blue}{\frac{a}{d}}, c, b\right)}{d} \]

   5. Applied rewrites 93.0%

      \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(\frac{a}{d}, c, b\right)}{d}} \]

   if 3.0000000000000002e-53 < c < 4.69999999999999989e151

   1. Initial program 75.2%

      \[\frac{a \cdot c + b \cdot d}{c \cdot c + d \cdot d} \]
   2. Add Preprocessing

   4. Applied rewrites 85.5%

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

Alternative 4: 82.6% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{\mathsf{fma}\left(\frac{b}{c}, d, a\right)}{c}\\ \mathbf{if}\;c \leq -9.4 \cdot 10^{+85}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;c \leq -1.5 \cdot 10^{-115}:\\ \;\;\;\;\frac{\mathsf{fma}\left(d, b, c \cdot a\right)}{\mathsf{fma}\left(d, d, c \cdot c\right)}\\ \mathbf{elif}\;c \leq 8.5 \cdot 10^{-93}:\\ \;\;\;\;\frac{\mathsf{fma}\left(\frac{a}{d}, c, b\right)}{d}\\ \mathbf{elif}\;c \leq 1.3 \cdot 10^{+98}:\\ \;\;\;\;\frac{a \cdot c + b \cdot d}{c \cdot c + d \cdot d}\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c d)
 :precision binary64
 (let* ((t_0 (/ (fma (/ b c) d a) c)))
   (if (<= c -9.4e+85)
     t_0
     (if (<= c -1.5e-115)
       (/ (fma d b (* c a)) (fma d d (* c c)))
       (if (<= c 8.5e-93)
         (/ (fma (/ a d) c b) d)
         (if (<= c 1.3e+98)
           (/ (+ (* a c) (* b d)) (+ (* c c) (* d d)))
           t_0))))))

C

double code(double a, double b, double c, double d) {
	double t_0 = fma((b / c), d, a) / c;
	double tmp;
	if (c <= -9.4e+85) {
		tmp = t_0;
	} else if (c <= -1.5e-115) {
		tmp = fma(d, b, (c * a)) / fma(d, d, (c * c));
	} else if (c <= 8.5e-93) {
		tmp = fma((a / d), c, b) / d;
	} else if (c <= 1.3e+98) {
		tmp = ((a * c) + (b * d)) / ((c * c) + (d * d));
	} else {
		tmp = t_0;
	}
	return tmp;
}

Julia

function code(a, b, c, d)
	t_0 = Float64(fma(Float64(b / c), d, a) / c)
	tmp = 0.0
	if (c <= -9.4e+85)
		tmp = t_0;
	elseif (c <= -1.5e-115)
		tmp = Float64(fma(d, b, Float64(c * a)) / fma(d, d, Float64(c * c)));
	elseif (c <= 8.5e-93)
		tmp = Float64(fma(Float64(a / d), c, b) / d);
	elseif (c <= 1.3e+98)
		tmp = Float64(Float64(Float64(a * c) + Float64(b * d)) / Float64(Float64(c * c) + Float64(d * d)));
	else
		tmp = t_0;
	end
	return tmp
end

Wolfram

code[a_, b_, c_, d_] := Block[{t$95$0 = N[(N[(N[(b / c), $MachinePrecision] * d + a), $MachinePrecision] / c), $MachinePrecision]}, If[LessEqual[c, -9.4e+85], t$95$0, If[LessEqual[c, -1.5e-115], N[(N[(d * b + N[(c * a), $MachinePrecision]), $MachinePrecision] / N[(d * d + N[(c * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[c, 8.5e-93], N[(N[(N[(a / d), $MachinePrecision] * c + b), $MachinePrecision] / d), $MachinePrecision], If[LessEqual[c, 1.3e+98], N[(N[(N[(a * c), $MachinePrecision] + N[(b * d), $MachinePrecision]), $MachinePrecision] / N[(N[(c * c), $MachinePrecision] + N[(d * d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$0]]]]]

Derivation

1. Split input into 4 regimes

2. if c < -9.4000000000000004e85 or 1.3e98 < c

   1. Initial program 34.0%

      \[\frac{a \cdot c + b \cdot d}{c \cdot c + d \cdot d} \]
   2. Add Preprocessing

   3. Taylor expanded in c around inf

      \[\leadsto \color{blue}{\frac{a + \frac{b \cdot d}{c}}{c}} \]
   4. Step-by-step derivation

      1. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{a + \frac{b \cdot d}{c}}{c}} \]

      2. *-lft-identity N/A

         \[\leadsto \frac{\color{blue}{1 \cdot \left(a + \frac{b \cdot d}{c}\right)}}{c} \]

      3. metadata-eval N/A

         \[\leadsto \frac{\color{blue}{\left(-1 \cdot -1\right)} \cdot \left(a + \frac{b \cdot d}{c}\right)}{c} \]

      4. associate-*r* N/A

         \[\leadsto \frac{\color{blue}{-1 \cdot \left(-1 \cdot \left(a + \frac{b \cdot d}{c}\right)\right)}}{c} \]

      5. distribute-lft-out N/A

         \[\leadsto \frac{-1 \cdot \color{blue}{\left(-1 \cdot a + -1 \cdot \frac{b \cdot d}{c}\right)}}{c} \]

      6. +-commutative N/A

         \[\leadsto \frac{-1 \cdot \color{blue}{\left(-1 \cdot \frac{b \cdot d}{c} + -1 \cdot a\right)}}{c} \]

      7. distribute-rgt-in N/A

         \[\leadsto \frac{\color{blue}{\left(-1 \cdot \frac{b \cdot d}{c}\right) \cdot -1 + \left(-1 \cdot a\right) \cdot -1}}{c} \]

      8. *-commutative N/A

         \[\leadsto \frac{\color{blue}{-1 \cdot \left(-1 \cdot \frac{b \cdot d}{c}\right)} + \left(-1 \cdot a\right) \cdot -1}{c} \]

      9. mul-1-neg N/A

         \[\leadsto \frac{\color{blue}{\left(\mathsf{neg}\left(-1 \cdot \frac{b \cdot d}{c}\right)\right)} + \left(-1 \cdot a\right) \cdot -1}{c} \]

      10. mul-1-neg N/A

          \[\leadsto \frac{\left(\mathsf{neg}\left(\color{blue}{\left(\mathsf{neg}\left(\frac{b \cdot d}{c}\right)\right)}\right)\right) + \left(-1 \cdot a\right) \cdot -1}{c} \]

      11. remove-double-neg N/A

          \[\leadsto \frac{\color{blue}{\frac{b \cdot d}{c}} + \left(-1 \cdot a\right) \cdot -1}{c} \]

      12. *-commutative N/A

          \[\leadsto \frac{\frac{\color{blue}{d \cdot b}}{c} + \left(-1 \cdot a\right) \cdot -1}{c} \]

      13. associate-/l* N/A

          \[\leadsto \frac{\color{blue}{d \cdot \frac{b}{c}} + \left(-1 \cdot a\right) \cdot -1}{c} \]

      14. *-commutative N/A

          \[\leadsto \frac{\color{blue}{\frac{b}{c} \cdot d} + \left(-1 \cdot a\right) \cdot -1}{c} \]

      15. *-commutative N/A

          \[\leadsto \frac{\frac{b}{c} \cdot d + \color{blue}{-1 \cdot \left(-1 \cdot a\right)}}{c} \]

      16. mul-1-neg N/A

          \[\leadsto \frac{\frac{b}{c} \cdot d + \color{blue}{\left(\mathsf{neg}\left(-1 \cdot a\right)\right)}}{c} \]

      17. mul-1-neg N/A

          \[\leadsto \frac{\frac{b}{c} \cdot d + \left(\mathsf{neg}\left(\color{blue}{\left(\mathsf{neg}\left(a\right)\right)}\right)\right)}{c} \]

      18. remove-double-neg N/A

          \[\leadsto \frac{\frac{b}{c} \cdot d + \color{blue}{a}}{c} \]

      19. lower-fma.f64 N/A

          \[\leadsto \frac{\color{blue}{\mathsf{fma}\left(\frac{b}{c}, d, a\right)}}{c} \]

      20. lower-/.f64 82.5

          \[\leadsto \frac{\mathsf{fma}\left(\color{blue}{\frac{b}{c}}, d, a\right)}{c} \]

   5. Applied rewrites 82.5%

      \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(\frac{b}{c}, d, a\right)}{c}} \]

   if -9.4000000000000004e85 < c < -1.5000000000000001e-115

   1. Initial program 83.0%

      \[\frac{a \cdot c + b \cdot d}{c \cdot c + d \cdot d} \]
   2. Add Preprocessing

   4. Applied rewrites 83.0%

      \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(d, b, c \cdot a\right)}{\mathsf{fma}\left(d, d, c \cdot c\right)}} \]

   if -1.5000000000000001e-115 < c < 8.5000000000000007e-93

   1. Initial program 69.9%

      \[\frac{a \cdot c + b \cdot d}{c \cdot c + d \cdot d} \]
   2. Add Preprocessing

   3. Taylor expanded in c around 0

      \[\leadsto \color{blue}{\frac{b}{d} + \frac{a \cdot c}{{d}^{2}}} \]
   4. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto \color{blue}{\frac{a \cdot c}{{d}^{2}} + \frac{b}{d}} \]

      2. associate-*l/ N/A

         \[\leadsto \color{blue}{\frac{a}{{d}^{2}} \cdot c} + \frac{b}{d} \]

      3. associate-*l/ N/A

         \[\leadsto \color{blue}{\frac{a \cdot c}{{d}^{2}}} + \frac{b}{d} \]

      4. unpow2 N/A

         \[\leadsto \frac{a \cdot c}{\color{blue}{d \cdot d}} + \frac{b}{d} \]

      5. associate-/r* N/A

         \[\leadsto \color{blue}{\frac{\frac{a \cdot c}{d}}{d}} + \frac{b}{d} \]

      6. div-add N/A

         \[\leadsto \color{blue}{\frac{\frac{a \cdot c}{d} + b}{d}} \]

      7. +-commutative N/A

         \[\leadsto \frac{\color{blue}{b + \frac{a \cdot c}{d}}}{d} \]

      8. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{b + \frac{a \cdot c}{d}}{d}} \]

      9. +-commutative N/A

         \[\leadsto \frac{\color{blue}{\frac{a \cdot c}{d} + b}}{d} \]

      10. *-commutative N/A

          \[\leadsto \frac{\frac{\color{blue}{c \cdot a}}{d} + b}{d} \]

      11. associate-/l* N/A

          \[\leadsto \frac{\color{blue}{c \cdot \frac{a}{d}} + b}{d} \]

      12. *-commutative N/A

          \[\leadsto \frac{\color{blue}{\frac{a}{d} \cdot c} + b}{d} \]

      13. lower-fma.f64 N/A

          \[\leadsto \frac{\color{blue}{\mathsf{fma}\left(\frac{a}{d}, c, b\right)}}{d} \]

      14. lower-/.f64 93.5

          \[\leadsto \frac{\mathsf{fma}\left(\color{blue}{\frac{a}{d}}, c, b\right)}{d} \]

   5. Applied rewrites 93.5%

      \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(\frac{a}{d}, c, b\right)}{d}} \]

   if 8.5000000000000007e-93 < c < 1.3e98

   1. Initial program 85.0%

      \[\frac{a \cdot c + b \cdot d}{c \cdot c + d \cdot d} \]
   2. Add Preprocessing
3. Recombined 4 regimes into one program.
4. Add Preprocessing

Alternative 5: 82.6% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{\mathsf{fma}\left(d, b, c \cdot a\right)}{\mathsf{fma}\left(d, d, c \cdot c\right)}\\ t_1 := \frac{\mathsf{fma}\left(\frac{b}{c}, d, a\right)}{c}\\ \mathbf{if}\;c \leq -9.4 \cdot 10^{+85}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;c \leq -1.5 \cdot 10^{-115}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;c \leq 8.5 \cdot 10^{-93}:\\ \;\;\;\;\frac{\mathsf{fma}\left(\frac{a}{d}, c, b\right)}{d}\\ \mathbf{elif}\;c \leq 1.3 \cdot 10^{+98}:\\ \;\;\;\;t\_0\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c d)
 :precision binary64
 (let* ((t_0 (/ (fma d b (* c a)) (fma d d (* c c))))
        (t_1 (/ (fma (/ b c) d a) c)))
   (if (<= c -9.4e+85)
     t_1
     (if (<= c -1.5e-115)
       t_0
       (if (<= c 8.5e-93)
         (/ (fma (/ a d) c b) d)
         (if (<= c 1.3e+98) t_0 t_1))))))

C

double code(double a, double b, double c, double d) {
	double t_0 = fma(d, b, (c * a)) / fma(d, d, (c * c));
	double t_1 = fma((b / c), d, a) / c;
	double tmp;
	if (c <= -9.4e+85) {
		tmp = t_1;
	} else if (c <= -1.5e-115) {
		tmp = t_0;
	} else if (c <= 8.5e-93) {
		tmp = fma((a / d), c, b) / d;
	} else if (c <= 1.3e+98) {
		tmp = t_0;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(a, b, c, d)
	t_0 = Float64(fma(d, b, Float64(c * a)) / fma(d, d, Float64(c * c)))
	t_1 = Float64(fma(Float64(b / c), d, a) / c)
	tmp = 0.0
	if (c <= -9.4e+85)
		tmp = t_1;
	elseif (c <= -1.5e-115)
		tmp = t_0;
	elseif (c <= 8.5e-93)
		tmp = Float64(fma(Float64(a / d), c, b) / d);
	elseif (c <= 1.3e+98)
		tmp = t_0;
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

code[a_, b_, c_, d_] := Block[{t$95$0 = N[(N[(d * b + N[(c * a), $MachinePrecision]), $MachinePrecision] / N[(d * d + N[(c * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(N[(b / c), $MachinePrecision] * d + a), $MachinePrecision] / c), $MachinePrecision]}, If[LessEqual[c, -9.4e+85], t$95$1, If[LessEqual[c, -1.5e-115], t$95$0, If[LessEqual[c, 8.5e-93], N[(N[(N[(a / d), $MachinePrecision] * c + b), $MachinePrecision] / d), $MachinePrecision], If[LessEqual[c, 1.3e+98], t$95$0, t$95$1]]]]]]

Derivation

1. Split input into 3 regimes

2. if c < -9.4000000000000004e85 or 1.3e98 < c

   1. Initial program 34.0%

      \[\frac{a \cdot c + b \cdot d}{c \cdot c + d \cdot d} \]
   2. Add Preprocessing

   3. Taylor expanded in c around inf

      \[\leadsto \color{blue}{\frac{a + \frac{b \cdot d}{c}}{c}} \]
   4. Step-by-step derivation

      1. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{a + \frac{b \cdot d}{c}}{c}} \]

      2. *-lft-identity N/A

         \[\leadsto \frac{\color{blue}{1 \cdot \left(a + \frac{b \cdot d}{c}\right)}}{c} \]

      3. metadata-eval N/A

         \[\leadsto \frac{\color{blue}{\left(-1 \cdot -1\right)} \cdot \left(a + \frac{b \cdot d}{c}\right)}{c} \]

      4. associate-*r* N/A

         \[\leadsto \frac{\color{blue}{-1 \cdot \left(-1 \cdot \left(a + \frac{b \cdot d}{c}\right)\right)}}{c} \]

      5. distribute-lft-out N/A

         \[\leadsto \frac{-1 \cdot \color{blue}{\left(-1 \cdot a + -1 \cdot \frac{b \cdot d}{c}\right)}}{c} \]

      6. +-commutative N/A

         \[\leadsto \frac{-1 \cdot \color{blue}{\left(-1 \cdot \frac{b \cdot d}{c} + -1 \cdot a\right)}}{c} \]

      7. distribute-rgt-in N/A

         \[\leadsto \frac{\color{blue}{\left(-1 \cdot \frac{b \cdot d}{c}\right) \cdot -1 + \left(-1 \cdot a\right) \cdot -1}}{c} \]

      8. *-commutative N/A

         \[\leadsto \frac{\color{blue}{-1 \cdot \left(-1 \cdot \frac{b \cdot d}{c}\right)} + \left(-1 \cdot a\right) \cdot -1}{c} \]

      9. mul-1-neg N/A

         \[\leadsto \frac{\color{blue}{\left(\mathsf{neg}\left(-1 \cdot \frac{b \cdot d}{c}\right)\right)} + \left(-1 \cdot a\right) \cdot -1}{c} \]

      10. mul-1-neg N/A

          \[\leadsto \frac{\left(\mathsf{neg}\left(\color{blue}{\left(\mathsf{neg}\left(\frac{b \cdot d}{c}\right)\right)}\right)\right) + \left(-1 \cdot a\right) \cdot -1}{c} \]

      11. remove-double-neg N/A

          \[\leadsto \frac{\color{blue}{\frac{b \cdot d}{c}} + \left(-1 \cdot a\right) \cdot -1}{c} \]

      12. *-commutative N/A

          \[\leadsto \frac{\frac{\color{blue}{d \cdot b}}{c} + \left(-1 \cdot a\right) \cdot -1}{c} \]

      13. associate-/l* N/A

          \[\leadsto \frac{\color{blue}{d \cdot \frac{b}{c}} + \left(-1 \cdot a\right) \cdot -1}{c} \]

      14. *-commutative N/A

          \[\leadsto \frac{\color{blue}{\frac{b}{c} \cdot d} + \left(-1 \cdot a\right) \cdot -1}{c} \]

      15. *-commutative N/A

          \[\leadsto \frac{\frac{b}{c} \cdot d + \color{blue}{-1 \cdot \left(-1 \cdot a\right)}}{c} \]

      16. mul-1-neg N/A

          \[\leadsto \frac{\frac{b}{c} \cdot d + \color{blue}{\left(\mathsf{neg}\left(-1 \cdot a\right)\right)}}{c} \]

      17. mul-1-neg N/A

          \[\leadsto \frac{\frac{b}{c} \cdot d + \left(\mathsf{neg}\left(\color{blue}{\left(\mathsf{neg}\left(a\right)\right)}\right)\right)}{c} \]

      18. remove-double-neg N/A

          \[\leadsto \frac{\frac{b}{c} \cdot d + \color{blue}{a}}{c} \]

      19. lower-fma.f64 N/A

          \[\leadsto \frac{\color{blue}{\mathsf{fma}\left(\frac{b}{c}, d, a\right)}}{c} \]

      20. lower-/.f64 82.5

          \[\leadsto \frac{\mathsf{fma}\left(\color{blue}{\frac{b}{c}}, d, a\right)}{c} \]

   5. Applied rewrites 82.5%

      \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(\frac{b}{c}, d, a\right)}{c}} \]

   if -9.4000000000000004e85 < c < -1.5000000000000001e-115 or 8.5000000000000007e-93 < c < 1.3e98

   1. Initial program 84.2%

      \[\frac{a \cdot c + b \cdot d}{c \cdot c + d \cdot d} \]
   2. Add Preprocessing

   4. Applied rewrites 84.2%

      \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(d, b, c \cdot a\right)}{\mathsf{fma}\left(d, d, c \cdot c\right)}} \]

   if -1.5000000000000001e-115 < c < 8.5000000000000007e-93

   1. Initial program 69.9%

      \[\frac{a \cdot c + b \cdot d}{c \cdot c + d \cdot d} \]
   2. Add Preprocessing

   3. Taylor expanded in c around 0

      \[\leadsto \color{blue}{\frac{b}{d} + \frac{a \cdot c}{{d}^{2}}} \]
   4. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto \color{blue}{\frac{a \cdot c}{{d}^{2}} + \frac{b}{d}} \]

      2. associate-*l/ N/A

         \[\leadsto \color{blue}{\frac{a}{{d}^{2}} \cdot c} + \frac{b}{d} \]

      3. associate-*l/ N/A

         \[\leadsto \color{blue}{\frac{a \cdot c}{{d}^{2}}} + \frac{b}{d} \]

      4. unpow2 N/A

         \[\leadsto \frac{a \cdot c}{\color{blue}{d \cdot d}} + \frac{b}{d} \]

      5. associate-/r* N/A

         \[\leadsto \color{blue}{\frac{\frac{a \cdot c}{d}}{d}} + \frac{b}{d} \]

      6. div-add N/A

         \[\leadsto \color{blue}{\frac{\frac{a \cdot c}{d} + b}{d}} \]

      7. +-commutative N/A

         \[\leadsto \frac{\color{blue}{b + \frac{a \cdot c}{d}}}{d} \]

      8. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{b + \frac{a \cdot c}{d}}{d}} \]

      9. +-commutative N/A

         \[\leadsto \frac{\color{blue}{\frac{a \cdot c}{d} + b}}{d} \]

      10. *-commutative N/A

          \[\leadsto \frac{\frac{\color{blue}{c \cdot a}}{d} + b}{d} \]

      11. associate-/l* N/A

          \[\leadsto \frac{\color{blue}{c \cdot \frac{a}{d}} + b}{d} \]

      12. *-commutative N/A

          \[\leadsto \frac{\color{blue}{\frac{a}{d} \cdot c} + b}{d} \]

      13. lower-fma.f64 N/A

          \[\leadsto \frac{\color{blue}{\mathsf{fma}\left(\frac{a}{d}, c, b\right)}}{d} \]

      14. lower-/.f64 93.5

          \[\leadsto \frac{\mathsf{fma}\left(\color{blue}{\frac{a}{d}}, c, b\right)}{d} \]

   5. Applied rewrites 93.5%

      \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(\frac{a}{d}, c, b\right)}{d}} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 6: 64.8% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;c \leq -1.4 \cdot 10^{-88}:\\ \;\;\;\;\frac{a}{c}\\ \mathbf{elif}\;c \leq 3.4 \cdot 10^{-98}:\\ \;\;\;\;\frac{b}{d}\\ \mathbf{elif}\;c \leq 1.35 \cdot 10^{+153}:\\ \;\;\;\;\frac{c}{\mathsf{fma}\left(c, c, d \cdot d\right)} \cdot a\\ \mathbf{else}:\\ \;\;\;\;\frac{a}{c}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c d)
 :precision binary64
 (if (<= c -1.4e-88)
   (/ a c)
   (if (<= c 3.4e-98)
     (/ b d)
     (if (<= c 1.35e+153) (* (/ c (fma c c (* d d))) a) (/ a c)))))

C

double code(double a, double b, double c, double d) {
	double tmp;
	if (c <= -1.4e-88) {
		tmp = a / c;
	} else if (c <= 3.4e-98) {
		tmp = b / d;
	} else if (c <= 1.35e+153) {
		tmp = (c / fma(c, c, (d * d))) * a;
	} else {
		tmp = a / c;
	}
	return tmp;
}

Julia

function code(a, b, c, d)
	tmp = 0.0
	if (c <= -1.4e-88)
		tmp = Float64(a / c);
	elseif (c <= 3.4e-98)
		tmp = Float64(b / d);
	elseif (c <= 1.35e+153)
		tmp = Float64(Float64(c / fma(c, c, Float64(d * d))) * a);
	else
		tmp = Float64(a / c);
	end
	return tmp
end

Wolfram

code[a_, b_, c_, d_] := If[LessEqual[c, -1.4e-88], N[(a / c), $MachinePrecision], If[LessEqual[c, 3.4e-98], N[(b / d), $MachinePrecision], If[LessEqual[c, 1.35e+153], N[(N[(c / N[(c * c + N[(d * d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * a), $MachinePrecision], N[(a / c), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if c < -1.39999999999999988e-88 or 1.35e153 < c

   1. Initial program 41.4%

      \[\frac{a \cdot c + b \cdot d}{c \cdot c + d \cdot d} \]
   2. Add Preprocessing

   3. Taylor expanded in c around inf

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

      1. lower-/.f64 67.8

         \[\leadsto \color{blue}{\frac{a}{c}} \]

   5. Applied rewrites 67.8%

      \[\leadsto \color{blue}{\frac{a}{c}} \]

   if -1.39999999999999988e-88 < c < 3.4000000000000001e-98

   1. Initial program 70.0%

      \[\frac{a \cdot c + b \cdot d}{c \cdot c + d \cdot d} \]
   2. Add Preprocessing

   3. Taylor expanded in c around 0

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

      1. lower-/.f64 80.8

         \[\leadsto \color{blue}{\frac{b}{d}} \]

   5. Applied rewrites 80.8%

      \[\leadsto \color{blue}{\frac{b}{d}} \]

   if 3.4000000000000001e-98 < c < 1.35e153

   1. Initial program 75.9%

      \[\frac{a \cdot c + b \cdot d}{c \cdot c + d \cdot d} \]
   2. Add Preprocessing

   4. Applied rewrites 75.9%

      \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(d, b, c \cdot a\right)}{\mathsf{fma}\left(d, d, c \cdot c\right)}} \]

   5. Taylor expanded in a around inf

      \[\leadsto \color{blue}{\frac{a \cdot c}{{c}^{2} + {d}^{2}}} \]
   6. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \frac{\color{blue}{c \cdot a}}{{c}^{2} + {d}^{2}} \]

      2. associate-*l/ N/A

         \[\leadsto \color{blue}{\frac{c}{{c}^{2} + {d}^{2}} \cdot a} \]

      3. lower-*.f64 N/A

         \[\leadsto \color{blue}{\frac{c}{{c}^{2} + {d}^{2}} \cdot a} \]

      4. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{c}{{c}^{2} + {d}^{2}}} \cdot a \]

      5. unpow2 N/A

         \[\leadsto \frac{c}{\color{blue}{c \cdot c} + {d}^{2}} \cdot a \]

      6. lower-fma.f64 N/A

         \[\leadsto \frac{c}{\color{blue}{\mathsf{fma}\left(c, c, {d}^{2}\right)}} \cdot a \]

      7. unpow2 N/A

         \[\leadsto \frac{c}{\mathsf{fma}\left(c, c, \color{blue}{d \cdot d}\right)} \cdot a \]

      8. lower-*.f64 57.6

         \[\leadsto \frac{c}{\mathsf{fma}\left(c, c, \color{blue}{d \cdot d}\right)} \cdot a \]

   7. Applied rewrites 57.6%

      \[\leadsto \color{blue}{\frac{c}{\mathsf{fma}\left(c, c, d \cdot d\right)} \cdot a} \]
3. Recombined 3 regimes into one program.

4. Final simplification 70.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;c \leq -1.4 \cdot 10^{-88}:\\ \;\;\;\;\frac{a}{c}\\ \mathbf{elif}\;c \leq 3.4 \cdot 10^{-98}:\\ \;\;\;\;\frac{b}{d}\\ \mathbf{elif}\;c \leq 1.35 \cdot 10^{+153}:\\ \;\;\;\;\frac{c}{\mathsf{fma}\left(c, c, d \cdot d\right)} \cdot a\\ \mathbf{else}:\\ \;\;\;\;\frac{a}{c}\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 63.5% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;c \leq -1.4 \cdot 10^{-88}:\\ \;\;\;\;\frac{a}{c}\\ \mathbf{elif}\;c \leq 3.4 \cdot 10^{-98}:\\ \;\;\;\;\frac{b}{d}\\ \mathbf{elif}\;c \leq 4.6 \cdot 10^{+165}:\\ \;\;\;\;\frac{a}{\mathsf{fma}\left(d, d, c \cdot c\right)} \cdot c\\ \mathbf{else}:\\ \;\;\;\;\frac{a}{c}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c d)
 :precision binary64
 (if (<= c -1.4e-88)
   (/ a c)
   (if (<= c 3.4e-98)
     (/ b d)
     (if (<= c 4.6e+165) (* (/ a (fma d d (* c c))) c) (/ a c)))))

C

double code(double a, double b, double c, double d) {
	double tmp;
	if (c <= -1.4e-88) {
		tmp = a / c;
	} else if (c <= 3.4e-98) {
		tmp = b / d;
	} else if (c <= 4.6e+165) {
		tmp = (a / fma(d, d, (c * c))) * c;
	} else {
		tmp = a / c;
	}
	return tmp;
}

Julia

function code(a, b, c, d)
	tmp = 0.0
	if (c <= -1.4e-88)
		tmp = Float64(a / c);
	elseif (c <= 3.4e-98)
		tmp = Float64(b / d);
	elseif (c <= 4.6e+165)
		tmp = Float64(Float64(a / fma(d, d, Float64(c * c))) * c);
	else
		tmp = Float64(a / c);
	end
	return tmp
end

Wolfram

code[a_, b_, c_, d_] := If[LessEqual[c, -1.4e-88], N[(a / c), $MachinePrecision], If[LessEqual[c, 3.4e-98], N[(b / d), $MachinePrecision], If[LessEqual[c, 4.6e+165], N[(N[(a / N[(d * d + N[(c * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * c), $MachinePrecision], N[(a / c), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if c < -1.39999999999999988e-88 or 4.60000000000000032e165 < c

   1. Initial program 41.8%

      \[\frac{a \cdot c + b \cdot d}{c \cdot c + d \cdot d} \]
   2. Add Preprocessing

   3. Taylor expanded in c around inf

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

      1. lower-/.f64 68.5

         \[\leadsto \color{blue}{\frac{a}{c}} \]

   5. Applied rewrites 68.5%

      \[\leadsto \color{blue}{\frac{a}{c}} \]

   if -1.39999999999999988e-88 < c < 3.4000000000000001e-98

   1. Initial program 70.0%

      \[\frac{a \cdot c + b \cdot d}{c \cdot c + d \cdot d} \]
   2. Add Preprocessing

   3. Taylor expanded in c around 0

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

      1. lower-/.f64 80.8

         \[\leadsto \color{blue}{\frac{b}{d}} \]

   5. Applied rewrites 80.8%

      \[\leadsto \color{blue}{\frac{b}{d}} \]

   if 3.4000000000000001e-98 < c < 4.60000000000000032e165

   1. Initial program 74.6%

      \[\frac{a \cdot c + b \cdot d}{c \cdot c + d \cdot d} \]
   2. Add Preprocessing

   3. Taylor expanded in a around inf

      \[\leadsto \color{blue}{\frac{a \cdot c}{{c}^{2} + {d}^{2}}} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \frac{\color{blue}{c \cdot a}}{{c}^{2} + {d}^{2}} \]

      2. associate-/l* N/A

         \[\leadsto \color{blue}{c \cdot \frac{a}{{c}^{2} + {d}^{2}}} \]

      3. *-commutative N/A

         \[\leadsto \color{blue}{\frac{a}{{c}^{2} + {d}^{2}} \cdot c} \]

      4. lower-*.f64 N/A

         \[\leadsto \color{blue}{\frac{a}{{c}^{2} + {d}^{2}} \cdot c} \]

      5. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{a}{{c}^{2} + {d}^{2}}} \cdot c \]

      6. +-commutative N/A

         \[\leadsto \frac{a}{\color{blue}{{d}^{2} + {c}^{2}}} \cdot c \]

      7. unpow2 N/A

         \[\leadsto \frac{a}{\color{blue}{d \cdot d} + {c}^{2}} \cdot c \]

      8. lower-fma.f64 N/A

         \[\leadsto \frac{a}{\color{blue}{\mathsf{fma}\left(d, d, {c}^{2}\right)}} \cdot c \]

      9. unpow2 N/A

         \[\leadsto \frac{a}{\mathsf{fma}\left(d, d, \color{blue}{c \cdot c}\right)} \cdot c \]

      10. lower-*.f64 50.3

          \[\leadsto \frac{a}{\mathsf{fma}\left(d, d, \color{blue}{c \cdot c}\right)} \cdot c \]

   5. Applied rewrites 50.3%

      \[\leadsto \color{blue}{\frac{a}{\mathsf{fma}\left(d, d, c \cdot c\right)} \cdot c} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 8: 76.7% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;c \leq -6.8 \cdot 10^{-16} \lor \neg \left(c \leq 1.75 \cdot 10^{+89}\right):\\ \;\;\;\;\frac{\mathsf{fma}\left(\frac{b}{c}, d, a\right)}{c}\\ \mathbf{else}:\\ \;\;\;\;\frac{\mathsf{fma}\left(\frac{a}{d}, c, b\right)}{d}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c d)
 :precision binary64
 (if (or (<= c -6.8e-16) (not (<= c 1.75e+89)))
   (/ (fma (/ b c) d a) c)
   (/ (fma (/ a d) c b) d)))

C

double code(double a, double b, double c, double d) {
	double tmp;
	if ((c <= -6.8e-16) || !(c <= 1.75e+89)) {
		tmp = fma((b / c), d, a) / c;
	} else {
		tmp = fma((a / d), c, b) / d;
	}
	return tmp;
}

Julia

function code(a, b, c, d)
	tmp = 0.0
	if ((c <= -6.8e-16) || !(c <= 1.75e+89))
		tmp = Float64(fma(Float64(b / c), d, a) / c);
	else
		tmp = Float64(fma(Float64(a / d), c, b) / d);
	end
	return tmp
end

Wolfram

code[a_, b_, c_, d_] := If[Or[LessEqual[c, -6.8e-16], N[Not[LessEqual[c, 1.75e+89]], $MachinePrecision]], N[(N[(N[(b / c), $MachinePrecision] * d + a), $MachinePrecision] / c), $MachinePrecision], N[(N[(N[(a / d), $MachinePrecision] * c + b), $MachinePrecision] / d), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if c < -6.8e-16 or 1.75e89 < c

   1. Initial program 37.9%

      \[\frac{a \cdot c + b \cdot d}{c \cdot c + d \cdot d} \]
   2. Add Preprocessing

   3. Taylor expanded in c around inf

      \[\leadsto \color{blue}{\frac{a + \frac{b \cdot d}{c}}{c}} \]
   4. Step-by-step derivation

      1. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{a + \frac{b \cdot d}{c}}{c}} \]

      2. *-lft-identity N/A

         \[\leadsto \frac{\color{blue}{1 \cdot \left(a + \frac{b \cdot d}{c}\right)}}{c} \]

      3. metadata-eval N/A

         \[\leadsto \frac{\color{blue}{\left(-1 \cdot -1\right)} \cdot \left(a + \frac{b \cdot d}{c}\right)}{c} \]

      4. associate-*r* N/A

         \[\leadsto \frac{\color{blue}{-1 \cdot \left(-1 \cdot \left(a + \frac{b \cdot d}{c}\right)\right)}}{c} \]

      5. distribute-lft-out N/A

         \[\leadsto \frac{-1 \cdot \color{blue}{\left(-1 \cdot a + -1 \cdot \frac{b \cdot d}{c}\right)}}{c} \]

      6. +-commutative N/A

         \[\leadsto \frac{-1 \cdot \color{blue}{\left(-1 \cdot \frac{b \cdot d}{c} + -1 \cdot a\right)}}{c} \]

      7. distribute-rgt-in N/A

         \[\leadsto \frac{\color{blue}{\left(-1 \cdot \frac{b \cdot d}{c}\right) \cdot -1 + \left(-1 \cdot a\right) \cdot -1}}{c} \]

      8. *-commutative N/A

         \[\leadsto \frac{\color{blue}{-1 \cdot \left(-1 \cdot \frac{b \cdot d}{c}\right)} + \left(-1 \cdot a\right) \cdot -1}{c} \]

      9. mul-1-neg N/A

         \[\leadsto \frac{\color{blue}{\left(\mathsf{neg}\left(-1 \cdot \frac{b \cdot d}{c}\right)\right)} + \left(-1 \cdot a\right) \cdot -1}{c} \]

      10. mul-1-neg N/A

          \[\leadsto \frac{\left(\mathsf{neg}\left(\color{blue}{\left(\mathsf{neg}\left(\frac{b \cdot d}{c}\right)\right)}\right)\right) + \left(-1 \cdot a\right) \cdot -1}{c} \]

      11. remove-double-neg N/A

          \[\leadsto \frac{\color{blue}{\frac{b \cdot d}{c}} + \left(-1 \cdot a\right) \cdot -1}{c} \]

      12. *-commutative N/A

          \[\leadsto \frac{\frac{\color{blue}{d \cdot b}}{c} + \left(-1 \cdot a\right) \cdot -1}{c} \]

      13. associate-/l* N/A

          \[\leadsto \frac{\color{blue}{d \cdot \frac{b}{c}} + \left(-1 \cdot a\right) \cdot -1}{c} \]

      14. *-commutative N/A

          \[\leadsto \frac{\color{blue}{\frac{b}{c} \cdot d} + \left(-1 \cdot a\right) \cdot -1}{c} \]

      15. *-commutative N/A

          \[\leadsto \frac{\frac{b}{c} \cdot d + \color{blue}{-1 \cdot \left(-1 \cdot a\right)}}{c} \]

      16. mul-1-neg N/A

          \[\leadsto \frac{\frac{b}{c} \cdot d + \color{blue}{\left(\mathsf{neg}\left(-1 \cdot a\right)\right)}}{c} \]

      17. mul-1-neg N/A

          \[\leadsto \frac{\frac{b}{c} \cdot d + \left(\mathsf{neg}\left(\color{blue}{\left(\mathsf{neg}\left(a\right)\right)}\right)\right)}{c} \]

      18. remove-double-neg N/A

          \[\leadsto \frac{\frac{b}{c} \cdot d + \color{blue}{a}}{c} \]

      19. lower-fma.f64 N/A

          \[\leadsto \frac{\color{blue}{\mathsf{fma}\left(\frac{b}{c}, d, a\right)}}{c} \]

      20. lower-/.f64 80.9

          \[\leadsto \frac{\mathsf{fma}\left(\color{blue}{\frac{b}{c}}, d, a\right)}{c} \]

   5. Applied rewrites 80.9%

      \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(\frac{b}{c}, d, a\right)}{c}} \]

   if -6.8e-16 < c < 1.75e89

   1. Initial program 75.2%

      \[\frac{a \cdot c + b \cdot d}{c \cdot c + d \cdot d} \]
   2. Add Preprocessing

   3. Taylor expanded in c around 0

      \[\leadsto \color{blue}{\frac{b}{d} + \frac{a \cdot c}{{d}^{2}}} \]
   4. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto \color{blue}{\frac{a \cdot c}{{d}^{2}} + \frac{b}{d}} \]

      2. associate-*l/ N/A

         \[\leadsto \color{blue}{\frac{a}{{d}^{2}} \cdot c} + \frac{b}{d} \]

      3. associate-*l/ N/A

         \[\leadsto \color{blue}{\frac{a \cdot c}{{d}^{2}}} + \frac{b}{d} \]

      4. unpow2 N/A

         \[\leadsto \frac{a \cdot c}{\color{blue}{d \cdot d}} + \frac{b}{d} \]

      5. associate-/r* N/A

         \[\leadsto \color{blue}{\frac{\frac{a \cdot c}{d}}{d}} + \frac{b}{d} \]

      6. div-add N/A

         \[\leadsto \color{blue}{\frac{\frac{a \cdot c}{d} + b}{d}} \]

      7. +-commutative N/A

         \[\leadsto \frac{\color{blue}{b + \frac{a \cdot c}{d}}}{d} \]

      8. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{b + \frac{a \cdot c}{d}}{d}} \]

      9. +-commutative N/A

         \[\leadsto \frac{\color{blue}{\frac{a \cdot c}{d} + b}}{d} \]

      10. *-commutative N/A

          \[\leadsto \frac{\frac{\color{blue}{c \cdot a}}{d} + b}{d} \]

      11. associate-/l* N/A

          \[\leadsto \frac{\color{blue}{c \cdot \frac{a}{d}} + b}{d} \]

      12. *-commutative N/A

          \[\leadsto \frac{\color{blue}{\frac{a}{d} \cdot c} + b}{d} \]

      13. lower-fma.f64 N/A

          \[\leadsto \frac{\color{blue}{\mathsf{fma}\left(\frac{a}{d}, c, b\right)}}{d} \]

      14. lower-/.f64 81.7

          \[\leadsto \frac{\mathsf{fma}\left(\color{blue}{\frac{a}{d}}, c, b\right)}{d} \]

   5. Applied rewrites 81.7%

      \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(\frac{a}{d}, c, b\right)}{d}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 81.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;c \leq -6.8 \cdot 10^{-16} \lor \neg \left(c \leq 1.75 \cdot 10^{+89}\right):\\ \;\;\;\;\frac{\mathsf{fma}\left(\frac{b}{c}, d, a\right)}{c}\\ \mathbf{else}:\\ \;\;\;\;\frac{\mathsf{fma}\left(\frac{a}{d}, c, b\right)}{d}\\ \end{array} \]
5. Add Preprocessing

Alternative 9: 72.0% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;c \leq -1.8 \cdot 10^{-7} \lor \neg \left(c \leq 2 \cdot 10^{+92}\right):\\ \;\;\;\;\frac{a}{c}\\ \mathbf{else}:\\ \;\;\;\;\frac{\mathsf{fma}\left(\frac{a}{d}, c, b\right)}{d}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c d)
 :precision binary64
 (if (or (<= c -1.8e-7) (not (<= c 2e+92))) (/ a c) (/ (fma (/ a d) c b) d)))

C

double code(double a, double b, double c, double d) {
	double tmp;
	if ((c <= -1.8e-7) || !(c <= 2e+92)) {
		tmp = a / c;
	} else {
		tmp = fma((a / d), c, b) / d;
	}
	return tmp;
}

Julia

function code(a, b, c, d)
	tmp = 0.0
	if ((c <= -1.8e-7) || !(c <= 2e+92))
		tmp = Float64(a / c);
	else
		tmp = Float64(fma(Float64(a / d), c, b) / d);
	end
	return tmp
end

Wolfram

code[a_, b_, c_, d_] := If[Or[LessEqual[c, -1.8e-7], N[Not[LessEqual[c, 2e+92]], $MachinePrecision]], N[(a / c), $MachinePrecision], N[(N[(N[(a / d), $MachinePrecision] * c + b), $MachinePrecision] / d), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if c < -1.79999999999999997e-7 or 2.0000000000000001e92 < c

   1. Initial program 37.9%

      \[\frac{a \cdot c + b \cdot d}{c \cdot c + d \cdot d} \]
   2. Add Preprocessing

   3. Taylor expanded in c around inf

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

      1. lower-/.f64 67.1

         \[\leadsto \color{blue}{\frac{a}{c}} \]

   5. Applied rewrites 67.1%

      \[\leadsto \color{blue}{\frac{a}{c}} \]

   if -1.79999999999999997e-7 < c < 2.0000000000000001e92

   1. Initial program 75.2%

      \[\frac{a \cdot c + b \cdot d}{c \cdot c + d \cdot d} \]
   2. Add Preprocessing

   3. Taylor expanded in c around 0

      \[\leadsto \color{blue}{\frac{b}{d} + \frac{a \cdot c}{{d}^{2}}} \]
   4. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto \color{blue}{\frac{a \cdot c}{{d}^{2}} + \frac{b}{d}} \]

      2. associate-*l/ N/A

         \[\leadsto \color{blue}{\frac{a}{{d}^{2}} \cdot c} + \frac{b}{d} \]

      3. associate-*l/ N/A

         \[\leadsto \color{blue}{\frac{a \cdot c}{{d}^{2}}} + \frac{b}{d} \]

      4. unpow2 N/A

         \[\leadsto \frac{a \cdot c}{\color{blue}{d \cdot d}} + \frac{b}{d} \]

      5. associate-/r* N/A

         \[\leadsto \color{blue}{\frac{\frac{a \cdot c}{d}}{d}} + \frac{b}{d} \]

      6. div-add N/A

         \[\leadsto \color{blue}{\frac{\frac{a \cdot c}{d} + b}{d}} \]

      7. +-commutative N/A

         \[\leadsto \frac{\color{blue}{b + \frac{a \cdot c}{d}}}{d} \]

      8. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{b + \frac{a \cdot c}{d}}{d}} \]

      9. +-commutative N/A

         \[\leadsto \frac{\color{blue}{\frac{a \cdot c}{d} + b}}{d} \]

      10. *-commutative N/A

          \[\leadsto \frac{\frac{\color{blue}{c \cdot a}}{d} + b}{d} \]

      11. associate-/l* N/A

          \[\leadsto \frac{\color{blue}{c \cdot \frac{a}{d}} + b}{d} \]

      12. *-commutative N/A

          \[\leadsto \frac{\color{blue}{\frac{a}{d} \cdot c} + b}{d} \]

      13. lower-fma.f64 N/A

          \[\leadsto \frac{\color{blue}{\mathsf{fma}\left(\frac{a}{d}, c, b\right)}}{d} \]

      14. lower-/.f64 81.7

          \[\leadsto \frac{\mathsf{fma}\left(\color{blue}{\frac{a}{d}}, c, b\right)}{d} \]

   5. Applied rewrites 81.7%

      \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(\frac{a}{d}, c, b\right)}{d}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 75.9%

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

Alternative 10: 62.6% accurate, 1.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;c \leq -1.4 \cdot 10^{-88} \lor \neg \left(c \leq 4.2 \cdot 10^{+91}\right):\\ \;\;\;\;\frac{a}{c}\\ \mathbf{else}:\\ \;\;\;\;\frac{b}{d}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c d)
 :precision binary64
 (if (or (<= c -1.4e-88) (not (<= c 4.2e+91))) (/ a c) (/ b d)))

C

double code(double a, double b, double c, double d) {
	double tmp;
	if ((c <= -1.4e-88) || !(c <= 4.2e+91)) {
		tmp = a / c;
	} else {
		tmp = b / d;
	}
	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, c, d)
use fmin_fmax_functions
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8), intent (in) :: d
    real(8) :: tmp
    if ((c <= (-1.4d-88)) .or. (.not. (c <= 4.2d+91))) then
        tmp = a / c
    else
        tmp = b / d
    end if
    code = tmp
end function

Java

public static double code(double a, double b, double c, double d) {
	double tmp;
	if ((c <= -1.4e-88) || !(c <= 4.2e+91)) {
		tmp = a / c;
	} else {
		tmp = b / d;
	}
	return tmp;
}

Python

def code(a, b, c, d):
	tmp = 0
	if (c <= -1.4e-88) or not (c <= 4.2e+91):
		tmp = a / c
	else:
		tmp = b / d
	return tmp

Julia

function code(a, b, c, d)
	tmp = 0.0
	if ((c <= -1.4e-88) || !(c <= 4.2e+91))
		tmp = Float64(a / c);
	else
		tmp = Float64(b / d);
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c, d)
	tmp = 0.0;
	if ((c <= -1.4e-88) || ~((c <= 4.2e+91)))
		tmp = a / c;
	else
		tmp = b / d;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_, d_] := If[Or[LessEqual[c, -1.4e-88], N[Not[LessEqual[c, 4.2e+91]], $MachinePrecision]], N[(a / c), $MachinePrecision], N[(b / d), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if c < -1.39999999999999988e-88 or 4.20000000000000015e91 < c

   1. Initial program 42.3%

      \[\frac{a \cdot c + b \cdot d}{c \cdot c + d \cdot d} \]
   2. Add Preprocessing

   3. Taylor expanded in c around inf

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

      1. lower-/.f64 64.5

         \[\leadsto \color{blue}{\frac{a}{c}} \]

   5. Applied rewrites 64.5%

      \[\leadsto \color{blue}{\frac{a}{c}} \]

   if -1.39999999999999988e-88 < c < 4.20000000000000015e91

   1. Initial program 74.6%

      \[\frac{a \cdot c + b \cdot d}{c \cdot c + d \cdot d} \]
   2. Add Preprocessing

   3. Taylor expanded in c around 0

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

      1. lower-/.f64 68.4

         \[\leadsto \color{blue}{\frac{b}{d}} \]

   5. Applied rewrites 68.4%

      \[\leadsto \color{blue}{\frac{b}{d}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 66.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;c \leq -1.4 \cdot 10^{-88} \lor \neg \left(c \leq 4.2 \cdot 10^{+91}\right):\\ \;\;\;\;\frac{a}{c}\\ \mathbf{else}:\\ \;\;\;\;\frac{b}{d}\\ \end{array} \]
5. Add Preprocessing

Alternative 11: 43.1% accurate, 3.2× speedup

Math

\[\begin{array}{l} \\ \frac{a}{c} \end{array} \]

FPCore

(FPCore (a b c d) :precision binary64 (/ a c))

C

double code(double a, double b, double c, double d) {
	return a / c;
}

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, c, d)
use fmin_fmax_functions
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8), intent (in) :: d
    code = a / c
end function

Java

public static double code(double a, double b, double c, double d) {
	return a / c;
}

Python

def code(a, b, c, d):
	return a / c

Julia

function code(a, b, c, d)
	return Float64(a / c)
end

MATLAB

function tmp = code(a, b, c, d)
	tmp = a / c;
end

Wolfram

code[a_, b_, c_, d_] := N[(a / c), $MachinePrecision]

Derivation

1. Initial program 60.3%

   \[\frac{a \cdot c + b \cdot d}{c \cdot c + d \cdot d} \]
2. Add Preprocessing

3. Taylor expanded in c around inf

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

   1. lower-/.f64 39.2

      \[\leadsto \color{blue}{\frac{a}{c}} \]

5. Applied rewrites 39.2%

   \[\leadsto \color{blue}{\frac{a}{c}} \]
6. Add Preprocessing

Developer Target 1: 99.4% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\left|d\right| < \left|c\right|:\\ \;\;\;\;\frac{a + b \cdot \frac{d}{c}}{c + d \cdot \frac{d}{c}}\\ \mathbf{else}:\\ \;\;\;\;\frac{b + a \cdot \frac{c}{d}}{d + c \cdot \frac{c}{d}}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c d)
 :precision binary64
 (if (< (fabs d) (fabs c))
   (/ (+ a (* b (/ d c))) (+ c (* d (/ d c))))
   (/ (+ b (* a (/ c d))) (+ d (* c (/ c d))))))

C

double code(double a, double b, double c, double d) {
	double tmp;
	if (fabs(d) < fabs(c)) {
		tmp = (a + (b * (d / c))) / (c + (d * (d / c)));
	} else {
		tmp = (b + (a * (c / d))) / (d + (c * (c / d)));
	}
	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, c, d)
use fmin_fmax_functions
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8), intent (in) :: d
    real(8) :: tmp
    if (abs(d) < abs(c)) then
        tmp = (a + (b * (d / c))) / (c + (d * (d / c)))
    else
        tmp = (b + (a * (c / d))) / (d + (c * (c / d)))
    end if
    code = tmp
end function

Java

public static double code(double a, double b, double c, double d) {
	double tmp;
	if (Math.abs(d) < Math.abs(c)) {
		tmp = (a + (b * (d / c))) / (c + (d * (d / c)));
	} else {
		tmp = (b + (a * (c / d))) / (d + (c * (c / d)));
	}
	return tmp;
}

Python

def code(a, b, c, d):
	tmp = 0
	if math.fabs(d) < math.fabs(c):
		tmp = (a + (b * (d / c))) / (c + (d * (d / c)))
	else:
		tmp = (b + (a * (c / d))) / (d + (c * (c / d)))
	return tmp

Julia

function code(a, b, c, d)
	tmp = 0.0
	if (abs(d) < abs(c))
		tmp = Float64(Float64(a + Float64(b * Float64(d / c))) / Float64(c + Float64(d * Float64(d / c))));
	else
		tmp = Float64(Float64(b + Float64(a * Float64(c / d))) / Float64(d + Float64(c * Float64(c / d))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c, d)
	tmp = 0.0;
	if (abs(d) < abs(c))
		tmp = (a + (b * (d / c))) / (c + (d * (d / c)));
	else
		tmp = (b + (a * (c / d))) / (d + (c * (c / d)));
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_, d_] := If[Less[N[Abs[d], $MachinePrecision], N[Abs[c], $MachinePrecision]], N[(N[(a + N[(b * N[(d / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(c + N[(d * N[(d / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(b + N[(a * N[(c / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(d + N[(c * N[(c / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Reproduce

herbie shell --seed 2024364 
(FPCore (a b c d)
  :name "Complex division, real part"
  :precision binary64

  :alt
  (! :herbie-platform default (if (< (fabs d) (fabs c)) (/ (+ a (* b (/ d c))) (+ c (* d (/ d c)))) (/ (+ b (* a (/ c d))) (+ d (* c (/ c d))))))

  (/ (+ (* a c) (* b d)) (+ (* c c) (* d d))))