Diagrams.Solve.Tridiagonal:solveCyclicTriDiagonal from diagrams-solve-0.1, B

Percentage Accurate: 74.7% → 89.7%

Time: 5.6s

Alternatives: 13

Speedup: 0.2×

Specification

Math

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

FPCore

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

C

double code(double x, double y, double z, double t, double a, double b) {
	return (x + ((y * z) / t)) / ((a + 1.0) + ((y * b) / 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, 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 + 1.0d0) + ((y * b) / t))
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 + 1.0) + ((y * b) / t));
}

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 74.7% accurate, 1.0× speedup

Math

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

FPCore

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

C

double code(double x, double y, double z, double t, double a, double b) {
	return (x + ((y * z) / t)) / ((a + 1.0) + ((y * b) / 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, 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 + 1.0d0) + ((y * b) / t))
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 + 1.0) + ((y * b) / t));
}

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 89.7% accurate, 0.2× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 5 regimes

2. if (/.f64 (+.f64 x (/.f64 (*.f64 y z) t)) (+.f64 (+.f64 a #s(literal 1 binary64)) (/.f64 (*.f64 y b) t))) < -inf.0

   1. Initial program 38.7%

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

   3. Taylor expanded in y around inf

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

      1. lower-/.f64 64.7

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

   5. Applied rewrites 64.7%

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

   6. Taylor expanded in z around inf

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

      1. lower-*.f64 N/A

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

      2. lower-+.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower-*.f64 N/A

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

      5. lower-+.f64 N/A

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

      6. lower-+.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. lift-*.f64 N/A

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

      9. lower-/.f64 N/A

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

      10. lower-*.f64 N/A

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

   8. Applied rewrites 86.1%

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

   9. Taylor expanded in x around 0

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

       1. lift-/.f64 N/A

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

       2. lift-*.f64 N/A

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

       3. lift-+.f64 N/A

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

       4. lift-+.f64 N/A

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

       5. lift-*.f64 N/A

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

       6. lift-/.f64 86.1

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

   11. Applied rewrites 86.1%

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

   if -inf.0 < (/.f64 (+.f64 x (/.f64 (*.f64 y z) t)) (+.f64 (+.f64 a #s(literal 1 binary64)) (/.f64 (*.f64 y b) t))) < -3.99999999999999983e-233

   1. Initial program 99.8%

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

   if -3.99999999999999983e-233 < (/.f64 (+.f64 x (/.f64 (*.f64 y z) t)) (+.f64 (+.f64 a #s(literal 1 binary64)) (/.f64 (*.f64 y b) t))) < 3.9999999999999997e-77

   1. Initial program 79.0%

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

      1. lift-+.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. +-commutative N/A

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

      4. lift-*.f64 N/A

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

      5. lift-/.f64 N/A

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

      6. +-commutative N/A

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

      7. associate-/l* N/A

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

      8. lower-fma.f64 N/A

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

      9. lower-/.f64 N/A

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

      10. lower-+.f64 89.0

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

   4. Applied rewrites 89.0%

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

   if 3.9999999999999997e-77 < (/.f64 (+.f64 x (/.f64 (*.f64 y z) t)) (+.f64 (+.f64 a #s(literal 1 binary64)) (/.f64 (*.f64 y b) t))) < +inf.0

   1. Initial program 82.8%

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

      1. lift-/.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. lift-/.f64 N/A

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

      5. lift-+.f64 N/A

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

      6. lift-+.f64 N/A

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

      7. lift-*.f64 N/A

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

      8. lift-/.f64 N/A

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

      9. div-add N/A

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

      10. +-commutative N/A

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

      11. *-commutative N/A

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

      12. associate-+r+ N/A

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

      13. +-commutative N/A

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

      14. *-commutative N/A

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

      15. associate-+r+ N/A

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

   4. Applied rewrites 95.0%

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

   if +inf.0 < (/.f64 (+.f64 x (/.f64 (*.f64 y z) t)) (+.f64 (+.f64 a #s(literal 1 binary64)) (/.f64 (*.f64 y b) t)))

   1. Initial program 0.0%

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

   3. Taylor expanded in y around inf

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

      1. lower-/.f64 92.2

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

   5. Applied rewrites 92.2%

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

Alternative 2: 91.1% accurate, 0.2× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 4 regimes

2. if (/.f64 (+.f64 x (/.f64 (*.f64 y z) t)) (+.f64 (+.f64 a #s(literal 1 binary64)) (/.f64 (*.f64 y b) t))) < -inf.0 or 1.00000000000000006e290 < (/.f64 (+.f64 x (/.f64 (*.f64 y z) t)) (+.f64 (+.f64 a #s(literal 1 binary64)) (/.f64 (*.f64 y b) t))) < +inf.0

   1. Initial program 29.8%

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

   3. Taylor expanded in y around inf

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

      1. lower-/.f64 49.4

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

   5. Applied rewrites 49.4%

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

   6. Taylor expanded in z around inf

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

      1. lower-*.f64 N/A

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

      2. lower-+.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower-*.f64 N/A

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

      5. lower-+.f64 N/A

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

      6. lower-+.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. lift-*.f64 N/A

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

      9. lower-/.f64 N/A

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

      10. lower-*.f64 N/A

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

   8. Applied rewrites 92.6%

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

   9. Taylor expanded in x around 0

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

       1. lift-/.f64 N/A

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

       2. lift-*.f64 N/A

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

       3. lift-+.f64 N/A

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

       4. lift-+.f64 N/A

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

       5. lift-*.f64 N/A

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

       6. lift-/.f64 89.2

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

   11. Applied rewrites 89.2%

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

   if -inf.0 < (/.f64 (+.f64 x (/.f64 (*.f64 y z) t)) (+.f64 (+.f64 a #s(literal 1 binary64)) (/.f64 (*.f64 y b) t))) < -3.99999999999999983e-233

   1. Initial program 99.8%

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

   if -3.99999999999999983e-233 < (/.f64 (+.f64 x (/.f64 (*.f64 y z) t)) (+.f64 (+.f64 a #s(literal 1 binary64)) (/.f64 (*.f64 y b) t))) < 1.00000000000000006e290

   1. Initial program 86.4%

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

      1. lift-+.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. +-commutative N/A

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

      4. lift-*.f64 N/A

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

      5. lift-/.f64 N/A

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

      6. +-commutative N/A

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

      7. associate-/l* N/A

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

      8. lower-fma.f64 N/A

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

      9. lower-/.f64 N/A

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

      10. lower-+.f64 90.7

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

   4. Applied rewrites 90.7%

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

   if +inf.0 < (/.f64 (+.f64 x (/.f64 (*.f64 y z) t)) (+.f64 (+.f64 a #s(literal 1 binary64)) (/.f64 (*.f64 y b) t)))

   1. Initial program 0.0%

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

   3. Taylor expanded in y around inf

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

      1. lower-/.f64 92.2

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

   5. Applied rewrites 92.2%

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

Alternative 3: 60.4% accurate, 0.2× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (/.f64 (+.f64 x (/.f64 (*.f64 y z) t)) (+.f64 (+.f64 a #s(literal 1 binary64)) (/.f64 (*.f64 y b) t))) < -inf.0 or 1.00000000000000006e290 < (/.f64 (+.f64 x (/.f64 (*.f64 y z) t)) (+.f64 (+.f64 a #s(literal 1 binary64)) (/.f64 (*.f64 y b) t)))

   1. Initial program 15.5%

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

   3. Taylor expanded in y around inf

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

      1. lower-/.f64 69.9

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

   5. Applied rewrites 69.9%

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

   if -inf.0 < (/.f64 (+.f64 x (/.f64 (*.f64 y z) t)) (+.f64 (+.f64 a #s(literal 1 binary64)) (/.f64 (*.f64 y b) t))) < -5.0000000000000001e-100 or -0.0 < (/.f64 (+.f64 x (/.f64 (*.f64 y z) t)) (+.f64 (+.f64 a #s(literal 1 binary64)) (/.f64 (*.f64 y b) t))) < 1.00000000000000006e290

   1. Initial program 99.8%

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

   3. Taylor expanded in y around 0

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

      1. lower-/.f64 N/A

         \[\leadsto \frac{x}{\color{blue}{1 + a}} \]

      2. lower-+.f64 57.9

         \[\leadsto \frac{x}{1 + \color{blue}{a}} \]

   5. Applied rewrites 57.9%

      \[\leadsto \color{blue}{\frac{x}{1 + a}} \]

   if -5.0000000000000001e-100 < (/.f64 (+.f64 x (/.f64 (*.f64 y z) t)) (+.f64 (+.f64 a #s(literal 1 binary64)) (/.f64 (*.f64 y b) t))) < -0.0

   1. Initial program 75.7%

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

   3. Taylor expanded in x around inf

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

      1. lower-/.f64 N/A

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

      2. associate-+r+ N/A

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

      3. *-commutative N/A

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

      4. +-commutative N/A

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

      5. *-commutative N/A

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

      6. associate-/l* N/A

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

      7. lower-fma.f64 N/A

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

      8. lower-/.f64 N/A

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

      9. lower-+.f64 73.4

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

   5. Applied rewrites 73.4%

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

   6. Taylor expanded in a around inf

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

   8. Applied rewrites 68.3%

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

Alternative 4: 89.4% accurate, 0.2× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (/.f64 (+.f64 x (/.f64 (*.f64 y z) t)) (+.f64 (+.f64 a #s(literal 1 binary64)) (/.f64 (*.f64 y b) t))) < -inf.0 or 1.00000000000000006e290 < (/.f64 (+.f64 x (/.f64 (*.f64 y z) t)) (+.f64 (+.f64 a #s(literal 1 binary64)) (/.f64 (*.f64 y b) t))) < +inf.0

   1. Initial program 29.8%

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

   3. Taylor expanded in y around inf

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

      1. lower-/.f64 49.4

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

   5. Applied rewrites 49.4%

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

   6. Taylor expanded in z around inf

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

      1. lower-*.f64 N/A

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

      2. lower-+.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower-*.f64 N/A

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

      5. lower-+.f64 N/A

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

      6. lower-+.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. lift-*.f64 N/A

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

      9. lower-/.f64 N/A

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

      10. lower-*.f64 N/A

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

   8. Applied rewrites 92.6%

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

   9. Taylor expanded in x around 0

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

       1. lift-/.f64 N/A

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

       2. lift-*.f64 N/A

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

       3. lift-+.f64 N/A

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

       4. lift-+.f64 N/A

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

       5. lift-*.f64 N/A

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

       6. lift-/.f64 89.2

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

   11. Applied rewrites 89.2%

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

   if -inf.0 < (/.f64 (+.f64 x (/.f64 (*.f64 y z) t)) (+.f64 (+.f64 a #s(literal 1 binary64)) (/.f64 (*.f64 y b) t))) < 1.00000000000000006e290

   1. Initial program 91.0%

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

      1. lift-+.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. +-commutative N/A

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

      4. lift-*.f64 N/A

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

      5. lift-/.f64 N/A

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

      6. +-commutative N/A

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

      7. associate-/l* N/A

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

      8. lower-fma.f64 N/A

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

      9. lower-/.f64 N/A

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

      10. lower-+.f64 90.6

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

   4. Applied rewrites 90.6%

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

   if +inf.0 < (/.f64 (+.f64 x (/.f64 (*.f64 y z) t)) (+.f64 (+.f64 a #s(literal 1 binary64)) (/.f64 (*.f64 y b) t)))

   1. Initial program 0.0%

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

   3. Taylor expanded in y around inf

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

      1. lower-/.f64 92.2

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

   5. Applied rewrites 92.2%

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

Alternative 5: 67.9% accurate, 0.4× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (/.f64 (+.f64 x (/.f64 (*.f64 y z) t)) (+.f64 (+.f64 a #s(literal 1 binary64)) (/.f64 (*.f64 y b) t))) < -inf.0

   1. Initial program 38.7%

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

      1. lift-/.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. lift-/.f64 N/A

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

      5. lift-+.f64 N/A

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

      6. lift-+.f64 N/A

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

      7. lift-*.f64 N/A

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

      8. lift-/.f64 N/A

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

      9. div-add N/A

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

      10. +-commutative N/A

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

      11. *-commutative N/A

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

      12. associate-+r+ N/A

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

      13. +-commutative N/A

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

      14. *-commutative N/A

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

      15. associate-+r+ N/A

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

   4. Applied rewrites 65.4%

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

   5. Taylor expanded in b around inf

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

      1. lower-/.f64 N/A

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

      2. lower-+.f64 N/A

         \[\leadsto \frac{z + \frac{t \cdot x}{y}}{b} \]

      3. lower-/.f64 N/A

         \[\leadsto \frac{z + \frac{t \cdot x}{y}}{b} \]

      4. lower-*.f64 71.9

         \[\leadsto \frac{z + \frac{t \cdot x}{y}}{b} \]

   7. Applied rewrites 71.9%

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

   if -inf.0 < (/.f64 (+.f64 x (/.f64 (*.f64 y z) t)) (+.f64 (+.f64 a #s(literal 1 binary64)) (/.f64 (*.f64 y b) t))) < 1.00000000000000006e290

   1. Initial program 91.0%

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

   3. Taylor expanded in x around inf

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

      1. lower-/.f64 N/A

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

      2. associate-+r+ N/A

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

      3. *-commutative N/A

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

      4. +-commutative N/A

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

      5. *-commutative N/A

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

      6. associate-/l* N/A

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

      7. lower-fma.f64 N/A

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

      8. lower-/.f64 N/A

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

      9. lower-+.f64 69.7

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

   5. Applied rewrites 69.7%

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

   if 1.00000000000000006e290 < (/.f64 (+.f64 x (/.f64 (*.f64 y z) t)) (+.f64 (+.f64 a #s(literal 1 binary64)) (/.f64 (*.f64 y b) t)))

   1. Initial program 6.9%

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

   3. Taylor expanded in y around inf

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

      1. lower-/.f64 71.9

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

   5. Applied rewrites 71.9%

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

4. Final simplification 70.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{x + \frac{y \cdot z}{t}}{\left(a + 1\right) + \frac{y \cdot b}{t}} \leq -\infty:\\ \;\;\;\;\frac{z + \frac{t \cdot x}{y}}{b}\\ \mathbf{elif}\;\frac{x + \frac{y \cdot z}{t}}{\left(a + 1\right) + \frac{y \cdot b}{t}} \leq 10^{+290}:\\ \;\;\;\;\frac{x}{\mathsf{fma}\left(b, \frac{y}{t}, 1 + a\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{z}{b}\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 68.7% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;t \leq -28000000000000:\\ \;\;\;\;\frac{\mathsf{fma}\left(y, \frac{z}{t}, x\right)}{1 + a}\\ \mathbf{elif}\;t \leq 1.12 \cdot 10^{-103}:\\ \;\;\;\;\frac{z + \frac{t \cdot x}{y}}{b}\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{1 + a} + \frac{y}{t} \cdot \frac{z}{1 + a}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (<= t -28000000000000.0)
   (/ (fma y (/ z t) x) (+ 1.0 a))
   (if (<= t 1.12e-103)
     (/ (+ z (/ (* t x) y)) b)
     (+ (/ x (+ 1.0 a)) (* (/ y t) (/ z (+ 1.0 a)))))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (t <= -28000000000000.0) {
		tmp = fma(y, (z / t), x) / (1.0 + a);
	} else if (t <= 1.12e-103) {
		tmp = (z + ((t * x) / y)) / b;
	} else {
		tmp = (x / (1.0 + a)) + ((y / t) * (z / (1.0 + a)));
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if (t <= -28000000000000.0)
		tmp = Float64(fma(y, Float64(z / t), x) / Float64(1.0 + a));
	elseif (t <= 1.12e-103)
		tmp = Float64(Float64(z + Float64(Float64(t * x) / y)) / b);
	else
		tmp = Float64(Float64(x / Float64(1.0 + a)) + Float64(Float64(y / t) * Float64(z / Float64(1.0 + a))));
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[LessEqual[t, -28000000000000.0], N[(N[(y * N[(z / t), $MachinePrecision] + x), $MachinePrecision] / N[(1.0 + a), $MachinePrecision]), $MachinePrecision], If[LessEqual[t, 1.12e-103], N[(N[(z + N[(N[(t * x), $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision] / b), $MachinePrecision], N[(N[(x / N[(1.0 + a), $MachinePrecision]), $MachinePrecision] + N[(N[(y / t), $MachinePrecision] * N[(z / N[(1.0 + a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if t < -2.8e13

   1. Initial program 80.9%

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

   3. Taylor expanded in b around 0

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

      1. lower-/.f64 N/A

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

      2. +-commutative N/A

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

      3. associate-/l* N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-+.f64 81.5

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

   5. Applied rewrites 81.5%

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

   if -2.8e13 < t < 1.12e-103

   1. Initial program 68.6%

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

      1. lift-/.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. lift-/.f64 N/A

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

      5. lift-+.f64 N/A

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

      6. lift-+.f64 N/A

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

      7. lift-*.f64 N/A

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

      8. lift-/.f64 N/A

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

      9. div-add N/A

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

      10. +-commutative N/A

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

      11. *-commutative N/A

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

      12. associate-+r+ N/A

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

      13. +-commutative N/A

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

      14. *-commutative N/A

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

      15. associate-+r+ N/A

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

   4. Applied rewrites 66.9%

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

   5. Taylor expanded in b around inf

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

      1. lower-/.f64 N/A

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

      2. lower-+.f64 N/A

         \[\leadsto \frac{z + \frac{t \cdot x}{y}}{b} \]

      3. lower-/.f64 N/A

         \[\leadsto \frac{z + \frac{t \cdot x}{y}}{b} \]

      4. lower-*.f64 70.5

         \[\leadsto \frac{z + \frac{t \cdot x}{y}}{b} \]

   7. Applied rewrites 70.5%

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

   if 1.12e-103 < t

   1. Initial program 79.5%

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

      1. lift-/.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. lift-/.f64 N/A

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

      5. lift-+.f64 N/A

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

      6. lift-+.f64 N/A

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

      7. lift-*.f64 N/A

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

      8. lift-/.f64 N/A

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

      9. div-add N/A

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

      10. +-commutative N/A

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

      11. *-commutative N/A

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

      12. associate-+r+ N/A

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

      13. +-commutative N/A

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

      14. *-commutative N/A

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

      15. associate-+r+ N/A

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

   4. Applied rewrites 88.1%

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

   5. Taylor expanded in b around 0

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

      1. lower-+.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. lift-+.f64 N/A

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

      4. times-frac N/A

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

      5. lower-*.f64 N/A

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

      6. lift-/.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. lift-+.f64 75.0

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

   7. Applied rewrites 75.0%

      \[\leadsto \color{blue}{\frac{x}{1 + a} + \frac{y}{t} \cdot \frac{z}{1 + a}} \]
3. Recombined 3 regimes into one program.

4. Final simplification 75.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;t \leq -28000000000000:\\ \;\;\;\;\frac{\mathsf{fma}\left(y, \frac{z}{t}, x\right)}{1 + a}\\ \mathbf{elif}\;t \leq 1.12 \cdot 10^{-103}:\\ \;\;\;\;\frac{z + \frac{t \cdot x}{y}}{b}\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{1 + a} + \frac{y}{t} \cdot \frac{z}{1 + a}\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 68.5% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;t \leq -28000000000000 \lor \neg \left(t \leq 1.12 \cdot 10^{-103}\right):\\ \;\;\;\;\frac{\mathsf{fma}\left(y, \frac{z}{t}, x\right)}{1 + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{z + \frac{t \cdot x}{y}}{b}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (or (<= t -28000000000000.0) (not (<= t 1.12e-103)))
   (/ (fma y (/ z t) x) (+ 1.0 a))
   (/ (+ z (/ (* t x) y)) b)))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((t <= -28000000000000.0) || !(t <= 1.12e-103)) {
		tmp = fma(y, (z / t), x) / (1.0 + a);
	} else {
		tmp = (z + ((t * x) / y)) / b;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if ((t <= -28000000000000.0) || !(t <= 1.12e-103))
		tmp = Float64(fma(y, Float64(z / t), x) / Float64(1.0 + a));
	else
		tmp = Float64(Float64(z + Float64(Float64(t * x) / y)) / b);
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[Or[LessEqual[t, -28000000000000.0], N[Not[LessEqual[t, 1.12e-103]], $MachinePrecision]], N[(N[(y * N[(z / t), $MachinePrecision] + x), $MachinePrecision] / N[(1.0 + a), $MachinePrecision]), $MachinePrecision], N[(N[(z + N[(N[(t * x), $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision] / b), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if t < -2.8e13 or 1.12e-103 < t

   1. Initial program 80.2%

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

   3. Taylor expanded in b around 0

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

      1. lower-/.f64 N/A

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

      2. +-commutative N/A

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

      3. associate-/l* N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-+.f64 78.1

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

   5. Applied rewrites 78.1%

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

   if -2.8e13 < t < 1.12e-103

   1. Initial program 68.6%

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

      1. lift-/.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. lift-/.f64 N/A

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

      5. lift-+.f64 N/A

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

      6. lift-+.f64 N/A

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

      7. lift-*.f64 N/A

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

      8. lift-/.f64 N/A

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

      9. div-add N/A

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

      10. +-commutative N/A

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

      11. *-commutative N/A

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

      12. associate-+r+ N/A

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

      13. +-commutative N/A

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

      14. *-commutative N/A

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

      15. associate-+r+ N/A

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

   4. Applied rewrites 66.9%

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

   5. Taylor expanded in b around inf

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

      1. lower-/.f64 N/A

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

      2. lower-+.f64 N/A

         \[\leadsto \frac{z + \frac{t \cdot x}{y}}{b} \]

      3. lower-/.f64 N/A

         \[\leadsto \frac{z + \frac{t \cdot x}{y}}{b} \]

      4. lower-*.f64 70.5

         \[\leadsto \frac{z + \frac{t \cdot x}{y}}{b} \]

   7. Applied rewrites 70.5%

      \[\leadsto \color{blue}{\frac{z + \frac{t \cdot x}{y}}{b}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 75.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;t \leq -28000000000000 \lor \neg \left(t \leq 1.12 \cdot 10^{-103}\right):\\ \;\;\;\;\frac{\mathsf{fma}\left(y, \frac{z}{t}, x\right)}{1 + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{z + \frac{t \cdot x}{y}}{b}\\ \end{array} \]
5. Add Preprocessing

Alternative 8: 60.5% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;t \leq -2.4 \cdot 10^{+15} \lor \neg \left(t \leq 7.6 \cdot 10^{-74}\right):\\ \;\;\;\;\frac{x}{1 + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{z + \frac{t \cdot x}{y}}{b}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (or (<= t -2.4e+15) (not (<= t 7.6e-74)))
   (/ x (+ 1.0 a))
   (/ (+ z (/ (* t x) y)) b)))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((t <= -2.4e+15) || !(t <= 7.6e-74)) {
		tmp = x / (1.0 + a);
	} else {
		tmp = (z + ((t * x) / y)) / 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 ((t <= (-2.4d+15)) .or. (.not. (t <= 7.6d-74))) then
        tmp = x / (1.0d0 + a)
    else
        tmp = (z + ((t * x) / y)) / 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 ((t <= -2.4e+15) || !(t <= 7.6e-74)) {
		tmp = x / (1.0 + a);
	} else {
		tmp = (z + ((t * x) / y)) / b;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	tmp = 0
	if (t <= -2.4e+15) or not (t <= 7.6e-74):
		tmp = x / (1.0 + a)
	else:
		tmp = (z + ((t * x) / y)) / b
	return tmp

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if ((t <= -2.4e+15) || !(t <= 7.6e-74))
		tmp = Float64(x / Float64(1.0 + a));
	else
		tmp = Float64(Float64(z + Float64(Float64(t * x) / y)) / b);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if ((t <= -2.4e+15) || ~((t <= 7.6e-74)))
		tmp = x / (1.0 + a);
	else
		tmp = (z + ((t * x) / y)) / b;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[Or[LessEqual[t, -2.4e+15], N[Not[LessEqual[t, 7.6e-74]], $MachinePrecision]], N[(x / N[(1.0 + a), $MachinePrecision]), $MachinePrecision], N[(N[(z + N[(N[(t * x), $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision] / b), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if t < -2.4e15 or 7.5999999999999993e-74 < t

   1. Initial program 79.8%

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

   3. Taylor expanded in y around 0

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

      1. lower-/.f64 N/A

         \[\leadsto \frac{x}{\color{blue}{1 + a}} \]

      2. lower-+.f64 61.8

         \[\leadsto \frac{x}{1 + \color{blue}{a}} \]

   5. Applied rewrites 61.8%

      \[\leadsto \color{blue}{\frac{x}{1 + a}} \]

   if -2.4e15 < t < 7.5999999999999993e-74

   1. Initial program 70.0%

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

      1. lift-/.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. lift-/.f64 N/A

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

      5. lift-+.f64 N/A

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

      6. lift-+.f64 N/A

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

      7. lift-*.f64 N/A

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

      8. lift-/.f64 N/A

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

      9. div-add N/A

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

      10. +-commutative N/A

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

      11. *-commutative N/A

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

      12. associate-+r+ N/A

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

      13. +-commutative N/A

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

      14. *-commutative N/A

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

      15. associate-+r+ N/A

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

   4. Applied rewrites 68.4%

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

   5. Taylor expanded in b around inf

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

      1. lower-/.f64 N/A

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

      2. lower-+.f64 N/A

         \[\leadsto \frac{z + \frac{t \cdot x}{y}}{b} \]

      3. lower-/.f64 N/A

         \[\leadsto \frac{z + \frac{t \cdot x}{y}}{b} \]

      4. lower-*.f64 68.7

         \[\leadsto \frac{z + \frac{t \cdot x}{y}}{b} \]

   7. Applied rewrites 68.7%

      \[\leadsto \color{blue}{\frac{z + \frac{t \cdot x}{y}}{b}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 64.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;t \leq -2.4 \cdot 10^{+15} \lor \neg \left(t \leq 7.6 \cdot 10^{-74}\right):\\ \;\;\;\;\frac{x}{1 + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{z + \frac{t \cdot x}{y}}{b}\\ \end{array} \]
5. Add Preprocessing

Alternative 9: 55.0% accurate, 1.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;t \leq -28000000000000 \lor \neg \left(t \leq 7 \cdot 10^{-74}\right):\\ \;\;\;\;\frac{x}{1 + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{\mathsf{fma}\left(t, x, y \cdot z\right)}{b \cdot y}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (or (<= t -28000000000000.0) (not (<= t 7e-74)))
   (/ x (+ 1.0 a))
   (/ (fma t x (* y z)) (* b y))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((t <= -28000000000000.0) || !(t <= 7e-74)) {
		tmp = x / (1.0 + a);
	} else {
		tmp = fma(t, x, (y * z)) / (b * y);
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if ((t <= -28000000000000.0) || !(t <= 7e-74))
		tmp = Float64(x / Float64(1.0 + a));
	else
		tmp = Float64(fma(t, x, Float64(y * z)) / Float64(b * y));
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[Or[LessEqual[t, -28000000000000.0], N[Not[LessEqual[t, 7e-74]], $MachinePrecision]], N[(x / N[(1.0 + a), $MachinePrecision]), $MachinePrecision], N[(N[(t * x + N[(y * z), $MachinePrecision]), $MachinePrecision] / N[(b * y), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if t < -2.8e13 or 7.00000000000000029e-74 < t

   1. Initial program 79.8%

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

   3. Taylor expanded in y around 0

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

      1. lower-/.f64 N/A

         \[\leadsto \frac{x}{\color{blue}{1 + a}} \]

      2. lower-+.f64 61.8

         \[\leadsto \frac{x}{1 + \color{blue}{a}} \]

   5. Applied rewrites 61.8%

      \[\leadsto \color{blue}{\frac{x}{1 + a}} \]

   if -2.8e13 < t < 7.00000000000000029e-74

   1. Initial program 70.0%

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

   3. Taylor expanded in b around inf

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

      1. lower-/.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. +-commutative N/A

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

      5. associate-/l* N/A

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

      6. lower-fma.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. lower-*.f64 43.7

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

   5. Applied rewrites 43.7%

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

   6. Taylor expanded in x around 0

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

      1. lower-fma.f64 N/A

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

      2. lift-*.f64 56.3

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

   8. Applied rewrites 56.3%

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

4. Final simplification 59.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;t \leq -28000000000000 \lor \neg \left(t \leq 7 \cdot 10^{-74}\right):\\ \;\;\;\;\frac{x}{1 + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{\mathsf{fma}\left(t, x, y \cdot z\right)}{b \cdot y}\\ \end{array} \]
5. Add Preprocessing

Alternative 10: 42.2% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a + 1 \leq -5 \cdot 10^{+43} \lor \neg \left(a + 1 \leq 5 \cdot 10^{+151}\right):\\ \;\;\;\;\frac{x}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{z}{b}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (or (<= (+ a 1.0) -5e+43) (not (<= (+ a 1.0) 5e+151))) (/ x a) (/ z b)))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (((a + 1.0) <= -5e+43) || !((a + 1.0) <= 5e+151)) {
		tmp = x / a;
	} else {
		tmp = z / 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 (((a + 1.0d0) <= (-5d+43)) .or. (.not. ((a + 1.0d0) <= 5d+151))) then
        tmp = x / a
    else
        tmp = z / 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 (((a + 1.0) <= -5e+43) || !((a + 1.0) <= 5e+151)) {
		tmp = x / a;
	} else {
		tmp = z / b;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	tmp = 0
	if ((a + 1.0) <= -5e+43) or not ((a + 1.0) <= 5e+151):
		tmp = x / a
	else:
		tmp = z / b
	return tmp

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if ((Float64(a + 1.0) <= -5e+43) || !(Float64(a + 1.0) <= 5e+151))
		tmp = Float64(x / a);
	else
		tmp = Float64(z / b);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if (((a + 1.0) <= -5e+43) || ~(((a + 1.0) <= 5e+151)))
		tmp = x / a;
	else
		tmp = z / b;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[Or[LessEqual[N[(a + 1.0), $MachinePrecision], -5e+43], N[Not[LessEqual[N[(a + 1.0), $MachinePrecision], 5e+151]], $MachinePrecision]], N[(x / a), $MachinePrecision], N[(z / b), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (+.f64 a #s(literal 1 binary64)) < -5.0000000000000004e43 or 5.0000000000000002e151 < (+.f64 a #s(literal 1 binary64))

   1. Initial program 75.6%

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

   3. Taylor expanded in x around inf

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

      1. lower-/.f64 N/A

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

      2. associate-+r+ N/A

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

      3. *-commutative N/A

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

      4. +-commutative N/A

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

      5. *-commutative N/A

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

      6. associate-/l* N/A

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

      7. lower-fma.f64 N/A

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

      8. lower-/.f64 N/A

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

      9. lower-+.f64 67.3

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

   5. Applied rewrites 67.3%

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

   6. Taylor expanded in a around inf

      \[\leadsto \frac{x}{a} \]
   7. Step-by-step derivation

   8. Applied rewrites 61.1%

      \[\leadsto \frac{x}{a} \]

   if -5.0000000000000004e43 < (+.f64 a #s(literal 1 binary64)) < 5.0000000000000002e151

   1. Initial program 75.7%

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

   3. Taylor expanded in y around inf

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

      1. lower-/.f64 38.4

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

   5. Applied rewrites 38.4%

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

4. Final simplification 46.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;a + 1 \leq -5 \cdot 10^{+43} \lor \neg \left(a + 1 \leq 5 \cdot 10^{+151}\right):\\ \;\;\;\;\frac{x}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{z}{b}\\ \end{array} \]
5. Add Preprocessing

Alternative 11: 41.1% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a + 1 \leq 0.9999999999999998 \lor \neg \left(a + 1 \leq 2\right):\\ \;\;\;\;\frac{x}{a}\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (or (<= (+ a 1.0) 0.9999999999999998) (not (<= (+ a 1.0) 2.0)))
   (/ x a)
   x))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (((a + 1.0) <= 0.9999999999999998) || !((a + 1.0) <= 2.0)) {
		tmp = x / a;
	} 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 (((a + 1.0d0) <= 0.9999999999999998d0) .or. (.not. ((a + 1.0d0) <= 2.0d0))) then
        tmp = x / a
    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 (((a + 1.0) <= 0.9999999999999998) || !((a + 1.0) <= 2.0)) {
		tmp = x / a;
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	tmp = 0
	if ((a + 1.0) <= 0.9999999999999998) or not ((a + 1.0) <= 2.0):
		tmp = x / a
	else:
		tmp = x
	return tmp

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if ((Float64(a + 1.0) <= 0.9999999999999998) || !(Float64(a + 1.0) <= 2.0))
		tmp = Float64(x / a);
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if (((a + 1.0) <= 0.9999999999999998) || ~(((a + 1.0) <= 2.0)))
		tmp = x / a;
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[Or[LessEqual[N[(a + 1.0), $MachinePrecision], 0.9999999999999998], N[Not[LessEqual[N[(a + 1.0), $MachinePrecision], 2.0]], $MachinePrecision]], N[(x / a), $MachinePrecision], x]

Derivation

1. Split input into 2 regimes

2. if (+.f64 a #s(literal 1 binary64)) < 0.99999999999999978 or 2 < (+.f64 a #s(literal 1 binary64))

   1. Initial program 71.4%

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

   3. Taylor expanded in x around inf

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

      1. lower-/.f64 N/A

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

      2. associate-+r+ N/A

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

      3. *-commutative N/A

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

      4. +-commutative N/A

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

      5. *-commutative N/A

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

      6. associate-/l* N/A

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

      7. lower-fma.f64 N/A

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

      8. lower-/.f64 N/A

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

      9. lower-+.f64 58.4

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

   5. Applied rewrites 58.4%

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

   6. Taylor expanded in a around inf

      \[\leadsto \frac{x}{a} \]
   7. Step-by-step derivation

   8. Applied rewrites 47.3%

      \[\leadsto \frac{x}{a} \]

   if 0.99999999999999978 < (+.f64 a #s(literal 1 binary64)) < 2

   1. Initial program 81.1%

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

   3. Taylor expanded in y around 0

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

      1. lower-/.f64 N/A

         \[\leadsto \frac{x}{\color{blue}{1 + a}} \]

      2. lower-+.f64 40.4

         \[\leadsto \frac{x}{1 + \color{blue}{a}} \]

   5. Applied rewrites 40.4%

      \[\leadsto \color{blue}{\frac{x}{1 + a}} \]

   6. Taylor expanded in a around 0

      \[\leadsto x \]
   7. Step-by-step derivation

   8. Applied rewrites 39.7%

      \[\leadsto x \]
3. Recombined 2 regimes into one program.

4. Final simplification 43.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;a + 1 \leq 0.9999999999999998 \lor \neg \left(a + 1 \leq 2\right):\\ \;\;\;\;\frac{x}{a}\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \]
5. Add Preprocessing

Alternative 12: 55.6% accurate, 2.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;t \leq -42000000000000 \lor \neg \left(t \leq 4.6 \cdot 10^{-82}\right):\\ \;\;\;\;\frac{x}{1 + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{z}{b}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (or (<= t -42000000000000.0) (not (<= t 4.6e-82)))
   (/ x (+ 1.0 a))
   (/ z b)))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((t <= -42000000000000.0) || !(t <= 4.6e-82)) {
		tmp = x / (1.0 + a);
	} else {
		tmp = z / 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 ((t <= (-42000000000000.0d0)) .or. (.not. (t <= 4.6d-82))) then
        tmp = x / (1.0d0 + a)
    else
        tmp = z / 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 ((t <= -42000000000000.0) || !(t <= 4.6e-82)) {
		tmp = x / (1.0 + a);
	} else {
		tmp = z / b;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	tmp = 0
	if (t <= -42000000000000.0) or not (t <= 4.6e-82):
		tmp = x / (1.0 + a)
	else:
		tmp = z / b
	return tmp

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if ((t <= -42000000000000.0) || !(t <= 4.6e-82))
		tmp = Float64(x / Float64(1.0 + a));
	else
		tmp = Float64(z / b);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if ((t <= -42000000000000.0) || ~((t <= 4.6e-82)))
		tmp = x / (1.0 + a);
	else
		tmp = z / b;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[Or[LessEqual[t, -42000000000000.0], N[Not[LessEqual[t, 4.6e-82]], $MachinePrecision]], N[(x / N[(1.0 + a), $MachinePrecision]), $MachinePrecision], N[(z / b), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if t < -4.2e13 or 4.59999999999999994e-82 < t

   1. Initial program 80.0%

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

   3. Taylor expanded in y around 0

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

      1. lower-/.f64 N/A

         \[\leadsto \frac{x}{\color{blue}{1 + a}} \]

      2. lower-+.f64 61.7

         \[\leadsto \frac{x}{1 + \color{blue}{a}} \]

   5. Applied rewrites 61.7%

      \[\leadsto \color{blue}{\frac{x}{1 + a}} \]

   if -4.2e13 < t < 4.59999999999999994e-82

   1. Initial program 69.4%

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

   3. Taylor expanded in y around inf

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

      1. lower-/.f64 55.9

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

   5. Applied rewrites 55.9%

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

4. Final simplification 59.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;t \leq -42000000000000 \lor \neg \left(t \leq 4.6 \cdot 10^{-82}\right):\\ \;\;\;\;\frac{x}{1 + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{z}{b}\\ \end{array} \]
5. Add Preprocessing

Alternative 13: 19.5% accurate, 53.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 75.7%

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

3. Taylor expanded in y around 0

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

   1. lower-/.f64 N/A

      \[\leadsto \frac{x}{\color{blue}{1 + a}} \]

   2. lower-+.f64 44.4

      \[\leadsto \frac{x}{1 + \color{blue}{a}} \]

5. Applied rewrites 44.4%

   \[\leadsto \color{blue}{\frac{x}{1 + a}} \]

6. Taylor expanded in a around 0

   \[\leadsto x \]
7. Step-by-step derivation

8. Applied rewrites 19.7%

   \[\leadsto x \]
9. Add Preprocessing

Developer Target 1: 78.4% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := 1 \cdot \left(\left(x + \frac{y}{t} \cdot z\right) \cdot \frac{1}{\left(a + 1\right) + \frac{y}{t} \cdot b}\right)\\ \mathbf{if}\;t < -1.3659085366310088 \cdot 10^{-271}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t < 3.036967103737246 \cdot 10^{-130}:\\ \;\;\;\;\frac{z}{b}\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1
         (* 1.0 (* (+ x (* (/ y t) z)) (/ 1.0 (+ (+ a 1.0) (* (/ y t) b)))))))
   (if (< t -1.3659085366310088e-271)
     t_1
     (if (< t 3.036967103737246e-130) (/ z b) t_1))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = 1.0 * ((x + ((y / t) * z)) * (1.0 / ((a + 1.0) + ((y / t) * b))));
	double tmp;
	if (t < -1.3659085366310088e-271) {
		tmp = t_1;
	} else if (t < 3.036967103737246e-130) {
		tmp = z / 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 = 1.0d0 * ((x + ((y / t) * z)) * (1.0d0 / ((a + 1.0d0) + ((y / t) * b))))
    if (t < (-1.3659085366310088d-271)) then
        tmp = t_1
    else if (t < 3.036967103737246d-130) then
        tmp = z / 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 = 1.0 * ((x + ((y / t) * z)) * (1.0 / ((a + 1.0) + ((y / t) * b))));
	double tmp;
	if (t < -1.3659085366310088e-271) {
		tmp = t_1;
	} else if (t < 3.036967103737246e-130) {
		tmp = z / b;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	t_1 = 1.0 * ((x + ((y / t) * z)) * (1.0 / ((a + 1.0) + ((y / t) * b))))
	tmp = 0
	if t < -1.3659085366310088e-271:
		tmp = t_1
	elif t < 3.036967103737246e-130:
		tmp = z / b
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z, t, a, b)
	t_1 = Float64(1.0 * Float64(Float64(x + Float64(Float64(y / t) * z)) * Float64(1.0 / Float64(Float64(a + 1.0) + Float64(Float64(y / t) * b)))))
	tmp = 0.0
	if (t < -1.3659085366310088e-271)
		tmp = t_1;
	elseif (t < 3.036967103737246e-130)
		tmp = Float64(z / b);
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	t_1 = 1.0 * ((x + ((y / t) * z)) * (1.0 / ((a + 1.0) + ((y / t) * b))));
	tmp = 0.0;
	if (t < -1.3659085366310088e-271)
		tmp = t_1;
	elseif (t < 3.036967103737246e-130)
		tmp = z / b;
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(1.0 * N[(N[(x + N[(N[(y / t), $MachinePrecision] * z), $MachinePrecision]), $MachinePrecision] * N[(1.0 / N[(N[(a + 1.0), $MachinePrecision] + N[(N[(y / t), $MachinePrecision] * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[Less[t, -1.3659085366310088e-271], t$95$1, If[Less[t, 3.036967103737246e-130], N[(z / b), $MachinePrecision], t$95$1]]]

Reproduce

herbie shell --seed 2025054 
(FPCore (x y z t a b)
  :name "Diagrams.Solve.Tridiagonal:solveCyclicTriDiagonal from diagrams-solve-0.1, B"
  :precision binary64

  :alt
  (! :herbie-platform default (if (< t -1707385670788761/12500000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) (* 1 (* (+ x (* (/ y t) z)) (/ 1 (+ (+ a 1) (* (/ y t) b))))) (if (< t 1518483551868623/5000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) (/ z b) (* 1 (* (+ x (* (/ y t) z)) (/ 1 (+ (+ a 1) (* (/ y t) b))))))))

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