Complex division, imag part

Percentage Accurate: 61.3% → 82.7%

Time: 5.1s

Alternatives: 11

Speedup: 1.5×

Specification

Math

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

FPCore

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

C

double code(double a, double b, double c, double d) {
	return ((b * c) - (a * 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 = ((b * c) - (a * d)) / ((c * c) + (d * d))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 61.3% accurate, 1.0× speedup

Math

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

FPCore

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

C

double code(double a, double b, double c, double d) {
	return ((b * c) - (a * 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 = ((b * c) - (a * d)) / ((c * c) + (d * d))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 82.7% accurate, 0.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \mathsf{fma}\left(\mathsf{fma}\left(\frac{a}{{c}^{4}} \cdot d - \frac{b}{{c}^{3}}, d, \frac{\frac{-a}{c}}{c}\right), d, \frac{b}{c}\right)\\ t_1 := \mathsf{fma}\left(d, d, c \cdot c\right)\\ \mathbf{if}\;c \leq -1.9 \cdot 10^{+144}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;c \leq -1.1 \cdot 10^{-113}:\\ \;\;\;\;\mathsf{fma}\left(\frac{c}{t\_1}, b, \left(-d\right) \cdot \frac{a}{t\_1}\right)\\ \mathbf{elif}\;c \leq 4.1 \cdot 10^{-134}:\\ \;\;\;\;\frac{\frac{b \cdot c}{d} - a}{d}\\ \mathbf{elif}\;c \leq 1.38 \cdot 10^{+48}:\\ \;\;\;\;\frac{b \cdot c - a \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
          (fma
           (- (* (/ a (pow c 4.0)) d) (/ b (pow c 3.0)))
           d
           (/ (/ (- a) c) c))
          d
          (/ b c)))
        (t_1 (fma d d (* c c))))
   (if (<= c -1.9e+144)
     t_0
     (if (<= c -1.1e-113)
       (fma (/ c t_1) b (* (- d) (/ a t_1)))
       (if (<= c 4.1e-134)
         (/ (- (/ (* b c) d) a) d)
         (if (<= c 1.38e+48)
           (/ (- (* b c) (* a d)) (+ (* c c) (* d d)))
           t_0))))))

C

double code(double a, double b, double c, double d) {
	double t_0 = fma(fma((((a / pow(c, 4.0)) * d) - (b / pow(c, 3.0))), d, ((-a / c) / c)), d, (b / c));
	double t_1 = fma(d, d, (c * c));
	double tmp;
	if (c <= -1.9e+144) {
		tmp = t_0;
	} else if (c <= -1.1e-113) {
		tmp = fma((c / t_1), b, (-d * (a / t_1)));
	} else if (c <= 4.1e-134) {
		tmp = (((b * c) / d) - a) / d;
	} else if (c <= 1.38e+48) {
		tmp = ((b * c) - (a * d)) / ((c * c) + (d * d));
	} else {
		tmp = t_0;
	}
	return tmp;
}

Julia

function code(a, b, c, d)
	t_0 = fma(fma(Float64(Float64(Float64(a / (c ^ 4.0)) * d) - Float64(b / (c ^ 3.0))), d, Float64(Float64(Float64(-a) / c) / c)), d, Float64(b / c))
	t_1 = fma(d, d, Float64(c * c))
	tmp = 0.0
	if (c <= -1.9e+144)
		tmp = t_0;
	elseif (c <= -1.1e-113)
		tmp = fma(Float64(c / t_1), b, Float64(Float64(-d) * Float64(a / t_1)));
	elseif (c <= 4.1e-134)
		tmp = Float64(Float64(Float64(Float64(b * c) / d) - a) / d);
	elseif (c <= 1.38e+48)
		tmp = Float64(Float64(Float64(b * c) - Float64(a * 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[(N[(N[(a / N[Power[c, 4.0], $MachinePrecision]), $MachinePrecision] * d), $MachinePrecision] - N[(b / N[Power[c, 3.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * d + N[(N[((-a) / c), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision] * d + N[(b / c), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(d * d + N[(c * c), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[c, -1.9e+144], t$95$0, If[LessEqual[c, -1.1e-113], N[(N[(c / t$95$1), $MachinePrecision] * b + N[((-d) * N[(a / t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[c, 4.1e-134], N[(N[(N[(N[(b * c), $MachinePrecision] / d), $MachinePrecision] - a), $MachinePrecision] / d), $MachinePrecision], If[LessEqual[c, 1.38e+48], N[(N[(N[(b * c), $MachinePrecision] - N[(a * 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 < -1.90000000000000013e144 or 1.3800000000000001e48 < c

   1. Initial program 32.1%

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

   3. Taylor expanded in d around 0

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

   5. Applied rewrites 87.4%

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

   if -1.90000000000000013e144 < c < -1.10000000000000002e-113

   1. Initial program 79.2%

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

   4. Applied rewrites 82.9%

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

   if -1.10000000000000002e-113 < c < 4.1000000000000002e-134

   1. Initial program 78.9%

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

   3. Taylor expanded in c around 0

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

      1. +-commutative N/A

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

      2. fp-cancel-sign-sub-inv N/A

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

      3. unpow2 N/A

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

      4. associate-/r* N/A

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

      5. metadata-eval N/A

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

      6. *-lft-identity N/A

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

      7. div-sub N/A

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

      8. lower-/.f64 N/A

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

      9. lower--.f64 N/A

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

      10. lower-/.f64 N/A

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

      11. lower-*.f64 98.6

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

   5. Applied rewrites 98.6%

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

   if 4.1000000000000002e-134 < c < 1.3800000000000001e48

   1. Initial program 93.3%

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

Alternative 2: 81.0% 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 -1.35 \cdot 10^{+154}:\\ \;\;\;\;\frac{\left(\frac{b}{d} - \frac{a}{c}\right) \cdot d}{c}\\ \mathbf{elif}\;c \leq -1.1 \cdot 10^{-113}:\\ \;\;\;\;\mathsf{fma}\left(\frac{c}{t\_0}, b, \left(-d\right) \cdot \frac{a}{t\_0}\right)\\ \mathbf{elif}\;c \leq 4.1 \cdot 10^{-134}:\\ \;\;\;\;\frac{\frac{b \cdot c}{d} - a}{d}\\ \mathbf{elif}\;c \leq 10^{+112}:\\ \;\;\;\;\frac{b \cdot c - a \cdot d}{c \cdot c + d \cdot d}\\ \mathbf{else}:\\ \;\;\;\;\frac{b - \frac{a \cdot d}{c}}{c}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c d)
 :precision binary64
 (let* ((t_0 (fma d d (* c c))))
   (if (<= c -1.35e+154)
     (/ (* (- (/ b d) (/ a c)) d) c)
     (if (<= c -1.1e-113)
       (fma (/ c t_0) b (* (- d) (/ a t_0)))
       (if (<= c 4.1e-134)
         (/ (- (/ (* b c) d) a) d)
         (if (<= c 1e+112)
           (/ (- (* b c) (* a d)) (+ (* c c) (* d d)))
           (/ (- b (/ (* a d) c)) c)))))))

C

double code(double a, double b, double c, double d) {
	double t_0 = fma(d, d, (c * c));
	double tmp;
	if (c <= -1.35e+154) {
		tmp = (((b / d) - (a / c)) * d) / c;
	} else if (c <= -1.1e-113) {
		tmp = fma((c / t_0), b, (-d * (a / t_0)));
	} else if (c <= 4.1e-134) {
		tmp = (((b * c) / d) - a) / d;
	} else if (c <= 1e+112) {
		tmp = ((b * c) - (a * d)) / ((c * c) + (d * d));
	} else {
		tmp = (b - ((a * d) / c)) / c;
	}
	return tmp;
}

Julia

function code(a, b, c, d)
	t_0 = fma(d, d, Float64(c * c))
	tmp = 0.0
	if (c <= -1.35e+154)
		tmp = Float64(Float64(Float64(Float64(b / d) - Float64(a / c)) * d) / c);
	elseif (c <= -1.1e-113)
		tmp = fma(Float64(c / t_0), b, Float64(Float64(-d) * Float64(a / t_0)));
	elseif (c <= 4.1e-134)
		tmp = Float64(Float64(Float64(Float64(b * c) / d) - a) / d);
	elseif (c <= 1e+112)
		tmp = Float64(Float64(Float64(b * c) - Float64(a * d)) / Float64(Float64(c * c) + Float64(d * d)));
	else
		tmp = Float64(Float64(b - Float64(Float64(a * d) / c)) / 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, -1.35e+154], N[(N[(N[(N[(b / d), $MachinePrecision] - N[(a / c), $MachinePrecision]), $MachinePrecision] * d), $MachinePrecision] / c), $MachinePrecision], If[LessEqual[c, -1.1e-113], N[(N[(c / t$95$0), $MachinePrecision] * b + N[((-d) * N[(a / t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[c, 4.1e-134], N[(N[(N[(N[(b * c), $MachinePrecision] / d), $MachinePrecision] - a), $MachinePrecision] / d), $MachinePrecision], If[LessEqual[c, 1e+112], N[(N[(N[(b * c), $MachinePrecision] - N[(a * d), $MachinePrecision]), $MachinePrecision] / N[(N[(c * c), $MachinePrecision] + N[(d * d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(b - N[(N[(a * d), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision]]]]]]

Derivation

1. Split input into 5 regimes

2. if c < -1.35000000000000003e154

   1. Initial program 28.1%

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

   3. Taylor expanded in c around inf

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

      1. lower-/.f64 N/A

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

      2. fp-cancel-sign-sub-inv N/A

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

      3. metadata-eval N/A

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

      4. *-lft-identity N/A

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

      5. lower--.f64 N/A

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

      6. lower-/.f64 N/A

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

      7. lower-*.f64 74.7

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

   5. Applied rewrites 74.7%

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

   6. Taylor expanded in d around inf

      \[\leadsto \frac{d \cdot \left(\frac{b}{d} - \frac{a}{c}\right)}{c} \]
   7. Step-by-step derivation

   8. Applied rewrites 85.2%

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

   if -1.35000000000000003e154 < c < -1.10000000000000002e-113

   1. Initial program 79.9%

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

   4. Applied rewrites 83.5%

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

   if -1.10000000000000002e-113 < c < 4.1000000000000002e-134

   1. Initial program 78.9%

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

   3. Taylor expanded in c around 0

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

      1. +-commutative N/A

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

      2. fp-cancel-sign-sub-inv N/A

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

      3. unpow2 N/A

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

      4. associate-/r* N/A

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

      5. metadata-eval N/A

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

      6. *-lft-identity N/A

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

      7. div-sub N/A

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

      8. lower-/.f64 N/A

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

      9. lower--.f64 N/A

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

      10. lower-/.f64 N/A

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

      11. lower-*.f64 98.6

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

   5. Applied rewrites 98.6%

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

   if 4.1000000000000002e-134 < c < 9.9999999999999993e111

   1. Initial program 93.2%

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

   if 9.9999999999999993e111 < c

   1. Initial program 13.1%

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

   3. Taylor expanded in c around inf

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

      1. lower-/.f64 N/A

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

      2. fp-cancel-sign-sub-inv N/A

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

      3. metadata-eval N/A

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

      4. *-lft-identity N/A

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

      5. lower--.f64 N/A

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

      6. lower-/.f64 N/A

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

      7. lower-*.f64 82.5

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

   5. Applied rewrites 82.5%

      \[\leadsto \color{blue}{\frac{b - \frac{a \cdot d}{c}}{c}} \]
3. Recombined 5 regimes into one program.
4. Add Preprocessing

Alternative 3: 79.8% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{b \cdot c - a \cdot d}{c \cdot c + d \cdot d}\\ \mathbf{if}\;c \leq -2.25 \cdot 10^{+118}:\\ \;\;\;\;\frac{\left(\frac{b}{d} - \frac{a}{c}\right) \cdot d}{c}\\ \mathbf{elif}\;c \leq -1.2 \cdot 10^{-67}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;c \leq 4.1 \cdot 10^{-134}:\\ \;\;\;\;\frac{\frac{b \cdot c}{d} - a}{d}\\ \mathbf{elif}\;c \leq 10^{+112}:\\ \;\;\;\;t\_0\\ \mathbf{else}:\\ \;\;\;\;\frac{b - \frac{a \cdot d}{c}}{c}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c d)
 :precision binary64
 (let* ((t_0 (/ (- (* b c) (* a d)) (+ (* c c) (* d d)))))
   (if (<= c -2.25e+118)
     (/ (* (- (/ b d) (/ a c)) d) c)
     (if (<= c -1.2e-67)
       t_0
       (if (<= c 4.1e-134)
         (/ (- (/ (* b c) d) a) d)
         (if (<= c 1e+112) t_0 (/ (- b (/ (* a d) c)) c)))))))

C

double code(double a, double b, double c, double d) {
	double t_0 = ((b * c) - (a * d)) / ((c * c) + (d * d));
	double tmp;
	if (c <= -2.25e+118) {
		tmp = (((b / d) - (a / c)) * d) / c;
	} else if (c <= -1.2e-67) {
		tmp = t_0;
	} else if (c <= 4.1e-134) {
		tmp = (((b * c) / d) - a) / d;
	} else if (c <= 1e+112) {
		tmp = t_0;
	} else {
		tmp = (b - ((a * d) / c)) / c;
	}
	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) :: t_0
    real(8) :: tmp
    t_0 = ((b * c) - (a * d)) / ((c * c) + (d * d))
    if (c <= (-2.25d+118)) then
        tmp = (((b / d) - (a / c)) * d) / c
    else if (c <= (-1.2d-67)) then
        tmp = t_0
    else if (c <= 4.1d-134) then
        tmp = (((b * c) / d) - a) / d
    else if (c <= 1d+112) then
        tmp = t_0
    else
        tmp = (b - ((a * d) / c)) / c
    end if
    code = tmp
end function

Java

public static double code(double a, double b, double c, double d) {
	double t_0 = ((b * c) - (a * d)) / ((c * c) + (d * d));
	double tmp;
	if (c <= -2.25e+118) {
		tmp = (((b / d) - (a / c)) * d) / c;
	} else if (c <= -1.2e-67) {
		tmp = t_0;
	} else if (c <= 4.1e-134) {
		tmp = (((b * c) / d) - a) / d;
	} else if (c <= 1e+112) {
		tmp = t_0;
	} else {
		tmp = (b - ((a * d) / c)) / c;
	}
	return tmp;
}

Python

def code(a, b, c, d):
	t_0 = ((b * c) - (a * d)) / ((c * c) + (d * d))
	tmp = 0
	if c <= -2.25e+118:
		tmp = (((b / d) - (a / c)) * d) / c
	elif c <= -1.2e-67:
		tmp = t_0
	elif c <= 4.1e-134:
		tmp = (((b * c) / d) - a) / d
	elif c <= 1e+112:
		tmp = t_0
	else:
		tmp = (b - ((a * d) / c)) / c
	return tmp

Julia

function code(a, b, c, d)
	t_0 = Float64(Float64(Float64(b * c) - Float64(a * d)) / Float64(Float64(c * c) + Float64(d * d)))
	tmp = 0.0
	if (c <= -2.25e+118)
		tmp = Float64(Float64(Float64(Float64(b / d) - Float64(a / c)) * d) / c);
	elseif (c <= -1.2e-67)
		tmp = t_0;
	elseif (c <= 4.1e-134)
		tmp = Float64(Float64(Float64(Float64(b * c) / d) - a) / d);
	elseif (c <= 1e+112)
		tmp = t_0;
	else
		tmp = Float64(Float64(b - Float64(Float64(a * d) / c)) / c);
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c, d)
	t_0 = ((b * c) - (a * d)) / ((c * c) + (d * d));
	tmp = 0.0;
	if (c <= -2.25e+118)
		tmp = (((b / d) - (a / c)) * d) / c;
	elseif (c <= -1.2e-67)
		tmp = t_0;
	elseif (c <= 4.1e-134)
		tmp = (((b * c) / d) - a) / d;
	elseif (c <= 1e+112)
		tmp = t_0;
	else
		tmp = (b - ((a * d) / c)) / c;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_, d_] := Block[{t$95$0 = N[(N[(N[(b * c), $MachinePrecision] - N[(a * d), $MachinePrecision]), $MachinePrecision] / N[(N[(c * c), $MachinePrecision] + N[(d * d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[c, -2.25e+118], N[(N[(N[(N[(b / d), $MachinePrecision] - N[(a / c), $MachinePrecision]), $MachinePrecision] * d), $MachinePrecision] / c), $MachinePrecision], If[LessEqual[c, -1.2e-67], t$95$0, If[LessEqual[c, 4.1e-134], N[(N[(N[(N[(b * c), $MachinePrecision] / d), $MachinePrecision] - a), $MachinePrecision] / d), $MachinePrecision], If[LessEqual[c, 1e+112], t$95$0, N[(N[(b - N[(N[(a * d), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision]]]]]]

Derivation

1. Split input into 4 regimes

2. if c < -2.25000000000000001e118

   1. Initial program 35.7%

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

   3. Taylor expanded in c around inf

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

      1. lower-/.f64 N/A

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

      2. fp-cancel-sign-sub-inv N/A

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

      3. metadata-eval N/A

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

      4. *-lft-identity N/A

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

      5. lower--.f64 N/A

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

      6. lower-/.f64 N/A

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

      7. lower-*.f64 76.0

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

   5. Applied rewrites 76.0%

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

   6. Taylor expanded in d around inf

      \[\leadsto \frac{d \cdot \left(\frac{b}{d} - \frac{a}{c}\right)}{c} \]
   7. Step-by-step derivation

   8. Applied rewrites 85.2%

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

   if -2.25000000000000001e118 < c < -1.2e-67 or 4.1000000000000002e-134 < c < 9.9999999999999993e111

   1. Initial program 86.4%

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

   if -1.2e-67 < c < 4.1000000000000002e-134

   1. Initial program 79.3%

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

   3. Taylor expanded in c around 0

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

      1. +-commutative N/A

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

      2. fp-cancel-sign-sub-inv N/A

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

      3. unpow2 N/A

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

      4. associate-/r* N/A

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

      5. metadata-eval N/A

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

      6. *-lft-identity N/A

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

      7. div-sub N/A

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

      8. lower-/.f64 N/A

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

      9. lower--.f64 N/A

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

      10. lower-/.f64 N/A

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

      11. lower-*.f64 97.6

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

   5. Applied rewrites 97.6%

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

   if 9.9999999999999993e111 < c

   1. Initial program 13.1%

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

   3. Taylor expanded in c around inf

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

      1. lower-/.f64 N/A

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

      2. fp-cancel-sign-sub-inv N/A

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

      3. metadata-eval N/A

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

      4. *-lft-identity N/A

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

      5. lower--.f64 N/A

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

      6. lower-/.f64 N/A

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

      7. lower-*.f64 82.5

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

   5. Applied rewrites 82.5%

      \[\leadsto \color{blue}{\frac{b - \frac{a \cdot d}{c}}{c}} \]
3. Recombined 4 regimes into one program.
4. Add Preprocessing

Alternative 4: 80.3% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{b \cdot c - a \cdot d}{c \cdot c + d \cdot d}\\ t_1 := \frac{b - \frac{a \cdot d}{c}}{c}\\ \mathbf{if}\;c \leq -1.4 \cdot 10^{+63}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;c \leq -1.2 \cdot 10^{-67}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;c \leq 4.1 \cdot 10^{-134}:\\ \;\;\;\;\frac{\frac{b \cdot c}{d} - a}{d}\\ \mathbf{elif}\;c \leq 10^{+112}:\\ \;\;\;\;t\_0\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c d)
 :precision binary64
 (let* ((t_0 (/ (- (* b c) (* a d)) (+ (* c c) (* d d))))
        (t_1 (/ (- b (/ (* a d) c)) c)))
   (if (<= c -1.4e+63)
     t_1
     (if (<= c -1.2e-67)
       t_0
       (if (<= c 4.1e-134)
         (/ (- (/ (* b c) d) a) d)
         (if (<= c 1e+112) t_0 t_1))))))

C

double code(double a, double b, double c, double d) {
	double t_0 = ((b * c) - (a * d)) / ((c * c) + (d * d));
	double t_1 = (b - ((a * d) / c)) / c;
	double tmp;
	if (c <= -1.4e+63) {
		tmp = t_1;
	} else if (c <= -1.2e-67) {
		tmp = t_0;
	} else if (c <= 4.1e-134) {
		tmp = (((b * c) / d) - a) / d;
	} else if (c <= 1e+112) {
		tmp = t_0;
	} else {
		tmp = t_1;
	}
	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) :: t_0
    real(8) :: t_1
    real(8) :: tmp
    t_0 = ((b * c) - (a * d)) / ((c * c) + (d * d))
    t_1 = (b - ((a * d) / c)) / c
    if (c <= (-1.4d+63)) then
        tmp = t_1
    else if (c <= (-1.2d-67)) then
        tmp = t_0
    else if (c <= 4.1d-134) then
        tmp = (((b * c) / d) - a) / d
    else if (c <= 1d+112) then
        tmp = t_0
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

public static double code(double a, double b, double c, double d) {
	double t_0 = ((b * c) - (a * d)) / ((c * c) + (d * d));
	double t_1 = (b - ((a * d) / c)) / c;
	double tmp;
	if (c <= -1.4e+63) {
		tmp = t_1;
	} else if (c <= -1.2e-67) {
		tmp = t_0;
	} else if (c <= 4.1e-134) {
		tmp = (((b * c) / d) - a) / d;
	} else if (c <= 1e+112) {
		tmp = t_0;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(a, b, c, d):
	t_0 = ((b * c) - (a * d)) / ((c * c) + (d * d))
	t_1 = (b - ((a * d) / c)) / c
	tmp = 0
	if c <= -1.4e+63:
		tmp = t_1
	elif c <= -1.2e-67:
		tmp = t_0
	elif c <= 4.1e-134:
		tmp = (((b * c) / d) - a) / d
	elif c <= 1e+112:
		tmp = t_0
	else:
		tmp = t_1
	return tmp

Julia

function code(a, b, c, d)
	t_0 = Float64(Float64(Float64(b * c) - Float64(a * d)) / Float64(Float64(c * c) + Float64(d * d)))
	t_1 = Float64(Float64(b - Float64(Float64(a * d) / c)) / c)
	tmp = 0.0
	if (c <= -1.4e+63)
		tmp = t_1;
	elseif (c <= -1.2e-67)
		tmp = t_0;
	elseif (c <= 4.1e-134)
		tmp = Float64(Float64(Float64(Float64(b * c) / d) - a) / d);
	elseif (c <= 1e+112)
		tmp = t_0;
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c, d)
	t_0 = ((b * c) - (a * d)) / ((c * c) + (d * d));
	t_1 = (b - ((a * d) / c)) / c;
	tmp = 0.0;
	if (c <= -1.4e+63)
		tmp = t_1;
	elseif (c <= -1.2e-67)
		tmp = t_0;
	elseif (c <= 4.1e-134)
		tmp = (((b * c) / d) - a) / d;
	elseif (c <= 1e+112)
		tmp = t_0;
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_, d_] := Block[{t$95$0 = N[(N[(N[(b * c), $MachinePrecision] - N[(a * d), $MachinePrecision]), $MachinePrecision] / N[(N[(c * c), $MachinePrecision] + N[(d * d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(b - N[(N[(a * d), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision]}, If[LessEqual[c, -1.4e+63], t$95$1, If[LessEqual[c, -1.2e-67], t$95$0, If[LessEqual[c, 4.1e-134], N[(N[(N[(N[(b * c), $MachinePrecision] / d), $MachinePrecision] - a), $MachinePrecision] / d), $MachinePrecision], If[LessEqual[c, 1e+112], t$95$0, t$95$1]]]]]]

Derivation

1. Split input into 3 regimes

2. if c < -1.39999999999999993e63 or 9.9999999999999993e111 < c

   1. Initial program 29.2%

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

   3. Taylor expanded in c around inf

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

      1. lower-/.f64 N/A

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

      2. fp-cancel-sign-sub-inv N/A

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

      3. metadata-eval N/A

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

      4. *-lft-identity N/A

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

      5. lower--.f64 N/A

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

      6. lower-/.f64 N/A

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

      7. lower-*.f64 77.4

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

   5. Applied rewrites 77.4%

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

   if -1.39999999999999993e63 < c < -1.2e-67 or 4.1000000000000002e-134 < c < 9.9999999999999993e111

   1. Initial program 90.6%

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

   if -1.2e-67 < c < 4.1000000000000002e-134

   1. Initial program 79.3%

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

   3. Taylor expanded in c around 0

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

      1. +-commutative N/A

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

      2. fp-cancel-sign-sub-inv N/A

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

      3. unpow2 N/A

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

      4. associate-/r* N/A

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

      5. metadata-eval N/A

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

      6. *-lft-identity N/A

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

      7. div-sub N/A

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

      8. lower-/.f64 N/A

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

      9. lower--.f64 N/A

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

      10. lower-/.f64 N/A

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

      11. lower-*.f64 97.6

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

   5. Applied rewrites 97.6%

      \[\leadsto \color{blue}{\frac{\frac{b \cdot c}{d} - a}{d}} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 5: 61.9% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := b \cdot c - a \cdot d\\ \mathbf{if}\;c \leq -2.6 \cdot 10^{+69}:\\ \;\;\;\;\frac{b}{c}\\ \mathbf{elif}\;c \leq -4.4 \cdot 10^{-27}:\\ \;\;\;\;\frac{t\_0}{c \cdot c}\\ \mathbf{elif}\;c \leq 5.4 \cdot 10^{+25}:\\ \;\;\;\;\frac{t\_0}{d \cdot d}\\ \mathbf{else}:\\ \;\;\;\;\frac{b}{c}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c d)
 :precision binary64
 (let* ((t_0 (- (* b c) (* a d))))
   (if (<= c -2.6e+69)
     (/ b c)
     (if (<= c -4.4e-27)
       (/ t_0 (* c c))
       (if (<= c 5.4e+25) (/ t_0 (* d d)) (/ b c))))))

C

double code(double a, double b, double c, double d) {
	double t_0 = (b * c) - (a * d);
	double tmp;
	if (c <= -2.6e+69) {
		tmp = b / c;
	} else if (c <= -4.4e-27) {
		tmp = t_0 / (c * c);
	} else if (c <= 5.4e+25) {
		tmp = t_0 / (d * d);
	} else {
		tmp = b / c;
	}
	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) :: t_0
    real(8) :: tmp
    t_0 = (b * c) - (a * d)
    if (c <= (-2.6d+69)) then
        tmp = b / c
    else if (c <= (-4.4d-27)) then
        tmp = t_0 / (c * c)
    else if (c <= 5.4d+25) then
        tmp = t_0 / (d * d)
    else
        tmp = b / c
    end if
    code = tmp
end function

Java

public static double code(double a, double b, double c, double d) {
	double t_0 = (b * c) - (a * d);
	double tmp;
	if (c <= -2.6e+69) {
		tmp = b / c;
	} else if (c <= -4.4e-27) {
		tmp = t_0 / (c * c);
	} else if (c <= 5.4e+25) {
		tmp = t_0 / (d * d);
	} else {
		tmp = b / c;
	}
	return tmp;
}

Python

def code(a, b, c, d):
	t_0 = (b * c) - (a * d)
	tmp = 0
	if c <= -2.6e+69:
		tmp = b / c
	elif c <= -4.4e-27:
		tmp = t_0 / (c * c)
	elif c <= 5.4e+25:
		tmp = t_0 / (d * d)
	else:
		tmp = b / c
	return tmp

Julia

function code(a, b, c, d)
	t_0 = Float64(Float64(b * c) - Float64(a * d))
	tmp = 0.0
	if (c <= -2.6e+69)
		tmp = Float64(b / c);
	elseif (c <= -4.4e-27)
		tmp = Float64(t_0 / Float64(c * c));
	elseif (c <= 5.4e+25)
		tmp = Float64(t_0 / Float64(d * d));
	else
		tmp = Float64(b / c);
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c, d)
	t_0 = (b * c) - (a * d);
	tmp = 0.0;
	if (c <= -2.6e+69)
		tmp = b / c;
	elseif (c <= -4.4e-27)
		tmp = t_0 / (c * c);
	elseif (c <= 5.4e+25)
		tmp = t_0 / (d * d);
	else
		tmp = b / c;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_, d_] := Block[{t$95$0 = N[(N[(b * c), $MachinePrecision] - N[(a * d), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[c, -2.6e+69], N[(b / c), $MachinePrecision], If[LessEqual[c, -4.4e-27], N[(t$95$0 / N[(c * c), $MachinePrecision]), $MachinePrecision], If[LessEqual[c, 5.4e+25], N[(t$95$0 / N[(d * d), $MachinePrecision]), $MachinePrecision], N[(b / c), $MachinePrecision]]]]]

Derivation

1. Split input into 3 regimes

2. if c < -2.6000000000000002e69 or 5.4e25 < c

   1. Initial program 37.0%

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

   3. Taylor expanded in c around inf

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

      1. lower-/.f64 72.2

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

   5. Applied rewrites 72.2%

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

   if -2.6000000000000002e69 < c < -4.39999999999999974e-27

   1. Initial program 83.9%

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

   3. Taylor expanded in c around inf

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

      1. unpow2 N/A

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

      2. lower-*.f64 78.3

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

   5. Applied rewrites 78.3%

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

   if -4.39999999999999974e-27 < c < 5.4e25

   1. Initial program 83.9%

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

   3. Taylor expanded in c around 0

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

      1. unpow2 N/A

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

      2. lower-*.f64 72.2

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

   5. Applied rewrites 72.2%

      \[\leadsto \frac{b \cdot c - a \cdot d}{\color{blue}{d \cdot d}} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 6: 76.2% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;c \leq -1650 \lor \neg \left(c \leq 30500\right):\\ \;\;\;\;\frac{b - \frac{a \cdot d}{c}}{c}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{b \cdot c}{d} - a}{d}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c d)
 :precision binary64
 (if (or (<= c -1650.0) (not (<= c 30500.0)))
   (/ (- b (/ (* a d) c)) c)
   (/ (- (/ (* b c) d) a) d)))

C

double code(double a, double b, double c, double d) {
	double tmp;
	if ((c <= -1650.0) || !(c <= 30500.0)) {
		tmp = (b - ((a * d) / c)) / c;
	} else {
		tmp = (((b * c) / d) - a) / 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 <= (-1650.0d0)) .or. (.not. (c <= 30500.0d0))) then
        tmp = (b - ((a * d) / c)) / c
    else
        tmp = (((b * c) / d) - a) / d
    end if
    code = tmp
end function

Java

public static double code(double a, double b, double c, double d) {
	double tmp;
	if ((c <= -1650.0) || !(c <= 30500.0)) {
		tmp = (b - ((a * d) / c)) / c;
	} else {
		tmp = (((b * c) / d) - a) / d;
	}
	return tmp;
}

Python

def code(a, b, c, d):
	tmp = 0
	if (c <= -1650.0) or not (c <= 30500.0):
		tmp = (b - ((a * d) / c)) / c
	else:
		tmp = (((b * c) / d) - a) / d
	return tmp

Julia

function code(a, b, c, d)
	tmp = 0.0
	if ((c <= -1650.0) || !(c <= 30500.0))
		tmp = Float64(Float64(b - Float64(Float64(a * d) / c)) / c);
	else
		tmp = Float64(Float64(Float64(Float64(b * c) / d) - a) / d);
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c, d)
	tmp = 0.0;
	if ((c <= -1650.0) || ~((c <= 30500.0)))
		tmp = (b - ((a * d) / c)) / c;
	else
		tmp = (((b * c) / d) - a) / d;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_, d_] := If[Or[LessEqual[c, -1650.0], N[Not[LessEqual[c, 30500.0]], $MachinePrecision]], N[(N[(b - N[(N[(a * d), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], N[(N[(N[(N[(b * c), $MachinePrecision] / d), $MachinePrecision] - a), $MachinePrecision] / d), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if c < -1650 or 30500 < c

   1. Initial program 43.4%

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

   3. Taylor expanded in c around inf

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

      1. lower-/.f64 N/A

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

      2. fp-cancel-sign-sub-inv N/A

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

      3. metadata-eval N/A

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

      4. *-lft-identity N/A

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

      5. lower--.f64 N/A

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

      6. lower-/.f64 N/A

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

      7. lower-*.f64 79.2

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

   5. Applied rewrites 79.2%

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

   if -1650 < c < 30500

   1. Initial program 82.3%

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

   3. Taylor expanded in c around 0

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

      1. +-commutative N/A

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

      2. fp-cancel-sign-sub-inv N/A

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

      3. unpow2 N/A

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

      4. associate-/r* N/A

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

      5. metadata-eval N/A

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

      6. *-lft-identity N/A

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

      7. div-sub N/A

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

      8. lower-/.f64 N/A

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

      9. lower--.f64 N/A

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

      10. lower-/.f64 N/A

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

      11. lower-*.f64 86.4

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

   5. Applied rewrites 86.4%

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

4. Final simplification 82.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;c \leq -1650 \lor \neg \left(c \leq 30500\right):\\ \;\;\;\;\frac{b - \frac{a \cdot d}{c}}{c}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{b \cdot c}{d} - a}{d}\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 75.6% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;c \leq -1650 \lor \neg \left(c \leq 30500\right):\\ \;\;\;\;\frac{b - \frac{a \cdot d}{c}}{c}\\ \mathbf{else}:\\ \;\;\;\;\frac{c \cdot \frac{b}{d} - a}{d}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c d)
 :precision binary64
 (if (or (<= c -1650.0) (not (<= c 30500.0)))
   (/ (- b (/ (* a d) c)) c)
   (/ (- (* c (/ b d)) a) d)))

C

double code(double a, double b, double c, double d) {
	double tmp;
	if ((c <= -1650.0) || !(c <= 30500.0)) {
		tmp = (b - ((a * d) / c)) / c;
	} else {
		tmp = ((c * (b / d)) - a) / 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 <= (-1650.0d0)) .or. (.not. (c <= 30500.0d0))) then
        tmp = (b - ((a * d) / c)) / c
    else
        tmp = ((c * (b / d)) - a) / d
    end if
    code = tmp
end function

Java

public static double code(double a, double b, double c, double d) {
	double tmp;
	if ((c <= -1650.0) || !(c <= 30500.0)) {
		tmp = (b - ((a * d) / c)) / c;
	} else {
		tmp = ((c * (b / d)) - a) / d;
	}
	return tmp;
}

Python

def code(a, b, c, d):
	tmp = 0
	if (c <= -1650.0) or not (c <= 30500.0):
		tmp = (b - ((a * d) / c)) / c
	else:
		tmp = ((c * (b / d)) - a) / d
	return tmp

Julia

function code(a, b, c, d)
	tmp = 0.0
	if ((c <= -1650.0) || !(c <= 30500.0))
		tmp = Float64(Float64(b - Float64(Float64(a * d) / c)) / c);
	else
		tmp = Float64(Float64(Float64(c * Float64(b / d)) - a) / d);
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c, d)
	tmp = 0.0;
	if ((c <= -1650.0) || ~((c <= 30500.0)))
		tmp = (b - ((a * d) / c)) / c;
	else
		tmp = ((c * (b / d)) - a) / d;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_, d_] := If[Or[LessEqual[c, -1650.0], N[Not[LessEqual[c, 30500.0]], $MachinePrecision]], N[(N[(b - N[(N[(a * d), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], N[(N[(N[(c * N[(b / d), $MachinePrecision]), $MachinePrecision] - a), $MachinePrecision] / d), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if c < -1650 or 30500 < c

   1. Initial program 43.4%

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

   3. Taylor expanded in c around inf

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

      1. lower-/.f64 N/A

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

      2. fp-cancel-sign-sub-inv N/A

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

      3. metadata-eval N/A

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

      4. *-lft-identity N/A

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

      5. lower--.f64 N/A

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

      6. lower-/.f64 N/A

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

      7. lower-*.f64 79.2

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

   5. Applied rewrites 79.2%

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

   if -1650 < c < 30500

   1. Initial program 82.3%

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

   3. Taylor expanded in c around 0

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

      1. +-commutative N/A

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

      2. fp-cancel-sign-sub-inv N/A

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

      3. unpow2 N/A

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

      4. associate-/r* N/A

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

      5. metadata-eval N/A

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

      6. *-lft-identity N/A

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

      7. div-sub N/A

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

      8. lower-/.f64 N/A

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

      9. lower--.f64 N/A

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

      10. lower-/.f64 N/A

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

      11. lower-*.f64 86.4

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

   5. Applied rewrites 86.4%

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

   7. Applied rewrites 85.7%

      \[\leadsto \frac{c \cdot \frac{b}{d} - a}{d} \]
3. Recombined 2 regimes into one program.

4. Final simplification 82.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;c \leq -1650 \lor \neg \left(c \leq 30500\right):\\ \;\;\;\;\frac{b - \frac{a \cdot d}{c}}{c}\\ \mathbf{else}:\\ \;\;\;\;\frac{c \cdot \frac{b}{d} - a}{d}\\ \end{array} \]
5. Add Preprocessing

Alternative 8: 65.4% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (a b c d)
 :precision binary64
 (if (or (<= c -4.4e-27) (not (<= c 1.4)))
   (/ (- b (/ (* a d) c)) c)
   (/ (- (* b c) (* a d)) (* d d))))

C

double code(double a, double b, double c, double d) {
	double tmp;
	if ((c <= -4.4e-27) || !(c <= 1.4)) {
		tmp = (b - ((a * d) / c)) / c;
	} else {
		tmp = ((b * c) - (a * d)) / (d * 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 <= (-4.4d-27)) .or. (.not. (c <= 1.4d0))) then
        tmp = (b - ((a * d) / c)) / c
    else
        tmp = ((b * c) - (a * d)) / (d * d)
    end if
    code = tmp
end function

Java

public static double code(double a, double b, double c, double d) {
	double tmp;
	if ((c <= -4.4e-27) || !(c <= 1.4)) {
		tmp = (b - ((a * d) / c)) / c;
	} else {
		tmp = ((b * c) - (a * d)) / (d * d);
	}
	return tmp;
}

Python

def code(a, b, c, d):
	tmp = 0
	if (c <= -4.4e-27) or not (c <= 1.4):
		tmp = (b - ((a * d) / c)) / c
	else:
		tmp = ((b * c) - (a * d)) / (d * d)
	return tmp

Julia

function code(a, b, c, d)
	tmp = 0.0
	if ((c <= -4.4e-27) || !(c <= 1.4))
		tmp = Float64(Float64(b - Float64(Float64(a * d) / c)) / c);
	else
		tmp = Float64(Float64(Float64(b * c) - Float64(a * d)) / Float64(d * d));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c, d)
	tmp = 0.0;
	if ((c <= -4.4e-27) || ~((c <= 1.4)))
		tmp = (b - ((a * d) / c)) / c;
	else
		tmp = ((b * c) - (a * d)) / (d * d);
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_, d_] := If[Or[LessEqual[c, -4.4e-27], N[Not[LessEqual[c, 1.4]], $MachinePrecision]], N[(N[(b - N[(N[(a * d), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], N[(N[(N[(b * c), $MachinePrecision] - N[(a * d), $MachinePrecision]), $MachinePrecision] / N[(d * d), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if c < -4.39999999999999974e-27 or 1.3999999999999999 < c

   1. Initial program 44.6%

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

   3. Taylor expanded in c around inf

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

      1. lower-/.f64 N/A

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

      2. fp-cancel-sign-sub-inv N/A

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

      3. metadata-eval N/A

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

      4. *-lft-identity N/A

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

      5. lower--.f64 N/A

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

      6. lower-/.f64 N/A

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

      7. lower-*.f64 77.5

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

   5. Applied rewrites 77.5%

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

   if -4.39999999999999974e-27 < c < 1.3999999999999999

   1. Initial program 83.6%

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

   3. Taylor expanded in c around 0

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

      1. unpow2 N/A

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

      2. lower-*.f64 73.1

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

   5. Applied rewrites 73.1%

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

4. Final simplification 75.4%

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

Alternative 9: 63.8% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;c \leq -2.6 \cdot 10^{+69}:\\ \;\;\;\;\frac{b}{c}\\ \mathbf{elif}\;c \leq -7.4 \cdot 10^{-28}:\\ \;\;\;\;\frac{b \cdot c - a \cdot d}{c \cdot c}\\ \mathbf{elif}\;c \leq 5.5 \cdot 10^{+25}:\\ \;\;\;\;\frac{-a}{d}\\ \mathbf{else}:\\ \;\;\;\;\frac{b}{c}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c d)
 :precision binary64
 (if (<= c -2.6e+69)
   (/ b c)
   (if (<= c -7.4e-28)
     (/ (- (* b c) (* a d)) (* c c))
     (if (<= c 5.5e+25) (/ (- a) d) (/ b c)))))

C

double code(double a, double b, double c, double d) {
	double tmp;
	if (c <= -2.6e+69) {
		tmp = b / c;
	} else if (c <= -7.4e-28) {
		tmp = ((b * c) - (a * d)) / (c * c);
	} else if (c <= 5.5e+25) {
		tmp = -a / d;
	} else {
		tmp = b / c;
	}
	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 <= (-2.6d+69)) then
        tmp = b / c
    else if (c <= (-7.4d-28)) then
        tmp = ((b * c) - (a * d)) / (c * c)
    else if (c <= 5.5d+25) then
        tmp = -a / d
    else
        tmp = b / c
    end if
    code = tmp
end function

Java

public static double code(double a, double b, double c, double d) {
	double tmp;
	if (c <= -2.6e+69) {
		tmp = b / c;
	} else if (c <= -7.4e-28) {
		tmp = ((b * c) - (a * d)) / (c * c);
	} else if (c <= 5.5e+25) {
		tmp = -a / d;
	} else {
		tmp = b / c;
	}
	return tmp;
}

Python

def code(a, b, c, d):
	tmp = 0
	if c <= -2.6e+69:
		tmp = b / c
	elif c <= -7.4e-28:
		tmp = ((b * c) - (a * d)) / (c * c)
	elif c <= 5.5e+25:
		tmp = -a / d
	else:
		tmp = b / c
	return tmp

Julia

function code(a, b, c, d)
	tmp = 0.0
	if (c <= -2.6e+69)
		tmp = Float64(b / c);
	elseif (c <= -7.4e-28)
		tmp = Float64(Float64(Float64(b * c) - Float64(a * d)) / Float64(c * c));
	elseif (c <= 5.5e+25)
		tmp = Float64(Float64(-a) / d);
	else
		tmp = Float64(b / c);
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c, d)
	tmp = 0.0;
	if (c <= -2.6e+69)
		tmp = b / c;
	elseif (c <= -7.4e-28)
		tmp = ((b * c) - (a * d)) / (c * c);
	elseif (c <= 5.5e+25)
		tmp = -a / d;
	else
		tmp = b / c;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_, d_] := If[LessEqual[c, -2.6e+69], N[(b / c), $MachinePrecision], If[LessEqual[c, -7.4e-28], N[(N[(N[(b * c), $MachinePrecision] - N[(a * d), $MachinePrecision]), $MachinePrecision] / N[(c * c), $MachinePrecision]), $MachinePrecision], If[LessEqual[c, 5.5e+25], N[((-a) / d), $MachinePrecision], N[(b / c), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if c < -2.6000000000000002e69 or 5.50000000000000018e25 < c

   1. Initial program 37.0%

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

   3. Taylor expanded in c around inf

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

      1. lower-/.f64 72.2

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

   5. Applied rewrites 72.2%

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

   if -2.6000000000000002e69 < c < -7.40000000000000039e-28

   1. Initial program 84.6%

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

   3. Taylor expanded in c around inf

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

      1. unpow2 N/A

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

      2. lower-*.f64 74.8

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

   5. Applied rewrites 74.8%

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

   if -7.40000000000000039e-28 < c < 5.50000000000000018e25

   1. Initial program 83.8%

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

   3. Taylor expanded in c around 0

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

      1. mul-1-neg N/A

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

      2. distribute-neg-frac2 N/A

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

      3. mul-1-neg N/A

         \[\leadsto \frac{a}{\color{blue}{-1 \cdot d}} \]

      4. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{a}{-1 \cdot d}} \]

      5. mul-1-neg N/A

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

      6. lower-neg.f64 69.5

         \[\leadsto \frac{a}{\color{blue}{-d}} \]

   5. Applied rewrites 69.5%

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

4. Final simplification 71.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;c \leq -2.6 \cdot 10^{+69}:\\ \;\;\;\;\frac{b}{c}\\ \mathbf{elif}\;c \leq -7.4 \cdot 10^{-28}:\\ \;\;\;\;\frac{b \cdot c - a \cdot d}{c \cdot c}\\ \mathbf{elif}\;c \leq 5.5 \cdot 10^{+25}:\\ \;\;\;\;\frac{-a}{d}\\ \mathbf{else}:\\ \;\;\;\;\frac{b}{c}\\ \end{array} \]
5. Add Preprocessing

Alternative 10: 62.6% accurate, 1.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;c \leq -7.4 \cdot 10^{-28} \lor \neg \left(c \leq 5.5 \cdot 10^{+25}\right):\\ \;\;\;\;\frac{b}{c}\\ \mathbf{else}:\\ \;\;\;\;\frac{-a}{d}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c d)
 :precision binary64
 (if (or (<= c -7.4e-28) (not (<= c 5.5e+25))) (/ b c) (/ (- a) d)))

C

double code(double a, double b, double c, double d) {
	double tmp;
	if ((c <= -7.4e-28) || !(c <= 5.5e+25)) {
		tmp = b / c;
	} else {
		tmp = -a / 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 <= (-7.4d-28)) .or. (.not. (c <= 5.5d+25))) then
        tmp = b / c
    else
        tmp = -a / d
    end if
    code = tmp
end function

Java

public static double code(double a, double b, double c, double d) {
	double tmp;
	if ((c <= -7.4e-28) || !(c <= 5.5e+25)) {
		tmp = b / c;
	} else {
		tmp = -a / d;
	}
	return tmp;
}

Python

def code(a, b, c, d):
	tmp = 0
	if (c <= -7.4e-28) or not (c <= 5.5e+25):
		tmp = b / c
	else:
		tmp = -a / d
	return tmp

Julia

function code(a, b, c, d)
	tmp = 0.0
	if ((c <= -7.4e-28) || !(c <= 5.5e+25))
		tmp = Float64(b / c);
	else
		tmp = Float64(Float64(-a) / d);
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c, d)
	tmp = 0.0;
	if ((c <= -7.4e-28) || ~((c <= 5.5e+25)))
		tmp = b / c;
	else
		tmp = -a / d;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_, d_] := If[Or[LessEqual[c, -7.4e-28], N[Not[LessEqual[c, 5.5e+25]], $MachinePrecision]], N[(b / c), $MachinePrecision], N[((-a) / d), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if c < -7.40000000000000039e-28 or 5.50000000000000018e25 < c

   1. Initial program 43.8%

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

   3. Taylor expanded in c around inf

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

      1. lower-/.f64 69.0

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

   5. Applied rewrites 69.0%

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

   if -7.40000000000000039e-28 < c < 5.50000000000000018e25

   1. Initial program 83.8%

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

   3. Taylor expanded in c around 0

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

      1. mul-1-neg N/A

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

      2. distribute-neg-frac2 N/A

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

      3. mul-1-neg N/A

         \[\leadsto \frac{a}{\color{blue}{-1 \cdot d}} \]

      4. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{a}{-1 \cdot d}} \]

      5. mul-1-neg N/A

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

      6. lower-neg.f64 69.5

         \[\leadsto \frac{a}{\color{blue}{-d}} \]

   5. Applied rewrites 69.5%

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

4. Final simplification 69.3%

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

Alternative 11: 42.4% accurate, 3.2× speedup

Math

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

FPCore

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

C

double code(double a, double b, double c, double d) {
	return b / 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 = b / c
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 63.0%

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

3. Taylor expanded in c around inf

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

   1. lower-/.f64 43.8

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

5. Applied rewrites 43.8%

   \[\leadsto \color{blue}{\frac{b}{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{b - a \cdot \frac{d}{c}}{c + d \cdot \frac{d}{c}}\\ \mathbf{else}:\\ \;\;\;\;\frac{\left(-a\right) + b \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))
   (/ (- b (* a (/ d c))) (+ c (* d (/ d c))))
   (/ (+ (- a) (* b (/ 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 = (b - (a * (d / c))) / (c + (d * (d / c)));
	} else {
		tmp = (-a + (b * (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 = (b - (a * (d / c))) / (c + (d * (d / c)))
    else
        tmp = (-a + (b * (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 = (b - (a * (d / c))) / (c + (d * (d / c)));
	} else {
		tmp = (-a + (b * (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 = (b - (a * (d / c))) / (c + (d * (d / c)))
	else:
		tmp = (-a + (b * (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(b - Float64(a * Float64(d / c))) / Float64(c + Float64(d * Float64(d / c))));
	else
		tmp = Float64(Float64(Float64(-a) + Float64(b * 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 = (b - (a * (d / c))) / (c + (d * (d / c)));
	else
		tmp = (-a + (b * (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[(b - N[(a * N[(d / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(c + N[(d * N[(d / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[((-a) + N[(b * N[(c / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(d + N[(c * N[(c / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Reproduce

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

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

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