Development.Shake.Progress:decay from shake-0.15.5

Percentage Accurate: 66.2% → 94.0%

Time: 5.1s

Alternatives: 13

Speedup: 1.0×

Specification

Math

\[\begin{array}{l} \\ \frac{x \cdot y + z \cdot \left(t - a\right)}{y + z \cdot \left(b - y\right)} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (/ (+ (* x y) (* z (- t a))) (+ y (* z (- b y)))))

C

double code(double x, double y, double z, double t, double a, double b) {
	return ((x * y) + (z * (t - a))) / (y + (z * (b - y)));
}

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

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	return ((x * y) + (z * (t - a))) / (y + (z * (b - y)));
}

Python

def code(x, y, z, t, a, b):
	return ((x * y) + (z * (t - a))) / (y + (z * (b - y)))

Julia

function code(x, y, z, t, a, b)
	return Float64(Float64(Float64(x * y) + Float64(z * Float64(t - a))) / Float64(y + Float64(z * Float64(b - y))))
end

MATLAB

function tmp = code(x, y, z, t, a, b)
	tmp = ((x * y) + (z * (t - a))) / (y + (z * (b - y)));
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := N[(N[(N[(x * y), $MachinePrecision] + N[(z * N[(t - a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(y + N[(z * N[(b - y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Initial Program: 66.2% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{x \cdot y + z \cdot \left(t - a\right)}{y + z \cdot \left(b - y\right)} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (/ (+ (* x y) (* z (- t a))) (+ y (* z (- b y)))))

C

double code(double x, double y, double z, double t, double a, double b) {
	return ((x * y) + (z * (t - a))) / (y + (z * (b - y)));
}

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

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	return ((x * y) + (z * (t - a))) / (y + (z * (b - y)));
}

Python

def code(x, y, z, t, a, b):
	return ((x * y) + (z * (t - a))) / (y + (z * (b - y)))

Julia

function code(x, y, z, t, a, b)
	return Float64(Float64(Float64(x * y) + Float64(z * Float64(t - a))) / Float64(y + Float64(z * Float64(b - y))))
end

MATLAB

function tmp = code(x, y, z, t, a, b)
	tmp = ((x * y) + (z * (t - a))) / (y + (z * (b - y)));
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := N[(N[(N[(x * y), $MachinePrecision] + N[(z * N[(t - a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(y + N[(z * N[(b - y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Alternative 1: 94.0% accurate, 0.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{t - a}{b - y}\\ t_2 := \mathsf{fma}\left(b - y, z, y\right)\\ t_3 := \frac{x \cdot y + z \cdot \left(t - a\right)}{y + z \cdot \left(b - y\right)}\\ t_4 := \mathsf{fma}\left(z, \frac{t - a}{t\_2}, x \cdot \frac{y}{t\_2}\right)\\ \mathbf{if}\;t\_3 \leq -\infty:\\ \;\;\;\;t\_4\\ \mathbf{elif}\;t\_3 \leq -1 \cdot 10^{-265}:\\ \;\;\;\;\mathsf{fma}\left(a \cdot \frac{z}{t\_2}, -1, \frac{\mathsf{fma}\left(t, z, y \cdot x\right)}{t\_2}\right)\\ \mathbf{elif}\;t\_3 \leq 0:\\ \;\;\;\;\mathsf{fma}\left(\frac{\left(-x \cdot \frac{y}{b - y}\right) - \left(-\frac{\left(t - a\right) \cdot y}{{\left(b - y\right)}^{2}}\right)}{z}, -1, t\_1\right)\\ \mathbf{elif}\;t\_3 \leq 10^{+259}:\\ \;\;\;\;t\_3\\ \mathbf{elif}\;t\_3 \leq \infty:\\ \;\;\;\;t\_4\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (/ (- t a) (- b y)))
        (t_2 (fma (- b y) z y))
        (t_3 (/ (+ (* x y) (* z (- t a))) (+ y (* z (- b y)))))
        (t_4 (fma z (/ (- t a) t_2) (* x (/ y t_2)))))
   (if (<= t_3 (- INFINITY))
     t_4
     (if (<= t_3 -1e-265)
       (fma (* a (/ z t_2)) -1.0 (/ (fma t z (* y x)) t_2))
       (if (<= t_3 0.0)
         (fma
          (/
           (- (- (* x (/ y (- b y)))) (- (/ (* (- t a) y) (pow (- b y) 2.0))))
           z)
          -1.0
          t_1)
         (if (<= t_3 1e+259) t_3 (if (<= t_3 INFINITY) t_4 t_1)))))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = (t - a) / (b - y);
	double t_2 = fma((b - y), z, y);
	double t_3 = ((x * y) + (z * (t - a))) / (y + (z * (b - y)));
	double t_4 = fma(z, ((t - a) / t_2), (x * (y / t_2)));
	double tmp;
	if (t_3 <= -((double) INFINITY)) {
		tmp = t_4;
	} else if (t_3 <= -1e-265) {
		tmp = fma((a * (z / t_2)), -1.0, (fma(t, z, (y * x)) / t_2));
	} else if (t_3 <= 0.0) {
		tmp = fma(((-(x * (y / (b - y))) - -(((t - a) * y) / pow((b - y), 2.0))) / z), -1.0, t_1);
	} else if (t_3 <= 1e+259) {
		tmp = t_3;
	} else if (t_3 <= ((double) INFINITY)) {
		tmp = t_4;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b)
	t_1 = Float64(Float64(t - a) / Float64(b - y))
	t_2 = fma(Float64(b - y), z, y)
	t_3 = Float64(Float64(Float64(x * y) + Float64(z * Float64(t - a))) / Float64(y + Float64(z * Float64(b - y))))
	t_4 = fma(z, Float64(Float64(t - a) / t_2), Float64(x * Float64(y / t_2)))
	tmp = 0.0
	if (t_3 <= Float64(-Inf))
		tmp = t_4;
	elseif (t_3 <= -1e-265)
		tmp = fma(Float64(a * Float64(z / t_2)), -1.0, Float64(fma(t, z, Float64(y * x)) / t_2));
	elseif (t_3 <= 0.0)
		tmp = fma(Float64(Float64(Float64(-Float64(x * Float64(y / Float64(b - y)))) - Float64(-Float64(Float64(Float64(t - a) * y) / (Float64(b - y) ^ 2.0)))) / z), -1.0, t_1);
	elseif (t_3 <= 1e+259)
		tmp = t_3;
	elseif (t_3 <= Inf)
		tmp = t_4;
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(N[(t - a), $MachinePrecision] / N[(b - y), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(b - y), $MachinePrecision] * z + y), $MachinePrecision]}, Block[{t$95$3 = N[(N[(N[(x * y), $MachinePrecision] + N[(z * N[(t - a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(y + N[(z * N[(b - y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(z * N[(N[(t - a), $MachinePrecision] / t$95$2), $MachinePrecision] + N[(x * N[(y / t$95$2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$3, (-Infinity)], t$95$4, If[LessEqual[t$95$3, -1e-265], N[(N[(a * N[(z / t$95$2), $MachinePrecision]), $MachinePrecision] * -1.0 + N[(N[(t * z + N[(y * x), $MachinePrecision]), $MachinePrecision] / t$95$2), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, 0.0], N[(N[(N[((-N[(x * N[(y / N[(b - y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]) - (-N[(N[(N[(t - a), $MachinePrecision] * y), $MachinePrecision] / N[Power[N[(b - y), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision])), $MachinePrecision] / z), $MachinePrecision] * -1.0 + t$95$1), $MachinePrecision], If[LessEqual[t$95$3, 1e+259], t$95$3, If[LessEqual[t$95$3, Infinity], t$95$4, t$95$1]]]]]]]]]

Derivation

1. Split input into 5 regimes

2. if (/.f64 (+.f64 (*.f64 x y) (*.f64 z (-.f64 t a))) (+.f64 y (*.f64 z (-.f64 b y)))) < -inf.0 or 9.999999999999999e258 < (/.f64 (+.f64 (*.f64 x y) (*.f64 z (-.f64 t a))) (+.f64 y (*.f64 z (-.f64 b y)))) < +inf.0

   1. Initial program 34.4%

      \[\frac{x \cdot y + z \cdot \left(t - a\right)}{y + z \cdot \left(b - y\right)} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto \color{blue}{\frac{x \cdot y + z \cdot \left(t - a\right)}{y + z \cdot \left(b - y\right)}} \]

      2. lift-+.f64 N/A

         \[\leadsto \frac{\color{blue}{x \cdot y + z \cdot \left(t - a\right)}}{y + z \cdot \left(b - y\right)} \]

      3. lift-*.f64 N/A

         \[\leadsto \frac{\color{blue}{x \cdot y} + z \cdot \left(t - a\right)}{y + z \cdot \left(b - y\right)} \]

      4. lift--.f64 N/A

         \[\leadsto \frac{x \cdot y + z \cdot \color{blue}{\left(t - a\right)}}{y + z \cdot \left(b - y\right)} \]

      5. lift-*.f64 N/A

         \[\leadsto \frac{x \cdot y + \color{blue}{z \cdot \left(t - a\right)}}{y + z \cdot \left(b - y\right)} \]

      6. lift-+.f64 N/A

         \[\leadsto \frac{x \cdot y + z \cdot \left(t - a\right)}{\color{blue}{y + z \cdot \left(b - y\right)}} \]

      7. lift--.f64 N/A

         \[\leadsto \frac{x \cdot y + z \cdot \left(t - a\right)}{y + z \cdot \color{blue}{\left(b - y\right)}} \]

      8. lift-*.f64 N/A

         \[\leadsto \frac{x \cdot y + z \cdot \left(t - a\right)}{y + \color{blue}{z \cdot \left(b - y\right)}} \]

      9. div-add-rev N/A

         \[\leadsto \color{blue}{\frac{x \cdot y}{y + z \cdot \left(b - y\right)} + \frac{z \cdot \left(t - a\right)}{y + z \cdot \left(b - y\right)}} \]

      10. +-commutative N/A

          \[\leadsto \color{blue}{\frac{z \cdot \left(t - a\right)}{y + z \cdot \left(b - y\right)} + \frac{x \cdot y}{y + z \cdot \left(b - y\right)}} \]

      11. associate-/l* N/A

          \[\leadsto \color{blue}{z \cdot \frac{t - a}{y + z \cdot \left(b - y\right)}} + \frac{x \cdot y}{y + z \cdot \left(b - y\right)} \]

      12. lower-fma.f64 N/A

          \[\leadsto \color{blue}{\mathsf{fma}\left(z, \frac{t - a}{y + z \cdot \left(b - y\right)}, \frac{x \cdot y}{y + z \cdot \left(b - y\right)}\right)} \]

   4. Applied rewrites 97.5%

      \[\leadsto \color{blue}{\mathsf{fma}\left(z, \frac{t - a}{\mathsf{fma}\left(b - y, z, y\right)}, x \cdot \frac{y}{\mathsf{fma}\left(b - y, z, y\right)}\right)} \]

   if -inf.0 < (/.f64 (+.f64 (*.f64 x y) (*.f64 z (-.f64 t a))) (+.f64 y (*.f64 z (-.f64 b y)))) < -9.99999999999999985e-266

   1. Initial program 99.5%

      \[\frac{x \cdot y + z \cdot \left(t - a\right)}{y + z \cdot \left(b - y\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in t around 0

      \[\leadsto \color{blue}{-1 \cdot \frac{a \cdot z}{y + z \cdot \left(b - y\right)} + \left(\frac{t \cdot z}{y + z \cdot \left(b - y\right)} + \frac{x \cdot y}{y + z \cdot \left(b - y\right)}\right)} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \frac{a \cdot z}{y + z \cdot \left(b - y\right)} \cdot -1 + \left(\color{blue}{\frac{t \cdot z}{y + z \cdot \left(b - y\right)}} + \frac{x \cdot y}{y + z \cdot \left(b - y\right)}\right) \]

      2. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(\frac{a \cdot z}{y + z \cdot \left(b - y\right)}, \color{blue}{-1}, \frac{t \cdot z}{y + z \cdot \left(b - y\right)} + \frac{x \cdot y}{y + z \cdot \left(b - y\right)}\right) \]

      3. associate-/l* N/A

         \[\leadsto \mathsf{fma}\left(a \cdot \frac{z}{y + z \cdot \left(b - y\right)}, -1, \frac{t \cdot z}{y + z \cdot \left(b - y\right)} + \frac{x \cdot y}{y + z \cdot \left(b - y\right)}\right) \]

      4. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(a \cdot \frac{z}{y + z \cdot \left(b - y\right)}, -1, \frac{t \cdot z}{y + z \cdot \left(b - y\right)} + \frac{x \cdot y}{y + z \cdot \left(b - y\right)}\right) \]

      5. lower-/.f64 N/A

         \[\leadsto \mathsf{fma}\left(a \cdot \frac{z}{y + z \cdot \left(b - y\right)}, -1, \frac{t \cdot z}{y + z \cdot \left(b - y\right)} + \frac{x \cdot y}{y + z \cdot \left(b - y\right)}\right) \]

      6. +-commutative N/A

         \[\leadsto \mathsf{fma}\left(a \cdot \frac{z}{z \cdot \left(b - y\right) + y}, -1, \frac{t \cdot z}{y + z \cdot \left(b - y\right)} + \frac{x \cdot y}{y + z \cdot \left(b - y\right)}\right) \]

      7. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(a \cdot \frac{z}{\left(b - y\right) \cdot z + y}, -1, \frac{t \cdot z}{y + z \cdot \left(b - y\right)} + \frac{x \cdot y}{y + z \cdot \left(b - y\right)}\right) \]

      8. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(a \cdot \frac{z}{\mathsf{fma}\left(b - y, z, y\right)}, -1, \frac{t \cdot z}{y + z \cdot \left(b - y\right)} + \frac{x \cdot y}{y + z \cdot \left(b - y\right)}\right) \]

      9. lift--.f64 N/A

         \[\leadsto \mathsf{fma}\left(a \cdot \frac{z}{\mathsf{fma}\left(b - y, z, y\right)}, -1, \frac{t \cdot z}{y + z \cdot \left(b - y\right)} + \frac{x \cdot y}{y + z \cdot \left(b - y\right)}\right) \]

      10. div-add-rev N/A

          \[\leadsto \mathsf{fma}\left(a \cdot \frac{z}{\mathsf{fma}\left(b - y, z, y\right)}, -1, \frac{t \cdot z + x \cdot y}{y + z \cdot \left(b - y\right)}\right) \]

      11. lower-/.f64 N/A

          \[\leadsto \mathsf{fma}\left(a \cdot \frac{z}{\mathsf{fma}\left(b - y, z, y\right)}, -1, \frac{t \cdot z + x \cdot y}{y + z \cdot \left(b - y\right)}\right) \]

   5. Applied rewrites 98.3%

      \[\leadsto \color{blue}{\mathsf{fma}\left(a \cdot \frac{z}{\mathsf{fma}\left(b - y, z, y\right)}, -1, \frac{\mathsf{fma}\left(t, z, y \cdot x\right)}{\mathsf{fma}\left(b - y, z, y\right)}\right)} \]

   if -9.99999999999999985e-266 < (/.f64 (+.f64 (*.f64 x y) (*.f64 z (-.f64 t a))) (+.f64 y (*.f64 z (-.f64 b y)))) < 0.0

   1. Initial program 31.1%

      \[\frac{x \cdot y + z \cdot \left(t - a\right)}{y + z \cdot \left(b - y\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in z around -inf

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

      1. associate--l+ N/A

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

      2. *-commutative N/A

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

      3. div-sub N/A

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

      4. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(\frac{-1 \cdot \frac{x \cdot y}{b - y} - -1 \cdot \frac{y \cdot \left(t - a\right)}{{\left(b - y\right)}^{2}}}{z}, \color{blue}{-1}, \frac{t - a}{b - y}\right) \]

   5. Applied rewrites 82.4%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\frac{\left(-x \cdot \frac{y}{b - y}\right) - \left(-\frac{\left(t - a\right) \cdot y}{{\left(b - y\right)}^{2}}\right)}{z}, -1, \frac{t - a}{b - y}\right)} \]

   if 0.0 < (/.f64 (+.f64 (*.f64 x y) (*.f64 z (-.f64 t a))) (+.f64 y (*.f64 z (-.f64 b y)))) < 9.999999999999999e258

   1. Initial program 99.4%

      \[\frac{x \cdot y + z \cdot \left(t - a\right)}{y + z \cdot \left(b - y\right)} \]
   2. Add Preprocessing

   if +inf.0 < (/.f64 (+.f64 (*.f64 x y) (*.f64 z (-.f64 t a))) (+.f64 y (*.f64 z (-.f64 b y))))

   1. Initial program 0.0%

      \[\frac{x \cdot y + z \cdot \left(t - a\right)}{y + z \cdot \left(b - y\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in z around inf

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

      1. lower-/.f64 N/A

         \[\leadsto \frac{t - a}{\color{blue}{b - y}} \]

      2. lift--.f64 N/A

         \[\leadsto \frac{t - a}{\color{blue}{b} - y} \]

      3. lift--.f64 76.1

         \[\leadsto \frac{t - a}{b - \color{blue}{y}} \]

   5. Applied rewrites 76.1%

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

Alternative 2: 89.6% accurate, 0.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \mathsf{fma}\left(b - y, z, y\right)\\ t_2 := \frac{x \cdot y + z \cdot \left(t - a\right)}{y + z \cdot \left(b - y\right)}\\ t_3 := \mathsf{fma}\left(z, \frac{t - a}{t\_1}, x \cdot \frac{y}{t\_1}\right)\\ \mathbf{if}\;t\_2 \leq -\infty:\\ \;\;\;\;t\_3\\ \mathbf{elif}\;t\_2 \leq 10^{+259}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;t\_2 \leq \infty:\\ \;\;\;\;t\_3\\ \mathbf{else}:\\ \;\;\;\;\frac{t - a}{b - y}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (fma (- b y) z y))
        (t_2 (/ (+ (* x y) (* z (- t a))) (+ y (* z (- b y)))))
        (t_3 (fma z (/ (- t a) t_1) (* x (/ y t_1)))))
   (if (<= t_2 (- INFINITY))
     t_3
     (if (<= t_2 1e+259) t_2 (if (<= t_2 INFINITY) t_3 (/ (- t a) (- b y)))))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = fma((b - y), z, y);
	double t_2 = ((x * y) + (z * (t - a))) / (y + (z * (b - y)));
	double t_3 = fma(z, ((t - a) / t_1), (x * (y / t_1)));
	double tmp;
	if (t_2 <= -((double) INFINITY)) {
		tmp = t_3;
	} else if (t_2 <= 1e+259) {
		tmp = t_2;
	} else if (t_2 <= ((double) INFINITY)) {
		tmp = t_3;
	} else {
		tmp = (t - a) / (b - y);
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b)
	t_1 = fma(Float64(b - y), z, y)
	t_2 = Float64(Float64(Float64(x * y) + Float64(z * Float64(t - a))) / Float64(y + Float64(z * Float64(b - y))))
	t_3 = fma(z, Float64(Float64(t - a) / t_1), Float64(x * Float64(y / t_1)))
	tmp = 0.0
	if (t_2 <= Float64(-Inf))
		tmp = t_3;
	elseif (t_2 <= 1e+259)
		tmp = t_2;
	elseif (t_2 <= Inf)
		tmp = t_3;
	else
		tmp = Float64(Float64(t - a) / Float64(b - y));
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(N[(b - y), $MachinePrecision] * z + y), $MachinePrecision]}, Block[{t$95$2 = N[(N[(N[(x * y), $MachinePrecision] + N[(z * N[(t - a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(y + N[(z * N[(b - y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(z * N[(N[(t - a), $MachinePrecision] / t$95$1), $MachinePrecision] + N[(x * N[(y / t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, (-Infinity)], t$95$3, If[LessEqual[t$95$2, 1e+259], t$95$2, If[LessEqual[t$95$2, Infinity], t$95$3, N[(N[(t - a), $MachinePrecision] / N[(b - y), $MachinePrecision]), $MachinePrecision]]]]]]]

Derivation

1. Split input into 3 regimes

2. if (/.f64 (+.f64 (*.f64 x y) (*.f64 z (-.f64 t a))) (+.f64 y (*.f64 z (-.f64 b y)))) < -inf.0 or 9.999999999999999e258 < (/.f64 (+.f64 (*.f64 x y) (*.f64 z (-.f64 t a))) (+.f64 y (*.f64 z (-.f64 b y)))) < +inf.0

   1. Initial program 34.4%

      \[\frac{x \cdot y + z \cdot \left(t - a\right)}{y + z \cdot \left(b - y\right)} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto \color{blue}{\frac{x \cdot y + z \cdot \left(t - a\right)}{y + z \cdot \left(b - y\right)}} \]

      2. lift-+.f64 N/A

         \[\leadsto \frac{\color{blue}{x \cdot y + z \cdot \left(t - a\right)}}{y + z \cdot \left(b - y\right)} \]

      3. lift-*.f64 N/A

         \[\leadsto \frac{\color{blue}{x \cdot y} + z \cdot \left(t - a\right)}{y + z \cdot \left(b - y\right)} \]

      4. lift--.f64 N/A

         \[\leadsto \frac{x \cdot y + z \cdot \color{blue}{\left(t - a\right)}}{y + z \cdot \left(b - y\right)} \]

      5. lift-*.f64 N/A

         \[\leadsto \frac{x \cdot y + \color{blue}{z \cdot \left(t - a\right)}}{y + z \cdot \left(b - y\right)} \]

      6. lift-+.f64 N/A

         \[\leadsto \frac{x \cdot y + z \cdot \left(t - a\right)}{\color{blue}{y + z \cdot \left(b - y\right)}} \]

      7. lift--.f64 N/A

         \[\leadsto \frac{x \cdot y + z \cdot \left(t - a\right)}{y + z \cdot \color{blue}{\left(b - y\right)}} \]

      8. lift-*.f64 N/A

         \[\leadsto \frac{x \cdot y + z \cdot \left(t - a\right)}{y + \color{blue}{z \cdot \left(b - y\right)}} \]

      9. div-add-rev N/A

         \[\leadsto \color{blue}{\frac{x \cdot y}{y + z \cdot \left(b - y\right)} + \frac{z \cdot \left(t - a\right)}{y + z \cdot \left(b - y\right)}} \]

      10. +-commutative N/A

          \[\leadsto \color{blue}{\frac{z \cdot \left(t - a\right)}{y + z \cdot \left(b - y\right)} + \frac{x \cdot y}{y + z \cdot \left(b - y\right)}} \]

      11. associate-/l* N/A

          \[\leadsto \color{blue}{z \cdot \frac{t - a}{y + z \cdot \left(b - y\right)}} + \frac{x \cdot y}{y + z \cdot \left(b - y\right)} \]

      12. lower-fma.f64 N/A

          \[\leadsto \color{blue}{\mathsf{fma}\left(z, \frac{t - a}{y + z \cdot \left(b - y\right)}, \frac{x \cdot y}{y + z \cdot \left(b - y\right)}\right)} \]

   4. Applied rewrites 97.5%

      \[\leadsto \color{blue}{\mathsf{fma}\left(z, \frac{t - a}{\mathsf{fma}\left(b - y, z, y\right)}, x \cdot \frac{y}{\mathsf{fma}\left(b - y, z, y\right)}\right)} \]

   if -inf.0 < (/.f64 (+.f64 (*.f64 x y) (*.f64 z (-.f64 t a))) (+.f64 y (*.f64 z (-.f64 b y)))) < 9.999999999999999e258

   1. Initial program 89.9%

      \[\frac{x \cdot y + z \cdot \left(t - a\right)}{y + z \cdot \left(b - y\right)} \]
   2. Add Preprocessing

   if +inf.0 < (/.f64 (+.f64 (*.f64 x y) (*.f64 z (-.f64 t a))) (+.f64 y (*.f64 z (-.f64 b y))))

   1. Initial program 0.0%

      \[\frac{x \cdot y + z \cdot \left(t - a\right)}{y + z \cdot \left(b - y\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in z around inf

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

      1. lower-/.f64 N/A

         \[\leadsto \frac{t - a}{\color{blue}{b - y}} \]

      2. lift--.f64 N/A

         \[\leadsto \frac{t - a}{\color{blue}{b} - y} \]

      3. lift--.f64 76.1

         \[\leadsto \frac{t - a}{b - \color{blue}{y}} \]

   5. Applied rewrites 76.1%

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

Alternative 3: 86.6% accurate, 0.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{x \cdot y + z \cdot \left(t - a\right)}{y + z \cdot \left(b - y\right)}\\ t_2 := \mathsf{fma}\left(z, \frac{t - a}{\mathsf{fma}\left(b - y, z, y\right)}, x\right)\\ \mathbf{if}\;t\_1 \leq -\infty:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;t\_1 \leq 10^{+259}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t\_1 \leq \infty:\\ \;\;\;\;t\_2\\ \mathbf{else}:\\ \;\;\;\;\frac{t - a}{b - y}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (/ (+ (* x y) (* z (- t a))) (+ y (* z (- b y)))))
        (t_2 (fma z (/ (- t a) (fma (- b y) z y)) x)))
   (if (<= t_1 (- INFINITY))
     t_2
     (if (<= t_1 1e+259) t_1 (if (<= t_1 INFINITY) t_2 (/ (- t a) (- b y)))))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = ((x * y) + (z * (t - a))) / (y + (z * (b - y)));
	double t_2 = fma(z, ((t - a) / fma((b - y), z, y)), x);
	double tmp;
	if (t_1 <= -((double) INFINITY)) {
		tmp = t_2;
	} else if (t_1 <= 1e+259) {
		tmp = t_1;
	} else if (t_1 <= ((double) INFINITY)) {
		tmp = t_2;
	} else {
		tmp = (t - a) / (b - y);
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b)
	t_1 = Float64(Float64(Float64(x * y) + Float64(z * Float64(t - a))) / Float64(y + Float64(z * Float64(b - y))))
	t_2 = fma(z, Float64(Float64(t - a) / fma(Float64(b - y), z, y)), x)
	tmp = 0.0
	if (t_1 <= Float64(-Inf))
		tmp = t_2;
	elseif (t_1 <= 1e+259)
		tmp = t_1;
	elseif (t_1 <= Inf)
		tmp = t_2;
	else
		tmp = Float64(Float64(t - a) / Float64(b - y));
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(N[(N[(x * y), $MachinePrecision] + N[(z * N[(t - a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(y + N[(z * N[(b - y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(z * N[(N[(t - a), $MachinePrecision] / N[(N[(b - y), $MachinePrecision] * z + y), $MachinePrecision]), $MachinePrecision] + x), $MachinePrecision]}, If[LessEqual[t$95$1, (-Infinity)], t$95$2, If[LessEqual[t$95$1, 1e+259], t$95$1, If[LessEqual[t$95$1, Infinity], t$95$2, N[(N[(t - a), $MachinePrecision] / N[(b - y), $MachinePrecision]), $MachinePrecision]]]]]]

Derivation

1. Split input into 3 regimes

2. if (/.f64 (+.f64 (*.f64 x y) (*.f64 z (-.f64 t a))) (+.f64 y (*.f64 z (-.f64 b y)))) < -inf.0 or 9.999999999999999e258 < (/.f64 (+.f64 (*.f64 x y) (*.f64 z (-.f64 t a))) (+.f64 y (*.f64 z (-.f64 b y)))) < +inf.0

   1. Initial program 34.4%

      \[\frac{x \cdot y + z \cdot \left(t - a\right)}{y + z \cdot \left(b - y\right)} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto \color{blue}{\frac{x \cdot y + z \cdot \left(t - a\right)}{y + z \cdot \left(b - y\right)}} \]

      2. lift-+.f64 N/A

         \[\leadsto \frac{\color{blue}{x \cdot y + z \cdot \left(t - a\right)}}{y + z \cdot \left(b - y\right)} \]

      3. lift-*.f64 N/A

         \[\leadsto \frac{\color{blue}{x \cdot y} + z \cdot \left(t - a\right)}{y + z \cdot \left(b - y\right)} \]

      4. lift--.f64 N/A

         \[\leadsto \frac{x \cdot y + z \cdot \color{blue}{\left(t - a\right)}}{y + z \cdot \left(b - y\right)} \]

      5. lift-*.f64 N/A

         \[\leadsto \frac{x \cdot y + \color{blue}{z \cdot \left(t - a\right)}}{y + z \cdot \left(b - y\right)} \]

      6. lift-+.f64 N/A

         \[\leadsto \frac{x \cdot y + z \cdot \left(t - a\right)}{\color{blue}{y + z \cdot \left(b - y\right)}} \]

      7. lift--.f64 N/A

         \[\leadsto \frac{x \cdot y + z \cdot \left(t - a\right)}{y + z \cdot \color{blue}{\left(b - y\right)}} \]

      8. lift-*.f64 N/A

         \[\leadsto \frac{x \cdot y + z \cdot \left(t - a\right)}{y + \color{blue}{z \cdot \left(b - y\right)}} \]

      9. div-add-rev N/A

         \[\leadsto \color{blue}{\frac{x \cdot y}{y + z \cdot \left(b - y\right)} + \frac{z \cdot \left(t - a\right)}{y + z \cdot \left(b - y\right)}} \]

      10. +-commutative N/A

          \[\leadsto \color{blue}{\frac{z \cdot \left(t - a\right)}{y + z \cdot \left(b - y\right)} + \frac{x \cdot y}{y + z \cdot \left(b - y\right)}} \]

      11. associate-/l* N/A

          \[\leadsto \color{blue}{z \cdot \frac{t - a}{y + z \cdot \left(b - y\right)}} + \frac{x \cdot y}{y + z \cdot \left(b - y\right)} \]

      12. lower-fma.f64 N/A

          \[\leadsto \color{blue}{\mathsf{fma}\left(z, \frac{t - a}{y + z \cdot \left(b - y\right)}, \frac{x \cdot y}{y + z \cdot \left(b - y\right)}\right)} \]

   4. Applied rewrites 97.5%

      \[\leadsto \color{blue}{\mathsf{fma}\left(z, \frac{t - a}{\mathsf{fma}\left(b - y, z, y\right)}, x \cdot \frac{y}{\mathsf{fma}\left(b - y, z, y\right)}\right)} \]

   5. Taylor expanded in z around 0

      \[\leadsto \mathsf{fma}\left(z, \frac{t - a}{\mathsf{fma}\left(b - y, z, y\right)}, \color{blue}{x}\right) \]
   6. Step-by-step derivation

   7. Applied rewrites 83.0%

      \[\leadsto \mathsf{fma}\left(z, \frac{t - a}{\mathsf{fma}\left(b - y, z, y\right)}, \color{blue}{x}\right) \]

   if -inf.0 < (/.f64 (+.f64 (*.f64 x y) (*.f64 z (-.f64 t a))) (+.f64 y (*.f64 z (-.f64 b y)))) < 9.999999999999999e258

   1. Initial program 89.9%

      \[\frac{x \cdot y + z \cdot \left(t - a\right)}{y + z \cdot \left(b - y\right)} \]
   2. Add Preprocessing

   if +inf.0 < (/.f64 (+.f64 (*.f64 x y) (*.f64 z (-.f64 t a))) (+.f64 y (*.f64 z (-.f64 b y))))

   1. Initial program 0.0%

      \[\frac{x \cdot y + z \cdot \left(t - a\right)}{y + z \cdot \left(b - y\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in z around inf

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

      1. lower-/.f64 N/A

         \[\leadsto \frac{t - a}{\color{blue}{b - y}} \]

      2. lift--.f64 N/A

         \[\leadsto \frac{t - a}{\color{blue}{b} - y} \]

      3. lift--.f64 76.1

         \[\leadsto \frac{t - a}{b - \color{blue}{y}} \]

   5. Applied rewrites 76.1%

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

Alternative 4: 77.1% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{t - a}{b - y}\\ \mathbf{if}\;z \leq -48000000000:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;z \leq 28:\\ \;\;\;\;\mathsf{fma}\left(z, \frac{t - a}{\mathsf{fma}\left(b - y, z, y\right)}, x\right)\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (/ (- t a) (- b y))))
   (if (<= z -48000000000.0)
     t_1
     (if (<= z 28.0) (fma z (/ (- t a) (fma (- b y) z y)) x) t_1))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = (t - a) / (b - y);
	double tmp;
	if (z <= -48000000000.0) {
		tmp = t_1;
	} else if (z <= 28.0) {
		tmp = fma(z, ((t - a) / fma((b - y), z, y)), x);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b)
	t_1 = Float64(Float64(t - a) / Float64(b - y))
	tmp = 0.0
	if (z <= -48000000000.0)
		tmp = t_1;
	elseif (z <= 28.0)
		tmp = fma(z, Float64(Float64(t - a) / fma(Float64(b - y), z, y)), x);
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(N[(t - a), $MachinePrecision] / N[(b - y), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[z, -48000000000.0], t$95$1, If[LessEqual[z, 28.0], N[(z * N[(N[(t - a), $MachinePrecision] / N[(N[(b - y), $MachinePrecision] * z + y), $MachinePrecision]), $MachinePrecision] + x), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if z < -4.8e10 or 28 < z

   1. Initial program 44.4%

      \[\frac{x \cdot y + z \cdot \left(t - a\right)}{y + z \cdot \left(b - y\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in z around inf

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

      1. lower-/.f64 N/A

         \[\leadsto \frac{t - a}{\color{blue}{b - y}} \]

      2. lift--.f64 N/A

         \[\leadsto \frac{t - a}{\color{blue}{b} - y} \]

      3. lift--.f64 80.4

         \[\leadsto \frac{t - a}{b - \color{blue}{y}} \]

   5. Applied rewrites 80.4%

      \[\leadsto \color{blue}{\frac{t - a}{b - y}} \]

   if -4.8e10 < z < 28

   1. Initial program 87.1%

      \[\frac{x \cdot y + z \cdot \left(t - a\right)}{y + z \cdot \left(b - y\right)} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto \color{blue}{\frac{x \cdot y + z \cdot \left(t - a\right)}{y + z \cdot \left(b - y\right)}} \]

      2. lift-+.f64 N/A

         \[\leadsto \frac{\color{blue}{x \cdot y + z \cdot \left(t - a\right)}}{y + z \cdot \left(b - y\right)} \]

      3. lift-*.f64 N/A

         \[\leadsto \frac{\color{blue}{x \cdot y} + z \cdot \left(t - a\right)}{y + z \cdot \left(b - y\right)} \]

      4. lift--.f64 N/A

         \[\leadsto \frac{x \cdot y + z \cdot \color{blue}{\left(t - a\right)}}{y + z \cdot \left(b - y\right)} \]

      5. lift-*.f64 N/A

         \[\leadsto \frac{x \cdot y + \color{blue}{z \cdot \left(t - a\right)}}{y + z \cdot \left(b - y\right)} \]

      6. lift-+.f64 N/A

         \[\leadsto \frac{x \cdot y + z \cdot \left(t - a\right)}{\color{blue}{y + z \cdot \left(b - y\right)}} \]

      7. lift--.f64 N/A

         \[\leadsto \frac{x \cdot y + z \cdot \left(t - a\right)}{y + z \cdot \color{blue}{\left(b - y\right)}} \]

      8. lift-*.f64 N/A

         \[\leadsto \frac{x \cdot y + z \cdot \left(t - a\right)}{y + \color{blue}{z \cdot \left(b - y\right)}} \]

      9. div-add-rev N/A

         \[\leadsto \color{blue}{\frac{x \cdot y}{y + z \cdot \left(b - y\right)} + \frac{z \cdot \left(t - a\right)}{y + z \cdot \left(b - y\right)}} \]

      10. +-commutative N/A

          \[\leadsto \color{blue}{\frac{z \cdot \left(t - a\right)}{y + z \cdot \left(b - y\right)} + \frac{x \cdot y}{y + z \cdot \left(b - y\right)}} \]

      11. associate-/l* N/A

          \[\leadsto \color{blue}{z \cdot \frac{t - a}{y + z \cdot \left(b - y\right)}} + \frac{x \cdot y}{y + z \cdot \left(b - y\right)} \]

      12. lower-fma.f64 N/A

          \[\leadsto \color{blue}{\mathsf{fma}\left(z, \frac{t - a}{y + z \cdot \left(b - y\right)}, \frac{x \cdot y}{y + z \cdot \left(b - y\right)}\right)} \]

   4. Applied rewrites 90.5%

      \[\leadsto \color{blue}{\mathsf{fma}\left(z, \frac{t - a}{\mathsf{fma}\left(b - y, z, y\right)}, x \cdot \frac{y}{\mathsf{fma}\left(b - y, z, y\right)}\right)} \]

   5. Taylor expanded in z around 0

      \[\leadsto \mathsf{fma}\left(z, \frac{t - a}{\mathsf{fma}\left(b - y, z, y\right)}, \color{blue}{x}\right) \]
   6. Step-by-step derivation

   7. Applied rewrites 74.1%

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

Alternative 5: 68.1% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{t - a}{b - y}\\ \mathbf{if}\;z \leq -2.65 \cdot 10^{-77}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;z \leq 0.98:\\ \;\;\;\;x \cdot \frac{y}{\mathsf{fma}\left(b - y, z, y\right)}\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (/ (- t a) (- b y))))
   (if (<= z -2.65e-77)
     t_1
     (if (<= z 0.98) (* x (/ y (fma (- b y) z y))) t_1))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = (t - a) / (b - y);
	double tmp;
	if (z <= -2.65e-77) {
		tmp = t_1;
	} else if (z <= 0.98) {
		tmp = x * (y / fma((b - y), z, y));
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b)
	t_1 = Float64(Float64(t - a) / Float64(b - y))
	tmp = 0.0
	if (z <= -2.65e-77)
		tmp = t_1;
	elseif (z <= 0.98)
		tmp = Float64(x * Float64(y / fma(Float64(b - y), z, y)));
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(N[(t - a), $MachinePrecision] / N[(b - y), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[z, -2.65e-77], t$95$1, If[LessEqual[z, 0.98], N[(x * N[(y / N[(N[(b - y), $MachinePrecision] * z + y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if z < -2.65000000000000007e-77 or 0.97999999999999998 < z

   1. Initial program 50.1%

      \[\frac{x \cdot y + z \cdot \left(t - a\right)}{y + z \cdot \left(b - y\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in z around inf

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

      1. lower-/.f64 N/A

         \[\leadsto \frac{t - a}{\color{blue}{b - y}} \]

      2. lift--.f64 N/A

         \[\leadsto \frac{t - a}{\color{blue}{b} - y} \]

      3. lift--.f64 75.5

         \[\leadsto \frac{t - a}{b - \color{blue}{y}} \]

   5. Applied rewrites 75.5%

      \[\leadsto \color{blue}{\frac{t - a}{b - y}} \]

   if -2.65000000000000007e-77 < z < 0.97999999999999998

   1. Initial program 86.9%

      \[\frac{x \cdot y + z \cdot \left(t - a\right)}{y + z \cdot \left(b - y\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

      \[\leadsto \color{blue}{\frac{x \cdot y}{y + z \cdot \left(b - y\right)}} \]
   4. Step-by-step derivation

      1. associate-/l* N/A

         \[\leadsto x \cdot \color{blue}{\frac{y}{y + z \cdot \left(b - y\right)}} \]

      2. lower-*.f64 N/A

         \[\leadsto x \cdot \color{blue}{\frac{y}{y + z \cdot \left(b - y\right)}} \]

      3. lower-/.f64 N/A

         \[\leadsto x \cdot \frac{y}{\color{blue}{y + z \cdot \left(b - y\right)}} \]

      4. +-commutative N/A

         \[\leadsto x \cdot \frac{y}{z \cdot \left(b - y\right) + \color{blue}{y}} \]

      5. *-commutative N/A

         \[\leadsto x \cdot \frac{y}{\left(b - y\right) \cdot z + y} \]

      6. lower-fma.f64 N/A

         \[\leadsto x \cdot \frac{y}{\mathsf{fma}\left(b - y, \color{blue}{z}, y\right)} \]

      7. lift--.f64 58.5

         \[\leadsto x \cdot \frac{y}{\mathsf{fma}\left(b - y, z, y\right)} \]

   5. Applied rewrites 58.5%

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

Alternative 6: 60.6% accurate, 1.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{-x}{z - 1}\\ \mathbf{if}\;y \leq -4.7 \cdot 10^{+134}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;y \leq 5 \cdot 10^{+65}:\\ \;\;\;\;\frac{t - a}{b - y}\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (/ (- x) (- z 1.0))))
   (if (<= y -4.7e+134) t_1 (if (<= y 5e+65) (/ (- t a) (- b y)) t_1))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = -x / (z - 1.0);
	double tmp;
	if (y <= -4.7e+134) {
		tmp = t_1;
	} else if (y <= 5e+65) {
		tmp = (t - a) / (b - y);
	} 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(x, y, z, t, a, b)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: t_1
    real(8) :: tmp
    t_1 = -x / (z - 1.0d0)
    if (y <= (-4.7d+134)) then
        tmp = t_1
    else if (y <= 5d+65) then
        tmp = (t - a) / (b - y)
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = -x / (z - 1.0);
	double tmp;
	if (y <= -4.7e+134) {
		tmp = t_1;
	} else if (y <= 5e+65) {
		tmp = (t - a) / (b - y);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	t_1 = -x / (z - 1.0)
	tmp = 0
	if y <= -4.7e+134:
		tmp = t_1
	elif y <= 5e+65:
		tmp = (t - a) / (b - y)
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z, t, a, b)
	t_1 = Float64(Float64(-x) / Float64(z - 1.0))
	tmp = 0.0
	if (y <= -4.7e+134)
		tmp = t_1;
	elseif (y <= 5e+65)
		tmp = Float64(Float64(t - a) / Float64(b - y));
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	t_1 = -x / (z - 1.0);
	tmp = 0.0;
	if (y <= -4.7e+134)
		tmp = t_1;
	elseif (y <= 5e+65)
		tmp = (t - a) / (b - y);
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[((-x) / N[(z - 1.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[y, -4.7e+134], t$95$1, If[LessEqual[y, 5e+65], N[(N[(t - a), $MachinePrecision] / N[(b - y), $MachinePrecision]), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if y < -4.70000000000000026e134 or 4.99999999999999973e65 < y

   1. Initial program 44.9%

      \[\frac{x \cdot y + z \cdot \left(t - a\right)}{y + z \cdot \left(b - y\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in y around -inf

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

      1. associate-*r/ N/A

         \[\leadsto \frac{-1 \cdot x}{\color{blue}{z - 1}} \]

      2. lower-/.f64 N/A

         \[\leadsto \frac{-1 \cdot x}{\color{blue}{z - 1}} \]

      3. mul-1-neg N/A

         \[\leadsto \frac{\mathsf{neg}\left(x\right)}{\color{blue}{z} - 1} \]

      4. lower-neg.f64 N/A

         \[\leadsto \frac{-x}{\color{blue}{z} - 1} \]

      5. lower--.f64 58.8

         \[\leadsto \frac{-x}{z - \color{blue}{1}} \]

   5. Applied rewrites 58.8%

      \[\leadsto \color{blue}{\frac{-x}{z - 1}} \]

   if -4.70000000000000026e134 < y < 4.99999999999999973e65

   1. Initial program 77.1%

      \[\frac{x \cdot y + z \cdot \left(t - a\right)}{y + z \cdot \left(b - y\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in z around inf

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

      1. lower-/.f64 N/A

         \[\leadsto \frac{t - a}{\color{blue}{b - y}} \]

      2. lift--.f64 N/A

         \[\leadsto \frac{t - a}{\color{blue}{b} - y} \]

      3. lift--.f64 61.5

         \[\leadsto \frac{t - a}{b - \color{blue}{y}} \]

   5. Applied rewrites 61.5%

      \[\leadsto \color{blue}{\frac{t - a}{b - y}} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 7: 54.6% accurate, 1.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{-x}{z - 1}\\ \mathbf{if}\;y \leq -98000000000:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;y \leq 1.15 \cdot 10^{+58}:\\ \;\;\;\;\frac{t - a}{b}\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (/ (- x) (- z 1.0))))
   (if (<= y -98000000000.0) t_1 (if (<= y 1.15e+58) (/ (- t a) b) t_1))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = -x / (z - 1.0);
	double tmp;
	if (y <= -98000000000.0) {
		tmp = t_1;
	} else if (y <= 1.15e+58) {
		tmp = (t - a) / b;
	} 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(x, y, z, t, a, b)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: t_1
    real(8) :: tmp
    t_1 = -x / (z - 1.0d0)
    if (y <= (-98000000000.0d0)) then
        tmp = t_1
    else if (y <= 1.15d+58) then
        tmp = (t - a) / b
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = -x / (z - 1.0);
	double tmp;
	if (y <= -98000000000.0) {
		tmp = t_1;
	} else if (y <= 1.15e+58) {
		tmp = (t - a) / b;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	t_1 = -x / (z - 1.0)
	tmp = 0
	if y <= -98000000000.0:
		tmp = t_1
	elif y <= 1.15e+58:
		tmp = (t - a) / b
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z, t, a, b)
	t_1 = Float64(Float64(-x) / Float64(z - 1.0))
	tmp = 0.0
	if (y <= -98000000000.0)
		tmp = t_1;
	elseif (y <= 1.15e+58)
		tmp = Float64(Float64(t - a) / b);
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	t_1 = -x / (z - 1.0);
	tmp = 0.0;
	if (y <= -98000000000.0)
		tmp = t_1;
	elseif (y <= 1.15e+58)
		tmp = (t - a) / b;
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[((-x) / N[(z - 1.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[y, -98000000000.0], t$95$1, If[LessEqual[y, 1.15e+58], N[(N[(t - a), $MachinePrecision] / b), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if y < -9.8e10 or 1.15000000000000001e58 < y

   1. Initial program 49.9%

      \[\frac{x \cdot y + z \cdot \left(t - a\right)}{y + z \cdot \left(b - y\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in y around -inf

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

      1. associate-*r/ N/A

         \[\leadsto \frac{-1 \cdot x}{\color{blue}{z - 1}} \]

      2. lower-/.f64 N/A

         \[\leadsto \frac{-1 \cdot x}{\color{blue}{z - 1}} \]

      3. mul-1-neg N/A

         \[\leadsto \frac{\mathsf{neg}\left(x\right)}{\color{blue}{z} - 1} \]

      4. lower-neg.f64 N/A

         \[\leadsto \frac{-x}{\color{blue}{z} - 1} \]

      5. lower--.f64 54.4

         \[\leadsto \frac{-x}{z - \color{blue}{1}} \]

   5. Applied rewrites 54.4%

      \[\leadsto \color{blue}{\frac{-x}{z - 1}} \]

   if -9.8e10 < y < 1.15000000000000001e58

   1. Initial program 79.3%

      \[\frac{x \cdot y + z \cdot \left(t - a\right)}{y + z \cdot \left(b - y\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0

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

      1. lower-/.f64 N/A

         \[\leadsto \frac{t - a}{\color{blue}{b}} \]

      2. lift--.f64 54.7

         \[\leadsto \frac{t - a}{b} \]

   5. Applied rewrites 54.7%

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

Alternative 8: 46.4% accurate, 1.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -2.7 \cdot 10^{+133}:\\ \;\;\;\;x\\ \mathbf{elif}\;y \leq 1.15 \cdot 10^{+58}:\\ \;\;\;\;\frac{t - a}{b}\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (<= y -2.7e+133) x (if (<= y 1.15e+58) (/ (- t a) b) x)))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (y <= -2.7e+133) {
		tmp = x;
	} else if (y <= 1.15e+58) {
		tmp = (t - a) / b;
	} else {
		tmp = x;
	}
	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(x, y, z, t, a, b)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: tmp
    if (y <= (-2.7d+133)) then
        tmp = x
    else if (y <= 1.15d+58) then
        tmp = (t - a) / b
    else
        tmp = x
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (y <= -2.7e+133) {
		tmp = x;
	} else if (y <= 1.15e+58) {
		tmp = (t - a) / b;
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	tmp = 0
	if y <= -2.7e+133:
		tmp = x
	elif y <= 1.15e+58:
		tmp = (t - a) / b
	else:
		tmp = x
	return tmp

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if (y <= -2.7e+133)
		tmp = x;
	elseif (y <= 1.15e+58)
		tmp = Float64(Float64(t - a) / b);
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if (y <= -2.7e+133)
		tmp = x;
	elseif (y <= 1.15e+58)
		tmp = (t - a) / b;
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[LessEqual[y, -2.7e+133], x, If[LessEqual[y, 1.15e+58], N[(N[(t - a), $MachinePrecision] / b), $MachinePrecision], x]]

Derivation

1. Split input into 2 regimes

2. if y < -2.7000000000000002e133 or 1.15000000000000001e58 < y

   1. Initial program 45.3%

      \[\frac{x \cdot y + z \cdot \left(t - a\right)}{y + z \cdot \left(b - y\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in z around 0

      \[\leadsto \color{blue}{x} \]
   4. Step-by-step derivation

   5. Applied rewrites 40.5%

      \[\leadsto \color{blue}{x} \]

   if -2.7000000000000002e133 < y < 1.15000000000000001e58

   1. Initial program 77.3%

      \[\frac{x \cdot y + z \cdot \left(t - a\right)}{y + z \cdot \left(b - y\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0

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

      1. lower-/.f64 N/A

         \[\leadsto \frac{t - a}{\color{blue}{b}} \]

      2. lift--.f64 49.5

         \[\leadsto \frac{t - a}{b} \]

   5. Applied rewrites 49.5%

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

Alternative 9: 45.0% accurate, 1.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{t}{b - y}\\ \mathbf{if}\;z \leq -3 \cdot 10^{-77}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;z \leq 0.44:\\ \;\;\;\;x + x \cdot z\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (/ t (- b y))))
   (if (<= z -3e-77) t_1 (if (<= z 0.44) (+ x (* x z)) t_1))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = t / (b - y);
	double tmp;
	if (z <= -3e-77) {
		tmp = t_1;
	} else if (z <= 0.44) {
		tmp = x + (x * z);
	} 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(x, y, z, t, a, b)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: t_1
    real(8) :: tmp
    t_1 = t / (b - y)
    if (z <= (-3d-77)) then
        tmp = t_1
    else if (z <= 0.44d0) then
        tmp = x + (x * z)
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = t / (b - y);
	double tmp;
	if (z <= -3e-77) {
		tmp = t_1;
	} else if (z <= 0.44) {
		tmp = x + (x * z);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	t_1 = t / (b - y)
	tmp = 0
	if z <= -3e-77:
		tmp = t_1
	elif z <= 0.44:
		tmp = x + (x * z)
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z, t, a, b)
	t_1 = Float64(t / Float64(b - y))
	tmp = 0.0
	if (z <= -3e-77)
		tmp = t_1;
	elseif (z <= 0.44)
		tmp = Float64(x + Float64(x * z));
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	t_1 = t / (b - y);
	tmp = 0.0;
	if (z <= -3e-77)
		tmp = t_1;
	elseif (z <= 0.44)
		tmp = x + (x * z);
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(t / N[(b - y), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[z, -3e-77], t$95$1, If[LessEqual[z, 0.44], N[(x + N[(x * z), $MachinePrecision]), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if z < -3.00000000000000016e-77 or 0.440000000000000002 < z

   1. Initial program 50.1%

      \[\frac{x \cdot y + z \cdot \left(t - a\right)}{y + z \cdot \left(b - y\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in t around inf

      \[\leadsto \color{blue}{\frac{t \cdot z}{y + z \cdot \left(b - y\right)}} \]
   4. Step-by-step derivation

      1. associate-/l* N/A

         \[\leadsto t \cdot \color{blue}{\frac{z}{y + z \cdot \left(b - y\right)}} \]

      2. lower-*.f64 N/A

         \[\leadsto t \cdot \color{blue}{\frac{z}{y + z \cdot \left(b - y\right)}} \]

      3. lower-/.f64 N/A

         \[\leadsto t \cdot \frac{z}{\color{blue}{y + z \cdot \left(b - y\right)}} \]

      4. +-commutative N/A

         \[\leadsto t \cdot \frac{z}{z \cdot \left(b - y\right) + \color{blue}{y}} \]

      5. *-commutative N/A

         \[\leadsto t \cdot \frac{z}{\left(b - y\right) \cdot z + y} \]

      6. lower-fma.f64 N/A

         \[\leadsto t \cdot \frac{z}{\mathsf{fma}\left(b - y, \color{blue}{z}, y\right)} \]

      7. lift--.f64 29.1

         \[\leadsto t \cdot \frac{z}{\mathsf{fma}\left(b - y, z, y\right)} \]

   5. Applied rewrites 29.1%

      \[\leadsto \color{blue}{t \cdot \frac{z}{\mathsf{fma}\left(b - y, z, y\right)}} \]

   6. Taylor expanded in z around inf

      \[\leadsto \frac{t}{\color{blue}{b - y}} \]
   7. Step-by-step derivation

      1. lower-/.f64 N/A

         \[\leadsto \frac{t}{b - \color{blue}{y}} \]

      2. lift--.f64 40.9

         \[\leadsto \frac{t}{b - y} \]

   8. Applied rewrites 40.9%

      \[\leadsto \frac{t}{\color{blue}{b - y}} \]

   if -3.00000000000000016e-77 < z < 0.440000000000000002

   1. Initial program 86.9%

      \[\frac{x \cdot y + z \cdot \left(t - a\right)}{y + z \cdot \left(b - y\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in y around -inf

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

      1. associate-*r/ N/A

         \[\leadsto \frac{-1 \cdot x}{\color{blue}{z - 1}} \]

      2. lower-/.f64 N/A

         \[\leadsto \frac{-1 \cdot x}{\color{blue}{z - 1}} \]

      3. mul-1-neg N/A

         \[\leadsto \frac{\mathsf{neg}\left(x\right)}{\color{blue}{z} - 1} \]

      4. lower-neg.f64 N/A

         \[\leadsto \frac{-x}{\color{blue}{z} - 1} \]

      5. lower--.f64 50.2

         \[\leadsto \frac{-x}{z - \color{blue}{1}} \]

   5. Applied rewrites 50.2%

      \[\leadsto \color{blue}{\frac{-x}{z - 1}} \]

   6. Taylor expanded in z around 0

      \[\leadsto x + \color{blue}{x \cdot z} \]
   7. Step-by-step derivation

      1. lower-+.f64 N/A

         \[\leadsto x + x \cdot \color{blue}{z} \]

      2. lower-*.f64 50.1

         \[\leadsto x + x \cdot z \]

   8. Applied rewrites 50.1%

      \[\leadsto x + \color{blue}{x \cdot z} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 10: 36.6% accurate, 1.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -3 \cdot 10^{-77}:\\ \;\;\;\;\frac{t}{b}\\ \mathbf{elif}\;z \leq 0.44:\\ \;\;\;\;x + x \cdot z\\ \mathbf{else}:\\ \;\;\;\;-\frac{a}{b}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (<= z -3e-77) (/ t b) (if (<= z 0.44) (+ x (* x z)) (- (/ a b)))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (z <= -3e-77) {
		tmp = t / b;
	} else if (z <= 0.44) {
		tmp = x + (x * z);
	} else {
		tmp = -(a / b);
	}
	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(x, y, z, t, a, b)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: tmp
    if (z <= (-3d-77)) then
        tmp = t / b
    else if (z <= 0.44d0) then
        tmp = x + (x * z)
    else
        tmp = -(a / b)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (z <= -3e-77) {
		tmp = t / b;
	} else if (z <= 0.44) {
		tmp = x + (x * z);
	} else {
		tmp = -(a / b);
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	tmp = 0
	if z <= -3e-77:
		tmp = t / b
	elif z <= 0.44:
		tmp = x + (x * z)
	else:
		tmp = -(a / b)
	return tmp

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if (z <= -3e-77)
		tmp = Float64(t / b);
	elseif (z <= 0.44)
		tmp = Float64(x + Float64(x * z));
	else
		tmp = Float64(-Float64(a / b));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if (z <= -3e-77)
		tmp = t / b;
	elseif (z <= 0.44)
		tmp = x + (x * z);
	else
		tmp = -(a / b);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[LessEqual[z, -3e-77], N[(t / b), $MachinePrecision], If[LessEqual[z, 0.44], N[(x + N[(x * z), $MachinePrecision]), $MachinePrecision], (-N[(a / b), $MachinePrecision])]]

Derivation

1. Split input into 3 regimes

2. if z < -3.00000000000000016e-77

   1. Initial program 54.3%

      \[\frac{x \cdot y + z \cdot \left(t - a\right)}{y + z \cdot \left(b - y\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in b around inf

      \[\leadsto \color{blue}{\frac{x \cdot y + z \cdot \left(t - a\right)}{b \cdot z}} \]
   4. Step-by-step derivation

      1. associate-/r* N/A

         \[\leadsto \frac{\frac{x \cdot y + z \cdot \left(t - a\right)}{b}}{\color{blue}{z}} \]

      2. lower-/.f64 N/A

         \[\leadsto \frac{\frac{x \cdot y + z \cdot \left(t - a\right)}{b}}{\color{blue}{z}} \]

      3. lower-/.f64 N/A

         \[\leadsto \frac{\frac{x \cdot y + z \cdot \left(t - a\right)}{b}}{z} \]

      4. +-commutative N/A

         \[\leadsto \frac{\frac{z \cdot \left(t - a\right) + x \cdot y}{b}}{z} \]

      5. *-commutative N/A

         \[\leadsto \frac{\frac{\left(t - a\right) \cdot z + x \cdot y}{b}}{z} \]

      6. lower-fma.f64 N/A

         \[\leadsto \frac{\frac{\mathsf{fma}\left(t - a, z, x \cdot y\right)}{b}}{z} \]

      7. lift--.f64 N/A

         \[\leadsto \frac{\frac{\mathsf{fma}\left(t - a, z, x \cdot y\right)}{b}}{z} \]

      8. *-commutative N/A

         \[\leadsto \frac{\frac{\mathsf{fma}\left(t - a, z, y \cdot x\right)}{b}}{z} \]

      9. lower-*.f64 35.7

         \[\leadsto \frac{\frac{\mathsf{fma}\left(t - a, z, y \cdot x\right)}{b}}{z} \]

   5. Applied rewrites 35.7%

      \[\leadsto \color{blue}{\frac{\frac{\mathsf{fma}\left(t - a, z, y \cdot x\right)}{b}}{z}} \]

   6. Taylor expanded in t around inf

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

      1. lower-/.f64 26.5

         \[\leadsto \frac{t}{b} \]

   8. Applied rewrites 26.5%

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

   if -3.00000000000000016e-77 < z < 0.440000000000000002

   1. Initial program 86.9%

      \[\frac{x \cdot y + z \cdot \left(t - a\right)}{y + z \cdot \left(b - y\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in y around -inf

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

      1. associate-*r/ N/A

         \[\leadsto \frac{-1 \cdot x}{\color{blue}{z - 1}} \]

      2. lower-/.f64 N/A

         \[\leadsto \frac{-1 \cdot x}{\color{blue}{z - 1}} \]

      3. mul-1-neg N/A

         \[\leadsto \frac{\mathsf{neg}\left(x\right)}{\color{blue}{z} - 1} \]

      4. lower-neg.f64 N/A

         \[\leadsto \frac{-x}{\color{blue}{z} - 1} \]

      5. lower--.f64 50.2

         \[\leadsto \frac{-x}{z - \color{blue}{1}} \]

   5. Applied rewrites 50.2%

      \[\leadsto \color{blue}{\frac{-x}{z - 1}} \]

   6. Taylor expanded in z around 0

      \[\leadsto x + \color{blue}{x \cdot z} \]
   7. Step-by-step derivation

      1. lower-+.f64 N/A

         \[\leadsto x + x \cdot \color{blue}{z} \]

      2. lower-*.f64 50.1

         \[\leadsto x + x \cdot z \]

   8. Applied rewrites 50.1%

      \[\leadsto x + \color{blue}{x \cdot z} \]

   if 0.440000000000000002 < z

   1. Initial program 44.7%

      \[\frac{x \cdot y + z \cdot \left(t - a\right)}{y + z \cdot \left(b - y\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in b around inf

      \[\leadsto \color{blue}{\frac{x \cdot y + z \cdot \left(t - a\right)}{b \cdot z}} \]
   4. Step-by-step derivation

      1. associate-/r* N/A

         \[\leadsto \frac{\frac{x \cdot y + z \cdot \left(t - a\right)}{b}}{\color{blue}{z}} \]

      2. lower-/.f64 N/A

         \[\leadsto \frac{\frac{x \cdot y + z \cdot \left(t - a\right)}{b}}{\color{blue}{z}} \]

      3. lower-/.f64 N/A

         \[\leadsto \frac{\frac{x \cdot y + z \cdot \left(t - a\right)}{b}}{z} \]

      4. +-commutative N/A

         \[\leadsto \frac{\frac{z \cdot \left(t - a\right) + x \cdot y}{b}}{z} \]

      5. *-commutative N/A

         \[\leadsto \frac{\frac{\left(t - a\right) \cdot z + x \cdot y}{b}}{z} \]

      6. lower-fma.f64 N/A

         \[\leadsto \frac{\frac{\mathsf{fma}\left(t - a, z, x \cdot y\right)}{b}}{z} \]

      7. lift--.f64 N/A

         \[\leadsto \frac{\frac{\mathsf{fma}\left(t - a, z, x \cdot y\right)}{b}}{z} \]

      8. *-commutative N/A

         \[\leadsto \frac{\frac{\mathsf{fma}\left(t - a, z, y \cdot x\right)}{b}}{z} \]

      9. lower-*.f64 32.1

         \[\leadsto \frac{\frac{\mathsf{fma}\left(t - a, z, y \cdot x\right)}{b}}{z} \]

   5. Applied rewrites 32.1%

      \[\leadsto \color{blue}{\frac{\frac{\mathsf{fma}\left(t - a, z, y \cdot x\right)}{b}}{z}} \]

   6. Taylor expanded in a around inf

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

      1. lower-*.f64 N/A

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

      2. lower-/.f64 25.4

         \[\leadsto -1 \cdot \frac{a}{b} \]

   8. Applied rewrites 25.4%

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

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

         \[\leadsto -1 \cdot \frac{a}{b} \]

      3. mul-1-neg N/A

         \[\leadsto \mathsf{neg}\left(\frac{a}{b}\right) \]

      4. lower-neg.f64 N/A

         \[\leadsto -\frac{a}{b} \]

      5. lift-/.f64 25.4

         \[\leadsto -\frac{a}{b} \]

   10. Applied rewrites 25.4%

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

Alternative 11: 37.1% accurate, 1.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -3 \cdot 10^{-77}:\\ \;\;\;\;\frac{t}{b}\\ \mathbf{elif}\;z \leq 0.44:\\ \;\;\;\;x + x \cdot z\\ \mathbf{else}:\\ \;\;\;\;\frac{t}{b}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (<= z -3e-77) (/ t b) (if (<= z 0.44) (+ x (* x z)) (/ t b))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (z <= -3e-77) {
		tmp = t / b;
	} else if (z <= 0.44) {
		tmp = x + (x * z);
	} else {
		tmp = t / b;
	}
	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(x, y, z, t, a, b)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: tmp
    if (z <= (-3d-77)) then
        tmp = t / b
    else if (z <= 0.44d0) then
        tmp = x + (x * z)
    else
        tmp = t / b
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (z <= -3e-77) {
		tmp = t / b;
	} else if (z <= 0.44) {
		tmp = x + (x * z);
	} else {
		tmp = t / b;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	tmp = 0
	if z <= -3e-77:
		tmp = t / b
	elif z <= 0.44:
		tmp = x + (x * z)
	else:
		tmp = t / b
	return tmp

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if (z <= -3e-77)
		tmp = Float64(t / b);
	elseif (z <= 0.44)
		tmp = Float64(x + Float64(x * z));
	else
		tmp = Float64(t / b);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if (z <= -3e-77)
		tmp = t / b;
	elseif (z <= 0.44)
		tmp = x + (x * z);
	else
		tmp = t / b;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[LessEqual[z, -3e-77], N[(t / b), $MachinePrecision], If[LessEqual[z, 0.44], N[(x + N[(x * z), $MachinePrecision]), $MachinePrecision], N[(t / b), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if z < -3.00000000000000016e-77 or 0.440000000000000002 < z

   1. Initial program 50.1%

      \[\frac{x \cdot y + z \cdot \left(t - a\right)}{y + z \cdot \left(b - y\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in b around inf

      \[\leadsto \color{blue}{\frac{x \cdot y + z \cdot \left(t - a\right)}{b \cdot z}} \]
   4. Step-by-step derivation

      1. associate-/r* N/A

         \[\leadsto \frac{\frac{x \cdot y + z \cdot \left(t - a\right)}{b}}{\color{blue}{z}} \]

      2. lower-/.f64 N/A

         \[\leadsto \frac{\frac{x \cdot y + z \cdot \left(t - a\right)}{b}}{\color{blue}{z}} \]

      3. lower-/.f64 N/A

         \[\leadsto \frac{\frac{x \cdot y + z \cdot \left(t - a\right)}{b}}{z} \]

      4. +-commutative N/A

         \[\leadsto \frac{\frac{z \cdot \left(t - a\right) + x \cdot y}{b}}{z} \]

      5. *-commutative N/A

         \[\leadsto \frac{\frac{\left(t - a\right) \cdot z + x \cdot y}{b}}{z} \]

      6. lower-fma.f64 N/A

         \[\leadsto \frac{\frac{\mathsf{fma}\left(t - a, z, x \cdot y\right)}{b}}{z} \]

      7. lift--.f64 N/A

         \[\leadsto \frac{\frac{\mathsf{fma}\left(t - a, z, x \cdot y\right)}{b}}{z} \]

      8. *-commutative N/A

         \[\leadsto \frac{\frac{\mathsf{fma}\left(t - a, z, y \cdot x\right)}{b}}{z} \]

      9. lower-*.f64 34.2

         \[\leadsto \frac{\frac{\mathsf{fma}\left(t - a, z, y \cdot x\right)}{b}}{z} \]

   5. Applied rewrites 34.2%

      \[\leadsto \color{blue}{\frac{\frac{\mathsf{fma}\left(t - a, z, y \cdot x\right)}{b}}{z}} \]

   6. Taylor expanded in t around inf

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

      1. lower-/.f64 26.9

         \[\leadsto \frac{t}{b} \]

   8. Applied rewrites 26.9%

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

   if -3.00000000000000016e-77 < z < 0.440000000000000002

   1. Initial program 86.9%

      \[\frac{x \cdot y + z \cdot \left(t - a\right)}{y + z \cdot \left(b - y\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in y around -inf

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

      1. associate-*r/ N/A

         \[\leadsto \frac{-1 \cdot x}{\color{blue}{z - 1}} \]

      2. lower-/.f64 N/A

         \[\leadsto \frac{-1 \cdot x}{\color{blue}{z - 1}} \]

      3. mul-1-neg N/A

         \[\leadsto \frac{\mathsf{neg}\left(x\right)}{\color{blue}{z} - 1} \]

      4. lower-neg.f64 N/A

         \[\leadsto \frac{-x}{\color{blue}{z} - 1} \]

      5. lower--.f64 50.2

         \[\leadsto \frac{-x}{z - \color{blue}{1}} \]

   5. Applied rewrites 50.2%

      \[\leadsto \color{blue}{\frac{-x}{z - 1}} \]

   6. Taylor expanded in z around 0

      \[\leadsto x + \color{blue}{x \cdot z} \]
   7. Step-by-step derivation

      1. lower-+.f64 N/A

         \[\leadsto x + x \cdot \color{blue}{z} \]

      2. lower-*.f64 50.1

         \[\leadsto x + x \cdot z \]

   8. Applied rewrites 50.1%

      \[\leadsto x + \color{blue}{x \cdot z} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 12: 25.5% accurate, 4.3× speedup

Math

\[\begin{array}{l} \\ x + x \cdot z \end{array} \]

FPCore

(FPCore (x y z t a b) :precision binary64 (+ x (* x z)))

C

double code(double x, double y, double z, double t, double a, double b) {
	return x + (x * z);
}

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(x, y, z, t, a, b)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    code = x + (x * z)
end function

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	return x + (x * z);
}

Python

def code(x, y, z, t, a, b):
	return x + (x * z)

Julia

function code(x, y, z, t, a, b)
	return Float64(x + Float64(x * z))
end

MATLAB

function tmp = code(x, y, z, t, a, b)
	tmp = x + (x * z);
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := N[(x + N[(x * z), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 66.2%

   \[\frac{x \cdot y + z \cdot \left(t - a\right)}{y + z \cdot \left(b - y\right)} \]
2. Add Preprocessing

3. Taylor expanded in y around -inf

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

   1. associate-*r/ N/A

      \[\leadsto \frac{-1 \cdot x}{\color{blue}{z - 1}} \]

   2. lower-/.f64 N/A

      \[\leadsto \frac{-1 \cdot x}{\color{blue}{z - 1}} \]

   3. mul-1-neg N/A

      \[\leadsto \frac{\mathsf{neg}\left(x\right)}{\color{blue}{z} - 1} \]

   4. lower-neg.f64 N/A

      \[\leadsto \frac{-x}{\color{blue}{z} - 1} \]

   5. lower--.f64 33.1

      \[\leadsto \frac{-x}{z - \color{blue}{1}} \]

5. Applied rewrites 33.1%

   \[\leadsto \color{blue}{\frac{-x}{z - 1}} \]

6. Taylor expanded in z around 0

   \[\leadsto x + \color{blue}{x \cdot z} \]
7. Step-by-step derivation

   1. lower-+.f64 N/A

      \[\leadsto x + x \cdot \color{blue}{z} \]

   2. lower-*.f64 25.5

      \[\leadsto x + x \cdot z \]

8. Applied rewrites 25.5%

   \[\leadsto x + \color{blue}{x \cdot z} \]
9. Add Preprocessing

Alternative 13: 25.4% accurate, 39.0× speedup

Math

\[\begin{array}{l} \\ x \end{array} \]

FPCore

(FPCore (x y z t a b) :precision binary64 x)

C

double code(double x, double y, double z, double t, double a, double b) {
	return x;
}

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(x, y, z, t, a, b)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    code = x
end function

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	return x;
}

Python

def code(x, y, z, t, a, b):
	return x

Julia

function code(x, y, z, t, a, b)
	return x
end

MATLAB

function tmp = code(x, y, z, t, a, b)
	tmp = x;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := x

Derivation

1. Initial program 66.2%

   \[\frac{x \cdot y + z \cdot \left(t - a\right)}{y + z \cdot \left(b - y\right)} \]
2. Add Preprocessing

3. Taylor expanded in z around 0

   \[\leadsto \color{blue}{x} \]
4. Step-by-step derivation

5. Applied rewrites 25.4%

   \[\leadsto \color{blue}{x} \]
6. Add Preprocessing

Developer Target 1: 73.3% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \frac{z \cdot t + y \cdot x}{y + z \cdot \left(b - y\right)} - \frac{a}{\left(b - y\right) + \frac{y}{z}} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (- (/ (+ (* z t) (* y x)) (+ y (* z (- b y)))) (/ a (+ (- b y) (/ y z)))))

C

double code(double x, double y, double z, double t, double a, double b) {
	return (((z * t) + (y * x)) / (y + (z * (b - y)))) - (a / ((b - y) + (y / z)));
}

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

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	return (((z * t) + (y * x)) / (y + (z * (b - y)))) - (a / ((b - y) + (y / z)));
}

Python

def code(x, y, z, t, a, b):
	return (((z * t) + (y * x)) / (y + (z * (b - y)))) - (a / ((b - y) + (y / z)))

Julia

function code(x, y, z, t, a, b)
	return Float64(Float64(Float64(Float64(z * t) + Float64(y * x)) / Float64(y + Float64(z * Float64(b - y)))) - Float64(a / Float64(Float64(b - y) + Float64(y / z))))
end

MATLAB

function tmp = code(x, y, z, t, a, b)
	tmp = (((z * t) + (y * x)) / (y + (z * (b - y)))) - (a / ((b - y) + (y / z)));
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := N[(N[(N[(N[(z * t), $MachinePrecision] + N[(y * x), $MachinePrecision]), $MachinePrecision] / N[(y + N[(z * N[(b - y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(a / N[(N[(b - y), $MachinePrecision] + N[(y / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Reproduce

herbie shell --seed 2025089 
(FPCore (x y z t a b)
  :name "Development.Shake.Progress:decay from shake-0.15.5"
  :precision binary64

  :alt
  (! :herbie-platform default (- (/ (+ (* z t) (* y x)) (+ y (* z (- b y)))) (/ a (+ (- b y) (/ y z)))))

  (/ (+ (* x y) (* z (- t a))) (+ y (* z (- b y)))))