Diagrams.Solve.Tridiagonal:solveTriDiagonal from diagrams-solve-0.1, A

Percentage Accurate: 84.8% → 94.0%

Time: 3.5s

Alternatives: 11

Speedup: 0.5×

Specification

Math

\[\frac{x - y \cdot z}{t - a \cdot z} \]

FPCore

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

C

double code(double x, double y, double z, double t, double a) {
	return (x - (y * z)) / (t - (a * 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)
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
    code = (x - (y * z)) / (t - (a * z))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 84.8% accurate, 1.0× speedup

Math

\[\frac{x - y \cdot z}{t - a \cdot z} \]

FPCore

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

C

double code(double x, double y, double z, double t, double a) {
	return (x - (y * z)) / (t - (a * 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)
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
    code = (x - (y * z)) / (t - (a * z))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 94.0% accurate, 0.2× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (/.f64 (-.f64 x (*.f64 y z)) (-.f64 t (*.f64 a z))) < -inf.0 or 5.0000000000000002e263 < (/.f64 (-.f64 x (*.f64 y z)) (-.f64 t (*.f64 a z))) < +inf.0

   1. Initial program 84.8%

      \[\frac{x - y \cdot z}{t - a \cdot z} \]
   2. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto \color{blue}{\frac{x - y \cdot z}{t - a \cdot z}} \]

      2. mult-flip N/A

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

      3. *-commutative N/A

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

      4. lift--.f64 N/A

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

      5. sub-flip N/A

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

      6. +-commutative N/A

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

      7. distribute-lft-in N/A

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

      8. distribute-rgt-neg-out N/A

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

      9. *-commutative N/A

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

      10. mult-flip N/A

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

      11. distribute-neg-frac2 N/A

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

      12. lift-*.f64 N/A

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

      13. *-commutative N/A

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

      14. associate-/l* N/A

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

      15. *-commutative N/A

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

      16. *-commutative N/A

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

      17. mult-flip N/A

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

      18. lower-fma.f64 N/A

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

   3. Applied rewrites 85.9%

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

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

   1. Initial program 84.8%

      \[\frac{x - y \cdot z}{t - a \cdot z} \]
   2. Step-by-step derivation

      1. remove-double-neg N/A

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

      2. lift--.f64 N/A

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

      3. sub-negate-rev N/A

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

      4. sub-flip N/A

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

      5. distribute-neg-in N/A

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

      6. lift-*.f64 N/A

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

      7. *-commutative N/A

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

      8. distribute-lft-neg-in N/A

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

      9. remove-double-neg N/A

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

      10. lower-fma.f64 N/A

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

      11. lower-neg.f64 84.8%

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

   3. Applied rewrites 84.8%

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

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

   1. Initial program 84.8%

      \[\frac{x - y \cdot z}{t - a \cdot z} \]

   2. Taylor expanded in z around inf

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

      1. lower-/.f64 35.5%

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

   4. Applied rewrites 35.5%

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

Alternative 2: 92.7% accurate, 0.4× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 84.8%

      \[\frac{x - y \cdot z}{t - a \cdot z} \]
   2. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto \color{blue}{\frac{x - y \cdot z}{t - a \cdot z}} \]

      2. mult-flip N/A

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

      3. *-commutative N/A

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

      4. lift--.f64 N/A

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

      5. sub-flip N/A

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

      6. +-commutative N/A

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

      7. distribute-lft-in N/A

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

      8. distribute-rgt-neg-out N/A

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

      9. *-commutative N/A

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

      10. mult-flip N/A

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

      11. distribute-neg-frac2 N/A

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

      12. lift-*.f64 N/A

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

      13. associate-/l* N/A

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

      14. *-commutative N/A

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

      15. *-commutative N/A

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

      16. mult-flip N/A

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

      17. lower-fma.f64 N/A

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

   3. Applied rewrites 88.4%

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

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

   1. Initial program 84.8%

      \[\frac{x - y \cdot z}{t - a \cdot z} \]

   2. Taylor expanded in z around inf

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

      1. lower-/.f64 35.5%

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

   4. Applied rewrites 35.5%

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

Alternative 3: 89.2% accurate, 0.5× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 84.8%

      \[\frac{x - y \cdot z}{t - a \cdot z} \]
   2. Step-by-step derivation

      1. remove-double-neg N/A

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

      2. lift--.f64 N/A

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

      3. sub-negate-rev N/A

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

      4. sub-flip N/A

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

      5. distribute-neg-in N/A

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

      6. lift-*.f64 N/A

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

      7. *-commutative N/A

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

      8. distribute-lft-neg-in N/A

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

      9. remove-double-neg N/A

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

      10. lower-fma.f64 N/A

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

      11. lower-neg.f64 84.8%

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

   3. Applied rewrites 84.8%

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

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

   1. Initial program 84.8%

      \[\frac{x - y \cdot z}{t - a \cdot z} \]

   2. Taylor expanded in z around inf

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

      1. lower-/.f64 35.5%

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

   4. Applied rewrites 35.5%

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

Alternative 4: 89.2% accurate, 0.5× speedup

Math

\[\begin{array}{l} t_1 := \frac{x - y \cdot z}{t - a \cdot z}\\ \mathbf{if}\;t\_1 \leq \infty:\\ \;\;\;\;t\_1\\ \mathbf{else}:\\ \;\;\;\;\frac{y}{a}\\ \end{array} \]

FPCore

(FPCore (x y z t a)
  :precision binary64
  (let* ((t_1 (/ (- x (* y z)) (- t (* a z)))))
  (if (<= t_1 INFINITY) t_1 (/ y a))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = (x - (y * z)) / (t - (a * z));
	double tmp;
	if (t_1 <= ((double) INFINITY)) {
		tmp = t_1;
	} else {
		tmp = y / a;
	}
	return tmp;
}

Java

public static double code(double x, double y, double z, double t, double a) {
	double t_1 = (x - (y * z)) / (t - (a * z));
	double tmp;
	if (t_1 <= Double.POSITIVE_INFINITY) {
		tmp = t_1;
	} else {
		tmp = y / a;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	t_1 = (x - (y * z)) / (t - (a * z))
	tmp = 0
	if t_1 <= math.inf:
		tmp = t_1
	else:
		tmp = y / a
	return tmp

Julia

function code(x, y, z, t, a)
	t_1 = Float64(Float64(x - Float64(y * z)) / Float64(t - Float64(a * z)))
	tmp = 0.0
	if (t_1 <= Inf)
		tmp = t_1;
	else
		tmp = Float64(y / a);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	t_1 = (x - (y * z)) / (t - (a * z));
	tmp = 0.0;
	if (t_1 <= Inf)
		tmp = t_1;
	else
		tmp = y / a;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 84.8%

      \[\frac{x - y \cdot z}{t - a \cdot z} \]

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

   1. Initial program 84.8%

      \[\frac{x - y \cdot z}{t - a \cdot z} \]

   2. Taylor expanded in z around inf

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

      1. lower-/.f64 35.5%

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

   4. Applied rewrites 35.5%

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

Alternative 5: 71.0% accurate, 0.6× speedup

Math

\[\begin{array}{l} \mathbf{if}\;z \leq -5.4 \cdot 10^{+132}:\\ \;\;\;\;\frac{y - \frac{x}{z}}{a}\\ \mathbf{elif}\;z \leq -5.5 \cdot 10^{-100}:\\ \;\;\;\;\frac{y \cdot z}{a \cdot z - t}\\ \mathbf{elif}\;z \leq 650000:\\ \;\;\;\;\frac{x - y \cdot z}{t}\\ \mathbf{else}:\\ \;\;\;\;\frac{\mathsf{fma}\left(\frac{-1}{z}, x, y\right)}{a}\\ \end{array} \]

FPCore

(FPCore (x y z t a)
  :precision binary64
  (if (<= z -5.4e+132)
  (/ (- y (/ x z)) a)
  (if (<= z -5.5e-100)
    (/ (* y z) (- (* a z) t))
    (if (<= z 650000.0)
      (/ (- x (* y z)) t)
      (/ (fma (/ -1.0 z) x y) a)))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (z <= -5.4e+132) {
		tmp = (y - (x / z)) / a;
	} else if (z <= -5.5e-100) {
		tmp = (y * z) / ((a * z) - t);
	} else if (z <= 650000.0) {
		tmp = (x - (y * z)) / t;
	} else {
		tmp = fma((-1.0 / z), x, y) / a;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if (z <= -5.4e+132)
		tmp = Float64(Float64(y - Float64(x / z)) / a);
	elseif (z <= -5.5e-100)
		tmp = Float64(Float64(y * z) / Float64(Float64(a * z) - t));
	elseif (z <= 650000.0)
		tmp = Float64(Float64(x - Float64(y * z)) / t);
	else
		tmp = Float64(fma(Float64(-1.0 / z), x, y) / a);
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_] := If[LessEqual[z, -5.4e+132], N[(N[(y - N[(x / z), $MachinePrecision]), $MachinePrecision] / a), $MachinePrecision], If[LessEqual[z, -5.5e-100], N[(N[(y * z), $MachinePrecision] / N[(N[(a * z), $MachinePrecision] - t), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 650000.0], N[(N[(x - N[(y * z), $MachinePrecision]), $MachinePrecision] / t), $MachinePrecision], N[(N[(N[(-1.0 / z), $MachinePrecision] * x + y), $MachinePrecision] / a), $MachinePrecision]]]]

Derivation

1. Split input into 4 regimes

2. if z < -5.3999999999999999e132

   1. Initial program 84.8%

      \[\frac{x - y \cdot z}{t - a \cdot z} \]
   2. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto \color{blue}{\frac{x - y \cdot z}{t - a \cdot z}} \]

      2. mult-flip N/A

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

      3. *-commutative N/A

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

      4. lift--.f64 N/A

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

      5. sub-flip N/A

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

      6. +-commutative N/A

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

      7. distribute-lft-in N/A

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

      8. distribute-rgt-neg-out N/A

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

      9. *-commutative N/A

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

      10. mult-flip N/A

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

      11. distribute-neg-frac2 N/A

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

      12. lift-*.f64 N/A

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

      13. associate-/l* N/A

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

      14. *-commutative N/A

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

      15. *-commutative N/A

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

      16. mult-flip N/A

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

      17. lower-fma.f64 N/A

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

   3. Applied rewrites 88.4%

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

   4. Taylor expanded in a around inf

      \[\leadsto \color{blue}{\frac{y + -1 \cdot \frac{x}{z}}{a}} \]
   5. Step-by-step derivation

      1. lower-/.f64 N/A

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

      2. lower-+.f64 N/A

         \[\leadsto \frac{y + -1 \cdot \frac{x}{z}}{a} \]

      3. lower-*.f64 N/A

         \[\leadsto \frac{y + -1 \cdot \frac{x}{z}}{a} \]

      4. lower-/.f64 51.9%

         \[\leadsto \frac{y + -1 \cdot \frac{x}{z}}{a} \]

   6. Applied rewrites 51.9%

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

   8. Applied rewrites 51.9%

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

   if -5.3999999999999999e132 < z < -5.5000000000000001e-100

   1. Initial program 84.8%

      \[\frac{x - y \cdot z}{t - a \cdot z} \]
   2. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto \color{blue}{\frac{x - y \cdot z}{t - a \cdot z}} \]

      2. mult-flip N/A

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

      3. *-commutative N/A

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

      4. lift--.f64 N/A

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

      5. sub-flip N/A

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

      6. +-commutative N/A

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

      7. distribute-lft-in N/A

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

      8. distribute-rgt-neg-out N/A

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

      9. *-commutative N/A

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

      10. mult-flip N/A

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

      11. distribute-neg-frac2 N/A

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

      12. lift-*.f64 N/A

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

      13. associate-/l* N/A

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

      14. *-commutative N/A

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

      15. *-commutative N/A

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

      16. mult-flip N/A

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

      17. lower-fma.f64 N/A

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

   3. Applied rewrites 88.4%

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

   4. Taylor expanded in a around inf

      \[\leadsto \color{blue}{\frac{y + -1 \cdot \frac{x}{z}}{a}} \]
   5. Step-by-step derivation

      1. lower-/.f64 N/A

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

      2. lower-+.f64 N/A

         \[\leadsto \frac{y + -1 \cdot \frac{x}{z}}{a} \]

      3. lower-*.f64 N/A

         \[\leadsto \frac{y + -1 \cdot \frac{x}{z}}{a} \]

      4. lower-/.f64 51.9%

         \[\leadsto \frac{y + -1 \cdot \frac{x}{z}}{a} \]

   6. Applied rewrites 51.9%

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

   7. Taylor expanded in x around 0

      \[\leadsto \color{blue}{\frac{y \cdot z}{a \cdot z - t}} \]
   8. Step-by-step derivation

      1. lower-/.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 N/A

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

      4. lower-*.f64 42.4%

         \[\leadsto \frac{y \cdot z}{a \cdot z - t} \]

   9. Applied rewrites 42.4%

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

   if -5.5000000000000001e-100 < z < 6.5e5

   1. Initial program 84.8%

      \[\frac{x - y \cdot z}{t - a \cdot z} \]

   2. Taylor expanded in z around 0

      \[\leadsto \frac{x - y \cdot z}{\color{blue}{t}} \]
   3. Step-by-step derivation

   4. Applied rewrites 50.2%

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

   if 6.5e5 < z

   1. Initial program 84.8%

      \[\frac{x - y \cdot z}{t - a \cdot z} \]
   2. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto \color{blue}{\frac{x - y \cdot z}{t - a \cdot z}} \]

      2. mult-flip N/A

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

      3. *-commutative N/A

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

      4. lift--.f64 N/A

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

      5. sub-flip N/A

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

      6. +-commutative N/A

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

      7. distribute-lft-in N/A

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

      8. distribute-rgt-neg-out N/A

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

      9. *-commutative N/A

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

      10. mult-flip N/A

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

      11. distribute-neg-frac2 N/A

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

      12. lift-*.f64 N/A

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

      13. associate-/l* N/A

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

      14. *-commutative N/A

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

      15. *-commutative N/A

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

      16. mult-flip N/A

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

      17. lower-fma.f64 N/A

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

   3. Applied rewrites 88.4%

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

   4. Taylor expanded in a around inf

      \[\leadsto \color{blue}{\frac{y + -1 \cdot \frac{x}{z}}{a}} \]
   5. Step-by-step derivation

      1. lower-/.f64 N/A

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

      2. lower-+.f64 N/A

         \[\leadsto \frac{y + -1 \cdot \frac{x}{z}}{a} \]

      3. lower-*.f64 N/A

         \[\leadsto \frac{y + -1 \cdot \frac{x}{z}}{a} \]

      4. lower-/.f64 51.9%

         \[\leadsto \frac{y + -1 \cdot \frac{x}{z}}{a} \]

   6. Applied rewrites 51.9%

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

      1. remove-double-neg N/A

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

      2. lift-+.f64 N/A

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

      3. +-commutative N/A

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

      4. distribute-neg-in N/A

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

      5. distribute-neg-in N/A

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

      6. remove-double-neg N/A

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

      7. lift-*.f64 N/A

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

      8. mul-1-neg N/A

         \[\leadsto \frac{\left(\mathsf{neg}\left(\frac{x}{z}\right)\right) + \left(\mathsf{neg}\left(\left(\mathsf{neg}\left(y\right)\right)\right)\right)}{a} \]

      9. lift-/.f64 N/A

         \[\leadsto \frac{\left(\mathsf{neg}\left(\frac{x}{z}\right)\right) + \left(\mathsf{neg}\left(\left(\mathsf{neg}\left(y\right)\right)\right)\right)}{a} \]

      10. mult-flip N/A

          \[\leadsto \frac{\left(\mathsf{neg}\left(x \cdot \frac{1}{z}\right)\right) + \left(\mathsf{neg}\left(\left(\mathsf{neg}\left(y\right)\right)\right)\right)}{a} \]

      11. *-commutative N/A

          \[\leadsto \frac{\left(\mathsf{neg}\left(\frac{1}{z} \cdot x\right)\right) + \left(\mathsf{neg}\left(\left(\mathsf{neg}\left(y\right)\right)\right)\right)}{a} \]

      12. distribute-lft-neg-in N/A

          \[\leadsto \frac{\left(\mathsf{neg}\left(\frac{1}{z}\right)\right) \cdot x + \left(\mathsf{neg}\left(\left(\mathsf{neg}\left(y\right)\right)\right)\right)}{a} \]

      13. distribute-neg-frac N/A

          \[\leadsto \frac{\frac{\mathsf{neg}\left(1\right)}{z} \cdot x + \left(\mathsf{neg}\left(\left(\mathsf{neg}\left(y\right)\right)\right)\right)}{a} \]

      14. metadata-eval N/A

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

      15. *-rgt-identity N/A

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

      16. metadata-eval N/A

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

      17. distribute-rgt-neg-out N/A

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

      18. *-commutative N/A

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

      19. mul-1-neg N/A

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

      20. remove-double-neg N/A

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

      21. lower-fma.f64 N/A

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

   8. Applied rewrites 51.8%

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

Alternative 6: 70.4% accurate, 0.7× speedup

Math

\[\begin{array}{l} t_1 := \frac{y - \frac{x}{z}}{a}\\ \mathbf{if}\;z \leq -5.4 \cdot 10^{+132}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;z \leq -5.5 \cdot 10^{-100}:\\ \;\;\;\;\frac{y \cdot z}{a \cdot z - t}\\ \mathbf{elif}\;z \leq 650000:\\ \;\;\;\;\frac{x - y \cdot z}{t}\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \]

FPCore

(FPCore (x y z t a)
  :precision binary64
  (let* ((t_1 (/ (- y (/ x z)) a)))
  (if (<= z -5.4e+132)
    t_1
    (if (<= z -5.5e-100)
      (/ (* y z) (- (* a z) t))
      (if (<= z 650000.0) (/ (- x (* y z)) t) t_1)))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = (y - (x / z)) / a;
	double tmp;
	if (z <= -5.4e+132) {
		tmp = t_1;
	} else if (z <= -5.5e-100) {
		tmp = (y * z) / ((a * z) - t);
	} else if (z <= 650000.0) {
		tmp = (x - (y * z)) / t;
	} 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)
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) :: t_1
    real(8) :: tmp
    t_1 = (y - (x / z)) / a
    if (z <= (-5.4d+132)) then
        tmp = t_1
    else if (z <= (-5.5d-100)) then
        tmp = (y * z) / ((a * z) - t)
    else if (z <= 650000.0d0) then
        tmp = (x - (y * z)) / t
    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 t_1 = (y - (x / z)) / a;
	double tmp;
	if (z <= -5.4e+132) {
		tmp = t_1;
	} else if (z <= -5.5e-100) {
		tmp = (y * z) / ((a * z) - t);
	} else if (z <= 650000.0) {
		tmp = (x - (y * z)) / t;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	t_1 = (y - (x / z)) / a
	tmp = 0
	if z <= -5.4e+132:
		tmp = t_1
	elif z <= -5.5e-100:
		tmp = (y * z) / ((a * z) - t)
	elif z <= 650000.0:
		tmp = (x - (y * z)) / t
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z, t, a)
	t_1 = Float64(Float64(y - Float64(x / z)) / a)
	tmp = 0.0
	if (z <= -5.4e+132)
		tmp = t_1;
	elseif (z <= -5.5e-100)
		tmp = Float64(Float64(y * z) / Float64(Float64(a * z) - t));
	elseif (z <= 650000.0)
		tmp = Float64(Float64(x - Float64(y * z)) / t);
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	t_1 = (y - (x / z)) / a;
	tmp = 0.0;
	if (z <= -5.4e+132)
		tmp = t_1;
	elseif (z <= -5.5e-100)
		tmp = (y * z) / ((a * z) - t);
	elseif (z <= 650000.0)
		tmp = (x - (y * z)) / t;
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(N[(y - N[(x / z), $MachinePrecision]), $MachinePrecision] / a), $MachinePrecision]}, If[LessEqual[z, -5.4e+132], t$95$1, If[LessEqual[z, -5.5e-100], N[(N[(y * z), $MachinePrecision] / N[(N[(a * z), $MachinePrecision] - t), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 650000.0], N[(N[(x - N[(y * z), $MachinePrecision]), $MachinePrecision] / t), $MachinePrecision], t$95$1]]]]

Derivation

1. Split input into 3 regimes

2. if z < -5.3999999999999999e132 or 6.5e5 < z

   1. Initial program 84.8%

      \[\frac{x - y \cdot z}{t - a \cdot z} \]
   2. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto \color{blue}{\frac{x - y \cdot z}{t - a \cdot z}} \]

      2. mult-flip N/A

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

      3. *-commutative N/A

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

      4. lift--.f64 N/A

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

      5. sub-flip N/A

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

      6. +-commutative N/A

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

      7. distribute-lft-in N/A

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

      8. distribute-rgt-neg-out N/A

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

      9. *-commutative N/A

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

      10. mult-flip N/A

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

      11. distribute-neg-frac2 N/A

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

      12. lift-*.f64 N/A

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

      13. associate-/l* N/A

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

      14. *-commutative N/A

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

      15. *-commutative N/A

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

      16. mult-flip N/A

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

      17. lower-fma.f64 N/A

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

   3. Applied rewrites 88.4%

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

   4. Taylor expanded in a around inf

      \[\leadsto \color{blue}{\frac{y + -1 \cdot \frac{x}{z}}{a}} \]
   5. Step-by-step derivation

      1. lower-/.f64 N/A

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

      2. lower-+.f64 N/A

         \[\leadsto \frac{y + -1 \cdot \frac{x}{z}}{a} \]

      3. lower-*.f64 N/A

         \[\leadsto \frac{y + -1 \cdot \frac{x}{z}}{a} \]

      4. lower-/.f64 51.9%

         \[\leadsto \frac{y + -1 \cdot \frac{x}{z}}{a} \]

   6. Applied rewrites 51.9%

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

   8. Applied rewrites 51.9%

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

   if -5.3999999999999999e132 < z < -5.5000000000000001e-100

   1. Initial program 84.8%

      \[\frac{x - y \cdot z}{t - a \cdot z} \]
   2. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto \color{blue}{\frac{x - y \cdot z}{t - a \cdot z}} \]

      2. mult-flip N/A

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

      3. *-commutative N/A

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

      4. lift--.f64 N/A

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

      5. sub-flip N/A

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

      6. +-commutative N/A

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

      7. distribute-lft-in N/A

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

      8. distribute-rgt-neg-out N/A

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

      9. *-commutative N/A

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

      10. mult-flip N/A

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

      11. distribute-neg-frac2 N/A

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

      12. lift-*.f64 N/A

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

      13. associate-/l* N/A

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

      14. *-commutative N/A

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

      15. *-commutative N/A

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

      16. mult-flip N/A

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

      17. lower-fma.f64 N/A

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

   3. Applied rewrites 88.4%

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

   4. Taylor expanded in a around inf

      \[\leadsto \color{blue}{\frac{y + -1 \cdot \frac{x}{z}}{a}} \]
   5. Step-by-step derivation

      1. lower-/.f64 N/A

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

      2. lower-+.f64 N/A

         \[\leadsto \frac{y + -1 \cdot \frac{x}{z}}{a} \]

      3. lower-*.f64 N/A

         \[\leadsto \frac{y + -1 \cdot \frac{x}{z}}{a} \]

      4. lower-/.f64 51.9%

         \[\leadsto \frac{y + -1 \cdot \frac{x}{z}}{a} \]

   6. Applied rewrites 51.9%

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

   7. Taylor expanded in x around 0

      \[\leadsto \color{blue}{\frac{y \cdot z}{a \cdot z - t}} \]
   8. Step-by-step derivation

      1. lower-/.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 N/A

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

      4. lower-*.f64 42.4%

         \[\leadsto \frac{y \cdot z}{a \cdot z - t} \]

   9. Applied rewrites 42.4%

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

   if -5.5000000000000001e-100 < z < 6.5e5

   1. Initial program 84.8%

      \[\frac{x - y \cdot z}{t - a \cdot z} \]

   2. Taylor expanded in z around 0

      \[\leadsto \frac{x - y \cdot z}{\color{blue}{t}} \]
   3. Step-by-step derivation

   4. Applied rewrites 50.2%

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

Alternative 7: 70.4% accurate, 0.9× speedup

Math

\[\begin{array}{l} t_1 := \frac{y - \frac{x}{z}}{a}\\ \mathbf{if}\;z \leq -4.5 \cdot 10^{-108}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;z \leq 650000:\\ \;\;\;\;\frac{x - y \cdot z}{t}\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \]

FPCore

(FPCore (x y z t a)
  :precision binary64
  (let* ((t_1 (/ (- y (/ x z)) a)))
  (if (<= z -4.5e-108)
    t_1
    (if (<= z 650000.0) (/ (- x (* y z)) t) t_1))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = (y - (x / z)) / a;
	double tmp;
	if (z <= -4.5e-108) {
		tmp = t_1;
	} else if (z <= 650000.0) {
		tmp = (x - (y * z)) / t;
	} 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)
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) :: t_1
    real(8) :: tmp
    t_1 = (y - (x / z)) / a
    if (z <= (-4.5d-108)) then
        tmp = t_1
    else if (z <= 650000.0d0) then
        tmp = (x - (y * z)) / t
    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 t_1 = (y - (x / z)) / a;
	double tmp;
	if (z <= -4.5e-108) {
		tmp = t_1;
	} else if (z <= 650000.0) {
		tmp = (x - (y * z)) / t;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	t_1 = (y - (x / z)) / a
	tmp = 0
	if z <= -4.5e-108:
		tmp = t_1
	elif z <= 650000.0:
		tmp = (x - (y * z)) / t
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z, t, a)
	t_1 = Float64(Float64(y - Float64(x / z)) / a)
	tmp = 0.0
	if (z <= -4.5e-108)
		tmp = t_1;
	elseif (z <= 650000.0)
		tmp = Float64(Float64(x - Float64(y * z)) / t);
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	t_1 = (y - (x / z)) / a;
	tmp = 0.0;
	if (z <= -4.5e-108)
		tmp = t_1;
	elseif (z <= 650000.0)
		tmp = (x - (y * z)) / t;
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(N[(y - N[(x / z), $MachinePrecision]), $MachinePrecision] / a), $MachinePrecision]}, If[LessEqual[z, -4.5e-108], t$95$1, If[LessEqual[z, 650000.0], N[(N[(x - N[(y * z), $MachinePrecision]), $MachinePrecision] / t), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if z < -4.4999999999999997e-108 or 6.5e5 < z

   1. Initial program 84.8%

      \[\frac{x - y \cdot z}{t - a \cdot z} \]
   2. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto \color{blue}{\frac{x - y \cdot z}{t - a \cdot z}} \]

      2. mult-flip N/A

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

      3. *-commutative N/A

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

      4. lift--.f64 N/A

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

      5. sub-flip N/A

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

      6. +-commutative N/A

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

      7. distribute-lft-in N/A

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

      8. distribute-rgt-neg-out N/A

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

      9. *-commutative N/A

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

      10. mult-flip N/A

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

      11. distribute-neg-frac2 N/A

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

      12. lift-*.f64 N/A

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

      13. associate-/l* N/A

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

      14. *-commutative N/A

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

      15. *-commutative N/A

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

      16. mult-flip N/A

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

      17. lower-fma.f64 N/A

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

   3. Applied rewrites 88.4%

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

   4. Taylor expanded in a around inf

      \[\leadsto \color{blue}{\frac{y + -1 \cdot \frac{x}{z}}{a}} \]
   5. Step-by-step derivation

      1. lower-/.f64 N/A

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

      2. lower-+.f64 N/A

         \[\leadsto \frac{y + -1 \cdot \frac{x}{z}}{a} \]

      3. lower-*.f64 N/A

         \[\leadsto \frac{y + -1 \cdot \frac{x}{z}}{a} \]

      4. lower-/.f64 51.9%

         \[\leadsto \frac{y + -1 \cdot \frac{x}{z}}{a} \]

   6. Applied rewrites 51.9%

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

   8. Applied rewrites 51.9%

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

   if -4.4999999999999997e-108 < z < 6.5e5

   1. Initial program 84.8%

      \[\frac{x - y \cdot z}{t - a \cdot z} \]

   2. Taylor expanded in z around 0

      \[\leadsto \frac{x - y \cdot z}{\color{blue}{t}} \]
   3. Step-by-step derivation

   4. Applied rewrites 50.2%

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

Alternative 8: 65.5% accurate, 0.9× speedup

Math

\[\begin{array}{l} \mathbf{if}\;z \leq -1.8 \cdot 10^{+24}:\\ \;\;\;\;\frac{y}{a}\\ \mathbf{elif}\;z \leq 4.8 \cdot 10^{+72}:\\ \;\;\;\;\frac{x - y \cdot z}{t}\\ \mathbf{else}:\\ \;\;\;\;\frac{y}{a}\\ \end{array} \]

FPCore

(FPCore (x y z t a)
  :precision binary64
  (if (<= z -1.8e+24)
  (/ y a)
  (if (<= z 4.8e+72) (/ (- x (* y z)) t) (/ y a))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (z <= -1.8e+24) {
		tmp = y / a;
	} else if (z <= 4.8e+72) {
		tmp = (x - (y * z)) / t;
	} else {
		tmp = y / a;
	}
	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)
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) :: tmp
    if (z <= (-1.8d+24)) then
        tmp = y / a
    else if (z <= 4.8d+72) then
        tmp = (x - (y * z)) / t
    else
        tmp = y / a
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (z <= -1.8e+24) {
		tmp = y / a;
	} else if (z <= 4.8e+72) {
		tmp = (x - (y * z)) / t;
	} else {
		tmp = y / a;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	tmp = 0
	if z <= -1.8e+24:
		tmp = y / a
	elif z <= 4.8e+72:
		tmp = (x - (y * z)) / t
	else:
		tmp = y / a
	return tmp

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if (z <= -1.8e+24)
		tmp = Float64(y / a);
	elseif (z <= 4.8e+72)
		tmp = Float64(Float64(x - Float64(y * z)) / t);
	else
		tmp = Float64(y / a);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if (z <= -1.8e+24)
		tmp = y / a;
	elseif (z <= 4.8e+72)
		tmp = (x - (y * z)) / t;
	else
		tmp = y / a;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := If[LessEqual[z, -1.8e+24], N[(y / a), $MachinePrecision], If[LessEqual[z, 4.8e+72], N[(N[(x - N[(y * z), $MachinePrecision]), $MachinePrecision] / t), $MachinePrecision], N[(y / a), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if z < -1.7999999999999999e24 or 4.8000000000000002e72 < z

   1. Initial program 84.8%

      \[\frac{x - y \cdot z}{t - a \cdot z} \]

   2. Taylor expanded in z around inf

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

      1. lower-/.f64 35.5%

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

   4. Applied rewrites 35.5%

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

   if -1.7999999999999999e24 < z < 4.8000000000000002e72

   1. Initial program 84.8%

      \[\frac{x - y \cdot z}{t - a \cdot z} \]

   2. Taylor expanded in z around 0

      \[\leadsto \frac{x - y \cdot z}{\color{blue}{t}} \]
   3. Step-by-step derivation

   4. Applied rewrites 50.2%

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

Alternative 9: 64.8% accurate, 0.9× speedup

Math

\[\begin{array}{l} \mathbf{if}\;z \leq -2.7 \cdot 10^{+25}:\\ \;\;\;\;\frac{y}{a}\\ \mathbf{elif}\;z \leq 9.5 \cdot 10^{+29}:\\ \;\;\;\;\frac{x}{t - a \cdot z}\\ \mathbf{else}:\\ \;\;\;\;\frac{y}{a}\\ \end{array} \]

FPCore

(FPCore (x y z t a)
  :precision binary64
  (if (<= z -2.7e+25)
  (/ y a)
  (if (<= z 9.5e+29) (/ x (- t (* a z))) (/ y a))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (z <= -2.7e+25) {
		tmp = y / a;
	} else if (z <= 9.5e+29) {
		tmp = x / (t - (a * z));
	} else {
		tmp = y / a;
	}
	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)
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) :: tmp
    if (z <= (-2.7d+25)) then
        tmp = y / a
    else if (z <= 9.5d+29) then
        tmp = x / (t - (a * z))
    else
        tmp = y / a
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (z <= -2.7e+25) {
		tmp = y / a;
	} else if (z <= 9.5e+29) {
		tmp = x / (t - (a * z));
	} else {
		tmp = y / a;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	tmp = 0
	if z <= -2.7e+25:
		tmp = y / a
	elif z <= 9.5e+29:
		tmp = x / (t - (a * z))
	else:
		tmp = y / a
	return tmp

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if (z <= -2.7e+25)
		tmp = Float64(y / a);
	elseif (z <= 9.5e+29)
		tmp = Float64(x / Float64(t - Float64(a * z)));
	else
		tmp = Float64(y / a);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if (z <= -2.7e+25)
		tmp = y / a;
	elseif (z <= 9.5e+29)
		tmp = x / (t - (a * z));
	else
		tmp = y / a;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := If[LessEqual[z, -2.7e+25], N[(y / a), $MachinePrecision], If[LessEqual[z, 9.5e+29], N[(x / N[(t - N[(a * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(y / a), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if z < -2.7e25 or 9.5000000000000003e29 < z

   1. Initial program 84.8%

      \[\frac{x - y \cdot z}{t - a \cdot z} \]

   2. Taylor expanded in z around inf

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

      1. lower-/.f64 35.5%

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

   4. Applied rewrites 35.5%

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

   if -2.7e25 < z < 9.5000000000000003e29

   1. Initial program 84.8%

      \[\frac{x - y \cdot z}{t - a \cdot z} \]

   2. Taylor expanded in x around inf

      \[\leadsto \color{blue}{\frac{x}{t - a \cdot z}} \]
   3. Step-by-step derivation

      1. lower-/.f64 N/A

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

      2. lower--.f64 N/A

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

      3. lower-*.f64 52.8%

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

   4. Applied rewrites 52.8%

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

Alternative 10: 54.0% accurate, 1.3× speedup

Math

\[\begin{array}{l} \mathbf{if}\;z \leq -5.4 \cdot 10^{-100}:\\ \;\;\;\;\frac{y}{a}\\ \mathbf{elif}\;z \leq 650000:\\ \;\;\;\;\frac{x}{t}\\ \mathbf{else}:\\ \;\;\;\;\frac{y}{a}\\ \end{array} \]

FPCore

(FPCore (x y z t a)
  :precision binary64
  (if (<= z -5.4e-100) (/ y a) (if (<= z 650000.0) (/ x t) (/ y a))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (z <= -5.4e-100) {
		tmp = y / a;
	} else if (z <= 650000.0) {
		tmp = x / t;
	} else {
		tmp = y / a;
	}
	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)
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) :: tmp
    if (z <= (-5.4d-100)) then
        tmp = y / a
    else if (z <= 650000.0d0) then
        tmp = x / t
    else
        tmp = y / a
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (z <= -5.4e-100) {
		tmp = y / a;
	} else if (z <= 650000.0) {
		tmp = x / t;
	} else {
		tmp = y / a;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	tmp = 0
	if z <= -5.4e-100:
		tmp = y / a
	elif z <= 650000.0:
		tmp = x / t
	else:
		tmp = y / a
	return tmp

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if (z <= -5.4e-100)
		tmp = Float64(y / a);
	elseif (z <= 650000.0)
		tmp = Float64(x / t);
	else
		tmp = Float64(y / a);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if (z <= -5.4e-100)
		tmp = y / a;
	elseif (z <= 650000.0)
		tmp = x / t;
	else
		tmp = y / a;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := If[LessEqual[z, -5.4e-100], N[(y / a), $MachinePrecision], If[LessEqual[z, 650000.0], N[(x / t), $MachinePrecision], N[(y / a), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if z < -5.4000000000000003e-100 or 6.5e5 < z

   1. Initial program 84.8%

      \[\frac{x - y \cdot z}{t - a \cdot z} \]

   2. Taylor expanded in z around inf

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

      1. lower-/.f64 35.5%

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

   4. Applied rewrites 35.5%

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

   if -5.4000000000000003e-100 < z < 6.5e5

   1. Initial program 84.8%

      \[\frac{x - y \cdot z}{t - a \cdot z} \]

   2. Taylor expanded in z around 0

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

      1. lower-/.f64 34.5%

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

   4. Applied rewrites 34.5%

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

Alternative 11: 34.5% accurate, 3.3× speedup

Math

\[\frac{x}{t} \]

FPCore

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

C

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

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)
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
    code = x / t
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_, t_, a_] := N[(x / t), $MachinePrecision]

Derivation

1. Initial program 84.8%

   \[\frac{x - y \cdot z}{t - a \cdot z} \]

2. Taylor expanded in z around 0

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

   1. lower-/.f64 34.5%

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

4. Applied rewrites 34.5%

   \[\leadsto \color{blue}{\frac{x}{t}} \]
5. Add Preprocessing

Reproduce

herbie shell --seed 2025212 
(FPCore (x y z t a)
  :name "Diagrams.Solve.Tridiagonal:solveTriDiagonal from diagrams-solve-0.1, A"
  :precision binary64
  (/ (- x (* y z)) (- t (* a z))))